类的使用
com.alibaba.graphscope.gaia.proto.GraphAlgebra.Join.Builder

使用GraphAlgebra.Join.Builder的程序包

程序包	说明
com.alibaba.graphscope.gaia.proto

com.alibaba.graphscope.gaia.proto中GraphAlgebra.Join.Builder的使用

返回GraphAlgebra.Join.Builder的com.alibaba.graphscope.gaia.proto中的方法

修饰符和类型	方法	说明
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addAllLeftKeys(Iterable<? extends OuterExpression.Variable> values)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addAllRightKeys(Iterable<? extends OuterExpression.Variable> values)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addLeftKeys(int index, OuterExpression.Variable value)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addLeftKeys(int index, OuterExpression.Variable.Builder builderForValue)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addLeftKeys(OuterExpression.Variable value)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addLeftKeys(OuterExpression.Variable.Builder builderForValue)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addRightKeys(int index, OuterExpression.Variable value)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addRightKeys(int index, OuterExpression.Variable.Builder builderForValue)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addRightKeys(OuterExpression.Variable value)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.addRightKeys(OuterExpression.Variable.Builder builderForValue)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.clear()
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.clearKind()	.algebra.Join.JoinKind kind = 3;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.clearLeftKeys()	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.clearRightKeys()	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.getJoinBuilder()	.algebra.Join join = 3;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.mergeFrom(GraphAlgebra.Join other)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.mergeFrom(com.google.protobuf.Message other)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
static GraphAlgebra.Join.Builder	GraphAlgebra.Join.newBuilder()
static GraphAlgebra.Join.Builder	GraphAlgebra.Join.newBuilder(GraphAlgebra.Join prototype)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.newBuilderForType()
protected GraphAlgebra.Join.Builder	GraphAlgebra.Join.newBuilderForType(com.google.protobuf.GeneratedMessageV3.BuilderParent parent)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.removeLeftKeys(int index)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.removeRightKeys(int index)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setKind(GraphAlgebra.Join.JoinKind value)	.algebra.Join.JoinKind kind = 3;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setKindValue(int value)	.algebra.Join.JoinKind kind = 3;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setLeftKeys(int index, OuterExpression.Variable value)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setLeftKeys(int index, OuterExpression.Variable.Builder builderForValue)	TODO(longbin) An expression-ish predicate here is a more general form: We currently only support the predicate of the equality of the given keys of both relations are equal.
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setRightKeys(int index, OuterExpression.Variable value)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setRightKeys(int index, OuterExpression.Variable.Builder builderForValue)	repeated .common.Variable right_keys = 2;
GraphAlgebra.Join.Builder	GraphAlgebra.Join.Builder.setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
GraphAlgebra.Join.Builder	GraphAlgebra.Join.toBuilder()

参数类型为GraphAlgebra.Join.Builder的com.alibaba.graphscope.gaia.proto中的方法

修饰符和类型	方法	说明
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setJoin(GraphAlgebra.Join.Builder builderForValue)	.algebra.Join join = 3;