void recurse() throws IOException { for (Entry2 e : entries) { if (depth > 1) { InternalNode node = new InternalNode(e.childAddress, (short) e.nrecords, recordSize, depth - 1); node.recurse(); } else { long nrecs = e.nrecords; LeafNode leaf = new LeafNode(e.childAddress, (short) nrecs); leaf.addEntries(entryList); } if (e.record != null) // last one is null entryList.add(e); } } }
InternalNode node = new InternalNode(rootNodeAddress, numRecordsRootNode, recordSize, treeDepth); node.recurse(); } else { LeafNode leaf = new LeafNode(rootNodeAddress, numRecordsRootNode);
InternalNode node = new InternalNode(rootNodeAddress, numRecordsRootNode, recordSize, treeDepth); node.recurse(); } else { LeafNode leaf = new LeafNode(rootNodeAddress, numRecordsRootNode);
InternalNode node = new InternalNode(rootNodeAddress, numRecordsRootNode, recordSize, treeDepth); node.recurse(); } else { LeafNode leaf = new LeafNode(rootNodeAddress, numRecordsRootNode);
void recurse() throws IOException { for (Entry2 e : entries) { if (depth > 1) { InternalNode node = new InternalNode(e.childAddress, (short) e.nrecords, recordSize, depth - 1); node.recurse(); } else { long nrecs = e.nrecords; LeafNode leaf = new LeafNode(e.childAddress, (short) nrecs); leaf.addEntries(entryList); } if (e.record != null) // last one is null entryList.add(e); } } }
void recurse() throws IOException { for (Entry2 e : entries) { if (depth > 1) { InternalNode node = new InternalNode(e.childAddress, (short) e.nrecords, recordSize, depth - 1); node.recurse(); } else { long nrecs = e.nrecords; LeafNode leaf = new LeafNode(e.childAddress, (short) nrecs); leaf.addEntries(entryList); } if (e.record != null) // last one is null entryList.add(e); } } }