Searched defs:least (Results 1 - 7 of 7) sorted by relevance
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ThreadLocalRandom.java | 135 * given least value (inclusive) and bound (exclusive). 137 * @param least the least value returned 139 * @throws IllegalArgumentException if least greater than or equal 143 public int nextInt(int least, int bound) { argument 144 if (least >= bound) 146 return nextInt(bound - least) + least; 180 * given least value (inclusive) and bound (exclusive). 182 * @param least th 188 nextLong(long least, long bound) argument 219 nextDouble(double least, double bound) argument [all...] |
H A D | ConcurrentSkipListMap.java | 285 * all at once, at least not without creating yet another object 298 * For explanation of algorithms sharing at least a couple of 679 * Returns true if given key greater than or equal to least and 680 * strictly less than fence, bypassing either test if least or 683 boolean inHalfOpenRange(K key, K least, K fence) { argument 686 return ((least == null || compare(key, least) >= 0) && 691 * Returns true if given key greater than or equal to least and less 694 boolean inOpenRange(K key, K least, K fence) { argument 697 return ((least [all...] |
/openjdk7/jdk/test/java/util/concurrent/ConcurrentHashMap/ |
H A D | MapCheck.java | 540 t = stats.least; 579 if (timePerOp < stats.least) stats.least = timePerOp; 590 if (timePerOp < stats.least) stats.least = timePerOp; 600 double least; field in class:MapCheck.Stats 602 Stats(double t) { least = t; }
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | mutex.cpp | 216 // * The memory consistency model provide by lock()-unlock() is at least as 218 // That is, we guarantee at least entry consistency, if not stronger. 872 // (or at least increase the mean, if not the variance), the latter 1096 Monitor * least = get_least_ranked_lock_besides_this(Self->owned_locks()); local 1097 assert(least != this, "Specification of get_least_... call above"); 1098 if (least != NULL && least->rank() <= special) { 1101 name(), rank(), least->name(), least->rank());
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | gcm.cpp | 195 assert(deepb != NULL, "must be at least one input to n"); 289 // Find least common ancestor in dominator tree 666 "Expect at least one phi input will not be from original memory state"); 1015 Block* least = LCA; local 1016 double least_freq = least->_freq; 1050 // the earliest legal location. Capture the least execution frequency. 1057 return least; 1082 least = LCA; // Found cheaper block 1094 least->_pre_order, start_latency, least_freq); 1109 return least; [all...] |
H A D | loopnode.cpp | 1485 assert( fall_in_cnt, "at least 1 fall-in path" ); 2106 // True if the method has at least 1 irreducible loop 2367 // instance-of/check-cast pattern requires at least 2 rounds of 3507 Node *least = legal; // Best legal position so far local 3516 // Find least loop nesting depth 3519 if( get_loop(legal)->_nest < get_loop(least)->_nest ) 3520 least = legal; 3526 if (least != early) { 3527 Node* ctrl_out = least->unique_ctrl_out(); 3529 least [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | concurrentMarkSweepGeneration.hpp | 241 // Compute the least valued stack element. 243 oop least = (oop)low; local 245 least = MIN2(least, _base[i]); 247 return least; 403 // cannot be called until this returns true (they require at least one young 1111 // will collect this generation (at least).
|
Completed in 64 milliseconds