/** {@inheritDoc} */ public long[] values() { long[] vals = new long[size()]; long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public Object[] keys() { //noinspection unchecked K[] keys = ( K[] ) new Object[size()]; Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked keys[j++] = ( K ) k[i]; } } return keys; }
/** {@inheritDoc} */ public long[] values( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { array[j++] = v[i]; } } if ( array.length > size ) { array[size] = no_entry_value; } return array; }
/** {@inheritDoc} */ public K[] keys( K[] a ) { int size = size(); if ( a.length < size ) { //noinspection unchecked a = ( K[] ) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size ); } Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked a[j++] = ( K ) k[i]; } } return a; }
if ( that.size() != this.size() ) { return false;
/** {@inheritDoc} */ public long[] values() { long[] vals = new long[size()]; long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public Object[] keys() { //noinspection unchecked K[] keys = ( K[] ) new Object[size()]; Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked keys[j++] = ( K ) k[i]; } } return keys; }
/** {@inheritDoc} */ public Object[] keys() { //noinspection unchecked K[] keys = ( K[] ) new Object[size()]; Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked keys[j++] = ( K ) k[i]; } } return keys; }
/** {@inheritDoc} */ public long[] values() { long[] vals = new long[size()]; long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public Object[] keys() { //noinspection unchecked K[] keys = ( K[] ) new Object[size()]; Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked keys[j++] = ( K ) k[i]; } } return keys; }
/** {@inheritDoc} */ public long[] values() { long[] vals = new long[size()]; long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ @Override @SuppressWarnings("unchecked") public Object[] keys() { //noinspection unchecked K[] keys = ( K[] ) new Object[size()]; Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked keys[j++] = ( K ) k[i]; } } return keys; }
/** {@inheritDoc} */ @Override public long[] values() { long[] vals = new long[size()]; long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { vals[j++] = v[i]; } } return vals; }
/** {@inheritDoc} */ public long[] values( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { array[j++] = v[i]; } } if ( array.length > size ) { array[size] = no_entry_value; } return array; }
/** {@inheritDoc} */ public long[] values( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { array[j++] = v[i]; } } if ( array.length > size ) { array[size] = no_entry_value; } return array; }
/** {@inheritDoc} */ public long[] values( long[] array ) { int size = size(); if ( array.length < size ) { array = new long[size]; } long[] v = _values; Object[] keys = _set; for ( int i = v.length, j = 0; i-- > 0; ) { if ( keys[i] != FREE && keys[i] != REMOVED ) { array[j++] = v[i]; } } if ( array.length > size ) { array[size] = no_entry_value; } return array; }
/** {@inheritDoc} */ public K[] keys( K[] a ) { int size = size(); if ( a.length < size ) { //noinspection unchecked a = ( K[] ) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size ); } Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked a[j++] = ( K ) k[i]; } } return a; }
/** {@inheritDoc} */ public K[] keys( K[] a ) { int size = size(); if ( a.length < size ) { //noinspection unchecked a = ( K[] ) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size ); } Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked a[j++] = ( K ) k[i]; } } return a; }
/** {@inheritDoc} */ public K[] keys( K[] a ) { int size = size(); if ( a.length < size ) { //noinspection unchecked a = ( K[] ) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size ); } Object[] k = _set; for ( int i = k.length, j = 0; i-- > 0; ) { if ( k[i] != FREE && k[i] != REMOVED ) { //noinspection unchecked a[j++] = ( K ) k[i]; } } return a; }
@Override public Object visit(Element element, int amount) { long val = elementMap.get(element); if (val < 0) { val = 1L << elementMap.size(); elementMap.put(element,val); } buf[0] |= val; return null; } });