TranspositionTable { void addChild(SearchNode parent, SearchNode child) { final ListNode<SearchNode> node = listNodes.allocate(); node.setKey(child); node.setNext(parent.getChildren()); parent.setChildren(node); } TranspositionTable(int megabytes, SearchNodeBuilder builder,
			CoordinateSystem coords); int dagSize(SearchNode root); synchronized SearchNode findIfPresent(long fancyHash);  }
@Test public void testAddChild() { SearchNode parent = table.findOrAllocate(0L); SearchNode child1 = table.findOrAllocate(1L); SearchNode child2 = table.findOrAllocate(2L); table.addChild(parent, child1); table.addChild(parent, child2); ListNode<SearchNode> n = parent.getChildren(); assertEquals(child2, n.getKey()); assertEquals(child1, n.getNext().getKey()); }