- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 38 for trac (0.18 sec)
-
android/guava/src/com/google/common/graph/Traverser.java
* href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursively</a>. * This is because the {@code forTree()}-based implementations don't keep track of visited nodes, * and therefore don't need to call `equals()` or `hashCode()` on the node objects; this saves * both time and space versus traversing the same graph using {@code forGraph()}. *
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) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
fail(); } catch (CancellationException expected) { // There should be two CancellationException chained together. The outer one should have the // stack trace of where the get() call was made, and the inner should have the stack trace of // where the immediateCancelledFuture() call was made. List<StackTraceElement> stackTrace = ImmutableList.copyOf(expected.getStackTrace());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* exception, every unchecked exception as an unchecked exception, and every error as an error. In * addition, the cause of any {@code ExecutionException} is wrapped in order to ensure that the * new stack trace matches that of the current thread. * * <p>Instances of {@code exceptionClass} are created by choosing an arbitrary public constructor
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
l??i&a&grab?mod??giro??o&it&acav?cudorp?ulos??puoc???o&dnoc?geuj?ppaz?t&ohp!.remarf,?ua???p!.&ces?gro?moc?olp?ten?ude?vog??i&hsralohcs?lihp?t??u??r!.&au,ca?gro?ni?oc?topsgolb,ude?vog?xo,yldnerb.pohs,?a&c?p?tiug??c?e&dliub!.etisduolc,?erac?gor?levart?mraf?n&niw?trap??wolf??ot&cartnoc?omatat??pj?uot??s!.&em?gro?hcs?moc?ten?ude?vog?zib??alg?e&n&isub!.oc,?tif??rp!xe!nacirema???xnal??iws??t&a&eb?ob??ek&cit?ram??fig?h&cay?gilf??n&atnuocca?e&mt&rapa?sevni??ve!.&nibook,oc,????rap??u!.&a&c!.&21k?bil?cc??...
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/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) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
barrier.await(); } catch (Exception e) { throw new RuntimeException(e); } } private void checkStackTrace(ExecutionException e) { // Our call site for get() should be in the trace. int index = findStackFrame(e, getClass().getName(), "getExpectingExecutionException"); assertThat(index).isNotEqualTo(0); // Above our method should be the call to get(). Don't assert on the class
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 46.8K 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/collect/Iterators.java
@CheckForNull private Iterator<? extends T> toRemove; /* The iterator currently returning elements. */ private Iterator<? extends T> iterator; /* * We track the "meta iterators," the iterators-of-iterators, below. Usually, topMetaIterator * is the only one in use, but if we encounter nested concatenations, we start a deque of
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Aug 23 12:54:09 GMT 2023 - 9.4K bytes - Viewed (0)