io.substrait.proto.MergeJoinRelOrBuilder Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of core Show documentation
Show all versions of core Show documentation
Create a well-defined, cross-language specification for data compute operations
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: substrait/algebra.proto
// Protobuf Java Version: 3.25.5
package io.substrait.proto;
public interface MergeJoinRelOrBuilder extends
// @@protoc_insertion_point(interface_extends:substrait.MergeJoinRel)
com.google.protobuf.MessageOrBuilder {
/**
* .substrait.RelCommon common = 1;
* @return Whether the common field is set.
*/
boolean hasCommon();
/**
* .substrait.RelCommon common = 1;
* @return The common.
*/
io.substrait.proto.RelCommon getCommon();
/**
* .substrait.RelCommon common = 1;
*/
io.substrait.proto.RelCommonOrBuilder getCommonOrBuilder();
/**
* .substrait.Rel left = 2;
* @return Whether the left field is set.
*/
boolean hasLeft();
/**
* .substrait.Rel left = 2;
* @return The left.
*/
io.substrait.proto.Rel getLeft();
/**
* .substrait.Rel left = 2;
*/
io.substrait.proto.RelOrBuilder getLeftOrBuilder();
/**
* .substrait.Rel right = 3;
* @return Whether the right field is set.
*/
boolean hasRight();
/**
* .substrait.Rel right = 3;
* @return The right.
*/
io.substrait.proto.Rel getRight();
/**
* .substrait.Rel right = 3;
*/
io.substrait.proto.RelOrBuilder getRightOrBuilder();
/**
*
* 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 java.util.List
getLeftKeysList();
/**
*
* 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 io.substrait.proto.Expression.FieldReference getLeftKeys(int 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 int getLeftKeysCount();
/**
*
* 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 java.util.List
getLeftKeysOrBuilderList();
/**
*
* 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 io.substrait.proto.Expression.FieldReferenceOrBuilder getLeftKeysOrBuilder(
int index);
/**
* repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true];
*/
@java.lang.Deprecated java.util.List
getRightKeysList();
/**
* repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true];
*/
@java.lang.Deprecated io.substrait.proto.Expression.FieldReference getRightKeys(int index);
/**
* repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true];
*/
@java.lang.Deprecated int getRightKeysCount();
/**
* repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true];
*/
@java.lang.Deprecated java.util.List
getRightKeysOrBuilderList();
/**
* repeated .substrait.Expression.FieldReference right_keys = 5 [deprecated = true];
*/
@java.lang.Deprecated io.substrait.proto.Expression.FieldReferenceOrBuilder getRightKeysOrBuilder(
int 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 ordering of the input data. For example, if the comparison function
* is "<" then we generally expect the data to be sorted in ascending order.
*
* If the comparison function is something like "less than ignoring case" then
* the data should be sorted appropriately (e.g. both "A" and "a" should come
* before "b")
*
* The sort order is not specified here. It is typically the responsibility of
* the producer to ensure the plan sorts the data if needed (although the consumer
* is free to do so as well). If possible, the consumer should verify the sort
* order and reject invalid plans.
*
*
* repeated .substrait.ComparisonJoinKey keys = 8;
*/
java.util.List
getKeysList();
/**
*
* 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 ordering of the input data. For example, if the comparison function
* is "<" then we generally expect the data to be sorted in ascending order.
*
* If the comparison function is something like "less than ignoring case" then
* the data should be sorted appropriately (e.g. both "A" and "a" should come
* before "b")
*
* The sort order is not specified here. It is typically the responsibility of
* the producer to ensure the plan sorts the data if needed (although the consumer
* is free to do so as well). If possible, the consumer should verify the sort
* order and reject invalid plans.
*
*
* repeated .substrait.ComparisonJoinKey keys = 8;
*/
io.substrait.proto.ComparisonJoinKey getKeys(int 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 ordering of the input data. For example, if the comparison function
* is "<" then we generally expect the data to be sorted in ascending order.
*
* If the comparison function is something like "less than ignoring case" then
* the data should be sorted appropriately (e.g. both "A" and "a" should come
* before "b")
*
* The sort order is not specified here. It is typically the responsibility of
* the producer to ensure the plan sorts the data if needed (although the consumer
* is free to do so as well). If possible, the consumer should verify the sort
* order and reject invalid plans.
*
*
* repeated .substrait.ComparisonJoinKey keys = 8;
*/
int getKeysCount();
/**
*
* 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 ordering of the input data. For example, if the comparison function
* is "<" then we generally expect the data to be sorted in ascending order.
*
* If the comparison function is something like "less than ignoring case" then
* the data should be sorted appropriately (e.g. both "A" and "a" should come
* before "b")
*
* The sort order is not specified here. It is typically the responsibility of
* the producer to ensure the plan sorts the data if needed (although the consumer
* is free to do so as well). If possible, the consumer should verify the sort
* order and reject invalid plans.
*
*
* repeated .substrait.ComparisonJoinKey keys = 8;
*/
java.util.List
getKeysOrBuilderList();
/**
*
* 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 ordering of the input data. For example, if the comparison function
* is "<" then we generally expect the data to be sorted in ascending order.
*
* If the comparison function is something like "less than ignoring case" then
* the data should be sorted appropriately (e.g. both "A" and "a" should come
* before "b")
*
* The sort order is not specified here. It is typically the responsibility of
* the producer to ensure the plan sorts the data if needed (although the consumer
* is free to do so as well). If possible, the consumer should verify the sort
* order and reject invalid plans.
*
*
* repeated .substrait.ComparisonJoinKey keys = 8;
*/
io.substrait.proto.ComparisonJoinKeyOrBuilder getKeysOrBuilder(
int index);
/**
* .substrait.Expression post_join_filter = 6;
* @return Whether the postJoinFilter field is set.
*/
boolean hasPostJoinFilter();
/**
* .substrait.Expression post_join_filter = 6;
* @return The postJoinFilter.
*/
io.substrait.proto.Expression getPostJoinFilter();
/**
* .substrait.Expression post_join_filter = 6;
*/
io.substrait.proto.ExpressionOrBuilder getPostJoinFilterOrBuilder();
/**
* .substrait.MergeJoinRel.JoinType type = 7;
* @return The enum numeric value on the wire for type.
*/
int getTypeValue();
/**
* .substrait.MergeJoinRel.JoinType type = 7;
* @return The type.
*/
io.substrait.proto.MergeJoinRel.JoinType getType();
/**
* .substrait.extensions.AdvancedExtension advanced_extension = 10;
* @return Whether the advancedExtension field is set.
*/
boolean hasAdvancedExtension();
/**
* .substrait.extensions.AdvancedExtension advanced_extension = 10;
* @return The advancedExtension.
*/
io.substrait.proto.AdvancedExtension getAdvancedExtension();
/**
* .substrait.extensions.AdvancedExtension advanced_extension = 10;
*/
io.substrait.proto.AdvancedExtensionOrBuilder getAdvancedExtensionOrBuilder();
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy