Searched refs:targetSize (Results 1 – 6 of 6) sorted by relevance
104 protected long targetSize; // may be lazily initialized field in AbstractTask136 this.targetSize = 0L; in AbstractTask()151 this.targetSize = parent.targetSize; in AbstractTask()205 return ((s = targetSize) != 0 ? s : in getTargetSize()206 (targetSize = suggestTargetSize(sizeEstimate))); in getTargetSize()
257 private long targetSize; field in ForEachOps.ForEachTask266 this.targetSize = 0L; in ForEachTask()273 this.targetSize = parent.targetSize; in ForEachTask()281 if ((sizeThreshold = targetSize) == 0L) in compute()282 targetSize = sizeThreshold = AbstractTask.suggestTargetSize(sizeEstimate); in compute()366 private final long targetSize; field in ForEachOps.ForEachOrderedTask378 this.targetSize = AbstractTask.suggestTargetSize(spliterator.estimateSize()); in ForEachOrderedTask()391 this.targetSize = parent.targetSize; in ForEachOrderedTask()404 long sizeThreshold = task.targetSize; in doCompute()
589 private final long targetOffset, targetSize;603 this.targetSize = size;611 this.targetSize = parent.targetSize;674 if (targetSize >= 0676 && isLeftCompleted(targetOffset + targetSize))690 … long to = targetSize >= 0 ? Math.min(input.count(), targetOffset + targetSize) : thisNodeSize;
136 protected final void ensureCapacity(long targetSize) { in ensureCapacity() argument138 if (targetSize > capacity) { in ensureCapacity()140 for (int i=spineIndex+1; targetSize > capacity; i++) { in ensureCapacity()501 protected final void ensureCapacity(long targetSize) { in ensureCapacity() argument503 if (targetSize > capacity) { in ensureCapacity()505 for (int i=spineIndex+1; targetSize > capacity; i++) { in ensureCapacity()
1836 protected final long targetSize;1848 this.targetSize = AbstractTask.suggestTargetSize(spliterator.estimateSize());1859 this.targetSize = parent.targetSize;1874 while (rightSplit.estimateSize() > task.targetSize &&
973 int targetSize = target.size(); in indexOfSubList() local974 int maxCandidate = sourceSize - targetSize; in indexOfSubList()980 for (int i=0, j=candidate; i<targetSize; i++, j++) in indexOfSubList()990 for (int i=0; i<targetSize; i++) { in indexOfSubList()1026 int targetSize = target.size(); in lastIndexOfSubList() local1027 int maxCandidate = sourceSize - targetSize; in lastIndexOfSubList()1033 for (int i=0, j=candidate; i<targetSize; i++, j++) in lastIndexOfSubList()1045 for (int i=0; i<targetSize; i++) { in lastIndexOfSubList()