- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Faisal (0.17 sec)
-
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
p,kcor,???rots?yov??elloc?na&hcxe?ro!.hcet,??roeg?ug??i!.&pohsdaerpsym,topsgolb,vog??tilop?v&bba?om???j!.&fo,gro?oc?ten???k!.&c&a?s??e&m?n??ibom?o&c!.topsgolb,?fni?g??ro??i&b?l?n???l&a&dmrif?s!rof???b&a?i&b?dua???c&aro?ric??dnik?g!oog??i&bom?ms??l&asal?erauqa??ppa?uhcs?yts!efil???m!.&4&32i,p&ct,v,??66c,ailisarb,b&dnevar,g-raegelif,?ca?duolcsd,e&d-raegelif,i&-raegelif,lpad:.tsohlacol,,?pcm,?g&ro?s-raegelif,?hctilg,kcatsegde,noitatsksid,o&bmoy,c?t&nigol,poh,??p&i&on,snart.etis,?j-raegelif,ohbew,?r...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 21 21:04:43 GMT 2024 - 72.4K bytes - Viewed (1) -
android/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 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (1) -
guava/src/com/google/common/base/Throwables.java
* </pre> * * @throws IllegalArgumentException if there is a loop in the causal chain */ public static Throwable getRootCause(Throwable throwable) { // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches // the slower pointer, then there's a loop. Throwable slowPointer = throwable;
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
* </pre> * * @throws IllegalArgumentException if there is a loop in the causal chain */ public static Throwable getRootCause(Throwable throwable) { // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches // the slower pointer, then there's a loop. Throwable slowPointer = throwable;
Java - Registered: Fri Apr 26 12:43:10 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
setStackTrace(Arrays.copyOfRange(origStackTrace, i, n)); break; } } } } /** * Represents a detected cycle in lock acquisition ordering. The exception includes a causal chain * of {@code ExampleStackTrace} instances to illustrate the cycle, e.g. * * <pre> * com....PotentialDeadlockException: Potential Deadlock from LockC -> ReadWriteA * at ... * at ...
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/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/util/concurrent/AggregateFuture.java
// The results of all other inputs are then ignored (except for logging any failures). boolean completedWithFailure = setException(throwable); if (!completedWithFailure) { // Go up the causal chain to see if we've already seen this cause; if we have, even if // it's wrapped by a different exception, don't log it. boolean firstTimeSeeingThisException = addCausalChain(getOrInitSeenExceptions(), throwable);
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)