@Override protected byte[] getValueBytesFromIdWithoutCache(int id) throws IllegalArgumentException { int index = (trees.size() == 1) ? 0 : findIndexById(id); int treeInnerOffset = getTreeInnerOffset(id, index); TrieDictionary<T> tree = trees.get(index); byte[] result = tree.getValueBytesFromIdWithoutCache(treeInnerOffset); return result; }
private void addTree(TrieDictionary<T> tree) { trees.add(tree); int minId = tree.getMinId(); accuOffset.add(curOffset); byte[] valueBytes = tree.getValueBytesFromIdWithoutCache(minId); valueDivide.add(new ByteArray(valueBytes, 0, valueBytes.length)); curOffset += (tree.getMaxId() + 1); checkDictSize(); }
for (int i = 0; i < times; i++) { for (int j = 0; j < n; j++) { keep |= dict.getValueBytesFromIdWithoutCache(j).length;
System.out.println(Bytes.toString(dict.getValueBytesFromIdWithoutCache(i)));
@Override protected byte[] getValueBytesFromIdWithoutCache(int id) throws IllegalArgumentException { int index = (trees.size() == 1) ? 0 : findIndexById(id); int treeInnerOffset = getTreeInnerOffset(id, index); TrieDictionary<T> tree = trees.get(index); byte[] result = tree.getValueBytesFromIdWithoutCache(treeInnerOffset); return result; }
private void addTree(TrieDictionary<T> tree) { trees.add(tree); int minId = tree.getMinId(); accuOffset.add(curOffset); byte[] valueBytes = tree.getValueBytesFromIdWithoutCache(minId); valueDivide.add(new ByteArray(valueBytes, 0, valueBytes.length)); curOffset += (tree.getMaxId() + 1); checkDictSize(); }
System.out.println(Bytes.toString(dict.getValueBytesFromIdWithoutCache(i)));