- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 34 for clarin (0.42 sec)
-
guava-gwt/src-super/com/google/common/util/concurrent/super/com/google/common/util/concurrent/AbstractFuture.java
} private void notifyAndClearListeners() { afterDone(); // TODO(lukes): consider adding the StackOverflowError protection from the server version // TODO(cpovirk): consider clearing this.delegate for (Listener listener : listeners) { listener.execute(); } listeners = null; } protected void afterDone() {} @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 19:37:41 GMT 2024 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
*/ abstract void collectOneValue(int index, @ParametricNullness InputT returnValue); abstract void handleAllCompleted(); /** Adds the chain to the seen set, and returns whether all the chain was new to us. */ private static boolean addCausalChain(Set<Throwable> seen, Throwable param) { // Declare a "true" local variable so that the Checker Framework will infer nullness.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
firstException = expected; // Second time should also fail, with a cached causal chain. expected = assertThrows(PotentialDeadlockException.class, () -> lockA.lock()); checkMessage(expected, "LockB -> LockA", "LockA -> LockB"); // The causal chain should be cached. assertSame(firstException.getCause(), expected.getCause()); // lockA should work after lockB is released.
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/CompactHashSet.java
* part of the smeared hash of the element not covered by the hashtable mask, whereas the low bits * are the "next" pointer (pointing to the next entry in the bucket chain), which will always be * less than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff * next = 00000bbb * entry = aaaaabbb * </pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/ReactorReader.java
} } if (!hasBeenPackagedDuringThisSession(project)) { // fallback to loose class files only if artifacts haven't been packaged yet // and only for plain old jars. Not war files, not ear files, not anything else. return determineBuildOutputDirectoryForArtifact(project, artifact); } // The fall-through indicates that the artifact cannot be found;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu May 02 16:33:18 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
} } /** * Returns a {@link Collection} of all the permutations of the specified {@link Collection}. * * <p><i>Notes:</i> This is an implementation of the Plain Changes algorithm for permutations * generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
} /** * Gets a {@code Throwable} cause chain as a list. The first entry in the list will be {@code * throwable} followed by its cause hierarchy. Note that this is a snapshot of the cause chain and * will not reflect any subsequent changes to the cause chain. * * <p>Here's an example of how it can be used to find specific types of exceptions in the cause * chain: * * <pre>
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
} /** * Gets a {@code Throwable} cause chain as a list. The first entry in the list will be {@code * throwable} followed by its cause hierarchy. Note that this is a snapshot of the cause chain and * will not reflect any subsequent changes to the cause chain. * * <p>Here's an example of how it can be used to find specific types of exceptions in the cause * chain: * * <pre>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* Benchmarks (as of December 2011) show that: * * <ul> * <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as * opposed to the 24ns taken by a plain lock. * <li>for nested locking, the cost increases with the depth of the nesting: * <ul> * <li>2 levels: average of 64ns per lock()/unlock() * <li>3 levels: average of 77ns per lock()/unlock()
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) -
guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
InternalEntry<Object, Object, ?> entry = null; for (int i = 0; i < originalCount; i++) { Object key = new Object(); Object value = new Object(); int hash = map.hash(key); // chain all entries together as we only have a single bucket entry = segment.newEntryForTesting(key, hash, entry); segment.setValueForTesting(entry, value); } segment.setTableEntryForTesting(0, entry);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0)