Searched defs:createTree (Results 1 – 3 of 3) sorted by relevance
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 46 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
60 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
70 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
84 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
109 abstract Optional<BinaryNode> createTree(int size, Random rng); in createTree() method in BinaryTreeTraverserBenchmark.Topology
|
| /external/guava/android/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 46 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
60 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
70 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
84 Optional<BinaryNode> createTree(int size, Random rng) { in createTree() method
109 abstract Optional<BinaryNode> createTree(int size, Random rng); in createTree() method in BinaryTreeTraverserBenchmark.Topology
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/ADT/ |
| D | IntervalTree.h | 366 IntervalNode *createTree(unsigned &IntervalsSize, int PointsBeginIndex, in createTree() function
|