H A D | ConcurrentHashMap.java | 74 * {@code size}, {@code isEmpty}, and {@code containsValue} are typically 82 * the same slot modulo the table size), with the expected average 89 * good idea to provide a size estimate as an optional {@code 168 * argument. Methods proceed sequentially if the current map size is 265 * The table is lazily initialized to a power-of-two size upon the 305 * list size k are (exp(-0.5) * pow(0.5, k) / factorial(k)). The 488 * The largest possible (non-power of two) array size. 555 * The bit shift for recording size stamp in sizeCtl. 668 * Returns a power of two table size for the given desired capacity. 770 * when table is null, holds the initial table size t 888 public int size() { method in class:ConcurrentHashMap 2361 tryPresize(int size) argument 3330 Traverser(Node<K,V>[] tab, int size, int index, int limit) argument 3416 BaseIterator(Node<K,V>[] tab, int size, int index, int limit, ConcurrentHashMap<K,V> map) argument 3437 KeyIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument 3457 ValueIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument 3477 EntryIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument 3542 KeySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument 3581 ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument 3620 EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est, ConcurrentHashMap<K,V> map) argument 4422 public final int size() { return map.size(); } method in class:ConcurrentHashMap.CollectionView [all...] |