Method parallelSearchInOneStep

python/src/ngtpy.cpp:919–961

  }

  void parallelSearchInOneStep(
    py::array_t<float> queries,
    BatchResults &results,
    size_t size
  ) {
    const py::buffer_info &qinfo = queries.request();
    const std::vector<long int> &qshape = qinfo.shape;
    auto nOfQueries = qshape[0];
    size_t dimension = qshape[1];
    size_t pseudoDimension = QBG::Index::getQuantizer().globalCodebookIndex.getObjectSpace().getPaddedDimension();
    auto *queryPtr = static_cast<float*>(qinfo.ptr);

    size	= size > 0 ? size : defaultNumOfSearchObjects;

    results.results.clear();
    results.resultList.clear();
    results.results.resize(nOfQueries);

    size_t exactResultSize = 0;
    if (defaultResultExpansion >= 1.0) {
      size = static_cast<float>(size) * defaultResultExpansion;
      exactResultSize = size;
    }
#pragma omp parallel for schedule(dynamic)
    for (int idx = 0; idx < nOfQueries; idx++) {
      float *qptr = queryPtr + idx * dimension;
      vector<float> query(pseudoDimension, 0);
      memcpy(query.data(), qptr, dimension * sizeof(float));
      QBG::SearchContainer sc;
      sc.setObjectVector(query);
      sc.setSize(size);
      sc.setExactResultSize(exactResultSize);
      sc.setEpsilon(defaultEpsilon);
      sc.setBlobEpsilon(defaultBlobEpsilon);
      sc.setEdgeSize(defaultEdgeSize);
      sc.setGraphExplorationSize(defaultExplorationSize);
      QBG::Index::search(sc);
      results.results[idx] = std::move(sc.getWorkingResult());
      //QBG::Index::getQuantizer().globalCodebookIndex.deleteObject(queryObject);
    }
    results.size = results.results.size();
    return;
  }

  void batchSearch(
    py::array_t<float> queries,