Searched defs:bound (Results 1 - 5 of 5) sorted by relevance

/libcore/luni/src/main/java/java/util/concurrent/
H A DThreadLocalRandom.java107 * given least value (inclusive) and bound (exclusive).
110 * @param bound the upper bound (exclusive)
112 * to bound
115 public int nextInt(int least, int bound) { argument
116 if (least >= bound)
118 return nextInt(bound - least) + least;
125 * @param n the bound on the random number to be returned. Must be
152 * given least value (inclusive) and bound (exclusive).
155 * @param bound th
160 nextLong(long least, long bound) argument
191 nextDouble(double least, double bound) argument
[all...]
H A DExchanger.java132 * Nodes, embedding "bound" as an Exchanger field, and reworking
144 * collided at each slot within the current arena bound, it tries
146 * bounds by using a version (sequence) number on the "bound"
148 * participant notices that bound has been updated (in either
242 * Unit for sequence/version bits of bound field. Each successful
243 * change to the bound also adds SEQ.
258 * The bound for spins while waiting for a match. The actual
284 int bound; // Last recorded value of Exchanger.bound field in class:Exchanger.Node
285 int collides; // Number of CAS failures at current bound
323 private volatile int bound; field in class:Exchanger
[all...]
/libcore/luni/src/test/java/org/apache/harmony/luni/tests/internal/net/www/protocol/http/
H A DHttpURLConnectionTest.java46 private final static Object bound = new Object(); field in class:HttpURLConnectionTest
66 synchronized (bound) {
68 bound.notify();
168 synchronized(bound) {
170 bound.wait(5000);
203 synchronized(bound) {
204 if (!server.started) bound.wait(5000);
207 synchronized(bound) {
208 if (!proxy.started) bound.wait(5000);
248 synchronized(bound) {
[all...]
/libcore/luni/src/main/java/java/util/
H A DTreeMap.java1106 * verify that the comparator supports our bound objects.
1191 private Node<K, V> bound(Node<K, V> node, Bound fromBound, Bound toBound) { method in class:TreeMap.BoundedMap
1258 return bound(node, NO_BOUND, toBound);
1273 return bound(node, fromBound, NO_BOUND);
1281 * bound is (A..C)
1284 * bound is (A..C)
1287 * bound is (A..C)
1290 * bound is (A..C]
1293 * bound is (A..C]
1311 toBoundForCheck = NO_BOUND; // we've already checked the upper bound
[all...]
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 310 milliseconds