public Builder addAll(PartitionColumns columns) { if (regularColumns == null && !columns.regulars.isEmpty()) regularColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.regulars) regularColumns.add(c); if (staticColumns == null && !columns.statics.isEmpty()) staticColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.statics) staticColumns.add(c); return this; }
public Builder addAll(PartitionColumns columns) { if (regularColumns == null && !columns.regulars.isEmpty()) regularColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.regulars) regularColumns.add(c); if (staticColumns == null && !columns.statics.isEmpty()) staticColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.statics) staticColumns.add(c); return this; }
public Builder addAll(PartitionColumns columns) { if (regularColumns == null && !columns.regulars.isEmpty()) regularColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.regulars) regularColumns.add(c); if (staticColumns == null && !columns.statics.isEmpty()) staticColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.statics) staticColumns.add(c); return this; }
public Builder addAll(PartitionColumns columns) { if (regularColumns == null && !columns.regulars.isEmpty()) regularColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.regulars) regularColumns.add(c); if (staticColumns == null && !columns.statics.isEmpty()) staticColumns = BTreeSet.builder(naturalOrder()); for (ColumnDefinition c : columns.statics) staticColumns.add(c); return this; }
public Builder add(ColumnDefinition c) { if (c.isStatic()) { if (staticColumns == null) staticColumns = BTreeSet.builder(naturalOrder()); staticColumns.add(c); } else { assert c.isRegular(); if (regularColumns == null) regularColumns = BTreeSet.builder(naturalOrder()); regularColumns.add(c); } return this; }
public Builder add(ColumnDefinition c) { if (c.isStatic()) { if (staticColumns == null) staticColumns = BTreeSet.builder(naturalOrder()); staticColumns.add(c); } else { assert c.isRegular(); if (regularColumns == null) regularColumns = BTreeSet.builder(naturalOrder()); regularColumns.add(c); } return this; }
public Builder add(ColumnDefinition c) { if (c.isStatic()) { if (staticColumns == null) staticColumns = BTreeSet.builder(naturalOrder()); staticColumns.add(c); } else { assert c.isRegular(); if (regularColumns == null) regularColumns = BTreeSet.builder(naturalOrder()); regularColumns.add(c); } return this; }
public Builder add(ColumnDefinition c) { if (c.isStatic()) { if (staticColumns == null) staticColumns = BTreeSet.builder(naturalOrder()); staticColumns.add(c); } else { assert c.isRegular(); if (regularColumns == null) regularColumns = BTreeSet.builder(naturalOrder()); regularColumns.add(c); } return this; }
public NavigableSet<ClusteringBound> buildBound(boolean isStart, boolean isInclusive) { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(comparator, builder.buildBound(isStart, isInclusive)); // Use a TreeSet to sort and eliminate duplicates BTreeSet.Builder<ClusteringBound> set = BTreeSet.builder(comparator); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildBoundWith(elements, isStart, isInclusive)); } return set.build(); } }
public NavigableSet<ClusteringBound> buildBound(boolean isStart, boolean isInclusive) { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(comparator, builder.buildBound(isStart, isInclusive)); // Use a TreeSet to sort and eliminate duplicates BTreeSet.Builder<ClusteringBound> set = BTreeSet.builder(comparator); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildBoundWith(elements, isStart, isInclusive)); } return set.build(); } }
public NavigableSet<ClusteringBound> buildBound(boolean isStart, boolean isInclusive) { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(comparator, builder.buildBound(isStart, isInclusive)); // Use a TreeSet to sort and eliminate duplicates BTreeSet.Builder<ClusteringBound> set = BTreeSet.builder(comparator); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildBoundWith(elements, isStart, isInclusive)); } return set.build(); } }
public NavigableSet<ClusteringBound> buildBound(boolean isStart, boolean isInclusive) { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(comparator, builder.buildBound(isStart, isInclusive)); // Use a TreeSet to sort and eliminate duplicates BTreeSet.Builder<ClusteringBound> set = BTreeSet.builder(comparator); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildBoundWith(elements, isStart, isInclusive)); } return set.build(); } }
public NavigableSet<Clustering> build() { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(builder.comparator(), builder.build()); BTreeSet.Builder<Clustering> set = BTreeSet.builder(builder.comparator()); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildWith(elements)); } return set.build(); }
public NavigableSet<Clustering> build() { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(builder.comparator(), builder.build()); BTreeSet.Builder<Clustering> set = BTreeSet.builder(builder.comparator()); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildWith(elements)); } return set.build(); }
public NavigableSet<Clustering> build() { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(builder.comparator(), builder.build()); BTreeSet.Builder<Clustering> set = BTreeSet.builder(builder.comparator()); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildWith(elements)); } return set.build(); }
public NavigableSet<Clustering> build() { built = true; if (hasMissingElements) return BTreeSet.empty(comparator); CBuilder builder = CBuilder.create(comparator); if (elementsList.isEmpty()) return BTreeSet.of(builder.comparator(), builder.build()); BTreeSet.Builder<Clustering> set = BTreeSet.builder(builder.comparator()); for (int i = 0, m = elementsList.size(); i < m; i++) { List<ByteBuffer> elements = elementsList.get(i); set.add(builder.buildWith(elements)); } return set.build(); }
public ClusteringIndexFilter deserialize(DataInputPlus in, int version, CFMetaData metadata, boolean reversed) throws IOException { ClusteringComparator comparator = metadata.comparator; BTreeSet.Builder<Clustering> clusterings = BTreeSet.builder(comparator); int size = (int)in.readUnsignedVInt(); for (int i = 0; i < size; i++) clusterings.add(Clustering.serializer.deserialize(in, version, comparator.subtypes())); return new ClusteringIndexNamesFilter(clusterings.build(), reversed); } }
public ClusteringIndexFilter deserialize(DataInputPlus in, int version, CFMetaData metadata, boolean reversed) throws IOException { ClusteringComparator comparator = metadata.comparator; BTreeSet.Builder<Clustering> clusterings = BTreeSet.builder(comparator); int size = (int)in.readUnsignedVInt(); for (int i = 0; i < size; i++) clusterings.add(Clustering.serializer.deserialize(in, version, comparator.subtypes())); return new ClusteringIndexNamesFilter(clusterings.build(), reversed); } }
public ClusteringIndexFilter deserialize(DataInputPlus in, int version, CFMetaData metadata, boolean reversed) throws IOException { ClusteringComparator comparator = metadata.comparator; BTreeSet.Builder<Clustering> clusterings = BTreeSet.builder(comparator); int size = (int)in.readUnsignedVInt(); for (int i = 0; i < size; i++) clusterings.add(Clustering.serializer.deserialize(in, version, comparator.subtypes())); return new ClusteringIndexNamesFilter(clusterings.build(), reversed); } }
public ClusteringIndexFilter deserialize(DataInputPlus in, int version, CFMetaData metadata, boolean reversed) throws IOException { ClusteringComparator comparator = metadata.comparator; BTreeSet.Builder<Clustering> clusterings = BTreeSet.builder(comparator); int size = (int)in.readUnsignedVInt(); for (int i = 0; i < size; i++) clusterings.add(Clustering.serializer.deserialize(in, version, comparator.subtypes())); return new ClusteringIndexNamesFilter(clusterings.build(), reversed); } }