类 GraphAlgebra.SegmentApply.Builder

    • 方法详细资料

      • getDescriptor

        public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
      • internalGetFieldAccessorTable

        protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()
        指定者:
        internalGetFieldAccessorTable 在类中 com.google.protobuf.GeneratedMessageV3.Builder<GraphAlgebra.SegmentApply.Builder>
      • getDescriptorForType

        public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
        指定者:
        getDescriptorForType 在接口中 com.google.protobuf.Message.Builder
        指定者:
        getDescriptorForType 在接口中 com.google.protobuf.MessageOrBuilder
        覆盖:
        getDescriptorForType 在类中 com.google.protobuf.GeneratedMessageV3.Builder<GraphAlgebra.SegmentApply.Builder>
      • getDefaultInstanceForType

        public GraphAlgebra.SegmentApply getDefaultInstanceForType()
        指定者:
        getDefaultInstanceForType 在接口中 com.google.protobuf.MessageLiteOrBuilder
        指定者:
        getDefaultInstanceForType 在接口中 com.google.protobuf.MessageOrBuilder
      • build

        public GraphAlgebra.SegmentApply build()
        指定者:
        build 在接口中 com.google.protobuf.Message.Builder
        指定者:
        build 在接口中 com.google.protobuf.MessageLite.Builder
      • buildPartial

        public GraphAlgebra.SegmentApply buildPartial()
        指定者:
        buildPartial 在接口中 com.google.protobuf.Message.Builder
        指定者:
        buildPartial 在接口中 com.google.protobuf.MessageLite.Builder
      • isInitialized

        public final boolean isInitialized()
        指定者:
        isInitialized 在接口中 com.google.protobuf.MessageLiteOrBuilder
        覆盖:
        isInitialized 在类中 com.google.protobuf.GeneratedMessageV3.Builder<GraphAlgebra.SegmentApply.Builder>
      • mergeFrom

        public GraphAlgebra.SegmentApply.Builder mergeFrom​(com.google.protobuf.CodedInputStream input,
                                                           com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                                                    throws IOException
        指定者:
        mergeFrom 在接口中 com.google.protobuf.Message.Builder
        指定者:
        mergeFrom 在接口中 com.google.protobuf.MessageLite.Builder
        覆盖:
        mergeFrom 在类中 com.google.protobuf.AbstractMessage.Builder<GraphAlgebra.SegmentApply.Builder>
        抛出:
        IOException
      • getKeysList

        public 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;
        指定者:
        getKeysList 在接口中 GraphAlgebra.SegmentApplyOrBuilder
      • getKeysCount

        public 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;
        指定者:
        getKeysCount 在接口中 GraphAlgebra.SegmentApplyOrBuilder
      • getKeys

        public 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;
        指定者:
        getKeys 在接口中 GraphAlgebra.SegmentApplyOrBuilder
      • setKeys

        public GraphAlgebra.SegmentApply.Builder setKeys​(int index,
                                                         Common.NameOrId value)
         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;
      • setKeys

        public GraphAlgebra.SegmentApply.Builder setKeys​(int index,
                                                         Common.NameOrId.Builder builderForValue)
         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;
      • addKeys

        public GraphAlgebra.SegmentApply.Builder addKeys​(Common.NameOrId value)
         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;
      • addKeys

        public GraphAlgebra.SegmentApply.Builder addKeys​(int index,
                                                         Common.NameOrId value)
         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;
      • addKeys

        public GraphAlgebra.SegmentApply.Builder addKeys​(Common.NameOrId.Builder builderForValue)
         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;
      • addKeys

        public GraphAlgebra.SegmentApply.Builder addKeys​(int index,
                                                         Common.NameOrId.Builder builderForValue)
         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;
      • addAllKeys

        public GraphAlgebra.SegmentApply.Builder addAllKeys​(Iterable<? extends Common.NameOrId> values)
         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;
      • clearKeys

        public GraphAlgebra.SegmentApply.Builder clearKeys()
         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;
      • removeKeys

        public GraphAlgebra.SegmentApply.Builder removeKeys​(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;
      • getKeysBuilder

        public Common.NameOrId.Builder getKeysBuilder​(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;
      • getKeysOrBuilder

        public 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;
        指定者:
        getKeysOrBuilder 在接口中 GraphAlgebra.SegmentApplyOrBuilder
      • getKeysOrBuilderList

        public 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;
        指定者:
        getKeysOrBuilderList 在接口中 GraphAlgebra.SegmentApplyOrBuilder
      • addKeysBuilder

        public Common.NameOrId.Builder addKeysBuilder()
         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;
      • addKeysBuilder

        public Common.NameOrId.Builder addKeysBuilder​(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;
      • getKeysBuilderList

        public List<Common.NameOrId.Builder> getKeysBuilderList()
         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

        public boolean hasApplySubtask()
         A base of apply operation that is conducted on each group of the relations instead of tuple
         
        .algebra.Apply apply_subtask = 2;
        指定者:
        hasApplySubtask 在接口中 GraphAlgebra.SegmentApplyOrBuilder
        返回:
        Whether the applySubtask field is set.
      • clearApplySubtask

        public GraphAlgebra.SegmentApply.Builder clearApplySubtask()
         A base of apply operation that is conducted on each group of the relations instead of tuple
         
        .algebra.Apply apply_subtask = 2;
      • getApplySubtaskBuilder

        public GraphAlgebra.Apply.Builder getApplySubtaskBuilder()
         A base of apply operation that is conducted on each group of the relations instead of tuple
         
        .algebra.Apply apply_subtask = 2;
      • setUnknownFields

        public final GraphAlgebra.SegmentApply.Builder setUnknownFields​(com.google.protobuf.UnknownFieldSet unknownFields)
        指定者:
        setUnknownFields 在接口中 com.google.protobuf.Message.Builder
        覆盖:
        setUnknownFields 在类中 com.google.protobuf.GeneratedMessageV3.Builder<GraphAlgebra.SegmentApply.Builder>
      • mergeUnknownFields

        public final GraphAlgebra.SegmentApply.Builder mergeUnknownFields​(com.google.protobuf.UnknownFieldSet unknownFields)
        指定者:
        mergeUnknownFields 在接口中 com.google.protobuf.Message.Builder
        覆盖:
        mergeUnknownFields 在类中 com.google.protobuf.GeneratedMessageV3.Builder<GraphAlgebra.SegmentApply.Builder>