@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { log.debug("{} seek({}, {}, {})", prefix, range, columnFamilies, inclusive); super.seek(range, columnFamilies, inclusive); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { range = rowRange.clip(range, true); if (range == null) { hasTop = false; } else { hasTop = true; super.seek(range, columnFamilies, inclusive); } } }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); findTop(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); consume(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); advance = null; this.columnFamilies = columnFamilies; this.inclusive = inclusive; seekRange = range; advancedPastSeek = false; findTop(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); this.columnFamilies = columnFamilies; this.inclusive = inclusive; this.range = range; currentRow = null; hasTop = true; skipRows(); } }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); if (hasTop()) getTopKeyVal(); Key k = range.getStartKey(); if (k instanceof MemKey && hasTop()) { while (hasTop() && currKey.compareTo(k) < 0) next(); } }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { // do not want to seek to the middle of a row Range seekRange = IteratorUtil.maximizeStartKeyTimeStamp(range); this.range = seekRange; this.columnFamilies = columnFamilies; this.inclusive = inclusive; super.seek(seekRange, columnFamilies, inclusive); resetVersionCount(); if (range.getStartKey() != null) while (hasTop() && range.beforeStartKey(getTopKey())) next(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { seekRange = new Range(range); seekColumnFamilies = columnFamilies; seekColumnFamiliesInclusive = inclusive; // Seek the source iterator, but use a recalculated range that ensures // we see all keys with the same "prefix." We need to do this since // transforming could change the sort order and transformed keys that // are before the range start could be inside the range after transformation. super.seek(computeReseekRange(range), untransformColumnFamilies(columnFamilies), inclusive); // Range clipping could cause us to trim out all the keys we transformed. // Keep looping until we either have some keys in the output range, or have // exhausted the source iterator. keyPos = -1; // “Clear” list so hasTop returns false to get us into the loop (transformKeys // actually clears) while (!hasTop() && super.hasTop()) { // Build up a sorted list of all keys for the same prefix. When // people ask for keys, return from this list first until it is empty // before incrementing the source iterator. transformKeys(); } }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { log.debug(prefix + " seek(" + range + ", " + columnFamilies + ", " + inclusive + ")"); super.seek(range, columnFamilies, inclusive); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); consume(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { this.range = range; this.columnFamilies = columnFamilies; this.inclusive = inclusive; super.seek(range, columnFamilies, inclusive); seekIfNecessary(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); findTop(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); findTop(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { // do not want to seek to the middle of a value that should be combined... Range seekRange = IteratorUtil.maximizeStartKeyTimeStamp(range); super.seek(seekRange, columnFamilies, inclusive); findTop(); if (range.getStartKey() != null) { while (hasTop() && getTopKey().equals(range.getStartKey(), PartialKey.ROW_COLFAM_COLQUAL_COLVIS) && getTopKey().getTimestamp() > range.getStartKey().getTimestamp()) { // the value has a more recent time stamp, so pass it up // log.debug("skipping "+getTopKey()); next(); } while (hasTop() && range.beforeStartKey(getTopKey())) { next(); } } }
@Override public void seek(Range r, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { this.seekRange = new Range(r); this.seekColumnFamilies = columnFamilies == null ? null : new ArrayList<>(columnFamilies); this.seekInclusive = inclusive; super.seek(r, columnFamilies, inclusive); next(); }
@Override public void seek(final Range range, final Collection<ByteSequence> columnFamilies, final boolean inclusive) throws IOException { topKey = null; workKey = new Key(); super.seek(range, columnFamilies, inclusive); currentRange = range; currentColumnFamilies = columnFamilies; currentColumnFamiliesInclusive = inclusive; findTop(); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { if (isUnfairExecution()) { throw new IteratorTimeoutException("Exception seek()"); } super.seek(range, columnFamilies, inclusive); }
@Override public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); if (hasTop()) processNext(); }
public void seek(Range range, Collection<ByteSequence> columnFamilies, boolean inclusive) throws IOException { super.seek(range, columnFamilies, inclusive); if (hasTop()) getTopKeyVal(); Key k = range.getStartKey(); if (k instanceof MemKey && hasTop()) { while (hasTop() && currKey.compareTo(k) < 0) next(); } }