optimize random seek

[satyaog]

In particular, there are some useless navigation when iterating a directory as the iterator currently goes over all nodes of all bsets until a node with its parent inode is higher than the directory's inode. This should be optimized in the C code to skip bsets where the min key and max key are respectively higher or lower than the target