Searched refs:threshold (Results 1 - 9 of 9) sorted by relevance

/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/util/
H A DArrayPrefixHelpers.java29 * Keep dividing by two to threshold segment size, and then:
73 /** The smallest subtask array partition size to use as threshold */
81 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
91 this.threshold =
98 T[] array, int origin, int fence, int threshold,
103 this.threshold = threshold;
112 int th = threshold, org = origin, fnc = fence, l, h;
233 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
243 this.threshold
97 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
249 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
383 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
399 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
533 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
549 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...]
H A DHashMap.java172 int threshold; field in class:HashMap
217 // inflateTable() when table == EMPTY_TABLE. That method will take "threshold"
218 // to mean "capacity" and then replace it with the real threshold (i.e, multiplied with
220 threshold = initialCapacity;
255 inflateTable(threshold);
286 threshold = (int) thresholdFloat;
419 inflateTable(threshold);
492 * number of keys in this map reaches its threshold.
495 * resize the map, but sets threshold to Integer.MAX_VALUE.
507 threshold
[all...]
H A DIdentityHashMap.java186 private transient int threshold; field in class:IdentityHashMap
265 threshold = (initCapacity * 2)/3;
451 if (++size >= threshold)
468 if (threshold == MAXIMUM_CAPACITY-1)
470 threshold = MAXIMUM_CAPACITY-1; // Gigantic map!
477 threshold = newLength / 3;
507 if (n > threshold) // conservatively pre-expand
H A DWeakHashMap.java169 private int threshold; field in class:WeakHashMap
221 threshold = (int)(capacity * loadFactor);
447 if (++size >= threshold)
455 * number of keys in this map reaches its threshold.
458 * resize the map, but sets threshold to Integer.MAX_VALUE.
470 threshold = Integer.MAX_VALUE;
483 if (size >= threshold / 2) {
484 threshold = (int)(newCapacity * loadFactor);
529 * is greater than or equal to threshold. This is conservative; the
530 * obvious condition is (m.size() + size) >= threshold, bu
[all...]
H A DHashtable.java145 * The table is rehashed when its size exceeds this threshold. (The
150 private int threshold; field in class:Hashtable
195 threshold = (initialCapacity <= MAX_ARRAY_SIZE + 1) ? initialCapacity : MAX_ARRAY_SIZE + 1;
406 threshold = (int)Math.min(newCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
458 if (count >= threshold) {
459 // Rehash the table if the threshold is exceeded
959 // Write out the length, threshold, loadfactor
992 // Read in the length, threshold, and loadfactor
1010 threshold = (int) Math.min(length * loadFactor, MAX_ARRAY_SIZE + 1);
/libcore/ojluni/src/main/java/java/lang/
H A DThreadLocal.java300 private int threshold; // Default to 0 field in class:ThreadLocal.ThreadLocalMap
303 * Set the resize threshold to maintain at worst a 2/3 load factor.
306 threshold = len * 2 / 3;
445 if (!cleanSomeSlots(i, sz) && sz >= threshold)
635 // Use lower threshold for doubling to avoid hysteresis
636 if (size >= threshold - threshold / 4)
/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/io/
H A DObjectOutputStream.java2318 /* size threshold determining when to expand hash spine */
2319 private int threshold; field in class:ObjectOutputStream.HandleTable
2320 /* factor for computing size threshold */
2337 threshold = (int) (initialCapacity * loadFactor);
2349 if (size >= threshold) {
2406 threshold = (int) (spine.length * loadFactor);

Completed in 296 milliseconds