com.hedera.hapi.block.stream.protoc.MerkleSiblingHash Maven / Gradle / Ivy
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: stream/block_proof.proto
package com.hedera.hapi.block.stream.protoc;
/**
*
**
* A hash of a "sibling" to an entry in a Merkle tree.
* When constructing a binary merkle tree, each internal node is a hash
* constructed from the hash of two "descendant" nodes. Those two nodes
* are "siblings" and the order (first, second) in which the two hash values
* are combined affects the parent hash.<br/>
* This may be used to reconstruct a portion of a merkle tree starting from
* a node of interest up to the root of the tree.
*
*
* Protobuf type {@code com.hedera.hapi.block.stream.MerkleSiblingHash}
*/
public final class MerkleSiblingHash extends
com.google.protobuf.GeneratedMessageV3 implements
// @@protoc_insertion_point(message_implements:com.hedera.hapi.block.stream.MerkleSiblingHash)
MerkleSiblingHashOrBuilder {
private static final long serialVersionUID = 0L;
// Use MerkleSiblingHash.newBuilder() to construct.
private MerkleSiblingHash(com.google.protobuf.GeneratedMessageV3.Builder builder) {
super(builder);
}
private MerkleSiblingHash() {
siblingHash_ = com.google.protobuf.ByteString.EMPTY;
}
@java.lang.Override
@SuppressWarnings({"unused"})
protected java.lang.Object newInstance(
UnusedPrivateParameter unused) {
return new MerkleSiblingHash();
}
@java.lang.Override
public final com.google.protobuf.UnknownFieldSet
getUnknownFields() {
return this.unknownFields;
}
private MerkleSiblingHash(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
this();
if (extensionRegistry == null) {
throw new java.lang.NullPointerException();
}
com.google.protobuf.UnknownFieldSet.Builder unknownFields =
com.google.protobuf.UnknownFieldSet.newBuilder();
try {
boolean done = false;
while (!done) {
int tag = input.readTag();
switch (tag) {
case 0:
done = true;
break;
case 8: {
isFirst_ = input.readBool();
break;
}
case 18: {
siblingHash_ = input.readBytes();
break;
}
default: {
if (!parseUnknownField(
input, unknownFields, extensionRegistry, tag)) {
done = true;
}
break;
}
}
}
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
throw e.setUnfinishedMessage(this);
} catch (java.io.IOException e) {
throw new com.google.protobuf.InvalidProtocolBufferException(
e).setUnfinishedMessage(this);
} finally {
this.unknownFields = unknownFields.build();
makeExtensionsImmutable();
}
}
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return com.hedera.hapi.block.stream.protoc.BlockProofOuterClass.internal_static_com_hedera_hapi_block_stream_MerkleSiblingHash_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return com.hedera.hapi.block.stream.protoc.BlockProofOuterClass.internal_static_com_hedera_hapi_block_stream_MerkleSiblingHash_fieldAccessorTable
.ensureFieldAccessorsInitialized(
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.class, com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.Builder.class);
}
public static final int IS_FIRST_FIELD_NUMBER = 1;
private boolean isFirst_;
/**
*
**
* A flag for the position of this sibling.
* <p>
* If this is set then this sibling MUST be the first hash in the pair of
* sibling hashes of a binary merkle tree.<br/>
* If this is unset, then this sibling MUST be the second hash in the pair
* of sibling hashes of a binary merkle tree.
*
*
* bool is_first = 1;
* @return The isFirst.
*/
@java.lang.Override
public boolean getIsFirst() {
return isFirst_;
}
public static final int SIBLING_HASH_FIELD_NUMBER = 2;
private com.google.protobuf.ByteString siblingHash_;
/**
*
**
* A byte array of a sibling hash.<br/>
* This is the hash for the sibling at this point in the merkle tree.
* <p>
* The algorithm for this hash SHALL match the algorithm for the block that
* contains this sibling.<br/>
* This SHALL contain the raw (e.g.) 384 bits (48 bytes) of the hash value.
*
*
* bytes sibling_hash = 2;
* @return The siblingHash.
*/
@java.lang.Override
public com.google.protobuf.ByteString getSiblingHash() {
return siblingHash_;
}
private byte memoizedIsInitialized = -1;
@java.lang.Override
public final boolean isInitialized() {
byte isInitialized = memoizedIsInitialized;
if (isInitialized == 1) return true;
if (isInitialized == 0) return false;
memoizedIsInitialized = 1;
return true;
}
@java.lang.Override
public void writeTo(com.google.protobuf.CodedOutputStream output)
throws java.io.IOException {
if (isFirst_ != false) {
output.writeBool(1, isFirst_);
}
if (!siblingHash_.isEmpty()) {
output.writeBytes(2, siblingHash_);
}
unknownFields.writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
if (isFirst_ != false) {
size += com.google.protobuf.CodedOutputStream
.computeBoolSize(1, isFirst_);
}
if (!siblingHash_.isEmpty()) {
size += com.google.protobuf.CodedOutputStream
.computeBytesSize(2, siblingHash_);
}
size += unknownFields.getSerializedSize();
memoizedSize = size;
return size;
}
@java.lang.Override
public boolean equals(final java.lang.Object obj) {
if (obj == this) {
return true;
}
if (!(obj instanceof com.hedera.hapi.block.stream.protoc.MerkleSiblingHash)) {
return super.equals(obj);
}
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash other = (com.hedera.hapi.block.stream.protoc.MerkleSiblingHash) obj;
if (getIsFirst()
!= other.getIsFirst()) return false;
if (!getSiblingHash()
.equals(other.getSiblingHash())) return false;
if (!unknownFields.equals(other.unknownFields)) return false;
return true;
}
@java.lang.Override
public int hashCode() {
if (memoizedHashCode != 0) {
return memoizedHashCode;
}
int hash = 41;
hash = (19 * hash) + getDescriptor().hashCode();
hash = (37 * hash) + IS_FIRST_FIELD_NUMBER;
hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
getIsFirst());
hash = (37 * hash) + SIBLING_HASH_FIELD_NUMBER;
hash = (53 * hash) + getSiblingHash().hashCode();
hash = (29 * hash) + unknownFields.hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
java.nio.ByteBuffer data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
java.nio.ByteBuffer data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
com.google.protobuf.ByteString data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(byte[] data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
byte[] data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseDelimitedFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseDelimitedFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input, extensionRegistry);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
com.google.protobuf.CodedInputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parseFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
@java.lang.Override
public Builder newBuilderForType() { return newBuilder(); }
public static Builder newBuilder() {
return DEFAULT_INSTANCE.toBuilder();
}
public static Builder newBuilder(com.hedera.hapi.block.stream.protoc.MerkleSiblingHash prototype) {
return DEFAULT_INSTANCE.toBuilder().mergeFrom(prototype);
}
@java.lang.Override
public Builder toBuilder() {
return this == DEFAULT_INSTANCE
? new Builder() : new Builder().mergeFrom(this);
}
@java.lang.Override
protected Builder newBuilderForType(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
Builder builder = new Builder(parent);
return builder;
}
/**
*
**
* A hash of a "sibling" to an entry in a Merkle tree.
* When constructing a binary merkle tree, each internal node is a hash
* constructed from the hash of two "descendant" nodes. Those two nodes
* are "siblings" and the order (first, second) in which the two hash values
* are combined affects the parent hash.<br/>
* This may be used to reconstruct a portion of a merkle tree starting from
* a node of interest up to the root of the tree.
*
*
* Protobuf type {@code com.hedera.hapi.block.stream.MerkleSiblingHash}
*/
public static final class Builder extends
com.google.protobuf.GeneratedMessageV3.Builder implements
// @@protoc_insertion_point(builder_implements:com.hedera.hapi.block.stream.MerkleSiblingHash)
com.hedera.hapi.block.stream.protoc.MerkleSiblingHashOrBuilder {
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return com.hedera.hapi.block.stream.protoc.BlockProofOuterClass.internal_static_com_hedera_hapi_block_stream_MerkleSiblingHash_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return com.hedera.hapi.block.stream.protoc.BlockProofOuterClass.internal_static_com_hedera_hapi_block_stream_MerkleSiblingHash_fieldAccessorTable
.ensureFieldAccessorsInitialized(
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.class, com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.Builder.class);
}
// Construct using com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.newBuilder()
private Builder() {
maybeForceBuilderInitialization();
}
private Builder(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
super(parent);
maybeForceBuilderInitialization();
}
private void maybeForceBuilderInitialization() {
if (com.google.protobuf.GeneratedMessageV3
.alwaysUseFieldBuilders) {
}
}
@java.lang.Override
public Builder clear() {
super.clear();
isFirst_ = false;
siblingHash_ = com.google.protobuf.ByteString.EMPTY;
return this;
}
@java.lang.Override
public com.google.protobuf.Descriptors.Descriptor
getDescriptorForType() {
return com.hedera.hapi.block.stream.protoc.BlockProofOuterClass.internal_static_com_hedera_hapi_block_stream_MerkleSiblingHash_descriptor;
}
@java.lang.Override
public com.hedera.hapi.block.stream.protoc.MerkleSiblingHash getDefaultInstanceForType() {
return com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.getDefaultInstance();
}
@java.lang.Override
public com.hedera.hapi.block.stream.protoc.MerkleSiblingHash build() {
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash result = buildPartial();
if (!result.isInitialized()) {
throw newUninitializedMessageException(result);
}
return result;
}
@java.lang.Override
public com.hedera.hapi.block.stream.protoc.MerkleSiblingHash buildPartial() {
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash result = new com.hedera.hapi.block.stream.protoc.MerkleSiblingHash(this);
result.isFirst_ = isFirst_;
result.siblingHash_ = siblingHash_;
onBuilt();
return result;
}
@java.lang.Override
public Builder clone() {
return super.clone();
}
@java.lang.Override
public Builder setField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.setField(field, value);
}
@java.lang.Override
public Builder clearField(
com.google.protobuf.Descriptors.FieldDescriptor field) {
return super.clearField(field);
}
@java.lang.Override
public Builder clearOneof(
com.google.protobuf.Descriptors.OneofDescriptor oneof) {
return super.clearOneof(oneof);
}
@java.lang.Override
public Builder setRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
int index, java.lang.Object value) {
return super.setRepeatedField(field, index, value);
}
@java.lang.Override
public Builder addRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.addRepeatedField(field, value);
}
@java.lang.Override
public Builder mergeFrom(com.google.protobuf.Message other) {
if (other instanceof com.hedera.hapi.block.stream.protoc.MerkleSiblingHash) {
return mergeFrom((com.hedera.hapi.block.stream.protoc.MerkleSiblingHash)other);
} else {
super.mergeFrom(other);
return this;
}
}
public Builder mergeFrom(com.hedera.hapi.block.stream.protoc.MerkleSiblingHash other) {
if (other == com.hedera.hapi.block.stream.protoc.MerkleSiblingHash.getDefaultInstance()) return this;
if (other.getIsFirst() != false) {
setIsFirst(other.getIsFirst());
}
if (other.getSiblingHash() != com.google.protobuf.ByteString.EMPTY) {
setSiblingHash(other.getSiblingHash());
}
this.mergeUnknownFields(other.unknownFields);
onChanged();
return this;
}
@java.lang.Override
public final boolean isInitialized() {
return true;
}
@java.lang.Override
public Builder mergeFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
com.hedera.hapi.block.stream.protoc.MerkleSiblingHash parsedMessage = null;
try {
parsedMessage = PARSER.parsePartialFrom(input, extensionRegistry);
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
parsedMessage = (com.hedera.hapi.block.stream.protoc.MerkleSiblingHash) e.getUnfinishedMessage();
throw e.unwrapIOException();
} finally {
if (parsedMessage != null) {
mergeFrom(parsedMessage);
}
}
return this;
}
private boolean isFirst_ ;
/**
*
**
* A flag for the position of this sibling.
* <p>
* If this is set then this sibling MUST be the first hash in the pair of
* sibling hashes of a binary merkle tree.<br/>
* If this is unset, then this sibling MUST be the second hash in the pair
* of sibling hashes of a binary merkle tree.
*
*
* bool is_first = 1;
* @return The isFirst.
*/
@java.lang.Override
public boolean getIsFirst() {
return isFirst_;
}
/**
*
**
* A flag for the position of this sibling.
* <p>
* If this is set then this sibling MUST be the first hash in the pair of
* sibling hashes of a binary merkle tree.<br/>
* If this is unset, then this sibling MUST be the second hash in the pair
* of sibling hashes of a binary merkle tree.
*
*
* bool is_first = 1;
* @param value The isFirst to set.
* @return This builder for chaining.
*/
public Builder setIsFirst(boolean value) {
isFirst_ = value;
onChanged();
return this;
}
/**
*
**
* A flag for the position of this sibling.
* <p>
* If this is set then this sibling MUST be the first hash in the pair of
* sibling hashes of a binary merkle tree.<br/>
* If this is unset, then this sibling MUST be the second hash in the pair
* of sibling hashes of a binary merkle tree.
*
*
* bool is_first = 1;
* @return This builder for chaining.
*/
public Builder clearIsFirst() {
isFirst_ = false;
onChanged();
return this;
}
private com.google.protobuf.ByteString siblingHash_ = com.google.protobuf.ByteString.EMPTY;
/**
*
**
* A byte array of a sibling hash.<br/>
* This is the hash for the sibling at this point in the merkle tree.
* <p>
* The algorithm for this hash SHALL match the algorithm for the block that
* contains this sibling.<br/>
* This SHALL contain the raw (e.g.) 384 bits (48 bytes) of the hash value.
*
*
* bytes sibling_hash = 2;
* @return The siblingHash.
*/
@java.lang.Override
public com.google.protobuf.ByteString getSiblingHash() {
return siblingHash_;
}
/**
*
**
* A byte array of a sibling hash.<br/>
* This is the hash for the sibling at this point in the merkle tree.
* <p>
* The algorithm for this hash SHALL match the algorithm for the block that
* contains this sibling.<br/>
* This SHALL contain the raw (e.g.) 384 bits (48 bytes) of the hash value.
*
*
* bytes sibling_hash = 2;
* @param value The siblingHash to set.
* @return This builder for chaining.
*/
public Builder setSiblingHash(com.google.protobuf.ByteString value) {
if (value == null) {
throw new NullPointerException();
}
siblingHash_ = value;
onChanged();
return this;
}
/**
*
**
* A byte array of a sibling hash.<br/>
* This is the hash for the sibling at this point in the merkle tree.
* <p>
* The algorithm for this hash SHALL match the algorithm for the block that
* contains this sibling.<br/>
* This SHALL contain the raw (e.g.) 384 bits (48 bytes) of the hash value.
*
*
* bytes sibling_hash = 2;
* @return This builder for chaining.
*/
public Builder clearSiblingHash() {
siblingHash_ = getDefaultInstance().getSiblingHash();
onChanged();
return this;
}
@java.lang.Override
public final Builder setUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.setUnknownFields(unknownFields);
}
@java.lang.Override
public final Builder mergeUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.mergeUnknownFields(unknownFields);
}
// @@protoc_insertion_point(builder_scope:com.hedera.hapi.block.stream.MerkleSiblingHash)
}
// @@protoc_insertion_point(class_scope:com.hedera.hapi.block.stream.MerkleSiblingHash)
private static final com.hedera.hapi.block.stream.protoc.MerkleSiblingHash DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new com.hedera.hapi.block.stream.protoc.MerkleSiblingHash();
}
public static com.hedera.hapi.block.stream.protoc.MerkleSiblingHash getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser
PARSER = new com.google.protobuf.AbstractParser() {
@java.lang.Override
public MerkleSiblingHash parsePartialFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return new MerkleSiblingHash(input, extensionRegistry);
}
};
public static com.google.protobuf.Parser parser() {
return PARSER;
}
@java.lang.Override
public com.google.protobuf.Parser getParserForType() {
return PARSER;
}
@java.lang.Override
public com.hedera.hapi.block.stream.protoc.MerkleSiblingHash getDefaultInstanceForType() {
return DEFAULT_INSTANCE;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy