- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 52 for blocky (0.16 sec)
-
android/guava/src/com/google/common/primitives/Ints.java
// in all. // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a // block of size n-d (a[d..n-1]), where in general these blocks have different sizes. If we // imagine a line separating the first block from the second, we can proceed by exchanging // the smaller of these blocks with the far end of the other one. That leaves us with a
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) -
guava-tests/test/com/google/common/collect/StreamsTest.java
/** Unit test for {@link Streams}. */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public class StreamsTest extends TestCase { /* * Full and proper black-box testing of a Stream-returning method is extremely involved, and is * overkill when nearly all Streams are produced using well-tested JDK calls. So, we cheat and * just test that the toArray() contents are as expected. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* the queue exceeds that value, the queue automatically removes its greatest element according to * its comparator (which might be the element that was just added). This is different from * conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* {@code tailSet} views. * * <pre>{@code * NavigableSet<E> set = synchronizedNavigableSet(new TreeSet<E>()); * ... * synchronized (set) { * // Must be in the synchronized block * Iterator<E> it = set.iterator(); * while (it.hasNext()) { * foo(it.next()); * } * } * }</pre> * * <p>or: * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
* Queue<E> queue = Queues.synchronizedQueue(MinMaxPriorityQueue.<E>create()); * ... * queue.add(element); // Needn't be in synchronized block * ... * synchronized (queue) { // Must synchronize on queue! * Iterator<E> i = queue.iterator(); // Must be in synchronized block * while (i.hasNext()) { * foo(i.next()); * } * } * }</pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 16K bytes - Viewed (0) -
guava/src/com/google/common/base/Internal.java
"Java7ApiChecker", }) @IgnoreJRERequirement static long toNanosSaturated(Duration duration) { // Using a try/catch seems lazy, but the catch block will rarely get invoked (except for // durations longer than approximately +/- 292 years). try { return duration.toNanos(); } catch (ArithmeticException tooBig) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Jan 11 14:30:06 GMT 2024 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Internal.java
"Java7ApiChecker", }) @IgnoreJRERequirement static long toNanosSaturated(Duration duration) { // Using a try/catch seems lazy, but the catch block will rarely get invoked (except for // durations longer than approximately +/- 292 years). try { return duration.toNanos(); } catch (ArithmeticException tooBig) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jan 11 14:30:06 GMT 2024 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimaps.java
* HashMultimap.<K, V>create()); * ... * Collection<V> values = multimap.get(key); // Needn't be in synchronized block * ... * synchronized (multimap) { // Synchronizing on multimap, not values! * Iterator<V> i = values.iterator(); // Must be in synchronized block * while (i.hasNext()) { * foo(i.next()); * } * } * }</pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 86.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * Serializes execution of tasks, somewhat like an "asynchronous {@code synchronized} block." Each * {@linkplain #submit enqueued} callable will not be submitted to its associated executor until the * previous callable has returned -- and, if the previous callable was an {@link AsyncCallable}, not
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* the {@code Future} is already done. Second, if buggy code calls {@code getDone} on a {@code * Future} that is still pending, the program will throw instead of block. This can be important * for APIs like {@link #whenAllComplete whenAllComplete(...)}{@code .}{@link * FutureCombiner#call(Callable, Executor) call(...)}, where it is easy to use a new input from
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)