Searched refs:addLeaf (Results 1 – 6 of 6) sorted by relevance
/external/apache-commons-compress/src/main/java/org/apache/commons/compress/archivers/zip/ |
D | BinaryTree.java | 60 public void addLeaf(final int node, final int path, final int depth, final int value) { in addLeaf() method in BinaryTree 74 addLeaf(nextChild, path >>> 1, depth - 1, value); in addLeaf() 183 tree.addLeaf(0, Integer.reverse(codes[k] << 16), bitLength, k); in decode()
|
/external/apache-commons-compress/src/test/java/org/apache/commons/compress/archivers/zip/ |
D | BinaryTreeTest.java | 53 binaryFinary.addLeaf(0,0,0,1); in testExceptions() 55 binaryFinary.addLeaf(0,0,0,1); in testExceptions()
|
/external/llvm-project/llvm/utils/TableGen/GlobalISel/ |
D | GIMatchTree.h | 424 void addLeaf(StringRef Name, unsigned RootIdx, const GIMatchDag &MatchDag, in addLeaf() function 428 void addLeaf(const GIMatchTreeBuilderLeafInfo &L) { Leaves.push_back(L); } in addLeaf() function
|
D | GIMatchTree.cpp | 557 SubBuilder.addLeaf(Leaf); in applyForPartition() 724 SubBuilder.addLeaf(Leaf); in applyForPartition()
|
/external/llvm-project/llvm/utils/TableGen/ |
D | GICombinerEmitter.cpp | 867 TreeBuilder.addLeaf(Rule->getName(), Root.index(), Rule->getMatchDag(), in run()
|
/external/kotlinc/lib/ |
D | kotlin-compiler.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/backend-common. ... |