- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for leftChild (0.17 sec)
-
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
minIndex = i; } } Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); } }; abstract Optional<BinaryNode> createTree(int size, Random rng); }
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) -
guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
minIndex = i; } } Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); } }; abstract Optional<BinaryNode> createTree(int size, Random rng); }
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/graph/SuccessorsFunction.java
* return an {@code Iterable<? extends N>}, then you can use a lambda to perform a more general * transformation: * * <pre>{@code * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild())); * }</pre> * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and * successors, iterating over the edges, etc.) should declare their input to be of a type that
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* * <p><b>Note on binary trees</b> * * <p>This method can be used to traverse over a binary tree. Given methods {@code * leftChild(node)} and {@code rightChild(node)}, this method can be called as * * <pre>{@code * Traverser.forTree(node -> ImmutableList.of(leftChild(node), rightChild(node))); * }</pre> * * @param tree {@link SuccessorsFunction} representing a directed acyclic graph that has at most
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)