- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for death (0.14 sec)
-
guava/src/com/google/common/base/Throwables.java
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
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-tests/test/com/google/common/util/concurrent/TestThread.java
try { while (true) { Request request = requestQueue.take(); Object result; try { result = invokeMethod(request.methodName, request.arguments); } catch (ThreadDeath death) { return; } catch (InvocationTargetException exception) { responseQueue.put(new Response(request.methodName, null, exception.getTargetException())); continue;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 10.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/TestThread.java
try { while (true) { Request request = requestQueue.take(); Object result; try { result = invokeMethod(request.methodName, request.arguments); } catch (ThreadDeath death) { return; } catch (InvocationTargetException exception) { responseQueue.put(new Response(request.methodName, null, exception.getTargetException())); continue;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <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() * <li>4 levels: average of 99ns 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) -
android/guava/src/com/google/common/graph/Traverser.java
} }; } /** * Returns an unmodifiable {@code Iterable} over the nodes reachable from {@code startNode}, in * the order of a breadth-first traversal. That is, all the nodes of depth 0 are returned, then * depth 1, then 2, and so on. * * <p><b>Example:</b> The following graph with {@code startNode} {@code a} would return nodes in
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
* combinations of methods, then checks compare(), binarySearch() and so * forth on each one. */ // should periodically try increasing this, but it makes the test run long private static final int RECURSE_DEPTH = 2; public void testCombinationsExhaustively_startingFromNatural() { testExhaustively(Ordering.<String>natural(), "a", "b", "d"); } @GwtIncompatible // too slow
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
* combinations of methods, then checks compare(), binarySearch() and so * forth on each one. */ // should periodically try increasing this, but it makes the test run long private static final int RECURSE_DEPTH = 2; public void testCombinationsExhaustively_startingFromNatural() { testExhaustively(Ordering.<String>natural(), "a", "b", "d"); } @GwtIncompatible // too slow
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeToken.java
for (K type : types) { collectTypes(type, map); } return sortKeysByValue(map, Ordering.natural().reverse()); } /** Collects all types to map, and returns the total depth from T up to Object. */ @CanIgnoreReturnValue private int collectTypes(K type, Map<? super K, Integer> map) { Integer existing = map.get(type); if (existing != null) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 53.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
} } /** * Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first * traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration * is in progress or when the iterators generated by {@link #children} are advanced.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.2K bytes - Viewed (0)