- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for deletion (3.86 sec)
-
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
} }, /** * Disables cycle detection. This option causes the factory to return unmodified lock * implementations provided by the JDK, and is provided to allow applications to easily * parameterize when cycle detection is enabled. * * <p>Note that locks created by a factory with this policy will not participate the * cycle detection performed by locks created by other factories. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
int[] allRequired, int requiredFrom, int requiredTo, double[] array, int from, int to) { // Choose the first selection to do... int requiredChosen = chooseNextSelection(allRequired, requiredFrom, requiredTo, from, to); int required = allRequired[requiredChosen]; // ...do the first selection... selectInPlace(required, array, from, to); // ...then recursively perform the selections in the range below...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
} public void testSetIndirectSelf_toString() { final SettableFuture<Object> orig = SettableFuture.create(); // unlike the above this indirection defeats the trivial cycle detection and causes a SOE orig.setFuture( new ForwardingListenableFuture<Object>() { @Override protected ListenableFuture<Object> delegate() { return orig; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 46.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
assertSame(firstException.getCause(), expected.getCause()); // lockA should work after lockB is released. lockB.unlock(); lockA.lock(); } // Tests transitive deadlock detection. public void testDeadlock_threeLocks() { // Establish an ordering from lockA -> lockB. lockA.lock(); lockB.lock(); lockB.unlock(); lockA.unlock();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* given object is also a multiset and contains equal elements with equal counts, regardless of * order. */ @Override // TODO(kevinb): caveats about equivalence-relation? boolean equals(@CheckForNull Object object); /** * Returns the hash code for this multiset. This is defined as the sum of * * <pre>{@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 19.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* <i>descending order</i> * @throws IllegalArgumentException if {@code k} is negative * @since 8.0 */ public <E extends T> List<E> greatestOf(Iterable<E> iterable, int k) { // TODO(kevinb): see if delegation is hurting performance noticeably // TODO(kevinb): if we change this implementation, add full unit tests. return this.<E>reverse().leastOf(iterable, k); } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
* a traditional {@code HashMap} implementation which stores keys and count values as map entries, * {@code ObjectCountHashMap} minimizes object allocation and reduces memory footprint. * * <p>In the absence of element deletions, this will iterate over elements in insertion order. */ @GwtCompatible(serializable = true, emulated = true) @ElementTypesAreNonnullByDefault class ObjectCountHashMap<K extends @Nullable Object> {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
if (count == 0 && !isLinkedHash) { contents = new ObjectCountLinkedHashMap<E>(contents); isLinkedHash = true; // to preserve insertion order through deletions, we have to switch to an actual linked // implementation at least for now, but this should be a super rare case } else if (buildInvoked) { contents = new ObjectCountHashMap<E>(contents);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
} public void testSetIndirectSelf_toString() { final SettableFuture<Object> orig = SettableFuture.create(); // unlike the above this indirection defeats the trivial cycle detection and causes a SOE orig.setFuture( new ForwardingListenableFuture<Object>() { @Override protected ListenableFuture<Object> delegate() { return orig; }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 46.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Equivalence.java
/** Constructor for use by subclasses. */ protected Equivalence() {} /** * Returns {@code true} if the given objects are considered equivalent. * * <p>This method describes an <i>equivalence relation</i> on object references, meaning that for * all references {@code x}, {@code y}, and {@code z} (any of which may be null): * * <ul> * <li>{@code equivalent(x, x)} is true (<i>reflexive</i> property)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0)