- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for classDoc (0.16 sec)
-
android/guava/src/com/google/common/util/concurrent/Monitor.java
/** * Signals some other thread waiting on a satisfied guard, if one exists. * * <p>We manage calls to this method carefully, to signal only when necessary, but never losing a * signal, which is the classic problem of this kind of concurrency construct. We must signal if * the current thread is about to relinquish the lock and may have changed the state protected by * the monitor, thereby causing some guard to be satisfied.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 18:22:01 UTC 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
public static void rotate(int[] array, int distance, int fromIndex, int toIndex) { // 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.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue. * * <p>This is a classic "bounded buffer", in which a fixed-sized array holds elements * inserted by producers and extracted by consumers. Once created, the capacity cannot be increased.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0)