code: private void printLocationIndexMatchQuery(final LocationIndexTree idx) {
          final double latDelta = bbox.maxLat - bbox.minLat;
          final double lonDelta = bbox.maxLon - bbox.minLon;
          final Random rand = new Random(seed);
          MiniPerfTest miniPerf = new MiniPerfTest() {
              @Override
              public int doCalc(boolean warmup, int run) {
                  double lat = rand.nextDouble() * latDelta + bbox.minLat;
                  double lon = rand.nextDouble() * lonDelta + bbox.minLon;
                  return idx.findNClosest(lat, lon, EdgeFilter.ALL_EDGES, rand.nextDouble() * 500).size();
              }
          }.setIterations(count).start();
          print("location_index_match", miniPerf);
      }
docs: Test the performance of finding candidate points for the index (which is run for every GPX
  entry).