- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 65 for trees (0.15 sec)
-
guava-tests/test/com/google/common/graph/TraverserTest.java
Iterable<Character> result = Traverser.forGraph(TWO_TREES).depthFirstPreOrder('a'); assertEqualCharNodes(result, "ab"); } @Test public void forGraph_depthFirstPreOrderIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("a")), "ab"); assertEqualCharNodes( Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("ac")), "abcd"); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
} return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) { int[] keys = new int[size];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
Iterable<Character> result = Traverser.forGraph(TWO_TREES).depthFirstPreOrder('a'); assertEqualCharNodes(result, "ab"); } @Test public void forGraph_depthFirstPreOrderIterable_twoTrees() { assertEqualCharNodes(Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("a")), "ab"); assertEqualCharNodes( Traverser.forGraph(TWO_TREES).depthFirstPreOrder(charactersOf("ac")), "abcd"); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
guava/javadoc-link/checker-framework/package-list
org.checkerframework.framework.util.typeinference.constraint org.checkerframework.framework.util.typeinference.solver org.checkerframework.javacutil org.checkerframework.javacutil.dist org.checkerframework.javacutil.trees org.eclipse.jdt.annotation org.eclipse.jgit.annotations org.jetbrains.annotations org.jmlspecs.annotation org.netbeans.api.annotations.common
Plain Text - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Dec 07 19:00:31 GMT 2017 - 3.8K bytes - Viewed (0) -
android/guava/javadoc-link/checker-framework/package-list
org.checkerframework.framework.util.typeinference.constraint org.checkerframework.framework.util.typeinference.solver org.checkerframework.javacutil org.checkerframework.javacutil.dist org.checkerframework.javacutil.trees org.eclipse.jdt.annotation org.eclipse.jgit.annotations org.jetbrains.annotations org.jmlspecs.annotation org.netbeans.api.annotations.common
Plain Text - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Dec 07 19:00:31 GMT 2017 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
public static <N> Traverser<N> forTree(SuccessorsFunction<N> tree) { if (tree instanceof BaseGraph) { checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees."); } if (tree instanceof Network) { checkArgument(((Network<?, ?>) tree).isDirected(), "Undirected networks can never be trees."); } return new Traverser<N>(tree) { @Override Traversal<N> newTraversal() {
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/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
} return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) { int[] keys = new int[size];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
import java.util.Deque; import java.util.Iterator; import java.util.Queue; import javax.annotation.CheckForNull; /** * Views elements of a type {@code T} as nodes in a tree, and provides methods to traverse the trees * induced by this traverser. * * <p>For example, the tree * * <pre>{@code * h * / | \ * / e \ * d g * /|\ | * / | \ f * a b c * }</pre> *
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) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
It sounded an excellent plan, no doubt, and very neatly and simply arranged; the only difficulty was, that she had not the smallest idea how to set about it; and while she was peering about anxiously among the trees, a little sharp bark just over her head made her look up in a great hurry. An enormous puppy was looking down at her with large round eyes, and feebly stretching out one paw, trying to touch her.
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultisetGwtSerializationDependencies.java
* * <p>For {@code ImmutableMultiset} in particular, I ran into a problem with the {@code * GwtSerializationDependencies} approach: When autogenerating a serializer for the new class, GWT * tries to refer to our dummy serializer for the superclass, * ImmutableMultiset_CustomFieldSerializer. But that type has no methods (since it's never actually
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 1.9K bytes - Viewed (0)