@Override public Value getTopValue() { return source.getTopValue(); }
@Override public final Value getTopValue() { return topIdx.getTopValue(); }
@Override public synchronized V getTopValue() { return source.getTopValue(); }
@Override public synchronized Value getTopValue() { return source.getTopValue(); }
@Override public Value getTopValue() { return source.getTopValue(); }
@Override public Value getTopValue() { return source.getTopValue(); }
@Override public Value getTopValue() { return source.getTopValue(); }
@Override public Value getTopValue() { return source.getTopValue(); }
@Override public final Value getTopValue() { final Value v = currentTerm.iter.getTopValue(); LOG.trace("getTopValue() = {}", v); return v; }
@Override public Value getTopValue() { if (!hasTop) throw new IllegalStateException(); return reader.getTopValue(); }
@Override public Value getTopValue() { if (!seenSeek) throw new IllegalStateException("never been seeked"); return getSource().getTopValue(); }
@Override public Value next() { if (!hasNext) throw new NoSuchElementException(); Value topValue = new Value(source.getTopValue()); try { source.next(); hasNext = _hasNext(); } catch (IOException e) { throw new RuntimeException(e); } return topValue; }
TreeMap<Key,Value> consume(SortedKeyValueIterator<Key,Value> skvi) throws IOException { TreeMap<Key,Value> data = new TreeMap<>(); while (skvi.hasTop()) { // Make sure to copy the K-V data.put(new Key(skvi.getTopKey()), new Value(skvi.getTopValue())); skvi.next(); } return data; }
@Override protected void advanceToIntersection() throws IOException { super.advanceToIntersection(); if (topKey == null) return; if (log.isTraceEnabled()) log.trace("using top key to seek for doc: {}", topKey); Key docKey = buildDocKey(); docSource.seek(new Range(docKey, true, null, false), docColfSet, true); log.debug("got doc key: {}", docSource.getTopKey()); if (docSource.hasTop() && docKey.equals(docSource.getTopKey(), PartialKey.ROW_COLFAM_COLQUAL)) { value = docSource.getTopValue(); } log.debug("got doc value: {}", value); }
@Override public Entry<Key,Value> next() { try { byte[] v = iter.getTopValue().get(); // copy just like tablet server does, do this before calling next KeyValue ret = new KeyValue(new Key(iter.getTopKey()), Arrays.copyOf(v, v.length)); iter.next(); while (iter != null && !iter.hasTop()) nextTablet(); return ret; } catch (Exception e) { throw new RuntimeException(e); } }
/** * Iterates over the source until an acceptable key/value pair is found. */ private void findTop() throws IOException { while (source.hasTop()) { Key top = source.getTopKey(); if (top.isDeleted() || (accept(top, source.getTopValue()))) { break; } source.next(); } }
/** * Iterates over the source until an acceptable key/value pair is found. */ private void findTop() throws IOException { while (source.hasTop()) { Key top = source.getTopKey(); if (top.isDeleted() || (accept(top, source.getTopValue()))) { break; } source.next(); } }
private void load() { if (hasTop()) { topKey.set(source.getTopKey()); topValue.set(source.getTopValue().get()); } } }
/** * Iterates over the source until an acceptable key/value pair is found. */ protected void findTop() { SortedKeyValueIterator<Key,Value> source = getSource(); while (source.hasTop() && !source.getTopKey().isDeleted() && (negate == accept(source.getTopKey(), source.getTopValue()))) { try { source.next(); } catch (IOException e) { throw new RuntimeException(e); } } }
@Override public Entry<Key,Value> next() { try { Entry<Key,Value> result = new KeyValue(new Key(inner.getTopKey()), new Value(inner.getTopValue()).get()); inner.next(); return result; } catch (IOException ex) { throw new NoSuchElementException(); } }