Lines Matching refs:len
305 private void setThreshold(int len) {
306 threshold = len * 2 / 3;
310 * Increment i modulo len.
312 private static int nextIndex(int i, int len) {
313 return ((i + 1 < len) ? i + 1 : 0);
317 * Decrement i modulo len.
319 private static int prevIndex(int i, int len) {
320 return ((i - 1 >= 0) ? i - 1 : len - 1);
344 int len = parentTable.length;
345 setThreshold(len);
346 table = new Entry[len];
348 for (int j = 0; j < len; j++) {
355 int h = key.threadLocalHashCode & (len - 1);
357 h = nextIndex(h, len);
395 int len = tab.length;
404 i = nextIndex(i, len);
424 int len = tab.length;
425 int i = key.threadLocalHashCode & (len-1);
429 e = tab[i = nextIndex(i, len)]) {
454 int len = tab.length;
455 int i = key.threadLocalHashCode & (len-1);
458 e = tab[i = nextIndex(i, len)]) {
485 int len = tab.length;
493 for (int i = prevIndex(staleSlot, len);
495 i = prevIndex(i, len))
501 for (int i = nextIndex(staleSlot, len);
503 i = nextIndex(i, len)) {
520 cleanSomeSlots(expungeStaleEntry(slotToExpunge), len);
537 cleanSomeSlots(expungeStaleEntry(slotToExpunge), len);
553 int len = tab.length;
563 for (i = nextIndex(staleSlot, len);
565 i = nextIndex(i, len)) {
572 int h = k.threadLocalHashCode & (len - 1);
579 h = nextIndex(h, len);
614 int len = tab.length;
616 i = nextIndex(i, len);
619 n = len;
676 int len = tab.length;
677 for (int j = 0; j < len; j++) {