TranspositionTable { public synchronized SearchNode findIfPresent(long fancyHash) { final int start = ((int) fancyHash & IGNORE_SIGN_BIT) % table.length; int slot = start; do { final SearchNode n = table[slot]; if (n.isInUse()) { if (n.getFancyHash() == fancyHash) { return n; } } else { return null; } slot = (slot + 1) % table.length; } while (slot != start); return null; } TranspositionTable(int megabytes, SearchNodeBuilder builder,
			CoordinateSystem coords); int dagSize(SearchNode root); synchronized SearchNode findIfPresent(long fancyHash);  }
@Test public void testFindIfPresent() { assertNull(table.findIfPresent(1L)); table.findOrAllocate(0L); SearchNode n = table.findOrAllocate(1L); table.findOrAllocate(2L); assertEquals(n, table.findIfPresent(1L)); }