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

使用GraphAlgebra.LogicalPlan.Operator.Builder的程序包

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

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

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

修饰符和类型	方法	说明
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clear()
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearApply()	.algebra.Apply apply = 9;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearAs()	.algebra.As as = 14;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearBranch()	.algebra.Branch branch = 19;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearDedup()	.algebra.Dedup dedup = 7;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearEdge()	.algebra.EdgeExpand edge = 31;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearGroupBy()	.algebra.GroupBy group_by = 5;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearIntersect()	.algebra.Intersect intersect = 15;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearJoin()	.algebra.Join join = 3;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearLimit()	.algebra.Limit limit = 12;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearOpr()
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearOrderBy()	.algebra.OrderBy order_by = 6;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearPath()	.algebra.PathExpand path = 32;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearPattern()	.algebra.Pattern pattern = 35;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearProject()	.algebra.Project project = 1;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearRoot()	.algebra.Root root = 17;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearSample()	.algebra.Sample sample = 18;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearScan()	.algebra.Scan scan = 11;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearSegApply()	.algebra.SegmentApply seg_apply = 10;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearSelect()	.algebra.Select select = 2;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearSink()	.algebra.Sink sink = 16;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearUnfold()	.algebra.Unfold unfold = 8;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearUnion()	.algebra.Union union = 4;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.clearVertex()	Saving the room for relational operators
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Node.Builder.getOprBuilder()	The node's operator
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeApply(GraphAlgebra.Apply value)	.algebra.Apply apply = 9;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeAs(GraphAlgebra.As value)	.algebra.As as = 14;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeBranch(GraphAlgebra.Branch value)	.algebra.Branch branch = 19;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeDedup(GraphAlgebra.Dedup value)	.algebra.Dedup dedup = 7;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeEdge(GraphAlgebra.EdgeExpand value)	.algebra.EdgeExpand edge = 31;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeFrom(GraphAlgebra.LogicalPlan.Operator other)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeFrom(com.google.protobuf.Message other)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeGroupBy(GraphAlgebra.GroupBy value)	.algebra.GroupBy group_by = 5;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeIntersect(GraphAlgebra.Intersect value)	.algebra.Intersect intersect = 15;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeJoin(GraphAlgebra.Join value)	.algebra.Join join = 3;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeLimit(GraphAlgebra.Limit value)	.algebra.Limit limit = 12;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeOrderBy(GraphAlgebra.OrderBy value)	.algebra.OrderBy order_by = 6;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergePath(GraphAlgebra.PathExpand value)	.algebra.PathExpand path = 32;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergePattern(GraphAlgebra.Pattern value)	.algebra.Pattern pattern = 35;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeProject(GraphAlgebra.Project value)	.algebra.Project project = 1;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeRoot(GraphAlgebra.Root value)	.algebra.Root root = 17;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeSample(GraphAlgebra.Sample value)	.algebra.Sample sample = 18;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeScan(GraphAlgebra.Scan value)	.algebra.Scan scan = 11;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeSegApply(GraphAlgebra.SegmentApply value)	.algebra.SegmentApply seg_apply = 10;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeSelect(GraphAlgebra.Select value)	.algebra.Select select = 2;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeSink(GraphAlgebra.Sink value)	.algebra.Sink sink = 16;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeUnfold(GraphAlgebra.Unfold value)	.algebra.Unfold unfold = 8;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeUnion(GraphAlgebra.Union value)	.algebra.Union union = 4;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.mergeVertex(GraphAlgebra.GetV value)	Saving the room for relational operators
static GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.newBuilder()
static GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.newBuilder(GraphAlgebra.LogicalPlan.Operator prototype)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.newBuilderForType()
protected GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.newBuilderForType(com.google.protobuf.GeneratedMessageV3.BuilderParent parent)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setApply(GraphAlgebra.Apply value)	.algebra.Apply apply = 9;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setApply(GraphAlgebra.Apply.Builder builderForValue)	.algebra.Apply apply = 9;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setAs(GraphAlgebra.As value)	.algebra.As as = 14;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setAs(GraphAlgebra.As.Builder builderForValue)	.algebra.As as = 14;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setBranch(GraphAlgebra.Branch value)	.algebra.Branch branch = 19;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setBranch(GraphAlgebra.Branch.Builder builderForValue)	.algebra.Branch branch = 19;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setDedup(GraphAlgebra.Dedup value)	.algebra.Dedup dedup = 7;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setDedup(GraphAlgebra.Dedup.Builder builderForValue)	.algebra.Dedup dedup = 7;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setEdge(GraphAlgebra.EdgeExpand value)	.algebra.EdgeExpand edge = 31;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setEdge(GraphAlgebra.EdgeExpand.Builder builderForValue)	.algebra.EdgeExpand edge = 31;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setGroupBy(GraphAlgebra.GroupBy value)	.algebra.GroupBy group_by = 5;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setGroupBy(GraphAlgebra.GroupBy.Builder builderForValue)	.algebra.GroupBy group_by = 5;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setIntersect(GraphAlgebra.Intersect value)	.algebra.Intersect intersect = 15;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setIntersect(GraphAlgebra.Intersect.Builder builderForValue)	.algebra.Intersect intersect = 15;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setJoin(GraphAlgebra.Join value)	.algebra.Join join = 3;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setJoin(GraphAlgebra.Join.Builder builderForValue)	.algebra.Join join = 3;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setLimit(GraphAlgebra.Limit value)	.algebra.Limit limit = 12;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setLimit(GraphAlgebra.Limit.Builder builderForValue)	.algebra.Limit limit = 12;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setOrderBy(GraphAlgebra.OrderBy value)	.algebra.OrderBy order_by = 6;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setOrderBy(GraphAlgebra.OrderBy.Builder builderForValue)	.algebra.OrderBy order_by = 6;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setPath(GraphAlgebra.PathExpand value)	.algebra.PathExpand path = 32;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setPath(GraphAlgebra.PathExpand.Builder builderForValue)	.algebra.PathExpand path = 32;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setPattern(GraphAlgebra.Pattern value)	.algebra.Pattern pattern = 35;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setPattern(GraphAlgebra.Pattern.Builder builderForValue)	.algebra.Pattern pattern = 35;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setProject(GraphAlgebra.Project value)	.algebra.Project project = 1;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setProject(GraphAlgebra.Project.Builder builderForValue)	.algebra.Project project = 1;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setRoot(GraphAlgebra.Root value)	.algebra.Root root = 17;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setRoot(GraphAlgebra.Root.Builder builderForValue)	.algebra.Root root = 17;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSample(GraphAlgebra.Sample value)	.algebra.Sample sample = 18;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSample(GraphAlgebra.Sample.Builder builderForValue)	.algebra.Sample sample = 18;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setScan(GraphAlgebra.Scan value)	.algebra.Scan scan = 11;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setScan(GraphAlgebra.Scan.Builder builderForValue)	.algebra.Scan scan = 11;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSegApply(GraphAlgebra.SegmentApply value)	.algebra.SegmentApply seg_apply = 10;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSegApply(GraphAlgebra.SegmentApply.Builder builderForValue)	.algebra.SegmentApply seg_apply = 10;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSelect(GraphAlgebra.Select value)	.algebra.Select select = 2;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSelect(GraphAlgebra.Select.Builder builderForValue)	.algebra.Select select = 2;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSink(GraphAlgebra.Sink value)	.algebra.Sink sink = 16;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setSink(GraphAlgebra.Sink.Builder builderForValue)	.algebra.Sink sink = 16;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setUnfold(GraphAlgebra.Unfold value)	.algebra.Unfold unfold = 8;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setUnfold(GraphAlgebra.Unfold.Builder builderForValue)	.algebra.Unfold unfold = 8;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setUnion(GraphAlgebra.Union value)	.algebra.Union union = 4;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setUnion(GraphAlgebra.Union.Builder builderForValue)	.algebra.Union union = 4;
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setVertex(GraphAlgebra.GetV value)	Saving the room for relational operators
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.Builder.setVertex(GraphAlgebra.GetV.Builder builderForValue)	Saving the room for relational operators
GraphAlgebra.LogicalPlan.Operator.Builder	GraphAlgebra.LogicalPlan.Operator.toBuilder()

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

修饰符和类型	方法	说明
GraphAlgebra.LogicalPlan.Node.Builder	GraphAlgebra.LogicalPlan.Node.Builder.setOpr(GraphAlgebra.LogicalPlan.Operator.Builder builderForValue)	The node's operator