Skip to content

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

Add another test for phrase search.

Kishore Nallan6dfcbf6f82ef
diff --git a/test/collection_specific_test.cpp b/test/collection_specific_test.cpp
index 28155f18..c27bf137 100644
--- a/test/collection_specific_test.cpp
+++ b/test/collection_specific_test.cpp
@@ -2447,6 +2447,36 @@ TEST_F(CollectionSpecificTest, PhraseSearch) {
collectionManager.drop_collection("coll1");
}
+TEST_F(CollectionSpecificTest, PhraseSearchMultiBlockToken) {
+ std::vector<field> fields = {field("title", field_types::STRING, false),};
+ Collection* coll1 = collectionManager.create_collection("coll1", 1, fields).get();
+
+ // the word "train"'s posting list will spread > 1 block (since 300 docs contain it)
+
+ for(size_t i = 0; i < 300; i++) {
+ nlohmann::json doc1;
+ doc1["title"] = "Train was here.";
+ ASSERT_TRUE(coll1->add(doc1.dump()).ok());
+ }
+
+ nlohmann::json doc2;
+ doc2["title"] = "Train is coming.";
+ ASSERT_TRUE(coll1->add(doc2.dump()).ok());
+
+ auto results = coll1->search(R"("is train")", {"title"},
+ "", {}, {}, {2}, 10, 1, FREQUENCY, {true}).get();
+
+ ASSERT_EQ(0, results["hits"].size());
+
+ results = coll1->search(R"("train is")", {"title"},
+ "", {}, {}, {2}, 10, 1, FREQUENCY, {true}).get();
+
+ ASSERT_EQ(1, results["hits"].size());
+ ASSERT_EQ("300", results["hits"][0]["document"]["id"].get<std::string>());
+
+ collectionManager.drop_collection("coll1");
+}
+
TEST_F(CollectionSpecificTest, PhraseSearchMultipleFields) {
std::vector<field> fields = {field("title", field_types::STRING, false),
field("description", field_types::STRING, false),};
@@ -2732,4 +2762,3 @@ TEST_F(CollectionSpecificTest, NonIndexField) {
collectionManager.drop_collection("coll1");
}
-