Searched refs:targetSize (Results 1 – 6 of 6) sorted by relevance
109 protected long targetSize; // may be laziliy initialized field in AbstractTask141 this.targetSize = 0L; in AbstractTask()156 this.targetSize = parent.targetSize; in AbstractTask()194 return ((s = targetSize) != 0 ? s : in getTargetSize()195 (targetSize = suggestTargetSize(sizeEstimate))); in getTargetSize()
258 private long targetSize; field in ForEachOps.ForEachTask267 this.targetSize = 0L; in ForEachTask()274 this.targetSize = parent.targetSize; in ForEachTask()282 if ((sizeThreshold = targetSize) == 0L) in compute()283 targetSize = sizeThreshold = AbstractTask.suggestTargetSize(sizeEstimate); in compute()367 private final long targetSize; field in ForEachOps.ForEachOrderedTask379 this.targetSize = AbstractTask.suggestTargetSize(spliterator.estimateSize()); in ForEachOrderedTask()392 this.targetSize = parent.targetSize; in ForEachOrderedTask()405 long sizeThreshold = task.targetSize; in doCompute()
575 private final long targetOffset, targetSize;589 this.targetSize = size;597 this.targetSize = parent.targetSize;653 if (targetSize >= 0655 && isLeftCompleted(targetOffset + targetSize))669 … 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()
1828 protected final long targetSize;1840 this.targetSize = AbstractTask.suggestTargetSize(spliterator.estimateSize());1851 this.targetSize = parent.targetSize;1866 while (rightSplit.estimateSize() > task.targetSize &&
946 int targetSize = target.size(); in indexOfSubList() local947 int maxCandidate = sourceSize - targetSize; in indexOfSubList()953 for (int i=0, j=candidate; i<targetSize; i++, j++) in indexOfSubList()963 for (int i=0; i<targetSize; i++) { in indexOfSubList()999 int targetSize = target.size(); in lastIndexOfSubList() local1000 int maxCandidate = sourceSize - targetSize; in lastIndexOfSubList()1006 for (int i=0, j=candidate; i<targetSize; i++, j++) in lastIndexOfSubList()1018 for (int i=0; i<targetSize; i++) { in lastIndexOfSubList()