Home
last modified time | relevance | path

Searched refs:getTreeDepth (Results 1 – 9 of 9) sorted by relevance

/external/protobuf/java/core/src/main/java/com/google/protobuf/
DRopeByteString.java151 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
200 if (leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth() in concatenate()
201 && leftRope.getTreeDepth() > right.getTreeDepth()) { in concatenate()
213 int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in concatenate()
318 protected int getTreeDepth() { in getTreeDepth() method
722 breadCrumbs = new ArrayDeque<>(rbs.getTreeDepth()); in PieceIterator()
DByteString.java866 protected final int getTreeDepth() { in getTreeDepth() method in LeafByteString
1196 protected abstract int getTreeDepth(); in getTreeDepth() method
/external/protobuf/java/core/src/test/java/com/google/protobuf/
DRopeByteStringSubstringTest.java65 classUnderTest + " must have the expected tree depth", 3, stringUnderTest.getTreeDepth()); in testGetTreeDepth()
DRopeByteStringTest.java83 classUnderTest + " must have the expected tree depth", 4, stringUnderTest.getTreeDepth()); in testGetTreeDepth()
DLiteralByteStringTest.java124 assertEquals(classUnderTest + " must have depth 0", 0, stringUnderTest.getTreeDepth()); in testGetTreeDepth()
DNioByteStringTest.java113 assertEquals(CLASSNAME + " must have depth 0", 0, testString.getTreeDepth()); in testGetTreeDepth()
DByteStringTest.java836 assertEquals(1, root.getTreeDepth()); in testWriteToOutputStream()
/external/llvm/utils/TableGen/
DAsmMatcherEmitter.cpp274 int getTreeDepth() const { in getTreeDepth() function
322 if (getTreeDepth() > RHS.getTreeDepth()) in operator <()
324 if (getTreeDepth() < RHS.getTreeDepth()) in operator <()
/external/llvm-project/llvm/utils/TableGen/
DAsmMatcherEmitter.cpp290 int getTreeDepth() const { in getTreeDepth() function
338 if (getTreeDepth() > RHS.getTreeDepth()) in operator <()
340 if (getTreeDepth() < RHS.getTreeDepth()) in operator <()