- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 55 for track (0.17 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
movePivotToStartOfSlice(array, from, to); double pivot = array[from]; // Move all elements with indexes in (from, to] which are greater than the pivot to the end of // the array. Keep track of where those elements begin. int partitionPoint = to; for (int i = to; i > from; i--) { if (array[i] > pivot) { swap(array, partitionPoint, i); partitionPoint--; } }
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-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* * <p>This class is accessible but not supported in GWT as it references {@link * PermittedMetaException}. */ protected final class MultiExceptionListIterator implements ListIterator<E> { // TODO: track seen elements when order isn't guaranteed // TODO: verify contents afterward // TODO: something shiny and new instead of Stack // TODO: test whether null is supported (create a Feature) /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* - System.nanoTime() is expensive enough that we want to call it the minimum required number of * times, typically once before invoking a blocking method. This often requires keeping track of * the first time in a method that nanoTime() has been invoked, for which the special value 0L * is reserved to mean "uninitialized". If timeout is non-positive, then nanoTime need never be * called.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
/** * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}. * This implementation requires O(|N|) time. Classes extending this one may manually keep track of * the number of edges as the graph is updated, and override this method for better performance. */ protected long edgeCount() { long degreeSum = 0L; for (N node : nodes()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/internal/Finalizer.java
ReferenceQueue<Object> queue, PhantomReference<Object> frqReference) { this.queue = queue; this.finalizableReferenceClassReference = new WeakReference<>(finalizableReferenceClass); // Keep track of the FRQ that started us so we know when to stop. this.frqReference = frqReference; } /** Loops continuously, pulling references off the queue and cleaning them up. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Aug 23 12:54:09 GMT 2023 - 9.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
@VisibleForTesting @CheckForNull transient @Nullable Object[] values; /** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
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
return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
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/net/InternetDomainNameTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 05 13:16:00 GMT 2024 - 17.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* * But the methods in this class want to throw different exceptions, depending on the args, so it * appears that this pattern is not directly applicable. But we can use the ridiculous, devious * trick of throwing an exception in the middle of the construction of another exception. Hotspot * is fine with that. */ /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0)