/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations(com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.add(value); onChanged(); } else { mutationsBuilder_.addMessage(value); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations(int index, com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.add(index, value); onChanged(); } else { mutationsBuilder_.addMessage(index, value); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder setMutations(int index, com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.set(index, value); onChanged(); } else { mutationsBuilder_.setMessage(index, value); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations( int index, com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.add(index, value); onChanged(); } else { mutationsBuilder_.addMessage(index, value); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder setMutations( int index, com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.set(index, value); onChanged(); } else { mutationsBuilder_.setMessage(index, value); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addAllMutations( java.lang.Iterable<? extends com.google.bigtable.v2.Mutation> values) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll(values, mutations_); onChanged(); } else { mutationsBuilder_.addAllMessages(values); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations(com.google.bigtable.v2.Mutation value) { if (mutationsBuilder_ == null) { if (value == null) { throw new NullPointerException(); } ensureMutationsIsMutable(); mutations_.add(value); onChanged(); } else { mutationsBuilder_.addMessage(value); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations(com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.add(builderForValue.build()); onChanged(); } else { mutationsBuilder_.addMessage(builderForValue.build()); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder setMutations( int index, com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.set(index, builderForValue.build()); onChanged(); } else { mutationsBuilder_.setMessage(index, builderForValue.build()); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder removeMutations(int index) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.remove(index); onChanged(); } else { mutationsBuilder_.remove(index); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations( com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.add(builderForValue.build()); onChanged(); } else { mutationsBuilder_.addMessage(builderForValue.build()); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addAllMutations( java.lang.Iterable<? extends com.google.bigtable.v2.Mutation> values) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, mutations_); onChanged(); } else { mutationsBuilder_.addAllMessages(values); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations( int index, com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.add(index, builderForValue.build()); onChanged(); } else { mutationsBuilder_.addMessage(index, builderForValue.build()); } return this; } /**
/** * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder removeMutations(int index) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.remove(index); onChanged(); } else { mutationsBuilder_.remove(index); } return this; } /**
bitField0_ = (bitField0_ & ~0x00000008); } else { ensureMutationsIsMutable(); mutations_.addAll(other.mutations_);
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addAllMutations( java.lang.Iterable<? extends com.google.bigtable.v2.Mutation> values) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll(values, mutations_); onChanged(); } else { mutationsBuilder_.addAllMessages(values); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations( int index, com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.add(index, builderForValue.build()); onChanged(); } else { mutationsBuilder_.addMessage(index, builderForValue.build()); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder setMutations( int index, com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.set(index, builderForValue.build()); onChanged(); } else { mutationsBuilder_.setMessage(index, builderForValue.build()); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder removeMutations(int index) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.remove(index); onChanged(); } else { mutationsBuilder_.remove(index); } return this; } /**
/** * * * <pre> * Changes to be atomically applied to the specified row. Entries are applied * in order, meaning that earlier mutations can be masked by later ones. * Must contain at least one entry and at most 100000. * </pre> * * <code>repeated .google.bigtable.v2.Mutation mutations = 3;</code> */ public Builder addMutations(com.google.bigtable.v2.Mutation.Builder builderForValue) { if (mutationsBuilder_ == null) { ensureMutationsIsMutable(); mutations_.add(builderForValue.build()); onChanged(); } else { mutationsBuilder_.addMessage(builderForValue.build()); } return this; } /**