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
Persist optional field value and restore during restart.
kishorenc1ab25b9d16b9
diff --git a/include/field.h b/include/field.hindex f36c5845..30ef142d 100644--- a/include/field.h+++ b/include/field.h@@ -22,6 +22,7 @@ namespace fields {static const std::string name = "name";static const std::string type = "type";static const std::string facet = "facet";+ static const std::string optional = "facet";}struct field {diff --git a/src/collection_manager.cpp b/src/collection_manager.cppindex 62c06a05..d3ff8e3b 100644--- a/src/collection_manager.cpp+++ b/src/collection_manager.cpp@@ -16,7 +16,8 @@ Collection* CollectionManager::init_collection(const nlohmann::json & collectionnlohmann::json fields_map = collection_meta[COLLECTION_SEARCH_FIELDS_KEY];for (nlohmann::json::iterator it = fields_map.begin(); it != fields_map.end(); ++it) {- fields.push_back({it.value()[fields::name], it.value()[fields::type], it.value()[fields::facet]});+ fields.push_back({it.value()[fields::name], it.value()[fields::type],+ it.value()[fields::facet], it.value()[fields::optional]});}std::string default_sorting_field = collection_meta[COLLECTION_DEFAULT_SORTING_FIELD_KEY].get<std::string>();@@ -218,6 +219,7 @@ Option<Collection*> CollectionManager::create_collection(const std::string name,field_val[fields::name] = field.name;field_val[fields::type] = field.type;field_val[fields::facet] = field.facet;+ field_val[fields::optional] = field.optional;fields_json.push_back(field_val);if(field.name == default_sorting_field && !(field.type == field_types::INT32 ||