Kishore Nallan 396e10be5d Refactor collection's search method to be more judicious in using higher costs. ...

Earlier, even if one token produced no result, ALL tokens were searched with a higher cost. This change ensures that we first retry only the token that did not produce results with a larger cost before doing the same for other tokens.

2016-11-24 21:39:20 +05:30

..

art.h

Fuzzy search tests.

2016-11-07 19:36:28 +05:30

collection.h

Refactor collection's search method to be more judicious in using higher costs.

2016-11-24 21:39:20 +05:30

exectime.h

Util for logging exec time.

2016-10-02 19:11:59 +05:30

forarray.h

Tests for collection.

2016-11-13 21:59:32 +05:30

intersection.h

Intersection of documents across the search tokens.

2016-02-29 19:47:05 +05:30

json.hpp

Add JSON dep.

2016-08-23 20:31:11 +05:30

match_score.h

Refactor collection's search method to be more judicious in using higher costs.

2016-11-24 21:39:20 +05:30

sparsepp.h

Replace unordered_map with sparsepp hashmap. Much faster!

2016-09-27 22:03:41 +05:30

store.h

Adopt sequence ID as generated document ID, instead of using UUID.

2016-10-08 21:17:33 +05:30

string_utils.h

Remove entry from rocksdb and art when required.

2016-10-05 21:24:40 +05:30

topster.h

Tests for collection.

2016-11-13 21:59:32 +05:30