maybe we can use a BytesRefHash here instead? we can then easily use `BytesRefHash#find(BytesRef, int)` that accepts a hash code that we can get from the field data. The other option as if the number of terms is really large we might want to make use of the fact that our fielddatat is actually sorted that means we can do efficient intersection if field data si multivalued and use binary search to early terminate?