public Unfiltered next() { return wrapped.next(); }
public Unfiltered next() { return wrapped.next(); }
public Unfiltered next() { return wrapped.next(); }
public Unfiltered next() { return wrapped.next(); }
private static Unfiltered advance(UnfilteredRowIterator source) { return source.hasNext() ? source.next() : null; }
private static Unfiltered advance(UnfilteredRowIterator source) { return source.hasNext() ? source.next() : null; }
private static Unfiltered advance(UnfilteredRowIterator source) { return source.hasNext() ? source.next() : null; }
protected Unfiltered computeNext() { maybeInit(); return iterator.hasNext() ? iterator.next() : endOfData(); }
protected Unfiltered computeNext() { maybeInit(); return iterator.hasNext() ? iterator.next() : endOfData(); }
protected Unfiltered computeNext() { maybeInit(); return iterator.hasNext() ? iterator.next() : endOfData(); }
protected Unfiltered computeNext() { maybeInit(); return iterator.hasNext() ? iterator.next() : endOfData(); }
private String toDebugString(UnfilteredRowIterator partition, CFMetaData metadata) { StringBuilder sb = new StringBuilder(); sb.append(String.format("[%s.%s] key=%s partition_deletion=%s columns=%s", metadata.ksName, metadata.cfName, metadata.getKeyValidator().getString(partition.partitionKey().getKey()), partition.partitionLevelDeletion(), partition.columns())); if (partition.staticRow() != Rows.EMPTY_STATIC_ROW) sb.append("\n ").append(partition.staticRow().toString(metadata, true)); while (partition.hasNext()) sb.append("\n ").append(partition.next().toString(metadata, true)); return sb.toString(); }
public void buildRowIndex(UnfilteredRowIterator iterator) throws IOException { writePartitionHeader(iterator); this.headerLength = writer.position() - initialPosition; while (iterator.hasNext()) add(iterator.next()); finish(); }
public void buildRowIndex(UnfilteredRowIterator iterator) throws IOException { writePartitionHeader(iterator); this.headerLength = writer.position() - initialPosition; while (iterator.hasNext()) add(iterator.next()); finish(); }
public void buildRowIndex(UnfilteredRowIterator iterator) throws IOException { writePartitionHeader(iterator); this.headerLength = writer.position() - initialPosition; while (iterator.hasNext()) add(iterator.next()); finish(); }
public void buildRowIndex(UnfilteredRowIterator iterator) throws IOException { writePartitionHeader(iterator); this.headerLength = writer.position() - initialPosition; while (iterator.hasNext()) add(iterator.next()); finish(); }
protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); if (!next.isRow()) return next; if (hasNegativeLocalExpirationTime((Row) next)) { outputHandler.debug(String.format("Found row with negative local expiration time: %s", next.toString(metadata(), false))); negativeLocalExpirationTimeMetrics.fixedRows++; return fixNegativeLocalExpirationTime((Row) next); } return next; }
protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); if (!next.isRow()) return next; if (hasNegativeLocalExpirationTime((Row) next)) { outputHandler.debug(String.format("Found row with negative local expiration time: %s", next.toString(metadata(), false))); negativeLocalExpirationTimeMetrics.fixedRows++; return fixNegativeLocalExpirationTime((Row) next); } return next; }
protected Unfiltered computeNext() { if (!iterator.hasNext()) return endOfData(); Unfiltered next = iterator.next(); if (!next.isRow()) return next; if (hasNegativeLocalExpirationTime((Row) next)) { outputHandler.debug(String.format("Found row with negative local expiration time: %s", next.toString(metadata(), false))); negativeLocalExpirationTimeMetrics.fixedRows++; return fixNegativeLocalExpirationTime((Row) 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; } }