Binary search implementation for tree blocks. @param n node to search @param l left (lower-part) array index @param r right (upper-part) array index @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, int l, int r, long key, Rank rank)
source not stored for this graph (policy: none)
no test coverage detected