/** * * * <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 Builder addEntries(int index, com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.add(index, value); onChanged(); } else { entriesBuilder_.addMessage(index, value); } return this; } /**
/** * * * <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 Builder addEntries(com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.add(value); onChanged(); } else { entriesBuilder_.addMessage(value); } return this; } /**
/** * * * <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 Builder setEntries(int index, com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.set(index, value); onChanged(); } else { entriesBuilder_.setMessage(index, value); } return this; } /**
/** * <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 Builder addEntries(com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.add(value); onChanged(); } else { entriesBuilder_.addMessage(value); } return this; } /**
/** * * * <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 Builder addEntries(int index, com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.add(index, value); onChanged(); } else { entriesBuilder_.addMessage(index, value); } return this; } /**
/** * * * <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 Builder removeEntries(int index) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.remove(index); onChanged(); } else { entriesBuilder_.remove(index); } return this; } /**
/** * <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 Builder setEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry value) { if (entriesBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureEntriesIsMutable(); entries_.set(index, value); onChanged(); } else { entriesBuilder_.setMessage(index, value); } return this; } /**
/** * <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 Builder addAllEntries( java.lang.Iterable<? extends com.google.bigtable.v2.MutateRowsRequest.Entry> values) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, entries_); onChanged(); } else { entriesBuilder_.addAllMessages(values); } return this; } /**
/** * <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 Builder addEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.add(index, builderForValue.build()); onChanged(); } else { entriesBuilder_.addMessage(index, builderForValue.build()); } return this; } /**
/** * <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 Builder addEntries( com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.add(builderForValue.build()); onChanged(); } else { entriesBuilder_.addMessage(builderForValue.build()); } return this; } /**
/** * * * <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 Builder addEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.add(index, builderForValue.build()); onChanged(); } else { entriesBuilder_.addMessage(index, builderForValue.build()); } return this; } /**
/** * * * <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 Builder addAllEntries( java.lang.Iterable<? extends com.google.bigtable.v2.MutateRowsRequest.Entry> values) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll(values, entries_); onChanged(); } else { entriesBuilder_.addAllMessages(values); } return this; } /**
/** * <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 Builder removeEntries(int index) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.remove(index); onChanged(); } else { entriesBuilder_.remove(index); } return this; } /**
/** * <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 Builder setEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.set(index, builderForValue.build()); onChanged(); } else { entriesBuilder_.setMessage(index, builderForValue.build()); } return this; } /**
bitField0_ = (bitField0_ & ~0x00000004); } else { ensureEntriesIsMutable(); entries_.addAll(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 Builder addAllEntries( java.lang.Iterable<? extends com.google.bigtable.v2.MutateRowsRequest.Entry> values) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll(values, entries_); onChanged(); } else { entriesBuilder_.addAllMessages(values); } return this; } /**
/** * * * <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 Builder addEntries( com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.add(builderForValue.build()); onChanged(); } else { entriesBuilder_.addMessage(builderForValue.build()); } return this; } /**
/** * * * <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 Builder setEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.set(index, builderForValue.build()); onChanged(); } else { entriesBuilder_.setMessage(index, builderForValue.build()); } return this; } /**
/** * * * <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 Builder removeEntries(int index) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.remove(index); onChanged(); } else { entriesBuilder_.remove(index); } return this; } /**
/** * * * <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 Builder addEntries( int index, com.google.bigtable.v2.MutateRowsRequest.Entry.Builder builderForValue) { if (entriesBuilder_ == null) { ensureEntriesIsMutable(); entries_.add(index, builderForValue.build()); onChanged(); } else { entriesBuilder_.addMessage(index, builderForValue.build()); } return this; } /**