protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); // If we detect that some rows are out of order we will store and sort the remaining ones to insert them // in a separate SSTable. if (previous != null && comparator.compare(next, previous) < 0) { rowsOutOfOrder = ImmutableBTreePartition.create(UnfilteredRowIterators.concat(next, iterator), false); return endOfData(); } previous = next; return next; } }
protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); // If we detect that some rows are out of order we will store and sort the remaining ones to insert them // in a separate SSTable. if (previous != null && comparator.compare(next, previous) < 0) { rowsOutOfOrder = ImmutableBTreePartition.create(UnfilteredRowIterators.concat(next, iterator), false); return endOfData(); } previous = next; return next; } }
protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); // If we detect that some rows are out of order we will store and sort the remaining ones to insert them // in a separate SSTable. if (previous != null && comparator.compare(next, previous) < 0) { rowsOutOfOrder = ImmutableBTreePartition.create(UnfilteredRowIterators.concat(next, iterator), false); return endOfData(); } previous = next; return next; } }
return cacheIterator; return UnfilteredRowIterators.concat(cacheIterator, clusteringIndexFilter().filterNotIndexed(columnFilter(), iter));
return cacheIterator; return UnfilteredRowIterators.concat(cacheIterator, clusteringIndexFilter().filterNotIndexed(columnFilter(), iter));
return cacheIterator; return UnfilteredRowIterators.concat(cacheIterator, clusteringIndexFilter().filterNotIndexed(columnFilter(), iter));