Searched refs:treeDepth (Results 1 – 5 of 5) sorted by relevance
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| D | Proto3MessageLiteFactory.java | 47 int numRepeatedFields, int stringLength, int branchingFactor, int treeDepth) { in Proto3MessageLiteFactory() argument
52 treeDepth); in Proto3MessageLiteFactory()
59 int treeDepth) { in Proto3MessageLiteFactory() argument
63 if (treeDepth > 0) { in Proto3MessageLiteFactory()
65 new Proto3MessageLiteFactory(data, numRepeatedFields, branchingFactor, treeDepth - 1); in Proto3MessageLiteFactory()
|
| D | Proto3MessageFactory.java | 46 int numRepeatedFields, int stringLength, int branchingFactor, int treeDepth) { in Proto3MessageFactory() argument
51 treeDepth); in Proto3MessageFactory()
58 int treeDepth) { in Proto3MessageFactory() argument
62 if (treeDepth > 0) { in Proto3MessageFactory()
63 nextLevel = new Proto3MessageFactory(data, numRepeatedFields, branchingFactor, treeDepth - 1); in Proto3MessageFactory()
|
| D | Proto2MessageFactory.java | 48 int numRepeatedFields, int stringLength, int branchingFactor, int treeDepth) { in Proto2MessageFactory() argument
53 treeDepth); in Proto2MessageFactory()
60 int treeDepth) { in Proto2MessageFactory() argument
64 if (treeDepth > 0) { in Proto2MessageFactory()
65 nextLevel = new Proto2MessageFactory(data, numRepeatedFields, branchingFactor, treeDepth - 1); in Proto2MessageFactory()
|
| D | Proto2MessageLiteFactory.java | 49 int numRepeatedFields, int stringLength, int branchingFactor, int treeDepth) { in Proto2MessageLiteFactory() argument
54 treeDepth); in Proto2MessageLiteFactory()
61 int treeDepth) { in Proto2MessageLiteFactory() argument
65 if (treeDepth > 0) { in Proto2MessageLiteFactory()
67 new Proto2MessageLiteFactory(data, numRepeatedFields, branchingFactor, treeDepth - 1); in Proto2MessageLiteFactory()
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | RopeByteString.java | 137 private final int treeDepth; field in RopeByteString
151 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1; in RopeByteString()
319 return treeDepth; in getTreeDepth()
331 return totalLength >= minLengthByDepth[treeDepth]; in isBalanced()
|