/** {@inheritDoc} */ public int[] values() { int[] vals = new int[size()]; int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public long[] keys() { long[] keys = new long[size()]; long[] k = _set; byte[] states = _states; for ( int i = k.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { keys[j++] = k[i]; } } return keys; }
/** {@inheritDoc} */ public int[] values( int[] array ) { int size = size(); if ( array.length < size ) { array = new int[size]; } int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = v[i]; } } return array; }
/** {@inheritDoc} */ public long[] keys( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] keys = _set; byte[] states = _states; for ( int i = keys.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = keys[i]; } } return array; }
/** {@inheritDoc} */ @Override public boolean equals( Object other ) { if ( ! ( other instanceof TLongIntMap ) ) { return false; } TLongIntMap that = ( TLongIntMap ) other; if ( that.size() != this.size() ) { return false; } int[] values = _values; byte[] states = _states; int this_no_entry_value = getNoEntryValue(); int that_no_entry_value = that.getNoEntryValue(); for ( int i = values.length; i-- > 0; ) { if ( states[i] == FULL ) { long key = _set[i]; int that_value = that.get( key ); int this_value = values[i]; if ( ( this_value != that_value ) && ( this_value != this_no_entry_value ) && ( that_value != that_no_entry_value ) ) { return false; } } } return true; }
/** {@inheritDoc} */ public long[] keys() { long[] keys = new long[size()]; long[] k = _set; byte[] states = _states; for ( int i = k.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { keys[j++] = k[i]; } } return keys; }
/** {@inheritDoc} */ public int[] values() { int[] vals = new int[size()]; int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public int[] values() { int[] vals = new int[size()]; int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public long[] keys() { long[] keys = new long[size()]; long[] k = _set; byte[] states = _states; for ( int i = k.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { keys[j++] = k[i]; } } return keys; }
/** {@inheritDoc} */ public long[] keys( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] keys = _set; byte[] states = _states; for ( int i = keys.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = keys[i]; } } return array; }
/** {@inheritDoc} */ @Override public long[] keys() { long[] keys = new long[size()]; long[] k = _set; byte[] states = _states; for ( int i = k.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { keys[j++] = k[i]; } } return keys; }
/** {@inheritDoc} */ @Override public int[] values() { int[] vals = new int[size()]; int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public long[] keys() { long[] keys = new long[size()]; if ( keys.length == 0 ) { return keys; // nothing to copy } long[] k = _set; byte[] states = _states; for ( int i = k.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { keys[j++] = k[i]; } } return keys; }
public int size() { return hash.size(); }
/** {@inheritDoc} */ public int[] values( int[] array ) { int size = size(); if ( array.length < size ) { array = new int[size]; } int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = v[i]; } } return array; }
/** {@inheritDoc} */ public int[] values( int[] array ) { int size = size(); if ( array.length < size ) { array = new int[size]; } int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = v[i]; } } return array; }
/** {@inheritDoc} */ public int[] values() { int[] vals = new int[size()]; if ( vals.length == 0 ) { return vals; // nothing to copy } int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ @Override public int[] values( int[] array ) { int size = size(); if ( array.length < size ) { array = new int[size]; } int[] v = _values; byte[] states = _states; for ( int i = v.length, j = 0; i-- > 0; ) { if ( states[i] == FULL ) { array[j++] = v[i]; } } return array; }
@Override public String toString() { return "Size: " + hash.size() + "\tTotal: " + total() + "\tAvg: " + avg() + "\tMax: " + max(); }
public CircularFingerprinter.FP[] getFingerprintDetails() { final CircularFingerprinter.FP[] ary = new CircularFingerprinter.FP[HASH_SET.size()]; for (int k=0; k < circularFingerprinter.getFPCount(); ++k) { final CircularFingerprinter.FP fp = circularFingerprinter.getFP(k); if (HASH_SET.containsKey(fp.hashCode)) { ary[HASH_SET.get(fp.hashCode)] = fp; } } return ary; }