avoid throw semantics

- from nmslib/hnswlib#619

Author: getnamo

ThirdParty/hnswlib/include/hnswlib/bruteforce.h

@@ -1,4 +1,7 @@
 #pragma once
+
+#include "hnswlib.h"
+
 #include <unordered_map>
 #include <fstream>
 #include <mutex>
@@ -51,7 +54,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
         size_per_element_ = data_size_ + sizeof(labeltype);
         data_ = (char *) malloc(maxElements * size_per_element_);
         if (data_ == nullptr)
-            throw std::runtime_error("Not enough memory: BruteforceSearch failed to allocate data");
+            HNSWLIB_THROW_RUNTIME_ERROR("Not enough memory: BruteforceSearch failed to allocate data");
         cur_element_count = 0;
     }
 
@@ -61,7 +64,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
     }
 
 
-    void addPoint(const void *datapoint, labeltype label, bool replace_deleted = false) {
+    Status addPointNoExceptions(const void *datapoint, labeltype label, bool replace_deleted = false) override {
         int idx;
         {
             std::unique_lock<std::mutex> lock(index_lock);
@@ -71,7 +74,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
                 idx = search->second;
             } else {
                 if (cur_element_count >= maxelements_) {
-                    throw std::runtime_error("The number of elements exceeds the specified limit\n");
+                    HNSWLIB_THROW_RUNTIME_ERROR("The number of elements exceeds the specified limit\n");
                 }
                 idx = cur_element_count;
                 dict_external_to_internal[label] = idx;
@@ -80,6 +83,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
         }
         memcpy(data_ + size_per_element_ * idx + data_size_, &label, sizeof(labeltype));
         memcpy(data_ + size_per_element_ * idx, datapoint, data_size_);
+        return OkStatus();
     }
 
 
@@ -103,8 +107,9 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
     }
 
 
-    std::priority_queue<std::pair<dist_t, labeltype >>
-    searchKnn(const void *query_data, size_t k, BaseFilterFunctor* isIdAllowed = nullptr) const {
+    using DistanceLabelPriorityQueue = typename AlgorithmInterface<dist_t>::DistanceLabelPriorityQueue;
+    StatusOr<DistanceLabelPriorityQueue>
+    searchKnnNoExceptions(const void *query_data, size_t k, BaseFilterFunctor* isIdAllowed = nullptr) const override {
         assert(k <= cur_element_count);
         std::priority_queue<std::pair<dist_t, labeltype >> topResults;
         if (cur_element_count == 0) return topResults;
@@ -163,7 +168,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
         size_per_element_ = data_size_ + sizeof(labeltype);
         data_ = (char *) malloc(maxelements_ * size_per_element_);
         if (data_ == nullptr)
-            throw std::runtime_error("Not enough memory: loadIndex failed to allocate data");
+            HNSWLIB_THROW_RUNTIME_ERROR("Not enough memory: loadIndex failed to allocate data");
 
         input.read(data_, maxelements_ * size_per_element_);