Binary search implementation for tree blocks; if not found returns the lower/upper bound position instead based on `rank`. @param n node to search @param key key to search @param rank rank of the search (for lower/upper bound) @return the index of the bound or found key.
(TreeNode n, long key, Rank rank)
source not stored for this graph (policy: none)
no test coverage detected