akka.protobuf.ByteString.partialHash()方法的使用及代码示例

x33g5p2x  于2022-01-16 转载在 其他  
字(1.8k)|赞(0)|评价(0)|浏览(110)

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

ByteString.partialHash介绍

[英]Compute the hash across the value bytes starting with the given hash, and return the result. This is used to compute the hash across strings represented as a set of pieces by allowing the hash computation to be continued from piece to piece.
[中]

代码示例

代码示例来源:origin: com.typesafe.akka/akka-protobuf

@Override
protected int partialHash(int h, int offset, int length) {
 int toIndex = offset + length;
 if (toIndex <= leftLength) {
  return left.partialHash(h, offset, length);
 } else if (offset >= leftLength) {
  return right.partialHash(h, offset - leftLength, length);
 } else {
  int leftLength = this.leftLength - offset;
  int leftPartial = left.partialHash(h, offset, leftLength);
  return right.partialHash(leftPartial, 0, length - leftLength);
 }
}

代码示例来源:origin: com.typesafe.akka/akka-protobuf_2.11

@Override
protected int partialHash(int h, int offset, int length) {
 int toIndex = offset + length;
 if (toIndex <= leftLength) {
  return left.partialHash(h, offset, length);
 } else if (offset >= leftLength) {
  return right.partialHash(h, offset - leftLength, length);
 } else {
  int leftLength = this.leftLength - offset;
  int leftPartial = left.partialHash(h, offset, leftLength);
  return right.partialHash(leftPartial, 0, length - leftLength);
 }
}

代码示例来源:origin: com.typesafe.akka/akka-protobuf_2.12

@Override
protected int partialHash(int h, int offset, int length) {
 int toIndex = offset + length;
 if (toIndex <= leftLength) {
  return left.partialHash(h, offset, length);
 } else if (offset >= leftLength) {
  return right.partialHash(h, offset - leftLength, length);
 } else {
  int leftLength = this.leftLength - offset;
  int leftPartial = left.partialHash(h, offset, leftLength);
  return right.partialHash(leftPartial, 0, length - leftLength);
 }
}

相关文章