本文整理了Java中com.google.protobuf.ByteString.getTreeDepth()方法的一些代码示例，展示了ByteString.getTreeDepth()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。ByteString.getTreeDepth()方法的具体详情如下：
包路径：com.google.protobuf.ByteString
类名称：ByteString
方法名：getTreeDepth

ByteString.getTreeDepth介绍

[英]Return the depth of the tree representing this ByteString, if any, whose root is this node. If this is a leaf node, return 0.
[中]返回表示此ByteString的树的深度（如果有），其根是此节点。如果这是叶节点，则返回0。

代码示例

代码示例来源：origin: com.google.protobuf/protobuf-java

/**
 * Create a new RopeByteString, which can be thought of as a new tree node, by
 * recording references to the two given strings.
 *
 * @param left  string on the left of this node, should have {@code size() >
 *              0}
 * @param right string on the right of this node, should have {@code size() >
 *              0}
 */
private RopeByteString(ByteString left, ByteString right) {
 this.left = left;
 this.right = right;
 leftLength = left.size();
 totalLength = leftLength + right.size();
 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
}

代码示例来源：origin: osmandapp/Osmand

/**
 * Create a new RopeByteString, which can be thought of as a new tree node, by
 * recording references to the two given strings.
 *
 * @param left  string on the left of this node, should have {@code size() >
 *              0}
 * @param right string on the right of this node, should have {@code size() >
 *              0}
 */
private RopeByteString(ByteString left, ByteString right) {
 this.left = left;
 this.right = right;
 leftLength = left.size();
 totalLength = leftLength + right.size();
 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
}

代码示例来源：origin: osmandapp/Osmand

result = new RopeByteString(leftRope.left, newRight);
} else if (leftRope != null
  && leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth()
  && leftRope.getTreeDepth() > right.getTreeDepth()) {
 int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
 if (newLength >= minLengthByDepth[newDepth]) {

代码示例来源：origin: com.google.protobuf/protobuf-java

if (leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth()
   && leftRope.getTreeDepth() > right.getTreeDepth()) {
int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
if (newLength >= minLengthByDepth[newDepth]) {

代码示例来源：origin: yeriomin/play-store-api

/**
 * Create a new RopeByteString, which can be thought of as a new tree node, by
 * recording references to the two given strings.
 *
 * @param left  string on the left of this node, should have {@code size() >
 *              0}
 * @param right string on the right of this node, should have {@code size() >
 *              0}
 */
private RopeByteString(ByteString left, ByteString right) {
 this.left = left;
 this.right = right;
 leftLength = left.size();
 totalLength = leftLength + right.size();
 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
}

代码示例来源：origin: com.google.protobuf/protobuf-lite

/**
 * Create a new RopeByteString, which can be thought of as a new tree node, by
 * recording references to the two given strings.
 *
 * @param left  string on the left of this node, should have {@code size() >
 *              0}
 * @param right string on the right of this node, should have {@code size() >
 *              0}
 */
private RopeByteString(ByteString left, ByteString right) {
 this.left = left;
 this.right = right;
 leftLength = left.size();
 totalLength = leftLength + right.size();
 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
}

代码示例来源：origin: WeAreFairphone/FP2-Launcher

/**
 * Create a new RopeByteString, which can be thought of as a new tree node, by
 * recording references to the two given strings.
 *
 * @param left  string on the left of this node, should have {@code size() >
 *              0}
 * @param right string on the right of this node, should have {@code size() >
 *              0}
 */
private RopeByteString(ByteString left, ByteString right) {
 this.left = left;
 this.right = right;
 leftLength = left.size();
 totalLength = leftLength + right.size();
 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
}

代码示例来源：origin: WeAreFairphone/FP2-Launcher

result = new RopeByteString(leftRope.left, newRight);
} else if (leftRope != null
  && leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth()
  && leftRope.getTreeDepth() > right.getTreeDepth()) {
 int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
 if (newLength >= minLengthByDepth[newDepth]) {

代码示例来源：origin: com.google.protobuf/protobuf-lite

if (leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth()
   && leftRope.getTreeDepth() > right.getTreeDepth()) {
int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
if (newLength >= minLengthByDepth[newDepth]) {

代码示例来源：origin: yeriomin/play-store-api

if (leftRope.left.getTreeDepth() > leftRope.right.getTreeDepth()
   && leftRope.getTreeDepth() > right.getTreeDepth()) {
int newDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
if (newLength >= minLengthByDepth[newDepth]) {