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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/*
* 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.
*/
// -*- c++ -*-
#include "IndexBinary_c.h"
#include <faiss/IndexBinary.h>
#include "macros_impl.h"
extern "C" {
DEFINE_DESTRUCTOR(IndexBinary)
DEFINE_GETTER(IndexBinary, int, d)
DEFINE_GETTER(IndexBinary, int, is_trained)
DEFINE_GETTER(IndexBinary, idx_t, ntotal)
DEFINE_GETTER(IndexBinary, FaissMetricType, metric_type)
DEFINE_GETTER(IndexBinary, int, verbose);
DEFINE_SETTER(IndexBinary, int, verbose);
int faiss_IndexBinary_train(
FaissIndexBinary* index,
idx_t n,
const uint8_t* x) {
try {
reinterpret_cast<faiss::IndexBinary*>(index)->train(n, x);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_add(FaissIndexBinary* index, idx_t n, const uint8_t* x) {
try {
reinterpret_cast<faiss::IndexBinary*>(index)->add(n, x);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_add_with_ids(
FaissIndexBinary* index,
idx_t n,
const uint8_t* x,
const idx_t* xids) {
try {
reinterpret_cast<faiss::IndexBinary*>(index)->add_with_ids(n, x, xids);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_search(
const FaissIndexBinary* index,
idx_t n,
const uint8_t* x,
idx_t k,
int32_t* distances,
idx_t* labels) {
try {
reinterpret_cast<const faiss::IndexBinary*>(index)->search(
n, x, k, distances, labels);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_range_search(
const FaissIndexBinary* index,
idx_t n,
const uint8_t* x,
int radius,
FaissRangeSearchResult* result) {
try {
reinterpret_cast<const faiss::IndexBinary*>(index)->range_search(
n,
x,
radius,
reinterpret_cast<faiss::RangeSearchResult*>(result));
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_assign(
FaissIndexBinary* index,
idx_t n,
const uint8_t* x,
idx_t* labels,
idx_t k) {
try {
reinterpret_cast<faiss::IndexBinary*>(index)->assign(n, x, labels, k);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_reset(FaissIndexBinary* index) {
try {
reinterpret_cast<faiss::IndexBinary*>(index)->reset();
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_remove_ids(
FaissIndexBinary* index,
const FaissIDSelector* sel,
size_t* n_removed) {
try {
size_t n{reinterpret_cast<faiss::IndexBinary*>(index)->remove_ids(
*reinterpret_cast<const faiss::IDSelector*>(sel))};
if (n_removed) {
*n_removed = n;
}
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_reconstruct(
const FaissIndexBinary* index,
idx_t key,
uint8_t* recons) {
try {
reinterpret_cast<const faiss::IndexBinary*>(index)->reconstruct(
key, recons);
}
CATCH_AND_HANDLE
}
int faiss_IndexBinary_reconstruct_n(
const FaissIndexBinary* index,
idx_t i0,
idx_t ni,
uint8_t* recons) {
try {
reinterpret_cast<const faiss::IndexBinary*>(index)->reconstruct_n(
i0, ni, recons);
}
CATCH_AND_HANDLE
}
}
|
