Searched refs:newLen (Results 1 – 5 of 5) sorted by relevance
685 int newLen = oldLen * 2; in resize() local686 Entry[] newTab = new Entry[newLen]; in resize()696 int h = k.threadLocalHashCode & (newLen - 1); in resize()698 h = nextIndex(h, newLen); in resize()705 setThreshold(newLen); in resize()
542 int newLen = len * 2; in loadConvert() local543 if (newLen < 0) { in loadConvert()544 newLen = Integer.MAX_VALUE; in loadConvert()546 convtBuf = new char[newLen]; in loadConvert()
585 int newLen = intLen + nInts +1; in leftShift() local587 newLen--; in leftShift()588 if (value.length < newLen) { in leftShift()590 int[] result = new int[newLen]; in leftShift()593 setValue(result, newLen); in leftShift()594 } else if (value.length - offset >= newLen) { in leftShift()596 for(int i=0; i < newLen - intLen; i++) in leftShift()602 for (int i=intLen; i < newLen; i++) in leftShift()606 intLen = newLen; in leftShift()1005 int newLen = xLen + yLen; in multiply() local[all …]
3592 int newLen = curLen << 1; in expandBigIntegerTenPowers() local3593 while (newLen <= n) in expandBigIntegerTenPowers()3594 newLen <<= 1; in expandBigIntegerTenPowers()3595 pows = Arrays.copyOf(pows, newLen); in expandBigIntegerTenPowers()3596 for (int i = curLen; i < newLen; i++) in expandBigIntegerTenPowers()
137 int newLen = retCC.length * 2 + 16; in encodePath() local138 if (newLen < 0) { in encodePath()139 newLen = Integer.MAX_VALUE; in encodePath()141 char[] buf = new char[newLen]; in encodePath()