java.io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of deephaven-proto-backplane-grpc Show documentation
Show all versions of deephaven-proto-backplane-grpc Show documentation
The Deephaven proto-backplane-grpc
// Generated by the protocol buffer compiler. DO NOT EDIT!
// source: deephaven/proto/hierarchicaltable.proto
// Protobuf Java Version: 3.25.3
package io.deephaven.proto.backplane.grpc;
/**
* Protobuf type {@code io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest}
*/
public final class HierarchicalTableApplyRequest extends
com.google.protobuf.GeneratedMessageV3 implements
// @@protoc_insertion_point(message_implements:io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)
HierarchicalTableApplyRequestOrBuilder {
private static final long serialVersionUID = 0L;
// Use HierarchicalTableApplyRequest.newBuilder() to construct.
private HierarchicalTableApplyRequest(com.google.protobuf.GeneratedMessageV3.Builder builder) {
super(builder);
}
private HierarchicalTableApplyRequest() {
filters_ = java.util.Collections.emptyList();
sorts_ = java.util.Collections.emptyList();
}
@java.lang.Override
@SuppressWarnings({"unused"})
protected java.lang.Object newInstance(
UnusedPrivateParameter unused) {
return new HierarchicalTableApplyRequest();
}
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return io.deephaven.proto.backplane.grpc.Hierarchicaltable.internal_static_io_deephaven_proto_backplane_grpc_HierarchicalTableApplyRequest_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return io.deephaven.proto.backplane.grpc.Hierarchicaltable.internal_static_io_deephaven_proto_backplane_grpc_HierarchicalTableApplyRequest_fieldAccessorTable
.ensureFieldAccessorsInitialized(
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.class, io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.Builder.class);
}
private int bitField0_;
public static final int RESULT_HIERARCHICAL_TABLE_ID_FIELD_NUMBER = 1;
private io.deephaven.proto.backplane.grpc.Ticket resultHierarchicalTableId_;
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
* @return Whether the resultHierarchicalTableId field is set.
*/
@java.lang.Override
public boolean hasResultHierarchicalTableId() {
return ((bitField0_ & 0x00000001) != 0);
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
* @return The resultHierarchicalTableId.
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.Ticket getResultHierarchicalTableId() {
return resultHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : resultHierarchicalTableId_;
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.TicketOrBuilder getResultHierarchicalTableIdOrBuilder() {
return resultHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : resultHierarchicalTableId_;
}
public static final int INPUT_HIERARCHICAL_TABLE_ID_FIELD_NUMBER = 2;
private io.deephaven.proto.backplane.grpc.Ticket inputHierarchicalTableId_;
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
* @return Whether the inputHierarchicalTableId field is set.
*/
@java.lang.Override
public boolean hasInputHierarchicalTableId() {
return ((bitField0_ & 0x00000002) != 0);
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
* @return The inputHierarchicalTableId.
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.Ticket getInputHierarchicalTableId() {
return inputHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : inputHierarchicalTableId_;
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.TicketOrBuilder getInputHierarchicalTableIdOrBuilder() {
return inputHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : inputHierarchicalTableId_;
}
public static final int FILTERS_FIELD_NUMBER = 3;
@SuppressWarnings("serial")
private java.util.List filters_;
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
@java.lang.Override
public java.util.List getFiltersList() {
return filters_;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
@java.lang.Override
public java.util.List
getFiltersOrBuilderList() {
return filters_;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
@java.lang.Override
public int getFiltersCount() {
return filters_.size();
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.Condition getFilters(int index) {
return filters_.get(index);
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.ConditionOrBuilder getFiltersOrBuilder(
int index) {
return filters_.get(index);
}
public static final int SORTS_FIELD_NUMBER = 4;
@SuppressWarnings("serial")
private java.util.List sorts_;
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
@java.lang.Override
public java.util.List getSortsList() {
return sorts_;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
@java.lang.Override
public java.util.List
getSortsOrBuilderList() {
return sorts_;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
@java.lang.Override
public int getSortsCount() {
return sorts_.size();
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.SortDescriptor getSorts(int index) {
return sorts_.get(index);
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
@java.lang.Override
public io.deephaven.proto.backplane.grpc.SortDescriptorOrBuilder getSortsOrBuilder(
int index) {
return sorts_.get(index);
}
private byte memoizedIsInitialized = -1;
@java.lang.Override
public final boolean isInitialized() {
byte isInitialized = memoizedIsInitialized;
if (isInitialized == 1) return true;
if (isInitialized == 0) return false;
memoizedIsInitialized = 1;
return true;
}
@java.lang.Override
public void writeTo(com.google.protobuf.CodedOutputStream output)
throws java.io.IOException {
if (((bitField0_ & 0x00000001) != 0)) {
output.writeMessage(1, getResultHierarchicalTableId());
}
if (((bitField0_ & 0x00000002) != 0)) {
output.writeMessage(2, getInputHierarchicalTableId());
}
for (int i = 0; i < filters_.size(); i++) {
output.writeMessage(3, filters_.get(i));
}
for (int i = 0; i < sorts_.size(); i++) {
output.writeMessage(4, sorts_.get(i));
}
getUnknownFields().writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
if (((bitField0_ & 0x00000001) != 0)) {
size += com.google.protobuf.CodedOutputStream
.computeMessageSize(1, getResultHierarchicalTableId());
}
if (((bitField0_ & 0x00000002) != 0)) {
size += com.google.protobuf.CodedOutputStream
.computeMessageSize(2, getInputHierarchicalTableId());
}
for (int i = 0; i < filters_.size(); i++) {
size += com.google.protobuf.CodedOutputStream
.computeMessageSize(3, filters_.get(i));
}
for (int i = 0; i < sorts_.size(); i++) {
size += com.google.protobuf.CodedOutputStream
.computeMessageSize(4, sorts_.get(i));
}
size += getUnknownFields().getSerializedSize();
memoizedSize = size;
return size;
}
@java.lang.Override
public boolean equals(final java.lang.Object obj) {
if (obj == this) {
return true;
}
if (!(obj instanceof io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)) {
return super.equals(obj);
}
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest other = (io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest) obj;
if (hasResultHierarchicalTableId() != other.hasResultHierarchicalTableId()) return false;
if (hasResultHierarchicalTableId()) {
if (!getResultHierarchicalTableId()
.equals(other.getResultHierarchicalTableId())) return false;
}
if (hasInputHierarchicalTableId() != other.hasInputHierarchicalTableId()) return false;
if (hasInputHierarchicalTableId()) {
if (!getInputHierarchicalTableId()
.equals(other.getInputHierarchicalTableId())) return false;
}
if (!getFiltersList()
.equals(other.getFiltersList())) return false;
if (!getSortsList()
.equals(other.getSortsList())) return false;
if (!getUnknownFields().equals(other.getUnknownFields())) return false;
return true;
}
@java.lang.Override
public int hashCode() {
if (memoizedHashCode != 0) {
return memoizedHashCode;
}
int hash = 41;
hash = (19 * hash) + getDescriptor().hashCode();
if (hasResultHierarchicalTableId()) {
hash = (37 * hash) + RESULT_HIERARCHICAL_TABLE_ID_FIELD_NUMBER;
hash = (53 * hash) + getResultHierarchicalTableId().hashCode();
}
if (hasInputHierarchicalTableId()) {
hash = (37 * hash) + INPUT_HIERARCHICAL_TABLE_ID_FIELD_NUMBER;
hash = (53 * hash) + getInputHierarchicalTableId().hashCode();
}
if (getFiltersCount() > 0) {
hash = (37 * hash) + FILTERS_FIELD_NUMBER;
hash = (53 * hash) + getFiltersList().hashCode();
}
if (getSortsCount() > 0) {
hash = (37 * hash) + SORTS_FIELD_NUMBER;
hash = (53 * hash) + getSortsList().hashCode();
}
hash = (29 * hash) + getUnknownFields().hashCode();
memoizedHashCode = hash;
return hash;
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
java.nio.ByteBuffer data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
java.nio.ByteBuffer data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
com.google.protobuf.ByteString data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(byte[] data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
byte[] data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseDelimitedFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseDelimitedFrom(
java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseDelimitedWithIOException(PARSER, input, extensionRegistry);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
com.google.protobuf.CodedInputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input);
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest parseFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3
.parseWithIOException(PARSER, input, extensionRegistry);
}
@java.lang.Override
public Builder newBuilderForType() { return newBuilder(); }
public static Builder newBuilder() {
return DEFAULT_INSTANCE.toBuilder();
}
public static Builder newBuilder(io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest prototype) {
return DEFAULT_INSTANCE.toBuilder().mergeFrom(prototype);
}
@java.lang.Override
public Builder toBuilder() {
return this == DEFAULT_INSTANCE
? new Builder() : new Builder().mergeFrom(this);
}
@java.lang.Override
protected Builder newBuilderForType(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
Builder builder = new Builder(parent);
return builder;
}
/**
* Protobuf type {@code io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest}
*/
public static final class Builder extends
com.google.protobuf.GeneratedMessageV3.Builder implements
// @@protoc_insertion_point(builder_implements:io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequestOrBuilder {
public static final com.google.protobuf.Descriptors.Descriptor
getDescriptor() {
return io.deephaven.proto.backplane.grpc.Hierarchicaltable.internal_static_io_deephaven_proto_backplane_grpc_HierarchicalTableApplyRequest_descriptor;
}
@java.lang.Override
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
internalGetFieldAccessorTable() {
return io.deephaven.proto.backplane.grpc.Hierarchicaltable.internal_static_io_deephaven_proto_backplane_grpc_HierarchicalTableApplyRequest_fieldAccessorTable
.ensureFieldAccessorsInitialized(
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.class, io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.Builder.class);
}
// Construct using io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.newBuilder()
private Builder() {
maybeForceBuilderInitialization();
}
private Builder(
com.google.protobuf.GeneratedMessageV3.BuilderParent parent) {
super(parent);
maybeForceBuilderInitialization();
}
private void maybeForceBuilderInitialization() {
if (com.google.protobuf.GeneratedMessageV3
.alwaysUseFieldBuilders) {
getResultHierarchicalTableIdFieldBuilder();
getInputHierarchicalTableIdFieldBuilder();
getFiltersFieldBuilder();
getSortsFieldBuilder();
}
}
@java.lang.Override
public Builder clear() {
super.clear();
bitField0_ = 0;
resultHierarchicalTableId_ = null;
if (resultHierarchicalTableIdBuilder_ != null) {
resultHierarchicalTableIdBuilder_.dispose();
resultHierarchicalTableIdBuilder_ = null;
}
inputHierarchicalTableId_ = null;
if (inputHierarchicalTableIdBuilder_ != null) {
inputHierarchicalTableIdBuilder_.dispose();
inputHierarchicalTableIdBuilder_ = null;
}
if (filtersBuilder_ == null) {
filters_ = java.util.Collections.emptyList();
} else {
filters_ = null;
filtersBuilder_.clear();
}
bitField0_ = (bitField0_ & ~0x00000004);
if (sortsBuilder_ == null) {
sorts_ = java.util.Collections.emptyList();
} else {
sorts_ = null;
sortsBuilder_.clear();
}
bitField0_ = (bitField0_ & ~0x00000008);
return this;
}
@java.lang.Override
public com.google.protobuf.Descriptors.Descriptor
getDescriptorForType() {
return io.deephaven.proto.backplane.grpc.Hierarchicaltable.internal_static_io_deephaven_proto_backplane_grpc_HierarchicalTableApplyRequest_descriptor;
}
@java.lang.Override
public io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest getDefaultInstanceForType() {
return io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.getDefaultInstance();
}
@java.lang.Override
public io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest build() {
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest result = buildPartial();
if (!result.isInitialized()) {
throw newUninitializedMessageException(result);
}
return result;
}
@java.lang.Override
public io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest buildPartial() {
io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest result = new io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest(this);
buildPartialRepeatedFields(result);
if (bitField0_ != 0) { buildPartial0(result); }
onBuilt();
return result;
}
private void buildPartialRepeatedFields(io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest result) {
if (filtersBuilder_ == null) {
if (((bitField0_ & 0x00000004) != 0)) {
filters_ = java.util.Collections.unmodifiableList(filters_);
bitField0_ = (bitField0_ & ~0x00000004);
}
result.filters_ = filters_;
} else {
result.filters_ = filtersBuilder_.build();
}
if (sortsBuilder_ == null) {
if (((bitField0_ & 0x00000008) != 0)) {
sorts_ = java.util.Collections.unmodifiableList(sorts_);
bitField0_ = (bitField0_ & ~0x00000008);
}
result.sorts_ = sorts_;
} else {
result.sorts_ = sortsBuilder_.build();
}
}
private void buildPartial0(io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest result) {
int from_bitField0_ = bitField0_;
int to_bitField0_ = 0;
if (((from_bitField0_ & 0x00000001) != 0)) {
result.resultHierarchicalTableId_ = resultHierarchicalTableIdBuilder_ == null
? resultHierarchicalTableId_
: resultHierarchicalTableIdBuilder_.build();
to_bitField0_ |= 0x00000001;
}
if (((from_bitField0_ & 0x00000002) != 0)) {
result.inputHierarchicalTableId_ = inputHierarchicalTableIdBuilder_ == null
? inputHierarchicalTableId_
: inputHierarchicalTableIdBuilder_.build();
to_bitField0_ |= 0x00000002;
}
result.bitField0_ |= to_bitField0_;
}
@java.lang.Override
public Builder clone() {
return super.clone();
}
@java.lang.Override
public Builder setField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.setField(field, value);
}
@java.lang.Override
public Builder clearField(
com.google.protobuf.Descriptors.FieldDescriptor field) {
return super.clearField(field);
}
@java.lang.Override
public Builder clearOneof(
com.google.protobuf.Descriptors.OneofDescriptor oneof) {
return super.clearOneof(oneof);
}
@java.lang.Override
public Builder setRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
int index, java.lang.Object value) {
return super.setRepeatedField(field, index, value);
}
@java.lang.Override
public Builder addRepeatedField(
com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) {
return super.addRepeatedField(field, value);
}
@java.lang.Override
public Builder mergeFrom(com.google.protobuf.Message other) {
if (other instanceof io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest) {
return mergeFrom((io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)other);
} else {
super.mergeFrom(other);
return this;
}
}
public Builder mergeFrom(io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest other) {
if (other == io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest.getDefaultInstance()) return this;
if (other.hasResultHierarchicalTableId()) {
mergeResultHierarchicalTableId(other.getResultHierarchicalTableId());
}
if (other.hasInputHierarchicalTableId()) {
mergeInputHierarchicalTableId(other.getInputHierarchicalTableId());
}
if (filtersBuilder_ == null) {
if (!other.filters_.isEmpty()) {
if (filters_.isEmpty()) {
filters_ = other.filters_;
bitField0_ = (bitField0_ & ~0x00000004);
} else {
ensureFiltersIsMutable();
filters_.addAll(other.filters_);
}
onChanged();
}
} else {
if (!other.filters_.isEmpty()) {
if (filtersBuilder_.isEmpty()) {
filtersBuilder_.dispose();
filtersBuilder_ = null;
filters_ = other.filters_;
bitField0_ = (bitField0_ & ~0x00000004);
filtersBuilder_ =
com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ?
getFiltersFieldBuilder() : null;
} else {
filtersBuilder_.addAllMessages(other.filters_);
}
}
}
if (sortsBuilder_ == null) {
if (!other.sorts_.isEmpty()) {
if (sorts_.isEmpty()) {
sorts_ = other.sorts_;
bitField0_ = (bitField0_ & ~0x00000008);
} else {
ensureSortsIsMutable();
sorts_.addAll(other.sorts_);
}
onChanged();
}
} else {
if (!other.sorts_.isEmpty()) {
if (sortsBuilder_.isEmpty()) {
sortsBuilder_.dispose();
sortsBuilder_ = null;
sorts_ = other.sorts_;
bitField0_ = (bitField0_ & ~0x00000008);
sortsBuilder_ =
com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ?
getSortsFieldBuilder() : null;
} else {
sortsBuilder_.addAllMessages(other.sorts_);
}
}
}
this.mergeUnknownFields(other.getUnknownFields());
onChanged();
return this;
}
@java.lang.Override
public final boolean isInitialized() {
return true;
}
@java.lang.Override
public Builder mergeFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws java.io.IOException {
if (extensionRegistry == null) {
throw new java.lang.NullPointerException();
}
try {
boolean done = false;
while (!done) {
int tag = input.readTag();
switch (tag) {
case 0:
done = true;
break;
case 10: {
input.readMessage(
getResultHierarchicalTableIdFieldBuilder().getBuilder(),
extensionRegistry);
bitField0_ |= 0x00000001;
break;
} // case 10
case 18: {
input.readMessage(
getInputHierarchicalTableIdFieldBuilder().getBuilder(),
extensionRegistry);
bitField0_ |= 0x00000002;
break;
} // case 18
case 26: {
io.deephaven.proto.backplane.grpc.Condition m =
input.readMessage(
io.deephaven.proto.backplane.grpc.Condition.parser(),
extensionRegistry);
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
filters_.add(m);
} else {
filtersBuilder_.addMessage(m);
}
break;
} // case 26
case 34: {
io.deephaven.proto.backplane.grpc.SortDescriptor m =
input.readMessage(
io.deephaven.proto.backplane.grpc.SortDescriptor.parser(),
extensionRegistry);
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
sorts_.add(m);
} else {
sortsBuilder_.addMessage(m);
}
break;
} // case 34
default: {
if (!super.parseUnknownField(input, extensionRegistry, tag)) {
done = true; // was an endgroup tag
}
break;
} // default:
} // switch (tag)
} // while (!done)
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
throw e.unwrapIOException();
} finally {
onChanged();
} // finally
return this;
}
private int bitField0_;
private io.deephaven.proto.backplane.grpc.Ticket resultHierarchicalTableId_;
private com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder> resultHierarchicalTableIdBuilder_;
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
* @return Whether the resultHierarchicalTableId field is set.
*/
public boolean hasResultHierarchicalTableId() {
return ((bitField0_ & 0x00000001) != 0);
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
* @return The resultHierarchicalTableId.
*/
public io.deephaven.proto.backplane.grpc.Ticket getResultHierarchicalTableId() {
if (resultHierarchicalTableIdBuilder_ == null) {
return resultHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : resultHierarchicalTableId_;
} else {
return resultHierarchicalTableIdBuilder_.getMessage();
}
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public Builder setResultHierarchicalTableId(io.deephaven.proto.backplane.grpc.Ticket value) {
if (resultHierarchicalTableIdBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
resultHierarchicalTableId_ = value;
} else {
resultHierarchicalTableIdBuilder_.setMessage(value);
}
bitField0_ |= 0x00000001;
onChanged();
return this;
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public Builder setResultHierarchicalTableId(
io.deephaven.proto.backplane.grpc.Ticket.Builder builderForValue) {
if (resultHierarchicalTableIdBuilder_ == null) {
resultHierarchicalTableId_ = builderForValue.build();
} else {
resultHierarchicalTableIdBuilder_.setMessage(builderForValue.build());
}
bitField0_ |= 0x00000001;
onChanged();
return this;
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public Builder mergeResultHierarchicalTableId(io.deephaven.proto.backplane.grpc.Ticket value) {
if (resultHierarchicalTableIdBuilder_ == null) {
if (((bitField0_ & 0x00000001) != 0) &&
resultHierarchicalTableId_ != null &&
resultHierarchicalTableId_ != io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance()) {
getResultHierarchicalTableIdBuilder().mergeFrom(value);
} else {
resultHierarchicalTableId_ = value;
}
} else {
resultHierarchicalTableIdBuilder_.mergeFrom(value);
}
if (resultHierarchicalTableId_ != null) {
bitField0_ |= 0x00000001;
onChanged();
}
return this;
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public Builder clearResultHierarchicalTableId() {
bitField0_ = (bitField0_ & ~0x00000001);
resultHierarchicalTableId_ = null;
if (resultHierarchicalTableIdBuilder_ != null) {
resultHierarchicalTableIdBuilder_.dispose();
resultHierarchicalTableIdBuilder_ = null;
}
onChanged();
return this;
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public io.deephaven.proto.backplane.grpc.Ticket.Builder getResultHierarchicalTableIdBuilder() {
bitField0_ |= 0x00000001;
onChanged();
return getResultHierarchicalTableIdFieldBuilder().getBuilder();
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
public io.deephaven.proto.backplane.grpc.TicketOrBuilder getResultHierarchicalTableIdOrBuilder() {
if (resultHierarchicalTableIdBuilder_ != null) {
return resultHierarchicalTableIdBuilder_.getMessageOrBuilder();
} else {
return resultHierarchicalTableId_ == null ?
io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : resultHierarchicalTableId_;
}
}
/**
*
* Ticket to use to hold the result HierarchicalTable (RollupTable or TreeTable) from the applying the operations
*
*
* .io.deephaven.proto.backplane.grpc.Ticket result_hierarchical_table_id = 1;
*/
private com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder>
getResultHierarchicalTableIdFieldBuilder() {
if (resultHierarchicalTableIdBuilder_ == null) {
resultHierarchicalTableIdBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder>(
getResultHierarchicalTableId(),
getParentForChildren(),
isClean());
resultHierarchicalTableId_ = null;
}
return resultHierarchicalTableIdBuilder_;
}
private io.deephaven.proto.backplane.grpc.Ticket inputHierarchicalTableId_;
private com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder> inputHierarchicalTableIdBuilder_;
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
* @return Whether the inputHierarchicalTableId field is set.
*/
public boolean hasInputHierarchicalTableId() {
return ((bitField0_ & 0x00000002) != 0);
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
* @return The inputHierarchicalTableId.
*/
public io.deephaven.proto.backplane.grpc.Ticket getInputHierarchicalTableId() {
if (inputHierarchicalTableIdBuilder_ == null) {
return inputHierarchicalTableId_ == null ? io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : inputHierarchicalTableId_;
} else {
return inputHierarchicalTableIdBuilder_.getMessage();
}
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public Builder setInputHierarchicalTableId(io.deephaven.proto.backplane.grpc.Ticket value) {
if (inputHierarchicalTableIdBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
inputHierarchicalTableId_ = value;
} else {
inputHierarchicalTableIdBuilder_.setMessage(value);
}
bitField0_ |= 0x00000002;
onChanged();
return this;
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public Builder setInputHierarchicalTableId(
io.deephaven.proto.backplane.grpc.Ticket.Builder builderForValue) {
if (inputHierarchicalTableIdBuilder_ == null) {
inputHierarchicalTableId_ = builderForValue.build();
} else {
inputHierarchicalTableIdBuilder_.setMessage(builderForValue.build());
}
bitField0_ |= 0x00000002;
onChanged();
return this;
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public Builder mergeInputHierarchicalTableId(io.deephaven.proto.backplane.grpc.Ticket value) {
if (inputHierarchicalTableIdBuilder_ == null) {
if (((bitField0_ & 0x00000002) != 0) &&
inputHierarchicalTableId_ != null &&
inputHierarchicalTableId_ != io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance()) {
getInputHierarchicalTableIdBuilder().mergeFrom(value);
} else {
inputHierarchicalTableId_ = value;
}
} else {
inputHierarchicalTableIdBuilder_.mergeFrom(value);
}
if (inputHierarchicalTableId_ != null) {
bitField0_ |= 0x00000002;
onChanged();
}
return this;
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public Builder clearInputHierarchicalTableId() {
bitField0_ = (bitField0_ & ~0x00000002);
inputHierarchicalTableId_ = null;
if (inputHierarchicalTableIdBuilder_ != null) {
inputHierarchicalTableIdBuilder_.dispose();
inputHierarchicalTableIdBuilder_ = null;
}
onChanged();
return this;
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public io.deephaven.proto.backplane.grpc.Ticket.Builder getInputHierarchicalTableIdBuilder() {
bitField0_ |= 0x00000002;
onChanged();
return getInputHierarchicalTableIdFieldBuilder().getBuilder();
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
public io.deephaven.proto.backplane.grpc.TicketOrBuilder getInputHierarchicalTableIdOrBuilder() {
if (inputHierarchicalTableIdBuilder_ != null) {
return inputHierarchicalTableIdBuilder_.getMessageOrBuilder();
} else {
return inputHierarchicalTableId_ == null ?
io.deephaven.proto.backplane.grpc.Ticket.getDefaultInstance() : inputHierarchicalTableId_;
}
}
/**
*
* Ticket for the input HierarchicalTable (RollupTable or TreeTable) to apply operations to
*
*
* .io.deephaven.proto.backplane.grpc.Ticket input_hierarchical_table_id = 2;
*/
private com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder>
getInputHierarchicalTableIdFieldBuilder() {
if (inputHierarchicalTableIdBuilder_ == null) {
inputHierarchicalTableIdBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Ticket, io.deephaven.proto.backplane.grpc.Ticket.Builder, io.deephaven.proto.backplane.grpc.TicketOrBuilder>(
getInputHierarchicalTableId(),
getParentForChildren(),
isClean());
inputHierarchicalTableId_ = null;
}
return inputHierarchicalTableIdBuilder_;
}
private java.util.List filters_ =
java.util.Collections.emptyList();
private void ensureFiltersIsMutable() {
if (!((bitField0_ & 0x00000004) != 0)) {
filters_ = new java.util.ArrayList(filters_);
bitField0_ |= 0x00000004;
}
}
private com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Condition, io.deephaven.proto.backplane.grpc.Condition.Builder, io.deephaven.proto.backplane.grpc.ConditionOrBuilder> filtersBuilder_;
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public java.util.List getFiltersList() {
if (filtersBuilder_ == null) {
return java.util.Collections.unmodifiableList(filters_);
} else {
return filtersBuilder_.getMessageList();
}
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public int getFiltersCount() {
if (filtersBuilder_ == null) {
return filters_.size();
} else {
return filtersBuilder_.getCount();
}
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public io.deephaven.proto.backplane.grpc.Condition getFilters(int index) {
if (filtersBuilder_ == null) {
return filters_.get(index);
} else {
return filtersBuilder_.getMessage(index);
}
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder setFilters(
int index, io.deephaven.proto.backplane.grpc.Condition value) {
if (filtersBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureFiltersIsMutable();
filters_.set(index, value);
onChanged();
} else {
filtersBuilder_.setMessage(index, value);
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder setFilters(
int index, io.deephaven.proto.backplane.grpc.Condition.Builder builderForValue) {
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
filters_.set(index, builderForValue.build());
onChanged();
} else {
filtersBuilder_.setMessage(index, builderForValue.build());
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder addFilters(io.deephaven.proto.backplane.grpc.Condition value) {
if (filtersBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureFiltersIsMutable();
filters_.add(value);
onChanged();
} else {
filtersBuilder_.addMessage(value);
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder addFilters(
int index, io.deephaven.proto.backplane.grpc.Condition value) {
if (filtersBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureFiltersIsMutable();
filters_.add(index, value);
onChanged();
} else {
filtersBuilder_.addMessage(index, value);
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder addFilters(
io.deephaven.proto.backplane.grpc.Condition.Builder builderForValue) {
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
filters_.add(builderForValue.build());
onChanged();
} else {
filtersBuilder_.addMessage(builderForValue.build());
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder addFilters(
int index, io.deephaven.proto.backplane.grpc.Condition.Builder builderForValue) {
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
filters_.add(index, builderForValue.build());
onChanged();
} else {
filtersBuilder_.addMessage(index, builderForValue.build());
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder addAllFilters(
java.lang.Iterable values) {
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(
values, filters_);
onChanged();
} else {
filtersBuilder_.addAllMessages(values);
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder clearFilters() {
if (filtersBuilder_ == null) {
filters_ = java.util.Collections.emptyList();
bitField0_ = (bitField0_ & ~0x00000004);
onChanged();
} else {
filtersBuilder_.clear();
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public Builder removeFilters(int index) {
if (filtersBuilder_ == null) {
ensureFiltersIsMutable();
filters_.remove(index);
onChanged();
} else {
filtersBuilder_.remove(index);
}
return this;
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public io.deephaven.proto.backplane.grpc.Condition.Builder getFiltersBuilder(
int index) {
return getFiltersFieldBuilder().getBuilder(index);
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public io.deephaven.proto.backplane.grpc.ConditionOrBuilder getFiltersOrBuilder(
int index) {
if (filtersBuilder_ == null) {
return filters_.get(index); } else {
return filtersBuilder_.getMessageOrBuilder(index);
}
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public java.util.List
getFiltersOrBuilderList() {
if (filtersBuilder_ != null) {
return filtersBuilder_.getMessageOrBuilderList();
} else {
return java.util.Collections.unmodifiableList(filters_);
}
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public io.deephaven.proto.backplane.grpc.Condition.Builder addFiltersBuilder() {
return getFiltersFieldBuilder().addBuilder(
io.deephaven.proto.backplane.grpc.Condition.getDefaultInstance());
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public io.deephaven.proto.backplane.grpc.Condition.Builder addFiltersBuilder(
int index) {
return getFiltersFieldBuilder().addBuilder(
index, io.deephaven.proto.backplane.grpc.Condition.getDefaultInstance());
}
/**
*
* Filters to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For RollupTables, only the group-by columns may be filtered. The names are always expressed as they appear
* in aggregated node columns (and in the group-by columns). The filtering will result in a complete or partial
* new Table.rollup operation.
* For TreeTables, these may be variously applied to the source (resulting in a new Table.tree operation) or to the
* nodes (resulting in filtering at snapshot time).
*
*
* repeated .io.deephaven.proto.backplane.grpc.Condition filters = 3;
*/
public java.util.List
getFiltersBuilderList() {
return getFiltersFieldBuilder().getBuilderList();
}
private com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Condition, io.deephaven.proto.backplane.grpc.Condition.Builder, io.deephaven.proto.backplane.grpc.ConditionOrBuilder>
getFiltersFieldBuilder() {
if (filtersBuilder_ == null) {
filtersBuilder_ = new com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.Condition, io.deephaven.proto.backplane.grpc.Condition.Builder, io.deephaven.proto.backplane.grpc.ConditionOrBuilder>(
filters_,
((bitField0_ & 0x00000004) != 0),
getParentForChildren(),
isClean());
filters_ = null;
}
return filtersBuilder_;
}
private java.util.List sorts_ =
java.util.Collections.emptyList();
private void ensureSortsIsMutable() {
if (!((bitField0_ & 0x00000008) != 0)) {
sorts_ = new java.util.ArrayList(sorts_);
bitField0_ |= 0x00000008;
}
}
private com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.SortDescriptor, io.deephaven.proto.backplane.grpc.SortDescriptor.Builder, io.deephaven.proto.backplane.grpc.SortDescriptorOrBuilder> sortsBuilder_;
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public java.util.List getSortsList() {
if (sortsBuilder_ == null) {
return java.util.Collections.unmodifiableList(sorts_);
} else {
return sortsBuilder_.getMessageList();
}
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public int getSortsCount() {
if (sortsBuilder_ == null) {
return sorts_.size();
} else {
return sortsBuilder_.getCount();
}
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public io.deephaven.proto.backplane.grpc.SortDescriptor getSorts(int index) {
if (sortsBuilder_ == null) {
return sorts_.get(index);
} else {
return sortsBuilder_.getMessage(index);
}
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder setSorts(
int index, io.deephaven.proto.backplane.grpc.SortDescriptor value) {
if (sortsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureSortsIsMutable();
sorts_.set(index, value);
onChanged();
} else {
sortsBuilder_.setMessage(index, value);
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder setSorts(
int index, io.deephaven.proto.backplane.grpc.SortDescriptor.Builder builderForValue) {
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
sorts_.set(index, builderForValue.build());
onChanged();
} else {
sortsBuilder_.setMessage(index, builderForValue.build());
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder addSorts(io.deephaven.proto.backplane.grpc.SortDescriptor value) {
if (sortsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureSortsIsMutable();
sorts_.add(value);
onChanged();
} else {
sortsBuilder_.addMessage(value);
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder addSorts(
int index, io.deephaven.proto.backplane.grpc.SortDescriptor value) {
if (sortsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureSortsIsMutable();
sorts_.add(index, value);
onChanged();
} else {
sortsBuilder_.addMessage(index, value);
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder addSorts(
io.deephaven.proto.backplane.grpc.SortDescriptor.Builder builderForValue) {
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
sorts_.add(builderForValue.build());
onChanged();
} else {
sortsBuilder_.addMessage(builderForValue.build());
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder addSorts(
int index, io.deephaven.proto.backplane.grpc.SortDescriptor.Builder builderForValue) {
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
sorts_.add(index, builderForValue.build());
onChanged();
} else {
sortsBuilder_.addMessage(index, builderForValue.build());
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder addAllSorts(
java.lang.Iterable values) {
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(
values, sorts_);
onChanged();
} else {
sortsBuilder_.addAllMessages(values);
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder clearSorts() {
if (sortsBuilder_ == null) {
sorts_ = java.util.Collections.emptyList();
bitField0_ = (bitField0_ & ~0x00000008);
onChanged();
} else {
sortsBuilder_.clear();
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public Builder removeSorts(int index) {
if (sortsBuilder_ == null) {
ensureSortsIsMutable();
sorts_.remove(index);
onChanged();
} else {
sortsBuilder_.remove(index);
}
return this;
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public io.deephaven.proto.backplane.grpc.SortDescriptor.Builder getSortsBuilder(
int index) {
return getSortsFieldBuilder().getBuilder(index);
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public io.deephaven.proto.backplane.grpc.SortDescriptorOrBuilder getSortsOrBuilder(
int index) {
if (sortsBuilder_ == null) {
return sorts_.get(index); } else {
return sortsBuilder_.getMessageOrBuilder(index);
}
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public java.util.List
getSortsOrBuilderList() {
if (sortsBuilder_ != null) {
return sortsBuilder_.getMessageOrBuilderList();
} else {
return java.util.Collections.unmodifiableList(sorts_);
}
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public io.deephaven.proto.backplane.grpc.SortDescriptor.Builder addSortsBuilder() {
return getSortsFieldBuilder().addBuilder(
io.deephaven.proto.backplane.grpc.SortDescriptor.getDefaultInstance());
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public io.deephaven.proto.backplane.grpc.SortDescriptor.Builder addSortsBuilder(
int index) {
return getSortsFieldBuilder().addBuilder(
index, io.deephaven.proto.backplane.grpc.SortDescriptor.getDefaultInstance());
}
/**
*
* Sorts to apply to the input HierarchicalTable to produce the result HierarchicalTable. Never expressed against
* the "structural" columns included in the a HierarchicalTableDescriptor's snapshot_schema.
* For TreeTables, these are simply applied to the nodes at snapshot time.
* For RollupTables, these are expressed against the aggregated node columns, and will be applied to the appropriate
* input (constituent) columns as well. The appropriate (aggregated or constituent) sorts are applied to the nodes at
* snapshot time.
*
*
* repeated .io.deephaven.proto.backplane.grpc.SortDescriptor sorts = 4;
*/
public java.util.List
getSortsBuilderList() {
return getSortsFieldBuilder().getBuilderList();
}
private com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.SortDescriptor, io.deephaven.proto.backplane.grpc.SortDescriptor.Builder, io.deephaven.proto.backplane.grpc.SortDescriptorOrBuilder>
getSortsFieldBuilder() {
if (sortsBuilder_ == null) {
sortsBuilder_ = new com.google.protobuf.RepeatedFieldBuilderV3<
io.deephaven.proto.backplane.grpc.SortDescriptor, io.deephaven.proto.backplane.grpc.SortDescriptor.Builder, io.deephaven.proto.backplane.grpc.SortDescriptorOrBuilder>(
sorts_,
((bitField0_ & 0x00000008) != 0),
getParentForChildren(),
isClean());
sorts_ = null;
}
return sortsBuilder_;
}
@java.lang.Override
public final Builder setUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.setUnknownFields(unknownFields);
}
@java.lang.Override
public final Builder mergeUnknownFields(
final com.google.protobuf.UnknownFieldSet unknownFields) {
return super.mergeUnknownFields(unknownFields);
}
// @@protoc_insertion_point(builder_scope:io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)
}
// @@protoc_insertion_point(class_scope:io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest)
private static final io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest();
}
public static io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser
PARSER = new com.google.protobuf.AbstractParser() {
@java.lang.Override
public HierarchicalTableApplyRequest parsePartialFrom(
com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
Builder builder = newBuilder();
try {
builder.mergeFrom(input, extensionRegistry);
} catch (com.google.protobuf.InvalidProtocolBufferException e) {
throw e.setUnfinishedMessage(builder.buildPartial());
} catch (com.google.protobuf.UninitializedMessageException e) {
throw e.asInvalidProtocolBufferException().setUnfinishedMessage(builder.buildPartial());
} catch (java.io.IOException e) {
throw new com.google.protobuf.InvalidProtocolBufferException(e)
.setUnfinishedMessage(builder.buildPartial());
}
return builder.buildPartial();
}
};
public static com.google.protobuf.Parser parser() {
return PARSER;
}
@java.lang.Override
public com.google.protobuf.Parser getParserForType() {
return PARSER;
}
@java.lang.Override
public io.deephaven.proto.backplane.grpc.HierarchicalTableApplyRequest getDefaultInstanceForType() {
return DEFAULT_INSTANCE;
}
}