Cross Reference: /libcore/ojluni/src/main/java/java/util/stream/SpinedBuffer.java

Lines Matching defs:curChunk
70      * The curChunk pointer is always valid.  The elementIndex is the index of
71      * the next element to be written in curChunk; this may be past the end of
72      * curChunk so we have to check before writing. When we inflate the spine
73      * array, curChunk becomes the first element in it.  When we clear the
82     protected E[] curChunk;
99         curChunk = (E[]) new Object[1 << initialChunkPower];
108         curChunk = (E[]) new Object[1 << initialChunkPower];
116                ? curChunk.length
125             spine[0] = curChunk;
169                 return curChunk[((int) index)];
195             System.arraycopy(curChunk, 0, array, offset, elementIndex);
203                 System.arraycopy(curChunk, 0, array, offset, elementIndex);
223             curChunk = spine[0];
224             for (int i=0; i<curChunk.length; i++)
225                 curChunk[i] = null;
231                 curChunk[i] = null;
251             consumer.accept(curChunk[i]);
256         if (elementIndex == curChunk.length) {
262             curChunk = spine[spineIndex];
264         curChunk[elementIndex++] = e;
309                 splChunk = (spine == null) ? curChunk : spine[firstSpineIndex];
432          * The curChunk pointer is always valid.  The elementIndex is the index of
433          * the next element to be written in curChunk; this may be past the end of
434          * curChunk so we have to check before writing. When we inflate the spine
435          * array, curChunk becomes the first element in it.  When we clear the
441         T_ARR curChunk;
455             curChunk = newArray(1 << initialChunkPower);
463             curChunk = newArray(1 << initialChunkPower);
487                    ? arrayLength(curChunk)
495                 spine[0] = curChunk;
546                 System.arraycopy(curChunk, 0, array, offset, elementIndex);
554                     System.arraycopy(curChunk, 0, array, offset, elementIndex);
568             if (elementIndex == arrayLength(curChunk)) {
574                 curChunk = spine[spineIndex];
580                 curChunk = spine[0];
595             arrayForEach(curChunk, 0, elementIndex, consumer);
627                 splChunk = (spine == null) ? curChunk : spine[firstSpineIndex];
772             curChunk[elementIndex++] = i;
780                 return curChunk[(int) index];
886             curChunk[elementIndex++] = i;
894                 return curChunk[(int) index];
1002             curChunk[elementIndex++] = i;
1010                 return curChunk[(int) index];