Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences
C++ algoliadatastoreelasticsearchenterprise-searchfacetingfull-text-searchfuzzy-searchgeosearchin-memoryinstantsearchmerchandisingpineconesearchsearch-enginesemantic-searchsimilarity-searchsite-searchsynonymstypo-tolerancevector-search
Allow pagination of results.
Kishore Nallan8295707ed41d
diff --git a/TODO.md b/TODO.mdindex e466bb08..c01ad5b1 100644--- a/TODO.md+++ b/TODO.md@@ -38,8 +38,8 @@- ~~Multiple facets not working~~- ~~Search snippet with highlight~~- ~~Snippet should only be around surrounding matching tokens~~-- Proper pagination-- Pagination parameter+- ~~Proper pagination~~+- ~~Pagination parameter~~- When prefix=true, use token_ranking_field for token ordering only for last word- Query token ids should match query token ordering- ID should not have "/"@@ -53,6 +53,7 @@- Test for collection creation validation- Test for delete document- Test for snippets+- Test for pagination- Prevent string copy during indexing- clean special chars before indexing- Minimum results should be a variable instead of blindly going with max_results@@ -77,12 +78,13 @@**API**- Support the following operations:- - create a new index- - ~~index a single document~~+ - ~~create a new index~~+ - ~~index a single document~~+ - ~~delete a document by ID~~+ - ~~query an index~~+ - delete an index- bulk insert multiple documents- fetch a document by ID- - delete a document by ID- - query an index**Clustering**diff --git a/include/collection.h b/include/collection.hindex ac9ac27e..bcfe160f 100644--- a/include/collection.h+++ b/include/collection.h@@ -139,7 +139,8 @@ public:nlohmann::json search(std::string query, const std::vector<std::string> search_fields,const std::string & simple_filter_query, const std::vector<std::string> & facet_fields,const std::vector<sort_field> & sort_fields, const int num_typos,- const size_t num_results, const token_ordering token_order = FREQUENCY, const bool prefix = false);+ const size_t per_page = 10, const size_t page = 1,+ const token_ordering token_order = FREQUENCY, const bool prefix = false);Option<std::string> remove(const std::string & id);@@ -149,8 +150,9 @@ public:Option<uint32_t> index_in_memory(const nlohmann::json & document, uint32_t seq_id);- enum {MAX_SEARCH_TOKENS = 10};- enum {MAX_RESULTS = 100};+ //enum {MAX_SEARCH_TOKENS = 10};+ static const int MAX_SEARCH_TOKENS = 10;+ static const int MAX_RESULTS = 100;// strings under this length will be fully highlighted, instead of showing a snippet of relevant portionenum {SNIPPET_STR_ABOVE_LEN = 30};diff --git a/src/api.cpp b/src/api.cppindex b7b8b80d..e17eafaf 100644--- a/src/api.cpp+++ b/src/api.cpp@@ -124,6 +124,8 @@ void get_search(http_req & req, http_res & res) {const char *SEARCH_BY = "search_by";const char *SORT_BY = "sort_by";const char *FACET_BY = "facet_by";+ const char *PER_PAGE = "per_page";+ const char *PAGE = "page";if(req.params.count(NUM_TYPOS) == 0) {req.params[NUM_TYPOS] = "2";@@ -137,6 +139,14 @@ void get_search(http_req & req, http_res & res) {return res.send_400(std::string("Parameter `") + SEARCH_BY + "` is required.");}+ if(req.params.count(PER_PAGE) == 0) {+ req.params[PER_PAGE] = "10";+ }++ if(req.params.count(PAGE) == 0) {+ req.params[PAGE] = "1";+ }+std::string filter_str = req.params.count(FILTER) != 0 ? req.params[FILTER] : "";std::vector<std::string> search_fields;@@ -182,7 +192,8 @@ void get_search(http_req & req, http_res & res) {}nlohmann::json result = collection->search(req.params["q"], search_fields, filter_str, facet_fields,- sort_fields, std::stoi(req.params[NUM_TYPOS]), 100,+ sort_fields, std::stoi(req.params[NUM_TYPOS]),+ std::stoi(req.params[PER_PAGE]), std::stoi(req.params[PAGE]),token_order, prefix);uint64_t timeMillis = std::chrono::duration_cast<std::chrono::milliseconds>(diff --git a/src/collection.cpp b/src/collection.cppindex 4a28e867..b5ea0f94 100644--- a/src/collection.cpp+++ b/src/collection.cpp@@ -560,7 +560,8 @@ Option<uint32_t> Collection::do_filtering(uint32_t** filter_ids_out, const std::nlohmann::json Collection::search(std::string query, const std::vector<std::string> search_fields,const std::string & simple_filter_query, const std::vector<std::string> & facet_fields,const std::vector<sort_field> & sort_fields, const int num_typos,- const size_t num_results, const token_ordering token_order, const bool prefix) {+ const size_t per_page, const size_t page,+ const token_ordering token_order, const bool prefix) {nlohmann::json result = nlohmann::json::object();std::vector<facet> facets;@@ -600,16 +601,23 @@ nlohmann::json Collection::search(std::string query, const std::vector<std::stri}}- // process the filters first+ // process the filtersuint32_t* filter_ids = nullptr;Option<uint32_t> op_filter_ids_length = do_filtering(&filter_ids, simple_filter_query);if(!op_filter_ids_length.ok()) {result["error"] = op_filter_ids_length.error();return result;}-const uint32_t filter_ids_length = op_filter_ids_length.get();+ // check for valid pagination+ if((page * per_page) > MAX_RESULTS) {+ result["error"] = "Cannot paginate past " + std::to_string(MAX_RESULTS) + " results.";+ return result;+ }++ const size_t num_results = (page * per_page);+// Order of `fields` are used to sort resultsauto begin = std::chrono::high_resolution_clock::now();std::vector<std::pair<int, Topster<100>::KV>> field_order_kvs;@@ -646,7 +654,18 @@ nlohmann::json Collection::search(std::string query, const std::vector<std::striresult["hits"] = nlohmann::json::array();- for(auto & field_order_kv: field_order_kvs) {+ const int start_result_index = (page - 1) * per_page;+ const int kvsize = field_order_kvs.size();++ if(start_result_index > (kvsize - 1)) {+ result["error"] = "Not found.";+ return result;+ }++ const int end_result_index = std::min(int(page * per_page), kvsize) - 1;++ for(size_t field_order_kv_index = start_result_index; field_order_kv_index <= end_result_index; field_order_kv_index++) {+ const auto & field_order_kv = field_order_kvs[field_order_kv_index];std::string value;const std::string &seq_id_key = get_seq_id_key((uint32_t) field_order_kv.second.key);store->get(seq_id_key, value);diff --git a/test/collection_manager_test.cpp b/test/collection_manager_test.cppindex 79510942..c4db3240 100644--- a/test/collection_manager_test.cpp+++ b/test/collection_manager_test.cpp@@ -56,7 +56,7 @@ TEST_F(CollectionManagerTest, RestoreRecordsOnRestart) {std::vector<std::string> search_fields = {"starring", "title"};std::vector<std::string> facets;- nlohmann::json results = collection1->search("thomas", search_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = collection1->search("thomas", search_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());spp::sparse_hash_map<std::string, field> schema = collection1->get_schema();@@ -78,7 +78,7 @@ TEST_F(CollectionManagerTest, RestoreRecordsOnRestart) {ASSERT_EQ(schema.size(), collection1->get_schema().size());ASSERT_EQ("points", collection1->get_token_ranking_field());- results = collection1->search("thomas", search_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = collection1->search("thomas", search_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());}diff --git a/test/collection_test.cpp b/test/collection_test.cppindex 25a070bf..4009f489 100644--- a/test/collection_test.cpp+++ b/test/collection_test.cpp@@ -240,7 +240,7 @@ TEST_F(CollectionTest, QueryWithTypo) {TEST_F(CollectionTest, TypoTokenRankedByScoreAndFrequency) {std::vector<std::string> facets;- nlohmann::json results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 2, MAX_SCORE, false);+ nlohmann::json results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 2, 1, MAX_SCORE, false);ASSERT_EQ(2, results["hits"].size());std::vector<std::string> ids = {"22", "23"};@@ -251,7 +251,7 @@ TEST_F(CollectionTest, TypoTokenRankedByScoreAndFrequency) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 3, FREQUENCY, false);+ results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 3, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"3", "12", "24"};@@ -263,19 +263,19 @@ TEST_F(CollectionTest, TypoTokenRankedByScoreAndFrequency) {}// Check pagination- results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 1, FREQUENCY, false);+ results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 1, 1, FREQUENCY, false);ASSERT_EQ(3, results["found"].get<int>());ASSERT_EQ(1, results["hits"].size());std::string solo_id = results["hits"].at(0)["id"];ASSERT_STREQ("3", solo_id.c_str());- results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 2, FREQUENCY, false);+ results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 2, 1, FREQUENCY, false);ASSERT_EQ(3, results["found"].get<int>());ASSERT_EQ(2, results["hits"].size());// Check total ordering- results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 10, FREQUENCY, false);+ results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 10, 1, FREQUENCY, false);ASSERT_EQ(5, results["hits"].size());ids = {"3", "12", "24", "22", "23"};@@ -286,7 +286,7 @@ TEST_F(CollectionTest, TypoTokenRankedByScoreAndFrequency) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 10, MAX_SCORE, false);+ results = collection->search("loox", query_fields, "", facets, sort_fields, 1, 10, 1, MAX_SCORE, false);ASSERT_EQ(5, results["hits"].size());ids = {"22", "23", "3", "12", "24"};@@ -301,7 +301,7 @@ TEST_F(CollectionTest, TypoTokenRankedByScoreAndFrequency) {TEST_F(CollectionTest, TextContainingAnActualTypo) {// A line contains "ISX" but not "what" - need to ensure that correction to "ISS what" happensstd::vector<std::string> facets;- nlohmann::json results = collection->search("ISX what", query_fields, "", facets, sort_fields, 1, 4, FREQUENCY, false);+ nlohmann::json results = collection->search("ISX what", query_fields, "", facets, sort_fields, 1, 4, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());ASSERT_EQ(4, results["found"].get<uint32_t>());@@ -315,7 +315,7 @@ TEST_F(CollectionTest, TextContainingAnActualTypo) {}// Record containing exact token match should appear first- results = collection->search("ISX", query_fields, "", facets, sort_fields, 1, 10, FREQUENCY, false);+ results = collection->search("ISX", query_fields, "", facets, sort_fields, 1, 10, 1, FREQUENCY, false);ASSERT_EQ(8, results["hits"].size());ASSERT_EQ(8, results["found"].get<uint32_t>());@@ -331,7 +331,7 @@ TEST_F(CollectionTest, TextContainingAnActualTypo) {TEST_F(CollectionTest, PrefixSearching) {std::vector<std::string> facets;- nlohmann::json results = collection->search("ex", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, true);+ nlohmann::json results = collection->search("ex", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, true);ASSERT_EQ(2, results["hits"].size());std::vector<std::string> ids = {"12", "6"};@@ -342,7 +342,7 @@ TEST_F(CollectionTest, PrefixSearching) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = collection->search("ex", query_fields, "", facets, sort_fields, 0, 10, MAX_SCORE, true);+ results = collection->search("ex", query_fields, "", facets, sort_fields, 0, 10, 1, MAX_SCORE, true);ASSERT_EQ(2, results["hits"].size());ids = {"6", "12"};@@ -353,7 +353,7 @@ TEST_F(CollectionTest, PrefixSearching) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = collection->search("what ex", query_fields, "", facets, sort_fields, 0, 10, MAX_SCORE, true);+ results = collection->search("what ex", query_fields, "", facets, sort_fields, 0, 10, 1, MAX_SCORE, true);ASSERT_EQ(9, results["hits"].size());ids = {"6", "12", "19", "22", "13", "8", "15", "24", "21"};@@ -387,7 +387,7 @@ TEST_F(CollectionTest, MultipleFields) {query_fields = {"title", "starring"};std::vector<std::string> facets;- nlohmann::json results = coll_mul_fields->search("Will", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = coll_mul_fields->search("Will", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());std::vector<std::string> ids = {"3", "2", "1", "0"};@@ -402,7 +402,7 @@ TEST_F(CollectionTest, MultipleFields) {// when "starring" takes higher priority than "title"query_fields = {"starring", "title"};- results = coll_mul_fields->search("thomas", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_mul_fields->search("thomas", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());ids = {"15", "14", "12", "13"};@@ -415,11 +415,11 @@ TEST_F(CollectionTest, MultipleFields) {}query_fields = {"starring", "title", "cast"};- results = coll_mul_fields->search("ben affleck", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_mul_fields->search("ben affleck", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(1, results["hits"].size());query_fields = {"cast"};- results = coll_mul_fields->search("chris", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_mul_fields->search("chris", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"6", "1", "7"};@@ -431,7 +431,7 @@ TEST_F(CollectionTest, MultipleFields) {}query_fields = {"cast"};- results = coll_mul_fields->search("chris pine", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_mul_fields->search("chris pine", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"7", "6", "1"};@@ -469,7 +469,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {// Plain search with no filters - results should be sorted by rank fieldsquery_fields = {"name"};std::vector<std::string> facets;- nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(5, results["hits"].size());std::vector<std::string> ids = {"3", "1", "4", "0", "2"};@@ -482,7 +482,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// Searching on an int32 field- results = coll_array_fields->search("Jeremy", query_fields, "age:>24", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age:>24", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"3", "1", "4"};@@ -494,14 +494,14 @@ TEST_F(CollectionTest, FilterOnNumericFields) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = coll_array_fields->search("Jeremy", query_fields, "age:>=24", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age:>=24", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());- results = coll_array_fields->search("Jeremy", query_fields, "age:24", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age:24", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(1, results["hits"].size());// Searching a number against an int32 array field- results = coll_array_fields->search("Jeremy", query_fields, "years:>2002", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "years:>2002", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"1", "0", "2"};@@ -512,7 +512,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = coll_array_fields->search("Jeremy", query_fields, "years:<1989", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "years:<1989", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(1, results["hits"].size());ids = {"3"};@@ -524,7 +524,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// multiple filters- results = coll_array_fields->search("Jeremy", query_fields, "years:<2005 && years:>1987", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "years:<2005 && years:>1987", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(1, results["hits"].size());ids = {"4"};@@ -536,7 +536,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// multiple search values (works like SQL's IN operator) against a single int field- results = coll_array_fields->search("Jeremy", query_fields, "age:[21, 24, 63]", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age:[21, 24, 63]", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ids = {"3", "0", "2"};@@ -548,7 +548,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// multiple search values against an int32 array field - also use extra padding between symbols- results = coll_array_fields->search("Jeremy", query_fields, "years : [ 2015, 1985 , 1999]", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "years : [ 2015, 1985 , 1999]", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());ids = {"3", "1", "4", "0"};@@ -560,7 +560,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// searching on an int64 array field - also ensure that padded space causes no issues- results = coll_array_fields->search("Jeremy", query_fields, "timestamps : > 475205222", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "timestamps : > 475205222", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());ids = {"1", "4", "0", "2"};@@ -573,7 +573,7 @@ TEST_F(CollectionTest, FilterOnNumericFields) {}// when filters don't match any record, no results should be returned- results = coll_array_fields->search("Jeremy", query_fields, "timestamps:<1", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "timestamps:<1", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());collectionManager.drop_collection("coll_array_fields");@@ -605,7 +605,7 @@ TEST_F(CollectionTest, FilterOnTextFields) {query_fields = {"name"};std::vector<std::string> facets;- nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "tags: gold", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "tags: gold", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());std::vector<std::string> ids = {"1", "4", "0", "2"};@@ -617,7 +617,7 @@ TEST_F(CollectionTest, FilterOnTextFields) {ASSERT_STREQ(id.c_str(), result_id.c_str());}- results = coll_array_fields->search("Jeremy", query_fields, "tags : bronze", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "tags : bronze", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(2, results["hits"].size());ids = {"4", "2"};@@ -630,7 +630,7 @@ TEST_F(CollectionTest, FilterOnTextFields) {}// search with a list of tags, also testing extra padding of space- results = coll_array_fields->search("Jeremy", query_fields, "tags: [bronze, silver]", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "tags: [bronze, silver]", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(4, results["hits"].size());ids = {"3", "4", "0", "2"};@@ -643,7 +643,7 @@ TEST_F(CollectionTest, FilterOnTextFields) {}// should be exact matches (no normalization or fuzzy searching should happen)- results = coll_array_fields->search("Jeremy", query_fields, "tags: BRONZE", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "tags: BRONZE", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());collectionManager.drop_collection("coll_array_fields");@@ -679,27 +679,27 @@ TEST_F(CollectionTest, HandleBadlyFormedFilterQuery) {std::vector<std::string> facets;// when filter field does not exist in the schema- nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "tagzz: gold", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "tagzz: gold", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());// searching using a string for a numeric field- results = coll_array_fields->search("Jeremy", query_fields, "age: abcdef", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age: abcdef", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());// searching using a string for a numeric array field- results = coll_array_fields->search("Jeremy", query_fields, "timestamps: abcdef", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "timestamps: abcdef", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());// malformed k:v syntax- results = coll_array_fields->search("Jeremy", query_fields, "timestamps abcdef", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "timestamps abcdef", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());// just empty spaces- results = coll_array_fields->search("Jeremy", query_fields, " ", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, " ", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());// wrapping number with quotes- results = coll_array_fields->search("Jeremy", query_fields, "age: '21'", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age: '21'", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());collectionManager.drop_collection("coll_array_fields");@@ -735,7 +735,7 @@ TEST_F(CollectionTest, FacetCounts) {std::vector<std::string> facets = {"tags"};// single facet with no filters- nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(5, results["hits"].size());ASSERT_EQ(1, results["facet_counts"].size());@@ -755,7 +755,7 @@ TEST_F(CollectionTest, FacetCounts) {facets.clear();facets.push_back("tags");facets.push_back("name");- results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(5, results["hits"].size());ASSERT_EQ(2, results["facet_counts"].size());@@ -770,7 +770,7 @@ TEST_F(CollectionTest, FacetCounts) {// facet with filtersfacets.clear();facets.push_back("tags");- results = coll_array_fields->search("Jeremy", query_fields, "age: >24", facets, sort_fields, 0, 10, FREQUENCY, false);+ results = coll_array_fields->search("Jeremy", query_fields, "age: >24", facets, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(3, results["hits"].size());ASSERT_EQ(1, results["facet_counts"].size());@@ -930,6 +930,6 @@ TEST_F(CollectionTest, EmptyIndexShouldNotCrash) {empty_coll = collectionManager.create_collection("empty_coll", fields, facet_fields, sort_fields_index, "age");}- nlohmann::json results = empty_coll->search("a", {"name"}, "", {}, sort_fields, 0, 10, FREQUENCY, false);+ nlohmann::json results = empty_coll->search("a", {"name"}, "", {}, sort_fields, 0, 10, 1, FREQUENCY, false);ASSERT_EQ(0, results["hits"].size());}\ No newline at end of file