adding more

This commit is contained in:
Joanie Gannon 2023-03-31 20:22:10 -04:00
parent 4ba718b412
commit 9ccb459970
3 changed files with 5 additions and 5 deletions

View File

@ -18,7 +18,7 @@ public class DistancedItemQueue<U, T> implements Iterable<DistancedItem<T>> {
private final PriorityQueue<DistancedItem<T>> queue; private final PriorityQueue<DistancedItem<T>> queue;
private final boolean minQueue; private final boolean minQueue;
/** /**
* Creates ontainer for items with their distances. * Creates container for items with their distances.
* *
* @param origin Origin (reference) point * @param origin Origin (reference) point
* @param initial Initial list of elements to add in the structure * @param initial Initial list of elements to add in the structure
@ -94,7 +94,7 @@ public class DistancedItemQueue<U, T> implements Iterable<DistancedItem<T>> {
} }
/** /**
* Dequeue all the elements from queueu with ordering mantained * Dequeue all the elements from queue with ordering maintained
* *
* @return remove all the elements in the order of the queue i.e min/max queue. * @return remove all the elements in the order of the queue i.e min/max queue.
*/ */

View File

@ -105,7 +105,7 @@ object SerializableBruteForceIndex {
} }
/** /**
* This is a class that wrapps a BruteForceIndex and provides a method for serialization. * This is a class that wraps a BruteForceIndex and provides a method for serialization.
* *
* @param bruteForceIndex all queries and updates are sent to this index. * @param bruteForceIndex all queries and updates are sent to this index.
* @param embeddingInjection injection that can convert embeddings to thrift embeddings. * @param embeddingInjection injection that can convert embeddings to thrift embeddings.

View File

@ -18,7 +18,7 @@ object TypedHnswIndex {
* construction, but better index quality. At some point, increasing * construction, but better index quality. At some point, increasing
* ef_construction does not improve the quality of the index. One way to * ef_construction does not improve the quality of the index. One way to
* check if the selection of ef_construction was ok is to measure a recall * check if the selection of ef_construction was ok is to measure a recall
* for M nearest neighbor search when ef = ef_constuction: if the recall is * for M nearest neighbour search when ef = ef_construction: if the recall is
* lower than 0.9, than there is room for improvement. * lower than 0.9, than there is room for improvement.
* @param maxM The number of bi-directional links created for every new element during construction. * @param maxM The number of bi-directional links created for every new element during construction.
* Reasonable range for M is 2-100. Higher M work better on datasets with high * Reasonable range for M is 2-100. Higher M work better on datasets with high
@ -64,7 +64,7 @@ object TypedHnswIndex {
* construction, but better index quality. At some point, increasing * construction, but better index quality. At some point, increasing
* ef_construction does not improve the quality of the index. One way to * ef_construction does not improve the quality of the index. One way to
* check if the selection of ef_construction was ok is to measure a recall * check if the selection of ef_construction was ok is to measure a recall
* for M nearest neighbor search when ef = ef_constuction: if the recall is * for M nearest neighbour search when ef = ef_constuction: if the recall is
* lower than 0.9, than there is room for improvement. * lower than 0.9, than there is room for improvement.
* @param maxM The number of bi-directional links created for every new element during construction. * @param maxM The number of bi-directional links created for every new element during construction.
* Reasonable range for M is 2-100. Higher M work better on datasets with high * Reasonable range for M is 2-100. Higher M work better on datasets with high