- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 107 for Noop (0.29 sec)
-
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
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-tests/test/com/google/common/util/concurrent/ServiceManagerTest.java
@Override protected void doStart() { notifyStarted(); } @Override protected void doStop() { notifyStopped(); } } /* * A NoOp service that will delay the startup and shutdown notification for a configurable amount * of time. */ private static class NoOpDelayedService extends NoOpService { private long delay;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 02 17:20:27 GMT 2023 - 23.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/ServiceManagerTest.java
@Override protected void doStart() { notifyStarted(); } @Override protected void doStop() { notifyStopped(); } } /* * A NoOp service that will delay the startup and shutdown notification for a configurable amount * of time. */ private static class NoOpDelayedService extends NoOpService { private long delay;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 02 17:20:27 GMT 2023 - 23.9K bytes - Viewed (0) -
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; boolean advanceSlowPointer = false;
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; boolean advanceSlowPointer = false;
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/base/Utf8.java
int utf16Length = sequence.length(); int utf8Length = utf16Length; int i = 0; // This loop optimizes for pure ASCII. while (i < utf16Length && sequence.charAt(i) < 0x80) { i++; } // This loop optimizes for chars less than 0x800. for (; i < utf16Length; i++) { char c = sequence.charAt(i); if (c < 0x800) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/Utf8Test.java
private static void testBytes(int numBytes, long expectedCount) { testBytes(numBytes, expectedCount, 0, -1); } /** * Helper to run the loop to test all the permutations for the number of bytes specified. This * overload is useful for debugging to get the loop to start at a certain character. * * @param numBytes the number of bytes in the byte array
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
GraphConnections<N, V> connections = nodeConnections.get(node); if (connections == null) { return false; } if (allowsSelfLoops()) { // Remove self-loop (if any) first, so we don't get CME while removing incident edges. if (connections.removeSuccessor(node) != null) { connections.removePredecessor(node); --edgeCount; } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
high--; } while (array[high] > partition); if (high < low) { break; // Pointers crossed. Partitioning complete. } swap(array, low, high); // End of innermost loop. } array[from + 1] = array[high]; // Insert partitioning element. array[high] = partition; // Continue the partition that contains the kth element. if (high >= k) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
high--; } while (array[high] > partition); if (high < low) { break; // Pointers crossed. Partitioning complete. } swap(array, low, high); // End of innermost loop. } array[from + 1] = array[high]; // Insert partitioning element. array[high] = partition; // Continue the partition that contains the kth element. if (high >= k) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)