You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@lucene.apache.org by "Mayya Sharipova (Jira)" <ji...@apache.org> on 2021/07/23 15:01:00 UTC

[jira] [Created] (LUCENE-10034) Vectors NeighborQueue MIN/MAX heap reversed?

Mayya Sharipova created LUCENE-10034:
----------------------------------------

             Summary: Vectors NeighborQueue MIN/MAX heap reversed?
                 Key: LUCENE-10034
                 URL: https://issues.apache.org/jira/browse/LUCENE-10034
             Project: Lucene - Core
          Issue Type: Bug
            Reporter: Mayya Sharipova


NeighborQueue is defined as following:
{code:java}
NeighborQueue(int initialSize, boolean reversed) {
  if (reversed) {
    heap = LongHeap.create(LongHeap.Order.MAX, initialSize);
  } else {
    heap = LongHeap.create(LongHeap.Order.MIN, initialSize);
  }
}
{code}
should it be reversed? should it be instead using MIN heap for reversed functions such as EUCLIDEAN  distance, as we are interested in neigbors with min distances? 

 

 

 



--
This message was sent by Atlassian Jira
(v8.3.4#803005)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org