faiss 0.1.3 → 0.2.0

data/vendor/faiss/c_api/gpu/macros_impl.h

@@ -1,42 +0,0 @@
-/**
- * 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.
- */
-
-// Copyright 2004-present Facebook. All Rights Reserved.
-// -*- c++ -*-
-
-#ifndef GPU_MACROS_IMPL_H
-#define GPU_MACROS_IMPL_H
-#include "../macros_impl.h"
-
-#undef DEFINE_GETTER
-#define DEFINE_GETTER(clazz, ty, name)                               \
-    ty faiss_ ## clazz ## _ ## name (const Faiss ## clazz *obj) {    \
-        return static_cast< ty >(                                    \
-            reinterpret_cast< const faiss::gpu::clazz *>(obj)-> name \
-        );                                                           \
-    }
-
-#undef DEFINE_SETTER
-#define DEFINE_SETTER(clazz, ty, name)                                    \
-    void faiss_ ## clazz ## _set_ ## name (Faiss ## clazz *obj, ty val) { \
-        reinterpret_cast< faiss::gpu::clazz *>(obj)-> name = val;              \
-    }
-
-#undef DEFINE_SETTER_STATIC
-#define DEFINE_SETTER_STATIC(clazz, ty_to, ty_from, name)                      \
-    void faiss_ ## clazz ## _set_ ## name (Faiss ## clazz *obj, ty_from val) { \
-        reinterpret_cast< faiss::gpu::clazz *>(obj)-> name =                   \
-            static_cast< ty_to >(val);                                         \
-    }
-
-#undef DEFINE_DESTRUCTOR
-#define DEFINE_DESTRUCTOR(clazz)                           \
-    void faiss_ ## clazz ## _free (Faiss ## clazz *obj) {  \
-        delete reinterpret_cast<faiss::gpu::clazz *>(obj); \
-    }
-
-#endif

data/vendor/faiss/c_api/impl/AuxIndexStructures_c.cpp

@@ -1,220 +0,0 @@
-/**
- * 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.
- */
-
-// Copyright 2004-present Facebook. All Rights Reserved.
-// -*- c++ -*-
-
-#include "AuxIndexStructures_c.h"
-#include "../../impl/AuxIndexStructures.h"
-#include "../macros_impl.h"
-#include <iostream>
-
-using faiss::BufferList;
-using faiss::IDSelector;
-using faiss::IDSelectorBatch;
-using faiss::IDSelectorRange;
-using faiss::RangeSearchResult;
-using faiss::RangeSearchPartialResult;
-using faiss::RangeQueryResult;
-using faiss::DistanceComputer;
-
-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
-}
-
-// 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
-}

data/vendor/faiss/c_api/impl/AuxIndexStructures_c.h

@@ -1,149 +0,0 @@
-/**
- * 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.
- */
-
-// Copyright 2004-present Facebook. All Rights Reserved.
-// -*- c -*-
-
-#ifndef FAISS_AUX_INDEX_STRUCTURES_C_H
-#define FAISS_AUX_INDEX_STRUCTURES_C_H
-
-#include "../Index_c.h"
-#include "../faiss_c.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-FAISS_DECLARE_CLASS(RangeSearchResult)
-
-FAISS_DECLARE_GETTER(RangeSearchResult, size_t, nq)
-
-int faiss_RangeSearchResult_new(FaissRangeSearchResult** p_rsr, idx_t nq);
-
-int faiss_RangeSearchResult_new_with(FaissRangeSearchResult** p_rsr, idx_t nq, int alloc_lims);
-
-/// called when lims contains the nb of elements result entries
-/// for each query
-int faiss_RangeSearchResult_do_allocation(FaissRangeSearchResult* rsr);
-
-FAISS_DECLARE_DESTRUCTOR(RangeSearchResult)
-
-/// getter for buffer_size
-FAISS_DECLARE_GETTER(RangeSearchResult, size_t, buffer_size)
-
-/// getter for lims: size (nq + 1)
-void faiss_RangeSearchResult_lims(
-    FaissRangeSearchResult* rsr, size_t** 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);
-
-
-/** Encapsulates a set of ids to remove. */
-FAISS_DECLARE_CLASS(IDSelector)
-FAISS_DECLARE_DESTRUCTOR(IDSelector)
-
-int faiss_IDSelector_is_member(const FaissIDSelector* sel, idx_t id);
-
-/** remove ids between [imni, imax) */
-FAISS_DECLARE_CLASS(IDSelectorRange)
-FAISS_DECLARE_DESTRUCTOR(IDSelectorRange)
-
-FAISS_DECLARE_GETTER(IDSelectorRange, idx_t, imin)
-FAISS_DECLARE_GETTER(IDSelectorRange, idx_t, imax)
-
-int faiss_IDSelectorRange_new(FaissIDSelectorRange** p_sel, idx_t imin, idx_t imax);
-
-/** Remove ids from a set. Repetitions of ids in the indices set
- * passed to the constructor does not hurt performance. The hash
- * function used for the bloom filter and GCC's implementation of
- * unordered_set are just the least significant bits of the id. This
- * works fine for random ids or ids in sequences but will produce many
- * hash collisions if lsb's are always the same */
-FAISS_DECLARE_CLASS(IDSelectorBatch)
-
-FAISS_DECLARE_GETTER(IDSelectorBatch, int, nbits)
-FAISS_DECLARE_GETTER(IDSelectorBatch, idx_t, mask)
-
-int faiss_IDSelectorBatch_new(FaissIDSelectorBatch** p_sel, size_t n, const idx_t* indices);
-
-// Below are structures used only by Index implementations
-
-/** List of temporary buffers used to store results before they are
- *  copied to the RangeSearchResult object. */
-FAISS_DECLARE_CLASS(BufferList)
-FAISS_DECLARE_DESTRUCTOR(BufferList)
-
-FAISS_DECLARE_GETTER(BufferList, size_t, buffer_size)
-FAISS_DECLARE_GETTER(BufferList, size_t, wp)
-
-typedef struct FaissBuffer {
-    idx_t *ids;
-    float *dis;
-} FaissBuffer;
-
-int faiss_BufferList_append_buffer(FaissBufferList* bl);
-
-int faiss_BufferList_new(FaissBufferList** p_bl, size_t buffer_size);
-
-int faiss_BufferList_add(FaissBufferList* bl, idx_t id, float dis);
-
-/// 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);
-
-/// the entries in the buffers are split per query
-FAISS_DECLARE_CLASS(RangeSearchPartialResult)
-
-/// result structure for a single query
-FAISS_DECLARE_CLASS(RangeQueryResult)
-FAISS_DECLARE_GETTER(RangeQueryResult, idx_t, qno)
-FAISS_DECLARE_GETTER(RangeQueryResult, size_t, nres)
-FAISS_DECLARE_GETTER(RangeQueryResult, FaissRangeSearchPartialResult*, pres)
-
-int faiss_RangeQueryResult_add(FaissRangeQueryResult* qr, float dis, idx_t id);
-
-
-FAISS_DECLARE_GETTER(RangeSearchPartialResult, FaissRangeSearchResult*, res)
-
-int faiss_RangeSearchPartialResult_new(
-    FaissRangeSearchPartialResult** p_res, FaissRangeSearchResult* res_in);
-
-int faiss_RangeSearchPartialResult_finalize(
-    FaissRangeSearchPartialResult* res);
-
-/// called by range_search before do_allocation
-int faiss_RangeSearchPartialResult_set_lims(
-    FaissRangeSearchPartialResult* res);
-
-int faiss_RangeSearchPartialResult_new_result(
-    FaissRangeSearchPartialResult* res, idx_t qno, FaissRangeQueryResult** qr);
-
-
-FAISS_DECLARE_CLASS(DistanceComputer)
-/// called before computing distances
-int faiss_DistanceComputer_set_query(FaissDistanceComputer *dc, const float *x);
-
-/**
- * Compute distance of vector i to current query.
- * This function corresponds to the function call operator: DistanceComputer::operator()
- */
-int faiss_DistanceComputer_vector_to_query_dis( FaissDistanceComputer *dc, idx_t i, float *qd);
-/// compute distance between two stored vectors
-int faiss_DistanceComputer_symmetric_dis(FaissDistanceComputer *dc, idx_t i, idx_t j, float *vd);
-
-FAISS_DECLARE_DESTRUCTOR(DistanceComputer)
-
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif

data/vendor/faiss/c_api/index_factory_c.cpp

@@ -1,26 +0,0 @@
-/**
- * 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.
- */
-
-// Copyright 2004-present Facebook. All Rights Reserved.
-// -*- c++ -*-
-
-#include <cstring>
-#include "index_factory.h"
-#include "index_factory_c.h"
-#include "macros_impl.h"
-
-using faiss::Index;
-
-/** Build and index with the sequence of processing steps described in
- *  the string.
- */
-int faiss_index_factory(FaissIndex** p_index, int d, const char* description, FaissMetricType metric) {
-    try {
-        *p_index = reinterpret_cast<FaissIndex*>(faiss::index_factory(
-            d, description, static_cast<faiss::MetricType>(metric)));
-    } CATCH_AND_HANDLE
-}

data/vendor/faiss/c_api/index_factory_c.h

@@ -1,30 +0,0 @@
-/**
- * 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.
- */
-
-// Copyright 2004-present Facebook. All Rights Reserved.
-// -*- c -*-
-
-#ifndef FAISS_INDEX_FACTORY_C_H
-#define FAISS_INDEX_FACTORY_C_H
-
-#include "faiss_c.h"
-#include "Index_c.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/** Build and index with the sequence of processing steps described in
- *  the string.
- */
-int faiss_index_factory(FaissIndex** p_index, int d, const char* description, FaissMetricType metric);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif