String print() { StringBuilder sb = new StringBuilder(); print(root, sb, 0, 0); return sb.toString(); }
void print(InMemEntry e, StringBuilder sb, long key, int depth) { if (e.isLeaf()) { InMemLeafEntry leaf = (InMemLeafEntry) e; int bits = keyAlgo.getBits(); // print reverse keys sb.append(BitUtil.BIG.toBitString(BitUtil.BIG.reverse(key, bits), bits)).append(" "); IntArrayList entries = leaf.getResults(); for (int i = 0; i < entries.size(); i++) { sb.append(leaf.get(i)).append(','); } sb.append('\n'); } else { InMemTreeEntry tree = (InMemTreeEntry) e; key = key << shifts[depth]; for (int counter = 0; counter < tree.subEntries.length; counter++) { InMemEntry sube = tree.subEntries[counter]; if (sube != null) { print(sube, sb, key | counter, depth + 1); } } } }
String print() { StringBuilder sb = new StringBuilder(); print(root, sb, 0, 0); return sb.toString(); }
void print( InMemEntry e, StringBuilder sb, long key, int depth ) { if (e.isLeaf()) { InMemLeafEntry leaf = (InMemLeafEntry) e; int bits = keyAlgo.getBits(); // print reverse keys sb.append(BitUtil.BIG.toBitString(BitUtil.BIG.reverse(key, bits), bits)).append(" "); TIntArrayList entries = leaf.getResults(); for (int i = 0; i < entries.size(); i++) { sb.append(leaf.get(i)).append(','); } sb.append('\n'); } else { InMemTreeEntry tree = (InMemTreeEntry) e; key = key << shifts[depth]; for (int counter = 0; counter < tree.subEntries.length; counter++) { InMemEntry sube = tree.subEntries[counter]; if (sube != null) { print(sube, sb, key | counter, depth + 1); } } } }
void print(InMemEntry e, StringBuilder sb, long key, int depth) { if (e.isLeaf()) { InMemLeafEntry leaf = (InMemLeafEntry) e; int bits = keyAlgo.getBits(); // print reverse keys sb.append(BitUtil.BIG.toBitString(BitUtil.BIG.reverse(key, bits), bits)).append(" "); IntArrayList entries = leaf.getResults(); for (int i = 0; i < entries.size(); i++) { sb.append(leaf.get(i)).append(','); } sb.append('\n'); } else { InMemTreeEntry tree = (InMemTreeEntry) e; key = key << shifts[depth]; for (int counter = 0; counter < tree.subEntries.length; counter++) { InMemEntry sube = tree.subEntries[counter]; if (sube != null) { print(sube, sb, key | counter, depth + 1); } } } }
void print(InMemEntry e, StringBuilder sb, long key, int depth) { if (e.isLeaf()) { InMemLeafEntry leaf = (InMemLeafEntry) e; int bits = keyAlgo.getBits(); // print reverse keys sb.append(BitUtil.BIG.toBitString(BitUtil.BIG.reverse(key, bits), bits)).append(" "); IntArrayList entries = leaf.getResults(); for (int i = 0; i < entries.size(); i++) { sb.append(leaf.get(i)).append(','); } sb.append('\n'); } else { InMemTreeEntry tree = (InMemTreeEntry) e; key = key << shifts[depth]; for (int counter = 0; counter < tree.subEntries.length; counter++) { InMemEntry sube = tree.subEntries[counter]; if (sube != null) { print(sube, sb, key | counter, depth + 1); } } } }
String print() { StringBuilder sb = new StringBuilder(); print(root, sb, 0, 0); return sb.toString(); }
String print() { StringBuilder sb = new StringBuilder(); print(root, sb, 0, 0); return sb.toString(); }