All Downloads are FREE. Search and download functionalities are using the official Maven repository.

io.substrait.proto.HashJoinRel Maven / Gradle / Ivy

Go to download

Create a well-defined, cross-language specification for data compute operations

There is a newer version: 0.46.1
Show newest version
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: substrait/algebra.proto

// Protobuf Java Version: 3.25.5
package io.substrait.proto;

/**
 * 
 * The hash equijoin join operator will build a hash table out of the right input based on a set of join keys.
 * It will then probe that hash table for incoming inputs, finding matches.
 *
 * Two rows are a match if the comparison function returns true for all keys
 * 
* * Protobuf type {@code substrait.HashJoinRel} */ public final class HashJoinRel extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:substrait.HashJoinRel) HashJoinRelOrBuilder { private static final long serialVersionUID = 0L; // Use HashJoinRel.newBuilder() to construct. private HashJoinRel(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private HashJoinRel() { leftKeys_ = java.util.Collections.emptyList(); rightKeys_ = java.util.Collections.emptyList(); keys_ = java.util.Collections.emptyList(); type_ = 0; } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance( UnusedPrivateParameter unused) { return new HashJoinRel(); } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return io.substrait.proto.Algebra.internal_static_substrait_HashJoinRel_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return io.substrait.proto.Algebra.internal_static_substrait_HashJoinRel_fieldAccessorTable .ensureFieldAccessorsInitialized( io.substrait.proto.HashJoinRel.class, io.substrait.proto.HashJoinRel.Builder.class); } /** * Protobuf enum {@code substrait.HashJoinRel.JoinType} */ public enum JoinType implements com.google.protobuf.ProtocolMessageEnum { /** * JOIN_TYPE_UNSPECIFIED = 0; */ JOIN_TYPE_UNSPECIFIED(0), /** * JOIN_TYPE_INNER = 1; */ JOIN_TYPE_INNER(1), /** * JOIN_TYPE_OUTER = 2; */ JOIN_TYPE_OUTER(2), /** * JOIN_TYPE_LEFT = 3; */ JOIN_TYPE_LEFT(3), /** * JOIN_TYPE_RIGHT = 4; */ JOIN_TYPE_RIGHT(4), /** * JOIN_TYPE_LEFT_SEMI = 5; */ JOIN_TYPE_LEFT_SEMI(5), /** * JOIN_TYPE_RIGHT_SEMI = 6; */ JOIN_TYPE_RIGHT_SEMI(6), /** * JOIN_TYPE_LEFT_ANTI = 7; */ JOIN_TYPE_LEFT_ANTI(7), /** * JOIN_TYPE_RIGHT_ANTI = 8; */ JOIN_TYPE_RIGHT_ANTI(8), /** * JOIN_TYPE_LEFT_SINGLE = 9; */ JOIN_TYPE_LEFT_SINGLE(9), /** * JOIN_TYPE_RIGHT_SINGLE = 10; */ JOIN_TYPE_RIGHT_SINGLE(10), /** * JOIN_TYPE_LEFT_MARK = 11; */ JOIN_TYPE_LEFT_MARK(11), /** * JOIN_TYPE_RIGHT_MARK = 12; */ JOIN_TYPE_RIGHT_MARK(12), UNRECOGNIZED(-1), ; /** * JOIN_TYPE_UNSPECIFIED = 0; */ public static final int JOIN_TYPE_UNSPECIFIED_VALUE = 0; /** * JOIN_TYPE_INNER = 1; */ public static final int JOIN_TYPE_INNER_VALUE = 1; /** * JOIN_TYPE_OUTER = 2; */ public static final int JOIN_TYPE_OUTER_VALUE = 2; /** * JOIN_TYPE_LEFT = 3; */ public static final int JOIN_TYPE_LEFT_VALUE = 3; /** * JOIN_TYPE_RIGHT = 4; */ public static final int JOIN_TYPE_RIGHT_VALUE = 4; /** * JOIN_TYPE_LEFT_SEMI = 5; */ public static final int JOIN_TYPE_LEFT_SEMI_VALUE = 5; /** * JOIN_TYPE_RIGHT_SEMI = 6; */ public static final int JOIN_TYPE_RIGHT_SEMI_VALUE = 6; /** * JOIN_TYPE_LEFT_ANTI = 7; */ public static final int JOIN_TYPE_LEFT_ANTI_VALUE = 7; /** * JOIN_TYPE_RIGHT_ANTI = 8; */ public static final int JOIN_TYPE_RIGHT_ANTI_VALUE = 8; /** * JOIN_TYPE_LEFT_SINGLE = 9; */ public static final int JOIN_TYPE_LEFT_SINGLE_VALUE = 9; /** * JOIN_TYPE_RIGHT_SINGLE = 10; */ public static final int JOIN_TYPE_RIGHT_SINGLE_VALUE = 10; /** * JOIN_TYPE_LEFT_MARK = 11; */ public static final int JOIN_TYPE_LEFT_MARK_VALUE = 11; /** * JOIN_TYPE_RIGHT_MARK = 12; */ public static final int JOIN_TYPE_RIGHT_MARK_VALUE = 12; public final int getNumber() { if (this == UNRECOGNIZED) { throw new java.lang.IllegalArgumentException( "Can't get the number of an unknown enum value."); } return value; } /** * @param value The numeric wire value of the corresponding enum entry. * @return The enum associated with the given numeric wire value. * @deprecated Use {@link #forNumber(int)} instead. */ @java.lang.Deprecated public static JoinType valueOf(int value) { return forNumber(value); } /** * @param value The numeric wire value of the corresponding enum entry. * @return The enum associated with the given numeric wire value. */ public static JoinType forNumber(int value) { switch (value) { case 0: return JOIN_TYPE_UNSPECIFIED; case 1: return JOIN_TYPE_INNER; case 2: return JOIN_TYPE_OUTER; case 3: return JOIN_TYPE_LEFT; case 4: return JOIN_TYPE_RIGHT; case 5: return JOIN_TYPE_LEFT_SEMI; case 6: return JOIN_TYPE_RIGHT_SEMI; case 7: return JOIN_TYPE_LEFT_ANTI; case 8: return JOIN_TYPE_RIGHT_ANTI; case 9: return JOIN_TYPE_LEFT_SINGLE; case 10: return JOIN_TYPE_RIGHT_SINGLE; case 11: return JOIN_TYPE_LEFT_MARK; case 12: return JOIN_TYPE_RIGHT_MARK; default: return null; } } public static com.google.protobuf.Internal.EnumLiteMap internalGetValueMap() { return internalValueMap; } private static final com.google.protobuf.Internal.EnumLiteMap< JoinType> internalValueMap = new com.google.protobuf.Internal.EnumLiteMap() { public JoinType findValueByNumber(int number) { return JoinType.forNumber(number); } }; public final com.google.protobuf.Descriptors.EnumValueDescriptor getValueDescriptor() { if (this == UNRECOGNIZED) { throw new java.lang.IllegalStateException( "Can't get the descriptor of an unrecognized enum value."); } return getDescriptor().getValues().get(ordinal()); } public final com.google.protobuf.Descriptors.EnumDescriptor getDescriptorForType() { return getDescriptor(); } public static final com.google.protobuf.Descriptors.EnumDescriptor getDescriptor() { return io.substrait.proto.HashJoinRel.getDescriptor().getEnumTypes().get(0); } private static final JoinType[] VALUES = values(); public static JoinType valueOf( com.google.protobuf.Descriptors.EnumValueDescriptor desc) { if (desc.getType() != getDescriptor()) { throw new java.lang.IllegalArgumentException( "EnumValueDescriptor is not for this type."); } if (desc.getIndex() == -1) { return UNRECOGNIZED; } return VALUES[desc.getIndex()]; } private final int value; private JoinType(int value) { this.value = value; } // @@protoc_insertion_point(enum_scope:substrait.HashJoinRel.JoinType) } private int bitField0_; public static final int COMMON_FIELD_NUMBER = 1; private io.substrait.proto.RelCommon common_; /** * .substrait.RelCommon common = 1; * @return Whether the common field is set. */ @java.lang.Override public boolean hasCommon() { return ((bitField0_ & 0x00000001) != 0); } /** * .substrait.RelCommon common = 1; * @return The common. */ @java.lang.Override public io.substrait.proto.RelCommon getCommon() { return common_ == null ? io.substrait.proto.RelCommon.getDefaultInstance() : common_; } /** * .substrait.RelCommon common = 1; */ @java.lang.Override public io.substrait.proto.RelCommonOrBuilder getCommonOrBuilder() { return common_ == null ? io.substrait.proto.RelCommon.getDefaultInstance() : common_; } public static final int LEFT_FIELD_NUMBER = 2; private io.substrait.proto.Rel left_; /** * .substrait.Rel left = 2; * @return Whether the left field is set. */ @java.lang.Override public boolean hasLeft() { return ((bitField0_ & 0x00000002) != 0); } /** * .substrait.Rel left = 2; * @return The left. */ @java.lang.Override public io.substrait.proto.Rel getLeft() { return left_ == null ? io.substrait.proto.Rel.getDefaultInstance() : left_; } /** * .substrait.Rel left = 2; */ @java.lang.Override public io.substrait.proto.RelOrBuilder getLeftOrBuilder() { return left_ == null ? io.substrait.proto.Rel.getDefaultInstance() : left_; } public static final int RIGHT_FIELD_NUMBER = 3; private io.substrait.proto.Rel right_; /** * .substrait.Rel right = 3; * @return Whether the right field is set. */ @java.lang.Override public boolean hasRight() { return ((bitField0_ & 0x00000004) != 0); } /** * .substrait.Rel right = 3; * @return The right. */ @java.lang.Override public io.substrait.proto.Rel getRight() { return right_ == null ? io.substrait.proto.Rel.getDefaultInstance() : right_; } /** * .substrait.Rel right = 3; */ @java.lang.Override public io.substrait.proto.RelOrBuilder getRightOrBuilder() { return right_ == null ? io.substrait.proto.Rel.getDefaultInstance() : right_; } public static final int LEFT_KEYS_FIELD_NUMBER = 4; @SuppressWarnings("serial") private java.util.List leftKeys_; /** *
   * These fields are deprecated in favor of `keys`.  If they are set then
   * the two lists (left_keys and right_keys) must have the same length and
   * the comparion function is considered to be SimpleEqualityType::EQ
   * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public java.util.List getLeftKeysList() { return leftKeys_; } /** *
   * These fields are deprecated in favor of `keys`.  If they are set then
   * the two lists (left_keys and right_keys) must have the same length and
   * the comparion function is considered to be SimpleEqualityType::EQ
   * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public java.util.List getLeftKeysOrBuilderList() { return leftKeys_; } /** *
   * These fields are deprecated in favor of `keys`.  If they are set then
   * the two lists (left_keys and right_keys) must have the same length and
   * the comparion function is considered to be SimpleEqualityType::EQ
   * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public int getLeftKeysCount() { return leftKeys_.size(); } /** *
   * These fields are deprecated in favor of `keys`.  If they are set then
   * the two lists (left_keys and right_keys) must have the same length and
   * the comparion function is considered to be SimpleEqualityType::EQ
   * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference getLeftKeys(int index) { return leftKeys_.get(index); } /** *
   * These fields are deprecated in favor of `keys`.  If they are set then
   * the two lists (left_keys and right_keys) must have the same length and
   * the comparion function is considered to be SimpleEqualityType::EQ
   * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public io.substrait.proto.Expression.FieldReferenceOrBuilder getLeftKeysOrBuilder( int index) { return leftKeys_.get(index); } public static final int RIGHT_KEYS_FIELD_NUMBER = 5; @SuppressWarnings("serial") private java.util.List rightKeys_; /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public java.util.List getRightKeysList() { return rightKeys_; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public java.util.List getRightKeysOrBuilderList() { return rightKeys_; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public int getRightKeysCount() { return rightKeys_.size(); } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference getRightKeys(int index) { return rightKeys_.get(index); } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Override @java.lang.Deprecated public io.substrait.proto.Expression.FieldReferenceOrBuilder getRightKeysOrBuilder( int index) { return rightKeys_.get(index); } public static final int KEYS_FIELD_NUMBER = 8; @SuppressWarnings("serial") private java.util.List keys_; /** *
   * One or more keys to join on.  The relation is invalid if this is empty
   * (unless the deprecated left_keys/right_keys fields are being used).
   *
   * If a custom comparison function is used then it must be consistent with
   * the hash function used for the keys.
   *
   * In other words, the hash function must return the same hash code when the
   * comparison returns true.  For example, if the comparison function is
   * "equals ignoring case" then the hash function must return the same hash
   * code for strings that differ only by case.  Note: the hash function is not
   * specified here.  It is the responsibility of the consumer to find an appropriate
   * hash function for a given comparsion function or to reject the plan if it cannot
   * do so.
   * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ @java.lang.Override public java.util.List getKeysList() { return keys_; } /** *
   * One or more keys to join on.  The relation is invalid if this is empty
   * (unless the deprecated left_keys/right_keys fields are being used).
   *
   * If a custom comparison function is used then it must be consistent with
   * the hash function used for the keys.
   *
   * In other words, the hash function must return the same hash code when the
   * comparison returns true.  For example, if the comparison function is
   * "equals ignoring case" then the hash function must return the same hash
   * code for strings that differ only by case.  Note: the hash function is not
   * specified here.  It is the responsibility of the consumer to find an appropriate
   * hash function for a given comparsion function or to reject the plan if it cannot
   * do so.
   * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ @java.lang.Override public java.util.List getKeysOrBuilderList() { return keys_; } /** *
   * One or more keys to join on.  The relation is invalid if this is empty
   * (unless the deprecated left_keys/right_keys fields are being used).
   *
   * If a custom comparison function is used then it must be consistent with
   * the hash function used for the keys.
   *
   * In other words, the hash function must return the same hash code when the
   * comparison returns true.  For example, if the comparison function is
   * "equals ignoring case" then the hash function must return the same hash
   * code for strings that differ only by case.  Note: the hash function is not
   * specified here.  It is the responsibility of the consumer to find an appropriate
   * hash function for a given comparsion function or to reject the plan if it cannot
   * do so.
   * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ @java.lang.Override public int getKeysCount() { return keys_.size(); } /** *
   * One or more keys to join on.  The relation is invalid if this is empty
   * (unless the deprecated left_keys/right_keys fields are being used).
   *
   * If a custom comparison function is used then it must be consistent with
   * the hash function used for the keys.
   *
   * In other words, the hash function must return the same hash code when the
   * comparison returns true.  For example, if the comparison function is
   * "equals ignoring case" then the hash function must return the same hash
   * code for strings that differ only by case.  Note: the hash function is not
   * specified here.  It is the responsibility of the consumer to find an appropriate
   * hash function for a given comparsion function or to reject the plan if it cannot
   * do so.
   * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ @java.lang.Override public io.substrait.proto.ComparisonJoinKey getKeys(int index) { return keys_.get(index); } /** *
   * One or more keys to join on.  The relation is invalid if this is empty
   * (unless the deprecated left_keys/right_keys fields are being used).
   *
   * If a custom comparison function is used then it must be consistent with
   * the hash function used for the keys.
   *
   * In other words, the hash function must return the same hash code when the
   * comparison returns true.  For example, if the comparison function is
   * "equals ignoring case" then the hash function must return the same hash
   * code for strings that differ only by case.  Note: the hash function is not
   * specified here.  It is the responsibility of the consumer to find an appropriate
   * hash function for a given comparsion function or to reject the plan if it cannot
   * do so.
   * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ @java.lang.Override public io.substrait.proto.ComparisonJoinKeyOrBuilder getKeysOrBuilder( int index) { return keys_.get(index); } public static final int POST_JOIN_FILTER_FIELD_NUMBER = 6; private io.substrait.proto.Expression postJoinFilter_; /** * .substrait.Expression post_join_filter = 6; * @return Whether the postJoinFilter field is set. */ @java.lang.Override public boolean hasPostJoinFilter() { return ((bitField0_ & 0x00000008) != 0); } /** * .substrait.Expression post_join_filter = 6; * @return The postJoinFilter. */ @java.lang.Override public io.substrait.proto.Expression getPostJoinFilter() { return postJoinFilter_ == null ? io.substrait.proto.Expression.getDefaultInstance() : postJoinFilter_; } /** * .substrait.Expression post_join_filter = 6; */ @java.lang.Override public io.substrait.proto.ExpressionOrBuilder getPostJoinFilterOrBuilder() { return postJoinFilter_ == null ? io.substrait.proto.Expression.getDefaultInstance() : postJoinFilter_; } public static final int TYPE_FIELD_NUMBER = 7; private int type_ = 0; /** * .substrait.HashJoinRel.JoinType type = 7; * @return The enum numeric value on the wire for type. */ @java.lang.Override public int getTypeValue() { return type_; } /** * .substrait.HashJoinRel.JoinType type = 7; * @return The type. */ @java.lang.Override public io.substrait.proto.HashJoinRel.JoinType getType() { io.substrait.proto.HashJoinRel.JoinType result = io.substrait.proto.HashJoinRel.JoinType.forNumber(type_); return result == null ? io.substrait.proto.HashJoinRel.JoinType.UNRECOGNIZED : result; } public static final int ADVANCED_EXTENSION_FIELD_NUMBER = 10; private io.substrait.proto.AdvancedExtension advancedExtension_; /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; * @return Whether the advancedExtension field is set. */ @java.lang.Override public boolean hasAdvancedExtension() { return ((bitField0_ & 0x00000010) != 0); } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; * @return The advancedExtension. */ @java.lang.Override public io.substrait.proto.AdvancedExtension getAdvancedExtension() { return advancedExtension_ == null ? io.substrait.proto.AdvancedExtension.getDefaultInstance() : advancedExtension_; } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ @java.lang.Override public io.substrait.proto.AdvancedExtensionOrBuilder getAdvancedExtensionOrBuilder() { return advancedExtension_ == null ? io.substrait.proto.AdvancedExtension.getDefaultInstance() : advancedExtension_; } 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 (((bitField0_ & 0x00000001) != 0)) { output.writeMessage(1, getCommon()); } if (((bitField0_ & 0x00000002) != 0)) { output.writeMessage(2, getLeft()); } if (((bitField0_ & 0x00000004) != 0)) { output.writeMessage(3, getRight()); } for (int i = 0; i < leftKeys_.size(); i++) { output.writeMessage(4, leftKeys_.get(i)); } for (int i = 0; i < rightKeys_.size(); i++) { output.writeMessage(5, rightKeys_.get(i)); } if (((bitField0_ & 0x00000008) != 0)) { output.writeMessage(6, getPostJoinFilter()); } if (type_ != io.substrait.proto.HashJoinRel.JoinType.JOIN_TYPE_UNSPECIFIED.getNumber()) { output.writeEnum(7, type_); } for (int i = 0; i < keys_.size(); i++) { output.writeMessage(8, keys_.get(i)); } if (((bitField0_ & 0x00000010) != 0)) { output.writeMessage(10, getAdvancedExtension()); } getUnknownFields().writeTo(output); } @java.lang.Override public int getSerializedSize() { int size = memoizedSize; if (size != -1) return size; size = 0; if (((bitField0_ & 0x00000001) != 0)) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(1, getCommon()); } if (((bitField0_ & 0x00000002) != 0)) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(2, getLeft()); } if (((bitField0_ & 0x00000004) != 0)) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(3, getRight()); } for (int i = 0; i < leftKeys_.size(); i++) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(4, leftKeys_.get(i)); } for (int i = 0; i < rightKeys_.size(); i++) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(5, rightKeys_.get(i)); } if (((bitField0_ & 0x00000008) != 0)) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(6, getPostJoinFilter()); } if (type_ != io.substrait.proto.HashJoinRel.JoinType.JOIN_TYPE_UNSPECIFIED.getNumber()) { size += com.google.protobuf.CodedOutputStream .computeEnumSize(7, type_); } for (int i = 0; i < keys_.size(); i++) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(8, keys_.get(i)); } if (((bitField0_ & 0x00000010) != 0)) { size += com.google.protobuf.CodedOutputStream .computeMessageSize(10, getAdvancedExtension()); } size += getUnknownFields().getSerializedSize(); memoizedSize = size; return size; } @java.lang.Override public boolean equals(final java.lang.Object obj) { if (obj == this) { return true; } if (!(obj instanceof io.substrait.proto.HashJoinRel)) { return super.equals(obj); } io.substrait.proto.HashJoinRel other = (io.substrait.proto.HashJoinRel) obj; if (hasCommon() != other.hasCommon()) return false; if (hasCommon()) { if (!getCommon() .equals(other.getCommon())) return false; } if (hasLeft() != other.hasLeft()) return false; if (hasLeft()) { if (!getLeft() .equals(other.getLeft())) return false; } if (hasRight() != other.hasRight()) return false; if (hasRight()) { if (!getRight() .equals(other.getRight())) return false; } if (!getLeftKeysList() .equals(other.getLeftKeysList())) return false; if (!getRightKeysList() .equals(other.getRightKeysList())) return false; if (!getKeysList() .equals(other.getKeysList())) return false; if (hasPostJoinFilter() != other.hasPostJoinFilter()) return false; if (hasPostJoinFilter()) { if (!getPostJoinFilter() .equals(other.getPostJoinFilter())) return false; } if (type_ != other.type_) return false; if (hasAdvancedExtension() != other.hasAdvancedExtension()) return false; if (hasAdvancedExtension()) { if (!getAdvancedExtension() .equals(other.getAdvancedExtension())) return false; } if (!getUnknownFields().equals(other.getUnknownFields())) return false; return true; } @java.lang.Override public int hashCode() { if (memoizedHashCode != 0) { return memoizedHashCode; } int hash = 41; hash = (19 * hash) + getDescriptor().hashCode(); if (hasCommon()) { hash = (37 * hash) + COMMON_FIELD_NUMBER; hash = (53 * hash) + getCommon().hashCode(); } if (hasLeft()) { hash = (37 * hash) + LEFT_FIELD_NUMBER; hash = (53 * hash) + getLeft().hashCode(); } if (hasRight()) { hash = (37 * hash) + RIGHT_FIELD_NUMBER; hash = (53 * hash) + getRight().hashCode(); } if (getLeftKeysCount() > 0) { hash = (37 * hash) + LEFT_KEYS_FIELD_NUMBER; hash = (53 * hash) + getLeftKeysList().hashCode(); } if (getRightKeysCount() > 0) { hash = (37 * hash) + RIGHT_KEYS_FIELD_NUMBER; hash = (53 * hash) + getRightKeysList().hashCode(); } if (getKeysCount() > 0) { hash = (37 * hash) + KEYS_FIELD_NUMBER; hash = (53 * hash) + getKeysList().hashCode(); } if (hasPostJoinFilter()) { hash = (37 * hash) + POST_JOIN_FILTER_FIELD_NUMBER; hash = (53 * hash) + getPostJoinFilter().hashCode(); } hash = (37 * hash) + TYPE_FIELD_NUMBER; hash = (53 * hash) + type_; if (hasAdvancedExtension()) { hash = (37 * hash) + ADVANCED_EXTENSION_FIELD_NUMBER; hash = (53 * hash) + getAdvancedExtension().hashCode(); } hash = (29 * hash) + getUnknownFields().hashCode(); memoizedHashCode = hash; return hash; } public static io.substrait.proto.HashJoinRel parseFrom( java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static io.substrait.proto.HashJoinRel parseFrom( java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static io.substrait.proto.HashJoinRel parseFrom( com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static io.substrait.proto.HashJoinRel parseFrom( com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static io.substrait.proto.HashJoinRel parseFrom(byte[] data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static io.substrait.proto.HashJoinRel parseFrom( byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static io.substrait.proto.HashJoinRel parseFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static io.substrait.proto.HashJoinRel 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 io.substrait.proto.HashJoinRel parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input); } public static io.substrait.proto.HashJoinRel 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 io.substrait.proto.HashJoinRel parseFrom( com.google.protobuf.CodedInputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static io.substrait.proto.HashJoinRel 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(io.substrait.proto.HashJoinRel 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; } /** *
   * The hash equijoin join operator will build a hash table out of the right input based on a set of join keys.
   * It will then probe that hash table for incoming inputs, finding matches.
   *
   * Two rows are a match if the comparison function returns true for all keys
   * 
* * Protobuf type {@code substrait.HashJoinRel} */ public static final class Builder extends com.google.protobuf.GeneratedMessageV3.Builder implements // @@protoc_insertion_point(builder_implements:substrait.HashJoinRel) io.substrait.proto.HashJoinRelOrBuilder { public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return io.substrait.proto.Algebra.internal_static_substrait_HashJoinRel_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return io.substrait.proto.Algebra.internal_static_substrait_HashJoinRel_fieldAccessorTable .ensureFieldAccessorsInitialized( io.substrait.proto.HashJoinRel.class, io.substrait.proto.HashJoinRel.Builder.class); } // Construct using io.substrait.proto.HashJoinRel.newBuilder() private Builder() { maybeForceBuilderInitialization(); } private Builder( com.google.protobuf.GeneratedMessageV3.BuilderParent parent) { super(parent); maybeForceBuilderInitialization(); } private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3 .alwaysUseFieldBuilders) { getCommonFieldBuilder(); getLeftFieldBuilder(); getRightFieldBuilder(); getLeftKeysFieldBuilder(); getRightKeysFieldBuilder(); getKeysFieldBuilder(); getPostJoinFilterFieldBuilder(); getAdvancedExtensionFieldBuilder(); } } @java.lang.Override public Builder clear() { super.clear(); bitField0_ = 0; common_ = null; if (commonBuilder_ != null) { commonBuilder_.dispose(); commonBuilder_ = null; } left_ = null; if (leftBuilder_ != null) { leftBuilder_.dispose(); leftBuilder_ = null; } right_ = null; if (rightBuilder_ != null) { rightBuilder_.dispose(); rightBuilder_ = null; } if (leftKeysBuilder_ == null) { leftKeys_ = java.util.Collections.emptyList(); } else { leftKeys_ = null; leftKeysBuilder_.clear(); } bitField0_ = (bitField0_ & ~0x00000008); if (rightKeysBuilder_ == null) { rightKeys_ = java.util.Collections.emptyList(); } else { rightKeys_ = null; rightKeysBuilder_.clear(); } bitField0_ = (bitField0_ & ~0x00000010); if (keysBuilder_ == null) { keys_ = java.util.Collections.emptyList(); } else { keys_ = null; keysBuilder_.clear(); } bitField0_ = (bitField0_ & ~0x00000020); postJoinFilter_ = null; if (postJoinFilterBuilder_ != null) { postJoinFilterBuilder_.dispose(); postJoinFilterBuilder_ = null; } type_ = 0; advancedExtension_ = null; if (advancedExtensionBuilder_ != null) { advancedExtensionBuilder_.dispose(); advancedExtensionBuilder_ = null; } return this; } @java.lang.Override public com.google.protobuf.Descriptors.Descriptor getDescriptorForType() { return io.substrait.proto.Algebra.internal_static_substrait_HashJoinRel_descriptor; } @java.lang.Override public io.substrait.proto.HashJoinRel getDefaultInstanceForType() { return io.substrait.proto.HashJoinRel.getDefaultInstance(); } @java.lang.Override public io.substrait.proto.HashJoinRel build() { io.substrait.proto.HashJoinRel result = buildPartial(); if (!result.isInitialized()) { throw newUninitializedMessageException(result); } return result; } @java.lang.Override public io.substrait.proto.HashJoinRel buildPartial() { io.substrait.proto.HashJoinRel result = new io.substrait.proto.HashJoinRel(this); buildPartialRepeatedFields(result); if (bitField0_ != 0) { buildPartial0(result); } onBuilt(); return result; } private void buildPartialRepeatedFields(io.substrait.proto.HashJoinRel result) { if (leftKeysBuilder_ == null) { if (((bitField0_ & 0x00000008) != 0)) { leftKeys_ = java.util.Collections.unmodifiableList(leftKeys_); bitField0_ = (bitField0_ & ~0x00000008); } result.leftKeys_ = leftKeys_; } else { result.leftKeys_ = leftKeysBuilder_.build(); } if (rightKeysBuilder_ == null) { if (((bitField0_ & 0x00000010) != 0)) { rightKeys_ = java.util.Collections.unmodifiableList(rightKeys_); bitField0_ = (bitField0_ & ~0x00000010); } result.rightKeys_ = rightKeys_; } else { result.rightKeys_ = rightKeysBuilder_.build(); } if (keysBuilder_ == null) { if (((bitField0_ & 0x00000020) != 0)) { keys_ = java.util.Collections.unmodifiableList(keys_); bitField0_ = (bitField0_ & ~0x00000020); } result.keys_ = keys_; } else { result.keys_ = keysBuilder_.build(); } } private void buildPartial0(io.substrait.proto.HashJoinRel result) { int from_bitField0_ = bitField0_; int to_bitField0_ = 0; if (((from_bitField0_ & 0x00000001) != 0)) { result.common_ = commonBuilder_ == null ? common_ : commonBuilder_.build(); to_bitField0_ |= 0x00000001; } if (((from_bitField0_ & 0x00000002) != 0)) { result.left_ = leftBuilder_ == null ? left_ : leftBuilder_.build(); to_bitField0_ |= 0x00000002; } if (((from_bitField0_ & 0x00000004) != 0)) { result.right_ = rightBuilder_ == null ? right_ : rightBuilder_.build(); to_bitField0_ |= 0x00000004; } if (((from_bitField0_ & 0x00000040) != 0)) { result.postJoinFilter_ = postJoinFilterBuilder_ == null ? postJoinFilter_ : postJoinFilterBuilder_.build(); to_bitField0_ |= 0x00000008; } if (((from_bitField0_ & 0x00000080) != 0)) { result.type_ = type_; } if (((from_bitField0_ & 0x00000100) != 0)) { result.advancedExtension_ = advancedExtensionBuilder_ == null ? advancedExtension_ : advancedExtensionBuilder_.build(); to_bitField0_ |= 0x00000010; } result.bitField0_ |= to_bitField0_; } @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 io.substrait.proto.HashJoinRel) { return mergeFrom((io.substrait.proto.HashJoinRel)other); } else { super.mergeFrom(other); return this; } } public Builder mergeFrom(io.substrait.proto.HashJoinRel other) { if (other == io.substrait.proto.HashJoinRel.getDefaultInstance()) return this; if (other.hasCommon()) { mergeCommon(other.getCommon()); } if (other.hasLeft()) { mergeLeft(other.getLeft()); } if (other.hasRight()) { mergeRight(other.getRight()); } if (leftKeysBuilder_ == null) { if (!other.leftKeys_.isEmpty()) { if (leftKeys_.isEmpty()) { leftKeys_ = other.leftKeys_; bitField0_ = (bitField0_ & ~0x00000008); } else { ensureLeftKeysIsMutable(); leftKeys_.addAll(other.leftKeys_); } onChanged(); } } else { if (!other.leftKeys_.isEmpty()) { if (leftKeysBuilder_.isEmpty()) { leftKeysBuilder_.dispose(); leftKeysBuilder_ = null; leftKeys_ = other.leftKeys_; bitField0_ = (bitField0_ & ~0x00000008); leftKeysBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getLeftKeysFieldBuilder() : null; } else { leftKeysBuilder_.addAllMessages(other.leftKeys_); } } } if (rightKeysBuilder_ == null) { if (!other.rightKeys_.isEmpty()) { if (rightKeys_.isEmpty()) { rightKeys_ = other.rightKeys_; bitField0_ = (bitField0_ & ~0x00000010); } else { ensureRightKeysIsMutable(); rightKeys_.addAll(other.rightKeys_); } onChanged(); } } else { if (!other.rightKeys_.isEmpty()) { if (rightKeysBuilder_.isEmpty()) { rightKeysBuilder_.dispose(); rightKeysBuilder_ = null; rightKeys_ = other.rightKeys_; bitField0_ = (bitField0_ & ~0x00000010); rightKeysBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getRightKeysFieldBuilder() : null; } else { rightKeysBuilder_.addAllMessages(other.rightKeys_); } } } if (keysBuilder_ == null) { if (!other.keys_.isEmpty()) { if (keys_.isEmpty()) { keys_ = other.keys_; bitField0_ = (bitField0_ & ~0x00000020); } else { ensureKeysIsMutable(); keys_.addAll(other.keys_); } onChanged(); } } else { if (!other.keys_.isEmpty()) { if (keysBuilder_.isEmpty()) { keysBuilder_.dispose(); keysBuilder_ = null; keys_ = other.keys_; bitField0_ = (bitField0_ & ~0x00000020); keysBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getKeysFieldBuilder() : null; } else { keysBuilder_.addAllMessages(other.keys_); } } } if (other.hasPostJoinFilter()) { mergePostJoinFilter(other.getPostJoinFilter()); } if (other.type_ != 0) { setTypeValue(other.getTypeValue()); } if (other.hasAdvancedExtension()) { mergeAdvancedExtension(other.getAdvancedExtension()); } this.mergeUnknownFields(other.getUnknownFields()); 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 { if (extensionRegistry == null) { throw new java.lang.NullPointerException(); } try { boolean done = false; while (!done) { int tag = input.readTag(); switch (tag) { case 0: done = true; break; case 10: { input.readMessage( getCommonFieldBuilder().getBuilder(), extensionRegistry); bitField0_ |= 0x00000001; break; } // case 10 case 18: { input.readMessage( getLeftFieldBuilder().getBuilder(), extensionRegistry); bitField0_ |= 0x00000002; break; } // case 18 case 26: { input.readMessage( getRightFieldBuilder().getBuilder(), extensionRegistry); bitField0_ |= 0x00000004; break; } // case 26 case 34: { io.substrait.proto.Expression.FieldReference m = input.readMessage( io.substrait.proto.Expression.FieldReference.parser(), extensionRegistry); if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); leftKeys_.add(m); } else { leftKeysBuilder_.addMessage(m); } break; } // case 34 case 42: { io.substrait.proto.Expression.FieldReference m = input.readMessage( io.substrait.proto.Expression.FieldReference.parser(), extensionRegistry); if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); rightKeys_.add(m); } else { rightKeysBuilder_.addMessage(m); } break; } // case 42 case 50: { input.readMessage( getPostJoinFilterFieldBuilder().getBuilder(), extensionRegistry); bitField0_ |= 0x00000040; break; } // case 50 case 56: { type_ = input.readEnum(); bitField0_ |= 0x00000080; break; } // case 56 case 66: { io.substrait.proto.ComparisonJoinKey m = input.readMessage( io.substrait.proto.ComparisonJoinKey.parser(), extensionRegistry); if (keysBuilder_ == null) { ensureKeysIsMutable(); keys_.add(m); } else { keysBuilder_.addMessage(m); } break; } // case 66 case 82: { input.readMessage( getAdvancedExtensionFieldBuilder().getBuilder(), extensionRegistry); bitField0_ |= 0x00000100; break; } // case 82 default: { if (!super.parseUnknownField(input, extensionRegistry, tag)) { done = true; // was an endgroup tag } break; } // default: } // switch (tag) } // while (!done) } catch (com.google.protobuf.InvalidProtocolBufferException e) { throw e.unwrapIOException(); } finally { onChanged(); } // finally return this; } private int bitField0_; private io.substrait.proto.RelCommon common_; private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.RelCommon, io.substrait.proto.RelCommon.Builder, io.substrait.proto.RelCommonOrBuilder> commonBuilder_; /** * .substrait.RelCommon common = 1; * @return Whether the common field is set. */ public boolean hasCommon() { return ((bitField0_ & 0x00000001) != 0); } /** * .substrait.RelCommon common = 1; * @return The common. */ public io.substrait.proto.RelCommon getCommon() { if (commonBuilder_ == null) { return common_ == null ? io.substrait.proto.RelCommon.getDefaultInstance() : common_; } else { return commonBuilder_.getMessage(); } } /** * .substrait.RelCommon common = 1; */ public Builder setCommon(io.substrait.proto.RelCommon value) { if (commonBuilder_ == null) { if (value == null) { throw new NullPointerException(); } common_ = value; } else { commonBuilder_.setMessage(value); } bitField0_ |= 0x00000001; onChanged(); return this; } /** * .substrait.RelCommon common = 1; */ public Builder setCommon( io.substrait.proto.RelCommon.Builder builderForValue) { if (commonBuilder_ == null) { common_ = builderForValue.build(); } else { commonBuilder_.setMessage(builderForValue.build()); } bitField0_ |= 0x00000001; onChanged(); return this; } /** * .substrait.RelCommon common = 1; */ public Builder mergeCommon(io.substrait.proto.RelCommon value) { if (commonBuilder_ == null) { if (((bitField0_ & 0x00000001) != 0) && common_ != null && common_ != io.substrait.proto.RelCommon.getDefaultInstance()) { getCommonBuilder().mergeFrom(value); } else { common_ = value; } } else { commonBuilder_.mergeFrom(value); } if (common_ != null) { bitField0_ |= 0x00000001; onChanged(); } return this; } /** * .substrait.RelCommon common = 1; */ public Builder clearCommon() { bitField0_ = (bitField0_ & ~0x00000001); common_ = null; if (commonBuilder_ != null) { commonBuilder_.dispose(); commonBuilder_ = null; } onChanged(); return this; } /** * .substrait.RelCommon common = 1; */ public io.substrait.proto.RelCommon.Builder getCommonBuilder() { bitField0_ |= 0x00000001; onChanged(); return getCommonFieldBuilder().getBuilder(); } /** * .substrait.RelCommon common = 1; */ public io.substrait.proto.RelCommonOrBuilder getCommonOrBuilder() { if (commonBuilder_ != null) { return commonBuilder_.getMessageOrBuilder(); } else { return common_ == null ? io.substrait.proto.RelCommon.getDefaultInstance() : common_; } } /** * .substrait.RelCommon common = 1; */ private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.RelCommon, io.substrait.proto.RelCommon.Builder, io.substrait.proto.RelCommonOrBuilder> getCommonFieldBuilder() { if (commonBuilder_ == null) { commonBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.RelCommon, io.substrait.proto.RelCommon.Builder, io.substrait.proto.RelCommonOrBuilder>( getCommon(), getParentForChildren(), isClean()); common_ = null; } return commonBuilder_; } private io.substrait.proto.Rel left_; private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder> leftBuilder_; /** * .substrait.Rel left = 2; * @return Whether the left field is set. */ public boolean hasLeft() { return ((bitField0_ & 0x00000002) != 0); } /** * .substrait.Rel left = 2; * @return The left. */ public io.substrait.proto.Rel getLeft() { if (leftBuilder_ == null) { return left_ == null ? io.substrait.proto.Rel.getDefaultInstance() : left_; } else { return leftBuilder_.getMessage(); } } /** * .substrait.Rel left = 2; */ public Builder setLeft(io.substrait.proto.Rel value) { if (leftBuilder_ == null) { if (value == null) { throw new NullPointerException(); } left_ = value; } else { leftBuilder_.setMessage(value); } bitField0_ |= 0x00000002; onChanged(); return this; } /** * .substrait.Rel left = 2; */ public Builder setLeft( io.substrait.proto.Rel.Builder builderForValue) { if (leftBuilder_ == null) { left_ = builderForValue.build(); } else { leftBuilder_.setMessage(builderForValue.build()); } bitField0_ |= 0x00000002; onChanged(); return this; } /** * .substrait.Rel left = 2; */ public Builder mergeLeft(io.substrait.proto.Rel value) { if (leftBuilder_ == null) { if (((bitField0_ & 0x00000002) != 0) && left_ != null && left_ != io.substrait.proto.Rel.getDefaultInstance()) { getLeftBuilder().mergeFrom(value); } else { left_ = value; } } else { leftBuilder_.mergeFrom(value); } if (left_ != null) { bitField0_ |= 0x00000002; onChanged(); } return this; } /** * .substrait.Rel left = 2; */ public Builder clearLeft() { bitField0_ = (bitField0_ & ~0x00000002); left_ = null; if (leftBuilder_ != null) { leftBuilder_.dispose(); leftBuilder_ = null; } onChanged(); return this; } /** * .substrait.Rel left = 2; */ public io.substrait.proto.Rel.Builder getLeftBuilder() { bitField0_ |= 0x00000002; onChanged(); return getLeftFieldBuilder().getBuilder(); } /** * .substrait.Rel left = 2; */ public io.substrait.proto.RelOrBuilder getLeftOrBuilder() { if (leftBuilder_ != null) { return leftBuilder_.getMessageOrBuilder(); } else { return left_ == null ? io.substrait.proto.Rel.getDefaultInstance() : left_; } } /** * .substrait.Rel left = 2; */ private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder> getLeftFieldBuilder() { if (leftBuilder_ == null) { leftBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder>( getLeft(), getParentForChildren(), isClean()); left_ = null; } return leftBuilder_; } private io.substrait.proto.Rel right_; private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder> rightBuilder_; /** * .substrait.Rel right = 3; * @return Whether the right field is set. */ public boolean hasRight() { return ((bitField0_ & 0x00000004) != 0); } /** * .substrait.Rel right = 3; * @return The right. */ public io.substrait.proto.Rel getRight() { if (rightBuilder_ == null) { return right_ == null ? io.substrait.proto.Rel.getDefaultInstance() : right_; } else { return rightBuilder_.getMessage(); } } /** * .substrait.Rel right = 3; */ public Builder setRight(io.substrait.proto.Rel value) { if (rightBuilder_ == null) { if (value == null) { throw new NullPointerException(); } right_ = value; } else { rightBuilder_.setMessage(value); } bitField0_ |= 0x00000004; onChanged(); return this; } /** * .substrait.Rel right = 3; */ public Builder setRight( io.substrait.proto.Rel.Builder builderForValue) { if (rightBuilder_ == null) { right_ = builderForValue.build(); } else { rightBuilder_.setMessage(builderForValue.build()); } bitField0_ |= 0x00000004; onChanged(); return this; } /** * .substrait.Rel right = 3; */ public Builder mergeRight(io.substrait.proto.Rel value) { if (rightBuilder_ == null) { if (((bitField0_ & 0x00000004) != 0) && right_ != null && right_ != io.substrait.proto.Rel.getDefaultInstance()) { getRightBuilder().mergeFrom(value); } else { right_ = value; } } else { rightBuilder_.mergeFrom(value); } if (right_ != null) { bitField0_ |= 0x00000004; onChanged(); } return this; } /** * .substrait.Rel right = 3; */ public Builder clearRight() { bitField0_ = (bitField0_ & ~0x00000004); right_ = null; if (rightBuilder_ != null) { rightBuilder_.dispose(); rightBuilder_ = null; } onChanged(); return this; } /** * .substrait.Rel right = 3; */ public io.substrait.proto.Rel.Builder getRightBuilder() { bitField0_ |= 0x00000004; onChanged(); return getRightFieldBuilder().getBuilder(); } /** * .substrait.Rel right = 3; */ public io.substrait.proto.RelOrBuilder getRightOrBuilder() { if (rightBuilder_ != null) { return rightBuilder_.getMessageOrBuilder(); } else { return right_ == null ? io.substrait.proto.Rel.getDefaultInstance() : right_; } } /** * .substrait.Rel right = 3; */ private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder> getRightFieldBuilder() { if (rightBuilder_ == null) { rightBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Rel, io.substrait.proto.Rel.Builder, io.substrait.proto.RelOrBuilder>( getRight(), getParentForChildren(), isClean()); right_ = null; } return rightBuilder_; } private java.util.List leftKeys_ = java.util.Collections.emptyList(); private void ensureLeftKeysIsMutable() { if (!((bitField0_ & 0x00000008) != 0)) { leftKeys_ = new java.util.ArrayList(leftKeys_); bitField0_ |= 0x00000008; } } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder> leftKeysBuilder_; /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getLeftKeysList() { if (leftKeysBuilder_ == null) { return java.util.Collections.unmodifiableList(leftKeys_); } else { return leftKeysBuilder_.getMessageList(); } } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public int getLeftKeysCount() { if (leftKeysBuilder_ == null) { return leftKeys_.size(); } else { return leftKeysBuilder_.getCount(); } } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference getLeftKeys(int index) { if (leftKeysBuilder_ == null) { return leftKeys_.get(index); } else { return leftKeysBuilder_.getMessage(index); } } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder setLeftKeys( int index, io.substrait.proto.Expression.FieldReference value) { if (leftKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureLeftKeysIsMutable(); leftKeys_.set(index, value); onChanged(); } else { leftKeysBuilder_.setMessage(index, value); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder setLeftKeys( int index, io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); leftKeys_.set(index, builderForValue.build()); onChanged(); } else { leftKeysBuilder_.setMessage(index, builderForValue.build()); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder addLeftKeys(io.substrait.proto.Expression.FieldReference value) { if (leftKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureLeftKeysIsMutable(); leftKeys_.add(value); onChanged(); } else { leftKeysBuilder_.addMessage(value); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder addLeftKeys( int index, io.substrait.proto.Expression.FieldReference value) { if (leftKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureLeftKeysIsMutable(); leftKeys_.add(index, value); onChanged(); } else { leftKeysBuilder_.addMessage(index, value); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder addLeftKeys( io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); leftKeys_.add(builderForValue.build()); onChanged(); } else { leftKeysBuilder_.addMessage(builderForValue.build()); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder addLeftKeys( int index, io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); leftKeys_.add(index, builderForValue.build()); onChanged(); } else { leftKeysBuilder_.addMessage(index, builderForValue.build()); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder addAllLeftKeys( java.lang.Iterable values) { if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, leftKeys_); onChanged(); } else { leftKeysBuilder_.addAllMessages(values); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder clearLeftKeys() { if (leftKeysBuilder_ == null) { leftKeys_ = java.util.Collections.emptyList(); bitField0_ = (bitField0_ & ~0x00000008); onChanged(); } else { leftKeysBuilder_.clear(); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public Builder removeLeftKeys(int index) { if (leftKeysBuilder_ == null) { ensureLeftKeysIsMutable(); leftKeys_.remove(index); onChanged(); } else { leftKeysBuilder_.remove(index); } return this; } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder getLeftKeysBuilder( int index) { return getLeftKeysFieldBuilder().getBuilder(index); } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReferenceOrBuilder getLeftKeysOrBuilder( int index) { if (leftKeysBuilder_ == null) { return leftKeys_.get(index); } else { return leftKeysBuilder_.getMessageOrBuilder(index); } } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getLeftKeysOrBuilderList() { if (leftKeysBuilder_ != null) { return leftKeysBuilder_.getMessageOrBuilderList(); } else { return java.util.Collections.unmodifiableList(leftKeys_); } } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder addLeftKeysBuilder() { return getLeftKeysFieldBuilder().addBuilder( io.substrait.proto.Expression.FieldReference.getDefaultInstance()); } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder addLeftKeysBuilder( int index) { return getLeftKeysFieldBuilder().addBuilder( index, io.substrait.proto.Expression.FieldReference.getDefaultInstance()); } /** *
     * These fields are deprecated in favor of `keys`.  If they are set then
     * the two lists (left_keys and right_keys) must have the same length and
     * the comparion function is considered to be SimpleEqualityType::EQ
     * 
* * repeated .substrait.Expression.FieldReference left_keys = 4 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getLeftKeysBuilderList() { return getLeftKeysFieldBuilder().getBuilderList(); } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder> getLeftKeysFieldBuilder() { if (leftKeysBuilder_ == null) { leftKeysBuilder_ = new com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder>( leftKeys_, ((bitField0_ & 0x00000008) != 0), getParentForChildren(), isClean()); leftKeys_ = null; } return leftKeysBuilder_; } private java.util.List rightKeys_ = java.util.Collections.emptyList(); private void ensureRightKeysIsMutable() { if (!((bitField0_ & 0x00000010) != 0)) { rightKeys_ = new java.util.ArrayList(rightKeys_); bitField0_ |= 0x00000010; } } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder> rightKeysBuilder_; /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getRightKeysList() { if (rightKeysBuilder_ == null) { return java.util.Collections.unmodifiableList(rightKeys_); } else { return rightKeysBuilder_.getMessageList(); } } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public int getRightKeysCount() { if (rightKeysBuilder_ == null) { return rightKeys_.size(); } else { return rightKeysBuilder_.getCount(); } } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference getRightKeys(int index) { if (rightKeysBuilder_ == null) { return rightKeys_.get(index); } else { return rightKeysBuilder_.getMessage(index); } } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder setRightKeys( int index, io.substrait.proto.Expression.FieldReference value) { if (rightKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureRightKeysIsMutable(); rightKeys_.set(index, value); onChanged(); } else { rightKeysBuilder_.setMessage(index, value); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder setRightKeys( int index, io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); rightKeys_.set(index, builderForValue.build()); onChanged(); } else { rightKeysBuilder_.setMessage(index, builderForValue.build()); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder addRightKeys(io.substrait.proto.Expression.FieldReference value) { if (rightKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureRightKeysIsMutable(); rightKeys_.add(value); onChanged(); } else { rightKeysBuilder_.addMessage(value); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder addRightKeys( int index, io.substrait.proto.Expression.FieldReference value) { if (rightKeysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureRightKeysIsMutable(); rightKeys_.add(index, value); onChanged(); } else { rightKeysBuilder_.addMessage(index, value); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder addRightKeys( io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); rightKeys_.add(builderForValue.build()); onChanged(); } else { rightKeysBuilder_.addMessage(builderForValue.build()); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder addRightKeys( int index, io.substrait.proto.Expression.FieldReference.Builder builderForValue) { if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); rightKeys_.add(index, builderForValue.build()); onChanged(); } else { rightKeysBuilder_.addMessage(index, builderForValue.build()); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder addAllRightKeys( java.lang.Iterable values) { if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, rightKeys_); onChanged(); } else { rightKeysBuilder_.addAllMessages(values); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder clearRightKeys() { if (rightKeysBuilder_ == null) { rightKeys_ = java.util.Collections.emptyList(); bitField0_ = (bitField0_ & ~0x00000010); onChanged(); } else { rightKeysBuilder_.clear(); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public Builder removeRightKeys(int index) { if (rightKeysBuilder_ == null) { ensureRightKeysIsMutable(); rightKeys_.remove(index); onChanged(); } else { rightKeysBuilder_.remove(index); } return this; } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder getRightKeysBuilder( int index) { return getRightKeysFieldBuilder().getBuilder(index); } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReferenceOrBuilder getRightKeysOrBuilder( int index) { if (rightKeysBuilder_ == null) { return rightKeys_.get(index); } else { return rightKeysBuilder_.getMessageOrBuilder(index); } } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getRightKeysOrBuilderList() { if (rightKeysBuilder_ != null) { return rightKeysBuilder_.getMessageOrBuilderList(); } else { return java.util.Collections.unmodifiableList(rightKeys_); } } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder addRightKeysBuilder() { return getRightKeysFieldBuilder().addBuilder( io.substrait.proto.Expression.FieldReference.getDefaultInstance()); } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public io.substrait.proto.Expression.FieldReference.Builder addRightKeysBuilder( int index) { return getRightKeysFieldBuilder().addBuilder( index, io.substrait.proto.Expression.FieldReference.getDefaultInstance()); } /** * repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true]; */ @java.lang.Deprecated public java.util.List getRightKeysBuilderList() { return getRightKeysFieldBuilder().getBuilderList(); } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder> getRightKeysFieldBuilder() { if (rightKeysBuilder_ == null) { rightKeysBuilder_ = new com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.Expression.FieldReference, io.substrait.proto.Expression.FieldReference.Builder, io.substrait.proto.Expression.FieldReferenceOrBuilder>( rightKeys_, ((bitField0_ & 0x00000010) != 0), getParentForChildren(), isClean()); rightKeys_ = null; } return rightKeysBuilder_; } private java.util.List keys_ = java.util.Collections.emptyList(); private void ensureKeysIsMutable() { if (!((bitField0_ & 0x00000020) != 0)) { keys_ = new java.util.ArrayList(keys_); bitField0_ |= 0x00000020; } } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.ComparisonJoinKey, io.substrait.proto.ComparisonJoinKey.Builder, io.substrait.proto.ComparisonJoinKeyOrBuilder> keysBuilder_; /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public java.util.List getKeysList() { if (keysBuilder_ == null) { return java.util.Collections.unmodifiableList(keys_); } else { return keysBuilder_.getMessageList(); } } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public int getKeysCount() { if (keysBuilder_ == null) { return keys_.size(); } else { return keysBuilder_.getCount(); } } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public io.substrait.proto.ComparisonJoinKey getKeys(int index) { if (keysBuilder_ == null) { return keys_.get(index); } else { return keysBuilder_.getMessage(index); } } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder setKeys( int index, io.substrait.proto.ComparisonJoinKey value) { if (keysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureKeysIsMutable(); keys_.set(index, value); onChanged(); } else { keysBuilder_.setMessage(index, value); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder setKeys( int index, io.substrait.proto.ComparisonJoinKey.Builder builderForValue) { if (keysBuilder_ == null) { ensureKeysIsMutable(); keys_.set(index, builderForValue.build()); onChanged(); } else { keysBuilder_.setMessage(index, builderForValue.build()); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder addKeys(io.substrait.proto.ComparisonJoinKey value) { if (keysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureKeysIsMutable(); keys_.add(value); onChanged(); } else { keysBuilder_.addMessage(value); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder addKeys( int index, io.substrait.proto.ComparisonJoinKey value) { if (keysBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureKeysIsMutable(); keys_.add(index, value); onChanged(); } else { keysBuilder_.addMessage(index, value); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder addKeys( io.substrait.proto.ComparisonJoinKey.Builder builderForValue) { if (keysBuilder_ == null) { ensureKeysIsMutable(); keys_.add(builderForValue.build()); onChanged(); } else { keysBuilder_.addMessage(builderForValue.build()); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder addKeys( int index, io.substrait.proto.ComparisonJoinKey.Builder builderForValue) { if (keysBuilder_ == null) { ensureKeysIsMutable(); keys_.add(index, builderForValue.build()); onChanged(); } else { keysBuilder_.addMessage(index, builderForValue.build()); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder addAllKeys( java.lang.Iterable values) { if (keysBuilder_ == null) { ensureKeysIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, keys_); onChanged(); } else { keysBuilder_.addAllMessages(values); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder clearKeys() { if (keysBuilder_ == null) { keys_ = java.util.Collections.emptyList(); bitField0_ = (bitField0_ & ~0x00000020); onChanged(); } else { keysBuilder_.clear(); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public Builder removeKeys(int index) { if (keysBuilder_ == null) { ensureKeysIsMutable(); keys_.remove(index); onChanged(); } else { keysBuilder_.remove(index); } return this; } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public io.substrait.proto.ComparisonJoinKey.Builder getKeysBuilder( int index) { return getKeysFieldBuilder().getBuilder(index); } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public io.substrait.proto.ComparisonJoinKeyOrBuilder getKeysOrBuilder( int index) { if (keysBuilder_ == null) { return keys_.get(index); } else { return keysBuilder_.getMessageOrBuilder(index); } } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public java.util.List getKeysOrBuilderList() { if (keysBuilder_ != null) { return keysBuilder_.getMessageOrBuilderList(); } else { return java.util.Collections.unmodifiableList(keys_); } } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public io.substrait.proto.ComparisonJoinKey.Builder addKeysBuilder() { return getKeysFieldBuilder().addBuilder( io.substrait.proto.ComparisonJoinKey.getDefaultInstance()); } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public io.substrait.proto.ComparisonJoinKey.Builder addKeysBuilder( int index) { return getKeysFieldBuilder().addBuilder( index, io.substrait.proto.ComparisonJoinKey.getDefaultInstance()); } /** *
     * One or more keys to join on.  The relation is invalid if this is empty
     * (unless the deprecated left_keys/right_keys fields are being used).
     *
     * If a custom comparison function is used then it must be consistent with
     * the hash function used for the keys.
     *
     * In other words, the hash function must return the same hash code when the
     * comparison returns true.  For example, if the comparison function is
     * "equals ignoring case" then the hash function must return the same hash
     * code for strings that differ only by case.  Note: the hash function is not
     * specified here.  It is the responsibility of the consumer to find an appropriate
     * hash function for a given comparsion function or to reject the plan if it cannot
     * do so.
     * 
* * repeated .substrait.ComparisonJoinKey keys = 8; */ public java.util.List getKeysBuilderList() { return getKeysFieldBuilder().getBuilderList(); } private com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.ComparisonJoinKey, io.substrait.proto.ComparisonJoinKey.Builder, io.substrait.proto.ComparisonJoinKeyOrBuilder> getKeysFieldBuilder() { if (keysBuilder_ == null) { keysBuilder_ = new com.google.protobuf.RepeatedFieldBuilderV3< io.substrait.proto.ComparisonJoinKey, io.substrait.proto.ComparisonJoinKey.Builder, io.substrait.proto.ComparisonJoinKeyOrBuilder>( keys_, ((bitField0_ & 0x00000020) != 0), getParentForChildren(), isClean()); keys_ = null; } return keysBuilder_; } private io.substrait.proto.Expression postJoinFilter_; private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Expression, io.substrait.proto.Expression.Builder, io.substrait.proto.ExpressionOrBuilder> postJoinFilterBuilder_; /** * .substrait.Expression post_join_filter = 6; * @return Whether the postJoinFilter field is set. */ public boolean hasPostJoinFilter() { return ((bitField0_ & 0x00000040) != 0); } /** * .substrait.Expression post_join_filter = 6; * @return The postJoinFilter. */ public io.substrait.proto.Expression getPostJoinFilter() { if (postJoinFilterBuilder_ == null) { return postJoinFilter_ == null ? io.substrait.proto.Expression.getDefaultInstance() : postJoinFilter_; } else { return postJoinFilterBuilder_.getMessage(); } } /** * .substrait.Expression post_join_filter = 6; */ public Builder setPostJoinFilter(io.substrait.proto.Expression value) { if (postJoinFilterBuilder_ == null) { if (value == null) { throw new NullPointerException(); } postJoinFilter_ = value; } else { postJoinFilterBuilder_.setMessage(value); } bitField0_ |= 0x00000040; onChanged(); return this; } /** * .substrait.Expression post_join_filter = 6; */ public Builder setPostJoinFilter( io.substrait.proto.Expression.Builder builderForValue) { if (postJoinFilterBuilder_ == null) { postJoinFilter_ = builderForValue.build(); } else { postJoinFilterBuilder_.setMessage(builderForValue.build()); } bitField0_ |= 0x00000040; onChanged(); return this; } /** * .substrait.Expression post_join_filter = 6; */ public Builder mergePostJoinFilter(io.substrait.proto.Expression value) { if (postJoinFilterBuilder_ == null) { if (((bitField0_ & 0x00000040) != 0) && postJoinFilter_ != null && postJoinFilter_ != io.substrait.proto.Expression.getDefaultInstance()) { getPostJoinFilterBuilder().mergeFrom(value); } else { postJoinFilter_ = value; } } else { postJoinFilterBuilder_.mergeFrom(value); } if (postJoinFilter_ != null) { bitField0_ |= 0x00000040; onChanged(); } return this; } /** * .substrait.Expression post_join_filter = 6; */ public Builder clearPostJoinFilter() { bitField0_ = (bitField0_ & ~0x00000040); postJoinFilter_ = null; if (postJoinFilterBuilder_ != null) { postJoinFilterBuilder_.dispose(); postJoinFilterBuilder_ = null; } onChanged(); return this; } /** * .substrait.Expression post_join_filter = 6; */ public io.substrait.proto.Expression.Builder getPostJoinFilterBuilder() { bitField0_ |= 0x00000040; onChanged(); return getPostJoinFilterFieldBuilder().getBuilder(); } /** * .substrait.Expression post_join_filter = 6; */ public io.substrait.proto.ExpressionOrBuilder getPostJoinFilterOrBuilder() { if (postJoinFilterBuilder_ != null) { return postJoinFilterBuilder_.getMessageOrBuilder(); } else { return postJoinFilter_ == null ? io.substrait.proto.Expression.getDefaultInstance() : postJoinFilter_; } } /** * .substrait.Expression post_join_filter = 6; */ private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Expression, io.substrait.proto.Expression.Builder, io.substrait.proto.ExpressionOrBuilder> getPostJoinFilterFieldBuilder() { if (postJoinFilterBuilder_ == null) { postJoinFilterBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.Expression, io.substrait.proto.Expression.Builder, io.substrait.proto.ExpressionOrBuilder>( getPostJoinFilter(), getParentForChildren(), isClean()); postJoinFilter_ = null; } return postJoinFilterBuilder_; } private int type_ = 0; /** * .substrait.HashJoinRel.JoinType type = 7; * @return The enum numeric value on the wire for type. */ @java.lang.Override public int getTypeValue() { return type_; } /** * .substrait.HashJoinRel.JoinType type = 7; * @param value The enum numeric value on the wire for type to set. * @return This builder for chaining. */ public Builder setTypeValue(int value) { type_ = value; bitField0_ |= 0x00000080; onChanged(); return this; } /** * .substrait.HashJoinRel.JoinType type = 7; * @return The type. */ @java.lang.Override public io.substrait.proto.HashJoinRel.JoinType getType() { io.substrait.proto.HashJoinRel.JoinType result = io.substrait.proto.HashJoinRel.JoinType.forNumber(type_); return result == null ? io.substrait.proto.HashJoinRel.JoinType.UNRECOGNIZED : result; } /** * .substrait.HashJoinRel.JoinType type = 7; * @param value The type to set. * @return This builder for chaining. */ public Builder setType(io.substrait.proto.HashJoinRel.JoinType value) { if (value == null) { throw new NullPointerException(); } bitField0_ |= 0x00000080; type_ = value.getNumber(); onChanged(); return this; } /** * .substrait.HashJoinRel.JoinType type = 7; * @return This builder for chaining. */ public Builder clearType() { bitField0_ = (bitField0_ & ~0x00000080); type_ = 0; onChanged(); return this; } private io.substrait.proto.AdvancedExtension advancedExtension_; private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.AdvancedExtension, io.substrait.proto.AdvancedExtension.Builder, io.substrait.proto.AdvancedExtensionOrBuilder> advancedExtensionBuilder_; /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; * @return Whether the advancedExtension field is set. */ public boolean hasAdvancedExtension() { return ((bitField0_ & 0x00000100) != 0); } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; * @return The advancedExtension. */ public io.substrait.proto.AdvancedExtension getAdvancedExtension() { if (advancedExtensionBuilder_ == null) { return advancedExtension_ == null ? io.substrait.proto.AdvancedExtension.getDefaultInstance() : advancedExtension_; } else { return advancedExtensionBuilder_.getMessage(); } } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public Builder setAdvancedExtension(io.substrait.proto.AdvancedExtension value) { if (advancedExtensionBuilder_ == null) { if (value == null) { throw new NullPointerException(); } advancedExtension_ = value; } else { advancedExtensionBuilder_.setMessage(value); } bitField0_ |= 0x00000100; onChanged(); return this; } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public Builder setAdvancedExtension( io.substrait.proto.AdvancedExtension.Builder builderForValue) { if (advancedExtensionBuilder_ == null) { advancedExtension_ = builderForValue.build(); } else { advancedExtensionBuilder_.setMessage(builderForValue.build()); } bitField0_ |= 0x00000100; onChanged(); return this; } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public Builder mergeAdvancedExtension(io.substrait.proto.AdvancedExtension value) { if (advancedExtensionBuilder_ == null) { if (((bitField0_ & 0x00000100) != 0) && advancedExtension_ != null && advancedExtension_ != io.substrait.proto.AdvancedExtension.getDefaultInstance()) { getAdvancedExtensionBuilder().mergeFrom(value); } else { advancedExtension_ = value; } } else { advancedExtensionBuilder_.mergeFrom(value); } if (advancedExtension_ != null) { bitField0_ |= 0x00000100; onChanged(); } return this; } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public Builder clearAdvancedExtension() { bitField0_ = (bitField0_ & ~0x00000100); advancedExtension_ = null; if (advancedExtensionBuilder_ != null) { advancedExtensionBuilder_.dispose(); advancedExtensionBuilder_ = null; } onChanged(); return this; } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public io.substrait.proto.AdvancedExtension.Builder getAdvancedExtensionBuilder() { bitField0_ |= 0x00000100; onChanged(); return getAdvancedExtensionFieldBuilder().getBuilder(); } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ public io.substrait.proto.AdvancedExtensionOrBuilder getAdvancedExtensionOrBuilder() { if (advancedExtensionBuilder_ != null) { return advancedExtensionBuilder_.getMessageOrBuilder(); } else { return advancedExtension_ == null ? io.substrait.proto.AdvancedExtension.getDefaultInstance() : advancedExtension_; } } /** * .substrait.extensions.AdvancedExtension advanced_extension = 10; */ private com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.AdvancedExtension, io.substrait.proto.AdvancedExtension.Builder, io.substrait.proto.AdvancedExtensionOrBuilder> getAdvancedExtensionFieldBuilder() { if (advancedExtensionBuilder_ == null) { advancedExtensionBuilder_ = new com.google.protobuf.SingleFieldBuilderV3< io.substrait.proto.AdvancedExtension, io.substrait.proto.AdvancedExtension.Builder, io.substrait.proto.AdvancedExtensionOrBuilder>( getAdvancedExtension(), getParentForChildren(), isClean()); advancedExtension_ = null; } return advancedExtensionBuilder_; } @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:substrait.HashJoinRel) } // @@protoc_insertion_point(class_scope:substrait.HashJoinRel) private static final io.substrait.proto.HashJoinRel DEFAULT_INSTANCE; static { DEFAULT_INSTANCE = new io.substrait.proto.HashJoinRel(); } public static io.substrait.proto.HashJoinRel getDefaultInstance() { return DEFAULT_INSTANCE; } private static final com.google.protobuf.Parser PARSER = new com.google.protobuf.AbstractParser() { @java.lang.Override public HashJoinRel parsePartialFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { Builder builder = newBuilder(); try { builder.mergeFrom(input, extensionRegistry); } catch (com.google.protobuf.InvalidProtocolBufferException e) { throw e.setUnfinishedMessage(builder.buildPartial()); } catch (com.google.protobuf.UninitializedMessageException e) { throw e.asInvalidProtocolBufferException().setUnfinishedMessage(builder.buildPartial()); } catch (java.io.IOException e) { throw new com.google.protobuf.InvalidProtocolBufferException(e) .setUnfinishedMessage(builder.buildPartial()); } return builder.buildPartial(); } }; public static com.google.protobuf.Parser parser() { return PARSER; } @java.lang.Override public com.google.protobuf.Parser getParserForType() { return PARSER; } @java.lang.Override public io.substrait.proto.HashJoinRel getDefaultInstanceForType() { return DEFAULT_INSTANCE; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy