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.
|Status||Open [ 1 ]||Resolved [ 5 ]|
|Fix Version/s||4.9 [ 12326730 ]|
|Fix Version/s||5.0 [ 12321663 ]|
|Resolution||Fixed [ 1 ]|