/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public java.util.List<com.google.bigtable.v2.MutateRowsRequest.Entry.Builder> getEntriesBuilderList() { return getEntriesFieldBuilder().getBuilderList(); }
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder getEntriesBuilder(int index) { return getEntriesFieldBuilder().getBuilder(index); } /**
entriesBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getEntriesFieldBuilder() : null; } else {
entriesBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getEntriesFieldBuilder() : null; } else {
entriesBuilder_ = com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders ? getEntriesFieldBuilder() : null; } else { entriesBuilder_.addAllMessages(other.entries_);
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder getEntriesBuilder(int index) { return getEntriesFieldBuilder().getBuilder(index); } /**
/** * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder( int index) { return getEntriesFieldBuilder().addBuilder( index, com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public java.util.List<com.google.bigtable.v2.MutateRowsRequest.Entry.Builder> getEntriesBuilderList() { return getEntriesFieldBuilder().getBuilderList(); }
/** * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public java.util.List<com.google.bigtable.v2.MutateRowsRequest.Entry.Builder> getEntriesBuilderList() { return getEntriesFieldBuilder().getBuilderList(); } private com.google.protobuf.RepeatedFieldBuilderV3<
/** * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder getEntriesBuilder( int index) { return getEntriesFieldBuilder().getBuilder(index); } /**
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder() { return getEntriesFieldBuilder() .addBuilder(com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
/** * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder() { return getEntriesFieldBuilder().addBuilder( com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder(int index) { return getEntriesFieldBuilder() .addBuilder(index, com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3 .alwaysUseFieldBuilders) { getEntriesFieldBuilder(); } } public Builder clear() {
private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders) { getEntriesFieldBuilder(); } }
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder() { return getEntriesFieldBuilder() .addBuilder(com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
/** * * * <pre> * The row keys and corresponding mutations to be applied in bulk. * Each entry is applied as an atomic mutation, but the entries may be * applied in arbitrary order (even between entries for the same row). * At least one entry must be specified, and in total the entries can * contain at most 100000 mutations. * </pre> * * <code>repeated .google.bigtable.v2.MutateRowsRequest.Entry entries = 2;</code> */ public com.google.bigtable.v2.MutateRowsRequest.Entry.Builder addEntriesBuilder(int index) { return getEntriesFieldBuilder() .addBuilder(index, com.google.bigtable.v2.MutateRowsRequest.Entry.getDefaultInstance()); } /**
private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3.alwaysUseFieldBuilders) { getEntriesFieldBuilder(); } }