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 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326
|
/*
* 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 "AuxIndexStructures_c.h"
#include <faiss/impl/AuxIndexStructures.h>
#include <faiss/impl/DistanceComputer.h>
#include <faiss/impl/IDSelector.h>
#include <iostream>
#include "../macros_impl.h"
using faiss::BufferList;
using faiss::DistanceComputer;
using faiss::IDSelector;
using faiss::IDSelectorAnd;
using faiss::IDSelectorBatch;
using faiss::IDSelectorBitmap;
using faiss::IDSelectorNot;
using faiss::IDSelectorOr;
using faiss::IDSelectorRange;
using faiss::IDSelectorXOr;
using faiss::RangeQueryResult;
using faiss::RangeSearchPartialResult;
using faiss::RangeSearchResult;
DEFINE_GETTER(RangeSearchResult, size_t, nq)
int faiss_RangeSearchResult_new(FaissRangeSearchResult** p_rsr, idx_t nq) {
try {
*p_rsr = reinterpret_cast<FaissRangeSearchResult*>(
new RangeSearchResult(nq));
return 0;
}
CATCH_AND_HANDLE
}
int faiss_RangeSearchResult_new_with(
FaissRangeSearchResult** p_rsr,
idx_t nq,
int alloc_lims) {
try {
*p_rsr = reinterpret_cast<FaissRangeSearchResult*>(
new RangeSearchResult(nq, static_cast<bool>(alloc_lims)));
return 0;
}
CATCH_AND_HANDLE
}
/// called when lims contains the nb of elements result entries
/// for each query
int faiss_RangeSearchResult_do_allocation(FaissRangeSearchResult* rsr) {
try {
reinterpret_cast<RangeSearchResult*>(rsr)->do_allocation();
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_DESTRUCTOR(RangeSearchResult)
/// getter for buffer_size
DEFINE_GETTER(RangeSearchResult, size_t, buffer_size)
/// getter for lims: size (nq + 1)
void faiss_RangeSearchResult_lims(FaissRangeSearchResult* rsr, size_t** lims) {
*lims = reinterpret_cast<RangeSearchResult*>(rsr)->lims;
}
/// getter for labels and respective distances (not sorted):
/// result for query i is labels[lims[i]:lims[i+1]]
void faiss_RangeSearchResult_labels(
FaissRangeSearchResult* rsr,
idx_t** labels,
float** distances) {
auto sr = reinterpret_cast<RangeSearchResult*>(rsr);
*labels = sr->labels;
*distances = sr->distances;
}
DEFINE_DESTRUCTOR(IDSelector)
int faiss_IDSelector_is_member(const FaissIDSelector* sel, idx_t id) {
return reinterpret_cast<const IDSelector*>(sel)->is_member(id);
}
DEFINE_DESTRUCTOR(IDSelectorRange)
DEFINE_GETTER(IDSelectorRange, idx_t, imin)
DEFINE_GETTER(IDSelectorRange, idx_t, imax)
int faiss_IDSelectorRange_new(
FaissIDSelectorRange** p_sel,
idx_t imin,
idx_t imax) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorRange*>(
new IDSelectorRange(imin, imax));
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_GETTER(IDSelectorBatch, int, nbits)
DEFINE_GETTER(IDSelectorBatch, idx_t, mask)
int faiss_IDSelectorBatch_new(
FaissIDSelectorBatch** p_sel,
size_t n,
const idx_t* indices) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorBatch*>(
new IDSelectorBatch(n, indices));
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_DESTRUCTOR(IDSelectorBitmap)
DEFINE_GETTER(IDSelectorBitmap, size_t, n)
DEFINE_GETTER(IDSelectorBitmap, const uint8_t*, bitmap)
int faiss_IDSelectorBitmap_new(
FaissIDSelectorBitmap** p_sel,
size_t n,
const uint8_t* bitmap) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorBitmap*>(
new IDSelectorBitmap(n, bitmap));
return 0;
}
CATCH_AND_HANDLE
}
int faiss_IDSelectorNot_new(
FaissIDSelectorNot** p_sel,
const FaissIDSelector* sel) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorNot*>(
new IDSelectorNot(reinterpret_cast<const IDSelector*>(sel)));
}
CATCH_AND_HANDLE
}
int faiss_IDSelectorAnd_new(
FaissIDSelectorAnd** p_sel,
const FaissIDSelector* lhs_sel,
const FaissIDSelector* rhs_sel) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorAnd*>(new IDSelectorAnd(
reinterpret_cast<const IDSelector*>(lhs_sel),
reinterpret_cast<const IDSelector*>(rhs_sel)));
}
CATCH_AND_HANDLE
}
int faiss_IDSelectorOr_new(
FaissIDSelectorOr** p_sel,
const FaissIDSelector* lhs_sel,
const FaissIDSelector* rhs_sel) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorOr*>(new IDSelectorOr(
reinterpret_cast<const IDSelector*>(lhs_sel),
reinterpret_cast<const IDSelector*>(rhs_sel)));
}
CATCH_AND_HANDLE
}
int faiss_IDSelectorXOr_new(
FaissIDSelectorXOr** p_sel,
const FaissIDSelector* lhs_sel,
const FaissIDSelector* rhs_sel) {
try {
*p_sel = reinterpret_cast<FaissIDSelectorXOr*>(new IDSelectorXOr(
reinterpret_cast<const IDSelector*>(lhs_sel),
reinterpret_cast<const IDSelector*>(rhs_sel)));
}
CATCH_AND_HANDLE
}
// Below are structures used only by Index implementations
DEFINE_DESTRUCTOR(BufferList)
DEFINE_GETTER(BufferList, size_t, buffer_size)
DEFINE_GETTER(BufferList, size_t, wp)
int faiss_BufferList_append_buffer(FaissBufferList* bl) {
try {
reinterpret_cast<BufferList*>(bl)->append_buffer();
return 0;
}
CATCH_AND_HANDLE
}
int faiss_BufferList_new(FaissBufferList** p_bl, size_t buffer_size) {
try {
*p_bl = reinterpret_cast<FaissBufferList*>(new BufferList(buffer_size));
return 0;
}
CATCH_AND_HANDLE
}
int faiss_BufferList_add(FaissBufferList* bl, idx_t id, float dis) {
try {
reinterpret_cast<BufferList*>(bl)->add(id, dis);
return 0;
}
CATCH_AND_HANDLE
}
/// copy elemnts ofs:ofs+n-1 seen as linear data in the buffers to
/// tables dest_ids, dest_dis
int faiss_BufferList_copy_range(
FaissBufferList* bl,
size_t ofs,
size_t n,
idx_t* dest_ids,
float* dest_dis) {
try {
reinterpret_cast<BufferList*>(bl)->copy_range(
ofs, n, dest_ids, dest_dis);
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_GETTER(RangeQueryResult, idx_t, qno)
DEFINE_GETTER(RangeQueryResult, size_t, nres)
DEFINE_GETTER_PERMISSIVE(RangeQueryResult, FaissRangeSearchPartialResult*, pres)
int faiss_RangeQueryResult_add(FaissRangeQueryResult* qr, float dis, idx_t id) {
try {
reinterpret_cast<RangeQueryResult*>(qr)->add(dis, id);
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_GETTER_PERMISSIVE(RangeSearchPartialResult, FaissRangeSearchResult*, res)
int faiss_RangeSearchPartialResult_new(
FaissRangeSearchPartialResult** p_res,
FaissRangeSearchResult* res_in) {
try {
*p_res = reinterpret_cast<FaissRangeSearchPartialResult*>(
new RangeSearchPartialResult(
reinterpret_cast<RangeSearchResult*>(res_in)));
return 0;
}
CATCH_AND_HANDLE
}
int faiss_RangeSearchPartialResult_finalize(
FaissRangeSearchPartialResult* res) {
try {
reinterpret_cast<RangeSearchPartialResult*>(res)->finalize();
return 0;
}
CATCH_AND_HANDLE
}
/// called by range_search before do_allocation
int faiss_RangeSearchPartialResult_set_lims(
FaissRangeSearchPartialResult* res) {
try {
reinterpret_cast<RangeSearchPartialResult*>(res)->set_lims();
return 0;
}
CATCH_AND_HANDLE
}
int faiss_RangeSearchPartialResult_new_result(
FaissRangeSearchPartialResult* res,
idx_t qno,
FaissRangeQueryResult** qr) {
try {
auto q = &reinterpret_cast<RangeSearchPartialResult*>(res)->new_result(
qno);
if (qr) {
*qr = reinterpret_cast<FaissRangeQueryResult*>(&q);
}
return 0;
}
CATCH_AND_HANDLE
}
DEFINE_DESTRUCTOR(DistanceComputer)
int faiss_DistanceComputer_set_query(
FaissDistanceComputer* dc,
const float* x) {
try {
reinterpret_cast<DistanceComputer*>(dc)->set_query(x);
return 0;
}
CATCH_AND_HANDLE
}
int faiss_DistanceComputer_vector_to_query_dis(
FaissDistanceComputer* dc,
idx_t i,
float* qd) {
try {
*qd = reinterpret_cast<DistanceComputer*>(dc)->operator()(i);
return 0;
}
CATCH_AND_HANDLE
}
int faiss_DistanceComputer_symmetric_dis(
FaissDistanceComputer* dc,
idx_t i,
idx_t j,
float* vd) {
try {
*vd = reinterpret_cast<DistanceComputer*>(dc)->symmetric_dis(i, j);
return 0;
}
CATCH_AND_HANDLE
}
|