- Sort Score
- Result 10 results
- Languages All
Results 21 - 26 of 26 for edu (0.13 sec)
-
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* http://creativecommons.org/publicdomain/zero/1.0/ * Other contributors include Andrew Wright, Jeffrey Hayes, * Pat Fisher, Mike Judd. */ /* * Source: * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck/JSR166TestCase.java?revision=1.90 * (We have made some trivial local modifications (commented out * uncompilable code).) */ package com.google.common.util.concurrent;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
*/ public class MonitorBasedPriorityBlockingQueue<E> extends AbstractQueue<E> implements BlockingQueue<E> { // Based on revision 1.55 of PriorityBlockingQueue by Doug Lea, from // http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/main/java/util/concurrent/ private static final long serialVersionUID = 5595510919245408276L; final PriorityQueue<E> q; final Monitor monitor = new Monitor(true);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
public class MonitorBasedArrayBlockingQueue<E> extends AbstractQueue<E> implements BlockingQueue<E> { // Based on revision 1.58 of ArrayBlockingQueue by Doug Lea, from // http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/main/java/util/concurrent/ /** The queued items */ final E[] items; /** items index for next take, poll or remove */ int takeIndex; /** items index for next put, offer, or add. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
// But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax long delta = a - b; // can't overflow, since a and b are nonnegative long minDeltaOrZero = delta & (delta >> (Long.SIZE - 1)); // equivalent to Math.min(delta, 0)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// There are several well-known algorithms for rotating part of an array (or, equivalently, // exchanging two blocks of memory). This classic text by Gries and Mills mentions several: // https://ecommons.cornell.edu/bitstream/handle/1813/6292/81-452.pdf. // (1) "Reversal", the one we have here. // (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0]
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
// definitely observe all earlier writes, but we still have no guarantee that done() would see // the initial write (just stronger guarantees if it does). // // See: http://cs.oswego.edu/pipermail/concurrency-interest/2015-January/013800.html // For a (long) discussion about this specific issue and the general futility of life. //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0)