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

Comment out redundant print statements. Will have to replace with proper logging lib later.

Kishore Nallan85d64608fd5f
diff --git a/src/main/server.cpp b/src/main/server.cpp
index 6a370e70..5f52d051 100644
--- a/src/main/server.cpp
+++ b/src/main/server.cpp
@@ -85,7 +85,7 @@ static int get_search(h2o_handler_t *self, h2o_req_t *req) {
token_ordering token_order = (query_map[TOKEN_ORDERING] == "MAX_SCORE") ? MAX_SCORE : FREQUENCY;
- printf("Query: %s\n", query_map["q"].c_str());
+ //printf("Query: %s\n", query_map["q"].c_str());
auto begin = std::chrono::high_resolution_clock::now();
std::vector<std::string> search_fields = {"title"};
@@ -98,11 +98,11 @@ static int get_search(h2o_handler_t *self, h2o_req_t *req) {
}
std::string json_str = json_array.dump();
- std::cout << "JSON:" << json_str << std::endl;
+ //std::cout << "JSON:" << json_str << std::endl;
struct rusage r_usage;
getrusage(RUSAGE_SELF,&r_usage);
- std::cout << "Memory usage: " << r_usage.ru_maxrss << std::endl;
+ //std::cout << "Memory usage: " << r_usage.ru_maxrss << std::endl;
h2o_iovec_t body = h2o_strdup(&req->pool, json_str.c_str(), SIZE_MAX);
req->res.status = 200;