1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
|
/*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "IndexShards_c.h"
#include <faiss/IndexShards.h>
#include "macros_impl.h"
using faiss::Index;
using faiss::IndexShards;
DEFINE_DESTRUCTOR(IndexShards)
DEFINE_GETTER(IndexShards, int, own_indices)
DEFINE_SETTER(IndexShards, int, own_indices)
DEFINE_GETTER(IndexShards, int, successive_ids)
DEFINE_SETTER(IndexShards, int, successive_ids)
int faiss_IndexShards_new(FaissIndexShards** p_index, idx_t d) {
try {
auto out = new IndexShards(d);
*p_index = reinterpret_cast<FaissIndexShards*>(out);
}
CATCH_AND_HANDLE
}
int faiss_IndexShards_new_with_options(
FaissIndexShards** p_index,
idx_t d,
int threaded,
int successive_ids) {
try {
auto out = new IndexShards(
d,
static_cast<bool>(threaded),
static_cast<bool>(successive_ids));
*p_index = reinterpret_cast<FaissIndexShards*>(out);
}
CATCH_AND_HANDLE
}
int faiss_IndexShards_add_shard(FaissIndexShards* index, FaissIndex* shard) {
try {
reinterpret_cast<IndexShards*>(index)->add_shard(
reinterpret_cast<Index*>(shard));
}
CATCH_AND_HANDLE
}
int faiss_IndexShards_remove_shard(FaissIndexShards* index, FaissIndex* shard) {
try {
reinterpret_cast<IndexShards*>(index)->remove_shard(
reinterpret_cast<Index*>(shard));
}
CATCH_AND_HANDLE
}
FaissIndex* faiss_IndexShards_at(FaissIndexShards* index, int i) {
auto shard = reinterpret_cast<IndexShards*>(index)->at(i);
return reinterpret_cast<FaissIndex*>(shard);
}
|