/** * {@inheritDoc} */ @Override public long getNumberOfElements() { return map.size(); }
/** * Current count of elements in the set. Due to concurrent racing updates, * the size is only ever approximate. Updates due to the calling thread are * immediately visible to calling thread. * @return count of elements. */ @Override public int size() { return _map.size(); } /** Empty the set. */
@Override public long size() { return vertexStates.size(); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object k ) { return NonBlockingHashMapLong.this.containsKey(k); }
public int size() { return map.size(); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object v ) { return NonBlockingHashMapLong.this.containsValue(v); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object k ) { return NonBlockingHashMapLong.this.containsKey(k); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object v ) { return NonBlockingHashMapLong.this.containsValue(v); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object k ) { return NonBlockingHashMapLong.this.containsKey(k); }
public int size ( ) { return NonBlockingHashMapLong.this.size ( ); } public boolean contains( Object v ) { return NonBlockingHashMapLong.this.containsValue(v); }
/** * {@inheritDoc} */ @Override public long getComponentSize(IObjectSizes objectSizes) { int mapSize = map.size(); long size = objectSizes.getSizeOfObjectHeader(); size += objectSizes.getPrimitiveTypesSize(1, 0, 0, 0, 0, 0); size = objectSizes.alignTo8Bytes(size); // map size += objectSizes.getSizeOfNonBlockingHashMapLong(mapSize); // for each CustomWeakReference in a map size += map.size() * objectSizes.getSizeOfCustomWeakReference(); return size; // the size of the reference queue, runnable and future and not included, because they are // simply to small and its size is constant and does not depend on the number of elements in // the leaf }