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
Test for nested sort_by + facet.
Kishore Nallan22735baddc6b
diff --git a/test/collection_faceting_test.cpp b/test/collection_faceting_test.cppindex a26a78da..fe8086fb 100644--- a/test/collection_faceting_test.cpp+++ b/test/collection_faceting_test.cpp@@ -938,3 +938,43 @@ TEST_F(CollectionFacetingTest, FacetArrayValuesShouldBeNormalized) {collectionManager.drop_collection("coll1");}++TEST_F(CollectionFacetingTest, FacetByNestedIntField) {+ nlohmann::json schema = R"({+ "name": "coll1",+ "fields": [+ {"name": "details", "type": "object", "optional": false },+ {"name": "company.num_employees", "type": "int32", "optional": false, "facet": true }+ ]+ })"_json;++ auto op = collectionManager.create_collection(schema);+ ASSERT_TRUE(op.ok());+ Collection* coll1 = op.get();++ auto doc1 = R"({+ "details": {"count": 1000},+ "company": {"num_employees": 2000}+ })"_json;++ auto doc2 = R"({+ "details": {"count": 2000},+ "company": {"num_employees": 2000}+ })"_json;++ ASSERT_TRUE(coll1->add(doc1.dump(), CREATE).ok());+ ASSERT_TRUE(coll1->add(doc2.dump(), CREATE).ok());++ std::vector<sort_by> sort_fields = { sort_by("details.count", "ASC") };++ auto results = coll1->search("*", {}, "", {"company.num_employees"}, sort_fields, {0}, 10, 1,+ token_ordering::FREQUENCY, {true}, 10, spp::sparse_hash_set<std::string>(),+ spp::sparse_hash_set<std::string>(), 10, "", 30, 4).get();++ ASSERT_EQ(2, results["found"].get<size_t>());+ ASSERT_EQ(1, results["facet_counts"].size());+ ASSERT_EQ("company.num_employees", results["facet_counts"][0]["field_name"]);+ ASSERT_EQ(1, results["facet_counts"][0]["counts"].size());+ ASSERT_EQ(2, results["facet_counts"][0]["counts"][0]["count"].get<size_t>());+ ASSERT_EQ("2000", results["facet_counts"][0]["counts"][0]["value"].get<std::string>());+}diff --git a/test/collection_nested_fields_test.cpp b/test/collection_nested_fields_test.cppindex 867468f0..eddd8666 100644--- a/test/collection_nested_fields_test.cpp+++ b/test/collection_nested_fields_test.cpp@@ -897,7 +897,94 @@ TEST_F(CollectionNestedFieldsTest, FieldsWithExplicitSchema) {})"_json;ASSERT_EQ(snippet_doc.dump(), results["hits"][0]["highlight"]["snippet"].dump());+}++TEST_F(CollectionNestedFieldsTest, SortByNestedField) {+ nlohmann::json schema = R"({+ "name": "coll1",+ "fields": [+ {"name": "details", "type": "object", "optional": false },+ {"name": "company.num_employees", "type": "int32", "optional": false }+ ]+ })"_json;++ auto op = collectionManager.create_collection(schema);+ ASSERT_TRUE(op.ok());+ Collection* coll1 = op.get();++ auto doc1 = R"({+ "details": {"count": 1000},+ "company": {"num_employees": 2000}+ })"_json;++ auto doc2 = R"({+ "details": {"count": 2000},+ "company": {"num_employees": 1000}+ })"_json;++ ASSERT_TRUE(coll1->add(doc1.dump(), CREATE).ok());+ ASSERT_TRUE(coll1->add(doc2.dump(), CREATE).ok());++ std::vector<sort_by> sort_fields = { sort_by("details.count", "ASC") };++ auto results = coll1->search("*", {},+ "", {}, sort_fields, {0}, 10, 1,+ token_ordering::FREQUENCY, {true}, 10, spp::sparse_hash_set<std::string>(),+ spp::sparse_hash_set<std::string>(), 10, "", 30, 4).get();++ ASSERT_EQ(2, results["found"].get<size_t>());+ ASSERT_EQ(2, results["hits"].size());+ ASSERT_EQ("0", results["hits"][0]["document"]["id"].get<std::string>());+ ASSERT_EQ("1", results["hits"][1]["document"]["id"].get<std::string>());++ sort_fields = { sort_by("company.num_employees", "ASC") };+ results = coll1->search("*", {},+ "", {}, sort_fields, {0}, 10, 1,+ token_ordering::FREQUENCY, {true}, 10, spp::sparse_hash_set<std::string>(),+ spp::sparse_hash_set<std::string>(), 10, "", 30, 4).get();++ ASSERT_EQ(2, results["found"].get<size_t>());+ ASSERT_EQ(2, results["hits"].size());+ ASSERT_EQ("1", results["hits"][0]["document"]["id"].get<std::string>());+ ASSERT_EQ("0", results["hits"][1]["document"]["id"].get<std::string>());+ // with auto schema+ schema = R"({+ "name": "coll2",+ "fields": [+ {"name": ".*", "type": "auto"}+ ]+ })"_json;++ op = collectionManager.create_collection(schema);+ ASSERT_TRUE(op.ok());+ Collection* coll2 = op.get();++ ASSERT_TRUE(coll2->add(doc1.dump(), CREATE).ok());+ ASSERT_TRUE(coll2->add(doc2.dump(), CREATE).ok());++ sort_fields = { sort_by("details.count", "ASC") };++ results = coll2->search("*", {},+ "", {}, sort_fields, {0}, 10, 1,+ token_ordering::FREQUENCY, {true}, 10, spp::sparse_hash_set<std::string>(),+ spp::sparse_hash_set<std::string>(), 10, "", 30, 4).get();++ ASSERT_EQ(2, results["found"].get<size_t>());+ ASSERT_EQ(2, results["hits"].size());+ ASSERT_EQ("0", results["hits"][0]["document"]["id"].get<std::string>());+ ASSERT_EQ("1", results["hits"][1]["document"]["id"].get<std::string>());++ sort_fields = { sort_by("company.num_employees", "ASC") };+ results = coll2->search("*", {},+ "", {}, sort_fields, {0}, 10, 1,+ token_ordering::FREQUENCY, {true}, 10, spp::sparse_hash_set<std::string>(),+ spp::sparse_hash_set<std::string>(), 10, "", 30, 4).get();++ ASSERT_EQ(2, results["found"].get<size_t>());+ ASSERT_EQ(2, results["hits"].size());+ ASSERT_EQ("1", results["hits"][0]["document"]["id"].get<std::string>());+ ASSERT_EQ("0", results["hits"][1]["document"]["id"].get<std::string>());}TEST_F(CollectionNestedFieldsTest, GroupByOnNestedFieldsWithWildcardSchema) {