- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,304 for tree (0.14 sec)
-
guava-tests/test/com/google/common/collect/TreeTraverserTest.java
return node.children; } }); // h // / | \ // / e \ // d g // /|\ | // / | \ f // a b c static final Tree a = new Tree('a'); static final Tree b = new Tree('b'); static final Tree c = new Tree('c'); static final Tree d = new Tree('d', a, b, c); static final Tree e = new Tree('e');
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java
tree.put("tree", 3); assertThat(tree.keySet()).containsExactly("tree", "google").inOrder(); assertThat(tree.get("google")).containsExactly(6, 2).inOrder(); TreeMultimap<String, Integer> copy = TreeMultimap.create(tree); assertEquals(tree, copy); assertThat(copy.keySet()).containsExactly("google", "tree").inOrder(); assertThat(copy.get("google")).containsExactly(2, 6).inOrder();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 8.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
@Test public void forGraph_breadthFirst_tree() throws Exception { Traverser<Character> traverser = Traverser.forGraph(TREE); assertEqualCharNodes(traverser.breadthFirst('h'), "hdegabcf"); assertEqualCharNodes(traverser.breadthFirst('d'), "dabc"); assertEqualCharNodes(traverser.breadthFirst('a'), "a"); } @Test public void forGraph_breadthFirstIterable_tree() throws Exception {
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/test/com/google/common/collect/TreeMultimapNaturalTest.java
*/ public void testCreateFromTreeMultimap() { Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR); tree.put(1.0, 2.0); tree.put(2.0, 3.0); tree.put(3.0, 4.0); tree.put(4.0, 5.0); TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree); assertEquals(tree, copyFromTree); assertSame(Ordering.natural(), copyFromTree.keyComparator());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 22.6K 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/test/com/google/common/collect/TreeMultimapNaturalTest.java
*/ public void testCreateFromTreeMultimap() { Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR); tree.put(1.0, 2.0); tree.put(2.0, 3.0); tree.put(3.0, 4.0); tree.put(4.0, 5.0); TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree); assertEquals(tree, copyFromTree); assertSame(Ordering.natural(), copyFromTree.keyComparator());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 22.6K 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/collect/TreeTraverserTest.java
return node.children; } }); // h // / | \ // / e \ // d g // /|\ | // / | \ f // a b c static final Tree a = new Tree('a'); static final Tree b = new Tree('b'); static final Tree c = new Tree('c'); static final Tree d = new Tree('d', a, b, c); static final Tree e = new Tree('e');
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 3.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java
tree.put("tree", 3); assertThat(tree.keySet()).containsExactly("tree", "google").inOrder(); assertThat(tree.get("google")).containsExactly(6, 2).inOrder(); TreeMultimap<String, Integer> copy = TreeMultimap.create(tree); assertEquals(tree, copy); assertThat(copy.keySet()).containsExactly("google", "tree").inOrder(); assertThat(copy.get("google")).containsExactly(2, 6).inOrder();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 8.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
@Test public void forGraph_breadthFirst_tree() throws Exception { Traverser<Character> traverser = Traverser.forGraph(TREE); assertEqualCharNodes(traverser.breadthFirst('h'), "hdegabcf"); assertEqualCharNodes(traverser.breadthFirst('d'), "dabc"); assertEqualCharNodes(traverser.breadthFirst('a'), "a"); } @Test public void forGraph_breadthFirstIterable_tree() throws Exception {
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)