接口 GraphAlgebra.SegmentApplyOrBuilder
-
- 所有超级接口:
com.google.protobuf.MessageLiteOrBuilder,com.google.protobuf.MessageOrBuilder
- 封闭类:
- GraphAlgebra
public static interface GraphAlgebra.SegmentApplyOrBuilder extends com.google.protobuf.MessageOrBuilder
-
-
方法概要
所有方法 实例方法 抽象方法 修饰符和类型 方法 说明 GraphAlgebra.ApplygetApplySubtask()A base of apply operation that is conducted on each group of the relations instead of tupleGraphAlgebra.ApplyOrBuildergetApplySubtaskOrBuilder()A base of apply operation that is conducted on each group of the relations instead of tupleCommon.NameOrIdgetKeys(int index)The keys to perform grouping, or segmenting.intgetKeysCount()The keys to perform grouping, or segmenting.List<Common.NameOrId>getKeysList()The keys to perform grouping, or segmenting.Common.NameOrIdOrBuildergetKeysOrBuilder(int index)The keys to perform grouping, or segmenting.List<? extends Common.NameOrIdOrBuilder>getKeysOrBuilderList()The keys to perform grouping, or segmenting.booleanhasApplySubtask()A base of apply operation that is conducted on each group of the relations instead of tuple
-
-
-
方法详细资料
-
getKeysList
List<Common.NameOrId> getKeysList()
The keys to perform grouping, or segmenting. For simplicity, we only allows grouping by the existed tags of the graph relation, which is unlike GroupBy that we further allows digging into the properties of a vertex/edge that the tag refers to.
repeated .common.NameOrId keys = 1;
-
getKeys
Common.NameOrId getKeys(int index)
The keys to perform grouping, or segmenting. For simplicity, we only allows grouping by the existed tags of the graph relation, which is unlike GroupBy that we further allows digging into the properties of a vertex/edge that the tag refers to.
repeated .common.NameOrId keys = 1;
-
getKeysCount
int getKeysCount()
The keys to perform grouping, or segmenting. For simplicity, we only allows grouping by the existed tags of the graph relation, which is unlike GroupBy that we further allows digging into the properties of a vertex/edge that the tag refers to.
repeated .common.NameOrId keys = 1;
-
getKeysOrBuilderList
List<? extends Common.NameOrIdOrBuilder> getKeysOrBuilderList()
The keys to perform grouping, or segmenting. For simplicity, we only allows grouping by the existed tags of the graph relation, which is unlike GroupBy that we further allows digging into the properties of a vertex/edge that the tag refers to.
repeated .common.NameOrId keys = 1;
-
getKeysOrBuilder
Common.NameOrIdOrBuilder getKeysOrBuilder(int index)
The keys to perform grouping, or segmenting. For simplicity, we only allows grouping by the existed tags of the graph relation, which is unlike GroupBy that we further allows digging into the properties of a vertex/edge that the tag refers to.
repeated .common.NameOrId keys = 1;
-
hasApplySubtask
boolean hasApplySubtask()
A base of apply operation that is conducted on each group of the relations instead of tuple
.algebra.Apply apply_subtask = 2;- 返回:
- Whether the applySubtask field is set.
-
getApplySubtask
GraphAlgebra.Apply getApplySubtask()
A base of apply operation that is conducted on each group of the relations instead of tuple
.algebra.Apply apply_subtask = 2;- 返回:
- The applySubtask.
-
getApplySubtaskOrBuilder
GraphAlgebra.ApplyOrBuilder getApplySubtaskOrBuilder()
A base of apply operation that is conducted on each group of the relations instead of tuple
.algebra.Apply apply_subtask = 2;
-
-