319320321322323324325326327328
} // validate the tree TreeRangeIterator ranges = mt.invalids(); for (TreeRange range : ranges) range.addHash(new RowHash(range.right, new byte[0], 0)); assert mt.hash(new Range<>(tok(-1), tok(-1))) != null : "Could not hash tree " + mt; }
488489490491492493494495
} public RowHash computeNext() { if (tokens.hasNext()) return new RowHash(tokens.next(), DUMMY, DUMMY.length); return endOfData(); }
334335336337338339340341342343
} // validate the tree TreeRangeIterator ranges = mt.invalids(); for (TreeRange range : ranges) range.addHash(new RowHash(range.right, new byte[0])); assert null != mt.hash(new Range(tok(-1), tok(-1))) : "Could not hash tree " + mt; }
509510511512513514515516
} public RowHash computeNext() { if (tokens.hasNext()) return new RowHash(tokens.next(), DUMMY); return endOfData(); }
320321322323324325326327328329
} // validate the tree TreeRangeIterator ranges = mt.invalids(); for (TreeRange range : ranges) range.addHash(new RowHash(range.right, new byte[0])); assert mt.hash(new Range<>(tok(-1), tok(-1))) != null : "Could not hash tree " + mt; }
489490491492493494495496