/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Indicates whether map has any entries. * * @return true if the map is empty */ public boolean isEmpty() { return this._map.size() == 0; }
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>TObjectDoubleHashMap</code> that contains the entries * in the map passed to it. * * @param map the <tt>TObjectDoubleMap</tt> to be copied. */ public TObjectDoubleHashMap( TObjectDoubleMap<? extends K> map ) { this( map.size(), 0.5f, map.getNoEntryValue() ); if ( map instanceof TObjectDoubleHashMap ) { TObjectDoubleHashMap hashmap = ( TObjectDoubleHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_value != ( double ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** * Creates a new <code>TObjectDoubleCustomHashMap</code> that contains the entries * in the map passed to it. * * @param map the <tt>TObjectDoubleMap</tt> to be copied. */ public TObjectDoubleCustomHashMap( HashingStrategy<? super K> strategy, TObjectDoubleMap<? extends K> map ) { this( strategy, map.size(), 0.5f, map.getNoEntryValue() ); if ( map instanceof TObjectDoubleCustomHashMap ) { TObjectDoubleCustomHashMap hashmap = ( TObjectDoubleCustomHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_value = hashmap.no_entry_value; this.strategy = hashmap.strategy; //noinspection RedundantCast if ( this.no_entry_value != ( double ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
if ( that.size() != this.size() ) { return false;
if ( that.size() != this.size() ) { return false;
LOG.debug("Heuristric street search hit {} vertices.", vertices.size()); LOG.debug("Heuristric street search hit {} transit stops.", transitQueue.size()); return vertices;
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Indicates whether map has any entries. * * @return true if the map is empty */ public boolean isEmpty() { return this._map.size() == 0; }
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Indicates whether map has any entries. * * @return true if the map is empty */ @Override public boolean isEmpty() { return this._map.size() == 0; }
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
/** * Returns the number of instances that are currently being counted. */ public int size() { return counts.size(); }
public int size() { synchronized( mutex ) { return m.size(); } } public boolean isEmpty(){
/** * Indicates whether map has any entries. * * @return true if the map is empty */ public boolean isEmpty() { return this._map.size() == 0; }
@Override public int size() { synchronized( mutex ) { return m.size(); } } @Override
/** * Returns the number of entries in the map. * * @return the map's size. */ @Override public int size() { return this._map.size(); }
/** * Indicates whether map has any entries. * * @return true if the map is empty */ public boolean isEmpty() { return this._map.size() == 0; }