@Override public Key getTopKey() { if (topKey == null) return super.getTopKey(); return topKey; }
@Override public Key getTopKey() { Key wc = super.getTopKey(); log.debug("{} getTopKey() --> {}", prefix, wc); return wc; }
private void getTopKeyVal() { Key k = super.getTopKey(); Value v = super.getTopValue(); if (k instanceof MemKey || k == null) { currKey = (MemKey) k; currVal = v; return; } MemValue mv = MemValue.decode(v); currVal = mv.value; currKey = new MemKey(k, mv.kvCount); }
/** * Sets the topKey and topValue based on the top key of the source. If the column of the source * top key is in the set of combiners, topKey will be the top key of the source and topValue will * be the result of the reduce method. Otherwise, topKey and topValue will be unchanged. (They are * always set to null before this method is called.) */ private void findTop() throws IOException { // check if aggregation is needed if (super.hasTop()) { workKey.set(super.getTopKey()); if (combineAllColumns || combiners.contains(workKey)) { if (workKey.isDeleted()) { sawDelete(); return; } topKey = workKey; Iterator<Value> viter = new ValueIterator(getSource()); topValue = reduce(topKey, viter); while (viter.hasNext()) viter.next(); } } }
@Override public Key getTopKey() { if (null != errorKey) { returned = true; return errorKey; } else return super.getTopKey(); }
@Override public Key getTopKey() { if (null == topKey) { return super.getTopKey(); } return topKey; }
@Override public Key getTopKey() { return bypass ? super.getTopKey() : topKey; }
@Override public Key getTopKey() { if (topKey == null) return super.getTopKey(); return topKey; }
@Override public Key getTopKey() { return ((topKey == null) ? super.getTopKey() : topKey); }
@Override public Key getTopKey() { if (topKey == null) return super.getTopKey(); return topKey; }
@Override public Key getTopKey() { if (exceededTime) { if (null != lastKey) { Key returnKey = lastKey; lastKey = null; return returnKey; } else { return null; } } lastKey = super.getTopKey(); return lastKey; }
@Override public Key getTopKey() { Key wc = super.getTopKey(); log.debug(prefix + " getTopKey() --> " + wc); return wc; }
@Override public Key getTopKey() { Key wc = super.getTopKey(); log.info(prefix + " getTopKey() --> " + wc); return wc; }
@Override public Key getTopKey() { if (!isExceededTime()) { return super.getTopKey(); } else { return myKey; } }
private void getTopKeyVal() { Key k = super.getTopKey(); Value v = super.getTopValue(); if (k instanceof MemKey || k == null) { currKey = (MemKey) k; currVal = v; return; } MemValue mv = MemValue.decode(v); currVal = mv.value; currKey = new MemKey(k, mv.kvCount); }
private void getTopKeyVal() { Key k = super.getTopKey(); Value v = super.getTopValue(); if (k instanceof MemKey || k == null) { currKey = (MemKey) k; currVal = v; return; } currVal = new Value(v); int mc = MemValue.splitKVCount(currVal); currKey = new MemKey(k, mc); }
@Override public void next() throws IOException { SortedKeyValueIterator<Key,Value> source = getSource(); if (super.getTopKey().isDeleted()) skipRowColumn(source); else source.next(); findTop(source); }
/** * Sets the topKey and topValue based on the top key of the source. If the column of the source * top key is in the set of combiners, topKey will be the top key of the source and topValue will * be the result of the reduce method. Otherwise, topKey and topValue will be unchanged. (They are * always set to null before this method is called.) */ private void findTop() throws IOException { // check if aggregation is needed if (super.hasTop()) { workKey.set(super.getTopKey()); if (combineAllColumns || combiners.contains(workKey)) { if (workKey.isDeleted()) { sawDelete(); return; } topKey = workKey; Iterator<Value> viter = new ValueIterator(getSource()); topValue = reduce(topKey, viter); while (viter.hasNext()) viter.next(); } } }
/** * Sets the topKey and topValue based on the top key of the source. If the column of the source top key is in the set of combiners, topKey will be the top * key of the source and topValue will be the result of the reduce method. Otherwise, topKey and topValue will be unchanged. (They are always set to null * before this method is called.) */ private void findTop() { // check if aggregation is needed if (super.hasTop()) { workKey.set(super.getTopKey()); if (workKey.isDeleted()) { return; } // FIll workColumnFamily with current column family workKey.getColumnFamily(workColumnFamily); // Only combine STATS/LINKS edges if (startsWith(workColumnFamily, STATS_LINKS)) { topKey = workKey; topValue = combineStatsLinksEdgeValues(getSource()); } } }