- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 43 for cycle (0.14 sec)
-
android/guava-tests/test/com/google/common/io/CharSourceTest.java
} public void testConcat_infiniteIterable() throws IOException { CharSource source = CharSource.wrap("abcd"); Iterable<CharSource> cycle = Iterables.cycle(ImmutableList.of(source)); CharSource concatenated = CharSource.concat(cycle); String expected = "abcdabcd"; // read the first 8 chars manually, since there's no equivalent to ByteSource.slice
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/ClassPath.java
* cycles; otherwise symlinks are traversed. * * @param directory the root of the directory to scan * @param packagePrefix resource path prefix inside {@code classloader} for any files found * under {@code directory} * @param currentPath canonical files already visited in the current directory tree path, for * cycle elimination */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 05 17:43:40 GMT 2022 - 24.9K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
* ThreadLocal is usually implemented with a WeakReference, which can have negative performance * properties; for example, calling WeakReference.get() on Android will block during an * otherwise-concurrent GC cycle. */ private static final class TaskNonReentrantExecutor extends AtomicReference<RunningState> implements Executor, Runnable { /**
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) -
guava/src/com/google/common/collect/HashBiMap.java
// "HashBiMap.hashTableKToV" and "BiEntry.nextInKToVBucket" references. // Under that assumption, the remaining references can be safely marked as @Weak. // Using @Weak is necessary to avoid retain-cycles between BiEntry instances on iOS, // which would cause memory leaks when non-empty HashBiMap with cyclic BiEntry // instances is deallocated. @CheckForNull BiEntry<K, V> nextInKToVBucket;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// (All indices taken mod n.) If d and n are mutually prime, all elements will have been // moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc, // then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles // in all. // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
} public void testSetIndirectSelf_toString() { final SettableFuture<Object> orig = SettableFuture.create(); // unlike the above this indirection defeats the trivial cycle detection and causes a SOE orig.setFuture( new ForwardingListenableFuture<Object>() { @Override protected ListenableFuture<Object> delegate() { return orig; }
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/graph/Traverser.java
* number of nodes that have been seen but not yet visited, that is, the "horizon"). * </ul> * * @param graph {@link SuccessorsFunction} representing a general graph that may have cycles. */ public static <N> Traverser<N> forGraph(SuccessorsFunction<N> graph) { return new Traverser<N>(graph) { @Override Traversal<N> newTraversal() { return Traversal.inGraph(graph);
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/src/com/google/common/collect/Iterators.java
* should use an explicit {@code break} or be certain that you will eventually remove all the * elements. */ @SafeVarargs public static <T extends @Nullable Object> Iterator<T> cycle(T... elements) { return cycle(Lists.newArrayList(elements)); } /** * Returns an Iterator that walks the specified array, nulling out elements behind it. This can
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
private void appendUserObject(StringBuilder builder, @CheckForNull Object o) { // This is some basic recursion detection for when people create cycles via set/setFuture or // when deep chains of futures exist resulting in a StackOverflowException. We could detect // arbitrary cycles using a thread local but this should be a good enough solution (it is also // what jdk collections do in these cases) try {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/FluentIterable.java
* use {@code Stream.generate(() -> collection).flatMap(Collection::stream)}. */ public final FluentIterable<E> cycle() { return from(Iterables.cycle(getDelegate())); } /** * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 35.7K bytes - Viewed (0)