public boolean isFullyCoveredBy(CachedPartition partition) { if (partition.isEmpty()) return false; // 'partition' contains all columns, so it covers our filter if our last clusterings // is smaller than the last in the cache return clusterings.comparator().compare(clusterings.last(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { if (partition.isEmpty()) return false; // 'partition' contains all columns, so it covers our filter if our last clusterings // is smaller than the last in the cache return clusterings.comparator().compare(clusterings.last(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { if (partition.isEmpty()) return false; // 'partition' contains all columns, so it covers our filter if our last clusterings // is smaller than the last in the cache return clusterings.comparator().compare(clusterings.last(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { if (partition.isEmpty()) return false; // 'partition' contains all columns, so it covers our filter if our last clusterings // is smaller than the last in the cache return clusterings.comparator().compare(clusterings.last(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { // Partition is guaranteed to cover the whole filter if it includes the filter start and finish bounds. // (note that since partition is the head of a partition, to have no lower bound is ok) if (!slices.hasUpperBound() || partition.isEmpty()) return false; return partition.metadata().comparator.compare(slices.get(slices.size() - 1).end(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { // Partition is guaranteed to cover the whole filter if it includes the filter start and finish bounds. // (note that since partition is the head of a partition, to have no lower bound is ok) if (!slices.hasUpperBound() || partition.isEmpty()) return false; return partition.metadata().comparator.compare(slices.get(slices.size() - 1).end(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { // Partition is guaranteed to cover the whole filter if it includes the filter start and finish bounds. // (note that since partition is the head of a partition, to have no lower bound is ok) if (!slices.hasUpperBound() || partition.isEmpty()) return false; return partition.metadata().comparator.compare(slices.get(slices.size() - 1).end(), partition.lastRow().clustering()) <= 0; }
public boolean isFullyCoveredBy(CachedPartition partition) { // Partition is guaranteed to cover the whole filter if it includes the filter start and finish bounds. // (note that since partition is the head of a partition, to have no lower bound is ok) if (!slices.hasUpperBound() || partition.isEmpty()) return false; return partition.metadata().comparator.compare(slices.get(slices.size() - 1).end(), partition.lastRow().clustering()) <= 0; }
if (sentinelSuccess && !toCache.isEmpty())
if (sentinelSuccess && !toCache.isEmpty())
if (sentinelSuccess && !toCache.isEmpty())