right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); right = requested.rightBoundary(); left = maxLeft(left, sstable.first, true); : minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
/** * Whether the provided ring position is covered by this {@code DataRange}. * * @return whether the provided ring position is covered by this {@code DataRange}. */ public boolean contains(PartitionPosition pos) { return keyRange.contains(pos); }
public String getString(AbstractType<?> keyValidator) { return getOpeningString() + format(left, keyValidator) + ", " + format(right, keyValidator) + getClosingString(); }
public String toString(CFMetaData metadata) { return String.format("range=%s pfilter=%s", keyRange.getString(metadata.getKeyValidator()), clusteringIndexFilter.toString(metadata)); }
public static <T extends RingPosition<T>> AbstractBounds<T> bounds(Boundary<T> min, Boundary<T> max) { return bounds(min.boundary, min.inclusive, max.boundary, max.inclusive); } public static <T extends RingPosition<T>> AbstractBounds<T> bounds(T min, boolean inclusiveMin, T max, boolean inclusiveMax)
public Boundary<T> rightBoundary() { return new Boundary<>(right, inclusiveRight()); }
public Boundary<T> leftBoundary() { return new Boundary<>(left, inclusiveLeft()); }
public String toString(CFMetaData metadata) { return String.format("range=%s pfilter=%s", keyRange.getString(metadata.getKeyValidator()), clusteringIndexFilter.toString(metadata)); }
public static <T extends RingPosition<T>> AbstractBounds<T> bounds(Boundary<T> min, Boundary<T> max) { return bounds(min.boundary, min.inclusive, max.boundary, max.inclusive); } public static <T extends RingPosition<T>> AbstractBounds<T> bounds(T min, boolean inclusiveMin, T max, boolean inclusiveMax)
public Boundary<T> rightBoundary() { return new Boundary<>(right, inclusiveRight()); }
public Boundary<T> leftBoundary() { return new Boundary<>(left, inclusiveLeft()); }
right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); right = requested.rightBoundary(); left = maxLeft(left, sstable.first, true); : minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
public String getString(AbstractType<?> keyValidator) { return getOpeningString() + format(left, keyValidator) + ", " + format(right, keyValidator) + getClosingString(); }
/** * Whether the provided ring position is covered by this {@code DataRange}. * * @return whether the provided ring position is covered by this {@code DataRange}. */ public boolean contains(PartitionPosition pos) { return keyRange.contains(pos); }
public String toString(CFMetaData metadata) { return String.format("range=%s pfilter=%s", keyRange.getString(metadata.getKeyValidator()), clusteringIndexFilter.toString(metadata)); }
public static <T extends RingPosition<T>> AbstractBounds<T> bounds(Boundary<T> min, Boundary<T> max) { return bounds(min.boundary, min.inclusive, max.boundary, max.inclusive); } public static <T extends RingPosition<T>> AbstractBounds<T> bounds(T min, boolean inclusiveMin, T max, boolean inclusiveMax)
public Boundary<T> rightBoundary() { return new Boundary<>(right, inclusiveRight()); }