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

/dalvik/libcore/luni/src/main/java/java/util/
H A DWeakHashMap.java46 private int threshold; field in class:WeakHashMap
267 threshold = (int) ((long) elementData.length * loadFactor / 10000);
625 if (++elementCount > threshold) {
H A DIdentityHashMap.java61 transient int threshold; field in class:IdentityHashMap
64 * default threshold value that an IdentityHashMap created using the default
256 threshold = getThreshold(maxSize);
264 // assign the threshold to maxSize initially, this will change to a
270 int arraySize = (int) (((long) threshold * 10000) / loadFactor) * 2;
272 // leads to overflow and negative arraySize if threshold is too big
465 if (++size > threshold) {
517 threshold = (int) ((long) (elementData.length / 2) * loadFactor / 10000);
803 threshold = getThreshold(DEFAULT_MAX_SIZE);
H A DHashMap.java112 * The table is rehashed when its size exceeds this threshold.
117 private transient int threshold; field in class:HashMap
130 threshold = -1; // Forces first put invocation to replace EMPTY_TABLE
150 threshold = -1; // Forces first put() to replace EMPTY_TABLE
243 // Restore clone to empty state, retaining our capacity and threshold
407 if (size++ > threshold) {
554 * Allocate a table of the given capacity and set the threshold accordingly.
561 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacity
H A DHashtable.java92 * The table is rehashed when its size exceeds this threshold.
97 private transient int threshold; field in class:Hashtable
111 threshold = -1; // Forces first put invocation to replace EMPTY_TABLE
130 threshold = -1; // Forces first put() to replace EMPTY_TABLE
222 // Restore clone to empty state, retaining our capacity and threshold
385 if (size++ > threshold) {
488 * Allocate a table of the given capacity and set the threshold accordingly.
495 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacity
1106 new ObjectStreamField("threshold", Integer.TYPE),
1114 fields.put("threshold", (in
[all...]
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
H A DTwoKeyHashMap.java50 int threshold = 0; field in class:TwoKeyHashMap
88 threshold = (int) (arrSize * loadFactor);
174 if (size > threshold) {
212 threshold = (int) (arrSize * loadFactor);
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java223 * is less than two for the default load factor threshold.)
243 * can reveal that the table has grown but the threshold
269 * The table is rehashed when its size exceeds this threshold.
273 transient int threshold; field in class:ConcurrentHashMap.Segment
303 threshold = (int)(newTable.length * loadFactor);
419 if (c++ > threshold) // ensure capacity
459 * threshold, only about one-sixth of them need cloning when
467 threshold = (int)(newTable.length * loadFactor);
573 * @param loadFactor the load factor threshold, used to control resizing.
575 * bin exceeds this threshold
[all...]
/dalvik/vm/
H A DGlobals.h94 * Lock profiling threshold value in milliseconds. Acquires that
95 * exceed threshold are logged. Acquires within the threshold are
96 * logged with a probability of $\frac{time}{threshold}$ . If the
97 * threshold is unset no additional logging occurs.
696 /* Array of profile threshold counters */
715 unsigned short threshold; member in struct:DvmJitGlobals
/dalvik/tools/dmtracedump/
H A DTraceDump.c244 int threshold; member in struct:Options
1692 /* check to make sure that the child method meets the threshold of the parent */
1698 return (percentage < gOptions.threshold) ? 0 : 1;
3531 fprintf(stderr, " -t threshold - Threshold percentage for including nodes in the graph\n");
3565 gOptions.threshold = atoi(optarg);
3580 gOptions.threshold = -1;
3588 if (gOptions.threshold < 0 || 100 <= gOptions.threshold) {
3589 gOptions.threshold = 20;

Completed in 760 milliseconds