#ifndef SCANN_TREE_X_HYBRID_INTERNAL_BATCHING_H_
#define SCANN_TREE_X_HYBRID_INTERNAL_BATCHING_H_
#include <utility>
#include "scann/base/search_parameters.h"
#include "scann/data_format/dataset.h"
#include "scann/utils/fast_top_neighbors.h"
#include "scann/utils/types.h"
namespace research_scann {
namespace tree_x_internal {
template <typename T>
bool SupportsLowLevelBatching(const TypedDatasetView<T>& queries,
ConstSpan<SearchParameters> params) {
if (!queries.IsDense()) return false;
for (const SearchParameters& p : params) {
if (p.pre_reordering_crowding_enabled() || p.restricts_enabled()) {
return false;
}
}
return true;
}
template <typename Mutator>
void AddLeafResultsToTopN(ConstSpan<DatapointIndex> local_to_global_index,
const float distance_to_center_adjustment,
ConstSpan<pair<DatapointIndex, float>> leaf_results,
Mutator* mutator) {
float epsilon = mutator->epsilon();
for (const auto& result : leaf_results) {
float dist = result.second + distance_to_center_adjustment;
if (dist <= epsilon) {
if (ABSL_PREDICT_FALSE(
mutator->Push(local_to_global_index[result.first], dist))) {
mutator->GarbageCollect();
epsilon = mutator->epsilon();
}
}
}
}
struct QueryForResidualLeaf {
QueryForResidualLeaf() {}
QueryForResidualLeaf(DatapointIndex query_index, float distance_to_center)
: query_index(query_index), distance_to_center(distance_to_center) {}
DatapointIndex query_index = 0;
float distance_to_center = NAN;
};
inline DatapointIndex QueryIndex(DatapointIndex x) { return x; }
inline DatapointIndex QueryIndex(const QueryForResidualLeaf& q) {
return q.query_index;
}
struct BatchedGlobalTopNData {
BatchedGlobalTopNData(uint32_t leaf_index, uint32_t leaf_size,
const uint8_t* ah_data,
ConstSpan<QueryForResidualLeaf> queries)
: leaf_index(leaf_index),
leaf_size(leaf_size),
ah_data(ah_data),
queries(queries) {}
uint32_t leaf_index;
uint32_t leaf_size;
const uint8_t* ah_data;
ConstSpan<QueryForResidualLeaf> queries;
};
inline float DistanceToCenterAdjustment(DatapointIndex query_index) {
return 0.0f;
}
inline float DistanceToCenterAdjustment(const QueryForResidualLeaf& q) {
return q.distance_to_center;
}
template <typename QueryForLeaf>
vector<SearchParameters> CreateParamsSubsetForLeaf(
ConstSpan<FastTopNeighbors<float>> topns,
ConstSpan<shared_ptr<const SearcherSpecificOptionalParameters>>
leaf_optional_params,
ConstSpan<QueryForLeaf> queries_for_leaf) {
vector<SearchParameters> result;
result.reserve(queries_for_leaf.size());
for (const QueryForLeaf& q : queries_for_leaf) {
const DatapointIndex query_index = QueryIndex(q);
SearchParameters leaf_params;
leaf_params.set_pre_reordering_num_neighbors(
topns[query_index].max_results());
leaf_params.set_pre_reordering_epsilon(topns[query_index].epsilon() -
DistanceToCenterAdjustment(q));
leaf_params.set_searcher_specific_optional_parameters(
leaf_optional_params[query_index]);
result.emplace_back(std::move(leaf_params));
}
return result;
}
template <typename T>
size_t RecursiveSize(const T& vec) {
size_t result = 0;
for (auto& inner : vec) {
result += inner.size();
}
return result;
}
} }
#endif