Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Merge pull request #13560 from vespa-engine/arnej/follow-std-rules | Arne H Juul | 2020-06-12 | 2 | -11/+27 |
|\ | | | | | revert back to getting random number in the [0,1) range | ||||
| * | revert back to getting random number in the [0,1) range | Arne Juul | 2020-06-12 | 2 | -11/+27 |
| | | | | | | | | | | | | | | | | | | * for whatever reason, std::uniform_real_distribution doesn't allow a>b when specifying the [a,b) half-open range. So we need to get a number from [0,1) and then do (1.0-unif) to convert to the (0,1] range that we want. * extend the unit test with more initial numbers, and write it in a more compact way. | ||||
* | | unit test two-phase add | Arne Juul | 2020-06-11 | 1 | -0/+56 |
| | | |||||
* | | rename internal prepare result | Arne Juul | 2020-06-11 | 2 | -13/+13 |
| | | |||||
* | | remove stub implementations in NearestNeighborIndex | Arne Juul | 2020-06-11 | 2 | -14/+11 |
| | | | | | | | | | | * make API pure virtual * implement something that will work in mock | ||||
* | | wire in new prepare/complete API | Arne Juul | 2020-06-11 | 2 | -2/+32 |
| | | |||||
* | | split HnswIndex::add_document | Arne Juul | 2020-06-11 | 2 | -15/+57 |
|/ | | | | | | * search part now done in a read-only prepare phase * check if selected neighbors are still valid when completing add_document request, to prepare for multi-threaded indexing | ||||
* | tighten guard holding | Arne Juul | 2020-06-10 | 1 | -5/+9 |
| | | | | | | also: * constify where possible * use uniform_real_distribution to invert range for us | ||||
* | protect RNG with mutex | Arne Juul | 2020-06-10 | 1 | -0/+4 |
| | |||||
* | Merge pull request #13526 from ↵ | Geir Storli | 2020-06-10 | 4 | -1/+85 |
|\ | | | | | | | | | vespa-engine/geirst/tensor-two-phase-operation-api Add APIs to support setting a tensor and update nearest neighbor inde… | ||||
| * | Add APIs to support setting a tensor and update nearest neighbor index as ↵ | Geir Storli | 2020-06-10 | 4 | -1/+85 |
| | | | | | | | | | | | | two-phase operations. This will enable using multiple threads to update the nearest neighbor index. | ||||
* | | Merge pull request #13500 from ↵ | Henning Baldersheim | 2020-06-10 | 5 | -61/+75 |
|\ \ | | | | | | | | | | | | | vespa-engine/revert-13499-revert-13490-balder/fetch-and-merge-a-cacheline Revert "Revert "When we pull in a cacheline, we should use it too."" | ||||
| * | | - Compute batch size in one place. | Henning Baldersheim | 2020-06-09 | 1 | -11/+12 |
| | | | | | | | | | | | | - Compute offset in one place. | ||||
| * | | Revert "Revert "When we pull in a cacheline, we should use it too."" | Henning Baldersheim | 2020-06-08 | 5 | -60/+73 |
| | | | |||||
* | | | Merge pull request #13518 from ↵ | Geir Storli | 2020-06-09 | 8 | -66/+62 |
|\ \ \ | | | | | | | | | | | | | | | | | vespa-engine/toregge/handle-fetchpostings-being-called-multiple-times Handle fetchPostings being called multiple times. | ||||
| * | | | Handle fetchPostings being called multiple times. | Tor Egge | 2020-06-09 | 8 | -66/+62 |
| | |/ | |/| | |||||
* | | | construct HnswGraph::EntryNode directly | Arne Juul | 2020-06-09 | 5 | -29/+15 |
| | | | |||||
* | | | store entry docid/level in an atomic value | Arne Juul | 2020-06-09 | 7 | -38/+81 |
|/ / | |||||
* | | keep createFilterSearch public in subclasses | Arne Juul | 2020-06-09 | 1 | -5/+3 |
| | | |||||
* | | Merge pull request #13501 from ↵ | Arne H Juul | 2020-06-09 | 3 | -14/+14 |
|\ \ | | | | | | | | | | | | | vespa-engine/arnej/global-filter-after-fetch-postings Arnej/global filter after fetch postings | ||||
| * | | no fallback to brute force for now | Arne Juul | 2020-06-08 | 2 | -5/+3 |
| | | | |||||
| * | | do estimates like before, broke unit test | Arne Juul | 2020-06-08 | 1 | -3/+4 |
| | | | |||||
| * | | perform TopK in set_global_filter | Arne Juul | 2020-06-07 | 2 | -11/+12 |
| | | | | | | | | | | | | | | | * global filter must be computed after fetchPostings, so move actual TopK computation. | ||||
* | | | implement createFilterSearch in MemoryTermBlueprint | Arne Juul | 2020-06-08 | 1 | -0/+8 |
| | | | |||||
* | | | Merge pull request #13505 from ↵ | Geir Storli | 2020-06-08 | 1 | -1/+0 |
|\ \ \ | | | | | | | | | | | | | | | | | vespa-engine/toregge/remove-unused-variable-in-attribute-blueprint-test Remove unused variable in attribute blueprint test. | ||||
| * | | | Remove unused variable in attribute blueprint test. | Tor Egge | 2020-06-08 | 1 | -1/+0 |
| | | | | |||||
* | | | | Merge pull request #13504 from vespa-engine/arnej/empty-is-empty | Geir Storli | 2020-06-08 | 2 | -3/+8 |
|\ \ \ \ | |/ / / |/| | | | empty blueprint must create empty filter iterator | ||||
| * | | | empty blueprint must create empty filter iterator | Arne Juul | 2020-06-08 | 2 | -3/+8 |
| | |/ | |/| | |||||
| * | | Revert "When we pull in a cacheline, we should use it too." | Harald Musum | 2020-06-08 | 5 | -73/+60 |
| | | | |||||
| * | | Merge branch 'master' into balder/fetch-and-merge-a-cacheline | Henning Baldersheim | 2020-06-07 | 61 | -605/+696 |
| |\| | |||||
| * | | - Stick to void * and byte offsets. | Henning Baldersheim | 2020-06-07 | 5 | -18/+18 |
| | | | | | | | | | | | | - Correct spelling error. | ||||
| * | | - Test both normal and inverted bit vectors. | Henning Baldersheim | 2020-06-07 | 1 | -3/+4 |
| | | | | | | | | | | | | | | | - Use 64 byte alignment of buffer. - Improve error messages. | ||||
| * | | Use c++11 for loop. | Henning Baldersheim | 2020-06-05 | 1 | -2/+2 |
| | | | |||||
| * | | When we pull in a cacheline, we should use it too. | Henning Baldersheim | 2020-06-04 | 2 | -45/+57 |
| | | | | | | | | | | | | There is possibly wasting 7/8 of it and very likely suffer a cache miss. | ||||
* | | | more TODOs and cleanup | Arne Juul | 2020-06-05 | 4 | -10/+13 |
| |/ |/| | |||||
* | | Merge pull request #13488 from vespa-engine/arnej/use-vector-of-UP-1 | Arne H Juul | 2020-06-05 | 61 | -603/+694 |
|\ \ | |/ |/| | use vector of UP as MultiSearch::Children | ||||
| * | adjust to use std::make_unique | Arne Juul | 2020-06-05 | 1 | -2/+10 |
| | | |||||
| * | add TODOs about further use of unique_ptr | Arne Juul | 2020-06-05 | 8 | -0/+9 |
| | | |||||
| * | use vector of UP as MultiSearch::Children | Arne Juul | 2020-06-04 | 57 | -603/+677 |
| | | | | | | | | | | | | * add helper class for constructing MultiSearch::Children (mostly for unit tests) * rewrite as needed to adapt | ||||
* | | Fix typo in class comment. | Tor Egge | 2020-06-03 | 1 | -1/+1 |
| | | |||||
* | | Add NativeFieldMatchExecutorSharedState. | Tor Egge | 2020-06-03 | 3 | -43/+97 |
|/ | |||||
* | Ensure sequential consistency. | Henning Baldersheim | 2020-06-03 | 1 | -0/+1 |
| | |||||
* | Protect against inconsistency when sampling size and capacity. | Henning Baldersheim | 2020-06-03 | 1 | -0/+6 |
| | |||||
* | As the source bit vector might change in a different thread, | Henning Baldersheim | 2020-06-02 | 2 | -8/+23 |
| | | | | ensure that we sample size once to avoid incosistent read outs during copy. | ||||
* | Add NativeProximityExecutorSharedState. | Tor Egge | 2020-06-02 | 3 | -75/+133 |
| | |||||
* | Merge pull request #13421 from vespa-engine/arnej/more-intermediate-filters | Arne H Juul | 2020-06-02 | 6 | -14/+102 |
|\ | | | | | Arnej/more intermediate filters | ||||
| * | more general helper function, use it from AND also | Arne Juul | 2020-05-29 | 1 | -49/+33 |
| | | |||||
| * | use helper method instead of inheritance | Arne Juul | 2020-05-29 | 2 | -17/+33 |
| | | |||||
| * | make more intermediate operators implement createFilterSearch | Arne Juul | 2020-05-28 | 4 | -4/+80 |
| | | | | | | | | | | | | | | | | * Rank just returns filter from first child * Near degrades to AND in the UPPER_BOUND case * ONear degrades to AND in the UPPER_BOUND case * SourceBlender degrades to OR in the UPPER_BOUND case * Phrase degrades to AND in the UPPER_BOUND case | ||||
| * | equiv filter is equivalent to OR | Arne Juul | 2020-05-28 | 2 | -0/+12 |
| | |