mirror of
https://github.com/twitter/the-algorithm.git
synced 2024-12-22 18:21:51 +01:00
Compare commits
2 Commits
a74717ed50
...
db98fc1e59
Author | SHA1 | Date | |
---|---|---|---|
|
db98fc1e59 | ||
|
2a31ca9cb1 |
@ -118,9 +118,8 @@ private[this] class RawAnnoyQueryIndex[D <: Distance[D]](
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Annoy java lib do not expose param for numOfNodesToExplore.
|
// The annoy-java lib does not expose the param for numOfNodesToExplore (the default value is numOfTrees*numOfNeighbours).
|
||||||
// Default number is numOfTrees*numOfNeigbours.
|
// As a workaround, we can artificially increase the numOfNeighbours to be requested and then cap it before returning.
|
||||||
// Simple hack is to artificially increase the numOfNeighbours to be requested and then just cap it before returning.
|
|
||||||
private[this] def neighboursToRequest(
|
private[this] def neighboursToRequest(
|
||||||
numOfNeighbours: Int,
|
numOfNeighbours: Int,
|
||||||
annoyParams: AnnoyRuntimeParams
|
annoyParams: AnnoyRuntimeParams
|
||||||
|
Loading…
Reference in New Issue
Block a user