Lines Matching refs:size
47 * <tt>HashMap</tt> instance (the number of buckets) plus its size (the number
164 transient int size;
167 * The next size value at which to resize (capacity * load factor).
253 this(Math.max((int) (m.size() / DEFAULT_LOAD_FACTOR) + 1,
315 public int size() {
316 return size;
325 return size == 0;
361 if (size == 0) {
389 if (size == 0) {
542 int numKeysToBeAdded = m.size();
553 * obvious condition is (m.size() + size) >= threshold, but this
594 if (size == 0) {
608 size--;
628 if (size == 0 || !(o instanceof Map.Entry))
642 size--;
664 size = 0;
715 size * Math.min(1 / loadFactor, 4.0f),
722 result.size = 0;
807 if ((size >= threshold) && (null != table[bucketIndex])) {
827 size++;
838 if (size > 0) { // advance to first entry
903 int est; // size estimate
916 final int getFence() { // initialize fence and size on first use
920 est = m.size;
1001 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
1074 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
1146 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
1190 public int size() {
1191 return size;
1209 if (size > 0 && (tab = table) != null) {
1248 public int size() {
1249 return size;
1264 if (size > 0 && (tab = table) != null) {
1321 public int size() {
1322 return size;
1334 if (size > 0 && (tab = table) != null) {
1355 if (size > 0 && (tab = table) != null) {
1375 if (size > 0 && (tab = table) != null) {
1393 * <i>size</i> (an int, the number of key-value
1411 // Write out size (number of Mappings)
1412 s.writeInt(size);
1415 if (size > 0) {