## Details

## Description

Having upper/lower bounds on terms could be useful for various optimizations in the future, e.g. to accelerate sorting (if a segment can't compete, don't even search it), and so on.

Its pretty obvious how to get the smallest term, but the maximum term for a field is tricky, but worst case you can do it in ~ log(N) time by binary searching term space.

Commit 1613303 from Michael McCandless in branch 'dev/branches/branch_4x'

[ https://svn.apache.org/r1613303 ]

~~LUCENE-5610~~: optimization: just use already allocated/copied PendingTerm to for min/maxTerm