/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
public int size() { synchronized( mutex ) { return m.size(); } } public boolean isEmpty(){
public int size() { return m.size(); } public boolean isEmpty() { return m.isEmpty(); }
/** * Creates a new <code>TLongIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TLongIntMap</tt> that will be duplicated. */ public TLongIntHashMap( TLongIntMap map ) { super( map.size() ); if ( map instanceof TLongIntHashMap ) { TLongIntHashMap hashmap = ( TLongIntHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( long ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** {@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 void putAll( TLongIntMap map ) { ensureCapacity( map.size() ); TLongIntIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
public int size() { synchronized( mutex ) { return m.size(); } } public boolean isEmpty(){
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Returns the number of pairs that are currently being counted. */ public int size() { return counts.size(); }
@Override public int size() { synchronized( mutex ) { return m.size(); } } @Override
/** * Returns the number of pairs that are currently being counted. */ public int size() { return counts.size(); }
/** * Returns the number of entries in the map. * * @return the map's size. */ @Override public int size() { return this._map.size(); }
public int size() { synchronized( mutex ) { return m.size(); } } public boolean isEmpty(){
public void setPoints(int [] points) { if (hash != 0) wordParents[index] = points; points = ArrayUtils.add(points, index - wordIndexes.size()); if (left != null) left.setPoints(points); if (right != null) right.setPoints(points); }
/** {@inheritDoc} */ public void putAll( TLongIntMap map ) { ensureCapacity( map.size() ); TLongIntIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ @Override public void putAll( TLongIntMap map ) { ensureCapacity( map.size() ); TLongIntIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ @Override public void putAll( TLongIntMap map ) { ensureCapacity( map.size() ); TLongIntIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ public void putAll( TLongIntMap map ) { ensureCapacity( map.size() ); TLongIntIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }