/**
   * Iterates over the set bits in the given BitSet from the given start to end range, calculating the distance of the
   * documents and determining which are within the distance radius of the central point.
   *
   * @param dataSet LocationDataSet containing the document locations that can be used to calculate the distance each
   * document is from the central point
   * @param originalBitSet BitSet which has bits set identifying which documents should be checked to see if their
   * distance falls within the radius
   * @param start Index in the BitSet that the method will start at
   * @param end Index in the BitSet that the method will stop at
   * @param size Size the the resulting BitSet should be created at (most likely end - start)
   * @param reader IndexReader for checking if the document has been deleted
   * @return IterationResult containing all the results of the method.
   */
  protected IterationResult iterate(LocationDataSet dataSet, BitSet originalBitSet, int start, int end, int size, IndexReader reader) {
    BitSet bitSet = new BitSet(size);
if(true){
   try {
      throw new Exception();
   } catch (Exception e) {
      // TODO Auto-generated catch block
      e.printStackTrace();
   }
}
    Map<Integer, Double> distanceById = new HashMap<Integer, Double>();

    int docId = originalBitSet.nextSetBit(start);
 
    while (docId != -1 && docId < end) {
         System.out.println("iterationresult docid  = " + docId);
      if (reader.isDeleted(docId)) {
        docId = originalBitSet.nextSetBit(docId + 1);
        continue;
      }

      Point point = dataSet.getPoint(docId);
      double distance = distanceCalculator.calculate(lat, lng, point.getX(), point.getY(), unit);
      if (distance < radius) {
        bitSet.set(docId);
        System.out.println("docId + nextOffset" + (docId + nextOffset));
        distanceById.put(docId + nextOffset, distance);
      }

      docId = originalBitSet.nextSetBit(docId + 1);
    }
    return new IterationResult(bitSet, distanceById);
  }