46 lines
1.4 KiB
C++
46 lines
1.4 KiB
C++
/**
|
|
* Copyright (c) Facebook, Inc. and its 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 "IndexShards.h"
|
|
#include "macros_impl.h"
|
|
|
|
using faiss::Index;
|
|
using faiss::IndexShards;
|
|
|
|
DEFINE_GETTER(IndexShards, int, own_fields)
|
|
DEFINE_SETTER(IndexShards, int, own_fields)
|
|
|
|
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
|
|
}
|
|
|
|
FaissIndex* faiss_IndexShards_at(FaissIndexShards* index, int i) {
|
|
auto shard = reinterpret_cast<IndexShards*>(index)->at(i);
|
|
return reinterpret_cast<FaissIndex*>(shard);
|
|
}
|