Searched defs:threshold (Results 1 - 8 of 8) sorted by relevance

/libcore/ojluni/src/test/java/util/stream/
H A DTestDoubleSumAverage.java146 * Compute the ulp difference of two double values and compare against an error threshold.
148 private static int compareUlpDifference(double expected, double computed, double threshold) { argument
162 if (ulpDifference > threshold) {
164 ulpDifference, threshold);
/libcore/ojluni/src/main/java/java/util/
H A DArrayPrefixHelpers.java58 * Keep dividing by two to threshold segment size, and then:
102 /** The smallest subtask array partition size to use as threshold */
110 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
120 this.threshold =
127 T[] array, int origin, int fence, int threshold,
132 this.threshold = threshold;
141 int th = threshold, org = origin, fnc = fence, l, h;
262 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
272 this.threshold
126 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
278 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
412 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
428 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
562 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
578 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...]
H A DHashtable.java145 * The table is rehashed when its size exceeds this threshold. (The
150 private int threshold; field in class:Hashtable
191 // Android-changed: Ignore loadFactor when calculating threshold from initialCapacity
192 // threshold = (int)Math.min(initialCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
193 threshold = (int)Math.min(initialCapacity, MAX_ARRAY_SIZE + 1);
406 threshold = (int)Math.min(newCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
425 if (count >= threshold) {
426 // Rehash the table if the threshold is exceeded
1137 // Write out the threshold and loadFactor
1170 // Read in the threshold an
[all...]
H A DWeakHashMap.java170 private int threshold; field in class:WeakHashMap
222 threshold = (int)(capacity * loadFactor);
465 if (++size >= threshold)
473 * number of keys in this map reaches its threshold.
476 * resize the map, but sets threshold to Integer.MAX_VALUE.
488 threshold = Integer.MAX_VALUE;
501 if (size >= threshold / 2) {
502 threshold = (int)(newCapacity * loadFactor);
547 * is greater than or equal to threshold. This is conservative; the
548 * obvious condition is (m.size() + size) >= threshold, bu
[all...]
H A DHashMap.java183 * threshold of 0.75, although with a large variance because of
250 * The bin count threshold for using a tree rather than list for a
260 * The bin count threshold for untreeifying a (split) bin during a
426 int threshold; field in class:HashMap
456 this.threshold = tableSizeFor(initialCapacity);
506 if (t > threshold)
507 threshold = tableSizeFor(t);
509 else if (s > threshold)
661 if (++size > threshold)
669 * accord with initial capacity target held in field threshold
[all...]
/libcore/ojluni/src/main/java/sun/net/
H A DProgressSource.java54 // threshold for notification
55 private int threshold = 8192; field in class:ProgressSource
78 this.threshold = progressMonitor.getProgressUpdateThreshold();
171 // The threshold effectively divides the progress into
174 // Range 0: 0..threshold-1,
175 // Range 1: threshold .. 2*threshold-1
177 // Range n: n*threshold .. (n+1)*threshold-1
182 // range number = progress / threshold
[all...]
/libcore/ojluni/src/main/java/java/lang/
H A DThreadLocal.java337 private int threshold; // Default to 0 field in class:ThreadLocal.ThreadLocalMap
340 * Set the resize threshold to maintain at worst a 2/3 load factor.
343 threshold = len * 2 / 3;
483 if (!cleanSomeSlots(i, sz) && sz >= threshold)
673 // Use lower threshold for doubling to avoid hysteresis
674 if (size >= threshold - threshold / 4)
/libcore/ojluni/src/main/java/java/io/
H A DObjectOutputStream.java2347 /* size threshold determining when to expand hash spine */
2348 private int threshold; field in class:ObjectOutputStream.HandleTable
2349 /* factor for computing size threshold */
2366 threshold = (int) (initialCapacity * loadFactor);
2378 if (size >= threshold) {
2435 threshold = (int) (spine.length * loadFactor);

Completed in 1675 milliseconds