The following method is provided as a convenience for classes that
compute distances to a collection of indexed geometry, such as
S2ClosestEdgeQuery and S2ClosestPointQuery. It returns the maximum
number of indexed objects for which it is faster to compute the distance
by brute force (e.g., by testing every edge) rather than by using an
index. (The appropriate value is different for each index type and can
be estimated for a given (distance target, index type) pair by running
benchmarks.)
By default this method returns -1, indicating that it is not implemented.
The following method is provided as a convenience for classes that compute distances to a collection of indexed geometry, such as S2ClosestEdgeQuery and S2ClosestPointQuery. It returns the maximum number of indexed objects for which it is faster to compute the distance by brute force (e.g., by testing every edge) rather than by using an index. (The appropriate value is different for each index type and can be estimated for a given (distance target, index type) pair by running benchmarks.)
By default this method returns -1, indicating that it is not implemented.