Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2024-12-22 10:11:52 +01:00
Code Issues Packages Projects Releases Wiki Activity

Compare commits

base: Mirrors:a74717ed5001948a63e7fa748ad1727a6139a8b1
Branches Tags
Mirrors:main
...
compare: Mirrors:db98fc1e59a05bab1188d2b3291657c1802e2721
Branches Tags
Mirrors:main

2 Commits
a74717ed50 ... db98fc1e59

Author SHA1 Message Date
Carterla8
db98fc1e59
Merge 2a31ca9cb1 into fb54d8b549 2023-05-22 17:39:52 -05:00
Carterla8
2a31ca9cb1
Update RawAnnoyQueryIndex.scala 
Simple suggestion to improve comment.
 2023-04-01 08:05:00 +01:00
1 changed files with 2 additions and 3 deletions
Show Stats Expand all files Collapse all files

5
ann/src/main/scala/com/twitter/ann/annoy/RawAnnoyQueryIndex.scala
View File

@ -118,9 +118,8 @@ private[this] class RawAnnoyQueryIndex[D <: Distance[D]](
}
}
// Annoy java lib do not expose param for numOfNodesToExplore.
// Default number is numOfTrees*numOfNeigbours.
// Simple hack is to artificially increase the numOfNeighbours to be requested and then just cap it before returning.
// The annoy-java lib does not expose the param for numOfNodesToExplore (the default value is numOfTrees*numOfNeighbours).
// As a workaround, we can artificially increase the numOfNeighbours to be requested and then cap it before returning.
private[this] def neighboursToRequest(
numOfNeighbours: Int,
annoyParams: AnnoyRuntimeParams