summaryrefslogtreecommitdiffstats
path: root/searchlib/src/tests/queryeval/simple_phrase
Commit message (Collapse)AuthorAgeFilesLines
* tag blueprints with strictnessHåvard Pettersen2024-03-201-6/+8
| | | | | | The strict-aware sort function is responsible for propagating and tagging strictness throughout the blueprint tree. Use pre-tagged strictness in fetchPostings, createSearch and createFilterSearch.
* make default flow stats more explicitHåvard Pettersen2024-02-061-0/+3
| | | | | | for both simple and complex leafs account for number of inner children in complex leafs account for seek nesting for complex leafs with children
* Sameelement behaves like an and with extra constraints.Henning Baldersheim2023-11-071-6/+6
| | | | So it should behave the sameway during fetchPostings too.
* Update copyrightJon Bratseth2023-10-092-2/+2
|
* explicit default filterHåvard Pettersen2022-10-311-0/+3
|
* Drop separate doom in phrase search. Rely on proper split/delay solving the ↵Henning Baldersheim2022-08-281-56/+3
| | | | doom issue at a higher level.
* Let the InvocationService drive the clock instead of having its own ticking ↵Henning Baldersheim2022-03-031-4/+5
| | | | | | | loop. Also use sleep_until to get intervals indendant of invoke cost as long as cost is within interval. This also also saves a clock sample and simplifies implementation.
* Update 2017 copyright notices.gjoranv2021-10-072-2/+2
|
* use vector of UP as MultiSearch::ChildrenArne Juul2020-06-041-3/+5
| | | | | | * add helper class for constructing MultiSearch::Children (mostly for unit tests) * rewrite as needed to adapt
* Unpack interleaved features if they are neededTor Egge2020-05-021-10/+33
| | | | in simple phrase search.
* Revert "Revert "Balder/add executeinfo""Henning Baldersheim2020-01-031-2/+3
|
* Revert "Balder/add executeinfo"Arnstein Ressem2020-01-031-3/+2
|
* Add ExecutionInfo to propagate more information than just strictness to ↵Henning Baldersheim2019-12-311-2/+3
| | | | | | | fetchPostings. The estimated hitrate that each iterator will will enable smarter query evaluation. Especially will it be possible to figure out if static up front cost can be avoided.
* Revert "Revert "Balder/remove steadytimestamp 2""Henning Baldersheim2019-12-161-3/+3
|
* Revert "Balder/remove steadytimestamp 2"Henning Baldersheim2019-12-161-3/+3
|
* Use std::chrono.Henning Baldersheim2019-12-091-3/+3
|
* Add typesafe SteadyTimeStamp.Henning Baldersheim2019-11-151-3/+3
|
* add expensive flags to phrase/same elementHåvard Pettersen2019-09-121-3/+3
| | | | they will affect the iterator cost tier
* Minor intellij adviseHenning Baldersheim2019-08-151-8/+4
|
* - nested namespacesHenning Baldersheim2019-08-151-6/+3
| | | | | - c++ for loops - no sematics
* Remove files used by old unit test runner.Tor Egge2019-02-192-2/+0
|
* Update copyright headersJon Bratseth2017-06-142-2/+2
|
* Revert "Update copyright headers"Jon Bratseth2017-06-142-2/+2
|
* Update copyright headersJon Bratseth2017-06-142-2/+2
|
* Revert "Copyright header"Jon Bratseth2017-06-132-2/+2
|
* Copyright headerJon Bratseth2017-06-132-2/+2
|
* Checkpount for removing fastos from testsHenning Baldersheim2017-06-011-1/+0
|
* add override in searchlib moduleArne H Juul2017-04-121-2/+2
|
* Deinline destructorsi and use -Winline gcc option.Henning Baldersheim2017-03-091-11/+15
|
* remove features from match dataHaavard2016-12-141-1/+1
|
* Declared test executables as tests with TEST parameterVegard Sjonfjell2016-06-161-1/+1
|
* PublishJon Bratseth2016-06-156-0/+358