/** * * * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder setRowKey(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } rowKey_ = value; onChanged(); return this; } /**
/** * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder setRowKey(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } rowKey_ = value; onChanged(); return this; } /**
/** * * * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder setRowKey(com.google.protobuf.ByteString value) { if (value == null) { throw new NullPointerException(); } rowKey_ = value; onChanged(); return this; } /**
/** * * * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder clearRowKey() { rowKey_ = getDefaultInstance().getRowKey(); onChanged(); return this; }
/** * * * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder setOffsetBytes(long value) { offsetBytes_ = value; onChanged(); return this; } /**
/** * * * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder clearOffsetBytes() { offsetBytes_ = 0L; onChanged(); return this; }
/** * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder clearOffsetBytes() { offsetBytes_ = 0L; onChanged(); return this; } public final Builder setUnknownFields(
/** * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder setOffsetBytes(long value) { offsetBytes_ = value; onChanged(); return this; } /**
/** * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder clearRowKey() { rowKey_ = getDefaultInstance().getRowKey(); onChanged(); return this; }
public Builder mergeFrom(com.google.bigtable.v2.SampleRowKeysResponse other) { if (other == com.google.bigtable.v2.SampleRowKeysResponse.getDefaultInstance()) return this; if (other.getRowKey() != com.google.protobuf.ByteString.EMPTY) { setRowKey(other.getRowKey()); } if (other.getOffsetBytes() != 0L) { setOffsetBytes(other.getOffsetBytes()); } onChanged(); return this; }
public Builder mergeFrom(com.google.bigtable.v2.SampleRowKeysResponse other) { if (other == com.google.bigtable.v2.SampleRowKeysResponse.getDefaultInstance()) return this; if (other.getRowKey() != com.google.protobuf.ByteString.EMPTY) { setRowKey(other.getRowKey()); } if (other.getOffsetBytes() != 0L) { setOffsetBytes(other.getOffsetBytes()); } this.mergeUnknownFields(other.unknownFields); onChanged(); return this; }
/** * * * <pre> * Sorted streamed sequence of sample row keys in the table. The table might * have contents before the first row key in the list and after the last one, * but a key containing the empty string indicates "end of table" and will be * the last response given, if present. * Note that row keys in this list may not have ever been written to or read * from, and users should therefore not make any assumptions about the row key * structure that are specific to their use case. * </pre> * * <code>bytes row_key = 1;</code> */ public Builder clearRowKey() { rowKey_ = getDefaultInstance().getRowKey(); onChanged(); return this; }
/** * * * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder clearOffsetBytes() { offsetBytes_ = 0L; onChanged(); return this; }
/** * * * <pre> * Approximate total storage space used by all rows in the table which precede * `row_key`. Buffering the contents of all rows between two subsequent * samples would require space roughly equal to the difference in their * `offset_bytes` fields. * </pre> * * <code>int64 offset_bytes = 2;</code> */ public Builder setOffsetBytes(long value) { offsetBytes_ = value; onChanged(); return this; } /**
public Builder mergeFrom(com.google.bigtable.v2.SampleRowKeysResponse other) { if (other == com.google.bigtable.v2.SampleRowKeysResponse.getDefaultInstance()) return this; if (other.getRowKey() != com.google.protobuf.ByteString.EMPTY) { setRowKey(other.getRowKey()); } if (other.getOffsetBytes() != 0L) { setOffsetBytes(other.getOffsetBytes()); } this.mergeUnknownFields(other.unknownFields); onChanged(); return this; }