#include "scann/utils/factory_helpers.h"
#include <cstdint>
#include "scann/distance_measures/distance_measure_factory.h"
#include "scann/oss_wrappers/scann_status.h"
#include "scann/proto/distance_measure.pb.h"
#include "scann/proto/exact_reordering.pb.h"
#include "scann/proto/min_distance.pb.h"
#include "scann/proto/scann.pb.h"
#include "scann/utils/common.h"
namespace research_scann {
Status GenericSearchParameters::PopulateValuesFromScannConfig(
const ScannConfig& config) {
min_distance = config.min_distance().min_distance();
if (!config.has_num_neighbors() && !config.has_epsilon_distance()) {
return InvalidArgumentError(
"Must specify num_neighbors and/or epsilon_distance.");
}
if (config.has_num_single_shard_neighbors()) {
if (!config.has_num_neighbors()) {
return InvalidArgumentError(
"ScannConfig must have num_neighbors if it has "
"num_single_shard_neighbors.");
}
if (config.num_neighbors() < config.num_single_shard_neighbors()) {
return InvalidArgumentError(
"num_neighbors must be >= num_single_shard_neighbors if "
"both are set.");
}
post_reordering_num_neighbors = config.num_single_shard_neighbors();
} else if (config.has_num_neighbors()) {
post_reordering_num_neighbors = config.num_neighbors();
} else {
post_reordering_num_neighbors = numeric_limits<int32_t>::max();
}
post_reordering_epsilon = config.has_epsilon_distance()
? config.epsilon_distance()
: numeric_limits<float>::infinity();
if (post_reordering_num_neighbors <= 0) {
return InvalidArgumentError("num_neighbors must be > 0.");
}
SCANN_ASSIGN_OR_RETURN(reordering_dist,
GetDistanceMeasure(config.distance_measure()));
if (config.has_exact_reordering()) {
const auto& er = config.exact_reordering();
if (er.has_approx_distance_measure()) {
SCANN_ASSIGN_OR_RETURN(pre_reordering_dist,
GetDistanceMeasure(er.approx_distance_measure()));
} else {
pre_reordering_dist = reordering_dist;
}
if (!er.has_approx_num_neighbors() && !er.has_approx_epsilon_distance()) {
return InvalidArgumentError(
"Must specify approx_num_neighbors and/or approx_epsilon if "
"performing exact reordering.");
}
pre_reordering_num_neighbors = (er.has_approx_num_neighbors())
? (er.approx_num_neighbors())
: (numeric_limits<int32_t>::max());
if (pre_reordering_num_neighbors <= 0) {
return InvalidArgumentError("approx_num_neighbors must be > 0.");
}
pre_reordering_epsilon = er.has_approx_epsilon_distance()
? er.approx_epsilon_distance()
: numeric_limits<float>::infinity();
} else {
pre_reordering_dist = reordering_dist;
pre_reordering_num_neighbors = post_reordering_num_neighbors;
pre_reordering_epsilon = post_reordering_epsilon;
}
return OkStatus();
}
}