SortedRanges exposes O(n^2) Patterns

[cpwright]

As a user, I want SortedRanges to be faster at iterative get and find so that my queries are faster.

The .get() and .find() operations on sorted ranges often end up doing something like:

for (int ii = 0; ii < index.size(); ii++) {
long kk = index.get(ii);
assertEquals(ii, index.find(kk));
}

Because of user queries and columnar access. We should consider:

• Introducing a cardinality cache

• Or more simply introducing a single hint (to avoid memory usage) that would let you do those N operations in O(n) instead of O(n^2). Maybe as a thread local.