[Java] Potentially inefficient variable-width vector reallocation

In several places in the Java codebase you can see this kind of pattern:
```java

while (vector.getDataBuffer().capacity() < toCapacity) {
vector.reallocDataBuffer();
}
```

In the event that a much larger capacity is requested, this will spuriously make several reallocations (doubling the capacity each time).

It would probably be more efficient to reallocate directly to satisfy the desired capacity.

Coincidentally, there's a `reallocDataBuffer` overload that seems to do just that.

**Reporter**: [Antoine Pitrou](https://issues.apache.org/jira/browse/ARROW-17919) / @pitrou

_{**Note**: *This issue was originally created as [ARROW-17919](https://issues.apache.org/jira/browse/ARROW-17919). Please see the [migration documentation](https://github.com/apache/arrow/issues/14542) for further details.*}

Beginne damit, die Java-Aufrufstellen zu finden, die in einer Schleife über vector.getDataBuffer().capacity() laufen und reallocDataBuffer() aufrufen. Untersuche anschließend die Überladung von reallocDataBuffer, die eine gewünschte Kapazität akzeptiert. Aktualisiere die betroffenen Pfade so, dass eine angeforderte größere Kapazität direkt erfüllt wird, und stelle sicher, dass die relevanten Java-Tests das Reallokationsverhalten abdecken.

Vom Indexierungsmodell aus dem Issue-Text verfasst.