Scan backwards and forwards among values with the same rank as element i to see if X exists. If X does not exist, return i. This is useful when scanning for 'x' when we see '-x' because they both get the same rank.
source not stored for this graph (policy: none)
no test coverage detected