Class NearestNeighbor.NearestVisitor

    • Field Detail

      • curDocBase

        public int curDocBase
      • curLiveDocs

        public Bits curLiveDocs
      • topN

        final int topN
      • pointLat

        final double pointLat
      • pointLon

        final double pointLon
      • setBottomCounter

        private int setBottomCounter
      • minLon

        private double minLon
      • maxLon

        private double maxLon
      • minLat

        private double minLat
      • maxLat

        private double maxLat
      • minLon2

        private double minLon2
    • Constructor Detail

      • NearestVisitor

        public NearestVisitor​(java.util.PriorityQueue<NearestNeighbor.NearestHit> hitQueue,
                              int topN,
                              double pointLat,
                              double pointLon)
    • Method Detail

      • maybeUpdateBBox

        private void maybeUpdateBBox()
      • visit

        public void visit​(int docID,
                          byte[] packedValue)
        Description copied from interface: PointValues.IntersectVisitor
        Called for all documents in a leaf cell that crosses the query. The consumer should scrutinize the packedValue to decide whether to accept it. In the 1D case, values are visited in increasing order, and in the case of ties, in increasing docID order.
        Specified by:
        visit in interface PointValues.IntersectVisitor