@Override public void next() throws IOException { super.next(); count++; }
@Override public void next() throws IOException { log.debug("{} next()", prefix); super.next(); }
@Override public void next() throws IOException { super.next(); count++; if (count % 1024 == 0) { entriesRead.addAndGet(1024); } }
@Override public void next() throws IOException { super.next(); findTop(); }
@Override public void next() throws IOException { super.next(); skipRows(); }
@Override public void next() throws IOException { if (topKey != null) { topKey = null; topValue = null; } else { super.next(); } findTop(); }
@Override public void next() throws IOException { super.next(); consume(); }
@Override public void next() throws IOException { super.next(); if (hasTop()) getTopKeyVal(); }
super.next();
private void skipRowColumn() throws IOException { Key keyToSkip = currentKey; super.next(); int count = 0; SortedKeyValueIterator<Key,Value> source = getSource(); while (source.hasTop() && source.getTopKey().equals(keyToSkip, PartialKey.ROW_COLFAM_COLQUAL_COLVIS)) { if (count < maxCount) { // it is quicker to call next if we are close, but we never know if we are close // so give next a try a few times source.next(); count++; } else { reseek(keyToSkip.followingKey(PartialKey.ROW_COLFAM_COLQUAL_COLVIS)); count = 0; } } }
@Override public void next() throws IOException { super.next(); count++; }
@Override public void next() throws IOException { if (numVersions >= maxVersions) { skipRowColumn(); resetVersionCount(); return; } super.next(); if (getSource().hasTop()) { if (getSource().getTopKey().equals(currentKey, PartialKey.ROW_COLFAM_COLQUAL_COLVIS)) { numVersions++; } else { resetVersionCount(); } } }
@Override public void next() throws IOException { super.next(); numRead++; if (numRead % 23 == 0) { readCounter.addAndGet(numRead); numRead = 0; } }
@Override public void next() throws IOException { super.next(); count++; if (count % 1024 == 0) { entriesRead.addAndGet(1024); } }
@Override public void next() throws IOException { log.info(prefix + " next()"); super.next(); }
@Override public void next() throws IOException { super.next(); consume(); }
@Override public void next() throws IOException { sleepUninterruptibly(sleepTime, TimeUnit.MILLISECONDS); super.next(); }
@Override public void next() throws IOException { super.next(); seekIfNecessary(); }
@Override public void next() throws IOException { if (null == topKey) { super.next(); } else { topKey = null; topValue = null; } findTop(); }
@Override public void next() throws IOException { super.next(); if (hasTop()) processNext(); }