diff --git a/AutoTune.cpp b/AutoTune.cpp index a3f2117ce..2c6a2b938 100644 --- a/AutoTune.cpp +++ b/AutoTune.cpp @@ -51,23 +51,23 @@ OneRecallAtRCriterion::OneRecallAtRCriterion (idx_t nq, idx_t R): AutoTuneCriterion(nq, R), R(R) {} -double OneRecallAtRCriterion::evaluate (const float *D, const idx_t *I) const -{ - FAISS_THROW_IF_NOT_MSG ( - (gt_I.size() == gt_nnn * nq && gt_nnn >= 1 && nnn >= R), - "ground truth not initialized"); - idx_t n_ok = 0; - for (idx_t q = 0; q < nq; q++) { - idx_t gt_nn = gt_I [q * gt_nnn]; - const idx_t *I_line = I + q * nnn; - for (int i = 0; i < R; i++) { - if (I_line[i] == gt_nn) { - n_ok++; - break; - } - } +double OneRecallAtRCriterion::evaluate(const float* /*D*/, const idx_t* I) + const { + FAISS_THROW_IF_NOT_MSG( + (gt_I.size() == gt_nnn * nq && gt_nnn >= 1 && nnn >= R), + "ground truth not initialized"); + idx_t n_ok = 0; + for (idx_t q = 0; q < nq; q++) { + idx_t gt_nn = gt_I[q * gt_nnn]; + const idx_t* I_line = I + q * nnn; + for (int i = 0; i < R; i++) { + if (I_line[i] == gt_nn) { + n_ok++; + break; + } } - return n_ok / double (nq); + } + return n_ok / double(nq); } @@ -75,12 +75,12 @@ IntersectionCriterion::IntersectionCriterion (idx_t nq, idx_t R): AutoTuneCriterion(nq, R), R(R) {} -double IntersectionCriterion::evaluate (const float *D, const idx_t *I) const -{ - FAISS_THROW_IF_NOT_MSG ( - (gt_I.size() == gt_nnn * nq && gt_nnn >= R && nnn >= R), - "ground truth not initialized"); - long n_ok = 0; +double IntersectionCriterion::evaluate(const float* /*D*/, const idx_t* I) + const { + FAISS_THROW_IF_NOT_MSG( + (gt_I.size() == gt_nnn * nq && gt_nnn >= R && nnn >= R), + "ground truth not initialized"); + long n_ok = 0; #pragma omp parallel for reduction(+: n_ok) for (idx_t q = 0; q < nq; q++) { n_ok += ranklist_intersection_size ( diff --git a/Index.cpp b/Index.cpp index 7c520079b..8fdfdf788 100644 --- a/Index.cpp +++ b/Index.cpp @@ -27,15 +27,14 @@ void Index::assign (idx_t n, const float * x, idx_t * labels, idx_t k) search (n, x, k, distances, labels); } - -void Index::add_with_ids (idx_t n, const float * x, const long *xids) -{ +void Index::add_with_ids( + idx_t /*n*/, + const float* /*x*/, + const long* /*xids*/) { FAISS_THROW_MSG ("add_with_ids not implemented for this type of index"); } - -long Index::remove_ids (const IDSelector & sel) -{ +long Index::remove_ids(const IDSelector& /*sel*/) { FAISS_THROW_MSG ("remove_ids not implemented for this type of index"); return -1; } diff --git a/Index.h b/Index.h index ce435cc54..4f55e5723 100644 --- a/Index.h +++ b/Index.h @@ -86,8 +86,8 @@ struct Index { * @param n nb of training vectors * @param x training vecors, size n * d */ - virtual void train (idx_t n, const float *x) { - // does nothing by default + virtual void train(idx_t /*n*/, const float* /*x*/) { + // does nothing by default } /** Add n vectors of dimension d to the index. diff --git a/IndexIVF.cpp b/IndexIVF.cpp index d1f8d476a..c08a03ae9 100644 --- a/IndexIVF.cpp +++ b/IndexIVF.cpp @@ -128,11 +128,10 @@ void IndexIVF::train (idx_t n, const float *x) is_trained = true; } -void IndexIVF::train_residual (idx_t n, const float *x) -{ - if (verbose) - printf ("IndexIVF: no residual training\n"); - // does nothing by default +void IndexIVF::train_residual(idx_t /*n*/, const float* /*x*/) { + if (verbose) + printf("IndexIVF: no residual training\n"); + // does nothing by default } diff --git a/IndexIVFPQ.cpp b/IndexIVFPQ.cpp index 4d61c1683..c837f8910 100644 --- a/IndexIVFPQ.cpp +++ b/IndexIVFPQ.cpp @@ -1368,8 +1368,7 @@ void IndexIVFPQR::merge_from_residuals (IndexIVF &other_in) other.refine_codes.clear(); } -long IndexIVFPQR::remove_ids (const IDSelector & sel) -{ +long IndexIVFPQR::remove_ids(const IDSelector& /*sel*/) { FAISS_THROW_MSG("not implemented"); return 0; } diff --git a/IndexPQ.cpp b/IndexPQ.cpp index 808f471ca..0a39ee83a 100644 --- a/IndexPQ.cpp +++ b/IndexPQ.cpp @@ -786,6 +786,7 @@ MultiIndexQuantizer::MultiIndexQuantizer (int d, Index(d, METRIC_L2), pq(d, M, nbits) { is_trained = false; + pq.verbose = verbose; } @@ -880,11 +881,10 @@ void MultiIndexQuantizer::reconstruct (idx_t key, float * recons) const } else FAISS_THROW_MSG( "only 1 or 2 bytes per index supported"); } - -void MultiIndexQuantizer::add (idx_t n, const float *x) -{ - FAISS_THROW_MSG ( "This index has virtual elements, " - "it does not support add"); +void MultiIndexQuantizer::add(idx_t /*n*/, const float* /*x*/) { + FAISS_THROW_MSG( + "This index has virtual elements, " + "it does not support add"); } void MultiIndexQuantizer::reset () diff --git a/MetaIndexes.cpp b/MetaIndexes.cpp index c2042c1c5..04dd1cf2b 100644 --- a/MetaIndexes.cpp +++ b/MetaIndexes.cpp @@ -607,9 +607,8 @@ void IndexSplitVectors::sync_with_sub_indexes () } -void IndexSplitVectors::add (idx_t n, const float *x) -{ - FAISS_THROW_MSG ("not implemented"); +void IndexSplitVectors::add(idx_t /*n*/, const float* /*x*/) { + FAISS_THROW_MSG("not implemented"); } namespace { @@ -709,10 +708,8 @@ void IndexSplitVectors::search ( } - -void IndexSplitVectors::train (idx_t n, const float *x) -{ - FAISS_THROW_MSG ("not implemented"); +void IndexSplitVectors::train(idx_t /*n*/, const float* /*x*/) { + FAISS_THROW_MSG("not implemented"); } void IndexSplitVectors::reset () diff --git a/docs/html/AutoTune_8cpp_source.html b/docs/html/AutoTune_8cpp_source.html index 860971b16..bed528cd9 100644 --- a/docs/html/AutoTune_8cpp_source.html +++ b/docs/html/AutoTune_8cpp_source.html @@ -136,23 +136,23 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
51  AutoTuneCriterion(nq, R), R(R)
52 {}
53 
-
54 double OneRecallAtRCriterion::evaluate (const float *D, const idx_t *I) const
-
55 {
-
56  FAISS_THROW_IF_NOT_MSG (
-
57  (gt_I.size() == gt_nnn * nq && gt_nnn >= 1 && nnn >= R),
-
58  "ground truth not initialized");
-
59  idx_t n_ok = 0;
-
60  for (idx_t q = 0; q < nq; q++) {
-
61  idx_t gt_nn = gt_I [q * gt_nnn];
-
62  const idx_t *I_line = I + q * nnn;
-
63  for (int i = 0; i < R; i++) {
-
64  if (I_line[i] == gt_nn) {
-
65  n_ok++;
-
66  break;
-
67  }
-
68  }
-
69  }
-
70  return n_ok / double (nq);
+
54 double OneRecallAtRCriterion::evaluate(const float* /*D*/, const idx_t* I)
+
55  const {
+
56  FAISS_THROW_IF_NOT_MSG(
+
57  (gt_I.size() == gt_nnn * nq && gt_nnn >= 1 && nnn >= R),
+
58  "ground truth not initialized");
+
59  idx_t n_ok = 0;
+
60  for (idx_t q = 0; q < nq; q++) {
+
61  idx_t gt_nn = gt_I[q * gt_nnn];
+
62  const idx_t* I_line = I + q * nnn;
+
63  for (int i = 0; i < R; i++) {
+
64  if (I_line[i] == gt_nn) {
+
65  n_ok++;
+
66  break;
+
67  }
+
68  }
+
69  }
+
70  return n_ok / double(nq);
71 }
72 
73 
@@ -160,12 +160,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
75  AutoTuneCriterion(nq, R), R(R)
76 {}
77 
-
78 double IntersectionCriterion::evaluate (const float *D, const idx_t *I) const
-
79 {
-
80  FAISS_THROW_IF_NOT_MSG (
-
81  (gt_I.size() == gt_nnn * nq && gt_nnn >= R && nnn >= R),
-
82  "ground truth not initialized");
-
83  long n_ok = 0;
+
78 double IntersectionCriterion::evaluate(const float* /*D*/, const idx_t* I)
+
79  const {
+
80  FAISS_THROW_IF_NOT_MSG(
+
81  (gt_I.size() == gt_nnn * nq && gt_nnn >= R && nnn >= R),
+
82  "ground truth not initialized");
+
83  long n_ok = 0;
84 #pragma omp parallel for reduction(+: n_ok)
85  for (idx_t q = 0; q < nq; q++) {
86  n_ok += ranklist_intersection_size (
@@ -805,9 +805,9 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
720  }
721  } else if (!index && (stok == "SQ8" || stok == "SQ4")) {
722  ScalarQuantizer::QuantizerType qt =
-
723  stok == "SQ8" ? ScalarQuantizer::QT_8bit :
-
724  stok == "SQ4" ? ScalarQuantizer::QT_4bit :
-
725  ScalarQuantizer::QT_4bit;
+
723  stok == "SQ8" ? ScalarQuantizer::QT_8bit :
+
724  stok == "SQ4" ? ScalarQuantizer::QT_4bit :
+
725  ScalarQuantizer::QT_4bit;
726  if (coarse_quantizer) {
727  IndexIVFScalarQuantizer *index_ivf =
728  new IndexIVFScalarQuantizer (
@@ -922,7 +922,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVF
Definition: IndexIVF.h:45
faiss::ParameterSpace::parameter_ranges
std::vector< ParameterRange > parameter_ranges
all tunable parameters
Definition: AutoTune.h:134
faiss::OperatingPoint::key
std::string key
key that identifies this op pt
Definition: AutoTune.h:89
-
faiss::ScalarQuantizer::QuantizerType
QuantizerType
Definition: IndexIVFScalarQuantizer.h:36
+
faiss::ScalarQuantizer::QuantizerType
QuantizerType
Definition: IndexScalarQuantizer.h:32
faiss::IndexFlat
Definition: IndexFlat.h:23
faiss::OperatingPoint::cno
long cno
integer identifer
Definition: AutoTune.h:90
faiss::IndexIVFPQR
Definition: IndexIVFPQ.h:198
@@ -933,6 +933,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::OperatingPoints::display
void display(bool only_optimal=true) const
easy-to-read output
Definition: AutoTune.cpp:221
faiss::IndexPQ
Definition: IndexPQ.h:28
faiss::OperatingPoint::perf
double perf
performance measure (output of a Criterion)
Definition: AutoTune.h:87
+
faiss::ScalarQuantizer::QT_4bit
4 bits per component
Definition: IndexScalarQuantizer.h:34
faiss::OperatingPoints
Definition: AutoTune.h:93
faiss::OperatingPoints::t_for_perf
double t_for_perf(double perf) const
get time required to obtain a given performance measure
Definition: AutoTune.cpp:174
faiss::AutoTuneCriterion::nnn
idx_t nnn
nb of NNs that the query should request
Definition: AutoTune.h:29
@@ -969,12 +970,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::verbose
bool verbose
verbosity level
Definition: Index.h:66
faiss::getmillisecs
double getmillisecs()
ms elapsed since some arbitrary epoch
Definition: utils.cpp:70
faiss::AutoTuneCriterion::gt_D
std::vector< float > gt_D
Ground-truth distances (size nq * gt_nnn)
Definition: AutoTune.h:32
-
faiss::IndexIVFScalarQuantizer
Definition: IndexIVFScalarQuantizer.h:86
+
faiss::IndexIVFScalarQuantizer
Definition: IndexScalarQuantizer.h:129
faiss::ParameterSpace::combination_name
std::string combination_name(size_t cno) const
get string representation of the combination
Definition: AutoTune.cpp:277
faiss::Index::search
virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0
faiss::MultiIndexQuantizer
Definition: IndexPQ.h:135
faiss::ParameterSpace::update_bounds
void update_bounds(size_t cno, const OperatingPoint &op, double *upper_bound_perf, double *lower_bound_t) const
Definition: AutoTune.cpp:501
-
faiss::ScalarQuantizer::QT_8bit
8 bits per component
Definition: IndexIVFScalarQuantizer.h:37
faiss::VectorTransform
Definition: VectorTransform.h:28
faiss::IndexPreTransform::own_fields
bool own_fields
! the sub-index
Definition: VectorTransform.h:244
faiss::ParameterSpace::initialize
virtual void initialize(const Index *index)
initialize with reasonable parameters for the index
Definition: AutoTune.cpp:331
@@ -984,7 +984,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::ParameterSpace::n_combinations
size_t n_combinations() const
nb of combinations, = product of values sizes
Definition: AutoTune.cpp:268
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
faiss::ParameterSpace::set_index_parameters
void set_index_parameters(Index *index, size_t cno) const
set a combination of parameters on an index
Definition: AutoTune.cpp:389
-
faiss::ScalarQuantizer::QT_4bit
4 bits per component
Definition: IndexIVFScalarQuantizer.h:38
+
faiss::ScalarQuantizer::QT_8bit
8 bits per component
Definition: IndexScalarQuantizer.h:33
faiss::Index
Definition: Index.h:60
faiss::IndexPQ::ST_PQ
asymmetric product quantizer (default)
Definition: IndexPQ.h:76
faiss::ParameterSpace::display
void display() const
print a description on stdout
Definition: AutoTune.cpp:483
diff --git a/docs/html/Clustering_8cpp_source.html b/docs/html/Clustering_8cpp_source.html index 3ef3aa772..7d009b374 100644 --- a/docs/html/Clustering_8cpp_source.html +++ b/docs/html/Clustering_8cpp_source.html @@ -234,7 +234,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
149  fvec_renorm_L2 (d, k, cur_centroids.data());
150 
151  if (!index.is_trained)
-
152  index.train (k, cur_centroids.data());
+
152  index.train (k, cur_centroids.data());
153 
154  FAISS_THROW_IF_NOT (index.ntotal == 0);
155  index.add (k, cur_centroids.data());
@@ -267,7 +267,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
182 
183  index.reset ();
184  if (update_index)
-
185  index.train (k, cur_centroids.data());
+
185  index.train (k, cur_centroids.data());
186 
187  assert (index.ntotal == 0);
188  index.add (k, cur_centroids.data());
@@ -305,6 +305,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::ClusteringParameters::nredo
int nredo
redo clustering this many times and keep best
Definition: Clustering.h:26
faiss::ClusteringParameters::ClusteringParameters
ClusteringParameters()
sets reasonable defaults
Definition: Clustering.cpp:27
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::IndexFlatL2
Definition: IndexFlat.h:79
faiss::Clustering::Clustering
Clustering(int d, int k)
the only mandatory parameters are k and d
Definition: Clustering.cpp:39
faiss::Clustering::k
size_t k
nb of centroids
Definition: Clustering.h:59
@@ -325,7 +326,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index
Definition: Index.h:60
faiss::Clustering::train
virtual void train(idx_t n, const float *x, faiss::Index &index)
Index is used during the assignment stage.
Definition: Clustering.cpp:66
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
faiss::ClusteringParameters::spherical
bool spherical
do we want normalized centroids?
Definition: Clustering.h:29
faiss::ClusteringParameters::max_points_per_centroid
int max_points_per_centroid
to limit size of dataset
Definition: Clustering.h:33
diff --git a/docs/html/FlatIndex_8cu_source.html b/docs/html/FlatIndex_8cu_source.html index 64f26c4f7..8020c350c 100644 --- a/docs/html/FlatIndex_8cu_source.html +++ b/docs/html/FlatIndex_8cu_source.html @@ -205,8 +205,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
116  Tensor<int, 2, true>& outIndices,
117  bool exactDistance,
118  int tileSize) {
-
119  auto stream = resources_->getDefaultStreamCurrentDevice();
-
120  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
119  auto stream = resources_->getDefaultStreamCurrentDevice();
+
120  auto& mem = resources_->getMemoryManagerCurrentDevice();
121 
122  if (useFloat16_) {
123  // We need to convert to float16
@@ -368,7 +368,9 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
279 
280 } }
faiss::gpu::FlatIndex::getVectorsFloat32Copy
DeviceTensor< float, 2, true > getVectorsFloat32Copy(cudaStream_t stream)
Definition: FlatIndex.cu:91
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::FlatIndex::getSize
int getSize() const
Returns the number of vectors we contain.
Definition: FlatIndex.cu:47
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
faiss::gpu::Tensor::copyTo
__host__ void copyTo(Tensor< T, Dim, Contig, IndexT, PtrTraits > &t, cudaStream_t stream)
Copies ourselves into a tensor; sizes must match.
Definition: Tensor-inl.cuh:139
faiss::gpu::FlatIndex::reserve
void reserve(size_t numVecs, cudaStream_t stream)
Reserve storage that can contain at least this many vectors.
Definition: FlatIndex.cu:68
faiss::gpu::FlatIndex::add
void add(const float *data, int numVecs, cudaStream_t stream)
Definition: FlatIndex.cu:201
diff --git a/docs/html/GpuIndexFlat_8cu_source.html b/docs/html/GpuIndexFlat_8cu_source.html index bfb01454f..a811d6efd 100644 --- a/docs/html/GpuIndexFlat_8cu_source.html +++ b/docs/html/GpuIndexFlat_8cu_source.html @@ -201,7 +201,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
112  if (index->ntotal > 0) {
113  data_->add(index->xb.data(),
114  index->ntotal,
-
115  resources_->getDefaultStream(device_));
+
115  resources_->getDefaultStream(device_));
116  }
117 }
118 
@@ -216,7 +216,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
127  FAISS_ASSERT(data_->getSize() == this->ntotal);
128  index->xb.resize(this->ntotal * this->d);
129 
-
130  auto stream = resources_->getDefaultStream(device_);
+
130  auto stream = resources_->getDefaultStream(device_);
131 
132  if (this->ntotal > 0) {
133  if (config_.useFloat16) {
@@ -253,7 +253,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
164 
165  // To avoid multiple re-allocations, ensure we have enough storage
166  // available
-
167  data_->reserve(n, resources_->getDefaultStream(device_));
+
167  data_->reserve(n, resources_->getDefaultStream(device_));
168 
169  // If we're not operating in float16 mode, we don't need the input
170  // data to be resident on our device; we can add directly.
@@ -282,7 +282,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
193  "GPU index only supports up to %zu indices",
194  (size_t) std::numeric_limits<int>::max());
195 
-
196  data_->add(x, n, resources_->getDefaultStream(device_));
+
196  data_->add(x, n, resources_->getDefaultStream(device_));
197  this->ntotal += n;
198 }
199 
@@ -310,7 +310,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
221  (int) k); // select limitation
222 
223  DeviceScope scope(device_);
-
224  auto stream = resources_->getDefaultStream(device_);
+
224  auto stream = resources_->getDefaultStream(device_);
225 
226  // The input vectors may be too large for the GPU, but we still
227  // assume that the output distances and labels are not.
@@ -391,7 +391,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
302  Tensor<float, 2, true> outDistances(outDistancesData, {n, k});
303  Tensor<int, 2, true> outIndices(outIndicesData, {n, k});
304 
-
305  auto stream = resources_->getDefaultStream(device_);
+
305  auto stream = resources_->getDefaultStream(device_);
306 
307  // Make sure arguments are on the device we desire; use temporary
308  // memory allocations to move it if necessary
@@ -709,6 +709,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::GpuIndexConfig::device
int device
GPU device on which the index is resident.
Definition: GpuIndex.h:27
faiss::gpu::GpuIndex
Definition: GpuIndex.h:35
faiss::gpu::GpuIndexFlatL2::GpuIndexFlatL2
GpuIndexFlatL2(GpuResources *resources, faiss::IndexFlatL2 *index, GpuIndexFlatConfig config=GpuIndexFlatConfig())
Definition: GpuIndexFlat.cu:549
+
faiss::gpu::GpuResources::getDefaultStream
virtual cudaStream_t getDefaultStream(int device)=0
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::gpu::GpuIndexFlatConfig
Definition: GpuIndexFlat.h:27
faiss::gpu::IntToLong
Definition: GpuIndexFlat.cu:200
diff --git a/docs/html/GpuIndexIVFFlat_8cu_source.html b/docs/html/GpuIndexIVFFlat_8cu_source.html index 1848a3e69..304cd850a 100644 --- a/docs/html/GpuIndexIVFFlat_8cu_source.html +++ b/docs/html/GpuIndexIVFFlat_8cu_source.html @@ -296,7 +296,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
207  FAISS_ASSERT(index_);
208  FAISS_ASSERT(n > 0);
209 
-
210  auto stream = resources_->getDefaultStreamCurrentDevice();
+
210  auto stream = resources_->getDefaultStreamCurrentDevice();
211 
212  auto deviceVecs =
213  toDevice<float, 2>(resources_,
@@ -362,6 +362,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
273 } } // namespace
faiss::gpu::IVFFlat
Definition: IVFFlat.cuh:17
faiss::gpu::GpuIndexIVFFlat::GpuIndexIVFFlat
GpuIndexIVFFlat(GpuResources *resources, const faiss::IndexIVFFlat *index, GpuIndexIVFFlatConfig config=GpuIndexIVFFlatConfig())
Definition: GpuIndexIVFFlat.cu:25
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::GpuIndexIVFFlat::searchImpl_
void searchImpl_(faiss::Index::idx_t n, const float *x, faiss::Index::idx_t k, float *distances, faiss::Index::idx_t *labels) const override
Called from GpuIndex for search.
Definition: GpuIndexIVFFlat.cu:233
faiss::gpu::IVFBase::getDim
int getDim() const
Return the number of dimensions we are indexing.
Definition: IVFBase.cu:100
faiss::gpu::GpuIndexFlat::getGpuData
FlatIndex * getGpuData()
For internal access.
Definition: GpuIndexFlat.h:120
diff --git a/docs/html/GpuIndexIVFPQ_8cu_source.html b/docs/html/GpuIndexIVFPQ_8cu_source.html index 449c86cc5..0ce51697f 100644 --- a/docs/html/GpuIndexIVFPQ_8cu_source.html +++ b/docs/html/GpuIndexIVFPQ_8cu_source.html @@ -272,7 +272,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
183 
184  fromDevice<float, 3>(devPQCentroids,
185  index->pq.centroids.data(),
-
186  resources_->getDefaultStream(device_));
+
186  resources_->getDefaultStream(device_));
187 
188  if (ivfpqConfig_.usePrecomputedTables) {
189  index->precompute_table();
@@ -413,7 +413,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
324  FAISS_ASSERT(index_);
325  FAISS_ASSERT(n > 0);
326 
-
327  auto stream = resources_->getDefaultStreamCurrentDevice();
+
327  auto stream = resources_->getDefaultStreamCurrentDevice();
328 
329  auto deviceVecs =
330  toDevice<float, 2>(resources_,
@@ -568,6 +568,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQ::precompute_table
void precompute_table()
build precomputed table
Definition: IndexIVFPQ.cpp:391
faiss::gpu::GpuIndexIVFPQ::reset
void reset() override
Definition: GpuIndexIVFPQ.cu:245
faiss::ProductQuantizer::nbits
size_t nbits
number of bits per quantization index
Definition: ProductQuantizer.h:29
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::GpuIndexIVFPQConfig::usePrecomputedTables
bool usePrecomputedTables
Definition: GpuIndexIVFPQ.h:36
faiss::IndexIVFPQ::polysemous_training
PolysemousTraining * polysemous_training
if NULL, use default
Definition: IndexIVFPQ.h:36
faiss::ProductQuantizer::byte_per_idx
size_t byte_per_idx
nb bytes per code component (1 or 2)
Definition: ProductQuantizer.h:33
@@ -585,6 +586,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::GpuResources
Definition: GpuResources.h:23
faiss::gpu::GpuIndexIVFPQ::getBitsPerCode
int getBitsPerCode() const
Return the number of bits per PQ code.
Definition: GpuIndexIVFPQ.cu:225
faiss::gpu::GpuIndexIVFPQConfig::useFloat16LookupTables
bool useFloat16LookupTables
Definition: GpuIndexIVFPQ.h:32
+
faiss::gpu::GpuResources::getDefaultStream
virtual cudaStream_t getDefaultStream(int device)=0
faiss::IndexIVF::ids
std::vector< std::vector< long > > ids
Inverted lists for indexes.
Definition: IndexIVF.h:55
faiss::gpu::GpuIndexIVF
Definition: GpuIndexIVF.h:37
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
@@ -627,7 +629,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::ProductQuantizer
Definition: ProductQuantizer.h:25
faiss::gpu::GpuIndexIVF::copyFrom
void copyFrom(const faiss::IndexIVF *index)
Copy what we need from the CPU equivalent.
Definition: GpuIndexIVF.cu:80
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:58
+
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:57
faiss::gpu::GpuIndexIVFPQ::getPrecomputedCodes
bool getPrecomputedCodes() const
Are pre-computed codes enabled?
Definition: GpuIndexIVFPQ.cu:215
faiss::gpu::GpuIndexIVFConfig::indicesOptions
IndicesOptions indicesOptions
Index storage options for the GPU.
Definition: GpuIndexIVF.h:31
faiss::gpu::IVFBase::reclaimMemory
size_t reclaimMemory()
Definition: IVFBase.cu:105
diff --git a/docs/html/GpuResources_8cpp_source.html b/docs/html/GpuResources_8cpp_source.html index be86d152d..454bc0b88 100644 --- a/docs/html/GpuResources_8cpp_source.html +++ b/docs/html/GpuResources_8cpp_source.html @@ -106,31 +106,54 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
17 }
18 
19 cublasHandle_t
-
20 GpuResources::getBlasHandleCurrentDevice() {
-
21  return getBlasHandle(getCurrentDevice());
+
20 GpuResources::getBlasHandleCurrentDevice() {
+
21  return getBlasHandle(getCurrentDevice());
22 }
23 
24 cudaStream_t
-
25 GpuResources::getDefaultStreamCurrentDevice() {
-
26  return getDefaultStream(getCurrentDevice());
+
25 GpuResources::getDefaultStreamCurrentDevice() {
+
26  return getDefaultStream(getCurrentDevice());
27 }
28 
29 std::vector<cudaStream_t>
-
30 GpuResources::getAlternateStreamsCurrentDevice() {
-
31  return getAlternateStreams(getCurrentDevice());
+
30 GpuResources::getAlternateStreamsCurrentDevice() {
+
31  return getAlternateStreams(getCurrentDevice());
32 }
33 
-
34 DeviceMemory&
-
35 GpuResources::getMemoryManagerCurrentDevice() {
-
36  return getMemoryManager(getCurrentDevice());
+
34 DeviceMemory&
+
35 GpuResources::getMemoryManagerCurrentDevice() {
+
36  return getMemoryManager(getCurrentDevice());
37 }
38 
39 cudaStream_t
-
40 GpuResources::getAsyncCopyStreamCurrentDevice() {
-
41  return getAsyncCopyStream(getCurrentDevice());
+
40 GpuResources::getAsyncCopyStreamCurrentDevice() {
+
41  return getAsyncCopyStream(getCurrentDevice());
42 }
43 
-
44 } } // namespace
+
44 void
+
45 GpuResources::syncDefaultStream(int device) {
+
46  CUDA_VERIFY(cudaStreamSynchronize(getDefaultStream(device)));
+
47 }
+
48 
+
49 void
+
50 GpuResources::syncDefaultStreamCurrentDevice() {
+
51  syncDefaultStream(getCurrentDevice());
+
52 }
+
53 
+
54 } } // namespace
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
+
faiss::gpu::GpuResources::getBlasHandle
virtual cublasHandle_t getBlasHandle(int device)=0
Returns the cuBLAS handle that we use for the given device.
+
faiss::gpu::GpuResources::getDefaultStream
virtual cudaStream_t getDefaultStream(int device)=0
+
faiss::gpu::GpuResources::getBlasHandleCurrentDevice
cublasHandle_t getBlasHandleCurrentDevice()
Calls getBlasHandle with the current device.
Definition: GpuResources.cpp:20
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
+
faiss::gpu::GpuResources::syncDefaultStreamCurrentDevice
void syncDefaultStreamCurrentDevice()
Calls syncDefaultStream for the current device.
Definition: GpuResources.cpp:50
+
faiss::gpu::GpuResources::getAsyncCopyStreamCurrentDevice
cudaStream_t getAsyncCopyStreamCurrentDevice()
Calls getAsyncCopyStream for the current device.
Definition: GpuResources.cpp:40
+
faiss::gpu::GpuResources::getAlternateStreamsCurrentDevice
std::vector< cudaStream_t > getAlternateStreamsCurrentDevice()
Calls getAlternateStreams for the current device.
Definition: GpuResources.cpp:30
+
faiss::gpu::GpuResources::getAsyncCopyStream
virtual cudaStream_t getAsyncCopyStream(int device)=0
Returns the stream on which we perform async CPU &lt;-&gt; GPU copies.
+
faiss::gpu::GpuResources::syncDefaultStream
void syncDefaultStream(int device)
Definition: GpuResources.cpp:45
+
faiss::gpu::GpuResources::getMemoryManager
virtual DeviceMemory & getMemoryManager(int device)=0
Returns the temporary memory manager for the given device.
+
faiss::gpu::DeviceMemory
Manages temporary memory allocations on a GPU device.
Definition: DeviceMemory.h:46
+
faiss::gpu::GpuResources::getAlternateStreams
virtual std::vector< cudaStream_t > getAlternateStreams(int device)=0
Returns the set of alternative streams that we use for the given device.
diff --git a/docs/html/GpuResources_8h_source.html b/docs/html/GpuResources_8h_source.html index 4e28597f0..de5e031eb 100644 --- a/docs/html/GpuResources_8h_source.html +++ b/docs/html/GpuResources_8h_source.html @@ -117,34 +117,67 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
28  /// not called, then resources will be allocated at the first time
29  /// of demand
30  virtual void initializeForDevice(int device) = 0;
-
31 
-
32  virtual cublasHandle_t getBlasHandle(int device) = 0;
-
33 
-
34  virtual cudaStream_t getDefaultStream(int device) = 0;
-
35 
-
36  virtual std::vector<cudaStream_t> getAlternateStreams(int device) = 0;
-
37 
-
38  virtual DeviceMemory& getMemoryManager(int device) = 0;
-
39 
-
40  virtual std::pair<void*, size_t> getPinnedMemory() = 0;
-
41 
-
42  virtual cudaStream_t getAsyncCopyStream(int device) = 0;
-
43 
-
44  cublasHandle_t getBlasHandleCurrentDevice();
-
45 
-
46  cudaStream_t getDefaultStreamCurrentDevice();
-
47 
-
48  std::vector<cudaStream_t> getAlternateStreamsCurrentDevice();
-
49 
-
50  DeviceMemory& getMemoryManagerCurrentDevice();
-
51 
-
52  cudaStream_t getAsyncCopyStreamCurrentDevice();
-
53 };
-
54 
-
55 } } // namespace
+
31 
+
32  /// Returns the cuBLAS handle that we use for the given device
+
33  virtual cublasHandle_t getBlasHandle(int device) = 0;
+
34 
+
35  /// Returns the stream that we order all computation on for the
+
36  /// given device
+
37  virtual cudaStream_t getDefaultStream(int device) = 0;
+
38 
+
39  /// Returns the set of alternative streams that we use for the given device
+
40  virtual std::vector<cudaStream_t> getAlternateStreams(int device) = 0;
+
41 
+
42  /// Returns the temporary memory manager for the given device
+
43  virtual DeviceMemory& getMemoryManager(int device) = 0;
+
44 
+
45  /// Returns the available CPU pinned memory buffer
+
46  virtual std::pair<void*, size_t> getPinnedMemory() = 0;
+
47 
+
48  /// Returns the stream on which we perform async CPU <-> GPU copies
+
49  virtual cudaStream_t getAsyncCopyStream(int device) = 0;
+
50 
+
51  /// Calls getBlasHandle with the current device
+
52  cublasHandle_t getBlasHandleCurrentDevice();
+
53 
+
54  /// Calls getDefaultStream with the current device
+
55  cudaStream_t getDefaultStreamCurrentDevice();
+
56 
+
57  /// Synchronizes the CPU with respect to the default stream for the
+
58  /// given device
+
59  // equivalent to cudaDeviceSynchronize(getDefaultStream(device))
+
60  void syncDefaultStream(int device);
+
61 
+
62  /// Calls syncDefaultStream for the current device
+
63  void syncDefaultStreamCurrentDevice();
+
64 
+
65  /// Calls getAlternateStreams for the current device
+
66  std::vector<cudaStream_t> getAlternateStreamsCurrentDevice();
+
67 
+
68  /// Calls getMemoryManager for the current device
+
69  DeviceMemory& getMemoryManagerCurrentDevice();
+
70 
+
71  /// Calls getAsyncCopyStream for the current device
+
72  cudaStream_t getAsyncCopyStreamCurrentDevice();
+
73 };
+
74 
+
75 } } // namespace
faiss::gpu::GpuResources::initializeForDevice
virtual void initializeForDevice(int device)=0
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
+
faiss::gpu::GpuResources::getBlasHandle
virtual cublasHandle_t getBlasHandle(int device)=0
Returns the cuBLAS handle that we use for the given device.
+
faiss::gpu::GpuResources::getDefaultStream
virtual cudaStream_t getDefaultStream(int device)=0
+
faiss::gpu::GpuResources::getBlasHandleCurrentDevice
cublasHandle_t getBlasHandleCurrentDevice()
Calls getBlasHandle with the current device.
Definition: GpuResources.cpp:20
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
+
faiss::gpu::GpuResources::syncDefaultStreamCurrentDevice
void syncDefaultStreamCurrentDevice()
Calls syncDefaultStream for the current device.
Definition: GpuResources.cpp:50
+
faiss::gpu::GpuResources::getAsyncCopyStreamCurrentDevice
cudaStream_t getAsyncCopyStreamCurrentDevice()
Calls getAsyncCopyStream for the current device.
Definition: GpuResources.cpp:40
+
faiss::gpu::GpuResources::getAlternateStreamsCurrentDevice
std::vector< cudaStream_t > getAlternateStreamsCurrentDevice()
Calls getAlternateStreams for the current device.
Definition: GpuResources.cpp:30
+
faiss::gpu::GpuResources::getAsyncCopyStream
virtual cudaStream_t getAsyncCopyStream(int device)=0
Returns the stream on which we perform async CPU &lt;-&gt; GPU copies.
+
faiss::gpu::GpuResources::syncDefaultStream
void syncDefaultStream(int device)
Definition: GpuResources.cpp:45
+
faiss::gpu::GpuResources::getMemoryManager
virtual DeviceMemory & getMemoryManager(int device)=0
Returns the temporary memory manager for the given device.
faiss::gpu::DeviceMemory
Manages temporary memory allocations on a GPU device.
Definition: DeviceMemory.h:46
+
faiss::gpu::GpuResources::getPinnedMemory
virtual std::pair< void *, size_t > getPinnedMemory()=0
Returns the available CPU pinned memory buffer.
+
faiss::gpu::GpuResources::getAlternateStreams
virtual std::vector< cudaStream_t > getAlternateStreams(int device)=0
Returns the set of alternative streams that we use for the given device.
diff --git a/docs/html/IVFBase_8cu_source.html b/docs/html/IVFBase_8cu_source.html index f3a8a3b7f..69e3ebc4b 100644 --- a/docs/html/IVFBase_8cu_source.html +++ b/docs/html/IVFBase_8cu_source.html @@ -137,7 +137,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
48  return;
49  }
50 
-
51  auto stream = resources_->getDefaultStreamCurrentDevice();
+
51  auto stream = resources_->getDefaultStreamCurrentDevice();
52 
53  size_t bytesPerDataList = vecsPerList * bytesPerVector_;
54  for (auto& list : deviceListData_) {
@@ -198,7 +198,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
109 
110 size_t
111 IVFBase::reclaimMemory_(bool exact) {
-
112  auto stream = resources_->getDefaultStreamCurrentDevice();
+
112  auto stream = resources_->getDefaultStreamCurrentDevice();
113 
114  size_t totalReclaimed = 0;
115 
@@ -236,7 +236,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
147 void
148 IVFBase::updateDeviceListInfo_(const std::vector<int>& listIds,
149  cudaStream_t stream) {
-
150  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
150  auto& mem = resources_->getMemoryManagerCurrentDevice();
151 
152  HostTensor<int, 1, true>
153  hostListsToUpdate({(int) listIds.size()});
@@ -300,7 +300,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
211  FAISS_ASSERT(listId < deviceListIndices_.size());
212 
213  auto intInd = deviceListIndices_[listId]->copyToHost<int>(
-
214  resources_->getDefaultStreamCurrentDevice());
+
214  resources_->getDefaultStreamCurrentDevice());
215 
216  std::vector<long> out(intInd.size());
217  for (size_t i = 0; i < intInd.size(); ++i) {
@@ -312,7 +312,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
223  FAISS_ASSERT(listId < deviceListIndices_.size());
224 
225  return deviceListIndices_[listId]->copyToHost<long>(
-
226  resources_->getDefaultStreamCurrentDevice());
+
226  resources_->getDefaultStreamCurrentDevice());
227  } else if (indicesOptions_ == INDICES_CPU) {
228  FAISS_ASSERT(listId < deviceListData_.size());
229  FAISS_ASSERT(listId < listOffsetToUserIndex_.size());
@@ -334,7 +334,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
245 IVFBase::addIndicesFromCpu_(int listId,
246  const long* indices,
247  size_t numVecs) {
-
248  auto stream = resources_->getDefaultStreamCurrentDevice();
+
248  auto stream = resources_->getDefaultStreamCurrentDevice();
249 
250  auto& listIndices = deviceListIndices_[listId];
251  auto prevIndicesData = listIndices->data();
@@ -376,6 +376,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
287 } } // namespace
faiss::gpu::IVFBase::numLists_
const int numLists_
Number of inverted lists we maintain.
Definition: IVFBase.cuh:91
faiss::gpu::IVFBase::maxListLength_
int maxListLength_
Maximum list length seen.
Definition: IVFBase.cuh:115
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::IVFBase::IVFBase
IVFBase(GpuResources *resources, FlatIndex *quantizer, int bytesPerVector, IndicesOptions indicesOptions, MemorySpace space)
Definition: IVFBase.cu:25
faiss::gpu::IVFBase::listOffsetToUserIndex_
std::vector< std::vector< long > > listOffsetToUserIndex_
Definition: IVFBase.cuh:127
faiss::gpu::FlatIndex
Holder of GPU resources for a particular flat index.
Definition: FlatIndex.cuh:23
@@ -387,6 +388,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::IVFBase::deviceListLengths_
thrust::device_vector< int > deviceListLengths_
Definition: IVFBase.cuh:112
faiss::gpu::IVFBase::deviceListIndexPointers_
thrust::device_vector< void * > deviceListIndexPointers_
Definition: IVFBase.cuh:108
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
faiss::gpu::IVFBase::deviceListDataPointers_
thrust::device_vector< void * > deviceListDataPointers_
Definition: IVFBase.cuh:104
faiss::gpu::IVFBase::resources_
GpuResources * resources_
Collection of GPU resources that we use.
Definition: IVFBase.cuh:82
diff --git a/docs/html/IVFFlat_8cu_source.html b/docs/html/IVFFlat_8cu_source.html index 533578584..081a4b878 100644 --- a/docs/html/IVFFlat_8cu_source.html +++ b/docs/html/IVFFlat_8cu_source.html @@ -150,7 +150,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
61  size_t numVecs) {
62  // This list must already exist
63  FAISS_ASSERT(listId < deviceListData_.size());
-
64  auto stream = resources_->getDefaultStreamCurrentDevice();
+
64  auto stream = resources_->getDefaultStreamCurrentDevice();
65 
66  // If there's nothing to add, then there's nothing we have to do
67  if (numVecs == 0) {
@@ -221,8 +221,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
132  FAISS_ASSERT(vecs.getSize(0) == indices.getSize(0));
133  FAISS_ASSERT(vecs.getSize(1) == dim_);
134 
-
135  auto& mem = resources_->getMemoryManagerCurrentDevice();
-
136  auto stream = resources_->getDefaultStreamCurrentDevice();
+
135  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
136  auto stream = resources_->getDefaultStreamCurrentDevice();
137 
138  // Number of valid vectors that we actually add; we return this
139  int numAdded = 0;
@@ -379,8 +379,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
290  int k,
291  Tensor<float, 2, true>& outDistances,
292  Tensor<long, 2, true>& outIndices) {
-
293  auto& mem = resources_->getMemoryManagerCurrentDevice();
-
294  auto stream = resources_->getDefaultStreamCurrentDevice();
+
293  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
294  auto stream = resources_->getDefaultStreamCurrentDevice();
295 
296  // Validate these at a top level
297  FAISS_ASSERT(nprobe <= 1024);
@@ -444,7 +444,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
355  FAISS_ASSERT(listId < deviceListData_.size());
356  auto& encVecs = *deviceListData_[listId];
357 
-
358  auto stream = resources_->getDefaultStreamCurrentDevice();
+
358  auto stream = resources_->getDefaultStreamCurrentDevice();
359 
360  if (useFloat16_) {
361 #ifdef FAISS_USE_FLOAT16
@@ -475,6 +475,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
386 } } // namespace
faiss::gpu::IVFBase::numLists_
const int numLists_
Number of inverted lists we maintain.
Definition: IVFBase.cuh:91
faiss::gpu::IVFBase::maxListLength_
int maxListLength_
Maximum list length seen.
Definition: IVFBase.cuh:115
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::FlatIndex::getSize
int getSize() const
Returns the number of vectors we contain.
Definition: FlatIndex.cu:47
faiss::gpu::IVFBase::listOffsetToUserIndex_
std::vector< std::vector< long > > listOffsetToUserIndex_
Definition: IVFBase.cuh:127
faiss::gpu::FlatIndex
Holder of GPU resources for a particular flat index.
Definition: FlatIndex.cuh:23
@@ -485,6 +486,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::IVFBase::deviceListLengths_
thrust::device_vector< int > deviceListLengths_
Definition: IVFBase.cuh:112
faiss::gpu::IVFBase::deviceListIndexPointers_
thrust::device_vector< void * > deviceListIndexPointers_
Definition: IVFBase.cuh:108
faiss::gpu::IVFFlat::classifyAndAddVectors
int classifyAndAddVectors(Tensor< float, 2, true > &vecs, Tensor< long, 1, true > &indices)
Definition: IVFFlat.cu:130
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
faiss::gpu::IVFBase::quantizer_
FlatIndex * quantizer_
Quantizer object.
Definition: IVFBase.cuh:85
faiss::gpu::IVFBase::deviceListDataPointers_
thrust::device_vector< void * > deviceListDataPointers_
Definition: IVFBase.cuh:104
faiss::gpu::IVFBase::resources_
GpuResources * resources_
Collection of GPU resources that we use.
Definition: IVFBase.cuh:82
diff --git a/docs/html/IVFPQ_8cu_source.html b/docs/html/IVFPQ_8cu_source.html index 043f6538c..f7288447f 100644 --- a/docs/html/IVFPQ_8cu_source.html +++ b/docs/html/IVFPQ_8cu_source.html @@ -213,8 +213,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
124 
125  FAISS_ASSERT(!quantizer_->getUseFloat16());
126  auto& coarseCentroids = quantizer_->getVectorsFloat32Ref();
-
127  auto& mem = resources_->getMemoryManagerCurrentDevice();
-
128  auto stream = resources_->getDefaultStreamCurrentDevice();
+
127  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
128  auto stream = resources_->getDefaultStreamCurrentDevice();
129 
130  // Number of valid vectors that we actually add; we return this
131  int numAdded = 0;
@@ -441,7 +441,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
352  size_t numVecs) {
353  // This list must already exist
354  FAISS_ASSERT(listId < deviceListData_.size());
-
355  auto stream = resources_->getDefaultStreamCurrentDevice();
+
355  auto stream = resources_->getDefaultStreamCurrentDevice();
356 
357  // If there's nothing to add, then there's nothing we have to do
358  if (numVecs == 0) {
@@ -482,7 +482,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
393 
394  // device_vector add is potentially happening on a different stream
395  // than our default stream
-
396  if (resources_->getDefaultStreamCurrentDevice() != 0) {
+
396  if (resources_->getDefaultStreamCurrentDevice() != 0) {
397  streamWait({stream}, {0});
398  }
399 }
@@ -502,12 +502,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
413  {numSubQuantizers_, numSubQuantizerCodes_, dimPerSubQuantizer_});
414  DeviceTensor<float, 3, true> pqDevice(
415  pqHost,
-
416  resources_->getDefaultStreamCurrentDevice());
+
416  resources_->getDefaultStreamCurrentDevice());
417 
418  DeviceTensor<float, 3, true> pqDeviceTranspose(
419  {numSubQuantizers_, dimPerSubQuantizer_, numSubQuantizerCodes_});
420  runTransposeAny(pqDevice, 1, 2, pqDeviceTranspose,
-
421  resources_->getDefaultStreamCurrentDevice());
+
421  resources_->getDefaultStreamCurrentDevice());
422 
423  pqCentroidsInnermostCode_ = std::move(pqDeviceTranspose);
424 
@@ -516,7 +516,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
427  DeviceTensor<float, 3, true> pqCentroidsMiddleCode(
428  {numSubQuantizers_, numSubQuantizerCodes_, dimPerSubQuantizer_});
429  runTransposeAny(pqCentroidsInnermostCode_, 1, 2, pqCentroidsMiddleCode,
-
430  resources_->getDefaultStreamCurrentDevice());
+
430  resources_->getDefaultStreamCurrentDevice());
431 
432  pqCentroidsMiddleCode_ = std::move(pqCentroidsMiddleCode);
433 }
@@ -543,7 +543,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
454  {numSubQuantizers_ * numSubQuantizerCodes_});
455 
456  runL2Norm(pqCentroidsMiddleCodeView, subQuantizerNorms, true,
-
457  resources_->getDefaultStreamCurrentDevice());
+
457  resources_->getDefaultStreamCurrentDevice());
458 
459  // Compute 2 * (y_C|y_R) via batch matrix multiplication
460  // batch size (sub q) x {(centroid id)(sub dim) x (code id)(sub dim)'}
@@ -560,7 +560,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
471  {numSubQuantizers_, coarseCentroids.getSize(0), dimPerSubQuantizer_});
472 
473  runTransposeAny(centroidView, 0, 1, centroidsTransposed,
-
474  resources_->getDefaultStreamCurrentDevice());
+
474  resources_->getDefaultStreamCurrentDevice());
475 
476  DeviceTensor<float, 3, true> coarsePQProduct(
477  {numSubQuantizers_, coarseCentroids.getSize(0), numSubQuantizerCodes_});
@@ -569,15 +569,15 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
480  centroidsTransposed, false,
481  pqCentroidsMiddleCode_, true,
482  2.0f, 0.0f,
-
483  resources_->getBlasHandleCurrentDevice(),
-
484  resources_->getDefaultStreamCurrentDevice());
+
483  resources_->getBlasHandleCurrentDevice(),
+
484  resources_->getDefaultStreamCurrentDevice());
485 
486  // Transpose (sub q)(centroid id)(code id) to
487  // (centroid id)(sub q)(code id)
488  DeviceTensor<float, 3, true> coarsePQProductTransposed(
489  {coarseCentroids.getSize(0), numSubQuantizers_, numSubQuantizerCodes_});
490  runTransposeAny(coarsePQProduct, 0, 1, coarsePQProductTransposed,
-
491  resources_->getDefaultStreamCurrentDevice());
+
491  resources_->getDefaultStreamCurrentDevice());
492 
493  // View (centroid id)(sub q)(code id) as
494  // (centroid id)(sub q * code id)
@@ -588,12 +588,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
499  // i.e., add norms (sub q * code id)
500  // along columns of inner product (centroid id)(sub q * code id)
501  runSumAlongColumns(subQuantizerNorms, coarsePQProductTransposedView,
-
502  resources_->getDefaultStreamCurrentDevice());
+
502  resources_->getDefaultStreamCurrentDevice());
503 
504 #ifdef FAISS_USE_FLOAT16
505  if (useFloat16LookupTables_) {
506  precomputedCodeHalf_ = toHalf(resources_,
-
507  resources_->getDefaultStreamCurrentDevice(),
+
507  resources_->getDefaultStreamCurrentDevice(),
508  coarsePQProductTransposed);
509  return;
510  }
@@ -614,8 +614,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
525  FAISS_ASSERT(nprobe <= 1024);
526  FAISS_ASSERT(k <= 1024);
527 
-
528  auto& mem = resources_->getMemoryManagerCurrentDevice();
-
529  auto stream = resources_->getDefaultStreamCurrentDevice();
+
528  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
529  auto stream = resources_->getDefaultStreamCurrentDevice();
530  nprobe = std::min(nprobe, quantizer_->getSize());
531 
532  FAISS_ASSERT(queries.getSize(1) == dim_);
@@ -676,7 +676,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
587  FAISS_ASSERT(listId < deviceListData_.size());
588 
589  return deviceListData_[listId]->copyToHost<unsigned char>(
-
590  resources_->getDefaultStreamCurrentDevice());
+
590  resources_->getDefaultStreamCurrentDevice());
591 }
592 
593 Tensor<float, 3, true>
@@ -692,8 +692,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
603  int k,
604  Tensor<float, 2, true>& outDistances,
605  Tensor<long, 2, true>& outIndices) {
-
606  auto& mem = resources_->getMemoryManagerCurrentDevice();
-
607  auto stream = resources_->getDefaultStreamCurrentDevice();
+
606  auto& mem = resources_->getMemoryManagerCurrentDevice();
+
607  auto stream = resources_->getDefaultStreamCurrentDevice();
608 
609  // Compute precomputed code term 3, - 2 * (x|y_R)
610  // This is done via batch MM
@@ -724,7 +724,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
635  queriesTransposed, false,
636  pqCentroidsMiddleCode_, true,
637  -2.0f, 0.0f,
-
638  resources_->getBlasHandleCurrentDevice(),
+
638  resources_->getBlasHandleCurrentDevice(),
639  stream);
640 
641  runTransposeAny(term3, 0, 1, term3Transposed, stream);
@@ -800,6 +800,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
711 } } // namespace
faiss::gpu::IVFBase::numLists_
const int numLists_
Number of inverted lists we maintain.
Definition: IVFBase.cuh:91
faiss::gpu::IVFBase::maxListLength_
int maxListLength_
Maximum list length seen.
Definition: IVFBase.cuh:115
+
faiss::gpu::GpuResources::getDefaultStreamCurrentDevice
cudaStream_t getDefaultStreamCurrentDevice()
Calls getDefaultStream with the current device.
Definition: GpuResources.cpp:25
faiss::gpu::IVFPQ::addCodeVectorsFromCpu
void addCodeVectorsFromCpu(int listId, const void *codes, const long *indices, size_t numVecs)
Definition: IVFPQ.cu:349
faiss::gpu::FlatIndex::getSize
int getSize() const
Returns the number of vectors we contain.
Definition: FlatIndex.cu:47
faiss::gpu::IVFBase::listOffsetToUserIndex_
std::vector< std::vector< long > > listOffsetToUserIndex_
Definition: IVFBase.cuh:127
@@ -810,6 +811,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::IVFBase::deviceListLengths_
thrust::device_vector< int > deviceListLengths_
Definition: IVFBase.cuh:112
faiss::gpu::IVFPQ::isSupportedPQCodeLength
static bool isSupportedPQCodeLength(int size)
Returns true if we support PQ in this size.
Definition: IVFPQ.cu:72
faiss::gpu::IVFBase::deviceListIndexPointers_
thrust::device_vector< void * > deviceListIndexPointers_
Definition: IVFBase.cuh:108
+
faiss::gpu::GpuResources::getBlasHandleCurrentDevice
cublasHandle_t getBlasHandleCurrentDevice()
Calls getBlasHandle with the current device.
Definition: GpuResources.cpp:20
+
faiss::gpu::GpuResources::getMemoryManagerCurrentDevice
DeviceMemory & getMemoryManagerCurrentDevice()
Calls getMemoryManager for the current device.
Definition: GpuResources.cpp:35
faiss::gpu::IVFPQ::classifyAndAddVectors
int classifyAndAddVectors(Tensor< float, 2, true > &vecs, Tensor< long, 1, true > &indices)
Definition: IVFPQ.cu:120
faiss::gpu::IVFPQ::query
void query(Tensor< float, 2, true > &queries, int nprobe, int k, Tensor< float, 2, true > &outDistances, Tensor< long, 2, true > &outIndices)
Definition: IVFPQ.cu:519
faiss::gpu::IVFPQ::getPQCentroids
Tensor< float, 3, true > getPQCentroids()
Definition: IVFPQ.cu:594
diff --git a/docs/html/IndexFlat_8cpp_source.html b/docs/html/IndexFlat_8cpp_source.html index 3ded6459f..e92ee5f81 100644 --- a/docs/html/IndexFlat_8cpp_source.html +++ b/docs/html/IndexFlat_8cpp_source.html @@ -255,7 +255,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
170 
171 void IndexRefineFlat::train (idx_t n, const float *x)
172 {
-
173  base_index->train (n, x);
+
173  base_index->train (n, x);
174  is_trained = true;
175 }
176 
@@ -489,6 +489,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
faiss::IndexFlat1D::continuous_update
bool continuous_update
is the permutation updated continuously?
Definition: IndexFlat.h:139
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::IndexFlat::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexFlat.cpp:42
@@ -521,7 +522,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::knn_L2sqr
void knn_L2sqr(const float *x, const float *y, size_t d, size_t nx, size_t ny, float_maxheap_array_t *res)
Definition: utils.cpp:935
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
faiss::IndexFlat::xb
std::vector< float > xb
database vectors, size ntotal * d
Definition: IndexFlat.h:25
faiss::IndexFlat1D::reset
void reset() override
removes all elements from the database.
Definition: IndexFlat.cpp:301
diff --git a/docs/html/IndexIVFPQ_8cpp_source.html b/docs/html/IndexIVFPQ_8cpp_source.html index b9a31e583..7b8b85e80 100644 --- a/docs/html/IndexIVFPQ_8cpp_source.html +++ b/docs/html/IndexIVFPQ_8cpp_source.html @@ -1453,220 +1453,219 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
1368  other.refine_codes.clear();
1369 }
1370 
-
1371 long IndexIVFPQR::remove_ids (const IDSelector & sel)
-
1372 {
-
1373  FAISS_THROW_MSG("not implemented");
-
1374  return 0;
-
1375 }
-
1376 
-
1377 /*****************************************
-
1378  * IndexIVFPQCompact implementation
-
1379  ******************************************/
-
1380 
-
1381 IndexIVFPQCompact::IndexIVFPQCompact ()
-
1382 {
-
1383  alloc_type = Alloc_type_none;
-
1384  limits = nullptr;
-
1385  compact_ids = nullptr;
-
1386  compact_codes = nullptr;
-
1387 }
+
1371 long IndexIVFPQR::remove_ids(const IDSelector& /*sel*/) {
+
1372  FAISS_THROW_MSG("not implemented");
+
1373  return 0;
+
1374 }
+
1375 
+
1376 /*****************************************
+
1377  * IndexIVFPQCompact implementation
+
1378  ******************************************/
+
1379 
+
1380 IndexIVFPQCompact::IndexIVFPQCompact ()
+
1381 {
+
1382  alloc_type = Alloc_type_none;
+
1383  limits = nullptr;
+
1384  compact_ids = nullptr;
+
1385  compact_codes = nullptr;
+
1386 }
+
1387 
1388 
-
1389 
-
1390 IndexIVFPQCompact::IndexIVFPQCompact (const IndexIVFPQ &other)
-
1391 {
-
1392  FAISS_THROW_IF_NOT_MSG (other.ntotal < (1UL << 31),
-
1393  "IndexIVFPQCompact cannot store more than 2G images");
-
1394 
-
1395  // here it would be more convenient to just use the
-
1396  // copy-constructor, but it would copy the lists as well: too much
-
1397  // overhead...
-
1398 
-
1399  // copy fields from Index
-
1400  d = other.d;
-
1401  ntotal = other.ntotal;
-
1402  verbose = other.verbose;
-
1403  is_trained = other.is_trained;
-
1404  metric_type = other.metric_type;
-
1405 
-
1406  // copy fields from IndexIVF (except ids)
-
1407  nlist = other.nlist;
-
1408  nprobe = other.nprobe;
-
1409  quantizer = other.quantizer;
-
1410  quantizer_trains_alone = other.quantizer_trains_alone;
-
1411  own_fields = false;
-
1412  direct_map = other.direct_map;
-
1413 
-
1414  // copy fields from IndexIVFPQ (except codes)
-
1415  by_residual = other.by_residual;
-
1416  use_precomputed_table = other.use_precomputed_table;
-
1417  precomputed_table = other.precomputed_table;
-
1418  code_size = other.code_size;
-
1419  pq = other.pq;
-
1420  do_polysemous_training = other.do_polysemous_training;
-
1421  polysemous_training = nullptr;
-
1422 
-
1423  scan_table_threshold = other.scan_table_threshold;
-
1424  max_codes = other.max_codes;
-
1425  polysemous_ht = other.polysemous_ht;
-
1426 
-
1427  //allocate
-
1428  alloc_type = Alloc_type_new;
-
1429  limits = new uint32_t [nlist + 1];
-
1430  compact_ids = new uint32_t [ntotal];
-
1431  compact_codes = new uint8_t [ntotal * code_size];
+
1389 IndexIVFPQCompact::IndexIVFPQCompact (const IndexIVFPQ &other)
+
1390 {
+
1391  FAISS_THROW_IF_NOT_MSG (other.ntotal < (1UL << 31),
+
1392  "IndexIVFPQCompact cannot store more than 2G images");
+
1393 
+
1394  // here it would be more convenient to just use the
+
1395  // copy-constructor, but it would copy the lists as well: too much
+
1396  // overhead...
+
1397 
+
1398  // copy fields from Index
+
1399  d = other.d;
+
1400  ntotal = other.ntotal;
+
1401  verbose = other.verbose;
+
1402  is_trained = other.is_trained;
+
1403  metric_type = other.metric_type;
+
1404 
+
1405  // copy fields from IndexIVF (except ids)
+
1406  nlist = other.nlist;
+
1407  nprobe = other.nprobe;
+
1408  quantizer = other.quantizer;
+
1409  quantizer_trains_alone = other.quantizer_trains_alone;
+
1410  own_fields = false;
+
1411  direct_map = other.direct_map;
+
1412 
+
1413  // copy fields from IndexIVFPQ (except codes)
+
1414  by_residual = other.by_residual;
+
1415  use_precomputed_table = other.use_precomputed_table;
+
1416  precomputed_table = other.precomputed_table;
+
1417  code_size = other.code_size;
+
1418  pq = other.pq;
+
1419  do_polysemous_training = other.do_polysemous_training;
+
1420  polysemous_training = nullptr;
+
1421 
+
1422  scan_table_threshold = other.scan_table_threshold;
+
1423  max_codes = other.max_codes;
+
1424  polysemous_ht = other.polysemous_ht;
+
1425 
+
1426  //allocate
+
1427  alloc_type = Alloc_type_new;
+
1428  limits = new uint32_t [nlist + 1];
+
1429  compact_ids = new uint32_t [ntotal];
+
1430  compact_codes = new uint8_t [ntotal * code_size];
+
1431 
1432 
-
1433 
-
1434  // copy content from other
-
1435  size_t ofs = 0;
-
1436  for (size_t i = 0; i < nlist; i++) {
-
1437  limits [i] = ofs;
-
1438  const std::vector<long> &other_ids = other.ids[i];
-
1439  for (size_t j = 0; j < other_ids.size(); j++) {
-
1440  long id = other_ids[j];
-
1441  FAISS_THROW_IF_NOT_MSG (id < (1UL << 31),
-
1442  "IndexIVFPQCompact cannot store ids > 2G");
-
1443  compact_ids[ofs + j] = id;
-
1444  }
-
1445  memcpy (compact_codes + ofs * code_size,
-
1446  other.codes[i].data(),
-
1447  other.codes[i].size());
-
1448  ofs += other_ids.size();
-
1449  }
-
1450  FAISS_THROW_IF_NOT (ofs == ntotal);
-
1451  limits [nlist] = ofs;
-
1452 
-
1453 }
-
1454 
-
1455 void IndexIVFPQCompact::add (idx_t, const float *) {
-
1456  FAISS_THROW_MSG ("cannot add to an IndexIVFPQCompact");
-
1457 }
-
1458 
-
1459 void IndexIVFPQCompact::reset () {
-
1460  FAISS_THROW_MSG ("cannot reset an IndexIVFPQCompact");
-
1461 }
-
1462 
-
1463 void IndexIVFPQCompact::train (idx_t, const float *) {
-
1464  FAISS_THROW_MSG ("cannot train an IndexIVFPQCompact");
-
1465 }
+
1433  // copy content from other
+
1434  size_t ofs = 0;
+
1435  for (size_t i = 0; i < nlist; i++) {
+
1436  limits [i] = ofs;
+
1437  const std::vector<long> &other_ids = other.ids[i];
+
1438  for (size_t j = 0; j < other_ids.size(); j++) {
+
1439  long id = other_ids[j];
+
1440  FAISS_THROW_IF_NOT_MSG (id < (1UL << 31),
+
1441  "IndexIVFPQCompact cannot store ids > 2G");
+
1442  compact_ids[ofs + j] = id;
+
1443  }
+
1444  memcpy (compact_codes + ofs * code_size,
+
1445  other.codes[i].data(),
+
1446  other.codes[i].size());
+
1447  ofs += other_ids.size();
+
1448  }
+
1449  FAISS_THROW_IF_NOT (ofs == ntotal);
+
1450  limits [nlist] = ofs;
+
1451 
+
1452 }
+
1453 
+
1454 void IndexIVFPQCompact::add (idx_t, const float *) {
+
1455  FAISS_THROW_MSG ("cannot add to an IndexIVFPQCompact");
+
1456 }
+
1457 
+
1458 void IndexIVFPQCompact::reset () {
+
1459  FAISS_THROW_MSG ("cannot reset an IndexIVFPQCompact");
+
1460 }
+
1461 
+
1462 void IndexIVFPQCompact::train (idx_t, const float *) {
+
1463  FAISS_THROW_MSG ("cannot train an IndexIVFPQCompact");
+
1464 }
+
1465 
1466 
1467 
1468 
-
1469 
-
1470 IndexIVFPQCompact::~IndexIVFPQCompact ()
-
1471 {
-
1472  if (alloc_type == Alloc_type_new) {
-
1473  delete [] limits;
-
1474  delete [] compact_codes;
-
1475  delete [] compact_ids;
-
1476  } else if (alloc_type == Alloc_type_mmap) {
-
1477  munmap (mmap_buffer, mmap_length);
-
1478 
-
1479  }
-
1480 
-
1481 }
-
1482 
-
1483 void IndexIVFPQCompact::search_knn_with_key (
-
1484  size_t nx,
-
1485  const float * qx,
-
1486  const long * keys,
-
1487  const float * coarse_dis,
-
1488  float_maxheap_array_t * res,
-
1489  bool store_pairs) const
-
1490 {
-
1491  const size_t k = res->k;
-
1492 
-
1493 #pragma omp parallel
-
1494  {
-
1495  InvertedListScanner<uint32_t> qt (*this);
-
1496  size_t stats_nlist = 0;
-
1497  size_t stats_ncode = 0;
-
1498  uint64_t init_query_cycles = 0;
-
1499  uint64_t scan_cycles = 0;
-
1500  uint64_t heap_cycles = 0;
-
1501 
-
1502 #pragma omp for
-
1503  for (size_t i = 0; i < nx; i++) {
-
1504  const float *qi = qx + i * d;
-
1505  const long * keysi = keys + i * nprobe;
-
1506  const float *coarse_dis_i = coarse_dis + i * nprobe;
-
1507  float * heap_sim = res->get_val (i);
-
1508  long * heap_ids = res->get_ids (i);
-
1509 
-
1510  uint64_t t0;
-
1511  TIC;
-
1512  maxheap_heapify (k, heap_sim, heap_ids);
-
1513  heap_cycles += TOC;
-
1514 
-
1515  TIC;
-
1516  qt.init_query (qi);
-
1517  init_query_cycles += TOC;
-
1518 
-
1519  size_t nscan = 0;
-
1520 
-
1521  for (size_t ik = 0; ik < nprobe; ik++) {
-
1522  long key = keysi[ik]; /* select the list */
-
1523  if (key < 0) {
-
1524  // not enough centroids for multiprobe
-
1525  continue;
-
1526  }
-
1527  if (key >= (long) nlist) {
-
1528  fprintf (stderr, "Invalid key=%ld nlist=%ld\n", key, nlist);
-
1529  throw;
-
1530  }
-
1531  size_t list_size = limits[key + 1] - limits[key];
-
1532  stats_nlist ++;
-
1533  nscan += list_size;
-
1534 
-
1535  if (list_size == 0) continue;
-
1536 
-
1537  qt.init_list (key, coarse_dis_i[ik],
-
1538  list_size, compact_ids + limits[key],
-
1539  compact_codes + limits[key] * code_size);
-
1540 
-
1541  TIC;
-
1542  if (polysemous_ht > 0) {
-
1543  qt.scan_list_polysemous
-
1544  (k, heap_sim, heap_ids, store_pairs);
-
1545  } else if (list_size > scan_table_threshold) {
-
1546  qt.scan_list_with_table (k, heap_sim, heap_ids, store_pairs);
-
1547  } else {
-
1548  qt.scan_on_the_fly_dist (k, heap_sim, heap_ids, store_pairs);
-
1549  }
-
1550  scan_cycles += TOC;
-
1551 
-
1552  if (max_codes && nscan >= max_codes) break;
-
1553  }
-
1554  stats_ncode += nscan;
-
1555  TIC;
-
1556  maxheap_reorder (k, heap_sim, heap_ids);
-
1557 
-
1558  if (metric_type == METRIC_INNER_PRODUCT) {
-
1559  for (size_t j = 0; j < k; j++) {
-
1560  heap_sim[i] = -heap_sim[i];
-
1561  }
-
1562  }
-
1563  heap_cycles += TOC;
-
1564  }
-
1565 
-
1566 #pragma omp critical
-
1567  {
-
1568  indexIVFPQ_stats.n_hamming_pass += qt.n_hamming_pass;
-
1569  indexIVFPQ_stats.nlist += stats_nlist;
-
1570  indexIVFPQ_stats.ncode += stats_ncode;
-
1571 
-
1572  indexIVFPQ_stats.init_query_cycles += init_query_cycles;
-
1573  indexIVFPQ_stats.init_list_cycles += qt.init_list_cycles;
-
1574  indexIVFPQ_stats.scan_cycles += scan_cycles - qt.init_list_cycles;
-
1575  indexIVFPQ_stats.heap_cycles += heap_cycles;
-
1576  }
-
1577 
-
1578  }
-
1579  indexIVFPQ_stats.nq += nx;
-
1580 }
+
1469 IndexIVFPQCompact::~IndexIVFPQCompact ()
+
1470 {
+
1471  if (alloc_type == Alloc_type_new) {
+
1472  delete [] limits;
+
1473  delete [] compact_codes;
+
1474  delete [] compact_ids;
+
1475  } else if (alloc_type == Alloc_type_mmap) {
+
1476  munmap (mmap_buffer, mmap_length);
+
1477 
+
1478  }
+
1479 
+
1480 }
+
1481 
+
1482 void IndexIVFPQCompact::search_knn_with_key (
+
1483  size_t nx,
+
1484  const float * qx,
+
1485  const long * keys,
+
1486  const float * coarse_dis,
+
1487  float_maxheap_array_t * res,
+
1488  bool store_pairs) const
+
1489 {
+
1490  const size_t k = res->k;
+
1491 
+
1492 #pragma omp parallel
+
1493  {
+
1494  InvertedListScanner<uint32_t> qt (*this);
+
1495  size_t stats_nlist = 0;
+
1496  size_t stats_ncode = 0;
+
1497  uint64_t init_query_cycles = 0;
+
1498  uint64_t scan_cycles = 0;
+
1499  uint64_t heap_cycles = 0;
+
1500 
+
1501 #pragma omp for
+
1502  for (size_t i = 0; i < nx; i++) {
+
1503  const float *qi = qx + i * d;
+
1504  const long * keysi = keys + i * nprobe;
+
1505  const float *coarse_dis_i = coarse_dis + i * nprobe;
+
1506  float * heap_sim = res->get_val (i);
+
1507  long * heap_ids = res->get_ids (i);
+
1508 
+
1509  uint64_t t0;
+
1510  TIC;
+
1511  maxheap_heapify (k, heap_sim, heap_ids);
+
1512  heap_cycles += TOC;
+
1513 
+
1514  TIC;
+
1515  qt.init_query (qi);
+
1516  init_query_cycles += TOC;
+
1517 
+
1518  size_t nscan = 0;
+
1519 
+
1520  for (size_t ik = 0; ik < nprobe; ik++) {
+
1521  long key = keysi[ik]; /* select the list */
+
1522  if (key < 0) {
+
1523  // not enough centroids for multiprobe
+
1524  continue;
+
1525  }
+
1526  if (key >= (long) nlist) {
+
1527  fprintf (stderr, "Invalid key=%ld nlist=%ld\n", key, nlist);
+
1528  throw;
+
1529  }
+
1530  size_t list_size = limits[key + 1] - limits[key];
+
1531  stats_nlist ++;
+
1532  nscan += list_size;
+
1533 
+
1534  if (list_size == 0) continue;
+
1535 
+
1536  qt.init_list (key, coarse_dis_i[ik],
+
1537  list_size, compact_ids + limits[key],
+
1538  compact_codes + limits[key] * code_size);
+
1539 
+
1540  TIC;
+
1541  if (polysemous_ht > 0) {
+
1542  qt.scan_list_polysemous
+
1543  (k, heap_sim, heap_ids, store_pairs);
+
1544  } else if (list_size > scan_table_threshold) {
+
1545  qt.scan_list_with_table (k, heap_sim, heap_ids, store_pairs);
+
1546  } else {
+
1547  qt.scan_on_the_fly_dist (k, heap_sim, heap_ids, store_pairs);
+
1548  }
+
1549  scan_cycles += TOC;
+
1550 
+
1551  if (max_codes && nscan >= max_codes) break;
+
1552  }
+
1553  stats_ncode += nscan;
+
1554  TIC;
+
1555  maxheap_reorder (k, heap_sim, heap_ids);
+
1556 
+
1557  if (metric_type == METRIC_INNER_PRODUCT) {
+
1558  for (size_t j = 0; j < k; j++) {
+
1559  heap_sim[i] = -heap_sim[i];
+
1560  }
+
1561  }
+
1562  heap_cycles += TOC;
+
1563  }
+
1564 
+
1565 #pragma omp critical
+
1566  {
+
1567  indexIVFPQ_stats.n_hamming_pass += qt.n_hamming_pass;
+
1568  indexIVFPQ_stats.nlist += stats_nlist;
+
1569  indexIVFPQ_stats.ncode += stats_ncode;
+
1570 
+
1571  indexIVFPQ_stats.init_query_cycles += init_query_cycles;
+
1572  indexIVFPQ_stats.init_list_cycles += qt.init_list_cycles;
+
1573  indexIVFPQ_stats.scan_cycles += scan_cycles - qt.init_list_cycles;
+
1574  indexIVFPQ_stats.heap_cycles += heap_cycles;
+
1575  }
+
1576 
+
1577  }
+
1578  indexIVFPQ_stats.nq += nx;
+
1579 }
+
1580 
1581 
1582 
-
1583 
-
1584 } // namespace faiss
+
1583 } // namespace faiss
faiss::IndexIVFPQCompact::compact_ids
uint32_t * compact_ids
size ntotal
Definition: IndexIVFPQ.h:256
faiss::IndexIVFPQCompact::compact_codes
uint8_t * compact_codes
size ntotal * code_size
Definition: IndexIVFPQ.h:257
@@ -1679,8 +1678,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::fvec_L2sqr
float fvec_L2sqr(const float *x, const float *y, size_t d)
Squared L2 distance between two vectors.
Definition: utils.cpp:481
faiss::IndexIVFPQ::polysemous_training
PolysemousTraining * polysemous_training
if NULL, use default
Definition: IndexIVFPQ.h:36
faiss::HeapArray::get_val
T * get_val(size_t key)
Return the list of values for a heap.
Definition: Heap.h:360
-
faiss::IndexIVFPQCompact::add
void add(idx_t, const float *) override
the three following functions will fail at runtime
Definition: IndexIVFPQ.cpp:1455
-
faiss::IndexIVFPQCompact::search_knn_with_key
void search_knn_with_key(size_t nx, const float *qx, const long *keys, const float *coarse_dis, float_maxheap_array_t *res, bool store_pairs=false) const override
Definition: IndexIVFPQ.cpp:1483
+
faiss::IndexIVFPQCompact::add
void add(idx_t, const float *) override
the three following functions will fail at runtime
Definition: IndexIVFPQ.cpp:1454
+
faiss::IndexIVFPQCompact::search_knn_with_key
void search_knn_with_key(size_t nx, const float *qx, const long *keys, const float *coarse_dis, float_maxheap_array_t *res, bool store_pairs=false) const override
Definition: IndexIVFPQ.cpp:1482
faiss::IndexIVFPQR::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexIVFPQ.cpp:1345
faiss::fvecs_maybe_subsample
const float * fvecs_maybe_subsample(size_t d, size_t *n, size_t nmax, const float *x, bool verbose, long seed)
Definition: utils.cpp:1941
faiss::IndexIVF::nprobe
size_t nprobe
number of probes at query time
Definition: IndexIVF.h:47
@@ -1718,7 +1717,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQ::train_residual
void train_residual(idx_t n, const float *x) override
trains the product quantizer
Definition: IndexIVFPQ.cpp:66
faiss::IndexIVFPQ::encode_multiple
void encode_multiple(size_t n, long *keys, const float *x, uint8_t *codes, bool compute_keys=false) const
Definition: IndexIVFPQ.cpp:149
-
faiss::IndexIVFPQCompact::train
void train(idx_t, const float *) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVFPQ.cpp:1463
+
faiss::IndexIVFPQCompact::train
void train(idx_t, const float *) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVFPQ.cpp:1462
faiss::IndexIVF::own_fields
bool own_fields
whether object owns the quantizer
Definition: IndexIVF.h:51
faiss::ProductQuantizer::ksub
size_t ksub
number of centroids for each subquantizer
Definition: ProductQuantizer.h:35
@@ -1748,7 +1747,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQ::code_size
size_t code_size
code size per vector in bytes
Definition: IndexIVFPQ.h:32
faiss::IndexIVFPQR::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVFPQ.cpp:1371
-
faiss::IndexIVFPQCompact::reset
void reset() override
removes all elements from the database.
Definition: IndexIVFPQ.cpp:1459
+
faiss::IndexIVFPQCompact::reset
void reset() override
removes all elements from the database.
Definition: IndexIVFPQ.cpp:1458
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
faiss::ProductQuantizer::get_centroids
float * get_centroids(size_t m, size_t i)
return the centroids associated with subvector m
Definition: ProductQuantizer.h:55
diff --git a/docs/html/IndexIVFPQ_8h_source.html b/docs/html/IndexIVFPQ_8h_source.html index 17af61af1..b5145c8ef 100644 --- a/docs/html/IndexIVFPQ_8h_source.html +++ b/docs/html/IndexIVFPQ_8h_source.html @@ -383,9 +383,9 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQR::refine_pq
ProductQuantizer refine_pq
3rd level quantizer
Definition: IndexIVFPQ.h:199
faiss::IndexIVFPQ::polysemous_training
PolysemousTraining * polysemous_training
if NULL, use default
Definition: IndexIVFPQ.h:36
-
faiss::IndexIVFPQCompact::add
void add(idx_t, const float *) override
the three following functions will fail at runtime
Definition: IndexIVFPQ.cpp:1455
+
faiss::IndexIVFPQCompact::add
void add(idx_t, const float *) override
the three following functions will fail at runtime
Definition: IndexIVFPQ.cpp:1454
-
faiss::IndexIVFPQCompact::search_knn_with_key
void search_knn_with_key(size_t nx, const float *qx, const long *keys, const float *coarse_dis, float_maxheap_array_t *res, bool store_pairs=false) const override
Definition: IndexIVFPQ.cpp:1483
+
faiss::IndexIVFPQCompact::search_knn_with_key
void search_knn_with_key(size_t nx, const float *qx, const long *keys, const float *coarse_dis, float_maxheap_array_t *res, bool store_pairs=false) const override
Definition: IndexIVFPQ.cpp:1482
faiss::IndexIVFPQR::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexIVFPQ.cpp:1345
@@ -413,7 +413,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQ::train_residual
void train_residual(idx_t n, const float *x) override
trains the product quantizer
Definition: IndexIVFPQ.cpp:66
faiss::IndexIVFPQ::encode_multiple
void encode_multiple(size_t n, long *keys, const float *x, uint8_t *codes, bool compute_keys=false) const
Definition: IndexIVFPQ.cpp:149
-
faiss::IndexIVFPQCompact::train
void train(idx_t, const float *) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVFPQ.cpp:1463
+
faiss::IndexIVFPQCompact::train
void train(idx_t, const float *) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVFPQ.cpp:1462
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::IndexIVFPQ::reset
void reset() override
removes all elements from the database.
Definition: IndexIVFPQ.cpp:1083
@@ -429,7 +429,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVFPQ::code_size
size_t code_size
code size per vector in bytes
Definition: IndexIVFPQ.h:32
faiss::IndexIVFPQR::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVFPQ.cpp:1371
-
faiss::IndexIVFPQCompact::reset
void reset() override
removes all elements from the database.
Definition: IndexIVFPQ.cpp:1459
+
faiss::IndexIVFPQCompact::reset
void reset() override
removes all elements from the database.
Definition: IndexIVFPQ.cpp:1458
faiss::IndexIVFPQR::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexIVFPQ.cpp:1233
faiss::IndexIVFPQR::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVFPQ.cpp:1256
diff --git a/docs/html/IndexIVFScalarQuantizer_8cpp_source.html b/docs/html/IndexIVFScalarQuantizer_8cpp_source.html deleted file mode 100644 index 0c3246f7c..000000000 --- a/docs/html/IndexIVFScalarQuantizer_8cpp_source.html +++ /dev/null @@ -1,1022 +0,0 @@ - - - - - - -Faiss: /data/users/matthijs/github_faiss/faiss/IndexIVFScalarQuantizer.cpp Source File - - - - - - - - - -
-
- - - - - - -
-
Faiss -
-
-
- - - - - -
- - - - -
- -
- -
-
-
/data/users/matthijs/github_faiss/faiss/IndexIVFScalarQuantizer.cpp
-
-
-
1 /**
-
2  * Copyright (c) 2015-present, Facebook, Inc.
-
3  * All rights reserved.
-
4  *
-
5  * This source code is licensed under the CC-by-NC license found in the
-
6  * LICENSE file in the root directory of this source tree.
-
7  */
-
8 
-
9 #include "IndexIVFScalarQuantizer.h"
-
10 
-
11 #include <cstdio>
-
12 #include <algorithm>
-
13 
-
14 #include <omp.h>
-
15 
-
16 #include <immintrin.h>
-
17 
-
18 #include "utils.h"
-
19 
-
20 #include "FaissAssert.h"
-
21 
-
22 namespace faiss {
-
23 
-
24 /*******************************************************************
-
25  * IndexIVFScalarQuantizer implementation
-
26  *
-
27  * The main source of complexity is to support combinations of 4
-
28  * variants without incurring runtime tests or virtual function calls:
-
29  *
-
30  * - 4 / 8 bits per code component
-
31  * - uniform / non-uniform
-
32  * - IP / L2 distance search
-
33  * - scalar / AVX distance computation
-
34  *
-
35  * The appropriate Quantizer object is returned via select_quantizer
-
36  * that hides the template mess.
-
37  ********************************************************************/
-
38 
-
39 #ifdef __AVX__
-
40 #define USE_AVX
-
41 #endif
-
42 
-
43 
-
44 namespace {
-
45 
-
46 typedef Index::idx_t idx_t;
-
47 typedef ScalarQuantizer::QuantizerType QuantizerType;
-
48 typedef ScalarQuantizer::RangeStat RangeStat;
-
49 
-
50 
-
51 /*******************************************************************
-
52  * Codec: converts between values in [0, 1] and an index in a code
-
53  * array. The "i" parameter is the vector component index (not byte
-
54  * index).
-
55  */
-
56 
-
57 struct Codec8bit {
-
58 
-
59  static void encode_component (float x, uint8_t *code, int i) {
-
60  code[i] = (int)(255 * x);
-
61  }
-
62 
-
63  static float decode_component (const uint8_t *code, int i) {
-
64  return (code[i] + 0.5f) / 255.0f;
-
65  }
-
66 
-
67 #ifdef USE_AVX
-
68  static __m256 decode_8_components (const uint8_t *code, int i) {
-
69  uint64_t c8 = *(uint64_t*)(code + i);
-
70  __m128i c4lo = _mm_cvtepu8_epi32 (_mm_set1_epi32(c8));
-
71  __m128i c4hi = _mm_cvtepu8_epi32 (_mm_set1_epi32(c8 >> 32));
-
72  // __m256i i8 = _mm256_set_m128i(c4lo, c4hi);
-
73  __m256i i8 = _mm256_castsi128_si256 (c4lo);
-
74  i8 = _mm256_insertf128_si256 (i8, c4hi, 1);
-
75  __m256 f8 = _mm256_cvtepi32_ps (i8);
-
76  __m256 half = _mm256_set1_ps (0.5f);
-
77  f8 += half;
-
78  __m256 one_255 = _mm256_set1_ps (1.f / 255.f);
-
79  return f8 * one_255;
-
80  }
-
81 #endif
-
82 };
-
83 
-
84 
-
85 struct Codec4bit {
-
86 
-
87  static void encode_component (float x, uint8_t *code, int i) {
-
88  code [i / 2] |= (int)(x * 15.0) << ((i & 1) << 2);
-
89  }
-
90 
-
91  static float decode_component (const uint8_t *code, int i) {
-
92  return (((code[i / 2] >> ((i & 1) << 2)) & 0xf) + 0.5f) / 15.0f;
-
93  }
-
94 
-
95 
-
96 #ifdef USE_AVX
-
97  static __m256 decode_8_components (const uint8_t *code, int i) {
-
98  uint32_t c4 = *(uint32_t*)(code + (i >> 1));
-
99  uint32_t mask = 0x0f0f0f0f;
-
100  uint32_t c4ev = c4 & mask;
-
101  uint32_t c4od = (c4 >> 4) & mask;
-
102 
-
103  // the 8 lower bytes of c8 contain the values
-
104  __m128i c8 = _mm_unpacklo_epi8 (_mm_set1_epi32(c4ev),
-
105  _mm_set1_epi32(c4od));
-
106  __m128i c4lo = _mm_cvtepu8_epi32 (c8);
-
107  __m128i c4hi = _mm_cvtepu8_epi32 (_mm_srli_si128(c8, 4));
-
108  __m256i i8 = _mm256_castsi128_si256 (c4lo);
-
109  i8 = _mm256_insertf128_si256 (i8, c4hi, 1);
-
110  __m256 f8 = _mm256_cvtepi32_ps (i8);
-
111  __m256 half = _mm256_set1_ps (0.5f);
-
112  f8 += half;
-
113  __m256 one_255 = _mm256_set1_ps (1.f / 15.f);
-
114  return f8 * one_255;
-
115  }
-
116 #endif
-
117 };
-
118 
-
119 
-
120 /*******************************************************************
-
121  * Similarity: gets vector components and computes a similarity wrt. a
-
122  * query vector stored in the object
-
123  */
-
124 
-
125 struct SimilarityL2 {
-
126  const float *y, *yi;
-
127  explicit SimilarityL2 (const float * y): y(y) {}
-
128 
-
129 
-
130  /******* scalar accumulator *******/
-
131 
-
132  float accu;
-
133 
-
134  void begin () {
-
135  accu = 0;
-
136  yi = y;
-
137  }
-
138 
-
139  void add_component (float x) {
-
140  float tmp = *yi++ - x;
-
141  accu += tmp * tmp;
-
142  }
-
143 
-
144  float result () {
-
145  return accu;
-
146  }
-
147 
-
148 #ifdef USE_AVX
-
149  /******* AVX accumulator *******/
-
150 
-
151  __m256 accu8;
-
152 
-
153  void begin_8 () {
-
154  accu8 = _mm256_setzero_ps();
-
155  yi = y;
-
156  }
-
157 
-
158  void add_8_components (__m256 x) {
-
159  __m256 yiv = _mm256_loadu_ps (yi);
-
160  yi += 8;
-
161  __m256 tmp = yiv - x;
-
162  accu8 += tmp * tmp;
-
163  }
-
164 
-
165  float result_8 () {
-
166  __m256 sum = _mm256_hadd_ps(accu8, accu8);
-
167  __m256 sum2 = _mm256_hadd_ps(sum, sum);
-
168  // now add the 0th and 4th component
-
169  return
-
170  _mm_cvtss_f32 (_mm256_castps256_ps128(sum2)) +
-
171  _mm_cvtss_f32 (_mm256_extractf128_ps(sum2, 1));
-
172  }
-
173 #endif
-
174 };
-
175 
-
176 struct SimilarityIP {
-
177  const float *y, *yi;
-
178  const float accu0;
-
179 
-
180  /******* scalar accumulator *******/
-
181 
-
182  float accu;
-
183 
-
184  SimilarityIP (const float * y, float accu0):
-
185  y (y), accu0 (accu0) {}
-
186 
-
187  void begin () {
-
188  accu = accu0;
-
189  yi = y;
-
190  }
-
191 
-
192  void add_component (float x) {
-
193  accu += *yi++ * x;
-
194  }
-
195 
-
196  float result () {
-
197  return accu;
-
198  }
-
199 
-
200 #ifdef USE_AVX
-
201  /******* AVX accumulator *******/
-
202 
-
203  __m256 accu8;
-
204 
-
205  void begin_8 () {
-
206  accu8 = _mm256_setzero_ps();
-
207  yi = y;
-
208  }
-
209 
-
210  void add_8_components (__m256 x) {
-
211  __m256 yiv = _mm256_loadu_ps (yi);
-
212  yi += 8;
-
213  accu8 += yiv * x;
-
214  }
-
215 
-
216  float result_8 () {
-
217  __m256 sum = _mm256_hadd_ps(accu8, accu8);
-
218  __m256 sum2 = _mm256_hadd_ps(sum, sum);
-
219  // now add the 0th and 4th component
-
220  return
-
221  accu0 +
-
222  _mm_cvtss_f32 (_mm256_castps256_ps128(sum2)) +
-
223  _mm_cvtss_f32 (_mm256_extractf128_ps(sum2, 1));
-
224  }
-
225 #endif
-
226 };
-
227 
-
228 
-
229 /*******************************************************************
-
230  * templatized distance functions
-
231  */
-
232 
-
233 
-
234 template<class Quantizer, class Similarity>
-
235 float compute_distance(const Quantizer & quant, Similarity & sim,
-
236  const uint8_t *code)
-
237 {
-
238  sim.begin();
-
239  for (size_t i = 0; i < quant.d; i++) {
-
240  float xi = quant.reconstruct_component (code, i);
-
241  sim.add_component (xi);
-
242  }
-
243  return sim.result();
-
244 }
-
245 
-
246 #ifdef USE_AVX
-
247 template<class Quantizer, class Similarity>
-
248 float compute_distance_8(const Quantizer & quant, Similarity & sim,
-
249  const uint8_t *code)
-
250 {
-
251  sim.begin_8();
-
252  for (size_t i = 0; i < quant.d; i += 8) {
-
253  __m256 xi = quant.reconstruct_8_components (code, i);
-
254  sim.add_8_components (xi);
-
255  }
-
256  return sim.result_8();
-
257 }
-
258 #endif
-
259 
-
260 
-
261 /*******************************************************************
-
262  * Quantizer range training
-
263  */
-
264 
-
265 static float sqr (float x) {
-
266  return x * x;
-
267 }
-
268 
-
269 
-
270 void train_Uniform(RangeStat rs, float rs_arg,
-
271  idx_t n, int k, const float *x,
-
272  std::vector<float> & trained)
-
273 {
-
274  trained.resize (2);
-
275  float & vmin = trained[0];
-
276  float & vmax = trained[1];
-
277 
-
278  if (rs == ScalarQuantizer::RS_minmax) {
-
279  vmin = HUGE_VAL; vmax = -HUGE_VAL;
-
280  for (size_t i = 0; i < n; i++) {
-
281  if (x[i] < vmin) vmin = x[i];
-
282  if (x[i] > vmax) vmax = x[i];
-
283  }
-
284  float vexp = (vmax - vmin) * rs_arg;
-
285  vmin -= vexp;
-
286  vmax += vexp;
-
287  } else if (rs == ScalarQuantizer::RS_meanstd) {
-
288  double sum = 0, sum2 = 0;
-
289  for (size_t i = 0; i < n; i++) {
-
290  sum += x[i];
-
291  sum2 += x[i] * x[i];
-
292  }
-
293  float mean = sum / n;
-
294  float var = sum2 / n - mean * mean;
-
295  float std = var <= 0 ? 1.0 : sqrt(var);
-
296 
-
297  vmin = mean - std * rs_arg ;
-
298  vmax = mean + std * rs_arg ;
-
299  } else if (rs == ScalarQuantizer::RS_quantiles) {
-
300  std::vector<float> x_copy(n);
-
301  memcpy(x_copy.data(), x, n * sizeof(*x));
-
302  // TODO just do a qucikselect
-
303  std::sort(x_copy.begin(), x_copy.end());
-
304  int o = int(rs_arg * n);
-
305  if (o < 0) o = 0;
-
306  if (o > n - o) o = n / 2;
-
307  vmin = x_copy[o];
-
308  vmax = x_copy[n - 1 - o];
-
309 
-
310  } else if (rs == ScalarQuantizer::RS_optim) {
-
311  float a, b;
-
312  float sx = 0;
-
313  {
-
314  vmin = HUGE_VAL, vmax = -HUGE_VAL;
-
315  for (size_t i = 0; i < n; i++) {
-
316  if (x[i] < vmin) vmin = x[i];
-
317  if (x[i] > vmax) vmax = x[i];
-
318  sx += x[i];
-
319  }
-
320  b = vmin;
-
321  a = (vmax - vmin) / (k - 1);
-
322  }
-
323  int verbose = false;
-
324  int niter = 2000;
-
325  float last_err = -1;
-
326  int iter_last_err = 0;
-
327  for (int it = 0; it < niter; it++) {
-
328  float sn = 0, sn2 = 0, sxn = 0, err1 = 0;
-
329 
-
330  for (idx_t i = 0; i < n; i++) {
-
331  float xi = x[i];
-
332  float ni = floor ((xi - b) / a + 0.5);
-
333  if (ni < 0) ni = 0;
-
334  if (ni >= k) ni = k - 1;
-
335  err1 += sqr (xi - (ni * a + b));
-
336  sn += ni;
-
337  sn2 += ni * ni;
-
338  sxn += ni * xi;
-
339  }
-
340 
-
341  if (err1 == last_err) {
-
342  iter_last_err ++;
-
343  if (iter_last_err == 16) break;
-
344  } else {
-
345  last_err = err1;
-
346  iter_last_err = 0;
-
347  }
-
348 
-
349  float det = sqr (sn) - sn2 * n;
-
350 
-
351  b = (sn * sxn - sn2 * sx) / det;
-
352  a = (sn * sx - n * sxn) / det;
-
353  if (verbose) {
-
354  printf ("it %d, err1=%g \r", it, err1);
-
355  fflush(stdout);
-
356  }
-
357  }
-
358  if (verbose) printf("\n");
-
359 
-
360  vmin = b;
-
361  vmax = b + a * (k - 1);
-
362 
-
363  } else {
-
364  FAISS_THROW_MSG ("Invalid qtype");
-
365  }
-
366  vmax -= vmin;
-
367 }
-
368 
-
369 void train_NonUniform(RangeStat rs, float rs_arg,
-
370  idx_t n, int d, int k, const float *x,
-
371  std::vector<float> & trained)
-
372 {
-
373  trained.resize (2 * d);
-
374  float * vmin = trained.data();
-
375  float * vmax = trained.data() + d;
-
376  if (rs == ScalarQuantizer::RS_minmax) {
-
377  memcpy (vmin, x, sizeof(*x) * d);
-
378  memcpy (vmax, x, sizeof(*x) * d);
-
379  for (size_t i = 1; i < n; i++) {
-
380  const float *xi = x + i * d;
-
381  for (size_t j = 0; j < d; j++) {
-
382  if (xi[j] < vmin[j]) vmin[j] = xi[j];
-
383  if (xi[j] > vmax[j]) vmax[j] = xi[j];
-
384  }
-
385  }
-
386  float *vdiff = vmax;
-
387  for (size_t j = 0; j < d; j++) {
-
388  float vexp = (vmax[j] - vmin[j]) * rs_arg;
-
389  vmin[j] -= vexp;
-
390  vmax[j] += vexp;
-
391  vdiff [j] = vmax[j] - vmin[j];
-
392  }
-
393  } else {
-
394  // transpose
-
395  std::vector<float> xt(n * d);
-
396  for (size_t i = 1; i < n; i++) {
-
397  const float *xi = x + i * d;
-
398  for (size_t j = 0; j < d; j++) {
-
399  xt[j * n + i] = xi[j];
-
400  }
-
401  }
-
402  std::vector<float> trained_d(2);
-
403 #pragma omp parallel for
-
404  for (size_t j = 0; j < d; j++) {
-
405  train_Uniform(rs, rs_arg,
-
406  n, k, xt.data() + j * n,
-
407  trained_d);
-
408  vmin[j] = trained_d[0];
-
409  vmax[j] = trained_d[1];
-
410  }
-
411  }
-
412 }
-
413 
-
414 
-
415 /*******************************************************************
-
416  * Quantizer: normalizes scalar vector components, then passes them
-
417  * through a codec
-
418  */
-
419 
-
420 
-
421 
-
422 struct Quantizer {
-
423  virtual void encode_vector(const float *x, uint8_t *code) const = 0;
-
424  virtual void decode_vector(const uint8_t *code, float *x) const = 0;
-
425 
-
426  virtual float compute_distance_L2 (SimilarityL2 &sim,
-
427  const uint8_t * codes) const = 0;
-
428  virtual float compute_distance_IP (SimilarityIP &sim,
-
429  const uint8_t * codes) const = 0;
-
430 
-
431  virtual ~Quantizer() {}
-
432 };
-
433 
-
434 
-
435 
-
436 
-
437 template<class Codec>
-
438 struct QuantizerUniform: Quantizer {
-
439  const size_t d;
-
440  const float vmin, vdiff;
-
441 
-
442  QuantizerUniform(size_t d, const std::vector<float> &trained):
-
443  d(d), vmin(trained[0]), vdiff(trained[1]) {
-
444  }
-
445 
-
446  void encode_vector(const float* x, uint8_t* code) const override {
-
447  for (size_t i = 0; i < d; i++) {
-
448  float xi = (x[i] - vmin) / vdiff;
-
449  if (xi < 0)
-
450  xi = 0;
-
451  if (xi > 1.0)
-
452  xi = 1.0;
-
453  Codec::encode_component(xi, code, i);
-
454  }
-
455  }
-
456 
-
457  void decode_vector(const uint8_t* code, float* x) const override {
-
458  for (size_t i = 0; i < d; i++) {
-
459  float xi = Codec::decode_component(code, i);
-
460  x[i] = vmin + xi * vdiff;
-
461  }
-
462  }
-
463 
-
464  float reconstruct_component (const uint8_t * code, int i) const
-
465  {
-
466  float xi = Codec::decode_component (code, i);
-
467  return vmin + xi * vdiff;
-
468  }
-
469 
-
470 #ifdef USE_AVX
-
471  __m256 reconstruct_8_components (const uint8_t * code, int i) const
-
472  {
-
473  __m256 xi = Codec::decode_8_components (code, i);
-
474  return _mm256_set1_ps(vmin) + xi * _mm256_set1_ps (vdiff);
-
475  }
-
476 #endif
-
477 
-
478  float compute_distance_L2(SimilarityL2& sim, const uint8_t* codes)
-
479  const override {
-
480  return compute_distance(*this, sim, codes);
-
481  }
-
482 
-
483  float compute_distance_IP(SimilarityIP& sim, const uint8_t* codes)
-
484  const override {
-
485  return compute_distance(*this, sim, codes);
-
486  }
-
487 };
-
488 
-
489 #ifdef USE_AVX
-
490 template<class Codec>
-
491 struct QuantizerUniform8: QuantizerUniform<Codec> {
-
492 
-
493  QuantizerUniform8 (size_t d, const std::vector<float> &trained):
-
494  QuantizerUniform<Codec> (d, trained) {}
-
495 
-
496  float compute_distance_L2(SimilarityL2& sim, const uint8_t* codes)
-
497  const override {
-
498  return compute_distance_8(*this, sim, codes);
-
499  }
-
500 
-
501  float compute_distance_IP(SimilarityIP& sim, const uint8_t* codes)
-
502  const override {
-
503  return compute_distance_8(*this, sim, codes);
-
504  }
-
505 };
-
506 #endif
-
507 
-
508 
-
509 
-
510 
-
511 
-
512 template<class Codec>
-
513 struct QuantizerNonUniform: Quantizer {
-
514  const size_t d;
-
515  const float *vmin, *vdiff;
-
516 
-
517  QuantizerNonUniform(size_t d, const std::vector<float> &trained):
-
518  d(d), vmin(trained.data()), vdiff(trained.data() + d) {}
-
519 
-
520  void encode_vector(const float* x, uint8_t* code) const override {
-
521  for (size_t i = 0; i < d; i++) {
-
522  float xi = (x[i] - vmin[i]) / vdiff[i];
-
523  if (xi < 0)
-
524  xi = 0;
-
525  if (xi > 1.0)
-
526  xi = 1.0;
-
527  Codec::encode_component(xi, code, i);
-
528  }
-
529  }
-
530 
-
531  void decode_vector(const uint8_t* code, float* x) const override {
-
532  for (size_t i = 0; i < d; i++) {
-
533  float xi = Codec::decode_component(code, i);
-
534  x[i] = vmin[i] + xi * vdiff[i];
-
535  }
-
536  }
-
537 
-
538  float reconstruct_component (const uint8_t * code, int i) const
-
539  {
-
540  float xi = Codec::decode_component (code, i);
-
541  return vmin[i] + xi * vdiff[i];
-
542  }
-
543 
-
544 #ifdef USE_AVX
-
545  __m256 reconstruct_8_components (const uint8_t * code, int i) const
-
546  {
-
547  __m256 xi = Codec::decode_8_components (code, i);
-
548  return _mm256_loadu_ps(vmin + i) + xi * _mm256_loadu_ps (vdiff + i);
-
549  }
-
550 #endif
-
551 
-
552  float compute_distance_L2(SimilarityL2& sim, const uint8_t* codes)
-
553  const override {
-
554  return compute_distance(*this, sim, codes);
-
555  }
-
556 
-
557  float compute_distance_IP(SimilarityIP& sim, const uint8_t* codes)
-
558  const override {
-
559  return compute_distance(*this, sim, codes);
-
560  }
-
561 };
-
562 
-
563 #ifdef USE_AVX
-
564 template<class Codec>
-
565 struct QuantizerNonUniform8: QuantizerNonUniform<Codec> {
-
566 
-
567  QuantizerNonUniform8 (size_t d, const std::vector<float> &trained):
-
568  QuantizerNonUniform<Codec> (d, trained) {}
-
569 
-
570  float compute_distance_L2(SimilarityL2& sim, const uint8_t* codes)
-
571  const override {
-
572  return compute_distance_8(*this, sim, codes);
-
573  }
-
574 
-
575  float compute_distance_IP(SimilarityIP& sim, const uint8_t* codes)
-
576  const override {
-
577  return compute_distance_8(*this, sim, codes);
-
578  }
-
579 };
-
580 #endif
-
581 
-
582 
-
583 
-
584 
-
585 
-
586 Quantizer *select_quantizer (
-
587  QuantizerType qtype,
-
588  size_t d, const std::vector<float> & trained)
-
589 {
-
590 #ifdef USE_AVX
-
591  if (d % 8 == 0) {
-
592  switch(qtype) {
-
593  case ScalarQuantizer::QT_8bit:
-
594  return new QuantizerNonUniform8<Codec8bit>(d, trained);
-
595  case ScalarQuantizer::QT_4bit:
-
596  return new QuantizerNonUniform8<Codec4bit>(d, trained);
-
597  case ScalarQuantizer::QT_8bit_uniform:
-
598  return new QuantizerUniform8<Codec8bit>(d, trained);
-
599  case ScalarQuantizer::QT_4bit_uniform:
-
600  return new QuantizerUniform8<Codec4bit>(d, trained);
-
601  }
-
602  } else
-
603 #endif
-
604  {
-
605  switch(qtype) {
-
606  case ScalarQuantizer::QT_8bit:
-
607  return new QuantizerNonUniform<Codec8bit>(d, trained);
-
608  case ScalarQuantizer::QT_4bit:
-
609  return new QuantizerNonUniform<Codec4bit>(d, trained);
-
610  case ScalarQuantizer::QT_8bit_uniform:
-
611  return new QuantizerUniform<Codec8bit>(d, trained);
-
612  case ScalarQuantizer::QT_4bit_uniform:
-
613  return new QuantizerUniform<Codec4bit>(d, trained);
-
614  }
-
615  }
-
616  FAISS_THROW_MSG ("unknown qtype");
-
617  return nullptr;
-
618 }
-
619 
-
620 Quantizer *select_quantizer (const ScalarQuantizer &sq)
-
621 {
-
622  return select_quantizer (sq.qtype, sq.d, sq.trained);
-
623 }
-
624 
-
625 
-
626 } // anonymous namespace
-
627 
-
628 
-
629 
-
630 /*******************************************************************
-
631  * ScalarQuantizer implementation
-
632  ********************************************************************/
-
633 
-
634 ScalarQuantizer::ScalarQuantizer
-
635  (size_t d, QuantizerType qtype):
-
636  qtype (qtype), rangestat(RS_minmax), rangestat_arg(0), d (d)
-
637 {
-
638  switch (qtype) {
-
639  case QT_8bit: case QT_8bit_uniform:
-
640  code_size = d;
-
641  break;
-
642  case QT_4bit: case QT_4bit_uniform:
-
643  code_size = (d + 1) / 2;
-
644  break;
-
645  }
-
646 
-
647 }
-
648 
-
649 ScalarQuantizer::ScalarQuantizer ():
-
650  qtype(QT_8bit),
-
651  rangestat(RS_minmax), rangestat_arg(0), d (0), code_size(0)
-
652 {}
-
653 
-
654 void ScalarQuantizer::train (size_t n, const float *x)
-
655 {
-
656  int bit_per_dim =
-
657  qtype == QT_4bit_uniform ? 4 :
-
658  qtype == QT_4bit ? 4 :
-
659  qtype == QT_8bit_uniform ? 8 :
-
660  qtype == QT_8bit ? 8 : -1;
-
661 
-
662  switch (qtype) {
-
663  case QT_4bit_uniform: case QT_8bit_uniform:
-
664  train_Uniform (rangestat, rangestat_arg,
-
665  n * d, 1 << bit_per_dim, x, trained);
-
666  break;
-
667  case QT_4bit: case QT_8bit:
-
668  train_NonUniform (rangestat, rangestat_arg,
-
669  n, d, 1 << bit_per_dim, x, trained);
-
670  break;
-
671  }
-
672 }
-
673 
-
674 void ScalarQuantizer::compute_codes (const float * x,
-
675  uint8_t * codes,
-
676  size_t n) const
-
677 {
-
678  Quantizer *squant = select_quantizer (*this);
-
679 #pragma omp parallel for
-
680  for (size_t i = 0; i < n; i++)
-
681  squant->encode_vector (x + i * d, codes + i * code_size);
-
682  delete squant;
-
683 }
-
684 
-
685 void ScalarQuantizer::decode (const uint8_t *codes, float *x, size_t n) const
-
686 {
-
687  Quantizer *squant = select_quantizer (*this);
-
688 #pragma omp parallel for
-
689  for (size_t i = 0; i < n; i++)
-
690  squant->decode_vector (codes + i * code_size, x + i * d);
-
691  delete squant;
-
692 }
-
693 
-
694 
-
695 
-
696 /*******************************************************************
-
697  * IndexIVFScalarQuantizer implementation
-
698  ********************************************************************/
-
699 
-
700 IndexIVFScalarQuantizer::IndexIVFScalarQuantizer
-
701  (Index *quantizer, size_t d, size_t nlist,
-
702  QuantizerType qtype, MetricType metric):
-
703  IndexIVF (quantizer, d, nlist, metric),
-
704  sq (d, qtype)
-
705 {
-
706  code_size = sq.code_size;
-
707  codes.resize(nlist);
-
708 }
-
709 
-
710 IndexIVFScalarQuantizer::IndexIVFScalarQuantizer ():
-
711  IndexIVF (), code_size (0)
-
712 {}
-
713 
-
714 void IndexIVFScalarQuantizer::train_residual (idx_t n, const float *x)
-
715 {
-
716  long * idx = new long [n];
-
717  ScopeDeleter<long> del (idx);
-
718  quantizer->assign (n, x, idx);
-
719  float *residuals = new float [n * d];
-
720  ScopeDeleter<float> del2 (residuals);
-
721 
-
722 #pragma omp parallel for
-
723  for (idx_t i = 0; i < n; i++) {
-
724  quantizer->compute_residual (x + i * d, residuals + i * d, idx[i]);
-
725  }
-
726 
-
727  sq.train (n, residuals);
-
728 
-
729 }
-
730 
-
731 
-
732 void IndexIVFScalarQuantizer::add_with_ids
-
733  (idx_t n, const float * x, const long *xids)
-
734 {
-
735  FAISS_THROW_IF_NOT (is_trained);
-
736  long * idx = new long [n];
-
737  ScopeDeleter<long> del (idx);
-
738  quantizer->assign (n, x, idx);
-
739  size_t nadd = 0;
-
740  Quantizer *squant = select_quantizer (sq);
-
741  ScopeDeleter1<Quantizer> del2 (squant);
-
742 
-
743 #pragma omp parallel reduction(+: nadd)
-
744  {
-
745  std::vector<float> residual (d);
-
746  int nt = omp_get_num_threads();
-
747  int rank = omp_get_thread_num();
-
748 
-
749  for (size_t i = 0; i < n; i++) {
-
750 
-
751  long list_no = idx [i];
-
752  if (list_no >= 0 && list_no % nt == rank) {
-
753  long id = xids ? xids[i] : ntotal + i;
-
754 
-
755  assert (list_no < nlist);
-
756 
-
757  ids[list_no].push_back (id);
-
758  nadd++;
-
759  quantizer->compute_residual (
-
760  x + i * d, residual.data(), list_no);
-
761 
-
762  size_t cur_size = codes[list_no].size();
-
763  codes[list_no].resize (cur_size + code_size);
-
764 
-
765  squant->encode_vector (residual.data(),
-
766  codes[list_no].data() + cur_size);
-
767  }
-
768  }
-
769  }
-
770  ntotal += nadd;
-
771 }
-
772 
-
773 
-
774 void search_with_probes_ip (const IndexIVFScalarQuantizer & index,
-
775  const float *x,
-
776  const idx_t *cent_ids, const float *cent_dis,
-
777  const Quantizer & quant,
-
778  int k, float *simi, idx_t *idxi)
-
779 {
-
780  int nprobe = index.nprobe;
-
781  size_t code_size = index.code_size;
-
782  size_t d = index.d;
-
783  std::vector<float> decoded(d);
-
784  minheap_heapify (k, simi, idxi);
-
785  for (int i = 0; i < nprobe; i++) {
-
786  idx_t list_no = cent_ids[i];
-
787  if (list_no < 0) break;
-
788  float accu0 = cent_dis[i];
-
789 
-
790  const std::vector<idx_t> & ids = index.ids[list_no];
-
791  const uint8_t* codes = index.codes[list_no].data();
-
792 
-
793  SimilarityIP sim(x, accu0);
-
794 
-
795  for (size_t j = 0; j < ids.size(); j++) {
-
796 
-
797  float accu = quant.compute_distance_IP(sim, codes);
-
798 
-
799  if (accu > simi [0]) {
-
800  minheap_pop (k, simi, idxi);
-
801  minheap_push (k, simi, idxi, accu, ids[j]);
-
802  }
-
803  codes += code_size;
-
804  }
-
805 
-
806  }
-
807  minheap_reorder (k, simi, idxi);
-
808 }
-
809 
-
810 void search_with_probes_L2 (const IndexIVFScalarQuantizer & index,
-
811  const float *x_in,
-
812  const idx_t *cent_ids,
-
813  const Index *quantizer,
-
814  const Quantizer & quant,
-
815  int k, float *simi, idx_t *idxi)
-
816 {
-
817  int nprobe = index.nprobe;
-
818  size_t code_size = index.code_size;
-
819  size_t d = index.d;
-
820  std::vector<float> decoded(d), x(d);
-
821  maxheap_heapify (k, simi, idxi);
-
822  for (int i = 0; i < nprobe; i++) {
-
823  idx_t list_no = cent_ids[i];
-
824  if (list_no < 0) break;
-
825 
-
826  const std::vector<idx_t> & ids = index.ids[list_no];
-
827  const uint8_t* codes = index.codes[list_no].data();
-
828 
-
829  // shift of x_in wrt centroid
-
830  quantizer->compute_residual (x_in, x.data(), list_no);
-
831 
-
832  SimilarityL2 sim(x.data());
-
833 
-
834  for (size_t j = 0; j < ids.size(); j++) {
-
835 
-
836  float dis = quant.compute_distance_L2 (sim, codes);
-
837 
-
838  if (dis < simi [0]) {
-
839  maxheap_pop (k, simi, idxi);
-
840  maxheap_push (k, simi, idxi, dis, ids[j]);
-
841  }
-
842  codes += code_size;
-
843  }
-
844  }
-
845  maxheap_reorder (k, simi, idxi);
-
846 }
-
847 
-
848 
-
849 void IndexIVFScalarQuantizer::search (idx_t n, const float *x, idx_t k,
-
850  float *distances, idx_t *labels) const
-
851 {
-
852  FAISS_THROW_IF_NOT (is_trained);
-
853  idx_t *idx = new idx_t [n * nprobe];
-
854  ScopeDeleter<idx_t> del (idx);
-
855  float *dis = new float [n * nprobe];
-
856  ScopeDeleter<float> del2 (dis);
-
857 
-
858  quantizer->search (n, x, nprobe, dis, idx);
-
859 
-
860  Quantizer *squant = select_quantizer (sq);
-
861  ScopeDeleter1<Quantizer> del3(squant);
-
862 
-
863  if (metric_type == METRIC_INNER_PRODUCT) {
-
864 #pragma omp parallel for
-
865  for (size_t i = 0; i < n; i++) {
-
866  search_with_probes_ip (*this, x + i * d,
-
867  idx + i * nprobe, dis + i * nprobe, *squant,
-
868  k, distances + i * k, labels + i * k);
-
869  }
-
870  } else {
-
871 #pragma omp parallel for
-
872  for (size_t i = 0; i < n; i++) {
-
873  search_with_probes_L2 (*this, x + i * d,
-
874  idx + i * nprobe, quantizer, *squant,
-
875  k, distances + i * k, labels + i * k);
-
876  }
-
877  }
-
878 
-
879 }
-
880 
-
881 
-
882 void IndexIVFScalarQuantizer::merge_from_residuals (IndexIVF & other_in) {
-
883  IndexIVFScalarQuantizer &other =
-
884  dynamic_cast<IndexIVFScalarQuantizer &> (other_in);
-
885  for (int i = 0; i < nlist; i++) {
-
886  std::vector<uint8_t> & src = other.codes[i];
-
887  std::vector<uint8_t> & dest = codes[i];
-
888  dest.insert (dest.end(), src.begin (), src.end ());
-
889  src.clear ();
-
890  }
-
891 
-
892 }
-
893 
-
894 
-
895 }
- -
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexIVFScalarQuantizer.h:64
- -
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexIVFScalarQuantizer.cpp:714
-
faiss::IndexIVF::nprobe
size_t nprobe
number of probes at query time
Definition: IndexIVF.h:47
-
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
-
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVFScalarQuantizer.cpp:849
- - -
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVFScalarQuantizer.cpp:882
-
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexIVFScalarQuantizer.h:54
-
faiss::IndexIVF::ids
std::vector< std::vector< long > > ids
Inverted lists for indexes.
Definition: IndexIVF.h:55
-
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexIVFScalarQuantizer.cpp:733
-
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
-
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
-
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexIVFScalarQuantizer.h:39
- - - - -
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexIVFScalarQuantizer.cpp:685
-
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexIVFScalarQuantizer.cpp:674
-
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
- -
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexIVFScalarQuantizer.h:51
-
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
- -
faiss::IndexIVFScalarQuantizer::codes
std::vector< std::vector< uint8_t > > codes
inverted list codes.
Definition: IndexIVFScalarQuantizer.h:92
-
faiss::IndexIVFPQ::code_size
size_t code_size
code size per vector in bytes
Definition: IndexIVFPQ.h:32
-
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexIVFScalarQuantizer.h:52
-
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:58
-
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
-
- -
-Generated by   -doxygen - 1.8.5 -
- - diff --git a/docs/html/IndexIVFScalarQuantizer_8h_source.html b/docs/html/IndexIVFScalarQuantizer_8h_source.html deleted file mode 100644 index 36aa5ed4e..000000000 --- a/docs/html/IndexIVFScalarQuantizer_8h_source.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - -Faiss: /data/users/matthijs/github_faiss/faiss/IndexIVFScalarQuantizer.h Source File - - - - - - - - - -
-
- - - - - - -
-
Faiss -
-
-
- - - - - -
- - - - -
- -
- -
-
-
/data/users/matthijs/github_faiss/faiss/IndexIVFScalarQuantizer.h
-
-
-
1 /**
-
2  * Copyright (c) 2015-present, Facebook, Inc.
-
3  * All rights reserved.
-
4  *
-
5  * This source code is licensed under the CC-by-NC license found in the
-
6  * LICENSE file in the root directory of this source tree.
-
7  */
-
8 
-
9 #ifndef FAISS_INDEX_IVF_SCALAR_QUANTIZER_H
-
10 #define FAISS_INDEX_IVF_SCALAR_QUANTIZER_H
-
11 
-
12 #include <stdint.h>
-
13 
-
14 
-
15 #include <vector>
-
16 
-
17 
-
18 #include "IndexIVF.h"
-
19 
-
20 
-
21 namespace faiss {
-
22 
-
23 /** An IVF implementation where the components of the residuals are
-
24  * encoded with a scalar uniform quantizer. All distance computations
-
25  * are asymmetric, so the encoded vectors are decoded and approximate
-
26  * distances are computed.
-
27  *
-
28  * The uniform quantizer has a range [vmin, vmax]. The range can be
-
29  * the same for all dimensions (uniform) or specific per dimension
-
30  * (default).
-
31  */
-
32 
-
33 
-
34 struct ScalarQuantizer {
-
35 
-
36  enum QuantizerType {
-
37  QT_8bit, ///< 8 bits per component
-
38  QT_4bit, ///< 4 bits per component
-
39  QT_8bit_uniform, ///< same, shared range for all dimensions
-
40  QT_4bit_uniform,
-
41  };
-
42 
-
43  QuantizerType qtype;
-
44 
-
45  /** The uniform encoder can estimate the range of representable
-
46  * values of the unform encoder using different statistics. Here
-
47  * rs = rangestat_arg */
-
48 
-
49  // rangestat_arg.
-
50  enum RangeStat {
-
51  RS_minmax, ///< [min - rs*(max-min), max + rs*(max-min)]
-
52  RS_meanstd, ///< [mean - std * rs, mean + std * rs]
-
53  RS_quantiles, ///< [Q(rs), Q(1-rs)]
-
54  RS_optim, ///< alternate optimization of reconstruction error
-
55  };
-
56 
-
57  RangeStat rangestat;
-
58  float rangestat_arg;
-
59 
-
60  /// dimension of input vectors
-
61  size_t d;
-
62 
-
63  /// bytes per vector
-
64  size_t code_size;
-
65 
-
66  /// trained values (including the range)
-
67  std::vector<float> trained;
-
68 
-
69  ScalarQuantizer (size_t d, QuantizerType qtype);
-
70  ScalarQuantizer ();
-
71 
-
72  void train (size_t n, const float *x);
-
73 
-
74 
-
75  /// same as compute_code for several vectors
-
76  void compute_codes (const float * x,
-
77  uint8_t * codes,
-
78  size_t n) const ;
-
79 
-
80  /// decode a vector from a given code (or n vectors if third argument)
-
81  void decode (const uint8_t *code, float *x, size_t n) const;
-
82 
-
83 };
-
84 
-
85 
-
86 struct IndexIVFScalarQuantizer:IndexIVF {
-
87  ScalarQuantizer sq;
-
88 
-
89  size_t code_size;
-
90 
-
91  /// inverted list codes.
-
92  std::vector<std::vector<uint8_t> > codes;
-
93 
-
94  IndexIVFScalarQuantizer(Index *quantizer, size_t d, size_t nlist,
-
95  ScalarQuantizer::QuantizerType qtype,
-
96  MetricType metric = METRIC_L2);
-
97 
-
98  IndexIVFScalarQuantizer();
-
99 
-
100  void train_residual(idx_t n, const float* x) override;
-
101 
-
102  void add_with_ids(idx_t n, const float* x, const long* xids) override;
-
103 
-
104  void search(
-
105  idx_t n,
-
106  const float* x,
-
107  idx_t k,
-
108  float* distances,
-
109  idx_t* labels) const override;
-
110 
-
111  void merge_from_residuals(IndexIVF& other) override;
-
112 };
-
113 
-
114 
-
115 }
-
116 
-
117 
-
118 #endif
- -
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexIVFScalarQuantizer.h:64
- -
faiss::ScalarQuantizer::trained
std::vector< float > trained
trained values (including the range)
Definition: IndexIVFScalarQuantizer.h:67
-
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexIVFScalarQuantizer.cpp:714
-
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVFScalarQuantizer.cpp:849
-
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVFScalarQuantizer.cpp:882
- -
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexIVFScalarQuantizer.h:54
-
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexIVFScalarQuantizer.cpp:733
-
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
-
faiss::IndexIVF::quantizer
Index * quantizer
quantizer that maps vectors to inverted lists
Definition: IndexIVF.h:49
-
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
-
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexIVFScalarQuantizer.h:39
- - - - -
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexIVFScalarQuantizer.cpp:685
-
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexIVFScalarQuantizer.cpp:674
- -
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexIVFScalarQuantizer.h:51
-
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
- -
faiss::IndexIVFScalarQuantizer::codes
std::vector< std::vector< uint8_t > > codes
inverted list codes.
Definition: IndexIVFScalarQuantizer.h:92
-
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexIVFScalarQuantizer.h:52
-
faiss::ScalarQuantizer::d
size_t d
dimension of input vectors
Definition: IndexIVFScalarQuantizer.h:61
-
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
-
- -
-Generated by   -doxygen - 1.8.5 -
- - diff --git a/docs/html/IndexIVF_8cpp_source.html b/docs/html/IndexIVF_8cpp_source.html index 9d09fcfff..2a18e22a4 100644 --- a/docs/html/IndexIVF_8cpp_source.html +++ b/docs/html/IndexIVF_8cpp_source.html @@ -192,7 +192,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
107  } else if (quantizer_trains_alone) {
108  if (verbose)
109  printf ("IVF quantizer trains alone...\n");
-
110  quantizer->train (n, x);
+
110  quantizer->train (n, x);
111  FAISS_THROW_IF_NOT_MSG (quantizer->ntotal == nlist,
112  "nlist not consistent with quantizer size");
113  } else {
@@ -213,636 +213,636 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
128  is_trained = true;
129 }
130 
-
131 void IndexIVF::train_residual (idx_t n, const float *x)
-
132 {
-
133  if (verbose)
-
134  printf ("IndexIVF: no residual training\n");
-
135  // does nothing by default
-
136 }
+
131 void IndexIVF::train_residual(idx_t /*n*/, const float* /*x*/) {
+
132  if (verbose)
+
133  printf("IndexIVF: no residual training\n");
+
134  // does nothing by default
+
135 }
+
136 
137 
138 
-
139 
-
140 double IndexIVF::imbalance_factor () const
-
141 {
-
142  std::vector<int> hist (nlist);
-
143  for (int i = 0; i < nlist; i++) {
-
144  hist[i] = ids[i].size();
-
145  }
-
146  return faiss::imbalance_factor (nlist, hist.data());
-
147 }
-
148 
-
149 void IndexIVF::print_stats () const
-
150 {
-
151  std::vector<int> sizes(40);
-
152  for (int i = 0; i < nlist; i++) {
-
153  for (int j = 0; j < sizes.size(); j++) {
-
154  if ((ids[i].size() >> j) == 0) {
-
155  sizes[j]++;
-
156  break;
-
157  }
-
158  }
-
159  }
-
160  for (int i = 0; i < sizes.size(); i++) {
-
161  if (sizes[i]) {
-
162  printf ("list size in < %d: %d instances\n",
-
163  1 << i, sizes[i]);
-
164  }
-
165  }
-
166 
-
167 }
-
168 
-
169 void IndexIVF::merge_from (IndexIVF &other, idx_t add_id)
-
170 {
-
171  // minimal sanity checks
-
172  FAISS_THROW_IF_NOT (other.d == d);
-
173  FAISS_THROW_IF_NOT (other.nlist == nlist);
-
174  FAISS_THROW_IF_NOT_MSG ((!maintain_direct_map &&
-
175  !other.maintain_direct_map),
-
176  "direct map copy not implemented");
-
177  FAISS_THROW_IF_NOT_MSG (typeid (*this) == typeid (other),
-
178  "can only merge indexes of the same type");
-
179  for (long i = 0; i < nlist; i++) {
-
180  std::vector<idx_t> & src = other.ids[i];
-
181  std::vector<idx_t> & dest = ids[i];
-
182  for (long j = 0; j < src.size(); j++)
-
183  dest.push_back (src[j] + add_id);
-
184  src.clear();
-
185  }
-
186  merge_from_residuals (other);
-
187  ntotal += other.ntotal;
-
188  other.ntotal = 0;
-
189 }
+
139 double IndexIVF::imbalance_factor () const
+
140 {
+
141  std::vector<int> hist (nlist);
+
142  for (int i = 0; i < nlist; i++) {
+
143  hist[i] = ids[i].size();
+
144  }
+
145  return faiss::imbalance_factor (nlist, hist.data());
+
146 }
+
147 
+
148 void IndexIVF::print_stats () const
+
149 {
+
150  std::vector<int> sizes(40);
+
151  for (int i = 0; i < nlist; i++) {
+
152  for (int j = 0; j < sizes.size(); j++) {
+
153  if ((ids[i].size() >> j) == 0) {
+
154  sizes[j]++;
+
155  break;
+
156  }
+
157  }
+
158  }
+
159  for (int i = 0; i < sizes.size(); i++) {
+
160  if (sizes[i]) {
+
161  printf ("list size in < %d: %d instances\n",
+
162  1 << i, sizes[i]);
+
163  }
+
164  }
+
165 
+
166 }
+
167 
+
168 void IndexIVF::merge_from (IndexIVF &other, idx_t add_id)
+
169 {
+
170  // minimal sanity checks
+
171  FAISS_THROW_IF_NOT (other.d == d);
+
172  FAISS_THROW_IF_NOT (other.nlist == nlist);
+
173  FAISS_THROW_IF_NOT_MSG ((!maintain_direct_map &&
+
174  !other.maintain_direct_map),
+
175  "direct map copy not implemented");
+
176  FAISS_THROW_IF_NOT_MSG (typeid (*this) == typeid (other),
+
177  "can only merge indexes of the same type");
+
178  for (long i = 0; i < nlist; i++) {
+
179  std::vector<idx_t> & src = other.ids[i];
+
180  std::vector<idx_t> & dest = ids[i];
+
181  for (long j = 0; j < src.size(); j++)
+
182  dest.push_back (src[j] + add_id);
+
183  src.clear();
+
184  }
+
185  merge_from_residuals (other);
+
186  ntotal += other.ntotal;
+
187  other.ntotal = 0;
+
188 }
+
189 
190 
191 
-
192 
-
193 IndexIVF::~IndexIVF()
-
194 {
-
195  if (own_fields) delete quantizer;
-
196 }
+
192 IndexIVF::~IndexIVF()
+
193 {
+
194  if (own_fields) delete quantizer;
+
195 }
+
196 
197 
198 
-
199 
-
200 /*****************************************
-
201  * IndexIVFFlat implementation
-
202  ******************************************/
-
203 
-
204 IndexIVFFlat::IndexIVFFlat (Index * quantizer,
-
205  size_t d, size_t nlist, MetricType metric):
-
206  IndexIVF (quantizer, d, nlist, metric)
-
207 {
-
208  vecs.resize (nlist);
-
209 }
+
199 /*****************************************
+
200  * IndexIVFFlat implementation
+
201  ******************************************/
+
202 
+
203 IndexIVFFlat::IndexIVFFlat (Index * quantizer,
+
204  size_t d, size_t nlist, MetricType metric):
+
205  IndexIVF (quantizer, d, nlist, metric)
+
206 {
+
207  vecs.resize (nlist);
+
208 }
+
209 
210 
211 
212 
213 
214 
-
215 
-
216 void IndexIVFFlat::add_with_ids (idx_t n, const float * x, const long *xids)
-
217 {
-
218  add_core (n, x, xids, nullptr);
-
219 }
-
220 
-
221 void IndexIVFFlat::add_core (idx_t n, const float * x, const long *xids,
-
222  const long *precomputed_idx)
-
223 
-
224 {
-
225  FAISS_THROW_IF_NOT (is_trained);
-
226  FAISS_THROW_IF_NOT_MSG (!(maintain_direct_map && xids),
-
227  "cannot have direct map and add with ids");
-
228  const long * idx;
-
229  ScopeDeleter<long> del;
-
230 
-
231  if (precomputed_idx) {
-
232  idx = precomputed_idx;
-
233  } else {
-
234  long * idx0 = new long [n];
-
235  quantizer->assign (n, x, idx0);
-
236  idx = idx0;
-
237  del.set (idx);
-
238  }
-
239  long n_add = 0;
-
240  for (size_t i = 0; i < n; i++) {
-
241  long id = xids ? xids[i] : ntotal + i;
-
242  long list_no = idx [i];
-
243  if (list_no < 0)
-
244  continue;
-
245  assert (list_no < nlist);
-
246 
-
247  ids[list_no].push_back (id);
-
248  const float *xi = x + i * d;
-
249  /* store the vectors */
-
250  for (size_t j = 0 ; j < d ; j++)
-
251  vecs[list_no].push_back (xi [j]);
-
252 
-
253  if (maintain_direct_map)
-
254  direct_map.push_back (list_no << 32 | (ids[list_no].size() - 1));
-
255  n_add++;
-
256  }
-
257  if (verbose) {
-
258  printf("IndexIVFFlat::add_core: added %ld / %ld vectors\n",
-
259  n_add, n);
-
260  }
-
261  ntotal += n_add;
-
262 }
-
263 
-
264 void IndexIVFFlatStats::reset()
-
265 {
-
266  memset ((void*)this, 0, sizeof (*this));
-
267 }
+
215 void IndexIVFFlat::add_with_ids (idx_t n, const float * x, const long *xids)
+
216 {
+
217  add_core (n, x, xids, nullptr);
+
218 }
+
219 
+
220 void IndexIVFFlat::add_core (idx_t n, const float * x, const long *xids,
+
221  const long *precomputed_idx)
+
222 
+
223 {
+
224  FAISS_THROW_IF_NOT (is_trained);
+
225  FAISS_THROW_IF_NOT_MSG (!(maintain_direct_map && xids),
+
226  "cannot have direct map and add with ids");
+
227  const long * idx;
+
228  ScopeDeleter<long> del;
+
229 
+
230  if (precomputed_idx) {
+
231  idx = precomputed_idx;
+
232  } else {
+
233  long * idx0 = new long [n];
+
234  quantizer->assign (n, x, idx0);
+
235  idx = idx0;
+
236  del.set (idx);
+
237  }
+
238  long n_add = 0;
+
239  for (size_t i = 0; i < n; i++) {
+
240  long id = xids ? xids[i] : ntotal + i;
+
241  long list_no = idx [i];
+
242  if (list_no < 0)
+
243  continue;
+
244  assert (list_no < nlist);
+
245 
+
246  ids[list_no].push_back (id);
+
247  const float *xi = x + i * d;
+
248  /* store the vectors */
+
249  for (size_t j = 0 ; j < d ; j++)
+
250  vecs[list_no].push_back (xi [j]);
+
251 
+
252  if (maintain_direct_map)
+
253  direct_map.push_back (list_no << 32 | (ids[list_no].size() - 1));
+
254  n_add++;
+
255  }
+
256  if (verbose) {
+
257  printf("IndexIVFFlat::add_core: added %ld / %ld vectors\n",
+
258  n_add, n);
+
259  }
+
260  ntotal += n_add;
+
261 }
+
262 
+
263 void IndexIVFFlatStats::reset()
+
264 {
+
265  memset ((void*)this, 0, sizeof (*this));
+
266 }
+
267 
268 
-
269 
-
270 IndexIVFFlatStats indexIVFFlat_stats;
-
271 
-
272 void IndexIVFFlat::search_knn_inner_product (
-
273  size_t nx,
-
274  const float * x,
-
275  const long * __restrict keys,
-
276  float_minheap_array_t * res) const
-
277 {
-
278 
-
279  const size_t k = res->k;
-
280  size_t nlistv = 0, ndis = 0;
-
281 
-
282 #pragma omp parallel for reduction(+: nlistv, ndis)
-
283  for (size_t i = 0; i < nx; i++) {
-
284  const float * xi = x + i * d;
-
285  const long * keysi = keys + i * nprobe;
-
286  float * __restrict simi = res->get_val (i);
-
287  long * __restrict idxi = res->get_ids (i);
-
288  minheap_heapify (k, simi, idxi);
-
289 
-
290  for (size_t ik = 0; ik < nprobe; ik++) {
-
291  long key = keysi[ik]; /* select the list */
-
292  if (key < 0) {
-
293  // not enough centroids for multiprobe
-
294  continue;
-
295  }
-
296  if (key >= (long) nlist) {
-
297  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
-
298  key, ik, nlist);
-
299  throw;
-
300  }
-
301  nlistv++;
-
302  const size_t list_size = ids[key].size();
-
303  const float * list_vecs = vecs[key].data();
-
304 
-
305  for (size_t j = 0; j < list_size; j++) {
-
306  const float * yj = list_vecs + d * j;
-
307  float ip = fvec_inner_product (xi, yj, d);
-
308  if (ip > simi[0]) {
-
309  minheap_pop (k, simi, idxi);
-
310  minheap_push (k, simi, idxi, ip, ids[key][j]);
-
311  }
-
312  }
-
313  ndis += list_size;
-
314  }
-
315  minheap_reorder (k, simi, idxi);
-
316  }
-
317  indexIVFFlat_stats.nq += nx;
-
318  indexIVFFlat_stats.nlist += nlistv;
-
319  indexIVFFlat_stats.ndis += ndis;
-
320 }
+
269 IndexIVFFlatStats indexIVFFlat_stats;
+
270 
+
271 void IndexIVFFlat::search_knn_inner_product (
+
272  size_t nx,
+
273  const float * x,
+
274  const long * __restrict keys,
+
275  float_minheap_array_t * res) const
+
276 {
+
277 
+
278  const size_t k = res->k;
+
279  size_t nlistv = 0, ndis = 0;
+
280 
+
281 #pragma omp parallel for reduction(+: nlistv, ndis)
+
282  for (size_t i = 0; i < nx; i++) {
+
283  const float * xi = x + i * d;
+
284  const long * keysi = keys + i * nprobe;
+
285  float * __restrict simi = res->get_val (i);
+
286  long * __restrict idxi = res->get_ids (i);
+
287  minheap_heapify (k, simi, idxi);
+
288 
+
289  for (size_t ik = 0; ik < nprobe; ik++) {
+
290  long key = keysi[ik]; /* select the list */
+
291  if (key < 0) {
+
292  // not enough centroids for multiprobe
+
293  continue;
+
294  }
+
295  if (key >= (long) nlist) {
+
296  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
+
297  key, ik, nlist);
+
298  throw;
+
299  }
+
300  nlistv++;
+
301  const size_t list_size = ids[key].size();
+
302  const float * list_vecs = vecs[key].data();
+
303 
+
304  for (size_t j = 0; j < list_size; j++) {
+
305  const float * yj = list_vecs + d * j;
+
306  float ip = fvec_inner_product (xi, yj, d);
+
307  if (ip > simi[0]) {
+
308  minheap_pop (k, simi, idxi);
+
309  minheap_push (k, simi, idxi, ip, ids[key][j]);
+
310  }
+
311  }
+
312  ndis += list_size;
+
313  }
+
314  minheap_reorder (k, simi, idxi);
+
315  }
+
316  indexIVFFlat_stats.nq += nx;
+
317  indexIVFFlat_stats.nlist += nlistv;
+
318  indexIVFFlat_stats.ndis += ndis;
+
319 }
+
320 
321 
-
322 
-
323 void IndexIVFFlat::search_knn_L2sqr (
-
324  size_t nx,
-
325  const float * x,
-
326  const long * __restrict keys,
-
327  float_maxheap_array_t * res) const
-
328 {
-
329  const size_t k = res->k;
-
330  size_t nlistv = 0, ndis = 0;
-
331 
-
332 #pragma omp parallel for reduction(+: nlistv, ndis)
-
333  for (size_t i = 0; i < nx; i++) {
-
334  const float * xi = x + i * d;
-
335  const long * keysi = keys + i * nprobe;
-
336  float * __restrict disi = res->get_val (i);
-
337  long * __restrict idxi = res->get_ids (i);
-
338  maxheap_heapify (k, disi, idxi);
-
339 
-
340  for (size_t ik = 0; ik < nprobe; ik++) {
-
341  long key = keysi[ik]; /* select the list */
-
342  if (key < 0) {
-
343  // not enough centroids for multiprobe
-
344  continue;
-
345  }
-
346  if (key >= (long) nlist) {
-
347  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
-
348  key, ik, nlist);
-
349  throw;
-
350  }
-
351  nlistv++;
-
352  const size_t list_size = ids[key].size();
-
353  const float * list_vecs = vecs[key].data();
-
354 
-
355  for (size_t j = 0; j < list_size; j++) {
-
356  const float * yj = list_vecs + d * j;
-
357  float disij = fvec_L2sqr (xi, yj, d);
-
358  if (disij < disi[0]) {
-
359  maxheap_pop (k, disi, idxi);
-
360  maxheap_push (k, disi, idxi, disij, ids[key][j]);
-
361  }
-
362  }
-
363  ndis += list_size;
-
364  }
-
365  maxheap_reorder (k, disi, idxi);
-
366  }
-
367  indexIVFFlat_stats.nq += nx;
-
368  indexIVFFlat_stats.nlist += nlistv;
-
369  indexIVFFlat_stats.ndis += ndis;
-
370 }
+
322 void IndexIVFFlat::search_knn_L2sqr (
+
323  size_t nx,
+
324  const float * x,
+
325  const long * __restrict keys,
+
326  float_maxheap_array_t * res) const
+
327 {
+
328  const size_t k = res->k;
+
329  size_t nlistv = 0, ndis = 0;
+
330 
+
331 #pragma omp parallel for reduction(+: nlistv, ndis)
+
332  for (size_t i = 0; i < nx; i++) {
+
333  const float * xi = x + i * d;
+
334  const long * keysi = keys + i * nprobe;
+
335  float * __restrict disi = res->get_val (i);
+
336  long * __restrict idxi = res->get_ids (i);
+
337  maxheap_heapify (k, disi, idxi);
+
338 
+
339  for (size_t ik = 0; ik < nprobe; ik++) {
+
340  long key = keysi[ik]; /* select the list */
+
341  if (key < 0) {
+
342  // not enough centroids for multiprobe
+
343  continue;
+
344  }
+
345  if (key >= (long) nlist) {
+
346  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
+
347  key, ik, nlist);
+
348  throw;
+
349  }
+
350  nlistv++;
+
351  const size_t list_size = ids[key].size();
+
352  const float * list_vecs = vecs[key].data();
+
353 
+
354  for (size_t j = 0; j < list_size; j++) {
+
355  const float * yj = list_vecs + d * j;
+
356  float disij = fvec_L2sqr (xi, yj, d);
+
357  if (disij < disi[0]) {
+
358  maxheap_pop (k, disi, idxi);
+
359  maxheap_push (k, disi, idxi, disij, ids[key][j]);
+
360  }
+
361  }
+
362  ndis += list_size;
+
363  }
+
364  maxheap_reorder (k, disi, idxi);
+
365  }
+
366  indexIVFFlat_stats.nq += nx;
+
367  indexIVFFlat_stats.nlist += nlistv;
+
368  indexIVFFlat_stats.ndis += ndis;
+
369 }
+
370 
371 
-
372 
-
373 void IndexIVFFlat::search (idx_t n, const float *x, idx_t k,
-
374  float *distances, idx_t *labels) const
-
375 {
-
376  idx_t * idx = new idx_t [n * nprobe];
-
377  ScopeDeleter <idx_t> del (idx);
-
378  quantizer->assign (n, x, idx, nprobe);
-
379  search_preassigned (n, x, k, idx, distances, labels);
-
380 }
+
372 void IndexIVFFlat::search (idx_t n, const float *x, idx_t k,
+
373  float *distances, idx_t *labels) const
+
374 {
+
375  idx_t * idx = new idx_t [n * nprobe];
+
376  ScopeDeleter <idx_t> del (idx);
+
377  quantizer->assign (n, x, idx, nprobe);
+
378  search_preassigned (n, x, k, idx, distances, labels);
+
379 }
+
380 
381 
-
382 
-
383 void IndexIVFFlat::search_preassigned (idx_t n, const float *x, idx_t k,
-
384  const idx_t *idx,
-
385  float *distances, idx_t *labels) const
-
386 {
-
387  if (metric_type == METRIC_INNER_PRODUCT) {
-
388  float_minheap_array_t res = {
-
389  size_t(n), size_t(k), labels, distances};
-
390  search_knn_inner_product (n, x, idx, &res);
-
391 
-
392  } else if (metric_type == METRIC_L2) {
-
393  float_maxheap_array_t res = {
-
394  size_t(n), size_t(k), labels, distances};
-
395  search_knn_L2sqr (n, x, idx, &res);
-
396  }
-
397 
-
398 }
+
382 void IndexIVFFlat::search_preassigned (idx_t n, const float *x, idx_t k,
+
383  const idx_t *idx,
+
384  float *distances, idx_t *labels) const
+
385 {
+
386  if (metric_type == METRIC_INNER_PRODUCT) {
+
387  float_minheap_array_t res = {
+
388  size_t(n), size_t(k), labels, distances};
+
389  search_knn_inner_product (n, x, idx, &res);
+
390 
+
391  } else if (metric_type == METRIC_L2) {
+
392  float_maxheap_array_t res = {
+
393  size_t(n), size_t(k), labels, distances};
+
394  search_knn_L2sqr (n, x, idx, &res);
+
395  }
+
396 
+
397 }
+
398 
399 
-
400 
-
401 void IndexIVFFlat::range_search (idx_t nx, const float *x, float radius,
-
402  RangeSearchResult *result) const
-
403 {
-
404  idx_t * keys = new idx_t [nx * nprobe];
-
405  ScopeDeleter<idx_t> del (keys);
-
406  quantizer->assign (nx, x, keys, nprobe);
-
407 
-
408 #pragma omp parallel
-
409  {
-
410  RangeSearchPartialResult pres(result);
-
411 
-
412  for (size_t i = 0; i < nx; i++) {
-
413  const float * xi = x + i * d;
-
414  const long * keysi = keys + i * nprobe;
-
415 
-
416  RangeSearchPartialResult::QueryResult & qres =
-
417  pres.new_result (i);
-
418 
-
419  for (size_t ik = 0; ik < nprobe; ik++) {
-
420  long key = keysi[ik]; /* select the list */
-
421  if (key < 0 || key >= (long) nlist) {
-
422  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
-
423  key, ik, nlist);
-
424  throw;
-
425  }
-
426 
-
427  const size_t list_size = ids[key].size();
-
428  const float * list_vecs = vecs[key].data();
-
429 
-
430  for (size_t j = 0; j < list_size; j++) {
-
431  const float * yj = list_vecs + d * j;
-
432  if (metric_type == METRIC_L2) {
-
433  float disij = fvec_L2sqr (xi, yj, d);
-
434  if (disij < radius) {
-
435  qres.add (disij, ids[key][j]);
-
436  }
-
437  } else if (metric_type == METRIC_INNER_PRODUCT) {
-
438  float disij = fvec_inner_product(xi, yj, d);
-
439  if (disij > radius) {
-
440  qres.add (disij, ids[key][j]);
-
441  }
-
442  }
-
443  }
-
444  }
-
445  }
-
446 
-
447  pres.finalize ();
-
448  }
-
449 }
-
450 
-
451 void IndexIVFFlat::merge_from_residuals (IndexIVF &other_in)
-
452 {
-
453  IndexIVFFlat &other = dynamic_cast<IndexIVFFlat &> (other_in);
-
454  for (int i = 0; i < nlist; i++) {
-
455  std::vector<float> & src = other.vecs[i];
-
456  std::vector<float> & dest = vecs[i];
-
457  for (int j = 0; j < src.size(); j++)
-
458  dest.push_back (src[j]);
-
459  src.clear();
-
460  }
-
461 }
-
462 
-
463 void IndexIVFFlat::copy_subset_to (IndexIVFFlat & other, int subset_type,
-
464  long a1, long a2) const
-
465 {
-
466  FAISS_THROW_IF_NOT (nlist == other.nlist);
-
467  FAISS_THROW_IF_NOT (!other.maintain_direct_map);
-
468 
-
469  for (long list_no = 0; list_no < nlist; list_no++) {
-
470  const std::vector<idx_t> & ids_in = ids[list_no];
-
471  std::vector<idx_t> & ids_out = other.ids[list_no];
-
472  const std::vector<float> & vecs_in = vecs[list_no];
-
473  std::vector<float> & vecs_out = other.vecs[list_no];
-
474 
-
475  for (long i = 0; i < ids_in.size(); i++) {
-
476  idx_t id = ids_in[i];
-
477  if (subset_type == 0 && a1 <= id && id < a2) {
-
478  ids_out.push_back (id);
-
479  vecs_out.insert (vecs_out.end(),
-
480  vecs_in.begin() + i * d,
-
481  vecs_in.begin() + (i + 1) * d);
-
482  other.ntotal++;
-
483  }
-
484  }
-
485  }
-
486 }
-
487 
-
488 void IndexIVFFlat::update_vectors (int n, idx_t *new_ids, const float *x)
-
489 {
-
490  FAISS_THROW_IF_NOT (maintain_direct_map);
-
491  FAISS_THROW_IF_NOT (is_trained);
-
492  std::vector<idx_t> assign (n);
-
493  quantizer->assign (n, x, assign.data());
-
494 
-
495  for (int i = 0; i < n; i++) {
-
496  idx_t id = new_ids[i];
-
497  FAISS_THROW_IF_NOT_MSG (0 <= id && id < ntotal,
-
498  "id to update out of range");
-
499  { // remove old one
-
500  long dm = direct_map[id];
-
501  long ofs = dm & 0xffffffff;
-
502  long il = dm >> 32;
-
503  size_t l = ids[il].size();
-
504  if (ofs != l - 1) {
-
505  long id2 = ids[il].back();
-
506  ids[il][ofs] = id2;
-
507  direct_map[id2] = (il << 32) | ofs;
-
508  memcpy (vecs[il].data() + ofs * d,
-
509  vecs[il].data() + (l - 1) * d,
-
510  d * sizeof(vecs[il][0]));
-
511  }
-
512  ids[il].pop_back();
-
513  vecs[il].resize((l - 1) * d);
-
514  }
-
515  { // insert new one
-
516  long il = assign[i];
-
517  size_t l = ids[il].size();
-
518  long dm = (il << 32) | l;
-
519  direct_map[id] = dm;
-
520  ids[il].push_back (id);
-
521  vecs[il].resize((l + 1) * d);
-
522  memcpy (vecs[il].data() + l * d,
-
523  x + i * d,
-
524  d * sizeof(vecs[il][0]));
-
525  }
-
526  }
-
527 
-
528 }
+
400 void IndexIVFFlat::range_search (idx_t nx, const float *x, float radius,
+
401  RangeSearchResult *result) const
+
402 {
+
403  idx_t * keys = new idx_t [nx * nprobe];
+
404  ScopeDeleter<idx_t> del (keys);
+
405  quantizer->assign (nx, x, keys, nprobe);
+
406 
+
407 #pragma omp parallel
+
408  {
+
409  RangeSearchPartialResult pres(result);
+
410 
+
411  for (size_t i = 0; i < nx; i++) {
+
412  const float * xi = x + i * d;
+
413  const long * keysi = keys + i * nprobe;
+
414 
+
415  RangeSearchPartialResult::QueryResult & qres =
+
416  pres.new_result (i);
+
417 
+
418  for (size_t ik = 0; ik < nprobe; ik++) {
+
419  long key = keysi[ik]; /* select the list */
+
420  if (key < 0 || key >= (long) nlist) {
+
421  fprintf (stderr, "Invalid key=%ld at ik=%ld nlist=%ld\n",
+
422  key, ik, nlist);
+
423  throw;
+
424  }
+
425 
+
426  const size_t list_size = ids[key].size();
+
427  const float * list_vecs = vecs[key].data();
+
428 
+
429  for (size_t j = 0; j < list_size; j++) {
+
430  const float * yj = list_vecs + d * j;
+
431  if (metric_type == METRIC_L2) {
+
432  float disij = fvec_L2sqr (xi, yj, d);
+
433  if (disij < radius) {
+
434  qres.add (disij, ids[key][j]);
+
435  }
+
436  } else if (metric_type == METRIC_INNER_PRODUCT) {
+
437  float disij = fvec_inner_product(xi, yj, d);
+
438  if (disij > radius) {
+
439  qres.add (disij, ids[key][j]);
+
440  }
+
441  }
+
442  }
+
443  }
+
444  }
+
445 
+
446  pres.finalize ();
+
447  }
+
448 }
+
449 
+
450 void IndexIVFFlat::merge_from_residuals (IndexIVF &other_in)
+
451 {
+
452  IndexIVFFlat &other = dynamic_cast<IndexIVFFlat &> (other_in);
+
453  for (int i = 0; i < nlist; i++) {
+
454  std::vector<float> & src = other.vecs[i];
+
455  std::vector<float> & dest = vecs[i];
+
456  for (int j = 0; j < src.size(); j++)
+
457  dest.push_back (src[j]);
+
458  src.clear();
+
459  }
+
460 }
+
461 
+
462 void IndexIVFFlat::copy_subset_to (IndexIVFFlat & other, int subset_type,
+
463  long a1, long a2) const
+
464 {
+
465  FAISS_THROW_IF_NOT (nlist == other.nlist);
+
466  FAISS_THROW_IF_NOT (!other.maintain_direct_map);
+
467 
+
468  for (long list_no = 0; list_no < nlist; list_no++) {
+
469  const std::vector<idx_t> & ids_in = ids[list_no];
+
470  std::vector<idx_t> & ids_out = other.ids[list_no];
+
471  const std::vector<float> & vecs_in = vecs[list_no];
+
472  std::vector<float> & vecs_out = other.vecs[list_no];
+
473 
+
474  for (long i = 0; i < ids_in.size(); i++) {
+
475  idx_t id = ids_in[i];
+
476  if (subset_type == 0 && a1 <= id && id < a2) {
+
477  ids_out.push_back (id);
+
478  vecs_out.insert (vecs_out.end(),
+
479  vecs_in.begin() + i * d,
+
480  vecs_in.begin() + (i + 1) * d);
+
481  other.ntotal++;
+
482  }
+
483  }
+
484  }
+
485 }
+
486 
+
487 void IndexIVFFlat::update_vectors (int n, idx_t *new_ids, const float *x)
+
488 {
+
489  FAISS_THROW_IF_NOT (maintain_direct_map);
+
490  FAISS_THROW_IF_NOT (is_trained);
+
491  std::vector<idx_t> assign (n);
+
492  quantizer->assign (n, x, assign.data());
+
493 
+
494  for (int i = 0; i < n; i++) {
+
495  idx_t id = new_ids[i];
+
496  FAISS_THROW_IF_NOT_MSG (0 <= id && id < ntotal,
+
497  "id to update out of range");
+
498  { // remove old one
+
499  long dm = direct_map[id];
+
500  long ofs = dm & 0xffffffff;
+
501  long il = dm >> 32;
+
502  size_t l = ids[il].size();
+
503  if (ofs != l - 1) {
+
504  long id2 = ids[il].back();
+
505  ids[il][ofs] = id2;
+
506  direct_map[id2] = (il << 32) | ofs;
+
507  memcpy (vecs[il].data() + ofs * d,
+
508  vecs[il].data() + (l - 1) * d,
+
509  d * sizeof(vecs[il][0]));
+
510  }
+
511  ids[il].pop_back();
+
512  vecs[il].resize((l - 1) * d);
+
513  }
+
514  { // insert new one
+
515  long il = assign[i];
+
516  size_t l = ids[il].size();
+
517  long dm = (il << 32) | l;
+
518  direct_map[id] = dm;
+
519  ids[il].push_back (id);
+
520  vecs[il].resize((l + 1) * d);
+
521  memcpy (vecs[il].data() + l * d,
+
522  x + i * d,
+
523  d * sizeof(vecs[il][0]));
+
524  }
+
525  }
+
526 
+
527 }
+
528 
529 
530 
531 
-
532 
-
533 void IndexIVFFlat::reset()
-
534 {
-
535  IndexIVF::reset();
-
536  for (size_t key = 0; key < nlist; key++) {
-
537  vecs[key].clear();
-
538  }
-
539 }
-
540 
-
541 long IndexIVFFlat::remove_ids (const IDSelector & sel)
-
542 {
-
543  FAISS_THROW_IF_NOT_MSG (!maintain_direct_map,
-
544  "direct map remove not implemented");
-
545  long nremove = 0;
-
546 #pragma omp parallel for reduction(+: nremove)
-
547  for (long i = 0; i < nlist; i++) {
-
548  std::vector<idx_t> & idsi = ids[i];
-
549  float *vecsi = vecs[i].data();
-
550 
-
551  long l = idsi.size(), j = 0;
-
552  while (j < l) {
-
553  if (sel.is_member (idsi[j])) {
-
554  l--;
-
555  idsi [j] = idsi [l];
-
556  memmove (vecsi + j * d,
-
557  vecsi + l * d, d * sizeof (float));
-
558  } else {
-
559  j++;
-
560  }
-
561  }
-
562  if (l < idsi.size()) {
-
563  nremove += idsi.size() - l;
-
564  idsi.resize (l);
-
565  vecs[i].resize (l * d);
-
566  }
-
567  }
-
568  ntotal -= nremove;
-
569  return nremove;
-
570 }
+
532 void IndexIVFFlat::reset()
+
533 {
+
534  IndexIVF::reset();
+
535  for (size_t key = 0; key < nlist; key++) {
+
536  vecs[key].clear();
+
537  }
+
538 }
+
539 
+
540 long IndexIVFFlat::remove_ids (const IDSelector & sel)
+
541 {
+
542  FAISS_THROW_IF_NOT_MSG (!maintain_direct_map,
+
543  "direct map remove not implemented");
+
544  long nremove = 0;
+
545 #pragma omp parallel for reduction(+: nremove)
+
546  for (long i = 0; i < nlist; i++) {
+
547  std::vector<idx_t> & idsi = ids[i];
+
548  float *vecsi = vecs[i].data();
+
549 
+
550  long l = idsi.size(), j = 0;
+
551  while (j < l) {
+
552  if (sel.is_member (idsi[j])) {
+
553  l--;
+
554  idsi [j] = idsi [l];
+
555  memmove (vecsi + j * d,
+
556  vecsi + l * d, d * sizeof (float));
+
557  } else {
+
558  j++;
+
559  }
+
560  }
+
561  if (l < idsi.size()) {
+
562  nremove += idsi.size() - l;
+
563  idsi.resize (l);
+
564  vecs[i].resize (l * d);
+
565  }
+
566  }
+
567  ntotal -= nremove;
+
568  return nremove;
+
569 }
+
570 
571 
-
572 
-
573 void IndexIVFFlat::reconstruct (idx_t key, float * recons) const
-
574 {
-
575  FAISS_THROW_IF_NOT_MSG (direct_map.size() == ntotal,
-
576  "direct map is not initialized");
-
577  int list_no = direct_map[key] >> 32;
-
578  int ofs = direct_map[key] & 0xffffffff;
-
579  memcpy (recons, &vecs[list_no][ofs * d], d * sizeof(recons[0]));
-
580 }
+
572 void IndexIVFFlat::reconstruct (idx_t key, float * recons) const
+
573 {
+
574  FAISS_THROW_IF_NOT_MSG (direct_map.size() == ntotal,
+
575  "direct map is not initialized");
+
576  int list_no = direct_map[key] >> 32;
+
577  int ofs = direct_map[key] & 0xffffffff;
+
578  memcpy (recons, &vecs[list_no][ofs * d], d * sizeof(recons[0]));
+
579 }
+
580 
581 
582 
583 
-
584 
-
585 /*****************************************
-
586  * IndexIVFFlatIPBounds implementation
-
587  ******************************************/
-
588 
-
589 IndexIVFFlatIPBounds::IndexIVFFlatIPBounds (
-
590  Index * quantizer, size_t d, size_t nlist,
-
591  size_t fsize):
-
592  IndexIVFFlat(quantizer, d, nlist, METRIC_INNER_PRODUCT), fsize(fsize)
-
593 {
-
594  part_norms.resize(nlist);
-
595 }
+
584 /*****************************************
+
585  * IndexIVFFlatIPBounds implementation
+
586  ******************************************/
+
587 
+
588 IndexIVFFlatIPBounds::IndexIVFFlatIPBounds (
+
589  Index * quantizer, size_t d, size_t nlist,
+
590  size_t fsize):
+
591  IndexIVFFlat(quantizer, d, nlist, METRIC_INNER_PRODUCT), fsize(fsize)
+
592 {
+
593  part_norms.resize(nlist);
+
594 }
+
595 
596 
597 
-
598 
-
599 void IndexIVFFlatIPBounds::add_core (idx_t n, const float * x, const long *xids,
-
600  const long *precomputed_idx) {
-
601 
-
602  FAISS_THROW_IF_NOT (is_trained);
-
603  const long * idx;
-
604  ScopeDeleter<long> del;
-
605 
-
606  if (precomputed_idx) {
-
607  idx = precomputed_idx;
-
608  } else {
-
609  long * idx0 = new long [n];
-
610  quantizer->assign (n, x, idx0);
-
611  idx = idx0;
-
612  del.set (idx);
-
613  }
-
614  IndexIVFFlat::add_core(n, x, xids, idx);
-
615 
-
616  // compute
-
617  const float * xi = x + fsize;
-
618  for (size_t i = 0; i < n; i++) {
-
619  float norm = std::sqrt (fvec_norm_L2sqr (xi, d - fsize));
-
620  part_norms[idx[i]].push_back(norm);
-
621  xi += d;
-
622  }
+
598 void IndexIVFFlatIPBounds::add_core (idx_t n, const float * x, const long *xids,
+
599  const long *precomputed_idx) {
+
600 
+
601  FAISS_THROW_IF_NOT (is_trained);
+
602  const long * idx;
+
603  ScopeDeleter<long> del;
+
604 
+
605  if (precomputed_idx) {
+
606  idx = precomputed_idx;
+
607  } else {
+
608  long * idx0 = new long [n];
+
609  quantizer->assign (n, x, idx0);
+
610  idx = idx0;
+
611  del.set (idx);
+
612  }
+
613  IndexIVFFlat::add_core(n, x, xids, idx);
+
614 
+
615  // compute
+
616  const float * xi = x + fsize;
+
617  for (size_t i = 0; i < n; i++) {
+
618  float norm = std::sqrt (fvec_norm_L2sqr (xi, d - fsize));
+
619  part_norms[idx[i]].push_back(norm);
+
620  xi += d;
+
621  }
+
622 
623 
-
624 
-
625 }
-
626 
-
627 namespace {
-
628 
-
629 void search_bounds_knn_inner_product (
-
630  const IndexIVFFlatIPBounds & ivf,
-
631  const float *x,
-
632  const long *keys,
-
633  float_minheap_array_t *res,
-
634  const float *qnorms)
-
635 {
-
636 
-
637  size_t k = res->k, nx = res->nh, nprobe = ivf.nprobe;
-
638  size_t d = ivf.d;
-
639  int fsize = ivf.fsize;
-
640 
-
641  size_t nlistv = 0, ndis = 0, npartial = 0;
-
642 
-
643 #pragma omp parallel for reduction(+: nlistv, ndis, npartial)
-
644  for (size_t i = 0; i < nx; i++) {
-
645  const float * xi = x + i * d;
-
646  const long * keysi = keys + i * nprobe;
-
647  float qnorm = qnorms[i];
-
648  float * __restrict simi = res->get_val (i);
-
649  long * __restrict idxi = res->get_ids (i);
-
650  minheap_heapify (k, simi, idxi);
-
651 
-
652  for (size_t ik = 0; ik < nprobe; ik++) {
-
653  long key = keysi[ik]; /* select the list */
-
654  if (key < 0) {
-
655  // not enough centroids for multiprobe
-
656  continue;
-
657  }
-
658  assert (key < (long) ivf.nlist);
-
659  nlistv++;
-
660 
-
661  const size_t list_size = ivf.ids[key].size();
-
662  const float * yj = ivf.vecs[key].data();
-
663  const float * bnorms = ivf.part_norms[key].data();
-
664 
-
665  for (size_t j = 0; j < list_size; j++) {
-
666  float ip_part = fvec_inner_product (xi, yj, fsize);
-
667  float bound = ip_part + bnorms[j] * qnorm;
-
668 
-
669  if (bound > simi[0]) {
-
670  float ip = ip_part + fvec_inner_product (
-
671  xi + fsize, yj + fsize, d - fsize);
-
672  if (ip > simi[0]) {
-
673  minheap_pop (k, simi, idxi);
-
674  minheap_push (k, simi, idxi, ip, ivf.ids[key][j]);
-
675  }
-
676  ndis ++;
-
677  }
-
678  yj += d;
-
679  }
-
680  npartial += list_size;
-
681  }
-
682  minheap_reorder (k, simi, idxi);
-
683  }
-
684  indexIVFFlat_stats.nq += nx;
-
685  indexIVFFlat_stats.nlist += nlistv;
-
686  indexIVFFlat_stats.ndis += ndis;
-
687  indexIVFFlat_stats.npartial += npartial;
-
688 }
+
624 }
+
625 
+
626 namespace {
+
627 
+
628 void search_bounds_knn_inner_product (
+
629  const IndexIVFFlatIPBounds & ivf,
+
630  const float *x,
+
631  const long *keys,
+
632  float_minheap_array_t *res,
+
633  const float *qnorms)
+
634 {
+
635 
+
636  size_t k = res->k, nx = res->nh, nprobe = ivf.nprobe;
+
637  size_t d = ivf.d;
+
638  int fsize = ivf.fsize;
+
639 
+
640  size_t nlistv = 0, ndis = 0, npartial = 0;
+
641 
+
642 #pragma omp parallel for reduction(+: nlistv, ndis, npartial)
+
643  for (size_t i = 0; i < nx; i++) {
+
644  const float * xi = x + i * d;
+
645  const long * keysi = keys + i * nprobe;
+
646  float qnorm = qnorms[i];
+
647  float * __restrict simi = res->get_val (i);
+
648  long * __restrict idxi = res->get_ids (i);
+
649  minheap_heapify (k, simi, idxi);
+
650 
+
651  for (size_t ik = 0; ik < nprobe; ik++) {
+
652  long key = keysi[ik]; /* select the list */
+
653  if (key < 0) {
+
654  // not enough centroids for multiprobe
+
655  continue;
+
656  }
+
657  assert (key < (long) ivf.nlist);
+
658  nlistv++;
+
659 
+
660  const size_t list_size = ivf.ids[key].size();
+
661  const float * yj = ivf.vecs[key].data();
+
662  const float * bnorms = ivf.part_norms[key].data();
+
663 
+
664  for (size_t j = 0; j < list_size; j++) {
+
665  float ip_part = fvec_inner_product (xi, yj, fsize);
+
666  float bound = ip_part + bnorms[j] * qnorm;
+
667 
+
668  if (bound > simi[0]) {
+
669  float ip = ip_part + fvec_inner_product (
+
670  xi + fsize, yj + fsize, d - fsize);
+
671  if (ip > simi[0]) {
+
672  minheap_pop (k, simi, idxi);
+
673  minheap_push (k, simi, idxi, ip, ivf.ids[key][j]);
+
674  }
+
675  ndis ++;
+
676  }
+
677  yj += d;
+
678  }
+
679  npartial += list_size;
+
680  }
+
681  minheap_reorder (k, simi, idxi);
+
682  }
+
683  indexIVFFlat_stats.nq += nx;
+
684  indexIVFFlat_stats.nlist += nlistv;
+
685  indexIVFFlat_stats.ndis += ndis;
+
686  indexIVFFlat_stats.npartial += npartial;
+
687 }
+
688 
689 
-
690 
-
691 }
+
690 }
+
691 
692 
-
693 
-
694 void IndexIVFFlatIPBounds::search (
-
695  idx_t n, const float *x, idx_t k,
-
696  float *distances, idx_t *labels) const
-
697 {
-
698  // compute query remainder norms and distances
-
699  idx_t * idx = new idx_t [n * nprobe];
-
700  ScopeDeleter<idx_t> del (idx);
-
701  quantizer->assign (n, x, idx, nprobe);
-
702 
-
703  float * qnorms = new float [n];
-
704  ScopeDeleter <float> del2 (qnorms);
-
705 
-
706 #pragma omp parallel for
-
707  for (size_t i = 0; i < n; i++) {
-
708  qnorms[i] = std::sqrt (fvec_norm_L2sqr (
-
709  x + i * d + fsize, d - fsize));
-
710  }
-
711 
-
712  float_minheap_array_t res = {
-
713  size_t(n), size_t(k), labels, distances};
-
714 
-
715  search_bounds_knn_inner_product (*this, x, idx, &res, qnorms);
-
716 
-
717 }
-
718 
-
719 } // namespace faiss
+
693 void IndexIVFFlatIPBounds::search (
+
694  idx_t n, const float *x, idx_t k,
+
695  float *distances, idx_t *labels) const
+
696 {
+
697  // compute query remainder norms and distances
+
698  idx_t * idx = new idx_t [n * nprobe];
+
699  ScopeDeleter<idx_t> del (idx);
+
700  quantizer->assign (n, x, idx, nprobe);
+
701 
+
702  float * qnorms = new float [n];
+
703  ScopeDeleter <float> del2 (qnorms);
+
704 
+
705 #pragma omp parallel for
+
706  for (size_t i = 0; i < n; i++) {
+
707  qnorms[i] = std::sqrt (fvec_norm_L2sqr (
+
708  x + i * d + fsize, d - fsize));
+
709  }
+
710 
+
711  float_minheap_array_t res = {
+
712  size_t(n), size_t(k), labels, distances};
+
713 
+
714  search_bounds_knn_inner_product (*this, x, idx, &res, qnorms);
+
715 
+
716 }
+
717 
+
718 } // namespace faiss
-
faiss::IndexIVFFlat::search_preassigned
void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, float *distances, idx_t *labels) const
perform search, without computing the assignment to the quantizer
Definition: IndexIVF.cpp:383
+
faiss::IndexIVFFlat::search_preassigned
void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, float *distances, idx_t *labels) const
perform search, without computing the assignment to the quantizer
Definition: IndexIVF.cpp:382
faiss::ClusteringParameters::niter
int niter
clustering iterations
Definition: Clustering.h:25
faiss::RangeSearchPartialResult::QueryResult
result structure for a single query
Definition: AuxIndexStructures.h:145
faiss::fvec_L2sqr
float fvec_L2sqr(const float *x, const float *y, size_t d)
Squared L2 distance between two vectors.
Definition: utils.cpp:481
-
faiss::IndexIVFFlat::search_knn_L2sqr
void search_knn_L2sqr(size_t nx, const float *x, const long *keys, float_maxheap_array_t *res) const
Implementation of the search for the L2 metric.
Definition: IndexIVF.cpp:323
+
faiss::IndexIVFFlat::search_knn_L2sqr
void search_knn_L2sqr(size_t nx, const float *x, const long *keys, float_maxheap_array_t *res) const
Implementation of the search for the L2 metric.
Definition: IndexIVF.cpp:322
faiss::HeapArray::get_val
T * get_val(size_t key)
Return the list of values for a heap.
Definition: Heap.h:360
-
faiss::IndexIVF::imbalance_factor
double imbalance_factor() const
1= perfectly balanced, &gt;1: imbalanced
Definition: IndexIVF.cpp:140
+
faiss::IndexIVF::imbalance_factor
double imbalance_factor() const
1= perfectly balanced, &gt;1: imbalanced
Definition: IndexIVF.cpp:139
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
faiss::IndexIVF::nprobe
size_t nprobe
number of probes at query time
Definition: IndexIVF.h:47
-
faiss::IndexIVFFlat::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexIVF.cpp:573
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
+
faiss::IndexIVFFlat::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexIVF.cpp:572
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
faiss::IndexIVF::quantizer_trains_alone
bool quantizer_trains_alone
just pass over the trainset to quantizer
Definition: IndexIVF.h:50
-
faiss::IndexIVFFlat::range_search
void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const override
Definition: IndexIVF.cpp:401
-
faiss::IndexIVFFlat::copy_subset_to
void copy_subset_to(IndexIVFFlat &other, int subset_type, long a1, long a2) const
Definition: IndexIVF.cpp:463
-
faiss::IndexIVFFlat::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVF.cpp:451
-
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:31
+
faiss::IndexIVFFlat::range_search
void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const override
Definition: IndexIVF.cpp:400
+
faiss::IndexIVFFlat::copy_subset_to
void copy_subset_to(IndexIVFFlat &other, int subset_type, long a1, long a2) const
Definition: IndexIVF.cpp:462
+
faiss::IndexIVFFlat::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVF.cpp:450
+
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:30
faiss::IndexIVF::train_residual
virtual void train_residual(idx_t n, const float *x)
Definition: IndexIVF.cpp:131
faiss::HeapArray::k
size_t k
allocated size per heap
Definition: Heap.h:355
faiss::imbalance_factor
double imbalance_factor(int n, int k, const long *assign)
a balanced assignment has a IF of 1
Definition: utils.cpp:1593
-
faiss::IndexIVFFlat::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVF.cpp:541
+
faiss::IndexIVFFlat::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVF.cpp:540
faiss::IndexIVF::ids
std::vector< std::vector< long > > ids
Inverted lists for indexes.
Definition: IndexIVF.h:55
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::IndexIVF::quantizer
Index * quantizer
quantizer that maps vectors to inverted lists
Definition: IndexIVF.h:49
faiss::IndexIVF::train
void train(idx_t n, const float *x) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVF.cpp:102
faiss::IndexIVF::cp
ClusteringParameters cp
to override default clustering params
Definition: IndexIVF.h:53
-
faiss::IndexIVFFlat::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
implemented for all IndexIVF* classes
Definition: IndexIVF.cpp:216
+
faiss::IndexIVFFlat::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
implemented for all IndexIVF* classes
Definition: IndexIVF.cpp:215
faiss::IndexIVF::own_fields
bool own_fields
whether object owns the quantizer
Definition: IndexIVF.h:51
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
-
faiss::IndexIVFFlat::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:533
+
faiss::IndexIVFFlat::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:532
faiss::Index::ntotal
idx_t ntotal
total nb of indexed vectors
Definition: Index.h:65
faiss::Index::verbose
bool verbose
verbosity level
Definition: Index.h:66
faiss::IndexIVF::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:93
faiss::RangeSearchPartialResult::new_result
QueryResult & new_result(idx_t qno)
begin a new result
Definition: AuxIndexStructures.cpp:113
-
faiss::IndexIVFFlat::update_vectors
void update_vectors(int nv, idx_t *idx, const float *v)
Definition: IndexIVF.cpp:488
-
faiss::IndexIVFFlatIPBounds::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:694
+
faiss::IndexIVFFlat::update_vectors
void update_vectors(int nv, idx_t *idx, const float *v)
Definition: IndexIVF.cpp:487
+
faiss::IndexIVFFlatIPBounds::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:693
faiss::IndexIVFFlatIPBounds::part_norms
std::vector< std::vector< float > > part_norms
norm of remainder (dimensions fsize:d)
Definition: IndexIVF.h:213
faiss::fvec_norm_L2sqr
float fvec_norm_L2sqr(const float *x, size_t d)
Definition: utils.cpp:538
@@ -853,23 +853,22 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVF::make_direct_map
void make_direct_map(bool new_maintain_direct_map=true)
Definition: IndexIVF.cpp:68
faiss::HeapArray::get_ids
TI * get_ids(size_t key)
Correspponding identifiers.
Definition: Heap.h:363
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
-
faiss::IndexIVF::print_stats
void print_stats() const
display some stats about the inverted lists
Definition: IndexIVF.cpp:149
-
faiss::IndexIVFFlatIPBounds::add_core
void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx) override
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:599
+
faiss::IndexIVF::print_stats
void print_stats() const
display some stats about the inverted lists
Definition: IndexIVF.cpp:148
+
faiss::IndexIVFFlatIPBounds::add_core
void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx) override
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:598
faiss::HeapArray::nh
size_t nh
number of heaps
Definition: Heap.h:354
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
faiss::IndexIVF::add
void add(idx_t n, const float *x) override
Quantizes x and calls add_with_key.
Definition: IndexIVF.cpp:63
faiss::Clustering::train
virtual void train(idx_t n, const float *x, faiss::Index &index)
Index is used during the assignment stage.
Definition: Clustering.cpp:66
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::IndexIVFFlat::search_knn_inner_product
void search_knn_inner_product(size_t nx, const float *x, const long *keys, float_minheap_array_t *res) const
Implementation of the search for the inner product metric.
Definition: IndexIVF.cpp:272
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
+
faiss::IndexIVFFlat::search_knn_inner_product
void search_knn_inner_product(size_t nx, const float *x, const long *keys, float_minheap_array_t *res) const
Implementation of the search for the inner product metric.
Definition: IndexIVF.cpp:271
faiss::IndexIVF::maintain_direct_map
bool maintain_direct_map
map for direct access to the elements. Enables reconstruct().
Definition: IndexIVF.h:58
faiss::ClusteringParameters::spherical
bool spherical
do we want normalized centroids?
Definition: Clustering.h:29
-
faiss::IndexIVF::merge_from
virtual void merge_from(IndexIVF &other, idx_t add_id)
Definition: IndexIVF.cpp:169
+
faiss::IndexIVF::merge_from
virtual void merge_from(IndexIVF &other, idx_t add_id)
Definition: IndexIVF.cpp:168
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
faiss::IndexIVFFlat::vecs
std::vector< std::vector< float > > vecs
Definition: IndexIVF.h:135
-
faiss::IndexIVFFlat::add_core
virtual void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx)
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:221
-
faiss::IndexIVFFlat::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:373
+
faiss::IndexIVFFlat::add_core
virtual void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx)
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:220
+
faiss::IndexIVFFlat::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:372
diff --git a/docs/html/IndexIVF_8h_source.html b/docs/html/IndexIVF_8h_source.html index a6f549546..9fafdf750 100644 --- a/docs/html/IndexIVF_8h_source.html +++ b/docs/html/IndexIVF_8h_source.html @@ -325,19 +325,19 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
240 
241 #endif
-
faiss::IndexIVFFlat::search_preassigned
void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, float *distances, idx_t *labels) const
perform search, without computing the assignment to the quantizer
Definition: IndexIVF.cpp:383
-
faiss::IndexIVFFlat::search_knn_L2sqr
void search_knn_L2sqr(size_t nx, const float *x, const long *keys, float_maxheap_array_t *res) const
Implementation of the search for the L2 metric.
Definition: IndexIVF.cpp:323
-
faiss::IndexIVF::imbalance_factor
double imbalance_factor() const
1= perfectly balanced, &gt;1: imbalanced
Definition: IndexIVF.cpp:140
+
faiss::IndexIVFFlat::search_preassigned
void search_preassigned(idx_t n, const float *x, idx_t k, const idx_t *assign, float *distances, idx_t *labels) const
perform search, without computing the assignment to the quantizer
Definition: IndexIVF.cpp:382
+
faiss::IndexIVFFlat::search_knn_L2sqr
void search_knn_L2sqr(size_t nx, const float *x, const long *keys, float_maxheap_array_t *res) const
Implementation of the search for the L2 metric.
Definition: IndexIVF.cpp:322
+
faiss::IndexIVF::imbalance_factor
double imbalance_factor() const
1= perfectly balanced, &gt;1: imbalanced
Definition: IndexIVF.cpp:139
faiss::IndexIVF::nprobe
size_t nprobe
number of probes at query time
Definition: IndexIVF.h:47
-
faiss::IndexIVFFlat::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexIVF.cpp:573
+
faiss::IndexIVFFlat::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexIVF.cpp:572
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
faiss::IndexIVF::quantizer_trains_alone
bool quantizer_trains_alone
just pass over the trainset to quantizer
Definition: IndexIVF.h:50
-
faiss::IndexIVFFlat::range_search
void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const override
Definition: IndexIVF.cpp:401
-
faiss::IndexIVFFlat::copy_subset_to
void copy_subset_to(IndexIVFFlat &other, int subset_type, long a1, long a2) const
Definition: IndexIVF.cpp:463
-
faiss::IndexIVFFlat::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVF.cpp:451
+
faiss::IndexIVFFlat::range_search
void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const override
Definition: IndexIVF.cpp:400
+
faiss::IndexIVFFlat::copy_subset_to
void copy_subset_to(IndexIVFFlat &other, int subset_type, long a1, long a2) const
Definition: IndexIVF.cpp:462
+
faiss::IndexIVFFlat::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVF.cpp:450
faiss::IndexIVF::train_residual
virtual void train_residual(idx_t n, const float *x)
Definition: IndexIVF.cpp:131
-
faiss::IndexIVFFlat::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVF.cpp:541
+
faiss::IndexIVFFlat::remove_ids
long remove_ids(const IDSelector &sel) override
Definition: IndexIVF.cpp:540
faiss::IndexIVF::ids
std::vector< std::vector< long > > ids
Inverted lists for indexes.
Definition: IndexIVF.h:55
@@ -345,14 +345,14 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVF::quantizer
Index * quantizer
quantizer that maps vectors to inverted lists
Definition: IndexIVF.h:49
faiss::IndexIVF::train
void train(idx_t n, const float *x) override
Trains the quantizer and calls train_residual to train sub-quantizers.
Definition: IndexIVF.cpp:102
faiss::IndexIVF::cp
ClusteringParameters cp
to override default clustering params
Definition: IndexIVF.h:53
-
faiss::IndexIVFFlat::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
implemented for all IndexIVF* classes
Definition: IndexIVF.cpp:216
+
faiss::IndexIVFFlat::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
implemented for all IndexIVF* classes
Definition: IndexIVF.cpp:215
faiss::IndexIVF::own_fields
bool own_fields
whether object owns the quantizer
Definition: IndexIVF.h:51
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
-
faiss::IndexIVFFlat::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:533
+
faiss::IndexIVFFlat::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:532
faiss::IndexIVF::reset
void reset() override
removes all elements from the database.
Definition: IndexIVF.cpp:93
-
faiss::IndexIVFFlat::update_vectors
void update_vectors(int nv, idx_t *idx, const float *v)
Definition: IndexIVF.cpp:488
-
faiss::IndexIVFFlatIPBounds::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:694
+
faiss::IndexIVFFlat::update_vectors
void update_vectors(int nv, idx_t *idx, const float *v)
Definition: IndexIVF.cpp:487
+
faiss::IndexIVFFlatIPBounds::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:693
faiss::IndexIVFFlatIPBounds::part_norms
std::vector< std::vector< float > > part_norms
norm of remainder (dimensions fsize:d)
Definition: IndexIVF.h:213
faiss::IndexIVFFlatIPBounds::fsize
size_t fsize
nb of dimensions of pre-filter
Definition: IndexIVF.h:210
@@ -360,18 +360,18 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexIVF::merge_from_residuals
virtual void merge_from_residuals(IndexIVF &other)=0
faiss::IndexIVF::make_direct_map
void make_direct_map(bool new_maintain_direct_map=true)
Definition: IndexIVF.cpp:68
-
faiss::IndexIVF::print_stats
void print_stats() const
display some stats about the inverted lists
Definition: IndexIVF.cpp:149
-
faiss::IndexIVFFlatIPBounds::add_core
void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx) override
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:599
+
faiss::IndexIVF::print_stats
void print_stats() const
display some stats about the inverted lists
Definition: IndexIVF.cpp:148
+
faiss::IndexIVFFlatIPBounds::add_core
void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx) override
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:598
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
faiss::IndexIVF::add
void add(idx_t n, const float *x) override
Quantizes x and calls add_with_key.
Definition: IndexIVF.cpp:63
-
faiss::IndexIVFFlat::search_knn_inner_product
void search_knn_inner_product(size_t nx, const float *x, const long *keys, float_minheap_array_t *res) const
Implementation of the search for the inner product metric.
Definition: IndexIVF.cpp:272
+
faiss::IndexIVFFlat::search_knn_inner_product
void search_knn_inner_product(size_t nx, const float *x, const long *keys, float_minheap_array_t *res) const
Implementation of the search for the inner product metric.
Definition: IndexIVF.cpp:271
faiss::IndexIVF::maintain_direct_map
bool maintain_direct_map
map for direct access to the elements. Enables reconstruct().
Definition: IndexIVF.h:58
-
faiss::IndexIVF::merge_from
virtual void merge_from(IndexIVF &other, idx_t add_id)
Definition: IndexIVF.cpp:169
+
faiss::IndexIVF::merge_from
virtual void merge_from(IndexIVF &other, idx_t add_id)
Definition: IndexIVF.cpp:168
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
faiss::IndexIVFFlat::vecs
std::vector< std::vector< float > > vecs
Definition: IndexIVF.h:135
-
faiss::IndexIVFFlat::add_core
virtual void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx)
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:221
-
faiss::IndexIVFFlat::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:373
+
faiss::IndexIVFFlat::add_core
virtual void add_core(idx_t n, const float *x, const long *xids, const long *precomputed_idx)
same as add_with_ids, with precomputed coarse quantizer
Definition: IndexIVF.cpp:220
+
faiss::IndexIVFFlat::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVF.cpp:372
diff --git a/docs/html/IndexPQ_8cpp_source.html b/docs/html/IndexPQ_8cpp_source.html index 260941ac8..4ca3d59de 100644 --- a/docs/html/IndexPQ_8cpp_source.html +++ b/docs/html/IndexPQ_8cpp_source.html @@ -871,105 +871,105 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
786  Index(d, METRIC_L2), pq(d, M, nbits)
787 {
788  is_trained = false;
-
789 }
-
790 
+
789  pq.verbose = verbose;
+
790 }
791 
792 
-
793 void MultiIndexQuantizer::train(idx_t n, const float *x)
-
794 {
-
795  pq.train (n, x);
-
796  is_trained = true;
-
797  // count virtual elements in index
-
798  ntotal = 1;
-
799  for (int m = 0; m < pq.M; m++)
-
800  ntotal *= pq.ksub;
-
801 }
-
802 
+
793 
+
794 void MultiIndexQuantizer::train(idx_t n, const float *x)
+
795 {
+
796  pq.train (n, x);
+
797  is_trained = true;
+
798  // count virtual elements in index
+
799  ntotal = 1;
+
800  for (int m = 0; m < pq.M; m++)
+
801  ntotal *= pq.ksub;
+
802 }
803 
-
804 void MultiIndexQuantizer::search (idx_t n, const float *x, idx_t k,
-
805  float *distances, idx_t *labels) const {
-
806  if (n == 0) return;
-
807 
-
808  float * dis_tables = new float [n * pq.ksub * pq.M];
-
809  ScopeDeleter<float> del (dis_tables);
-
810 
-
811  pq.compute_distance_tables (n, x, dis_tables);
-
812 
-
813  if (k == 1) {
-
814  // simple version that just finds the min in each table
-
815 
-
816 #pragma omp parallel for
-
817  for (int i = 0; i < n; i++) {
-
818  const float * dis_table = dis_tables + i * pq.ksub * pq.M;
-
819  float dis = 0;
-
820  idx_t label = 0;
-
821 
-
822  for (int s = 0; s < pq.M; s++) {
-
823  float vmin = HUGE_VALF;
-
824  idx_t lmin = -1;
-
825 
-
826  for (idx_t j = 0; j < pq.ksub; j++) {
-
827  if (dis_table[j] < vmin) {
-
828  vmin = dis_table[j];
-
829  lmin = j;
-
830  }
-
831  }
-
832  dis += vmin;
-
833  label |= lmin << (s * pq.nbits);
-
834  dis_table += pq.ksub;
-
835  }
-
836 
-
837  distances [i] = dis;
-
838  labels [i] = label;
-
839  }
-
840 
+
804 
+
805 void MultiIndexQuantizer::search (idx_t n, const float *x, idx_t k,
+
806  float *distances, idx_t *labels) const {
+
807  if (n == 0) return;
+
808 
+
809  float * dis_tables = new float [n * pq.ksub * pq.M];
+
810  ScopeDeleter<float> del (dis_tables);
+
811 
+
812  pq.compute_distance_tables (n, x, dis_tables);
+
813 
+
814  if (k == 1) {
+
815  // simple version that just finds the min in each table
+
816 
+
817 #pragma omp parallel for
+
818  for (int i = 0; i < n; i++) {
+
819  const float * dis_table = dis_tables + i * pq.ksub * pq.M;
+
820  float dis = 0;
+
821  idx_t label = 0;
+
822 
+
823  for (int s = 0; s < pq.M; s++) {
+
824  float vmin = HUGE_VALF;
+
825  idx_t lmin = -1;
+
826 
+
827  for (idx_t j = 0; j < pq.ksub; j++) {
+
828  if (dis_table[j] < vmin) {
+
829  vmin = dis_table[j];
+
830  lmin = j;
+
831  }
+
832  }
+
833  dis += vmin;
+
834  label |= lmin << (s * pq.nbits);
+
835  dis_table += pq.ksub;
+
836  }
+
837 
+
838  distances [i] = dis;
+
839  labels [i] = label;
+
840  }
841 
-
842  } else {
-
843 
-
844 #pragma omp parallel if(n > 1)
-
845  {
-
846  MinSumK <float, SemiSortedArray<float>, false>
-
847  msk(k, pq.M, pq.ksub);
-
848 #pragma omp for
-
849  for (int i = 0; i < n; i++) {
-
850  msk.run (dis_tables + i * pq.ksub * pq.M,
-
851  distances + i * k, labels + i * k);
-
852 
-
853  }
-
854  }
-
855  }
-
856 
-
857 }
-
858 
+
842 
+
843  } else {
+
844 
+
845 #pragma omp parallel if(n > 1)
+
846  {
+
847  MinSumK <float, SemiSortedArray<float>, false>
+
848  msk(k, pq.M, pq.ksub);
+
849 #pragma omp for
+
850  for (int i = 0; i < n; i++) {
+
851  msk.run (dis_tables + i * pq.ksub * pq.M,
+
852  distances + i * k, labels + i * k);
+
853 
+
854  }
+
855  }
+
856  }
+
857 
+
858 }
859 
-
860 void MultiIndexQuantizer::reconstruct (idx_t key, float * recons) const
-
861 {
-
862  if (pq.byte_per_idx == 1) {
-
863  uint8_t code[pq.M];
-
864  long jj = key;
-
865  for (int m = 0; m < pq.M; m++) {
-
866  long n = jj % pq.ksub;
-
867  jj /= pq.ksub;
-
868  code[m] = n;
-
869  }
-
870  pq.decode (code, recons);
-
871  } else if (pq.byte_per_idx == 2) {
-
872  uint16_t code[pq.M];
-
873  long jj = key;
-
874  for (int m = 0; m < pq.M; m++) {
-
875  long n = jj % pq.ksub;
-
876  jj /= pq.ksub;
-
877  code[m] = n;
-
878  }
-
879  pq.decode ((uint8_t*)code, recons);
-
880  } else FAISS_THROW_MSG( "only 1 or 2 bytes per index supported");
-
881 }
-
882 
+
860 
+
861 void MultiIndexQuantizer::reconstruct (idx_t key, float * recons) const
+
862 {
+
863  if (pq.byte_per_idx == 1) {
+
864  uint8_t code[pq.M];
+
865  long jj = key;
+
866  for (int m = 0; m < pq.M; m++) {
+
867  long n = jj % pq.ksub;
+
868  jj /= pq.ksub;
+
869  code[m] = n;
+
870  }
+
871  pq.decode (code, recons);
+
872  } else if (pq.byte_per_idx == 2) {
+
873  uint16_t code[pq.M];
+
874  long jj = key;
+
875  for (int m = 0; m < pq.M; m++) {
+
876  long n = jj % pq.ksub;
+
877  jj /= pq.ksub;
+
878  code[m] = n;
+
879  }
+
880  pq.decode ((uint8_t*)code, recons);
+
881  } else FAISS_THROW_MSG( "only 1 or 2 bytes per index supported");
+
882 }
883 
-
884 void MultiIndexQuantizer::add (idx_t n, const float *x)
-
885 {
-
886  FAISS_THROW_MSG ( "This index has virtual elements, "
-
887  "it does not support add");
+
884 void MultiIndexQuantizer::add(idx_t /*n*/, const float* /*x*/) {
+
885  FAISS_THROW_MSG(
+
886  "This index has virtual elements, "
+
887  "it does not support add");
888 }
889 
890 void MultiIndexQuantizer::reset ()
@@ -993,7 +993,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::MultiIndexQuantizer::reset
void reset() override
removes all elements from the database.
Definition: IndexPQ.cpp:890
faiss::partial_sort
void partial_sort(int k, int n, const typename C::T *vals, typename C::TI *perm)
Definition: IndexPQ.cpp:515
-
faiss::MultiIndexQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexPQ.cpp:793
+
faiss::MultiIndexQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexPQ.cpp:794
faiss::MinSumK::HC
CMin< T, long > HC
Definition: IndexPQ.cpp:646
@@ -1002,7 +1002,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::ProductQuantizer::compute_distance_tables
void compute_distance_tables(size_t nx, const float *x, float *dis_tables) const
Definition: ProductQuantizer.cpp:439
-
faiss::generalized_hammings_knn
void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
Definition: hamming.cpp:635
+
faiss::generalized_hammings_knn
void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
Definition: hamming.cpp:639
faiss::ProductQuantizer::compute_code_from_distance_table
void compute_code_from_distance_table(const float *tab, uint8_t *code) const
Definition: ProductQuantizer.cpp:363
faiss::ProductQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: ProductQuantizer.cpp:385
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
@@ -1022,7 +1022,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::MinSumK::K
int K
nb of sums to return
Definition: IndexPQ.cpp:638
faiss::IndexPQ::hamming_distance_table
void hamming_distance_table(idx_t n, const float *x, int32_t *dis) const
Definition: IndexPQ.cpp:370
-
faiss::MultiIndexQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexPQ.cpp:804
+
faiss::MultiIndexQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexPQ.cpp:805
faiss::IndexPQ::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:104
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
faiss::ProductQuantizer::M
size_t M
number of subquantizers
Definition: ProductQuantizer.h:28
@@ -1030,12 +1030,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexPQ::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexPQ.cpp:94
faiss::IndexPQ::ST_PQ
asymmetric product quantizer (default)
Definition: IndexPQ.h:76
-
faiss::MultiIndexQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:860
+
faiss::MultiIndexQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:861
faiss::IndexPQ::ST_polysemous
HE filter (using ht) + PQ combination.
Definition: IndexPQ.h:80
faiss::MultiIndexQuantizer::add
void add(idx_t n, const float *x) override
add and reset will crash at runtime
Definition: IndexPQ.cpp:884
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
faiss::IndexPQ::reset
void reset() override
removes all elements from the database.
Definition: IndexPQ.cpp:88
faiss::PolysemousTraining::optimize_pq_for_hamming
void optimize_pq_for_hamming(ProductQuantizer &pq, size_t n, const float *x) const
Definition: PolysemousTraining.cpp:933
+
faiss::ProductQuantizer::verbose
bool verbose
verbose during training?
Definition: ProductQuantizer.h:36
faiss::IndexPQ::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexPQ.cpp:124
faiss::IndexPQ::ST_SDC
symmetric product quantizer (SDC)
Definition: IndexPQ.h:79
faiss::IndexPQ::polysemous_ht
int polysemous_ht
Hamming threshold used for polysemy.
Definition: IndexPQ.h:91
diff --git a/docs/html/IndexPQ_8h_source.html b/docs/html/IndexPQ_8h_source.html index 116078e06..97b5a9697 100644 --- a/docs/html/IndexPQ_8h_source.html +++ b/docs/html/IndexPQ_8h_source.html @@ -254,7 +254,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexPQ::do_polysemous_training
bool do_polysemous_training
false = standard PQ
Definition: IndexPQ.h:69
faiss::IndexPQ::train
void train(idx_t n, const float *x) override
Definition: IndexPQ.cpp:54
faiss::MultiIndexQuantizer::reset
void reset() override
removes all elements from the database.
Definition: IndexPQ.cpp:890
-
faiss::MultiIndexQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexPQ.cpp:793
+
faiss::MultiIndexQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexPQ.cpp:794
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::IndexPQ::hamming_distance_histogram
void hamming_distance_histogram(idx_t n, const float *x, idx_t nb, const float *xb, long *dist_histogram)
Definition: IndexPQ.cpp:382
@@ -266,13 +266,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::PolysemousTraining
optimizes the order of indices in a ProductQuantizer
Definition: PolysemousTraining.h:125
faiss::IndexPQ::hamming_distance_table
void hamming_distance_table(idx_t n, const float *x, int32_t *dis) const
Definition: IndexPQ.cpp:370
-
faiss::MultiIndexQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexPQ.cpp:804
+
faiss::MultiIndexQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexPQ.cpp:805
faiss::IndexPQ::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:104
faiss::IndexPQ::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexPQ.cpp:94
faiss::IndexPQ::ST_PQ
asymmetric product quantizer (default)
Definition: IndexPQ.h:76
-
faiss::MultiIndexQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:860
+
faiss::MultiIndexQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexPQ.cpp:861
faiss::IndexPQ::ST_polysemous
HE filter (using ht) + PQ combination.
Definition: IndexPQ.h:80
faiss::MultiIndexQuantizer::add
void add(idx_t n, const float *x) override
add and reset will crash at runtime
Definition: IndexPQ.cpp:884
diff --git a/docs/html/IndexProxy_8cpp_source.html b/docs/html/IndexProxy_8cpp_source.html index 747edabcf..a6e9e5285 100644 --- a/docs/html/IndexProxy_8cpp_source.html +++ b/docs/html/IndexProxy_8cpp_source.html @@ -193,7 +193,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
104 
105 void
106 IndexProxy::train(Index::idx_t n, const float* x) {
-
107  runOnIndex([n, x](faiss::Index* index){ index->train(n, x); });
+
107  runOnIndex([n, x](faiss::Index* index){ index->train(n, x); });
108 }
109 
110 void
@@ -298,7 +298,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
209  }
210  index = &proxy;
211  }
-
212  clus.train (n, x, *index);
+
212  clus.train (n, x, *index);
213 
214  memcpy(centroids, clus.centroids.data(), sizeof(*centroids) * d * k);
215  return clus.obj.back();
@@ -314,6 +314,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::IndexProxy::runOnIndex
void runOnIndex(std::function< void(faiss::Index *)> f)
Definition: IndexProxy.cpp:85
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::gpu::GpuIndexFlatConfig::useFloat16
bool useFloat16
Whether or not data is stored as float16.
Definition: GpuIndexFlat.h:35
faiss::gpu::GpuIndexConfig::device
int device
GPU device on which the index is resident.
Definition: GpuIndex.h:27
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
@@ -329,7 +330,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
diff --git a/docs/html/IndexScalarQuantizer_8cpp_source.html b/docs/html/IndexScalarQuantizer_8cpp_source.html index 9efe9458e..b49c8d741 100644 --- a/docs/html/IndexScalarQuantizer_8cpp_source.html +++ b/docs/html/IndexScalarQuantizer_8cpp_source.html @@ -360,7 +360,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
275  float & vmin = trained[0];
276  float & vmax = trained[1];
277 
-
278  if (rs == ScalarQuantizer::RS_minmax) {
+
278  if (rs == ScalarQuantizer::RS_minmax) {
279  vmin = HUGE_VAL; vmax = -HUGE_VAL;
280  for (size_t i = 0; i < n; i++) {
281  if (x[i] < vmin) vmin = x[i];
@@ -369,7 +369,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
284  float vexp = (vmax - vmin) * rs_arg;
285  vmin -= vexp;
286  vmax += vexp;
-
287  } else if (rs == ScalarQuantizer::RS_meanstd) {
+
287  } else if (rs == ScalarQuantizer::RS_meanstd) {
288  double sum = 0, sum2 = 0;
289  for (size_t i = 0; i < n; i++) {
290  sum += x[i];
@@ -381,7 +381,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
296 
297  vmin = mean - std * rs_arg ;
298  vmax = mean + std * rs_arg ;
-
299  } else if (rs == ScalarQuantizer::RS_quantiles) {
+
299  } else if (rs == ScalarQuantizer::RS_quantiles) {
300  std::vector<float> x_copy(n);
301  memcpy(x_copy.data(), x, n * sizeof(*x));
302  // TODO just do a qucikselect
@@ -392,7 +392,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
307  vmin = x_copy[o];
308  vmax = x_copy[n - 1 - o];
309 
-
310  } else if (rs == ScalarQuantizer::RS_optim) {
+
310  } else if (rs == ScalarQuantizer::RS_optim) {
311  float a, b;
312  float sx = 0;
313  {
@@ -458,7 +458,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
373  trained.resize (2 * d);
374  float * vmin = trained.data();
375  float * vmax = trained.data() + d;
-
376  if (rs == ScalarQuantizer::RS_minmax) {
+
376  if (rs == ScalarQuantizer::RS_minmax) {
377  memcpy (vmin, x, sizeof(*x) * d);
378  memcpy (vmax, x, sizeof(*x) * d);
379  for (size_t i = 1; i < n; i++) {
@@ -675,11 +675,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
590 #ifdef USE_AVX
591  if (d % 8 == 0) {
592  switch(qtype) {
-
593  case ScalarQuantizer::QT_8bit:
+
593  case ScalarQuantizer::QT_8bit:
594  return new QuantizerNonUniform8<Codec8bit>(d, trained);
-
595  case ScalarQuantizer::QT_4bit:
+
595  case ScalarQuantizer::QT_4bit:
596  return new QuantizerNonUniform8<Codec4bit>(d, trained);
-
597  case ScalarQuantizer::QT_8bit_uniform:
+
597  case ScalarQuantizer::QT_8bit_uniform:
598  return new QuantizerUniform8<Codec8bit>(d, trained);
599  case ScalarQuantizer::QT_4bit_uniform:
600  return new QuantizerUniform8<Codec4bit>(d, trained);
@@ -688,11 +688,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
603 #endif
604  {
605  switch(qtype) {
-
606  case ScalarQuantizer::QT_8bit:
+
606  case ScalarQuantizer::QT_8bit:
607  return new QuantizerNonUniform<Codec8bit>(d, trained);
-
608  case ScalarQuantizer::QT_4bit:
+
608  case ScalarQuantizer::QT_4bit:
609  return new QuantizerNonUniform<Codec4bit>(d, trained);
-
610  case ScalarQuantizer::QT_8bit_uniform:
+
610  case ScalarQuantizer::QT_8bit_uniform:
611  return new QuantizerUniform<Codec8bit>(d, trained);
612  case ScalarQuantizer::QT_4bit_uniform:
613  return new QuantizerUniform<Codec4bit>(d, trained);
@@ -740,23 +740,23 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
655 {
656  int bit_per_dim =
657  qtype == QT_4bit_uniform ? 4 :
-
658  qtype == QT_4bit ? 4 :
-
659  qtype == QT_8bit_uniform ? 8 :
-
660  qtype == QT_8bit ? 8 : -1;
+
658  qtype == QT_4bit ? 4 :
+
659  qtype == QT_8bit_uniform ? 8 :
+
660  qtype == QT_8bit ? 8 : -1;
661 
662  switch (qtype) {
-
663  case QT_4bit_uniform: case QT_8bit_uniform:
+
663  case QT_4bit_uniform: case QT_8bit_uniform:
664  train_Uniform (rangestat, rangestat_arg,
665  n * d, 1 << bit_per_dim, x, trained);
666  break;
-
667  case QT_4bit: case QT_8bit:
+
667  case QT_4bit: case QT_8bit:
668  train_NonUniform (rangestat, rangestat_arg,
669  n, d, 1 << bit_per_dim, x, trained);
670  break;
671  }
672 }
673 
-
674 void ScalarQuantizer::compute_codes (const float * x,
+
674 void ScalarQuantizer::compute_codes (const float * x,
675  uint8_t * codes,
676  size_t n) const
677 {
@@ -767,7 +767,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
682  delete squant;
683 }
684 
-
685 void ScalarQuantizer::decode (const uint8_t *codes, float *x, size_t n) const
+
685 void ScalarQuantizer::decode (const uint8_t *codes, float *x, size_t n) const
686 {
687  Quantizer *squant = select_quantizer (*this);
688 #pragma omp parallel for
@@ -804,8 +804,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
719 void IndexScalarQuantizer::add(idx_t n, const float* x)
720 {
721  FAISS_THROW_IF_NOT (is_trained);
-
722  codes.resize ((n + ntotal) * code_size);
-
723  sq.compute_codes (x, &codes[ntotal * code_size], n);
+
722  codes.resize ((n + ntotal) * code_size);
+
723  sq.compute_codes (x, &codes[ntotal * code_size], n);
724  ntotal += n;
725 }
726 
@@ -828,7 +828,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
743  minheap_heapify (k, simi, idxi);
744 
745  SimilarityIP sim(x + i * d, 0);
-
746  const uint8_t *ci = codes.data ();
+
746  const uint8_t *ci = codes.data ();
747 
748  for (size_t j = 0; j < ntotal; j++) {
749  float accu = squant->compute_distance_IP(sim, ci);
@@ -848,7 +848,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
763  maxheap_heapify (k, simi, idxi);
764 
765  SimilarityL2 sim(x + i * d);
-
766  const uint8_t *ci = codes.data ();
+
766  const uint8_t *ci = codes.data ();
767 
768  for (size_t j = 0; j < ntotal; j++) {
769  float accu = squant->compute_distance_L2(sim, ci);
@@ -867,7 +867,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
782 
783 void IndexScalarQuantizer::reset()
784 {
-
785  codes.clear();
+
785  codes.clear();
786  ntotal = 0;
787 }
788 
@@ -877,7 +877,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
792  Quantizer *squant = select_quantizer (sq);
793  ScopeDeleter1<Quantizer> del (squant);
794  for (size_t i = 0; i < ni; i++) {
-
795  squant->decode_vector(&codes[(i + i0) * code_size], recons + i * d);
+
795  squant->decode_vector(&codes[(i + i0) * code_size], recons + i * d);
796  }
797 }
798 
@@ -899,20 +899,20 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
814 {
815  code_size = sq.code_size;
816  is_trained = false;
-
817  codes.resize(nlist);
+
817  codes.resize(nlist);
818 }
819 
820 IndexIVFScalarQuantizer::IndexIVFScalarQuantizer ():
821  IndexIVF (), code_size (0)
822 {}
823 
-
824 void IndexIVFScalarQuantizer::train_residual (idx_t n, const float *x)
+
824 void IndexIVFScalarQuantizer::train_residual (idx_t n, const float *x)
825 {
826  long * idx = new long [n];
-
827  ScopeDeleter<long> del (idx);
+
827  ScopeDeleter<long> del (idx);
828  quantizer->assign (n, x, idx);
829  float *residuals = new float [n * d];
-
830  ScopeDeleter<float> del2 (residuals);
+
830  ScopeDeleter<float> del2 (residuals);
831 
832 #pragma omp parallel for
833  for (idx_t i = 0; i < n; i++) {
@@ -925,15 +925,15 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
840 
841 
842 void IndexIVFScalarQuantizer::add_with_ids
-
843  (idx_t n, const float * x, const long *xids)
+
843  (idx_t n, const float * x, const long *xids)
844 {
-
845  FAISS_THROW_IF_NOT (is_trained);
+
845  FAISS_THROW_IF_NOT (is_trained);
846  long * idx = new long [n];
-
847  ScopeDeleter<long> del (idx);
+
847  ScopeDeleter<long> del (idx);
848  quantizer->assign (n, x, idx);
849  size_t nadd = 0;
850  Quantizer *squant = select_quantizer (sq);
-
851  ScopeDeleter1<Quantizer> del2 (squant);
+
851  ScopeDeleter1<Quantizer> del2 (squant);
852 
853 #pragma omp parallel reduction(+: nadd)
854  {
@@ -945,11 +945,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
860 
861  long list_no = idx [i];
862  if (list_no >= 0 && list_no % nt == rank) {
-
863  long id = xids ? xids[i] : ntotal + i;
+
863  long id = xids ? xids[i] : ntotal + i;
864 
865  assert (list_no < nlist);
866 
-
867  ids[list_no].push_back (id);
+
867  ids[list_no].push_back (id);
868  nadd++;
869  quantizer->compute_residual (
870  x + i * d, residual.data(), list_no);
@@ -962,19 +962,19 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
877  }
878  }
879  }
-
880  ntotal += nadd;
+
880  ntotal += nadd;
881 }
882 
883 
-
884 void search_with_probes_ip (const IndexIVFScalarQuantizer & index,
+
884 void search_with_probes_ip (const IndexIVFScalarQuantizer & index,
885  const float *x,
886  const idx_t *cent_ids, const float *cent_dis,
887  const Quantizer & quant,
888  int k, float *simi, idx_t *idxi)
889 {
-
890  int nprobe = index.nprobe;
+
890  int nprobe = index.nprobe;
891  size_t code_size = index.code_size;
-
892  size_t d = index.d;
+
892  size_t d = index.d;
893  std::vector<float> decoded(d);
894  minheap_heapify (k, simi, idxi);
895  for (int i = 0; i < nprobe; i++) {
@@ -982,8 +982,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
897  if (list_no < 0) break;
898  float accu0 = cent_dis[i];
899 
-
900  const std::vector<idx_t> & ids = index.ids[list_no];
-
901  const uint8_t* codes = index.codes[list_no].data();
+
900  const std::vector<idx_t> & ids = index.ids[list_no];
+
901  const uint8_t* codes = index.codes[list_no].data();
902 
903  SimilarityIP sim(x, accu0);
904 
@@ -1041,19 +1041,19 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
956 }
957 
958 
-
959 void IndexIVFScalarQuantizer::search (idx_t n, const float *x, idx_t k,
+
959 void IndexIVFScalarQuantizer::search (idx_t n, const float *x, idx_t k,
960  float *distances, idx_t *labels) const
961 {
962  FAISS_THROW_IF_NOT (is_trained);
963  idx_t *idx = new idx_t [n * nprobe];
-
964  ScopeDeleter<idx_t> del (idx);
+
964  ScopeDeleter<idx_t> del (idx);
965  float *dis = new float [n * nprobe];
-
966  ScopeDeleter<float> del2 (dis);
+
966  ScopeDeleter<float> del2 (dis);
967 
968  quantizer->search (n, x, nprobe, dis, idx);
969 
970  Quantizer *squant = select_quantizer (sq);
-
971  ScopeDeleter1<Quantizer> del3(squant);
+
971  ScopeDeleter1<Quantizer> del3(squant);
972 
973  if (metric_type == METRIC_INNER_PRODUCT) {
974 #pragma omp parallel for
@@ -1074,11 +1074,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
989 }
990 
991 
-
992 void IndexIVFScalarQuantizer::merge_from_residuals (IndexIVF & other_in) {
-
993  IndexIVFScalarQuantizer &other =
-
994  dynamic_cast<IndexIVFScalarQuantizer &> (other_in);
+
992 void IndexIVFScalarQuantizer::merge_from_residuals (IndexIVF & other_in) {
+
993  IndexIVFScalarQuantizer &other =
+
994  dynamic_cast<IndexIVFScalarQuantizer &> (other_in);
995  for (int i = 0; i < nlist; i++) {
-
996  std::vector<uint8_t> & src = other.codes[i];
+
996  std::vector<uint8_t> & src = other.codes[i];
997  std::vector<uint8_t> & dest = codes[i];
998  dest.insert (dest.end(), src.begin (), src.end ());
999  src.clear ();
@@ -1089,42 +1089,46 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
1004 
1005 }
-
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexIVFScalarQuantizer.h:64
- +
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexScalarQuantizer.h:60
+
faiss::IndexScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexScalarQuantizer.cpp:727
-
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexIVFScalarQuantizer.cpp:714
+
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:824
+
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexScalarQuantizer.h:50
+
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexScalarQuantizer.h:35
faiss::IndexScalarQuantizer::add
void add(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:719
faiss::IndexIVF::nprobe
size_t nprobe
number of probes at query time
Definition: IndexIVF.h:47
+
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
faiss::IndexScalarQuantizer::reset
void reset() override
removes all elements from the database.
Definition: IndexScalarQuantizer.cpp:783
-
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVFScalarQuantizer.cpp:849
+
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexScalarQuantizer.cpp:959
-
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVFScalarQuantizer.cpp:882
- -
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexIVFScalarQuantizer.h:54
+ +
faiss::IndexIVFScalarQuantizer::codes
std::vector< std::vector< uint8_t > > codes
inverted list codes.
Definition: IndexScalarQuantizer.h:135
+
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexScalarQuantizer.cpp:992
+
faiss::IndexIVF::ids
std::vector< std::vector< long > > ids
Inverted lists for indexes.
Definition: IndexIVF.h:55
-
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexIVFScalarQuantizer.cpp:733
+
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexScalarQuantizer.cpp:843
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
+
faiss::IndexScalarQuantizer::codes
std::vector< uint8_t > codes
Codes. Size ntotal * pq.code_size.
Definition: IndexScalarQuantizer.h:87
faiss::IndexScalarQuantizer::sq
ScalarQuantizer sq
Used to encode the vectors.
Definition: IndexScalarQuantizer.h:84
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::Index::ntotal
idx_t ntotal
total nb of indexed vectors
Definition: Index.h:65
-
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexIVFScalarQuantizer.h:39
- - - -
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexIVFScalarQuantizer.cpp:685
-
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexIVFScalarQuantizer.cpp:674
+ + + +
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexScalarQuantizer.h:48
+
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexScalarQuantizer.cpp:685
+
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexScalarQuantizer.cpp:674
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
- -
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexIVFScalarQuantizer.h:51
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
+
faiss::IndexScalarQuantizer::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexScalarQuantizer.cpp:789
faiss::IndexScalarQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexScalarQuantizer.cpp:799
-
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexIVFScalarQuantizer.h:52
+
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexScalarQuantizer.h:47
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:58
+
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:57
faiss::IndexScalarQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:713
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
diff --git a/docs/html/IndexScalarQuantizer_8h_source.html b/docs/html/IndexScalarQuantizer_8h_source.html index e3fa630c3..a5b0a6999 100644 --- a/docs/html/IndexScalarQuantizer_8h_source.html +++ b/docs/html/IndexScalarQuantizer_8h_source.html @@ -112,12 +112,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
27  */
28 
29 
-
30 struct ScalarQuantizer {
+
30 struct ScalarQuantizer {
31 
32  enum QuantizerType {
-
33  QT_8bit, ///< 8 bits per component
-
34  QT_4bit, ///< 4 bits per component
-
35  QT_8bit_uniform, ///< same, shared range for all dimensions
+
33  QT_8bit, ///< 8 bits per component
+
34  QT_4bit, ///< 4 bits per component
+
35  QT_8bit_uniform, ///< same, shared range for all dimensions
36  QT_4bit_uniform,
37  };
38 
@@ -129,23 +129,23 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
44 
45  // rangestat_arg.
46  enum RangeStat {
-
47  RS_minmax, ///< [min - rs*(max-min), max + rs*(max-min)]
-
48  RS_meanstd, ///< [mean - std * rs, mean + std * rs]
-
49  RS_quantiles, ///< [Q(rs), Q(1-rs)]
-
50  RS_optim, ///< alternate optimization of reconstruction error
+
47  RS_minmax, ///< [min - rs*(max-min), max + rs*(max-min)]
+
48  RS_meanstd, ///< [mean - std * rs, mean + std * rs]
+
49  RS_quantiles, ///< [Q(rs), Q(1-rs)]
+
50  RS_optim, ///< alternate optimization of reconstruction error
51  };
52 
53  RangeStat rangestat;
54  float rangestat_arg;
55 
56  /// dimension of input vectors
-
57  size_t d;
+
57  size_t d;
58 
59  /// bytes per vector
-
60  size_t code_size;
+
60  size_t code_size;
61 
62  /// trained values (including the range)
-
63  std::vector<float> trained;
+
63  std::vector<float> trained;
64 
65  ScalarQuantizer (size_t d, QuantizerType qtype);
66  ScalarQuantizer ();
@@ -211,13 +211,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
126  * distances are computed.
127  */
128 
-
129 struct IndexIVFScalarQuantizer:IndexIVF {
+
129 struct IndexIVFScalarQuantizer:IndexIVF {
130  ScalarQuantizer sq;
131 
132  size_t code_size;
133 
134  /// inverted list codes.
-
135  std::vector<std::vector<uint8_t> > codes;
+
135  std::vector<std::vector<uint8_t> > codes;
136 
137  IndexIVFScalarQuantizer(Index *quantizer, size_t d, size_t nlist,
138  ScalarQuantizer::QuantizerType qtype,
@@ -245,41 +245,41 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
160 
161 #endif
-
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexIVFScalarQuantizer.h:64
- +
faiss::ScalarQuantizer::code_size
size_t code_size
bytes per vector
Definition: IndexScalarQuantizer.h:60
+
faiss::IndexScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexScalarQuantizer.cpp:727
-
faiss::ScalarQuantizer::trained
std::vector< float > trained
trained values (including the range)
Definition: IndexIVFScalarQuantizer.h:67
-
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexIVFScalarQuantizer.cpp:714
+
faiss::IndexIVFScalarQuantizer::train_residual
void train_residual(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:824
+
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexScalarQuantizer.h:50
+
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexScalarQuantizer.h:35
faiss::IndexScalarQuantizer::add
void add(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:719
+
faiss::IndexScalarQuantizer::reset
void reset() override
removes all elements from the database.
Definition: IndexScalarQuantizer.cpp:783
-
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexIVFScalarQuantizer.cpp:849
-
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexIVFScalarQuantizer.cpp:882
- -
faiss::ScalarQuantizer::RS_optim
alternate optimization of reconstruction error
Definition: IndexIVFScalarQuantizer.h:54
-
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexIVFScalarQuantizer.cpp:733
+
faiss::IndexIVFScalarQuantizer::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: IndexScalarQuantizer.cpp:959
+
faiss::IndexIVFScalarQuantizer::codes
std::vector< std::vector< uint8_t > > codes
inverted list codes.
Definition: IndexScalarQuantizer.h:135
+
faiss::IndexIVFScalarQuantizer::merge_from_residuals
void merge_from_residuals(IndexIVF &other) override
Definition: IndexScalarQuantizer.cpp:992
+ +
faiss::IndexIVFScalarQuantizer::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: IndexScalarQuantizer.cpp:843
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::IndexIVF::quantizer
Index * quantizer
quantizer that maps vectors to inverted lists
Definition: IndexIVF.h:49
faiss::IndexScalarQuantizer::codes
std::vector< uint8_t > codes
Codes. Size ntotal * pq.code_size.
Definition: IndexScalarQuantizer.h:87
faiss::IndexScalarQuantizer::sq
ScalarQuantizer sq
Used to encode the vectors.
Definition: IndexScalarQuantizer.h:84
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
-
faiss::ScalarQuantizer::QT_8bit_uniform
same, shared range for all dimensions
Definition: IndexIVFScalarQuantizer.h:39
- - - - -
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexIVFScalarQuantizer.cpp:685
-
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexIVFScalarQuantizer.cpp:674
- -
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexIVFScalarQuantizer.h:51
+ + + +
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexScalarQuantizer.h:48
+
faiss::ScalarQuantizer::decode
void decode(const uint8_t *code, float *x, size_t n) const
decode a vector from a given code (or n vectors if third argument)
Definition: IndexScalarQuantizer.cpp:685
+
faiss::ScalarQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: IndexScalarQuantizer.cpp:674
faiss::IndexIVF::nlist
size_t nlist
number of possible key values
Definition: IndexIVF.h:46
+
faiss::IndexScalarQuantizer::reconstruct_n
void reconstruct_n(idx_t i0, idx_t ni, float *recons) const override
Definition: IndexScalarQuantizer.cpp:789
-
faiss::IndexIVFScalarQuantizer::codes
std::vector< std::vector< uint8_t > > codes
inverted list codes.
Definition: IndexIVFScalarQuantizer.h:92
faiss::IndexScalarQuantizer::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexScalarQuantizer.cpp:799
-
faiss::ScalarQuantizer::RS_meanstd
[mean - std * rs, mean + std * rs]
Definition: IndexIVFScalarQuantizer.h:52
+
faiss::ScalarQuantizer::RS_minmax
[min - rs*(max-min), max + rs*(max-min)]
Definition: IndexScalarQuantizer.h:47
+
faiss::ScalarQuantizer::trained
std::vector< float > trained
trained values (including the range)
Definition: IndexScalarQuantizer.h:63
faiss::IndexScalarQuantizer::train
void train(idx_t n, const float *x) override
Definition: IndexScalarQuantizer.cpp:713
-
faiss::ScalarQuantizer::d
size_t d
dimension of input vectors
Definition: IndexIVFScalarQuantizer.h:61
+
faiss::ScalarQuantizer::d
size_t d
dimension of input vectors
Definition: IndexScalarQuantizer.h:57
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
diff --git a/docs/html/Index_8cpp_source.html b/docs/html/Index_8cpp_source.html index 7df534319..bf565b9ff 100644 --- a/docs/html/Index_8cpp_source.html +++ b/docs/html/Index_8cpp_source.html @@ -112,62 +112,61 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
27  search (n, x, k, distances, labels);
28 }
29 
-
30 
-
31 void Index::add_with_ids (idx_t n, const float * x, const long *xids)
-
32 {
-
33  FAISS_THROW_MSG ("add_with_ids not implemented for this type of index");
-
34 }
-
35 
+
30 void Index::add_with_ids(
+
31  idx_t /*n*/,
+
32  const float* /*x*/,
+
33  const long* /*xids*/) {
+
34  FAISS_THROW_MSG ("add_with_ids not implemented for this type of index");
+
35 }
36 
-
37 long Index::remove_ids (const IDSelector & sel)
-
38 {
-
39  FAISS_THROW_MSG ("remove_ids not implemented for this type of index");
-
40  return -1;
-
41 }
+
37 long Index::remove_ids(const IDSelector& /*sel*/) {
+
38  FAISS_THROW_MSG ("remove_ids not implemented for this type of index");
+
39  return -1;
+
40 }
+
41 
42 
-
43 
-
44 void Index::reconstruct (idx_t, float * ) const {
-
45  FAISS_THROW_MSG ("Can not compute reconstruct without "
-
46  "knowing how to do so");
-
47 }
+
43 void Index::reconstruct (idx_t, float * ) const {
+
44  FAISS_THROW_MSG ("Can not compute reconstruct without "
+
45  "knowing how to do so");
+
46 }
+
47 
48 
-
49 
-
50 void Index::reconstruct_n (idx_t i0, idx_t ni, float *recons) const {
-
51  for (idx_t i = 0; i < ni; i++) {
-
52  reconstruct (i0 + i, recons + i * d);
-
53  }
-
54 }
+
49 void Index::reconstruct_n (idx_t i0, idx_t ni, float *recons) const {
+
50  for (idx_t i = 0; i < ni; i++) {
+
51  reconstruct (i0 + i, recons + i * d);
+
52  }
+
53 }
+
54 
55 
56 
-
57 
-
58 void Index::compute_residual (const float * x,
-
59  float * residual, idx_t key) const {
-
60  reconstruct (key, residual);
-
61  for (size_t i = 0; i < d; i++)
-
62  residual[i] = x[i] - residual[i];
-
63 }
+
57 void Index::compute_residual (const float * x,
+
58  float * residual, idx_t key) const {
+
59  reconstruct (key, residual);
+
60  for (size_t i = 0; i < d; i++)
+
61  residual[i] = x[i] - residual[i];
+
62 }
+
63 
64 
-
65 
-
66 void Index::display () const {
-
67  printf ("Index: %s -> %ld elements\n", typeid (*this).name(), ntotal);
-
68 }
-
69 
-
70 }
+
65 void Index::display () const {
+
66  printf ("Index: %s -> %ld elements\n", typeid (*this).name(), ntotal);
+
67 }
+
68 
+
69 }
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
-
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:31
+
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:30
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
-
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:50
+
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:49
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::Index::ntotal
idx_t ntotal
total nb of indexed vectors
Definition: Index.h:65
faiss::Index::remove_ids
virtual long remove_ids(const IDSelector &sel)
Definition: Index.cpp:37
faiss::Index::search
virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0
-
faiss::Index::display
void display() const
Definition: Index.cpp:66
+
faiss::Index::display
void display() const
Definition: Index.cpp:65
faiss::Index::range_search
virtual void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const
Definition: Index.cpp:17
-
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:58
-
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:44
+
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:57
+
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:43
diff --git a/docs/html/Index_8h_source.html b/docs/html/Index_8h_source.html index 6b5dc1e45..08327f281 100644 --- a/docs/html/Index_8h_source.html +++ b/docs/html/Index_8h_source.html @@ -171,8 +171,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
86  * @param n nb of training vectors
87  * @param x training vecors, size n * d
88  */
-
89  virtual void train (idx_t n, const float *x) {
-
90  // does nothing by default
+
89  virtual void train(idx_t /*n*/, const float* /*x*/) {
+
90  // does nothing by default
91  }
92 
93  /** Add n vectors of dimension d to the index.
@@ -275,11 +275,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
190 
191 #endif
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::Index::assign
void assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)
Definition: Index.cpp:23
-
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:31
+
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:30
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
-
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:50
+
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:49
faiss::Index::add
virtual void add(idx_t n, const float *x)=0
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::Index::ntotal
idx_t ntotal
total nb of indexed vectors
Definition: Index.h:65
@@ -287,14 +288,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::remove_ids
virtual long remove_ids(const IDSelector &sel)
Definition: Index.cpp:37
faiss::Index::search
virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0
-
faiss::Index::display
void display() const
Definition: Index.cpp:66
+
faiss::Index::display
void display() const
Definition: Index.cpp:65
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
faiss::Index::range_search
virtual void range_search(idx_t n, const float *x, float radius, RangeSearchResult *result) const
Definition: Index.cpp:17
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:58
-
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:44
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
+
faiss::Index::compute_residual
void compute_residual(const float *x, float *residual, idx_t key) const
Definition: Index.cpp:57
+
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:43
faiss::MetricType
MetricType
Some algorithms support both an inner product vetsion and a L2 search version.
Definition: Index.h:43
diff --git a/docs/html/MetaIndexes_8cpp_source.html b/docs/html/MetaIndexes_8cpp_source.html index ce4d86974..e00822acb 100644 --- a/docs/html/MetaIndexes_8cpp_source.html +++ b/docs/html/MetaIndexes_8cpp_source.html @@ -131,7 +131,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
46 
47 void IndexIDMap::train (idx_t n, const float *x)
48 {
-
49  index->train (n, x);
+
49  index->train (n, x);
50  is_trained = index->is_trained;
51 }
52 
@@ -692,150 +692,148 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
607 
608 }
609 
-
610 void IndexSplitVectors::add (idx_t n, const float *x)
-
611 {
-
612  FAISS_THROW_MSG ("not implemented");
-
613 }
-
614 
-
615 namespace {
-
616 
-
617 /// callback + thread management to query in 1 shard
-
618 struct SplitQueryJob {
-
619  const IndexSplitVectors *index; // the relevant index
-
620  int no; // shard number
-
621 
-
622  // query params
-
623  idx_t n;
-
624  const float *x;
-
625  idx_t k;
-
626  float *distances;
-
627  idx_t *labels;
+
610 void IndexSplitVectors::add(idx_t /*n*/, const float* /*x*/) {
+
611  FAISS_THROW_MSG("not implemented");
+
612 }
+
613 
+
614 namespace {
+
615 
+
616 /// callback + thread management to query in 1 shard
+
617 struct SplitQueryJob {
+
618  const IndexSplitVectors *index; // the relevant index
+
619  int no; // shard number
+
620 
+
621  // query params
+
622  idx_t n;
+
623  const float *x;
+
624  idx_t k;
+
625  float *distances;
+
626  idx_t *labels;
+
627 
628 
-
629 
-
630  void run ()
-
631  {
-
632  if (index->verbose)
-
633  printf ("begin query shard %d on %ld points\n", no, n);
-
634  const Index * sub_index = index->sub_indexes[no];
-
635  long sub_d = sub_index->d, d = index->d;
-
636  idx_t ofs = 0;
-
637  for (int i = 0; i < no; i++) ofs += index->sub_indexes[i]->d;
-
638  float *sub_x = new float [sub_d * n];
-
639  ScopeDeleter<float> del (sub_x);
-
640  for (idx_t i = 0; i < n; i++)
-
641  memcpy (sub_x + i * sub_d, x + ofs + i * d, sub_d * sizeof (sub_x));
-
642  sub_index->search (n, sub_x, k, distances, labels);
-
643  if (index->verbose)
-
644  printf ("end query shard %d\n", no);
-
645  }
-
646 
-
647 };
+
629  void run ()
+
630  {
+
631  if (index->verbose)
+
632  printf ("begin query shard %d on %ld points\n", no, n);
+
633  const Index * sub_index = index->sub_indexes[no];
+
634  long sub_d = sub_index->d, d = index->d;
+
635  idx_t ofs = 0;
+
636  for (int i = 0; i < no; i++) ofs += index->sub_indexes[i]->d;
+
637  float *sub_x = new float [sub_d * n];
+
638  ScopeDeleter<float> del (sub_x);
+
639  for (idx_t i = 0; i < n; i++)
+
640  memcpy (sub_x + i * sub_d, x + ofs + i * d, sub_d * sizeof (sub_x));
+
641  sub_index->search (n, sub_x, k, distances, labels);
+
642  if (index->verbose)
+
643  printf ("end query shard %d\n", no);
+
644  }
+
645 
+
646 };
+
647 
648 
649 
-
650 
-
651 }
+
650 }
+
651 
652 
653 
-
654 
-
655 void IndexSplitVectors::search (
-
656  idx_t n, const float *x, idx_t k,
-
657  float *distances, idx_t *labels) const
-
658 {
-
659  FAISS_THROW_IF_NOT_MSG (k == 1,
-
660  "search implemented only for k=1");
-
661  FAISS_THROW_IF_NOT_MSG (sum_d == d,
-
662  "not enough indexes compared to # dimensions");
-
663 
-
664  long nshard = sub_indexes.size();
-
665  float *all_distances = new float [nshard * k * n];
-
666  idx_t *all_labels = new idx_t [nshard * k * n];
-
667  ScopeDeleter<float> del (all_distances);
-
668  ScopeDeleter<idx_t> del2 (all_labels);
-
669 
-
670  // pre-alloc because we don't want reallocs
-
671  std::vector<Thread<SplitQueryJob> > qss (nshard);
-
672  for (int i = 0; i < nshard; i++) {
-
673  SplitQueryJob qs = {
-
674  this, i, n, x, k,
-
675  i == 0 ? distances : all_distances + i * k * n,
-
676  i == 0 ? labels : all_labels + i * k * n
-
677  };
-
678  if (threaded) {
-
679  qss[i] = Thread<SplitQueryJob> (qs);
-
680  qss[i].start();
-
681  } else {
-
682  qs.run();
-
683  }
-
684  }
-
685 
-
686  if (threaded) {
-
687  for (int i = 0; i < qss.size(); i++) {
-
688  qss[i].wait();
-
689  }
-
690  }
-
691 
-
692  long factor = 1;
-
693  for (int i = 0; i < nshard; i++) {
-
694  if (i > 0) { // results of 0 are already in the table
-
695  const float *distances_i = all_distances + i * k * n;
-
696  const idx_t *labels_i = all_labels + i * k * n;
-
697  for (long j = 0; j < n; j++) {
-
698  if (labels[j] >= 0 && labels_i[j] >= 0) {
-
699  labels[j] += labels_i[j] * factor;
-
700  distances[j] += distances_i[j];
-
701  } else {
-
702  labels[j] = -1;
-
703  distances[j] = 0.0 / 0.0;
-
704  }
-
705  }
-
706  }
-
707  factor *= sub_indexes[i]->ntotal;
-
708  }
-
709 
-
710 }
-
711 
-
712 
-
713 void IndexSplitVectors::train (idx_t n, const float *x)
-
714 {
-
715  FAISS_THROW_MSG ("not implemented");
-
716 }
-
717 
-
718 void IndexSplitVectors::reset ()
-
719 {
-
720  FAISS_THROW_MSG ("not implemented");
-
721 }
-
722 
-
723 
-
724 IndexSplitVectors::~IndexSplitVectors ()
-
725 {
-
726  if (own_fields) {
-
727  for (int s = 0; s < sub_indexes.size(); s++)
-
728  delete sub_indexes [s];
-
729  }
-
730 }
+
654 void IndexSplitVectors::search (
+
655  idx_t n, const float *x, idx_t k,
+
656  float *distances, idx_t *labels) const
+
657 {
+
658  FAISS_THROW_IF_NOT_MSG (k == 1,
+
659  "search implemented only for k=1");
+
660  FAISS_THROW_IF_NOT_MSG (sum_d == d,
+
661  "not enough indexes compared to # dimensions");
+
662 
+
663  long nshard = sub_indexes.size();
+
664  float *all_distances = new float [nshard * k * n];
+
665  idx_t *all_labels = new idx_t [nshard * k * n];
+
666  ScopeDeleter<float> del (all_distances);
+
667  ScopeDeleter<idx_t> del2 (all_labels);
+
668 
+
669  // pre-alloc because we don't want reallocs
+
670  std::vector<Thread<SplitQueryJob> > qss (nshard);
+
671  for (int i = 0; i < nshard; i++) {
+
672  SplitQueryJob qs = {
+
673  this, i, n, x, k,
+
674  i == 0 ? distances : all_distances + i * k * n,
+
675  i == 0 ? labels : all_labels + i * k * n
+
676  };
+
677  if (threaded) {
+
678  qss[i] = Thread<SplitQueryJob> (qs);
+
679  qss[i].start();
+
680  } else {
+
681  qs.run();
+
682  }
+
683  }
+
684 
+
685  if (threaded) {
+
686  for (int i = 0; i < qss.size(); i++) {
+
687  qss[i].wait();
+
688  }
+
689  }
+
690 
+
691  long factor = 1;
+
692  for (int i = 0; i < nshard; i++) {
+
693  if (i > 0) { // results of 0 are already in the table
+
694  const float *distances_i = all_distances + i * k * n;
+
695  const idx_t *labels_i = all_labels + i * k * n;
+
696  for (long j = 0; j < n; j++) {
+
697  if (labels[j] >= 0 && labels_i[j] >= 0) {
+
698  labels[j] += labels_i[j] * factor;
+
699  distances[j] += distances_i[j];
+
700  } else {
+
701  labels[j] = -1;
+
702  distances[j] = 0.0 / 0.0;
+
703  }
+
704  }
+
705  }
+
706  factor *= sub_indexes[i]->ntotal;
+
707  }
+
708 
+
709 }
+
710 
+
711 void IndexSplitVectors::train(idx_t /*n*/, const float* /*x*/) {
+
712  FAISS_THROW_MSG("not implemented");
+
713 }
+
714 
+
715 void IndexSplitVectors::reset ()
+
716 {
+
717  FAISS_THROW_MSG ("not implemented");
+
718 }
+
719 
+
720 
+
721 IndexSplitVectors::~IndexSplitVectors ()
+
722 {
+
723  if (own_fields) {
+
724  for (int s = 0; s < sub_indexes.size(); s++)
+
725  delete sub_indexes [s];
+
726  }
+
727 }
+
728 
+
729 
+
730 
731 
732 
733 
-
734 
-
735 
-
736 
-
737 }; // namespace faiss
+
734 }; // namespace faiss
faiss::IndexShards::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:385
faiss::IndexShards::IndexShards
IndexShards(idx_t d, bool threaded=false, bool successive_ids=true)
Definition: MetaIndexes.cpp:355
faiss::Index::reset
virtual void reset()=0
removes all elements from the database.
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::IndexIDMap::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:69
faiss::IndexShards::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: MetaIndexes.cpp:425
faiss::IndexShards::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:486
faiss::IndexIDMap2::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: MetaIndexes.cpp:130
-
faiss::IndexSplitVectors::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:718
+
faiss::IndexSplitVectors::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:715
faiss::IndexIDMap::add
void add(idx_t n, const float *x) override
this will fail. Use add_with_ids
Definition: MetaIndexes.cpp:40
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::IndexIDMap::id_map
std::vector< long > id_map
! whether pointers are deleted in destructo
Definition: MetaIndexes.h:29
faiss::Index::add
virtual void add(idx_t n, const float *x)=0
-
faiss::IndexSplitVectors::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:713
+
faiss::IndexSplitVectors::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:711
faiss::IndexShards::add
void add(idx_t n, const float *x) override
supported only for sub-indices that implement add_with_ids
Definition: MetaIndexes.cpp:408
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::Index::ntotal
idx_t ntotal
total nb of indexed vectors
Definition: Index.h:65
@@ -848,15 +846,14 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::search
virtual void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0
faiss::IndexShards::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:478
faiss::IndexIDMap::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:53
-
faiss::IndexSplitVectors::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:655
+
faiss::IndexSplitVectors::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:654
faiss::IndexIDMap::remove_ids
long remove_ids(const IDSelector &sel) override
remove ids adapted to IndexFlat
Definition: MetaIndexes.cpp:95
faiss::Index::metric_type
MetricType metric_type
type of metric this index uses for search
Definition: Index.h:72
faiss::IndexIDMap2::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: MetaIndexes.cpp:156
faiss::IndexIDMap::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:47
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
-
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:44
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
+
faiss::Index::reconstruct
virtual void reconstruct(idx_t key, float *recons) const
Definition: Index.cpp:43
faiss::IndexIDMap::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: MetaIndexes.cpp:60
faiss::IndexSplitVectors::IndexSplitVectors
IndexSplitVectors(idx_t d, bool threaded=false)
sum of dimensions seen so far
Definition: MetaIndexes.cpp:580
faiss::IndexIDMap::own_fields
bool own_fields
! the sub-index
Definition: MetaIndexes.h:28
diff --git a/docs/html/MetaIndexes_8h_source.html b/docs/html/MetaIndexes_8h_source.html index c2360c88a..a94c87804 100644 --- a/docs/html/MetaIndexes_8h_source.html +++ b/docs/html/MetaIndexes_8h_source.html @@ -255,12 +255,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexShards::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:486
faiss::IndexIDMap2::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: MetaIndexes.cpp:130
-
faiss::IndexSplitVectors::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:718
+
faiss::IndexSplitVectors::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:715
faiss::IndexIDMap::add
void add(idx_t n, const float *x) override
this will fail. Use add_with_ids
Definition: MetaIndexes.cpp:40
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::IndexIDMap::id_map
std::vector< long > id_map
! whether pointers are deleted in destructo
Definition: MetaIndexes.h:29
-
faiss::IndexSplitVectors::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:713
+
faiss::IndexSplitVectors::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:711
faiss::IndexShards::add
void add(idx_t n, const float *x) override
supported only for sub-indices that implement add_with_ids
Definition: MetaIndexes.cpp:408
faiss::Index::idx_t
long idx_t
all indices are this type
Definition: Index.h:62
faiss::IndexIDMap2::construct_rev_map
void construct_rev_map()
make the rev_map from scratch
Definition: MetaIndexes.cpp:139
@@ -269,7 +269,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::IndexShards::threaded
bool threaded
should the sub-indexes be deleted along with this?
Definition: MetaIndexes.h:87
faiss::IndexShards::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:478
faiss::IndexIDMap::reset
void reset() override
removes all elements from the database.
Definition: MetaIndexes.cpp:53
-
faiss::IndexSplitVectors::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:655
+
faiss::IndexSplitVectors::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: MetaIndexes.cpp:654
faiss::IndexIDMap::remove_ids
long remove_ids(const IDSelector &sel) override
remove ids adapted to IndexFlat
Definition: MetaIndexes.cpp:95
faiss::IndexIDMap2::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: MetaIndexes.cpp:156
faiss::IndexIDMap::train
void train(idx_t n, const float *x) override
Definition: MetaIndexes.cpp:47
diff --git a/docs/html/StandardGpuResources_8cpp_source.html b/docs/html/StandardGpuResources_8cpp_source.html index 1b73d7afb..e7d388b5d 100644 --- a/docs/html/StandardGpuResources_8cpp_source.html +++ b/docs/html/StandardGpuResources_8cpp_source.html @@ -127,181 +127,220 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
38  for (auto& entry : defaultStreams_) {
39  DeviceScope scope(entry.first);
40 
-
41  CUDA_VERIFY(cudaStreamDestroy(entry.second));
-
42  }
-
43 
-
44  for (auto& entry : alternateStreams_) {
-
45  DeviceScope scope(entry.first);
-
46 
-
47  for (auto stream : entry.second) {
-
48  CUDA_VERIFY(cudaStreamDestroy(stream));
-
49  }
-
50  }
+
41  auto it = userDefaultStreams_.find(entry.first);
+
42  if (it == userDefaultStreams_.end()) {
+
43  // The user did not specify this stream, thus we are the ones
+
44  // who have created it
+
45  CUDA_VERIFY(cudaStreamDestroy(entry.second));
+
46  }
+
47  }
+
48 
+
49  for (auto& entry : alternateStreams_) {
+
50  DeviceScope scope(entry.first);
51 
-
52  for (auto& entry : asyncCopyStreams_) {
-
53  DeviceScope scope(entry.first);
-
54 
-
55  CUDA_VERIFY(cudaStreamDestroy(entry.second));
-
56  }
-
57 
-
58  for (auto& entry : blasHandles_) {
-
59  DeviceScope scope(entry.first);
-
60 
-
61  auto blasStatus = cublasDestroy(entry.second);
-
62  FAISS_ASSERT(blasStatus == CUBLAS_STATUS_SUCCESS);
-
63  }
-
64 
-
65  if (pinnedMemAlloc_) {
-
66  CUDA_VERIFY(cudaFreeHost(pinnedMemAlloc_));
-
67  }
-
68 }
+
52  for (auto stream : entry.second) {
+
53  CUDA_VERIFY(cudaStreamDestroy(stream));
+
54  }
+
55  }
+
56 
+
57  for (auto& entry : asyncCopyStreams_) {
+
58  DeviceScope scope(entry.first);
+
59 
+
60  CUDA_VERIFY(cudaStreamDestroy(entry.second));
+
61  }
+
62 
+
63  for (auto& entry : blasHandles_) {
+
64  DeviceScope scope(entry.first);
+
65 
+
66  auto blasStatus = cublasDestroy(entry.second);
+
67  FAISS_ASSERT(blasStatus == CUBLAS_STATUS_SUCCESS);
+
68  }
69 
-
70 void
-
71 StandardGpuResources::noTempMemory() {
-
72  setTempMemory(0);
+
70  if (pinnedMemAlloc_) {
+
71  CUDA_VERIFY(cudaFreeHost(pinnedMemAlloc_));
+
72  }
73 }
74 
75 void
-
76 StandardGpuResources::setTempMemory(size_t size) {
-
77  useFraction_ = false;
-
78  tempMemSize_ = size;
-
79 }
-
80 
-
81 void
-
82 StandardGpuResources::setTempMemoryFraction(float fraction) {
-
83  FAISS_ASSERT(fraction >= 0.0f && fraction <= 0.5f);
-
84  useFraction_ = true;
-
85  tempMemFraction_ = fraction;
-
86 }
-
87 
-
88 void
-
89 StandardGpuResources::setPinnedMemory(size_t size) {
-
90  // Should not call this after devices have been initialized
-
91  FAISS_ASSERT(defaultStreams_.size() == 0);
-
92  FAISS_ASSERT(!pinnedMemAlloc_);
-
93 
-
94  pinnedMemSize_ = size;
-
95 }
-
96 
-
97 void
-
98 StandardGpuResources::initializeForDevice(int device) {
-
99  // Use default streams as a marker for whether or not a certain
-
100  // device has been initialized
-
101  if (defaultStreams_.count(device) != 0) {
-
102  return;
-
103  }
-
104 
-
105  // If this is the first device that we're initializing, create our
-
106  // pinned memory allocation
-
107  if (defaultStreams_.empty() && pinnedMemSize_ > 0) {
-
108  CUDA_VERIFY(cudaHostAlloc(&pinnedMemAlloc_,
-
109  pinnedMemSize_,
-
110  cudaHostAllocDefault));
-
111  pinnedMemAllocSize_ = pinnedMemSize_;
-
112  }
+
76 StandardGpuResources::noTempMemory() {
+
77  setTempMemory(0);
+
78 }
+
79 
+
80 void
+
81 StandardGpuResources::setTempMemory(size_t size) {
+
82  useFraction_ = false;
+
83  tempMemSize_ = size;
+
84 }
+
85 
+
86 void
+
87 StandardGpuResources::setTempMemoryFraction(float fraction) {
+
88  FAISS_ASSERT(fraction >= 0.0f && fraction <= 0.5f);
+
89  useFraction_ = true;
+
90  tempMemFraction_ = fraction;
+
91 }
+
92 
+
93 void
+
94 StandardGpuResources::setPinnedMemory(size_t size) {
+
95  // Should not call this after devices have been initialized
+
96  FAISS_ASSERT(defaultStreams_.size() == 0);
+
97  FAISS_ASSERT(!pinnedMemAlloc_);
+
98 
+
99  pinnedMemSize_ = size;
+
100 }
+
101 
+
102 void
+
103 StandardGpuResources::setDefaultStream(int device, cudaStream_t stream) {
+
104  auto it = defaultStreams_.find(device);
+
105  if (it != defaultStreams_.end()) {
+
106  // Replace this stream with the user stream
+
107  CUDA_VERIFY(cudaStreamDestroy(it->second));
+
108  it->second = stream;
+
109  }
+
110 
+
111  userDefaultStreams_[device] = stream;
+
112 }
113 
-
114  FAISS_ASSERT(device < getNumDevices());
-
115  DeviceScope scope(device);
-
116 
-
117  // Make sure that device properties for all devices are cached
-
118  auto& prop = getDeviceProperties(device);
-
119 
-
120  // Also check to make sure we meet our minimum compute capability (3.0)
-
121  FAISS_ASSERT_FMT(prop.major >= 3,
-
122  "Device id %d with CC %d.%d not supported, "
-
123  "need 3.0+ compute capability",
-
124  device, prop.major, prop.minor);
-
125 
-
126  // Create streams
-
127  cudaStream_t defaultStream = 0;
-
128  CUDA_VERIFY(cudaStreamCreateWithFlags(&defaultStream,
-
129  cudaStreamNonBlocking));
-
130 
-
131  defaultStreams_[device] = defaultStream;
-
132 
-
133  cudaStream_t asyncCopyStream = 0;
-
134  CUDA_VERIFY(cudaStreamCreateWithFlags(&asyncCopyStream,
-
135  cudaStreamNonBlocking));
-
136 
-
137  asyncCopyStreams_[device] = asyncCopyStream;
-
138 
-
139  std::vector<cudaStream_t> deviceStreams;
-
140  for (int j = 0; j < kNumStreams; ++j) {
-
141  cudaStream_t stream = 0;
-
142  CUDA_VERIFY(cudaStreamCreateWithFlags(&stream,
-
143  cudaStreamNonBlocking));
-
144 
-
145  deviceStreams.push_back(stream);
-
146  }
-
147 
-
148  alternateStreams_[device] = std::move(deviceStreams);
+
114 void
+
115 StandardGpuResources::setDefaultNullStreamAllDevices() {
+
116  for (int dev = 0; dev < getNumDevices(); ++dev) {
+
117  setDefaultStream(dev, nullptr);
+
118  }
+
119 }
+
120 
+
121 void
+
122 StandardGpuResources::initializeForDevice(int device) {
+
123  // Use default streams as a marker for whether or not a certain
+
124  // device has been initialized
+
125  if (defaultStreams_.count(device) != 0) {
+
126  return;
+
127  }
+
128 
+
129  // If this is the first device that we're initializing, create our
+
130  // pinned memory allocation
+
131  if (defaultStreams_.empty() && pinnedMemSize_ > 0) {
+
132  CUDA_VERIFY(cudaHostAlloc(&pinnedMemAlloc_,
+
133  pinnedMemSize_,
+
134  cudaHostAllocDefault));
+
135  pinnedMemAllocSize_ = pinnedMemSize_;
+
136  }
+
137 
+
138  FAISS_ASSERT(device < getNumDevices());
+
139  DeviceScope scope(device);
+
140 
+
141  // Make sure that device properties for all devices are cached
+
142  auto& prop = getDeviceProperties(device);
+
143 
+
144  // Also check to make sure we meet our minimum compute capability (3.0)
+
145  FAISS_ASSERT_FMT(prop.major >= 3,
+
146  "Device id %d with CC %d.%d not supported, "
+
147  "need 3.0+ compute capability",
+
148  device, prop.major, prop.minor);
149 
-
150  // Create cuBLAS handle
-
151  cublasHandle_t blasHandle = 0;
-
152  auto blasStatus = cublasCreate(&blasHandle);
-
153  FAISS_ASSERT(blasStatus == CUBLAS_STATUS_SUCCESS);
-
154  blasHandles_[device] = blasHandle;
-
155 
-
156  size_t toAlloc = 0;
-
157  if (useFraction_) {
-
158  size_t devFree = 0;
-
159  size_t devTotal = 0;
+
150  // Create streams
+
151  cudaStream_t defaultStream = 0;
+
152  auto it = userDefaultStreams_.find(device);
+
153  if (it != userDefaultStreams_.end()) {
+
154  // We already have a stream provided by the user
+
155  defaultStream = it->second;
+
156  } else {
+
157  CUDA_VERIFY(cudaStreamCreateWithFlags(&defaultStream,
+
158  cudaStreamNonBlocking));
+
159  }
160 
-
161  CUDA_VERIFY(cudaMemGetInfo(&devFree, &devTotal));
+
161  defaultStreams_[device] = defaultStream;
162 
-
163  toAlloc = (size_t) (tempMemFraction_ * devTotal);
-
164  } else {
-
165  toAlloc = tempMemSize_;
-
166  }
-
167 
-
168  FAISS_ASSERT(memory_.count(device) == 0);
-
169  memory_.emplace(device,
-
170  std::unique_ptr<StackDeviceMemory>(
-
171  new StackDeviceMemory(device, toAlloc)));
-
172 }
-
173 
-
174 cublasHandle_t
-
175 StandardGpuResources::getBlasHandle(int device) {
-
176  initializeForDevice(device);
-
177  return blasHandles_[device];
-
178 }
+
163  cudaStream_t asyncCopyStream = 0;
+
164  CUDA_VERIFY(cudaStreamCreateWithFlags(&asyncCopyStream,
+
165  cudaStreamNonBlocking));
+
166 
+
167  asyncCopyStreams_[device] = asyncCopyStream;
+
168 
+
169  std::vector<cudaStream_t> deviceStreams;
+
170  for (int j = 0; j < kNumStreams; ++j) {
+
171  cudaStream_t stream = 0;
+
172  CUDA_VERIFY(cudaStreamCreateWithFlags(&stream,
+
173  cudaStreamNonBlocking));
+
174 
+
175  deviceStreams.push_back(stream);
+
176  }
+
177 
+
178  alternateStreams_[device] = std::move(deviceStreams);
179 
-
180 cudaStream_t
-
181 StandardGpuResources::getDefaultStream(int device) {
-
182  initializeForDevice(device);
-
183  return defaultStreams_[device];
-
184 }
+
180  // Create cuBLAS handle
+
181  cublasHandle_t blasHandle = 0;
+
182  auto blasStatus = cublasCreate(&blasHandle);
+
183  FAISS_ASSERT(blasStatus == CUBLAS_STATUS_SUCCESS);
+
184  blasHandles_[device] = blasHandle;
185 
-
186 std::vector<cudaStream_t>
-
187 StandardGpuResources::getAlternateStreams(int device) {
-
188  initializeForDevice(device);
-
189  return alternateStreams_[device];
-
190 }
-
191 
-
192 DeviceMemory& StandardGpuResources::getMemoryManager(int device) {
-
193  initializeForDevice(device);
-
194  return *memory_[device];
-
195 }
-
196 
-
197 std::pair<void*, size_t>
-
198 StandardGpuResources::getPinnedMemory() {
-
199  return std::make_pair(pinnedMemAlloc_, pinnedMemAllocSize_);
-
200 }
-
201 
-
202 cudaStream_t
-
203 StandardGpuResources::getAsyncCopyStream(int device) {
-
204  initializeForDevice(device);
-
205  return asyncCopyStreams_[device];
-
206 }
-
207 
-
208 } } // namespace
- - -
faiss::gpu::StandardGpuResources::initializeForDevice
void initializeForDevice(int device) override
Internal system calls.
Definition: StandardGpuResources.cpp:98
- - +
186  size_t toAlloc = 0;
+
187  if (useFraction_) {
+
188  size_t devFree = 0;
+
189  size_t devTotal = 0;
+
190 
+
191  CUDA_VERIFY(cudaMemGetInfo(&devFree, &devTotal));
+
192 
+
193  toAlloc = (size_t) (tempMemFraction_ * devTotal);
+
194  } else {
+
195  toAlloc = tempMemSize_;
+
196  }
+
197 
+
198  FAISS_ASSERT(memory_.count(device) == 0);
+
199  memory_.emplace(device,
+
200  std::unique_ptr<StackDeviceMemory>(
+
201  new StackDeviceMemory(device, toAlloc)));
+
202 }
+
203 
+
204 cublasHandle_t
+
205 StandardGpuResources::getBlasHandle(int device) {
+
206  initializeForDevice(device);
+
207  return blasHandles_[device];
+
208 }
+
209 
+
210 cudaStream_t
+
211 StandardGpuResources::getDefaultStream(int device) {
+
212  initializeForDevice(device);
+
213  return defaultStreams_[device];
+
214 }
+
215 
+
216 std::vector<cudaStream_t>
+
217 StandardGpuResources::getAlternateStreams(int device) {
+
218  initializeForDevice(device);
+
219  return alternateStreams_[device];
+
220 }
+
221 
+
222 DeviceMemory& StandardGpuResources::getMemoryManager(int device) {
+
223  initializeForDevice(device);
+
224  return *memory_[device];
+
225 }
+
226 
+
227 std::pair<void*, size_t>
+
228 StandardGpuResources::getPinnedMemory() {
+
229  return std::make_pair(pinnedMemAlloc_, pinnedMemAllocSize_);
+
230 }
+
231 
+
232 cudaStream_t
+
233 StandardGpuResources::getAsyncCopyStream(int device) {
+
234  initializeForDevice(device);
+
235  return asyncCopyStreams_[device];
+
236 }
+
237 
+
238 } } // namespace
+
faiss::gpu::StandardGpuResources::setDefaultStream
void setDefaultStream(int device, cudaStream_t stream)
Called to change the stream for work ordering.
Definition: StandardGpuResources.cpp:103
+
faiss::gpu::StandardGpuResources::getBlasHandle
cublasHandle_t getBlasHandle(int device) override
Returns the cuBLAS handle that we use for the given device.
Definition: StandardGpuResources.cpp:205
+ + +
faiss::gpu::StandardGpuResources::initializeForDevice
void initializeForDevice(int device) override
Internal system calls.
Definition: StandardGpuResources.cpp:122
+
faiss::gpu::StandardGpuResources::getAsyncCopyStream
cudaStream_t getAsyncCopyStream(int device) override
Returns the stream on which we perform async CPU &lt;-&gt; GPU copies.
Definition: StandardGpuResources.cpp:233
+
faiss::gpu::StandardGpuResources::getMemoryManager
DeviceMemory & getMemoryManager(int device) override
Returns the temporary memory manager for the given device.
Definition: StandardGpuResources.cpp:222
+ + +
faiss::gpu::StandardGpuResources::getDefaultStream
cudaStream_t getDefaultStream(int device) override
Definition: StandardGpuResources.cpp:211
+ +
faiss::gpu::DeviceMemory
Manages temporary memory allocations on a GPU device.
Definition: DeviceMemory.h:46
+
faiss::gpu::StandardGpuResources::getPinnedMemory
std::pair< void *, size_t > getPinnedMemory() override
Returns the available CPU pinned memory buffer.
Definition: StandardGpuResources.cpp:228
+
faiss::gpu::StandardGpuResources::getAlternateStreams
std::vector< cudaStream_t > getAlternateStreams(int device) override
Returns the set of alternative streams that we use for the given device.
Definition: StandardGpuResources.cpp:217
diff --git a/docs/html/StandardGpuResources_8h_source.html b/docs/html/StandardGpuResources_8h_source.html index 88501a2e6..a314a8b50 100644 --- a/docs/html/StandardGpuResources_8h_source.html +++ b/docs/html/StandardGpuResources_8h_source.html @@ -130,66 +130,85 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
41  /// Set amount of pinned memory to allocate, for async GPU <-> CPU
42  /// transfers
43  void setPinnedMemory(size_t size);
-
44 
-
45  public:
-
46  /// Internal system calls
-
47  void initializeForDevice(int device) override;
-
48 
-
49  cublasHandle_t getBlasHandle(int device) override;
-
50 
-
51  cudaStream_t getDefaultStream(int device) override;
-
52 
-
53  std::vector<cudaStream_t> getAlternateStreams(int device) override;
-
54 
-
55  DeviceMemory& getMemoryManager(int device) override;
-
56 
-
57  std::pair<void*, size_t> getPinnedMemory() override;
-
58 
-
59  cudaStream_t getAsyncCopyStream(int device) override;
-
60 
-
61  private:
-
62  /// Our default stream that work is ordered on, one per each device
-
63  std::unordered_map<int, cudaStream_t> defaultStreams_;
-
64 
-
65  /// Other streams we can use, per each device
-
66  std::unordered_map<int, std::vector<cudaStream_t> > alternateStreams_;
-
67 
-
68  /// Async copy stream to use for GPU <-> CPU pinned memory copies
-
69  std::unordered_map<int, cudaStream_t> asyncCopyStreams_;
-
70 
-
71  /// cuBLAS handle for each device
-
72  std::unordered_map<int, cublasHandle_t> blasHandles_;
-
73 
-
74  /// Temporary memory provider, per each device
-
75  std::unordered_map<int, std::unique_ptr<StackDeviceMemory> > memory_;
-
76 
-
77  /// Pinned memory allocation for use with this GPU
-
78  void* pinnedMemAlloc_;
-
79  size_t pinnedMemAllocSize_;
-
80 
-
81  /// By default, we reserve this fraction of memory on all devices
-
82  float tempMemFraction_;
-
83 
-
84  /// Another option is to use a specified amount of memory on all
-
85  /// devices
-
86  size_t tempMemSize_;
+
44 
+
45  /// Called to change the stream for work ordering
+
46  void setDefaultStream(int device, cudaStream_t stream);
+
47 
+
48  /// Called to change the work ordering streams to the null stream
+
49  /// for all devices
+
50  void setDefaultNullStreamAllDevices();
+
51 
+
52  public:
+
53  /// Internal system calls
+
54  void initializeForDevice(int device) override;
+
55 
+
56  cublasHandle_t getBlasHandle(int device) override;
+
57 
+
58  cudaStream_t getDefaultStream(int device) override;
+
59 
+
60  std::vector<cudaStream_t> getAlternateStreams(int device) override;
+
61 
+
62  DeviceMemory& getMemoryManager(int device) override;
+
63 
+
64  std::pair<void*, size_t> getPinnedMemory() override;
+
65 
+
66  cudaStream_t getAsyncCopyStream(int device) override;
+
67 
+
68  private:
+
69  /// Our default stream that work is ordered on, one per each device
+
70  std::unordered_map<int, cudaStream_t> defaultStreams_;
+
71 
+
72  /// This contains particular streams as set by the user for
+
73  /// ordering, if any
+
74  std::unordered_map<int, cudaStream_t> userDefaultStreams_;
+
75 
+
76  /// Other streams we can use, per each device
+
77  std::unordered_map<int, std::vector<cudaStream_t> > alternateStreams_;
+
78 
+
79  /// Async copy stream to use for GPU <-> CPU pinned memory copies
+
80  std::unordered_map<int, cudaStream_t> asyncCopyStreams_;
+
81 
+
82  /// cuBLAS handle for each device
+
83  std::unordered_map<int, cublasHandle_t> blasHandles_;
+
84 
+
85  /// Temporary memory provider, per each device
+
86  std::unordered_map<int, std::unique_ptr<StackDeviceMemory> > memory_;
87 
-
88  /// Whether we look at tempMemFraction_ or tempMemSize_
-
89  bool useFraction_;
-
90 
-
91  /// Amount of pinned memory we should allocate
-
92  size_t pinnedMemSize_;
-
93 };
-
94 
-
95 } } // namespace
- - -
faiss::gpu::StandardGpuResources::initializeForDevice
void initializeForDevice(int device) override
Internal system calls.
Definition: StandardGpuResources.cpp:98
+
88  /// Pinned memory allocation for use with this GPU
+
89  void* pinnedMemAlloc_;
+
90  size_t pinnedMemAllocSize_;
+
91 
+
92  /// By default, we reserve this fraction of memory on all devices
+
93  float tempMemFraction_;
+
94 
+
95  /// Another option is to use a specified amount of memory on all
+
96  /// devices
+
97  size_t tempMemSize_;
+
98 
+
99  /// Whether we look at tempMemFraction_ or tempMemSize_
+
100  bool useFraction_;
+
101 
+
102  /// Amount of pinned memory we should allocate
+
103  size_t pinnedMemSize_;
+
104 };
+
105 
+
106 } } // namespace
+
faiss::gpu::StandardGpuResources::setDefaultStream
void setDefaultStream(int device, cudaStream_t stream)
Called to change the stream for work ordering.
Definition: StandardGpuResources.cpp:103
+
faiss::gpu::StandardGpuResources::getBlasHandle
cublasHandle_t getBlasHandle(int device) override
Returns the cuBLAS handle that we use for the given device.
Definition: StandardGpuResources.cpp:205
+ + +
faiss::gpu::StandardGpuResources::initializeForDevice
void initializeForDevice(int device) override
Internal system calls.
Definition: StandardGpuResources.cpp:122
+
faiss::gpu::StandardGpuResources::getAsyncCopyStream
cudaStream_t getAsyncCopyStream(int device) override
Returns the stream on which we perform async CPU &lt;-&gt; GPU copies.
Definition: StandardGpuResources.cpp:233
+
faiss::gpu::StandardGpuResources::getMemoryManager
DeviceMemory & getMemoryManager(int device) override
Returns the temporary memory manager for the given device.
Definition: StandardGpuResources.cpp:222
- + - + +
faiss::gpu::StandardGpuResources::getDefaultStream
cudaStream_t getDefaultStream(int device) override
Definition: StandardGpuResources.cpp:211
+
faiss::gpu::DeviceMemory
Manages temporary memory allocations on a GPU device.
Definition: DeviceMemory.h:46
+
faiss::gpu::StandardGpuResources::getPinnedMemory
std::pair< void *, size_t > getPinnedMemory() override
Returns the available CPU pinned memory buffer.
Definition: StandardGpuResources.cpp:228
+
faiss::gpu::StandardGpuResources::getAlternateStreams
std::vector< cudaStream_t > getAlternateStreams(int device) override
Returns the set of alternative streams that we use for the given device.
Definition: StandardGpuResources.cpp:217
diff --git a/docs/html/TestGpuIndexFlat_8cpp_source.html b/docs/html/TestGpuIndexFlat_8cpp_source.html index 9ac125943..448bb0902 100644 --- a/docs/html/TestGpuIndexFlat_8cpp_source.html +++ b/docs/html/TestGpuIndexFlat_8cpp_source.html @@ -387,7 +387,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::gpu::GpuIndexFlat::copyTo
void copyTo(faiss::IndexFlat *index) const
Definition: GpuIndexFlat.cu:120
- +
faiss::IndexFlat::reconstruct
void reconstruct(idx_t key, float *recons) const override
Definition: IndexFlat.cpp:118
diff --git a/docs/html/TestGpuIndexIVFFlat_8cpp_source.html b/docs/html/TestGpuIndexIVFFlat_8cpp_source.html index 3d185d7b9..13198ecd7 100644 --- a/docs/html/TestGpuIndexIVFFlat_8cpp_source.html +++ b/docs/html/TestGpuIndexIVFFlat_8cpp_source.html @@ -639,7 +639,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
550  0.1f,
551  0.015f);
552 }
- + diff --git a/docs/html/TestGpuIndexIVFPQ_8cpp_source.html b/docs/html/TestGpuIndexIVFPQ_8cpp_source.html index ba1fff198..d79b4b72f 100644 --- a/docs/html/TestGpuIndexIVFPQ_8cpp_source.html +++ b/docs/html/TestGpuIndexIVFPQ_8cpp_source.html @@ -541,7 +541,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
452  0.015f);
453 }
- +
faiss::gpu::GpuIndexConfig::device
int device
GPU device on which the index is resident.
Definition: GpuIndex.h:27
diff --git a/docs/html/TestUtils_8cpp_source.html b/docs/html/TestUtils_8cpp_source.html index 7be6e68b2..c0c6014c6 100644 --- a/docs/html/TestUtils_8cpp_source.html +++ b/docs/html/TestUtils_8cpp_source.html @@ -184,7 +184,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
95 }
96 
97 template <typename T>
-
98 inline T lookup(const T* p, int i, int j, int dim1, int dim2) {
+
98 inline T lookup(const T* p, int i, int j, int /*dim1*/, int dim2) {
99  return p[i * dim2 + j];
100 }
101 
diff --git a/docs/html/VectorTransform_8cpp_source.html b/docs/html/VectorTransform_8cpp_source.html index 5e7c00fd6..ee29e2917 100644 --- a/docs/html/VectorTransform_8cpp_source.html +++ b/docs/html/VectorTransform_8cpp_source.html @@ -875,7 +875,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
790 void IndexPreTransform::train (idx_t n, const float *x)
791 {
792  int last_untrained = 0;
-
793  if (index->is_trained) {
+
793  if (!index->is_trained) {
794  last_untrained = chain.size();
795  } else {
796  for (int i = chain.size() - 1; i >= 0; i--) {
@@ -894,7 +894,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
809  if (!ltrans->is_trained)
810  ltrans->train(n, prev_x);
811  } else {
-
812  index->train (n, prev_x);
+
812  index->train (n, prev_x);
813  }
814  if (i == last_untrained) break;
815 
@@ -1061,11 +1061,12 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::OPQMatrix::niter_pq
int niter_pq
Number of training iterations for the PQ.
Definition: VectorTransform.h:184
faiss::LinearTransform::A
std::vector< float > A
! whether to use the bias term
Definition: VectorTransform.h:82
faiss::fvecs_maybe_subsample
const float * fvecs_maybe_subsample(size_t d, size_t *n, size_t nmax, const float *x, bool verbose, long seed)
Definition: utils.cpp:1941
+
faiss::Index::train
virtual void train(idx_t, const float *)
Definition: Index.h:89
faiss::LinearTransform::LinearTransform
LinearTransform(int d_in=0, int d_out=0, bool have_bias=false)
both d_in &gt; d_out and d_out &lt; d_in are supported
Definition: VectorTransform.cpp:99
-
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:31
+
faiss::Index::add_with_ids
virtual void add_with_ids(idx_t n, const float *x, const long *xids)
Definition: Index.cpp:30
faiss::PCAMatrix::train
void train(Index::idx_t n, const float *x) override
Definition: VectorTransform.cpp:271
faiss::PCAMatrix::mean
std::vector< float > mean
Mean, size d_in.
Definition: VectorTransform.h:144
@@ -1076,7 +1077,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::ProductQuantizer::compute_codes
void compute_codes(const float *x, uint8_t *codes, size_t n) const
same as compute_code for several vectors
Definition: ProductQuantizer.cpp:385
faiss::Index::d
int d
vector dimension
Definition: Index.h:64
faiss::LinearTransform::b
std::vector< float > b
bias vector, size d_out
Definition: VectorTransform.h:85
-
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:50
+
faiss::Index::reconstruct_n
virtual void reconstruct_n(idx_t i0, idx_t ni, float *recons) const
Definition: Index.cpp:49
faiss::Index::add
virtual void add(idx_t n, const float *x)=0
faiss::OPQMatrix::train
void train(Index::idx_t n, const float *x) override
Definition: VectorTransform.cpp:547
@@ -1114,7 +1115,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
faiss::Index::is_trained
bool is_trained
set if the Index does not require training, or if training is done already
Definition: Index.h:69
faiss::PCAMatrix::eigenvalues
std::vector< float > eigenvalues
eigenvalues of covariance matrix (= squared singular values)
Definition: VectorTransform.h:147
faiss::IndexPreTransform::search
void search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
Definition: VectorTransform.cpp:863
-
faiss::Index::train
virtual void train(idx_t n, const float *x)
Definition: Index.h:89
faiss::IndexPreTransform::add_with_ids
void add_with_ids(idx_t n, const float *x, const long *xids) override
Definition: VectorTransform.cpp:850
faiss::PCAMatrix::random_rotation
bool random_rotation
random rotation after PCA
Definition: VectorTransform.h:135
faiss::PCAMatrix::max_points_per_d
size_t max_points_per_d
ratio between # training vectors and dimension
Definition: VectorTransform.h:138
diff --git a/docs/html/annotated.html b/docs/html/annotated.html index ef3b71c9f..1619a1659 100644 --- a/docs/html/annotated.html +++ b/docs/html/annotated.html @@ -234,70 +234,71 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); |oCHammingComputer20 |oCHammingComputer32 |oCHammingComputer64 -|oCHammingComputerM8 -|oCHammingComputerM4 -|oCHammingComputer -|oCGenHammingComputer8 -|oCGenHammingComputer16 -|oCGenHammingComputer32 -|oCGenHammingComputerM8 -|oCCMax -|oCCMin -|oCHeapArray -|oCIndex -|oCScopeFileCloser -|oCCloner -|oCIndexFlat -|oCIndexFlatIP -|oCIndexFlatL2 -|oCIndexFlatL2BaseShift -|oCIndexRefineFlat -|oCIndexFlat1DOptimized version for 1D "vectors" -|oCIndexIVF -|oCIndexIVFFlatStats -|oCIndexIVFFlat -|oCIndexIVFFlatIPBounds -|oCCodeCmp -|oCIndexIVFPQ -|oCIndexIVFPQStats -|oCIndexIVFPQR -|oCIndexIVFPQCompact -|oCScalarQuantizer -|oCIndexIVFScalarQuantizer -|oCIndexLSH -|oCArgSort -|oCSortedArray -|oCSemiSortedArray -|oCMinSumK -|oCIndexPQ -|oCIndexPQStats -|oCMultiIndexQuantizer +|oCHammingComputerDefault +|oCHammingComputerM8 +|oCHammingComputerM4 +|oCHammingComputer +|oCGenHammingComputer8 +|oCGenHammingComputer16 +|oCGenHammingComputer32 +|oCGenHammingComputerM8 +|oCCMax +|oCCMin +|oCHeapArray +|oCIndex +|oCScopeFileCloser +|oCCloner +|oCIndexFlat +|oCIndexFlatIP +|oCIndexFlatL2 +|oCIndexFlatL2BaseShift +|oCIndexRefineFlat +|oCIndexFlat1DOptimized version for 1D "vectors" +|oCIndexIVF +|oCIndexIVFFlatStats +|oCIndexIVFFlat +|oCIndexIVFFlatIPBounds +|oCCodeCmp +|oCIndexIVFPQ +|oCIndexIVFPQStats +|oCIndexIVFPQR +|oCIndexIVFPQCompact +|oCIndexLSH +|oCArgSort +|oCSortedArray +|oCSemiSortedArray +|oCMinSumK +|oCIndexPQ +|oCIndexPQStats +|oCMultiIndexQuantizer +|oCScalarQuantizer |oCIndexScalarQuantizer -|oCIndexIDMap -|oCIndexIDMap2 -|oCIndexShards -|oCIndexSplitVectors -|oCScore3Computer -|oCIndirectSort -|oCRankingScore2 -|oCSimulatedAnnealingParametersParameters used for the simulated annealing method -|oCPermutationObjectiveAbstract class for the loss function -|oCReproduceDistancesObjective -|oCSimulatedAnnealingOptimizerSimulated annealing optimization algorithm for permutations -|oCPolysemousTrainingOptimizes the order of indices in a ProductQuantizer -|oCProductQuantizer -|oCNopDistanceCorrection -|oCBaseShiftDistanceCorrection -|oCRandomGeneratorRandom generator that can be used in multithreaded contexts -|oCVectorTransform -|oCLinearTransform -|oCRandomRotationMatrixRandomly rotate a set of vectors -|oCPCAMatrix -|oCOPQMatrix -|oCRemapDimensionsTransform -|oCNormalizationTransform -|\CIndexPreTransform -\COptions +|oCIndexIVFScalarQuantizer +|oCIndexIDMap +|oCIndexIDMap2 +|oCIndexShards +|oCIndexSplitVectors +|oCScore3Computer +|oCIndirectSort +|oCRankingScore2 +|oCSimulatedAnnealingParametersParameters used for the simulated annealing method +|oCPermutationObjectiveAbstract class for the loss function +|oCReproduceDistancesObjective +|oCSimulatedAnnealingOptimizerSimulated annealing optimization algorithm for permutations +|oCPolysemousTrainingOptimizes the order of indices in a ProductQuantizer +|oCProductQuantizer +|oCNopDistanceCorrection +|oCBaseShiftDistanceCorrection +|oCRandomGeneratorRandom generator that can be used in multithreaded contexts +|oCVectorTransform +|oCLinearTransform +|oCRandomRotationMatrixRandomly rotate a set of vectors +|oCPCAMatrix +|oCOPQMatrix +|oCRemapDimensionsTransform +|oCNormalizationTransform +|\CIndexPreTransform +\COptions diff --git a/docs/html/classes.html b/docs/html/classes.html index d28bf005b..66292cd5b 100644 --- a/docs/html/classes.html +++ b/docs/html/classes.html @@ -89,77 +89,77 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
A | B | C | D | F | G | H | I | K | L | M | N | O | P | Q | R | S | T | V | W
- - - + + + + - + + - - + + - - - - - - - - - - - - + + + + + + + + + + + + - - - - - + + + + + - - + + - - - - - - + + + + + + - + + - - - - + + - - - - - - - + + + + + + + - - + + +
  A  
-		FinalBlockMerge (faiss::gpu)   IndexFlatIP (faiss)   LoadCode32< 2 > (faiss::gpu)   RandomRotationMatrix (faiss)   
FinalBlockMerge< 1, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexFlatL2 (faiss)   LoadCode32< 20 > (faiss::gpu)   StackDeviceMemory::Range (faiss::gpu)   
ArgSort (faiss)   FinalBlockMerge< 2, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexFlatL2BaseShift (faiss)   LoadCode32< 24 > (faiss::gpu)   RangeSearchPartialResult (faiss)   
AutoTuneCriterion (faiss)   FinalBlockMerge< 4, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexIDMap (faiss)   LoadCode32< 28 > (faiss::gpu)   RangeSearchResult (faiss)   
FinalBlockMerge (faiss::gpu)   IndexFlat1D (faiss)   LoadCode32< 16 > (faiss::gpu)   RandomRotationMatrix (faiss)   
FinalBlockMerge< 1, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexFlatIP (faiss)   LoadCode32< 2 > (faiss::gpu)   StackDeviceMemory::Range (faiss::gpu)   
ArgSort (faiss)   FinalBlockMerge< 2, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexFlatL2 (faiss)   LoadCode32< 20 > (faiss::gpu)   RangeSearchPartialResult (faiss)   
AutoTuneCriterion (faiss)   FinalBlockMerge< 4, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexFlatL2BaseShift (faiss)   LoadCode32< 24 > (faiss::gpu)   RangeSearchResult (faiss)   
  B  
-		FinalBlockMerge< 8, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexIDMap2 (faiss)   LoadCode32< 3 > (faiss::gpu)   RankingScore2 (faiss)   
FlatIndex (faiss::gpu)   IndexIVF (faiss)   LoadCode32< 32 > (faiss::gpu)   RemapDimensionsTransform (faiss)   
FinalBlockMerge< 8, NumThreads, K, V, NumWarpQ, Dir, Comp > (faiss::gpu)   IndexIDMap (faiss)   LoadCode32< 28 > (faiss::gpu)   RankingScore2 (faiss)   
FlatIndex (faiss::gpu)   IndexIDMap2 (faiss)   LoadCode32< 3 > (faiss::gpu)   RemapDimensionsTransform (faiss)   
BaseShiftDistanceCorrection (faiss)   
  G  
-		IndexIVFFlat (faiss)   LoadCode32< 4 > (faiss::gpu)   ReproduceDistancesObjective (faiss)   
BitonicMergeStep (faiss::gpu)   IndexIVFFlatIPBounds (faiss)   LoadCode32< 40 > (faiss::gpu)   RestrictPtrTraits (faiss::gpu::traits)   
BitonicMergeStep< K, V, 1, Dir, Comp, Low, true > (faiss::gpu)   GenHammingComputer16 (faiss)   IndexIVFFlatStats (faiss)   LoadCode32< 48 > (faiss::gpu)   
  S  
+		IndexIVF (faiss)   LoadCode32< 32 > (faiss::gpu)   ReproduceDistancesObjective (faiss)   
BitonicMergeStep (faiss::gpu)   IndexIVFFlat (faiss)   LoadCode32< 4 > (faiss::gpu)   RestrictPtrTraits (faiss::gpu::traits)   
BitonicMergeStep< K, V, 1, Dir, Comp, Low, true > (faiss::gpu)   GenHammingComputer16 (faiss)   IndexIVFFlatIPBounds (faiss)   LoadCode32< 40 > (faiss::gpu)   
  S  
BitonicMergeStep< K, V, N, Dir, Comp, false, false > (faiss::gpu)   GenHammingComputer32 (faiss)   IndexIVFPQ (faiss)   LoadCode32< 56 > (faiss::gpu)   
BitonicMergeStep< K, V, N, Dir, Comp, Low, true > (faiss::gpu)   GenHammingComputer8 (faiss)   IndexIVFPQCompact (faiss)   LoadCode32< 64 > (faiss::gpu)   ScalarQuantizer (faiss)   
BitonicMergeStep< K, V, N, Dir, Comp, true, false > (faiss::gpu)   GenHammingComputerM8 (faiss)   IndexIVFPQR (faiss)   LoadCode32< 8 > (faiss::gpu)   ScopeDeleter (faiss)   
BitonicSortStep (faiss::gpu)   GpuClonerOptions (faiss::gpu)   IndexIVFPQStats (faiss)   LoadCode32< 96 > (faiss::gpu)   ScopeDeleter1 (faiss)   
BitonicSortStep< K, V, 1, Dir, Comp > (faiss::gpu)   GpuIndex (faiss::gpu)   IndexIVFScalarQuantizer (faiss)   LoadCodeDistances (faiss::gpu)   ScopeFileCloser (faiss)   
BlockMerge (faiss::gpu)   GpuIndexConfig (faiss::gpu)   IndexLSH (faiss)   LoadStore (faiss::gpu)   Score3Computer (faiss)   
BlockMerge< NumThreads, K, V, N, L, Dir, Comp, false, FullMerge > (faiss::gpu)   GpuIndexFlat (faiss::gpu)   IndexPQ (faiss)   
  M  
-		SegmentedReduce (faiss::gpu)   
BlockMerge< NumThreads, K, V, N, L, Dir, Comp, true, FullMerge > (faiss::gpu)   GpuIndexFlatConfig (faiss::gpu)   IndexPQStats (faiss)   SemiSortedArray (faiss)   
BlockSelect (faiss::gpu)   GpuIndexFlatIP (faiss::gpu)   IndexPreTransform (faiss)   Math (faiss::gpu)   SimulatedAnnealingOptimizer (faiss)   
BlockSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock > (faiss::gpu)   GpuIndexFlatL2 (faiss::gpu)   IndexProxy (faiss::gpu)   Math< float2 > (faiss::gpu)   SimulatedAnnealingParameters (faiss)   
BufferList::Buffer (faiss)   GpuIndexIVF (faiss::gpu)   IndexRefineFlat (faiss)   Math< float4 > (faiss::gpu)   SortedArray (faiss)   
BufferList (faiss)   GpuIndexIVFConfig (faiss::gpu)   IndexScalarQuantizer (faiss)   Max (faiss::gpu)   StackDeviceMemory::Stack (faiss::gpu)   
BitonicMergeStep< K, V, N, Dir, Comp, false, false > (faiss::gpu)   GenHammingComputer32 (faiss)   IndexIVFFlatStats (faiss)   LoadCode32< 48 > (faiss::gpu)   
BitonicMergeStep< K, V, N, Dir, Comp, Low, true > (faiss::gpu)   GenHammingComputer8 (faiss)   IndexIVFPQ (faiss)   LoadCode32< 56 > (faiss::gpu)   ScalarQuantizer (faiss)   
BitonicMergeStep< K, V, N, Dir, Comp, true, false > (faiss::gpu)   GenHammingComputerM8 (faiss)   IndexIVFPQCompact (faiss)   LoadCode32< 64 > (faiss::gpu)   ScopeDeleter (faiss)   
BitonicSortStep (faiss::gpu)   GpuClonerOptions (faiss::gpu)   IndexIVFPQR (faiss)   LoadCode32< 8 > (faiss::gpu)   ScopeDeleter1 (faiss)   
BitonicSortStep< K, V, 1, Dir, Comp > (faiss::gpu)   GpuIndex (faiss::gpu)   IndexIVFPQStats (faiss)   LoadCode32< 96 > (faiss::gpu)   ScopeFileCloser (faiss)   
BlockMerge (faiss::gpu)   GpuIndexConfig (faiss::gpu)   IndexIVFScalarQuantizer (faiss)   LoadCodeDistances (faiss::gpu)   Score3Computer (faiss)   
BlockMerge< NumThreads, K, V, N, L, Dir, Comp, false, FullMerge > (faiss::gpu)   GpuIndexFlat (faiss::gpu)   IndexLSH (faiss)   LoadStore (faiss::gpu)   SegmentedReduce (faiss::gpu)   
BlockMerge< NumThreads, K, V, N, L, Dir, Comp, true, FullMerge > (faiss::gpu)   GpuIndexFlatConfig (faiss::gpu)   IndexPQ (faiss)   
  M  
+		SemiSortedArray (faiss)   
BlockSelect (faiss::gpu)   GpuIndexFlatIP (faiss::gpu)   IndexPQStats (faiss)   SimulatedAnnealingOptimizer (faiss)   
BlockSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock > (faiss::gpu)   GpuIndexFlatL2 (faiss::gpu)   IndexPreTransform (faiss)   Math (faiss::gpu)   SimulatedAnnealingParameters (faiss)   
BufferList::Buffer (faiss)   GpuIndexIVF (faiss::gpu)   IndexProxy (faiss::gpu)   Math< float2 > (faiss::gpu)   SortedArray (faiss)   
BufferList (faiss)   GpuIndexIVFConfig (faiss::gpu)   IndexRefineFlat (faiss)   Math< float4 > (faiss::gpu)   StackDeviceMemory::Stack (faiss::gpu)   
  C  
-		GpuIndexIVFFlat (faiss::gpu)   IndexShards (faiss)   Min (faiss::gpu)   StackDeviceMemory (faiss::gpu)   
GpuIndexIVFFlatConfig (faiss::gpu)   IndexSplitVectors (faiss)   MinSumK (faiss)   StandardGpuResources (faiss::gpu)   
Cloner (faiss)   GpuIndexIVFPQ (faiss::gpu)   IndexWrapper (faiss::gpu)   MultiIndexQuantizer (faiss)   SubTensor (faiss::gpu::detail)   
Clustering (faiss)   GpuIndexIVFPQConfig (faiss::gpu)   IndirectSort (faiss)   
  N  
-		SubTensor< TensorType, 0, PtrTraits > (faiss::gpu::detail)   
ClusteringParameters (faiss)   GpuMultipleClonerOptions (faiss::gpu)   IntersectionCriterion (faiss)   Sum (faiss::gpu)   
CMax (faiss)   GpuParameterSpace (faiss::gpu)   IntToLong (faiss::gpu)   NopDistanceCorrection (faiss)   
  T  
+		GpuIndexIVFFlat (faiss::gpu)   IndexScalarQuantizer (faiss)   Max (faiss::gpu)   StackDeviceMemory (faiss::gpu)   
GpuIndexIVFFlatConfig (faiss::gpu)   IndexShards (faiss)   Min (faiss::gpu)   StandardGpuResources (faiss::gpu)   
Cloner (faiss)   GpuIndexIVFPQ (faiss::gpu)   IndexSplitVectors (faiss)   MinSumK (faiss)   SubTensor (faiss::gpu::detail)   
Clustering (faiss)   GpuIndexIVFPQConfig (faiss::gpu)   IndexWrapper (faiss::gpu)   MultiIndexQuantizer (faiss)   SubTensor< TensorType, 0, PtrTraits > (faiss::gpu::detail)   
ClusteringParameters (faiss)   GpuMultipleClonerOptions (faiss::gpu)   IndirectSort (faiss)   
  N  
+		Sum (faiss::gpu)   
CMax (faiss)   GpuParameterSpace (faiss::gpu)   IntersectionCriterion (faiss)   
  T  
CMin (faiss)   GpuResources (faiss::gpu)   IVFBase (faiss::gpu)   NormalizationTransform (faiss)   
CodeCmp (faiss)   GpuResourcesThrustAllocator (faiss::gpu)   IVFFlat (faiss::gpu)   NoTypeTensor (faiss::gpu)   Tensor (faiss::gpu)   
CMin (faiss)   GpuResources (faiss::gpu)   IntToLong (faiss::gpu)   NopDistanceCorrection (faiss)   
CodeCmp (faiss)   GpuResourcesThrustAllocator (faiss::gpu)   IVFBase (faiss::gpu)   NormalizationTransform (faiss)   Tensor (faiss::gpu)   
Comparator (faiss::gpu)   
  H  
-		IVFFlatScan (faiss::gpu)   
  O  
-		TensorInfo (faiss::gpu)   
Converter (faiss::gpu)   IVFFlatScan< 0, L2, T > (faiss::gpu)   TensorInfoOffset (faiss::gpu)   
Converter< float > (faiss::gpu)   HammingComputer (faiss)   IVFFlatScan< 128, L2, float > (faiss::gpu)   OneRecallAtRCriterion (faiss)   TensorInfoOffset< T,-1 > (faiss::gpu)   
ConvertTo (faiss::gpu)   HammingComputer16 (faiss)   IVFFlatScan< 256, L2, float > (faiss::gpu)   OperatingPoint (faiss)   ToCPUCloner (faiss::gpu)   
ConvertTo< float > (faiss::gpu)   HammingComputer20 (faiss)   IVFFlatScan< 64, L2, float > (faiss::gpu)   OperatingPoints (faiss)   ToGpuCloner (faiss::gpu)   
ConvertTo< float2 > (faiss::gpu)   HammingComputer32 (faiss)   IVFFlatScan<-1, L2, T > (faiss::gpu)   OPQMatrix (faiss)   ToGpuClonerMultiple (faiss::gpu)   
ConvertTo< float4 > (faiss::gpu)   HammingComputer4 (faiss)   IVFPQ (faiss::gpu)   Options   
  V  
+		IVFFlat (faiss::gpu)   NoTypeTensor (faiss::gpu)   TensorInfo (faiss::gpu)   
Converter (faiss::gpu)   IVFFlatScan (faiss::gpu)   
  O  
+		TensorInfoOffset (faiss::gpu)   
Converter< float > (faiss::gpu)   HammingComputer (faiss)   IVFFlatScan< 0, L2, T > (faiss::gpu)   TensorInfoOffset< T,-1 > (faiss::gpu)   
ConvertTo (faiss::gpu)   HammingComputer16 (faiss)   IVFFlatScan< 128, L2, float > (faiss::gpu)   OneRecallAtRCriterion (faiss)   ToCPUCloner (faiss::gpu)   
ConvertTo< float > (faiss::gpu)   HammingComputer20 (faiss)   IVFFlatScan< 256, L2, float > (faiss::gpu)   OperatingPoint (faiss)   ToGpuCloner (faiss::gpu)   
ConvertTo< float2 > (faiss::gpu)   HammingComputer32 (faiss)   IVFFlatScan< 64, L2, float > (faiss::gpu)   OperatingPoints (faiss)   ToGpuClonerMultiple (faiss::gpu)   
ConvertTo< float4 > (faiss::gpu)   HammingComputer4 (faiss)   IVFFlatScan<-1, L2, T > (faiss::gpu)   OPQMatrix (faiss)   
  V  
CpuTimer (faiss::gpu)   HammingComputer64 (faiss)   
  K  
+
CpuTimer (faiss::gpu)   HammingComputer64 (faiss)   IVFPQ (faiss::gpu)   Options   
CublasGemm (faiss::gpu)   HammingComputer8 (faiss)   
  K  
  P  
+		VectorTransform (faiss)   
CublasGemm< float > (faiss::gpu)   HammingComputerDefault (faiss)   
  W  
CublasGemm (faiss::gpu)   HammingComputer8 (faiss)   VectorTransform (faiss)   
CublasGemm< float > (faiss::gpu)   HammingComputerM4 (faiss)   KernelTimer (faiss::gpu)   Pair (faiss::gpu)   
  W  
-
CublasHandleScope (faiss::gpu)   HammingComputerM8 (faiss)   
  L  
-		ParameterRange (faiss)   
CudaEvent (faiss::gpu)   HeapArray (faiss)   ParameterSpace (faiss)   WarpSelect (faiss::gpu)   
CublasHandleScope (faiss::gpu)   HammingComputerM4 (faiss)   KernelTimer (faiss::gpu)   Pair (faiss::gpu)   
CudaEvent (faiss::gpu)   HammingComputerM8 (faiss)   
  L  
+		ParameterRange (faiss)   WarpSelect (faiss::gpu)   
  D  
-		HostTensor (faiss::gpu)   Limits (faiss::gpu)   PCAMatrix (faiss)   WarpSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock > (faiss::gpu)   
  I  
-		Limits< float > (faiss::gpu)   PermutationObjective (faiss)   WorkerThread (faiss::gpu)   
DefaultPtrTraits (faiss::gpu::traits)   Limits< int > (faiss::gpu)   PolysemousTraining (faiss)   
DeviceMemory (faiss::gpu)   IDSelector (faiss)   Limits< Pair< K, V > > (faiss::gpu)   ProductQuantizer (faiss)   
DeviceMemoryReservation (faiss::gpu)   IDSelectorBatch (faiss)   LinearTransform (faiss)   
  Q  
-
DeviceScope (faiss::gpu)   IDSelectorRange (faiss)   LoadCode32 (faiss::gpu)   
DeviceTensor (faiss::gpu)   Index (faiss)   LoadCode32< 1 > (faiss::gpu)   RangeSearchPartialResult::QueryResult (faiss)   
DeviceVector (faiss::gpu)   IndexFlat (faiss)   LoadCode32< 12 > (faiss::gpu)   
  R  
+		HeapArray (faiss)   ParameterSpace (faiss)   WarpSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock > (faiss::gpu)   
HostTensor (faiss::gpu)   Limits (faiss::gpu)   PCAMatrix (faiss)   WorkerThread (faiss::gpu)   
DefaultPtrTraits (faiss::gpu::traits)   
  I  
+		Limits< float > (faiss::gpu)   PermutationObjective (faiss)   
DeviceMemory (faiss::gpu)   Limits< int > (faiss::gpu)   PolysemousTraining (faiss)   
DeviceMemoryReservation (faiss::gpu)   IDSelector (faiss)   Limits< Pair< K, V > > (faiss::gpu)   ProductQuantizer (faiss)   
DeviceScope (faiss::gpu)   IDSelectorBatch (faiss)   LinearTransform (faiss)   
  Q  
DeviceTensor (faiss::gpu)   IDSelectorRange (faiss)   LoadCode32 (faiss::gpu)   
DeviceVector (faiss::gpu)   Index (faiss)   LoadCode32< 1 > (faiss::gpu)   RangeSearchPartialResult::QueryResult (faiss)   
  F  
-		IndexFlat1D (faiss)   LoadCode32< 16 > (faiss::gpu)   
RandomGenerator (faiss)   
FaissException (faiss)   
IndexFlat (faiss)   LoadCode32< 12 > (faiss::gpu)   
  R  
+
FaissException (faiss)   RandomGenerator (faiss)   
A | B | C | D | F | G | H | I | K | L | M | N | O | P | Q | R | S | T | V | W
diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndex-members.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndex-members.html index 93d791854..cd5797477 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndex-members.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndex-members.html @@ -119,7 +119,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); resources_faiss::gpu::GpuIndexprotected search(faiss::Index::idx_t n, const float *x, faiss::Index::idx_t k, float *distances, faiss::Index::idx_t *labels) const overridefaiss::gpu::GpuIndexvirtual searchImpl_(faiss::Index::idx_t n, const float *x, faiss::Index::idx_t k, float *distances, faiss::Index::idx_t *labels) const =0faiss::gpu::GpuIndexprotectedpure virtual - train(idx_t n, const float *x)faiss::Indexinlinevirtual + train(idx_t, const float *)faiss::Indexinlinevirtual verbosefaiss::Index ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndex.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndex.html index 3b9edeadd..9bc8c5580 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndex.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndex.html @@ -132,8 +132,8 @@ int getDevice () const  Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)   -virtual void train (idx_t n, const float *x) -  +virtual void train (idx_t, const float *) +  virtual void range_search (idx_t n, const float *x, float radius, RangeSearchResult *result) const   void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1) diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF-members.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF-members.html index 995c6740f..30b04a97a 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF-members.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF-members.html @@ -131,7 +131,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); search(faiss::Index::idx_t n, const float *x, faiss::Index::idx_t k, float *distances, faiss::Index::idx_t *labels) const overridefaiss::gpu::GpuIndexvirtual searchImpl_(faiss::Index::idx_t n, const float *x, faiss::Index::idx_t k, float *distances, faiss::Index::idx_t *labels) const =0faiss::gpu::GpuIndexprotectedpure virtual setNumProbes(int nprobe)faiss::gpu::GpuIndexIVF - train(idx_t n, const float *x)faiss::Indexinlinevirtual + train(idx_t, const float *)faiss::Indexinlinevirtual trainQuantizer_(faiss::Index::idx_t n, const float *x) (defined in faiss::gpu::GpuIndexIVF)faiss::gpu::GpuIndexIVFprotected verbosefaiss::Index ~GpuIndexIVF() override (defined in faiss::gpu::GpuIndexIVF)faiss::gpu::GpuIndexIVF diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF.html index b1029136d..cdfd3bf6d 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVF.html @@ -157,8 +157,8 @@ int getDevice () const  Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)   -virtual void train (idx_t n, const float *x) -  +virtual void train (idx_t, const float *) +  virtual void range_search (idx_t n, const float *x, float radius, RangeSearchResult *result) const   void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1) diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html index 050ea2636..ac5a867d8 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html @@ -428,13 +428,13 @@ const MemorySpace void faiss::gpu::GpuIndexIVFFlat::train ( Index::idx_t  - n, + , const float *  - x  +   @@ -457,7 +457,7 @@ const MemorySpace faiss::Index.

+

Reimplemented from faiss::Index.

Definition at line 173 of file GpuIndexIVFFlat.cu.

diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html index 1778a25a2..ac0169267 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html @@ -495,13 +495,13 @@ const MemorySpace void faiss::gpu::GpuIndexIVFPQ::train ( Index::idx_t  - n, + , const float *  - x  +   @@ -524,7 +524,7 @@ const MemorySpace faiss::Index.

+

Reimplemented from faiss::Index.

Definition at line 301 of file GpuIndexIVFPQ.cu.

diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuResources-members.html b/docs/html/classfaiss_1_1gpu_1_1GpuResources-members.html index 12975642a..c0918053f 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuResources-members.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuResources-members.html @@ -93,18 +93,20 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

This is the complete list of members for faiss::gpu::GpuResources, including all inherited members.

- - - - - - - - - - - + + + + + + + + + + + + +
getAlternateStreams(int device)=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getAlternateStreamsCurrentDevice() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResources
getAsyncCopyStream(int device)=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getAsyncCopyStreamCurrentDevice() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResources
getBlasHandle(int device)=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getBlasHandleCurrentDevice() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResources
getDefaultStream(int device)=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getDefaultStreamCurrentDevice() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResources
getMemoryManager(int device)=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getMemoryManagerCurrentDevice() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResources
getPinnedMemory()=0 (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcespure virtual
getAlternateStreams(int device)=0faiss::gpu::GpuResourcespure virtual
getAlternateStreamsCurrentDevice()faiss::gpu::GpuResources
getAsyncCopyStream(int device)=0faiss::gpu::GpuResourcespure virtual
getAsyncCopyStreamCurrentDevice()faiss::gpu::GpuResources
getBlasHandle(int device)=0faiss::gpu::GpuResourcespure virtual
getBlasHandleCurrentDevice()faiss::gpu::GpuResources
getDefaultStream(int device)=0faiss::gpu::GpuResourcespure virtual
getDefaultStreamCurrentDevice()faiss::gpu::GpuResources
getMemoryManager(int device)=0faiss::gpu::GpuResourcespure virtual
getMemoryManagerCurrentDevice()faiss::gpu::GpuResources
getPinnedMemory()=0faiss::gpu::GpuResourcespure virtual
initializeForDevice(int device)=0faiss::gpu::GpuResourcespure virtual
syncDefaultStream(int device)faiss::gpu::GpuResources
syncDefaultStreamCurrentDevice()faiss::gpu::GpuResources
~GpuResources() (defined in faiss::gpu::GpuResources)faiss::gpu::GpuResourcesvirtual
diff --git a/docs/html/classfaiss_1_1gpu_1_1GpuResources.html b/docs/html/classfaiss_1_1gpu_1_1GpuResources.html index 4673c9265..085d5dee0 100644 --- a/docs/html/classfaiss_1_1gpu_1_1GpuResources.html +++ b/docs/html/classfaiss_1_1gpu_1_1GpuResources.html @@ -110,37 +110,52 @@ Public Member Functions virtual void initializeForDevice (int device)=0   -virtual cublasHandle_t getBlasHandle (int device)=0 +virtual cublasHandle_t getBlasHandle (int device)=0 + Returns the cuBLAS handle that we use for the given device.
  - -virtual cudaStream_t getDefaultStream (int device)=0 +virtual cudaStream_t getDefaultStream (int device)=0   -virtual std::vector< cudaStream_t > getAlternateStreams (int device)=0 +virtual std::vector< cudaStream_t > getAlternateStreams (int device)=0 + Returns the set of alternative streams that we use for the given device.
  -virtual DeviceMemory & getMemoryManager (int device)=0 +virtual DeviceMemory & getMemoryManager (int device)=0 + Returns the temporary memory manager for the given device.
  -virtual std::pair< void *, size_t > getPinnedMemory ()=0 +virtual std::pair< void *, size_t > getPinnedMemory ()=0 + Returns the available CPU pinned memory buffer.
  -virtual cudaStream_t getAsyncCopyStream (int device)=0 +virtual cudaStream_t getAsyncCopyStream (int device)=0 + Returns the stream on which we perform async CPU <-> GPU copies.
  -cublasHandle_t getBlasHandleCurrentDevice () +cublasHandle_t getBlasHandleCurrentDevice () + Calls getBlasHandle with the current device.
  -cudaStream_t getDefaultStreamCurrentDevice () +cudaStream_t getDefaultStreamCurrentDevice () + Calls getDefaultStream with the current device.
  +void syncDefaultStream (int device) +  + +void syncDefaultStreamCurrentDevice () + Calls syncDefaultStream for the current device.
+  -std::vector< cudaStream_t > getAlternateStreamsCurrentDevice () +std::vector< cudaStream_t > getAlternateStreamsCurrentDevice () + Calls getAlternateStreams for the current device.
  -DeviceMemory & getMemoryManagerCurrentDevice () +DeviceMemory & getMemoryManagerCurrentDevice () + Calls getMemoryManager for the current device.
  -cudaStream_t getAsyncCopyStreamCurrentDevice () +cudaStream_t getAsyncCopyStreamCurrentDevice () + Calls getAsyncCopyStream for the current device.
 

Detailed Description

@@ -148,6 +163,33 @@ cudaStream_t getAsyncCopyS

Definition at line 23 of file GpuResources.h.

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
virtual cudaStream_t faiss::gpu::GpuResources::getDefaultStream (int device)
+ 		+pure virtual
+
+

Returns the stream that we order all computation on for the given device

+ +

Implemented in faiss::gpu::StandardGpuResources.

+ +
+
@@ -173,6 +215,25 @@ cudaStream_t getAsyncCopyS

Implemented in faiss::gpu::StandardGpuResources.

+
+
+ +
+
+ + + + + + + + +
void faiss::gpu::GpuResources::syncDefaultStream (int device)
+
+

Synchronizes the CPU with respect to the default stream for the given device

+ +

Definition at line 45 of file GpuResources.cpp.

+
The documentation for this class was generated from the following files: diff --git a/docs/html/functions_func_0x74.html b/docs/html/functions_func_0x74.html index b9972606c..23e451c70 100644 --- a/docs/html/functions_func_0x74.html +++ b/docs/html/functions_func_0x74.html @@ -135,33 +135,32 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); , faiss::gpu::DeviceMemory
  • train() -: faiss::IndexRefineFlat -, faiss::IndexPreTransform -, faiss::IndexIVF +: faiss::IndexPreTransform +, faiss::IndexRefineFlat , faiss::PCAMatrix , faiss::VectorTransform +, faiss::IndexIVF , faiss::IndexIVFPQCompact -, faiss::IndexLSH , faiss::IndexIDMap , faiss::IndexScalarQuantizer +, faiss::MultiIndexQuantizer +, faiss::IndexLSH , faiss::Clustering , faiss::IndexPQ -, faiss::MultiIndexQuantizer , faiss::gpu::GpuIndexFlat , faiss::gpu::GpuIndexIVFFlat -, faiss::IndexShards -, faiss::Index +, faiss::Index , faiss::OPQMatrix -, faiss::IndexSplitVectors , faiss::gpu::GpuIndexIVFPQ +, faiss::IndexShards +, faiss::IndexSplitVectors , faiss::gpu::IndexProxy
  • train_residual() -: faiss::IndexIVFPQ -, faiss::IndexIVFScalarQuantizer +: faiss::IndexIVF +, faiss::IndexIVFPQ , faiss::IndexIVFPQR , faiss::IndexIVFScalarQuantizer -, faiss::IndexIVF
  • train_residual_o() : faiss::IndexIVFPQ diff --git a/docs/html/functions_vars.html b/docs/html/functions_vars.html index 37c95a091..05a04d266 100644 --- a/docs/html/functions_vars.html +++ b/docs/html/functions_vars.html @@ -177,10 +177,10 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); , faiss::ProductQuantizer
  • codes -: faiss::IndexLSH -, faiss::IndexPQ +: faiss::IndexPQ , faiss::IndexScalarQuantizer -, faiss::IndexIVFScalarQuantizer +, faiss::IndexIVFScalarQuantizer +, faiss::IndexLSH
  • compact_codes : faiss::IndexIVFPQCompact @@ -644,7 +644,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : faiss::IndexLSH
  • trained -: faiss::ScalarQuantizer +: faiss::ScalarQuantizer
    • diff --git a/docs/html/hamming_8cpp_source.html b/docs/html/hamming_8cpp_source.html index 6136e61b1..502333dfa 100644 --- a/docs/html/hamming_8cpp_source.html +++ b/docs/html/hamming_8cpp_source.html @@ -583,194 +583,198 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    498  (32, ha, a, b, nb, order, true);
    499  break;
    500  default:
    -
    501  FAISS_THROW_IF_NOT (ncodes % 8 == 0);
    -
    502  hammings_knn_hc<faiss::HammingComputerM8>
    -
    503  (ncodes, ha, a, b, nb, order, true);
    -
    504 
    -
    505  }
    -
    506 }
    +
    501  if(ncodes % 8 == 0) {
    +
    502  hammings_knn_hc<faiss::HammingComputerM8>
    +
    503  (ncodes, ha, a, b, nb, order, true);
    +
    504  } else {
    +
    505  hammings_knn_hc<faiss::HammingComputerDefault>
    +
    506  (ncodes, ha, a, b, nb, order, true);
    507 
    -
    508 
    -
    509 
    -
    510 
    -
    511 /* Count number of matches given a max threshold */
    -
    512 void hamming_count_thres (
    -
    513  const uint8_t * bs1,
    -
    514  const uint8_t * bs2,
    -
    515  size_t n1,
    -
    516  size_t n2,
    -
    517  hamdis_t ht,
    -
    518  size_t ncodes,
    -
    519  size_t * nptr)
    -
    520 {
    -
    521  switch (ncodes) {
    -
    522  case 8:
    -
    523  faiss::hamming_count_thres <64> (C64(bs1), C64(bs2),
    -
    524  n1, n2, ht, nptr);
    -
    525  return;
    -
    526  case 16:
    -
    527  faiss::hamming_count_thres <128> (C64(bs1), C64(bs2),
    -
    528  n1, n2, ht, nptr);
    +
    508  }
    +
    509  }
    +
    510 }
    +
    511 
    +
    512 
    +
    513 
    +
    514 
    +
    515 /* Count number of matches given a max threshold */
    +
    516 void hamming_count_thres (
    +
    517  const uint8_t * bs1,
    +
    518  const uint8_t * bs2,
    +
    519  size_t n1,
    +
    520  size_t n2,
    +
    521  hamdis_t ht,
    +
    522  size_t ncodes,
    +
    523  size_t * nptr)
    +
    524 {
    +
    525  switch (ncodes) {
    +
    526  case 8:
    +
    527  faiss::hamming_count_thres <64> (C64(bs1), C64(bs2),
    +
    528  n1, n2, ht, nptr);
    529  return;
    -
    530  case 32:
    -
    531  faiss::hamming_count_thres <256> (C64(bs1), C64(bs2),
    +
    530  case 16:
    +
    531  faiss::hamming_count_thres <128> (C64(bs1), C64(bs2),
    532  n1, n2, ht, nptr);
    533  return;
    -
    534  case 64:
    -
    535  faiss::hamming_count_thres <512> (C64(bs1), C64(bs2),
    +
    534  case 32:
    +
    535  faiss::hamming_count_thres <256> (C64(bs1), C64(bs2),
    536  n1, n2, ht, nptr);
    537  return;
    -
    538  default:
    -
    539  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    -
    540  }
    -
    541 }
    -
    542 
    -
    543 
    -
    544 /* Count number of cross-matches given a threshold */
    -
    545 void crosshamming_count_thres (
    -
    546  const uint8_t * dbs,
    -
    547  size_t n,
    -
    548  hamdis_t ht,
    -
    549  size_t ncodes,
    -
    550  size_t * nptr)
    -
    551 {
    -
    552  switch (ncodes) {
    -
    553  case 8:
    -
    554  faiss::crosshamming_count_thres <64> (C64(dbs), n, ht, nptr);
    -
    555  return;
    -
    556  case 16:
    -
    557  faiss::crosshamming_count_thres <128> (C64(dbs), n, ht, nptr);
    -
    558  return;
    -
    559  case 32:
    -
    560  faiss::crosshamming_count_thres <256> (C64(dbs), n, ht, nptr);
    -
    561  return;
    -
    562  case 64:
    -
    563  faiss::crosshamming_count_thres <512> (C64(dbs), n, ht, nptr);
    -
    564  return;
    -
    565  default:
    -
    566  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    -
    567  }
    -
    568 }
    -
    569 
    -
    570 
    -
    571 /* Returns all matches given a threshold */
    -
    572 size_t match_hamming_thres (
    -
    573  const uint8_t * bs1,
    -
    574  const uint8_t * bs2,
    -
    575  size_t n1,
    -
    576  size_t n2,
    -
    577  hamdis_t ht,
    -
    578  size_t ncodes,
    -
    579  long * idx,
    -
    580  hamdis_t * dis)
    -
    581 {
    -
    582  switch (ncodes) {
    -
    583  case 8:
    -
    584  return faiss::match_hamming_thres <64> (C64(bs1), C64(bs2),
    -
    585  n1, n2, ht, idx, dis);
    -
    586  case 16:
    -
    587  return faiss::match_hamming_thres <128> (C64(bs1), C64(bs2),
    -
    588  n1, n2, ht, idx, dis);
    -
    589  case 32:
    -
    590  return faiss::match_hamming_thres <256> (C64(bs1), C64(bs2),
    -
    591  n1, n2, ht, idx, dis);
    -
    592  case 64:
    -
    593  return faiss::match_hamming_thres <512> (C64(bs1), C64(bs2),
    -
    594  n1, n2, ht, idx, dis);
    -
    595  default:
    -
    596  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    -
    597  return 0;
    -
    598  }
    -
    599 }
    -
    600 
    -
    601 
    -
    602 #undef C64
    -
    603 
    +
    538  case 64:
    +
    539  faiss::hamming_count_thres <512> (C64(bs1), C64(bs2),
    +
    540  n1, n2, ht, nptr);
    +
    541  return;
    +
    542  default:
    +
    543  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    +
    544  }
    +
    545 }
    +
    546 
    +
    547 
    +
    548 /* Count number of cross-matches given a threshold */
    +
    549 void crosshamming_count_thres (
    +
    550  const uint8_t * dbs,
    +
    551  size_t n,
    +
    552  hamdis_t ht,
    +
    553  size_t ncodes,
    +
    554  size_t * nptr)
    +
    555 {
    +
    556  switch (ncodes) {
    +
    557  case 8:
    +
    558  faiss::crosshamming_count_thres <64> (C64(dbs), n, ht, nptr);
    +
    559  return;
    +
    560  case 16:
    +
    561  faiss::crosshamming_count_thres <128> (C64(dbs), n, ht, nptr);
    +
    562  return;
    +
    563  case 32:
    +
    564  faiss::crosshamming_count_thres <256> (C64(dbs), n, ht, nptr);
    +
    565  return;
    +
    566  case 64:
    +
    567  faiss::crosshamming_count_thres <512> (C64(dbs), n, ht, nptr);
    +
    568  return;
    +
    569  default:
    +
    570  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    +
    571  }
    +
    572 }
    +
    573 
    +
    574 
    +
    575 /* Returns all matches given a threshold */
    +
    576 size_t match_hamming_thres (
    +
    577  const uint8_t * bs1,
    +
    578  const uint8_t * bs2,
    +
    579  size_t n1,
    +
    580  size_t n2,
    +
    581  hamdis_t ht,
    +
    582  size_t ncodes,
    +
    583  long * idx,
    +
    584  hamdis_t * dis)
    +
    585 {
    +
    586  switch (ncodes) {
    +
    587  case 8:
    +
    588  return faiss::match_hamming_thres <64> (C64(bs1), C64(bs2),
    +
    589  n1, n2, ht, idx, dis);
    +
    590  case 16:
    +
    591  return faiss::match_hamming_thres <128> (C64(bs1), C64(bs2),
    +
    592  n1, n2, ht, idx, dis);
    +
    593  case 32:
    +
    594  return faiss::match_hamming_thres <256> (C64(bs1), C64(bs2),
    +
    595  n1, n2, ht, idx, dis);
    +
    596  case 64:
    +
    597  return faiss::match_hamming_thres <512> (C64(bs1), C64(bs2),
    +
    598  n1, n2, ht, idx, dis);
    +
    599  default:
    +
    600  FAISS_THROW_FMT ("not implemented for %zu bits", ncodes);
    +
    601  return 0;
    +
    602  }
    +
    603 }
    604 
    605 
    -
    606 /*************************************
    -
    607  * generalized Hamming distances
    -
    608  ************************************/
    +
    606 #undef C64
    +
    607 
    +
    608 
    609 
    -
    610 
    -
    611 
    -
    612 template <class HammingComputer>
    -
    613 static void hamming_dis_inner_loop (
    -
    614  const uint8_t *ca,
    -
    615  const uint8_t *cb,
    -
    616  size_t nb,
    -
    617  size_t code_size,
    -
    618  int k,
    -
    619  hamdis_t * bh_val_,
    -
    620  long * bh_ids_)
    -
    621 {
    -
    622 
    -
    623  HammingComputer hc (ca, code_size);
    -
    624 
    -
    625  for (size_t j = 0; j < nb; j++) {
    -
    626  int ndiff = hc.hamming (cb);
    -
    627  cb += code_size;
    -
    628  if (ndiff < bh_val_[0]) {
    -
    629  maxheap_pop<hamdis_t> (k, bh_val_, bh_ids_);
    -
    630  maxheap_push<hamdis_t> (k, bh_val_, bh_ids_, ndiff, j);
    -
    631  }
    -
    632  }
    -
    633 }
    -
    634 
    -
    635 void generalized_hammings_knn (
    -
    636  int_maxheap_array_t * ha,
    -
    637  const uint8_t * a,
    -
    638  const uint8_t * b,
    -
    639  size_t nb,
    -
    640  size_t code_size,
    -
    641  int ordered)
    -
    642 {
    -
    643  int na = ha->nh;
    -
    644  int k = ha->k;
    -
    645 
    -
    646  if (ordered)
    -
    647  ha->heapify ();
    -
    648 
    -
    649 #pragma omp parallel for
    -
    650  for (int i = 0; i < na; i++) {
    -
    651  const uint8_t *ca = a + i * code_size;
    -
    652  const uint8_t *cb = b;
    -
    653 
    -
    654  hamdis_t * bh_val_ = ha->val + i * k;
    -
    655  long * bh_ids_ = ha->ids + i * k;
    -
    656 
    -
    657  switch (code_size) {
    -
    658  case 8:
    -
    659  hamming_dis_inner_loop<GenHammingComputer8>
    -
    660  (ca, cb, nb, 8, k, bh_val_, bh_ids_);
    -
    661  break;
    -
    662  case 16:
    -
    663  hamming_dis_inner_loop<GenHammingComputer16>
    -
    664  (ca, cb, nb, 16, k, bh_val_, bh_ids_);
    +
    610 /*************************************
    +
    611  * generalized Hamming distances
    +
    612  ************************************/
    +
    613 
    +
    614 
    +
    615 
    +
    616 template <class HammingComputer>
    +
    617 static void hamming_dis_inner_loop (
    +
    618  const uint8_t *ca,
    +
    619  const uint8_t *cb,
    +
    620  size_t nb,
    +
    621  size_t code_size,
    +
    622  int k,
    +
    623  hamdis_t * bh_val_,
    +
    624  long * bh_ids_)
    +
    625 {
    +
    626 
    +
    627  HammingComputer hc (ca, code_size);
    +
    628 
    +
    629  for (size_t j = 0; j < nb; j++) {
    +
    630  int ndiff = hc.hamming (cb);
    +
    631  cb += code_size;
    +
    632  if (ndiff < bh_val_[0]) {
    +
    633  maxheap_pop<hamdis_t> (k, bh_val_, bh_ids_);
    +
    634  maxheap_push<hamdis_t> (k, bh_val_, bh_ids_, ndiff, j);
    +
    635  }
    +
    636  }
    +
    637 }
    +
    638 
    +
    639 void generalized_hammings_knn (
    +
    640  int_maxheap_array_t * ha,
    +
    641  const uint8_t * a,
    +
    642  const uint8_t * b,
    +
    643  size_t nb,
    +
    644  size_t code_size,
    +
    645  int ordered)
    +
    646 {
    +
    647  int na = ha->nh;
    +
    648  int k = ha->k;
    +
    649 
    +
    650  if (ordered)
    +
    651  ha->heapify ();
    +
    652 
    +
    653 #pragma omp parallel for
    +
    654  for (int i = 0; i < na; i++) {
    +
    655  const uint8_t *ca = a + i * code_size;
    +
    656  const uint8_t *cb = b;
    +
    657 
    +
    658  hamdis_t * bh_val_ = ha->val + i * k;
    +
    659  long * bh_ids_ = ha->ids + i * k;
    +
    660 
    +
    661  switch (code_size) {
    +
    662  case 8:
    +
    663  hamming_dis_inner_loop<GenHammingComputer8>
    +
    664  (ca, cb, nb, 8, k, bh_val_, bh_ids_);
    665  break;
    -
    666  case 32:
    -
    667  hamming_dis_inner_loop<GenHammingComputer32>
    -
    668  (ca, cb, nb, 32, k, bh_val_, bh_ids_);
    +
    666  case 16:
    +
    667  hamming_dis_inner_loop<GenHammingComputer16>
    +
    668  (ca, cb, nb, 16, k, bh_val_, bh_ids_);
    669  break;
    -
    670  default:
    -
    671  hamming_dis_inner_loop<GenHammingComputerM8>
    -
    672  (ca, cb, nb, code_size, k, bh_val_, bh_ids_);
    +
    670  case 32:
    +
    671  hamming_dis_inner_loop<GenHammingComputer32>
    +
    672  (ca, cb, nb, 32, k, bh_val_, bh_ids_);
    673  break;
    -
    674  }
    -
    675  }
    -
    676 
    -
    677  if (ordered)
    -
    678  ha->reorder ();
    -
    679 
    -
    680 }
    -
    681 
    -
    682 
    +
    674  default:
    +
    675  hamming_dis_inner_loop<GenHammingComputerM8>
    +
    676  (ca, cb, nb, code_size, k, bh_val_, bh_ids_);
    +
    677  break;
    +
    678  }
    +
    679  }
    +
    680 
    +
    681  if (ordered)
    +
    682  ha->reorder ();
    683 
    -
    684 
    +
    684 }
    685 
    -
    686 } // namespace faiss
    +
    686 
    +
    687 
    +
    688 
    +
    689 
    +
    690 } // namespace faiss
    faiss::HeapArray::k
    size_t k
    allocated size per heap
    Definition: Heap.h:355
    -
    faiss::generalized_hammings_knn
    void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
    Definition: hamming.cpp:635
    +
    faiss::generalized_hammings_knn
    void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
    Definition: hamming.cpp:639
    faiss::HeapArray::reorder
    void reorder()
    reorder all the heaps
    Definition: Heap.cpp:34
    faiss::hammings_knn
    void hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t ncodes, int order)
    Definition: hamming.cpp:474
    diff --git a/docs/html/hamming_8h_source.html b/docs/html/hamming_8h_source.html index 8e2d6b9dc..134894ccc 100644 --- a/docs/html/hamming_8h_source.html +++ b/docs/html/hamming_8h_source.html @@ -337,195 +337,215 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    252 
    253 };
    254 
    -
    255 struct HammingComputerM8 {
    -
    256  const uint64_t *a;
    +
    255 struct HammingComputerDefault {
    +
    256  const uint8_t *a;
    257  int n;
    258 
    -
    259  HammingComputerM8 (const uint8_t *a8, int code_size) {
    -
    260  assert (code_size % 8 == 0);
    -
    261  a = (uint64_t *)a8;
    -
    262  n = code_size / 8;
    -
    263  }
    -
    264 
    -
    265  int hamming (const uint8_t *b8) const {
    -
    266  const uint64_t *b = (uint64_t *)b8;
    -
    267  int accu = 0;
    -
    268  for (int i = 0; i < n; i++)
    -
    269  accu += popcount64 (a[i] ^ b[i]);
    -
    270  return accu;
    -
    271  }
    +
    259  HammingComputerDefault (const uint8_t *a8, int code_size) {
    +
    260  a = a8;
    +
    261  n = code_size;
    +
    262  }
    +
    263 
    +
    264  int hamming (const uint8_t *b8) const {
    +
    265  int accu = 0;
    +
    266  for (int i = 0; i < n; i++)
    +
    267  accu += popcount64 (a[i] ^ b8[i]);
    +
    268  return accu;
    +
    269  }
    +
    270 
    +
    271 };
    272 
    -
    273 };
    -
    274 
    -
    275 // very inefficient...
    -
    276 struct HammingComputerM4 {
    -
    277  const uint32_t *a;
    -
    278  int n;
    -
    279 
    -
    280  HammingComputerM4 (const uint8_t *a4, int code_size) {
    -
    281  assert (code_size % 4 == 0);
    -
    282  a = (uint32_t *)a4;
    -
    283  n = code_size / 4;
    -
    284  }
    -
    285  int hamming (const uint8_t *b8) const {
    -
    286  const uint32_t *b = (uint32_t *)b8;
    -
    287  int accu = 0;
    -
    288  for (int i = 0; i < n; i++)
    -
    289  accu += popcount64 (a[i] ^ b[i]);
    -
    290  return accu;
    -
    291  }
    -
    292 
    -
    293 };
    -
    294 
    -
    295 /***************************************************************************
    -
    296  * Equivalence with a template class when code size is known at compile time
    -
    297  **************************************************************************/
    +
    273 
    +
    274 struct HammingComputerM8 {
    +
    275  const uint64_t *a;
    +
    276  int n;
    +
    277 
    +
    278  HammingComputerM8 (const uint8_t *a8, int code_size) {
    +
    279  assert (code_size % 8 == 0);
    +
    280  a = (uint64_t *)a8;
    +
    281  n = code_size / 8;
    +
    282  }
    +
    283 
    +
    284  int hamming (const uint8_t *b8) const {
    +
    285  const uint64_t *b = (uint64_t *)b8;
    +
    286  int accu = 0;
    +
    287  for (int i = 0; i < n; i++)
    +
    288  accu += popcount64 (a[i] ^ b[i]);
    +
    289  return accu;
    +
    290  }
    +
    291 
    +
    292 };
    +
    293 
    +
    294 // very inefficient...
    +
    295 struct HammingComputerM4 {
    +
    296  const uint32_t *a;
    +
    297  int n;
    298 
    -
    299 // default template
    -
    300 template<int CODE_SIZE>
    -
    301 struct HammingComputer: HammingComputerM8 {
    -
    302  HammingComputer (const uint8_t *a, int code_size):
    -
    303  HammingComputerM8(a, code_size) {}
    -
    304 };
    -
    305 
    -
    306 #define SPECIALIZED_HC(CODE_SIZE) \
    -
    307  template<> struct HammingComputer<CODE_SIZE>: \
    -
    308  HammingComputer ## CODE_SIZE { \
    -
    309  HammingComputer (const uint8_t *a): \
    -
    310  HammingComputer ## CODE_SIZE(a, CODE_SIZE) {} \
    -
    311  }
    -
    312 
    -
    313 SPECIALIZED_HC(4);
    -
    314 SPECIALIZED_HC(8);
    -
    315 SPECIALIZED_HC(16);
    -
    316 SPECIALIZED_HC(20);
    -
    317 SPECIALIZED_HC(32);
    -
    318 SPECIALIZED_HC(64);
    -
    319 
    -
    320 #undef SPECIALIZED_HC
    -
    321 
    -
    322 
    -
    323 /***************************************************************************
    -
    324  * generalized Hamming = number of bytes that are different between
    -
    325  * two codes.
    -
    326  ***************************************************************************/
    -
    327 
    -
    328 
    -
    329 inline int generalized_hamming_64 (uint64_t a) {
    -
    330  a |= a >> 1;
    -
    331  a |= a >> 2;
    -
    332  a |= a >> 4;
    -
    333  a &= 0x0101010101010101UL;
    -
    334  return popcount64 (a);
    -
    335 }
    -
    336 
    -
    337 
    -
    338 struct GenHammingComputer8 {
    -
    339  uint64_t a0;
    -
    340 
    -
    341  GenHammingComputer8 (const uint8_t *a, int code_size) {
    -
    342  assert (code_size == 8);
    -
    343  a0 = *(uint64_t *)a;
    -
    344  }
    -
    345 
    -
    346  inline int hamming (const uint8_t *b) const {
    -
    347  return generalized_hamming_64 (*(uint64_t *)b ^ a0);
    -
    348  }
    -
    349 
    -
    350 };
    -
    351 
    -
    352 
    -
    353 struct GenHammingComputer16 {
    -
    354  uint64_t a0, a1;
    -
    355  GenHammingComputer16 (const uint8_t *a8, int code_size) {
    -
    356  assert (code_size == 16);
    -
    357  const uint64_t *a = (uint64_t *)a8;
    -
    358  a0 = a[0]; a1 = a[1];
    -
    359  }
    -
    360 
    -
    361  inline int hamming (const uint8_t *b8) const {
    -
    362  const uint64_t *b = (uint64_t *)b8;
    -
    363  return generalized_hamming_64 (b[0] ^ a0) +
    -
    364  generalized_hamming_64 (b[1] ^ a1);
    -
    365  }
    -
    366 
    -
    367 };
    +
    299  HammingComputerM4 (const uint8_t *a4, int code_size) {
    +
    300  assert (code_size % 4 == 0);
    +
    301  a = (uint32_t *)a4;
    +
    302  n = code_size / 4;
    +
    303  }
    +
    304  int hamming (const uint8_t *b8) const {
    +
    305  const uint32_t *b = (uint32_t *)b8;
    +
    306  int accu = 0;
    +
    307  for (int i = 0; i < n; i++)
    +
    308  accu += popcount64 (a[i] ^ b[i]);
    +
    309  return accu;
    +
    310  }
    +
    311 
    +
    312 };
    +
    313 
    +
    314 /***************************************************************************
    +
    315  * Equivalence with a template class when code size is known at compile time
    +
    316  **************************************************************************/
    +
    317 
    +
    318 // default template
    +
    319 template<int CODE_SIZE>
    +
    320 struct HammingComputer: HammingComputerM8 {
    +
    321  HammingComputer (const uint8_t *a, int code_size):
    +
    322  HammingComputerM8(a, code_size) {}
    +
    323 };
    +
    324 
    +
    325 #define SPECIALIZED_HC(CODE_SIZE) \
    +
    326  template<> struct HammingComputer<CODE_SIZE>: \
    +
    327  HammingComputer ## CODE_SIZE { \
    +
    328  HammingComputer (const uint8_t *a): \
    +
    329  HammingComputer ## CODE_SIZE(a, CODE_SIZE) {} \
    +
    330  }
    +
    331 
    +
    332 SPECIALIZED_HC(4);
    +
    333 SPECIALIZED_HC(8);
    +
    334 SPECIALIZED_HC(16);
    +
    335 SPECIALIZED_HC(20);
    +
    336 SPECIALIZED_HC(32);
    +
    337 SPECIALIZED_HC(64);
    +
    338 
    +
    339 #undef SPECIALIZED_HC
    +
    340 
    +
    341 
    +
    342 /***************************************************************************
    +
    343  * generalized Hamming = number of bytes that are different between
    +
    344  * two codes.
    +
    345  ***************************************************************************/
    +
    346 
    +
    347 
    +
    348 inline int generalized_hamming_64 (uint64_t a) {
    +
    349  a |= a >> 1;
    +
    350  a |= a >> 2;
    +
    351  a |= a >> 4;
    +
    352  a &= 0x0101010101010101UL;
    +
    353  return popcount64 (a);
    +
    354 }
    +
    355 
    +
    356 
    +
    357 struct GenHammingComputer8 {
    +
    358  uint64_t a0;
    +
    359 
    +
    360  GenHammingComputer8 (const uint8_t *a, int code_size) {
    +
    361  assert (code_size == 8);
    +
    362  a0 = *(uint64_t *)a;
    +
    363  }
    +
    364 
    +
    365  inline int hamming (const uint8_t *b) const {
    +
    366  return generalized_hamming_64 (*(uint64_t *)b ^ a0);
    +
    367  }
    368 
    -
    369 struct GenHammingComputer32 {
    -
    370  uint64_t a0, a1, a2, a3;
    +
    369 };
    +
    370 
    371 
    -
    372  GenHammingComputer32 (const uint8_t *a8, int code_size) {
    -
    373  assert (code_size == 32);
    -
    374  const uint64_t *a = (uint64_t *)a8;
    -
    375  a0 = a[0]; a1 = a[1]; a2 = a[2]; a3 = a[3];
    -
    376  }
    -
    377 
    -
    378  inline int hamming (const uint8_t *b8) const {
    -
    379  const uint64_t *b = (uint64_t *)b8;
    -
    380  return generalized_hamming_64 (b[0] ^ a0) +
    -
    381  generalized_hamming_64 (b[1] ^ a1) +
    -
    382  generalized_hamming_64 (b[2] ^ a2) +
    -
    383  generalized_hamming_64 (b[3] ^ a3);
    +
    372 struct GenHammingComputer16 {
    +
    373  uint64_t a0, a1;
    +
    374  GenHammingComputer16 (const uint8_t *a8, int code_size) {
    +
    375  assert (code_size == 16);
    +
    376  const uint64_t *a = (uint64_t *)a8;
    +
    377  a0 = a[0]; a1 = a[1];
    +
    378  }
    +
    379 
    +
    380  inline int hamming (const uint8_t *b8) const {
    +
    381  const uint64_t *b = (uint64_t *)b8;
    +
    382  return generalized_hamming_64 (b[0] ^ a0) +
    +
    383  generalized_hamming_64 (b[1] ^ a1);
    384  }
    385 
    386 };
    387 
    -
    388 struct GenHammingComputerM8 {
    -
    389  const uint64_t *a;
    -
    390  int n;
    -
    391 
    -
    392  GenHammingComputerM8 (const uint8_t *a8, int code_size) {
    -
    393  assert (code_size % 8 == 0);
    -
    394  a = (uint64_t *)a8;
    -
    395  n = code_size / 8;
    -
    396  }
    -
    397 
    -
    398  int hamming (const uint8_t *b8) const {
    -
    399  const uint64_t *b = (uint64_t *)b8;
    -
    400  int accu = 0;
    -
    401  for (int i = 0; i < n; i++)
    -
    402  accu += generalized_hamming_64 (a[i] ^ b[i]);
    -
    403  return accu;
    -
    404  }
    -
    405 
    -
    406 };
    -
    407 
    -
    408 
    -
    409 /** generalized Hamming distances (= count number of code bytes that
    -
    410  are the same) */
    -
    411 void generalized_hammings_knn (
    -
    412  int_maxheap_array_t * ha,
    -
    413  const uint8_t * a,
    -
    414  const uint8_t * b,
    -
    415  size_t nb,
    -
    416  size_t code_size,
    -
    417  int ordered = true);
    -
    418 
    -
    419 
    -
    420 
    -
    421 
    -
    422 } // namespace faiss
    -
    423 
    +
    388 struct GenHammingComputer32 {
    +
    389  uint64_t a0, a1, a2, a3;
    +
    390 
    +
    391  GenHammingComputer32 (const uint8_t *a8, int code_size) {
    +
    392  assert (code_size == 32);
    +
    393  const uint64_t *a = (uint64_t *)a8;
    +
    394  a0 = a[0]; a1 = a[1]; a2 = a[2]; a3 = a[3];
    +
    395  }
    +
    396 
    +
    397  inline int hamming (const uint8_t *b8) const {
    +
    398  const uint64_t *b = (uint64_t *)b8;
    +
    399  return generalized_hamming_64 (b[0] ^ a0) +
    +
    400  generalized_hamming_64 (b[1] ^ a1) +
    +
    401  generalized_hamming_64 (b[2] ^ a2) +
    +
    402  generalized_hamming_64 (b[3] ^ a3);
    +
    403  }
    +
    404 
    +
    405 };
    +
    406 
    +
    407 struct GenHammingComputerM8 {
    +
    408  const uint64_t *a;
    +
    409  int n;
    +
    410 
    +
    411  GenHammingComputerM8 (const uint8_t *a8, int code_size) {
    +
    412  assert (code_size % 8 == 0);
    +
    413  a = (uint64_t *)a8;
    +
    414  n = code_size / 8;
    +
    415  }
    +
    416 
    +
    417  int hamming (const uint8_t *b8) const {
    +
    418  const uint64_t *b = (uint64_t *)b8;
    +
    419  int accu = 0;
    +
    420  for (int i = 0; i < n; i++)
    +
    421  accu += generalized_hamming_64 (a[i] ^ b[i]);
    +
    422  return accu;
    +
    423  }
    424 
    -
    425 
    +
    425 };
    426 
    -
    427 #endif /* FAISS_hamming_h */
    - - +
    427 
    +
    428 /** generalized Hamming distances (= count number of code bytes that
    +
    429  are the same) */
    +
    430 void generalized_hammings_knn (
    +
    431  int_maxheap_array_t * ha,
    +
    432  const uint8_t * a,
    +
    433  const uint8_t * b,
    +
    434  size_t nb,
    +
    435  size_t code_size,
    +
    436  int ordered = true);
    +
    437 
    +
    438 
    +
    439 
    +
    440 
    +
    441 } // namespace faiss
    +
    442 
    +
    443 
    +
    444 
    +
    445 
    +
    446 #endif /* FAISS_hamming_h */
    + + - - + + -
    faiss::generalized_hammings_knn
    void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
    Definition: hamming.cpp:635
    +
    faiss::generalized_hammings_knn
    void generalized_hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered)
    Definition: hamming.cpp:639
    - +
    faiss::hammings_knn
    void hammings_knn(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t ncodes, int order)
    Definition: hamming.cpp:474
    - - + + +
    diff --git a/docs/html/hierarchy.html b/docs/html/hierarchy.html index 9e24f2571..587b25827 100644 --- a/docs/html/hierarchy.html +++ b/docs/html/hierarchy.html @@ -167,144 +167,144 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); oCfaiss::HammingComputer4 oCfaiss::HammingComputer64 oCfaiss::HammingComputer8 -oCfaiss::HammingComputerM4 -oCfaiss::HammingComputerM8 -|\Cfaiss::HammingComputer< CODE_SIZE > -oCfaiss::HeapArray< C > -oCfaiss::IDSelector -|oCfaiss::IDSelectorBatch -|\Cfaiss::IDSelectorRange -oCfaiss::Index -|oCfaiss::gpu::GpuIndex -||oCfaiss::gpu::GpuIndexFlat -|||oCfaiss::gpu::GpuIndexFlatIP -|||\Cfaiss::gpu::GpuIndexFlatL2 -||\Cfaiss::gpu::GpuIndexIVF -|| oCfaiss::gpu::GpuIndexIVFFlat -|| \Cfaiss::gpu::GpuIndexIVFPQIVFPQ index for the GPU -|oCfaiss::gpu::IndexProxy -|oCfaiss::IndexFlat -||oCfaiss::IndexFlatIP -||\Cfaiss::IndexFlatL2 -|| oCfaiss::IndexFlat1DOptimized version for 1D "vectors" -|| \Cfaiss::IndexFlatL2BaseShift -|oCfaiss::IndexIDMap -||\Cfaiss::IndexIDMap2 -|oCfaiss::IndexIVF -||oCfaiss::IndexIVFFlat -|||\Cfaiss::IndexIVFFlatIPBounds -||oCfaiss::IndexIVFPQ -|||oCfaiss::IndexIVFPQCompact -|||\Cfaiss::IndexIVFPQR -||oCfaiss::IndexIVFScalarQuantizer -||\Cfaiss::IndexIVFScalarQuantizer -|oCfaiss::IndexLSH -|oCfaiss::IndexPQ -|oCfaiss::IndexPreTransform -|oCfaiss::IndexRefineFlat -|oCfaiss::IndexScalarQuantizer -|oCfaiss::IndexShards -|oCfaiss::IndexSplitVectors -|\Cfaiss::MultiIndexQuantizer -oCfaiss::IndexIVFFlatStats -oCfaiss::IndexIVFPQStats -oCfaiss::IndexPQStats -oCfaiss::gpu::IndexWrapper< GpuIndex > -oCfaiss::IndirectSort -oCfaiss::gpu::IntToLong -oCfaiss::gpu::IVFBaseBase inverted list functionality for IVFFlat and IVFPQ -|oCfaiss::gpu::IVFFlat -|\Cfaiss::gpu::IVFPQImplementing class for IVFPQ on the GPU -oCfaiss::gpu::IVFFlatScan< Dims, L2, T >The class that we use to provide scan specializations -oCfaiss::gpu::IVFFlatScan< 0, L2, T > -oCfaiss::gpu::IVFFlatScan< 128, L2, float > -oCfaiss::gpu::IVFFlatScan< 256, L2, float > -oCfaiss::gpu::IVFFlatScan< 64, L2, float > -oCfaiss::gpu::IVFFlatScan<-1, L2, T > -oCfaiss::gpu::KernelTimerUtility class for timing execution of a kernel -oCfaiss::gpu::Limits< T > -oCfaiss::gpu::Limits< float > -oCfaiss::gpu::Limits< int > -oCfaiss::gpu::Limits< Pair< K, V > > -oCfaiss::gpu::LoadCode32< NumSubQuantizers > -oCfaiss::gpu::LoadCode32< 1 > -oCfaiss::gpu::LoadCode32< 12 > -oCfaiss::gpu::LoadCode32< 16 > -oCfaiss::gpu::LoadCode32< 2 > -oCfaiss::gpu::LoadCode32< 20 > -oCfaiss::gpu::LoadCode32< 24 > -oCfaiss::gpu::LoadCode32< 28 > -oCfaiss::gpu::LoadCode32< 3 > -oCfaiss::gpu::LoadCode32< 32 > -oCfaiss::gpu::LoadCode32< 4 > -oCfaiss::gpu::LoadCode32< 40 > -oCfaiss::gpu::LoadCode32< 48 > -oCfaiss::gpu::LoadCode32< 56 > -oCfaiss::gpu::LoadCode32< 64 > -oCfaiss::gpu::LoadCode32< 8 > -oCfaiss::gpu::LoadCode32< 96 > -oCfaiss::gpu::LoadCodeDistances< LookupT, LookupVecT > -oCfaiss::gpu::LoadStore< T > -oCfaiss::gpu::Math< T > -oCfaiss::gpu::Math< float2 > -oCfaiss::gpu::Math< float4 > -oCfaiss::gpu::Max< T > -oCfaiss::gpu::Min< T > -oCfaiss::MinSumK< T, SSA, use_seen > -oCfaiss::NopDistanceCorrection -oCfaiss::gpu::NoTypeTensor< Dim, Contig, IndexT > -oCfaiss::OperatingPoint -oCfaiss::OperatingPoints -oCOptions -oCfaiss::gpu::Pair< K, V >A simple pair type for CUDA device usage -oCfaiss::ParameterRangePossible values of a parameter, sorted from least to most expensive/accurate -oCfaiss::ParameterSpace -|\Cfaiss::gpu::GpuParameterSpaceParameter space and setters for GPU indexes -oCfaiss::PermutationObjectiveAbstract class for the loss function -|oCfaiss::ReproduceDistancesObjective -|oCfaiss::Score3Computer< Ttab, Taccu > -|\Cfaiss::Score3Computer< float, double > -| \Cfaiss::RankingScore2 -oCfaiss::ProductQuantizer -oCfaiss::RangeSearchPartialResult::QueryResultResult structure for a single query -oCfaiss::RandomGeneratorRandom generator that can be used in multithreaded contexts -oCfaiss::gpu::StackDeviceMemory::Range -oCfaiss::RangeSearchResult -oCfaiss::gpu::traits::RestrictPtrTraits< T > -oCfaiss::ScalarQuantizer -oCfaiss::ScopeDeleter< T > -oCfaiss::ScopeDeleter1< T > -oCfaiss::ScopeFileCloser -oCfaiss::gpu::SegmentedReduce< T, ReduceOp > -oCfaiss::SemiSortedArray< T > -oCfaiss::SimulatedAnnealingParametersParameters used for the simulated annealing method -|oCfaiss::PolysemousTrainingOptimizes the order of indices in a ProductQuantizer -|\Cfaiss::SimulatedAnnealingOptimizerSimulated annealing optimization algorithm for permutations -oCfaiss::SortedArray< T > -oCfaiss::gpu::StackDeviceMemory::Stack -oCfaiss::gpu::detail::SubTensor< TensorType, SubDim, PtrTraits >A SubDim-rank slice of a parent Tensor -oCfaiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >Specialization for a view of a single value (0-dimensional) -oCfaiss::gpu::Sum< T > -oCfaiss::gpu::Tensor< T, Dim, Contig, IndexT, PtrTraits >Our tensor type -|oCfaiss::gpu::DeviceTensor< T, Dim, Contig, IndexT, PtrTraits > -|\Cfaiss::gpu::HostTensor< T, Dim, Contig, IndexT, PtrTraits > -oCfaiss::gpu::Tensor< float, Dim, Contig, int, traits::DefaultPtrTraits > -|oCfaiss::gpu::DeviceTensor< float, 1, true > -|oCfaiss::gpu::DeviceTensor< float, 2, true > -|\Cfaiss::gpu::DeviceTensor< float, 3, true > -oCfaiss::gpu::TensorInfo< T > -oCfaiss::gpu::TensorInfoOffset< T, Dim > -oCfaiss::gpu::TensorInfoOffset< T,-1 > -oCfaiss::VectorTransform -|oCfaiss::LinearTransform -||oCfaiss::OPQMatrix -||oCfaiss::PCAMatrix -||\Cfaiss::RandomRotationMatrixRandomly rotate a set of vectors -|oCfaiss::NormalizationTransform -|\Cfaiss::RemapDimensionsTransform -oCfaiss::gpu::WarpSelect< K, V, Dir, Comp, NumWarpQ, NumThreadQ, ThreadsPerBlock > -oCfaiss::gpu::WarpSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock >Specialization for k == 1 (NumWarpQ == 1) -\Cfaiss::gpu::WorkerThread +oCfaiss::HammingComputerDefault +oCfaiss::HammingComputerM4 +oCfaiss::HammingComputerM8 +|\Cfaiss::HammingComputer< CODE_SIZE > +oCfaiss::HeapArray< C > +oCfaiss::IDSelector +|oCfaiss::IDSelectorBatch +|\Cfaiss::IDSelectorRange +oCfaiss::Index +|oCfaiss::gpu::GpuIndex +||oCfaiss::gpu::GpuIndexFlat +|||oCfaiss::gpu::GpuIndexFlatIP +|||\Cfaiss::gpu::GpuIndexFlatL2 +||\Cfaiss::gpu::GpuIndexIVF +|| oCfaiss::gpu::GpuIndexIVFFlat +|| \Cfaiss::gpu::GpuIndexIVFPQIVFPQ index for the GPU +|oCfaiss::gpu::IndexProxy +|oCfaiss::IndexFlat +||oCfaiss::IndexFlatIP +||\Cfaiss::IndexFlatL2 +|| oCfaiss::IndexFlat1DOptimized version for 1D "vectors" +|| \Cfaiss::IndexFlatL2BaseShift +|oCfaiss::IndexIDMap +||\Cfaiss::IndexIDMap2 +|oCfaiss::IndexIVF +||oCfaiss::IndexIVFFlat +|||\Cfaiss::IndexIVFFlatIPBounds +||oCfaiss::IndexIVFPQ +|||oCfaiss::IndexIVFPQCompact +|||\Cfaiss::IndexIVFPQR +||\Cfaiss::IndexIVFScalarQuantizer +|oCfaiss::IndexLSH +|oCfaiss::IndexPQ +|oCfaiss::IndexPreTransform +|oCfaiss::IndexRefineFlat +|oCfaiss::IndexScalarQuantizer +|oCfaiss::IndexShards +|oCfaiss::IndexSplitVectors +|\Cfaiss::MultiIndexQuantizer +oCfaiss::IndexIVFFlatStats +oCfaiss::IndexIVFPQStats +oCfaiss::IndexPQStats +oCfaiss::gpu::IndexWrapper< GpuIndex > +oCfaiss::IndirectSort +oCfaiss::gpu::IntToLong +oCfaiss::gpu::IVFBaseBase inverted list functionality for IVFFlat and IVFPQ +|oCfaiss::gpu::IVFFlat +|\Cfaiss::gpu::IVFPQImplementing class for IVFPQ on the GPU +oCfaiss::gpu::IVFFlatScan< Dims, L2, T >The class that we use to provide scan specializations +oCfaiss::gpu::IVFFlatScan< 0, L2, T > +oCfaiss::gpu::IVFFlatScan< 128, L2, float > +oCfaiss::gpu::IVFFlatScan< 256, L2, float > +oCfaiss::gpu::IVFFlatScan< 64, L2, float > +oCfaiss::gpu::IVFFlatScan<-1, L2, T > +oCfaiss::gpu::KernelTimerUtility class for timing execution of a kernel +oCfaiss::gpu::Limits< T > +oCfaiss::gpu::Limits< float > +oCfaiss::gpu::Limits< int > +oCfaiss::gpu::Limits< Pair< K, V > > +oCfaiss::gpu::LoadCode32< NumSubQuantizers > +oCfaiss::gpu::LoadCode32< 1 > +oCfaiss::gpu::LoadCode32< 12 > +oCfaiss::gpu::LoadCode32< 16 > +oCfaiss::gpu::LoadCode32< 2 > +oCfaiss::gpu::LoadCode32< 20 > +oCfaiss::gpu::LoadCode32< 24 > +oCfaiss::gpu::LoadCode32< 28 > +oCfaiss::gpu::LoadCode32< 3 > +oCfaiss::gpu::LoadCode32< 32 > +oCfaiss::gpu::LoadCode32< 4 > +oCfaiss::gpu::LoadCode32< 40 > +oCfaiss::gpu::LoadCode32< 48 > +oCfaiss::gpu::LoadCode32< 56 > +oCfaiss::gpu::LoadCode32< 64 > +oCfaiss::gpu::LoadCode32< 8 > +oCfaiss::gpu::LoadCode32< 96 > +oCfaiss::gpu::LoadCodeDistances< LookupT, LookupVecT > +oCfaiss::gpu::LoadStore< T > +oCfaiss::gpu::Math< T > +oCfaiss::gpu::Math< float2 > +oCfaiss::gpu::Math< float4 > +oCfaiss::gpu::Max< T > +oCfaiss::gpu::Min< T > +oCfaiss::MinSumK< T, SSA, use_seen > +oCfaiss::NopDistanceCorrection +oCfaiss::gpu::NoTypeTensor< Dim, Contig, IndexT > +oCfaiss::OperatingPoint +oCfaiss::OperatingPoints +oCOptions +oCfaiss::gpu::Pair< K, V >A simple pair type for CUDA device usage +oCfaiss::ParameterRangePossible values of a parameter, sorted from least to most expensive/accurate +oCfaiss::ParameterSpace +|\Cfaiss::gpu::GpuParameterSpaceParameter space and setters for GPU indexes +oCfaiss::PermutationObjectiveAbstract class for the loss function +|oCfaiss::ReproduceDistancesObjective +|oCfaiss::Score3Computer< Ttab, Taccu > +|\Cfaiss::Score3Computer< float, double > +| \Cfaiss::RankingScore2 +oCfaiss::ProductQuantizer +oCfaiss::RangeSearchPartialResult::QueryResultResult structure for a single query +oCfaiss::RandomGeneratorRandom generator that can be used in multithreaded contexts +oCfaiss::gpu::StackDeviceMemory::Range +oCfaiss::RangeSearchResult +oCfaiss::gpu::traits::RestrictPtrTraits< T > +oCfaiss::ScalarQuantizer +oCfaiss::ScopeDeleter< T > +oCfaiss::ScopeDeleter1< T > +oCfaiss::ScopeFileCloser +oCfaiss::gpu::SegmentedReduce< T, ReduceOp > +oCfaiss::SemiSortedArray< T > +oCfaiss::SimulatedAnnealingParametersParameters used for the simulated annealing method +|oCfaiss::PolysemousTrainingOptimizes the order of indices in a ProductQuantizer +|\Cfaiss::SimulatedAnnealingOptimizerSimulated annealing optimization algorithm for permutations +oCfaiss::SortedArray< T > +oCfaiss::gpu::StackDeviceMemory::Stack +oCfaiss::gpu::detail::SubTensor< TensorType, SubDim, PtrTraits >A SubDim-rank slice of a parent Tensor +oCfaiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >Specialization for a view of a single value (0-dimensional) +oCfaiss::gpu::Sum< T > +oCfaiss::gpu::Tensor< T, Dim, Contig, IndexT, PtrTraits >Our tensor type +|oCfaiss::gpu::DeviceTensor< T, Dim, Contig, IndexT, PtrTraits > +|\Cfaiss::gpu::HostTensor< T, Dim, Contig, IndexT, PtrTraits > +oCfaiss::gpu::Tensor< float, Dim, Contig, int, traits::DefaultPtrTraits > +|oCfaiss::gpu::DeviceTensor< float, 1, true > +|oCfaiss::gpu::DeviceTensor< float, 2, true > +|\Cfaiss::gpu::DeviceTensor< float, 3, true > +oCfaiss::gpu::TensorInfo< T > +oCfaiss::gpu::TensorInfoOffset< T, Dim > +oCfaiss::gpu::TensorInfoOffset< T,-1 > +oCfaiss::VectorTransform +|oCfaiss::LinearTransform +||oCfaiss::OPQMatrix +||oCfaiss::PCAMatrix +||\Cfaiss::RandomRotationMatrixRandomly rotate a set of vectors +|oCfaiss::NormalizationTransform +|\Cfaiss::RemapDimensionsTransform +oCfaiss::gpu::WarpSelect< K, V, Dir, Comp, NumWarpQ, NumThreadQ, ThreadsPerBlock > +oCfaiss::gpu::WarpSelect< K, V, Dir, Comp, 1, NumThreadQ, ThreadsPerBlock >Specialization for k == 1 (NumWarpQ == 1) +\Cfaiss::gpu::WorkerThread diff --git a/docs/html/index__io_8cpp_source.html b/docs/html/index__io_8cpp_source.html index 874a805ad..f19cccee9 100644 --- a/docs/html/index__io_8cpp_source.html +++ b/docs/html/index__io_8cpp_source.html @@ -696,11 +696,11 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    611  } else if(h == fourcc ("IvSQ")) {
    612  IndexIVFScalarQuantizer * ivsc = new IndexIVFScalarQuantizer();
    613  read_ivf_header (ivsc, f);
    -
    614  ivsc->codes.resize(ivsc->nlist);
    +
    614  ivsc->codes.resize(ivsc->nlist);
    615  read_ScalarQuantizer (&ivsc->sq, f);
    616  READ1 (ivsc->code_size);
    617  for(int i = 0; i < ivsc->nlist; i++)
    -
    618  READVECTOR (ivsc->codes[i]);
    +
    618  READVECTOR (ivsc->codes[i]);
    619  idx = ivsc;
    620  } else if(h == fourcc ("IvPQ") || h == fourcc ("IvQR") ||
    621  h == fourcc ("IvPC")) {
    @@ -854,7 +854,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    769 } // namespace faiss
    faiss::IndexPQ::codes
    std::vector< uint8_t > codes
    Codes. Size ntotal * pq.code_size.
    Definition: IndexPQ.h:34
    -
    faiss::ScalarQuantizer::code_size
    size_t code_size
    bytes per vector
    Definition: IndexIVFScalarQuantizer.h:64
    +
    faiss::ScalarQuantizer::code_size
    size_t code_size
    bytes per vector
    Definition: IndexScalarQuantizer.h:60
    faiss::IndexPreTransform::index
    Index * index
    ! chain of tranforms
    Definition: VectorTransform.h:242
    faiss::RandomRotationMatrix
    Randomly rotate a set of vectors.
    Definition: VectorTransform.h:107
    @@ -873,6 +873,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    faiss::IndexRefineFlat::base_index
    Index * base_index
    faster index to pre-select the vectors that should be filtered
    Definition: IndexFlat.h:109
    +
    faiss::IndexIVFScalarQuantizer::codes
    std::vector< std::vector< uint8_t > > codes
    inverted list codes.
    Definition: IndexScalarQuantizer.h:135
    faiss::IndexRefineFlat::refine_index
    IndexFlat refine_index
    storage for full vectors
    Definition: IndexFlat.h:106
    faiss::IndexRefineFlat::own_fields
    bool own_fields
    should the base index be deallocated?
    Definition: IndexFlat.h:110
    faiss::Index::d
    int d
    vector dimension
    Definition: Index.h:64
    @@ -883,7 +884,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    faiss::Index::idx_t
    long idx_t
    all indices are this type
    Definition: Index.h:62
    faiss::IndexPQ::pq
    ProductQuantizer pq
    The product quantizer used to encode the vectors.
    Definition: IndexPQ.h:31
    faiss::Index::ntotal
    idx_t ntotal
    total nb of indexed vectors
    Definition: Index.h:65
    - +
    faiss::IndexPreTransform::own_fields
    bool own_fields
    ! the sub-index
    Definition: VectorTransform.h:244
    faiss::Index::metric_type
    MetricType metric_type
    type of metric this index uses for search
    Definition: Index.h:72
    @@ -891,7 +892,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    faiss::VectorTransform::d_out
    int d_out
    ! input dimension
    Definition: VectorTransform.h:33
    faiss::IndexLSH::nbits
    int nbits
    nb of bits per vector
    Definition: IndexLSH.h:27
    -
    faiss::IndexIVFScalarQuantizer::codes
    std::vector< std::vector< uint8_t > > codes
    inverted list codes.
    Definition: IndexIVFScalarQuantizer.h:92
    faiss::Index::is_trained
    bool is_trained
    set if the Index does not require training, or if training is done already
    Definition: Index.h:69
    faiss::IndexFlat::xb
    std::vector< float > xb
    database vectors, size ntotal * d
    Definition: IndexFlat.h:25
    faiss::IndexPQ::polysemous_ht
    int polysemous_ht
    Hamming threshold used for polysemy.
    Definition: IndexPQ.h:91
    diff --git a/docs/html/namespacefaiss.html b/docs/html/namespacefaiss.html index 5375a7092..5fa3d2e01 100644 --- a/docs/html/namespacefaiss.html +++ b/docs/html/namespacefaiss.html @@ -144,6 +144,8 @@ Classes   struct  HammingComputer64   +struct  HammingComputerDefault +  struct  HammingComputerM8   struct  HammingComputerM4 @@ -201,10 +203,6 @@ Classes   struct  IndexIVFPQCompact   -struct  ScalarQuantizer -  -struct  IndexIVFScalarQuantizer -  struct  IndexLSH   struct  ArgSort @@ -221,8 +219,12 @@ Classes   struct  MultiIndexQuantizer   +struct  ScalarQuantizer +  struct  IndexScalarQuantizer   +struct  IndexIVFScalarQuantizer +  struct  IndexIDMap   struct  IndexIDMap2 @@ -505,15 +507,15 @@ void write_VectorTransform Index * clone_index (const Index *index)   +template<class C > +void partial_sort (int k, int n, const typename C::T *vals, typename C::TI *perm) +  void search_with_probes_ip (const IndexIVFScalarQuantizer &index, const float *x, const idx_t *cent_ids, const float *cent_dis, const Quantizer &quant, int k, float *simi, idx_t *idxi)   void search_with_probes_L2 (const IndexIVFScalarQuantizer &index, const float *x_in, const idx_t *cent_ids, const Index *quantizer, const Quantizer &quant, int k, float *simi, idx_t *idxi)   -template<class C > -void partial_sort (int k, int n, const typename C::T *vals, typename C::TI *perm) -  template<typename CT , class C > void pq_estimators_from_tables_Mmul4 (int M, const CT *codes, size_t ncodes, const float *__restrict dis_table, size_t ksub, size_t k, float *heap_dis, long *heap_ids) @@ -1045,7 +1047,7 @@ int read_old_fmt_hack

    generalized Hamming distances (= count number of code bytes that are the same)

    -

    Definition at line 635 of file hamming.cpp.

    +

    Definition at line 639 of file hamming.cpp.

    diff --git a/docs/html/search/all_61.js b/docs/html/search/all_61.js index 55eb01e03..b140585d9 100644 --- a/docs/html/search/all_61.js +++ b/docs/html/search/all_61.js @@ -6,7 +6,7 @@ var searchData= ['add_5fcore',['add_core',['../structfaiss_1_1IndexIVFFlat.html#aea729c3d8c70bdd93f8e413e834851a4',1,'faiss::IndexIVFFlat::add_core()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#a938285c16dafe294775643b820637444',1,'faiss::IndexIVFFlatIPBounds::add_core()'],['../structfaiss_1_1IndexIVFPQR.html#a186b746f22b65ddf416b1e821b0866ec',1,'faiss::IndexIVFPQR::add_core()']]], ['add_5fcore_5fo',['add_core_o',['../structfaiss_1_1IndexIVFPQ.html#ac0cb8421b9885d691696d2ff4f76894b',1,'faiss::IndexIVFPQ']]], ['add_5frange',['add_range',['../structfaiss_1_1ParameterSpace.html#aeaa27a715fe3fceef5da18d894976833',1,'faiss::ParameterSpace']]], - ['add_5fwith_5fids',['add_with_ids',['../classfaiss_1_1gpu_1_1GpuIndex.html#a47f6969fe60d82b8e3407557ba9eec88',1,'faiss::gpu::GpuIndex::add_with_ids()'],['../structfaiss_1_1Index.html#aa6931dfe054b33b02c842ff75f7a0c7f',1,'faiss::Index::add_with_ids()'],['../structfaiss_1_1IndexIVFFlat.html#a5f7356766632d3ce2838f285aa6b8e76',1,'faiss::IndexIVFFlat::add_with_ids()'],['../structfaiss_1_1IndexIVFPQ.html#a981c2748bfbd9b018494f119279a0342',1,'faiss::IndexIVFPQ::add_with_ids()'],['../structfaiss_1_1IndexIVFPQR.html#a4b6154a5194d574d037ba78c137a2fa5',1,'faiss::IndexIVFPQR::add_with_ids()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids(idx_t n, const float *x, const long *xids) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids(idx_t n, const float *x, const long *xids) override'],['../structfaiss_1_1IndexIDMap.html#aeace75e53648c052d05c357b744e090b',1,'faiss::IndexIDMap::add_with_ids()'],['../structfaiss_1_1IndexIDMap2.html#a33ff76975891695c2fa45ed26fc8eae9',1,'faiss::IndexIDMap2::add_with_ids()'],['../structfaiss_1_1IndexShards.html#a1f771d50133494f682f05c9ab9e39ad9',1,'faiss::IndexShards::add_with_ids()'],['../structfaiss_1_1IndexPreTransform.html#a07fef0553b2ef2907f394470f61898b2',1,'faiss::IndexPreTransform::add_with_ids()']]], + ['add_5fwith_5fids',['add_with_ids',['../classfaiss_1_1gpu_1_1GpuIndex.html#a47f6969fe60d82b8e3407557ba9eec88',1,'faiss::gpu::GpuIndex::add_with_ids()'],['../structfaiss_1_1Index.html#aa6931dfe054b33b02c842ff75f7a0c7f',1,'faiss::Index::add_with_ids()'],['../structfaiss_1_1IndexIVFFlat.html#a5f7356766632d3ce2838f285aa6b8e76',1,'faiss::IndexIVFFlat::add_with_ids()'],['../structfaiss_1_1IndexIVFPQ.html#a981c2748bfbd9b018494f119279a0342',1,'faiss::IndexIVFPQ::add_with_ids()'],['../structfaiss_1_1IndexIVFPQR.html#a4b6154a5194d574d037ba78c137a2fa5',1,'faiss::IndexIVFPQR::add_with_ids()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids()'],['../structfaiss_1_1IndexIDMap.html#aeace75e53648c052d05c357b744e090b',1,'faiss::IndexIDMap::add_with_ids()'],['../structfaiss_1_1IndexIDMap2.html#a33ff76975891695c2fa45ed26fc8eae9',1,'faiss::IndexIDMap2::add_with_ids()'],['../structfaiss_1_1IndexShards.html#a1f771d50133494f682f05c9ab9e39ad9',1,'faiss::IndexShards::add_with_ids()'],['../structfaiss_1_1IndexPreTransform.html#a07fef0553b2ef2907f394470f61898b2',1,'faiss::IndexPreTransform::add_with_ids()']]], ['addcodevectorsfromcpu',['addCodeVectorsFromCpu',['../classfaiss_1_1gpu_1_1IVFFlat.html#a0bedde6dcb7c2f10f277461b97486f52',1,'faiss::gpu::IVFFlat::addCodeVectorsFromCpu()'],['../classfaiss_1_1gpu_1_1IVFPQ.html#a9992b38226dc8f92ca2691582fabb675',1,'faiss::gpu::IVFPQ::addCodeVectorsFromCpu()']]], ['addimpl_5f',['addImpl_',['../classfaiss_1_1gpu_1_1GpuIndex.html#a345819c6214c2a6eb7874dde1145036f',1,'faiss::gpu::GpuIndex::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ae0c916b911eda2f1a09a55f42ebc729c',1,'faiss::gpu::GpuIndexFlat::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a64bd89e18b8199ae7a88066890b10a0e',1,'faiss::gpu::GpuIndexIVFFlat::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a50e74f0621ca2fe5688825f434ad2bb2',1,'faiss::gpu::GpuIndexIVFPQ::addImpl_()']]], ['addindex',['addIndex',['../classfaiss_1_1gpu_1_1IndexProxy.html#af9bb81e75f8d5471094e4d4776a56f63',1,'faiss::gpu::IndexProxy']]], diff --git a/docs/html/search/all_63.js b/docs/html/search/all_63.js index 046a53638..0eaed0e6f 100644 --- a/docs/html/search/all_63.js +++ b/docs/html/search/all_63.js @@ -18,7 +18,7 @@ var searchData= ['cno',['cno',['../structfaiss_1_1OperatingPoint.html#a2c023f1484e4748e3e97681bb1f4b78e',1,'faiss::OperatingPoint']]], ['code_5fsize',['code_size',['../structfaiss_1_1IndexIVFPQ.html#a31c6fb2faa4dadea4c0594338be7be90',1,'faiss::IndexIVFPQ::code_size()'],['../structfaiss_1_1ScalarQuantizer.html#a647b8774e4cd8ca5623a194f5c7f8a33',1,'faiss::ScalarQuantizer::code_size()'],['../structfaiss_1_1ProductQuantizer.html#aa61330eadb84772b71018b093773a5f9',1,'faiss::ProductQuantizer::code_size()']]], ['codecmp',['CodeCmp',['../structfaiss_1_1CodeCmp.html',1,'faiss']]], - ['codes',['codes',['../structfaiss_1_1IndexIVFScalarQuantizer.html#aa4764c6d0d4175e01e3c92d3334bc996',1,'faiss::IndexIVFScalarQuantizer::codes()'],['../structfaiss_1_1IndexLSH.html#a55c0f1127850af0d06ef22fc8b791572',1,'faiss::IndexLSH::codes()'],['../structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5',1,'faiss::IndexPQ::codes()'],['../structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be',1,'faiss::IndexScalarQuantizer::codes()']]], + ['codes',['codes',['../structfaiss_1_1IndexLSH.html#a55c0f1127850af0d06ef22fc8b791572',1,'faiss::IndexLSH::codes()'],['../structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5',1,'faiss::IndexPQ::codes()'],['../structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be',1,'faiss::IndexScalarQuantizer::codes()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#abc335510a1855faecb3e445c49a9b204',1,'faiss::IndexIVFScalarQuantizer::codes()']]], ['combination_5fge',['combination_ge',['../structfaiss_1_1ParameterSpace.html#a7cdedaf4bab33293771c4267d453a950',1,'faiss::ParameterSpace']]], ['combination_5fname',['combination_name',['../structfaiss_1_1ParameterSpace.html#a7bb416dbab456bb1ecd9ace433fa5312',1,'faiss::ParameterSpace']]], ['compact_5fcodes',['compact_codes',['../structfaiss_1_1IndexIVFPQCompact.html#aaaf53cae0e47baf3fb1199ce4d789694',1,'faiss::IndexIVFPQCompact']]], @@ -27,7 +27,7 @@ var searchData= ['compute',['compute',['../structfaiss_1_1Score3Computer.html#a07a726903418960a2d8000506d88f8e6',1,'faiss::Score3Computer']]], ['compute_5fcode',['compute_code',['../structfaiss_1_1ProductQuantizer.html#a08b130e3a21f2699a4e3bbec121fb838',1,'faiss::ProductQuantizer']]], ['compute_5fcode_5ffrom_5fdistance_5ftable',['compute_code_from_distance_table',['../structfaiss_1_1ProductQuantizer.html#a95060fedd7c09eb20e968fd2fdb4b316',1,'faiss::ProductQuantizer']]], - ['compute_5fcodes',['compute_codes',['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes(const float *x, uint8_t *codes, size_t n) const '],['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes(const float *x, uint8_t *codes, size_t n) const '],['../structfaiss_1_1ProductQuantizer.html#ae5a340ee5a4b1d35a565b167de2a2ef1',1,'faiss::ProductQuantizer::compute_codes()']]], + ['compute_5fcodes',['compute_codes',['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes()'],['../structfaiss_1_1ProductQuantizer.html#ae5a340ee5a4b1d35a565b167de2a2ef1',1,'faiss::ProductQuantizer::compute_codes()']]], ['compute_5fcost',['compute_cost',['../structfaiss_1_1Score3Computer.html#a1c4537d67802aef28ccc57c4bd87f766',1,'faiss::Score3Computer']]], ['compute_5fdistance_5fsubset',['compute_distance_subset',['../structfaiss_1_1IndexFlat.html#a14b51786e7f98be1954eef35d02813a7',1,'faiss::IndexFlat']]], ['compute_5fdistance_5ftable',['compute_distance_table',['../structfaiss_1_1ProductQuantizer.html#a36361f41bcd2fa698f3c39eb7111ed09',1,'faiss::ProductQuantizer']]], diff --git a/docs/html/search/all_64.js b/docs/html/search/all_64.js index ade4111d7..41015ee27 100644 --- a/docs/html/search/all_64.js +++ b/docs/html/search/all_64.js @@ -5,7 +5,7 @@ var searchData= ['data',['data',['../classfaiss_1_1gpu_1_1Tensor.html#a37d3ac0dffcaad29f09d6e85fb07b335',1,'faiss::gpu::Tensor::data()'],['../classfaiss_1_1gpu_1_1Tensor.html#a9a098dad7e211328d1ae8b00d02839ce',1,'faiss::gpu::Tensor::data() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#aae8c90b402493f5656f94701157a7417',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::data()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a750047ff919799af43b4861b580c82e3',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::data() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a30dff4e7bea94cd894e17f6bdd7a7eb1',1,'faiss::gpu::detail::SubTensor::data()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a6e7097578ba17c10895ec0dafa385901',1,'faiss::gpu::detail::SubTensor::data() const ']]], ['data_5f',['data_',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ae393840fc80403369452c25c9155e067',1,'faiss::gpu::GpuIndexFlat::data_()'],['../classfaiss_1_1gpu_1_1Tensor.html#a08024dbcaed3c1235cac62b476f14509',1,'faiss::gpu::Tensor::data_()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a6a548d4edb57d072be52cd827f055d6d',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::data_()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#aa4aa193f6140219872839ad8665b5d36',1,'faiss::gpu::detail::SubTensor::data_()']]], ['dataas',['dataAs',['../classfaiss_1_1gpu_1_1Tensor.html#a7c987316708113dafd11971092d59f69',1,'faiss::gpu::Tensor::dataAs()'],['../classfaiss_1_1gpu_1_1Tensor.html#ad02cd32977ebf89636c8d085b4470c2e',1,'faiss::gpu::Tensor::dataAs() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a23e80555a443797d60ae16d605dacd23',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::dataAs()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a0ec3a48f265de627490e7cdf540e9fc5',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::dataAs() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a9825bed624c3abb6337a1ab7654d7db7',1,'faiss::gpu::detail::SubTensor::dataAs()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a485abbadb5b5de23e88822366857a78f',1,'faiss::gpu::detail::SubTensor::dataAs() const ']]], - ['decode',['decode',['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode(const uint8_t *code, float *x, size_t n) const '],['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode(const uint8_t *code, float *x, size_t n) const '],['../structfaiss_1_1ProductQuantizer.html#a7afbf9d96276f021981e99f064254208',1,'faiss::ProductQuantizer::decode()']]], + ['decode',['decode',['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode()'],['../structfaiss_1_1ProductQuantizer.html#a7afbf9d96276f021981e99f064254208',1,'faiss::ProductQuantizer::decode()']]], ['decode_5fmultiple',['decode_multiple',['../structfaiss_1_1IndexIVFPQ.html#ae1fb0cc3051dec8e322a78c443f8fc9a',1,'faiss::IndexIVFPQ']]], ['defaultptrtraits',['DefaultPtrTraits',['../structfaiss_1_1gpu_1_1traits_1_1DefaultPtrTraits.html',1,'faiss::gpu::traits']]], ['defaultptrtraits_3c_20float_20_3e',['DefaultPtrTraits< float >',['../structfaiss_1_1gpu_1_1traits_1_1DefaultPtrTraits.html',1,'faiss::gpu::traits']]], diff --git a/docs/html/search/all_67.js b/docs/html/search/all_67.js index f39989ada..1e2f63b2d 100644 --- a/docs/html/search/all_67.js +++ b/docs/html/search/all_67.js @@ -10,8 +10,16 @@ var searchData= ['get_5fmem_5fusage_5fkb',['get_mem_usage_kb',['../namespacefaiss.html#aa3af5769b0b649f112332a874c64d361',1,'faiss']]], ['get_5fval',['get_val',['../structfaiss_1_1HeapArray.html#ae97911f6f85d152a5b45e459063b6858',1,'faiss::HeapArray']]], ['getalloc',['getAlloc',['../structfaiss_1_1gpu_1_1StackDeviceMemory_1_1Stack.html#ab45d128f288728df5baf03defd50cec7',1,'faiss::gpu::StackDeviceMemory::Stack']]], + ['getalternatestreams',['getAlternateStreams',['../classfaiss_1_1gpu_1_1GpuResources.html#afb469bf3b107f43ef0d6abe4a014bb5b',1,'faiss::gpu::GpuResources::getAlternateStreams()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a9ebf68604864cb890a4c2e3d0a6f9952',1,'faiss::gpu::StandardGpuResources::getAlternateStreams()']]], + ['getalternatestreamscurrentdevice',['getAlternateStreamsCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a622f95597cc2ed2f10f3ae9400dc685b',1,'faiss::gpu::GpuResources']]], + ['getasynccopystream',['getAsyncCopyStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a104b291ed4116033752144e90856c2e7',1,'faiss::gpu::GpuResources::getAsyncCopyStream()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#adf89d4731c826df889f51fe42287b15d',1,'faiss::gpu::StandardGpuResources::getAsyncCopyStream()']]], + ['getasynccopystreamcurrentdevice',['getAsyncCopyStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#aefb90d15fade57cdfcff03ec800183d4',1,'faiss::gpu::GpuResources']]], ['getbitspercode',['getBitsPerCode',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#af87058de254e1430587a16b76f1e4377',1,'faiss::gpu::GpuIndexIVFPQ']]], + ['getblashandle',['getBlasHandle',['../classfaiss_1_1gpu_1_1GpuResources.html#aa2682b8503dfdab4f7f5ef867035ad29',1,'faiss::gpu::GpuResources::getBlasHandle()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a7560435c7f45fd59d94ee947330a58da',1,'faiss::gpu::StandardGpuResources::getBlasHandle()']]], + ['getblashandlecurrentdevice',['getBlasHandleCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a00cb7bcbc5f1a00da673f30749149b12',1,'faiss::gpu::GpuResources']]], ['getcentroidspersubquantizer',['getCentroidsPerSubQuantizer',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a2f50e79af6727962cd89534438d4769e',1,'faiss::gpu::GpuIndexIVFPQ']]], + ['getdefaultstream',['getDefaultStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a6c564198df6ba675920c993e2af34b8c',1,'faiss::gpu::GpuResources::getDefaultStream()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a954f34ef68fd36b8d502ca3a21f7e8a8',1,'faiss::gpu::StandardGpuResources::getDefaultStream()']]], + ['getdefaultstreamcurrentdevice',['getDefaultStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#aa0354aa570c24e17a9f8a6a45b153ed2',1,'faiss::gpu::GpuResources']]], ['getdevice',['getDevice',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a1a3f8580febe15b3eee91cc95bdb9c80',1,'faiss::gpu::DeviceMemory::getDevice()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#ab9dac6d8953630121f60fb804599f648',1,'faiss::gpu::StackDeviceMemory::getDevice()']]], ['getdim',['getDim',['../classfaiss_1_1gpu_1_1IVFBase.html#a4d44e8aebc380b7c846a8d8e6e835540',1,'faiss::gpu::IVFBase']]], ['getgpudata',['getGpuData',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a310b00d4443920a855b11276d488c9a7',1,'faiss::gpu::GpuIndexFlat']]], @@ -21,12 +29,15 @@ var searchData= ['getlistlength',['getListLength',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ab7f77961857e560b4dbb81888a8c8bf8',1,'faiss::gpu::GpuIndexIVFPQ::getListLength()'],['../classfaiss_1_1gpu_1_1IVFBase.html#a7b1ee21f9919fb077db5e48e91943582',1,'faiss::gpu::IVFBase::getListLength()']]], ['getlistvectors',['getListVectors',['../classfaiss_1_1gpu_1_1IVFFlat.html#a78473b609750b8ec7dfe3d137f50c650',1,'faiss::gpu::IVFFlat']]], ['getmemory',['getMemory',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a4adf60b9a0561e6319aa5cb7f42558d7',1,'faiss::gpu::DeviceMemory::getMemory()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#a9d9a5dcdb2d016cf00d14b8831db638b',1,'faiss::gpu::StackDeviceMemory::getMemory()']]], + ['getmemorymanager',['getMemoryManager',['../classfaiss_1_1gpu_1_1GpuResources.html#a7fec58e9414f313fde4988a62f06cfab',1,'faiss::gpu::GpuResources::getMemoryManager()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a35da92117dd4b47ee773444af716d634',1,'faiss::gpu::StandardGpuResources::getMemoryManager()']]], + ['getmemorymanagercurrentdevice',['getMemoryManagerCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a1dda2dc3db1bd62cde6657c5cdbfb6e1',1,'faiss::gpu::GpuResources']]], ['getmillisecs',['getmillisecs',['../namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb',1,'faiss']]], ['getminpagingsize',['getMinPagingSize',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a44532c7e5165d36e5da57272d37544ae',1,'faiss::gpu::GpuIndexFlat']]], ['getnumlists',['getNumLists',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a43a63e93d55b79eac38173f219743ddf',1,'faiss::gpu::GpuIndexIVF::getNumLists()'],['../classfaiss_1_1gpu_1_1IVFBase.html#abd66dc9d32e6150b930d78f74d7dd2d7',1,'faiss::gpu::IVFBase::getNumLists()']]], ['getnumprobes',['getNumProbes',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a13bce124f8acada641daf60d6edddb33',1,'faiss::gpu::GpuIndexIVF']]], ['getnumsubquantizers',['getNumSubQuantizers',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a3869ea7898487334fb67ee499f38988d',1,'faiss::gpu::GpuIndexIVFPQ']]], ['getnumvecs',['getNumVecs',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a51b5aa0d68670ec7ccb32b0353c7387f',1,'faiss::gpu::GpuIndexFlat']]], + ['getpinnedmemory',['getPinnedMemory',['../classfaiss_1_1gpu_1_1GpuResources.html#ad1b018745239e03d0044b659335c17a8',1,'faiss::gpu::GpuResources::getPinnedMemory()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#ae7418f127cac2ac663ac0ae2e6f88e8d',1,'faiss::gpu::StandardGpuResources::getPinnedMemory()']]], ['getpqcentroids',['getPQCentroids',['../classfaiss_1_1gpu_1_1IVFPQ.html#a3e8bff50f894c243c62e832f923e88e7',1,'faiss::gpu::IVFPQ']]], ['getprecomputedcodes',['getPrecomputedCodes',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a679b0aaa229d571aeb842673e3493cc5',1,'faiss::gpu::GpuIndexIVFPQ']]], ['getquantizer',['getQuantizer',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#afe6eb789377072b309d7a385aa0d1c5e',1,'faiss::gpu::GpuIndexIVF']]], @@ -44,8 +55,8 @@ var searchData= ['gpuindexflatconfig',['GpuIndexFlatConfig',['../structfaiss_1_1gpu_1_1GpuIndexFlatConfig.html',1,'faiss::gpu']]], ['gpuindexflatip',['GpuIndexFlatIP',['../classfaiss_1_1gpu_1_1GpuIndexFlatIP.html',1,'faiss::gpu']]], ['gpuindexflatip',['GpuIndexFlatIP',['../classfaiss_1_1gpu_1_1GpuIndexFlatIP.html#a5f8c6e1a31cae06f6a5bcd1828307304',1,'faiss::gpu::GpuIndexFlatIP::GpuIndexFlatIP(GpuResources *resources, faiss::IndexFlatIP *index, GpuIndexFlatConfig config=GpuIndexFlatConfig())'],['../classfaiss_1_1gpu_1_1GpuIndexFlatIP.html#ad7ef0af6369d33f136579340f5bc8e0a',1,'faiss::gpu::GpuIndexFlatIP::GpuIndexFlatIP(GpuResources *resources, int dims, GpuIndexFlatConfig config=GpuIndexFlatConfig())']]], - ['gpuindexflatl2',['GpuIndexFlatL2',['../classfaiss_1_1gpu_1_1GpuIndexFlatL2.html',1,'faiss::gpu']]], ['gpuindexflatl2',['GpuIndexFlatL2',['../classfaiss_1_1gpu_1_1GpuIndexFlatL2.html#aed22de4a439fa0b2f560e3c716a7c626',1,'faiss::gpu::GpuIndexFlatL2::GpuIndexFlatL2(GpuResources *resources, faiss::IndexFlatL2 *index, GpuIndexFlatConfig config=GpuIndexFlatConfig())'],['../classfaiss_1_1gpu_1_1GpuIndexFlatL2.html#a514832ff1173021362b583a6b2941b87',1,'faiss::gpu::GpuIndexFlatL2::GpuIndexFlatL2(GpuResources *resources, int dims, GpuIndexFlatConfig config=GpuIndexFlatConfig())']]], + ['gpuindexflatl2',['GpuIndexFlatL2',['../classfaiss_1_1gpu_1_1GpuIndexFlatL2.html',1,'faiss::gpu']]], ['gpuindexivf',['GpuIndexIVF',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html',1,'faiss::gpu']]], ['gpuindexivfconfig',['GpuIndexIVFConfig',['../structfaiss_1_1gpu_1_1GpuIndexIVFConfig.html',1,'faiss::gpu']]], ['gpuindexivfflat',['GpuIndexIVFFlat',['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a33fe6f13e34cd0708ae981f0c0b381ef',1,'faiss::gpu::GpuIndexIVFFlat::GpuIndexIVFFlat(GpuResources *resources, const faiss::IndexIVFFlat *index, GpuIndexIVFFlatConfig config=GpuIndexIVFFlatConfig())'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a94ca17bf69483ae7b9067f01da50d642',1,'faiss::gpu::GpuIndexIVFFlat::GpuIndexIVFFlat(GpuResources *resources, int dims, int nlist, faiss::MetricType metric, GpuIndexIVFFlatConfig config=GpuIndexIVFFlatConfig())']]], diff --git a/docs/html/search/all_68.js b/docs/html/search/all_68.js index 4b3d543bf..1e42eabb3 100644 --- a/docs/html/search/all_68.js +++ b/docs/html/search/all_68.js @@ -9,6 +9,7 @@ var searchData= ['hammingcomputer4',['HammingComputer4',['../structfaiss_1_1HammingComputer4.html',1,'faiss']]], ['hammingcomputer64',['HammingComputer64',['../structfaiss_1_1HammingComputer64.html',1,'faiss']]], ['hammingcomputer8',['HammingComputer8',['../structfaiss_1_1HammingComputer8.html',1,'faiss']]], + ['hammingcomputerdefault',['HammingComputerDefault',['../structfaiss_1_1HammingComputerDefault.html',1,'faiss']]], ['hammingcomputerm4',['HammingComputerM4',['../structfaiss_1_1HammingComputerM4.html',1,'faiss']]], ['hammingcomputerm8',['HammingComputerM8',['../structfaiss_1_1HammingComputerM8.html',1,'faiss']]], ['hammings',['hammings',['../namespacefaiss.html#a0832c5ab58f4d1a340b0bde273c5b501',1,'faiss']]], diff --git a/docs/html/search/all_6d.js b/docs/html/search/all_6d.js index ed534e254..436ca502c 100644 --- a/docs/html/search/all_6d.js +++ b/docs/html/search/all_6d.js @@ -20,7 +20,7 @@ var searchData= ['memoryspace',['memorySpace',['../structfaiss_1_1gpu_1_1GpuIndexConfig.html#adf7c9461009108a9a433a077ab322d2e',1,'faiss::gpu::GpuIndexConfig']]], ['memoryspace_5f',['memorySpace_',['../classfaiss_1_1gpu_1_1GpuIndex.html#af304169eac7781b573f76d545f37b7d9',1,'faiss::gpu::GpuIndex']]], ['merge_5ffrom',['merge_from',['../structfaiss_1_1IndexIVF.html#a0f22cc237c30c935df5b6560aecf8f01',1,'faiss::IndexIVF']]], - ['merge_5ffrom_5fresiduals',['merge_from_residuals',['../structfaiss_1_1IndexIVF.html#aacaf0b2529a9d9def094ea3728a12824',1,'faiss::IndexIVF::merge_from_residuals()'],['../structfaiss_1_1IndexIVFFlat.html#a8fc1695a87f33db1a16f8c50c3344cd3',1,'faiss::IndexIVFFlat::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQ.html#a6b8964e2da609a9261a8a35ae347ecb2',1,'faiss::IndexIVFPQ::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQR.html#af6c7ee3bc917cc5d4ab04ff64269ee06',1,'faiss::IndexIVFPQR::merge_from_residuals()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals(IndexIVF &other) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals(IndexIVF &other) override']]], + ['merge_5ffrom_5fresiduals',['merge_from_residuals',['../structfaiss_1_1IndexIVF.html#aacaf0b2529a9d9def094ea3728a12824',1,'faiss::IndexIVF::merge_from_residuals()'],['../structfaiss_1_1IndexIVFFlat.html#a8fc1695a87f33db1a16f8c50c3344cd3',1,'faiss::IndexIVFFlat::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQ.html#a6b8964e2da609a9261a8a35ae347ecb2',1,'faiss::IndexIVFPQ::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQR.html#af6c7ee3bc917cc5d4ab04ff64269ee06',1,'faiss::IndexIVFPQR::merge_from_residuals()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals()']]], ['merge_5fresult_5ftable_5fwith',['merge_result_table_with',['../namespacefaiss.html#afb7b33f6892678ba79aaf5e71777837c',1,'faiss']]], ['merge_5fwith',['merge_with',['../structfaiss_1_1OperatingPoints.html#a84baddccd8b803dee460739f8bcbc0c9',1,'faiss::OperatingPoints']]], ['mergewarpq',['mergeWarpQ',['../structfaiss_1_1gpu_1_1BlockSelect.html#a08aa08d16ec29c7b7dccc65edd5115cd',1,'faiss::gpu::BlockSelect::mergeWarpQ()'],['../structfaiss_1_1gpu_1_1WarpSelect.html#a408cbf9a09094078cb62018400f30076',1,'faiss::gpu::WarpSelect::mergeWarpQ()']]], diff --git a/docs/html/search/all_71.js b/docs/html/search/all_71.js index 8fde4533e..134390e8f 100644 --- a/docs/html/search/all_71.js +++ b/docs/html/search/all_71.js @@ -1,12 +1,12 @@ var searchData= [ - ['qt_5f4bit',['QT_4bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea7cdbb1cb1c21f8f5866f28aa564b4c0b',1,'faiss::ScalarQuantizer']]], - ['qt_5f8bit',['QT_8bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eae2f5d4b1376630eb0ea76600c95bd9a2',1,'faiss::ScalarQuantizer']]], - ['qt_5f8bit_5funiform',['QT_8bit_uniform',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eae121980fe6d146604e3086889ebc5754',1,'faiss::ScalarQuantizer']]], + ['qt_5f4bit',['QT_4bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eacd3d1bd71533a7bc52149e4b3d1db13b',1,'faiss::ScalarQuantizer']]], + ['qt_5f8bit',['QT_8bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea1650389e3efa052ff60177d502328a2c',1,'faiss::ScalarQuantizer']]], + ['qt_5f8bit_5funiform',['QT_8bit_uniform',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea029f07a15ea64e7e73daaf9633ac429a',1,'faiss::ScalarQuantizer']]], ['quantizer',['quantizer',['../structfaiss_1_1IndexIVF.html#a4b40cc7a70dff41196a3b8769586667a',1,'faiss::IndexIVF']]], ['quantizer_5f',['quantizer_',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#aaa7dd748e3cbd7ef68f2e384ac503eab',1,'faiss::gpu::GpuIndexIVF::quantizer_()'],['../classfaiss_1_1gpu_1_1IVFBase.html#a878114abdba07c9cf7735f9c0ed594c3',1,'faiss::gpu::IVFBase::quantizer_()']]], ['quantizer_5ftrains_5falone',['quantizer_trains_alone',['../structfaiss_1_1IndexIVF.html#a23ee7f75f8be4472a17778f2b33875de',1,'faiss::IndexIVF']]], - ['quantizertype',['QuantizerType',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer::QuantizerType()'],['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer::QuantizerType()']]], + ['quantizertype',['QuantizerType',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer']]], ['query',['query',['../classfaiss_1_1gpu_1_1IVFFlat.html#a6652ca90a8a30512104fc909f0a0a6b8',1,'faiss::gpu::IVFFlat::query()'],['../classfaiss_1_1gpu_1_1IVFPQ.html#ab0c458aab9a3d903f31b0e63ce16e623',1,'faiss::gpu::IVFPQ::query()']]], ['queryresult',['QueryResult',['../structfaiss_1_1RangeSearchPartialResult_1_1QueryResult.html',1,'faiss::RangeSearchPartialResult']]] ]; diff --git a/docs/html/search/all_72.js b/docs/html/search/all_72.js index 82d8dd5e0..fa8448054 100644 --- a/docs/html/search/all_72.js +++ b/docs/html/search/all_72.js @@ -15,7 +15,7 @@ var searchData= ['rangesearchpartialresult',['RangeSearchPartialResult',['../structfaiss_1_1RangeSearchPartialResult.html',1,'faiss']]], ['rangesearchresult',['RangeSearchResult',['../structfaiss_1_1RangeSearchResult.html#a46e9fa31c3e232249cef508f357d856c',1,'faiss::RangeSearchResult']]], ['rangesearchresult',['RangeSearchResult',['../structfaiss_1_1RangeSearchResult.html',1,'faiss']]], - ['rangestat',['RangeStat',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer::RangeStat()'],['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer::RangeStat()']]], + ['rangestat',['RangeStat',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer']]], ['rankingscore2',['RankingScore2',['../structfaiss_1_1RankingScore2.html',1,'faiss']]], ['ranklist_5fhandle_5fties',['ranklist_handle_ties',['../namespacefaiss.html#ae0ee1b6fbd3d6da0f1a3550a780ca24c',1,'faiss']]], ['ranklist_5fintersection_5fsize',['ranklist_intersection_size',['../namespacefaiss.html#a8dbc652ba48d41f126b8815004899448',1,'faiss']]], @@ -44,9 +44,9 @@ var searchData= ['reverse_5ftransform',['reverse_transform',['../structfaiss_1_1VectorTransform.html#a101ce54f1c60df19478801aa942470d9',1,'faiss::VectorTransform::reverse_transform()'],['../structfaiss_1_1RandomRotationMatrix.html#a3ad86e9ae3bdc2090c1f5fc62a335c16',1,'faiss::RandomRotationMatrix::reverse_transform()'],['../structfaiss_1_1PCAMatrix.html#abf427521a66cbfaaf0b7aae16bcb6e93',1,'faiss::PCAMatrix::reverse_transform()'],['../structfaiss_1_1OPQMatrix.html#a8e61a84ea6bcbdee1809028b6aaa3aae',1,'faiss::OPQMatrix::reverse_transform()'],['../structfaiss_1_1RemapDimensionsTransform.html#a2fc83e79e4d3c7853bfd6931cbbaf82a',1,'faiss::RemapDimensionsTransform::reverse_transform()']]], ['rotate_5fdata',['rotate_data',['../structfaiss_1_1IndexLSH.html#a71e9142e1256705f125ded9d647f4497',1,'faiss::IndexLSH']]], ['rrot',['rrot',['../structfaiss_1_1IndexLSH.html#a71c8aa08d3bd0483ccc0f11c22cd3cd8',1,'faiss::IndexLSH']]], - ['rs_5fmeanstd',['RS_meanstd',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ad64366c7a0eea89fb52b177f251e687c',1,'faiss::ScalarQuantizer']]], - ['rs_5fminmax',['RS_minmax',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06a4c0f67a6585c03b1e4039a23825d7df8',1,'faiss::ScalarQuantizer']]], - ['rs_5foptim',['RS_optim',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06af1df5f45cf110c5c235c413ca31797a7',1,'faiss::ScalarQuantizer']]], - ['rs_5fquantiles',['RS_quantiles',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06a895bd1d41b5b36a1537df9a515a416f7',1,'faiss::ScalarQuantizer']]], + ['rs_5fmeanstd',['RS_meanstd',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06afb4b9f4ee9003fa0193e6de69632f7a0',1,'faiss::ScalarQuantizer']]], + ['rs_5fminmax',['RS_minmax',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06aa52f2f14616c61c04baf6323d43588fd',1,'faiss::ScalarQuantizer']]], + ['rs_5foptim',['RS_optim',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ab0709ff74c1b882b64a7fdd7ca5df9a3',1,'faiss::ScalarQuantizer']]], + ['rs_5fquantiles',['RS_quantiles',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ae41cccec3a7acbcb3a47fa63c2bfb4c8',1,'faiss::ScalarQuantizer']]], ['runonindex',['runOnIndex',['../classfaiss_1_1gpu_1_1IndexProxy.html#a4efa3134256a6cd6a98c45184a7e8dbf',1,'faiss::gpu::IndexProxy']]] ]; diff --git a/docs/html/search/all_73.js b/docs/html/search/all_73.js index e0bef4132..2c64086e1 100644 --- a/docs/html/search/all_73.js +++ b/docs/html/search/all_73.js @@ -8,7 +8,7 @@ var searchData= ['score3computer',['Score3Computer',['../structfaiss_1_1Score3Computer.html',1,'faiss']]], ['score3computer_3c_20float_2c_20double_20_3e',['Score3Computer< float, double >',['../structfaiss_1_1Score3Computer.html',1,'faiss']]], ['sdc_5ftable',['sdc_table',['../structfaiss_1_1ProductQuantizer.html#a6bd65fb4407452f73acb7242931d09e4',1,'faiss::ProductQuantizer']]], - ['search',['search',['../classfaiss_1_1gpu_1_1GpuIndex.html#a6f1cadb5e8970c9c1fdf15eddb9d874f',1,'faiss::gpu::GpuIndex::search()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ac0f0301829363f920e619f673a4d97f3',1,'faiss::gpu::GpuIndexFlat::search()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#a25ed68079907eeeca9d441cdd4fc0740',1,'faiss::gpu::IndexProxy::search()'],['../structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7',1,'faiss::Index::search()'],['../structfaiss_1_1IndexFlat.html#a85510d70f4675197df9988651e4692c9',1,'faiss::IndexFlat::search()'],['../structfaiss_1_1IndexFlatL2BaseShift.html#a16e9bf1aec9d18b3ebbe78fea6bfecc0',1,'faiss::IndexFlatL2BaseShift::search()'],['../structfaiss_1_1IndexRefineFlat.html#ad04444de1e2c26c463cc52f3c076dd41',1,'faiss::IndexRefineFlat::search()'],['../structfaiss_1_1IndexFlat1D.html#a65736f2900865cd156faba4fcd260d05',1,'faiss::IndexFlat1D::search()'],['../structfaiss_1_1IndexIVFFlat.html#acd2bdb06fcbe9d1f5799cf78aa6cdf0d',1,'faiss::IndexIVFFlat::search()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#aac063e96413e0e90d87898df8a60088b',1,'faiss::IndexIVFFlatIPBounds::search()'],['../structfaiss_1_1IndexIVFPQ.html#afa7c9a7ae0316d2a05acb60ab2b7a31a',1,'faiss::IndexIVFPQ::search()'],['../structfaiss_1_1IndexIVFPQR.html#a3e982ee6f1a3a025148270701867d04f',1,'faiss::IndexIVFPQR::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexLSH.html#a66b6afb56afa1f58e2d93abfdfd223ee',1,'faiss::IndexLSH::search()'],['../structfaiss_1_1IndexPQ.html#a491ba3ed34093513e6a850fbca0abdd2',1,'faiss::IndexPQ::search()'],['../structfaiss_1_1MultiIndexQuantizer.html#a999ee03f4e65f453377e209d10e25681',1,'faiss::MultiIndexQuantizer::search()'],['../structfaiss_1_1IndexScalarQuantizer.html#abf24732c29106bb808148c3d30599662',1,'faiss::IndexScalarQuantizer::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexIDMap.html#a2f36fa9150a465b48952afbba856e2a1',1,'faiss::IndexIDMap::search()'],['../structfaiss_1_1IndexShards.html#a83391295650370e8987358a898bb2cca',1,'faiss::IndexShards::search()'],['../structfaiss_1_1IndexSplitVectors.html#a4a010daf51e44d9717e94400cc23c159',1,'faiss::IndexSplitVectors::search()'],['../structfaiss_1_1ProductQuantizer.html#a1ae7892a15b9f6809a3ba1a123a7831b',1,'faiss::ProductQuantizer::search()'],['../structfaiss_1_1IndexPreTransform.html#a7c2c820895d87083742969c281ae4911',1,'faiss::IndexPreTransform::search()']]], + ['search',['search',['../classfaiss_1_1gpu_1_1GpuIndex.html#a6f1cadb5e8970c9c1fdf15eddb9d874f',1,'faiss::gpu::GpuIndex::search()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ac0f0301829363f920e619f673a4d97f3',1,'faiss::gpu::GpuIndexFlat::search()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#a25ed68079907eeeca9d441cdd4fc0740',1,'faiss::gpu::IndexProxy::search()'],['../structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7',1,'faiss::Index::search()'],['../structfaiss_1_1IndexFlat.html#a85510d70f4675197df9988651e4692c9',1,'faiss::IndexFlat::search()'],['../structfaiss_1_1IndexFlatL2BaseShift.html#a16e9bf1aec9d18b3ebbe78fea6bfecc0',1,'faiss::IndexFlatL2BaseShift::search()'],['../structfaiss_1_1IndexRefineFlat.html#ad04444de1e2c26c463cc52f3c076dd41',1,'faiss::IndexRefineFlat::search()'],['../structfaiss_1_1IndexFlat1D.html#a65736f2900865cd156faba4fcd260d05',1,'faiss::IndexFlat1D::search()'],['../structfaiss_1_1IndexIVFFlat.html#acd2bdb06fcbe9d1f5799cf78aa6cdf0d',1,'faiss::IndexIVFFlat::search()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#aac063e96413e0e90d87898df8a60088b',1,'faiss::IndexIVFFlatIPBounds::search()'],['../structfaiss_1_1IndexIVFPQ.html#afa7c9a7ae0316d2a05acb60ab2b7a31a',1,'faiss::IndexIVFPQ::search()'],['../structfaiss_1_1IndexIVFPQR.html#a3e982ee6f1a3a025148270701867d04f',1,'faiss::IndexIVFPQR::search()'],['../structfaiss_1_1IndexLSH.html#a66b6afb56afa1f58e2d93abfdfd223ee',1,'faiss::IndexLSH::search()'],['../structfaiss_1_1IndexPQ.html#a491ba3ed34093513e6a850fbca0abdd2',1,'faiss::IndexPQ::search()'],['../structfaiss_1_1MultiIndexQuantizer.html#a999ee03f4e65f453377e209d10e25681',1,'faiss::MultiIndexQuantizer::search()'],['../structfaiss_1_1IndexScalarQuantizer.html#abf24732c29106bb808148c3d30599662',1,'faiss::IndexScalarQuantizer::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexIDMap.html#a2f36fa9150a465b48952afbba856e2a1',1,'faiss::IndexIDMap::search()'],['../structfaiss_1_1IndexShards.html#a83391295650370e8987358a898bb2cca',1,'faiss::IndexShards::search()'],['../structfaiss_1_1IndexSplitVectors.html#a4a010daf51e44d9717e94400cc23c159',1,'faiss::IndexSplitVectors::search()'],['../structfaiss_1_1ProductQuantizer.html#a1ae7892a15b9f6809a3ba1a123a7831b',1,'faiss::ProductQuantizer::search()'],['../structfaiss_1_1IndexPreTransform.html#a7c2c820895d87083742969c281ae4911',1,'faiss::IndexPreTransform::search()']]], ['search_5fip',['search_ip',['../structfaiss_1_1ProductQuantizer.html#a66be226806ca2abcaaf1653cdc690aa6',1,'faiss::ProductQuantizer']]], ['search_5fknn_5finner_5fproduct',['search_knn_inner_product',['../structfaiss_1_1IndexIVFFlat.html#a5ac4f051396a1535426baec8f401aa93',1,'faiss::IndexIVFFlat']]], ['search_5fknn_5fl2sqr',['search_knn_L2sqr',['../structfaiss_1_1IndexIVFFlat.html#a9ca8cc3ca71ff91f1e5e2db3b8ead615',1,'faiss::IndexIVFFlat']]], @@ -27,6 +27,8 @@ var searchData= ['set_5flims',['set_lims',['../structfaiss_1_1RangeSearchPartialResult.html#ab6a385008493c7b630e4e7bc56e3da74',1,'faiss::RangeSearchPartialResult']]], ['set_5fparams',['set_params',['../structfaiss_1_1ProductQuantizer.html#ad291f113c6d44a634ddc1972f9a3c775',1,'faiss::ProductQuantizer']]], ['set_5fresult',['set_result',['../structfaiss_1_1RangeSearchPartialResult.html#aa6639358995ac081f8a931a7790d0caf',1,'faiss::RangeSearchPartialResult']]], + ['setdefaultnullstreamalldevices',['setDefaultNullStreamAllDevices',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a5374f336f1957c266d7a5c185eb962a1',1,'faiss::gpu::StandardGpuResources']]], + ['setdefaultstream',['setDefaultStream',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a5924b424c36dba8300866f1b98c438cb',1,'faiss::gpu::StandardGpuResources']]], ['setminpagingsize',['setMinPagingSize',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a752f8129ccb94fa0c6f346ae03ff536d',1,'faiss::gpu::GpuIndexFlat']]], ['setnumprobes',['setNumProbes',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a1efac4b9801d57fa6d0085d6aed9c1f2',1,'faiss::gpu::GpuIndexIVF']]], ['setpinnedmemory',['setPinnedMemory',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#af9acb23ac323f85fa5dab4ed968ccd51',1,'faiss::gpu::StandardGpuResources']]], @@ -66,5 +68,7 @@ var searchData= ['subtensor_3c_20tensortype_2c_200_2c_20ptrtraits_20_3e',['SubTensor< TensorType, 0, PtrTraits >',['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html',1,'faiss::gpu::detail']]], ['subtensor_3c_20tensortype_2c_201_2c_20ptrtraits_20_3e',['SubTensor< TensorType, 1, PtrTraits >',['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a5aa8367d35e6c281c29855d7cf24bd6d',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >']]], ['subtensor_3c_20tensortype_2c_20subdim_2b1_2c_20ptrtraits_20_3e',['SubTensor< TensorType, SubDim+1, PtrTraits >',['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a33929e7387099e4e49be139ba467ebfc',1,'faiss::gpu::detail::SubTensor']]], - ['sum',['Sum',['../structfaiss_1_1gpu_1_1Sum.html',1,'faiss::gpu']]] + ['sum',['Sum',['../structfaiss_1_1gpu_1_1Sum.html',1,'faiss::gpu']]], + ['syncdefaultstream',['syncDefaultStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a130deab9f6d49cbdde8f9da45ce868fd',1,'faiss::gpu::GpuResources']]], + ['syncdefaultstreamcurrentdevice',['syncDefaultStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#adf6a5653ec2bbb0e9d58a0e1dd73897f',1,'faiss::gpu::GpuResources']]] ]; diff --git a/docs/html/search/all_74.js b/docs/html/search/all_74.js index 6546f6a92..b74d19cb6 100644 --- a/docs/html/search/all_74.js +++ b/docs/html/search/all_74.js @@ -19,16 +19,16 @@ var searchData= ['togpucloner',['ToGpuCloner',['../structfaiss_1_1gpu_1_1ToGpuCloner.html',1,'faiss::gpu']]], ['togpuclonermultiple',['ToGpuClonerMultiple',['../structfaiss_1_1gpu_1_1ToGpuClonerMultiple.html',1,'faiss::gpu']]], ['tostring',['toString',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a35640c7cd2d5be8a95c4e841f02c3f3e',1,'faiss::gpu::DeviceMemory::toString()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#ae4fab99808556307b17241c45503a4b0',1,'faiss::gpu::StackDeviceMemory::toString()'],['../structfaiss_1_1gpu_1_1StackDeviceMemory_1_1Stack.html#a1c91f4d50ecb8bb659054227d32fb47b',1,'faiss::gpu::StackDeviceMemory::Stack::toString()']]], - ['train',['train',['../structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf',1,'faiss::Clustering::train()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a0e74fad76628ddfb5ae3dc1d1c69f7e8',1,'faiss::gpu::GpuIndexFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a3c5b3760acb01814892fe93c72f08304',1,'faiss::gpu::GpuIndexIVFFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ac4814acafa4bc340a4c4bdcafd469b56',1,'faiss::gpu::GpuIndexIVFPQ::train()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#aee6fe7e95b02238103a6a2d1f6d2cd00',1,'faiss::gpu::IndexProxy::train()'],['../structfaiss_1_1Index.html#a8f67dfd73993e192dc78f2c93d9d9532',1,'faiss::Index::train()'],['../structfaiss_1_1IndexRefineFlat.html#a79c4c9b9ffabc4460ef4def6eb962e68',1,'faiss::IndexRefineFlat::train()'],['../structfaiss_1_1IndexIVF.html#a7a1d5eec194db0977b2318c6ed6a2b86',1,'faiss::IndexIVF::train()'],['../structfaiss_1_1IndexIVFPQCompact.html#a0ef8132fae22a50616fe1201c8b20588',1,'faiss::IndexIVFPQCompact::train()'],['../structfaiss_1_1IndexLSH.html#a01f569a16a812aa3945b8a0b64eaff06',1,'faiss::IndexLSH::train()'],['../structfaiss_1_1IndexPQ.html#a87898add5ab4d86ba901ca79778fc11e',1,'faiss::IndexPQ::train()'],['../structfaiss_1_1MultiIndexQuantizer.html#a6fa1d1a295eb2d4377b8de5096ab3ef4',1,'faiss::MultiIndexQuantizer::train()'],['../structfaiss_1_1IndexScalarQuantizer.html#a300647e9cdac9acd160f2c55c610056b',1,'faiss::IndexScalarQuantizer::train()'],['../structfaiss_1_1IndexIDMap.html#ac873cb03aa323a06dca5d6f3af5fe559',1,'faiss::IndexIDMap::train()'],['../structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b',1,'faiss::IndexShards::train()'],['../structfaiss_1_1IndexSplitVectors.html#aafa4c780e325855fe247052453967845',1,'faiss::IndexSplitVectors::train()'],['../structfaiss_1_1VectorTransform.html#a7350d4dd28d60866d55ba4f75d2da84c',1,'faiss::VectorTransform::train()'],['../structfaiss_1_1PCAMatrix.html#a8f2dd12da8dce3cbeb22da9c5d4ec3e7',1,'faiss::PCAMatrix::train()'],['../structfaiss_1_1OPQMatrix.html#a1e314577db0c6cd4a709503f73eb71e2',1,'faiss::OPQMatrix::train()'],['../structfaiss_1_1IndexPreTransform.html#a416aaf28d7a533dcf7d2d7de434e993c',1,'faiss::IndexPreTransform::train()']]], + ['train',['train',['../structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf',1,'faiss::Clustering::train()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a0e74fad76628ddfb5ae3dc1d1c69f7e8',1,'faiss::gpu::GpuIndexFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a3c5b3760acb01814892fe93c72f08304',1,'faiss::gpu::GpuIndexIVFFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ac4814acafa4bc340a4c4bdcafd469b56',1,'faiss::gpu::GpuIndexIVFPQ::train()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#aee6fe7e95b02238103a6a2d1f6d2cd00',1,'faiss::gpu::IndexProxy::train()'],['../structfaiss_1_1Index.html#a1ffe916c958605c38b0b1bfad42485e4',1,'faiss::Index::train()'],['../structfaiss_1_1IndexRefineFlat.html#a79c4c9b9ffabc4460ef4def6eb962e68',1,'faiss::IndexRefineFlat::train()'],['../structfaiss_1_1IndexIVF.html#a7a1d5eec194db0977b2318c6ed6a2b86',1,'faiss::IndexIVF::train()'],['../structfaiss_1_1IndexIVFPQCompact.html#a0ef8132fae22a50616fe1201c8b20588',1,'faiss::IndexIVFPQCompact::train()'],['../structfaiss_1_1IndexLSH.html#a01f569a16a812aa3945b8a0b64eaff06',1,'faiss::IndexLSH::train()'],['../structfaiss_1_1IndexPQ.html#a87898add5ab4d86ba901ca79778fc11e',1,'faiss::IndexPQ::train()'],['../structfaiss_1_1MultiIndexQuantizer.html#a6fa1d1a295eb2d4377b8de5096ab3ef4',1,'faiss::MultiIndexQuantizer::train()'],['../structfaiss_1_1IndexScalarQuantizer.html#a300647e9cdac9acd160f2c55c610056b',1,'faiss::IndexScalarQuantizer::train()'],['../structfaiss_1_1IndexIDMap.html#ac873cb03aa323a06dca5d6f3af5fe559',1,'faiss::IndexIDMap::train()'],['../structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b',1,'faiss::IndexShards::train()'],['../structfaiss_1_1IndexSplitVectors.html#aafa4c780e325855fe247052453967845',1,'faiss::IndexSplitVectors::train()'],['../structfaiss_1_1VectorTransform.html#a7350d4dd28d60866d55ba4f75d2da84c',1,'faiss::VectorTransform::train()'],['../structfaiss_1_1PCAMatrix.html#a8f2dd12da8dce3cbeb22da9c5d4ec3e7',1,'faiss::PCAMatrix::train()'],['../structfaiss_1_1OPQMatrix.html#a1e314577db0c6cd4a709503f73eb71e2',1,'faiss::OPQMatrix::train()'],['../structfaiss_1_1IndexPreTransform.html#a416aaf28d7a533dcf7d2d7de434e993c',1,'faiss::IndexPreTransform::train()']]], ['train_5fhot_5fstart',['Train_hot_start',['../structfaiss_1_1ProductQuantizer.html#a3a41c6286095e731be744548d9535a35a4960d143d2aa49cf92028cf3470c47a0',1,'faiss::ProductQuantizer']]], ['train_5fhypercube',['Train_hypercube',['../structfaiss_1_1ProductQuantizer.html#a3a41c6286095e731be744548d9535a35ac8040c8792a014a2ea7188583575013e',1,'faiss::ProductQuantizer']]], ['train_5fhypercube_5fpca',['Train_hypercube_pca',['../structfaiss_1_1ProductQuantizer.html#a3a41c6286095e731be744548d9535a35a6b330bc2cfa02a402d002d657f214931',1,'faiss::ProductQuantizer']]], - ['train_5fresidual',['train_residual',['../structfaiss_1_1IndexIVF.html#a567ef760fd09d09ce2ee4f4e6c2d7280',1,'faiss::IndexIVF::train_residual()'],['../structfaiss_1_1IndexIVFPQ.html#af6565a5d8bab7be3df19c50d235bd662',1,'faiss::IndexIVFPQ::train_residual()'],['../structfaiss_1_1IndexIVFPQR.html#a68ed7cae5bec89fcdcb6a1d2addbd5a8',1,'faiss::IndexIVFPQR::train_residual()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual(idx_t n, const float *x) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual(idx_t n, const float *x) override']]], + ['train_5fresidual',['train_residual',['../structfaiss_1_1IndexIVF.html#a567ef760fd09d09ce2ee4f4e6c2d7280',1,'faiss::IndexIVF::train_residual()'],['../structfaiss_1_1IndexIVFPQ.html#af6565a5d8bab7be3df19c50d235bd662',1,'faiss::IndexIVFPQ::train_residual()'],['../structfaiss_1_1IndexIVFPQR.html#a68ed7cae5bec89fcdcb6a1d2addbd5a8',1,'faiss::IndexIVFPQR::train_residual()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual()']]], ['train_5fresidual_5fo',['train_residual_o',['../structfaiss_1_1IndexIVFPQ.html#a4e06f04853dcb424dc393de5f641e917',1,'faiss::IndexIVFPQ']]], ['train_5fshared',['Train_shared',['../structfaiss_1_1ProductQuantizer.html#a3a41c6286095e731be744548d9535a35aa1aefc6c08f0ca974de9f59d9557aa0d',1,'faiss::ProductQuantizer']]], ['train_5fthresholds',['train_thresholds',['../structfaiss_1_1IndexLSH.html#a5d4d6ea1fc709605d5b2061d1bce27d6',1,'faiss::IndexLSH']]], ['train_5ftype_5ft',['train_type_t',['../structfaiss_1_1ProductQuantizer.html#a3a41c6286095e731be744548d9535a35',1,'faiss::ProductQuantizer']]], - ['trained',['trained',['../structfaiss_1_1ScalarQuantizer.html#a64d1560806e6746d6cd1fee089c6a13f',1,'faiss::ScalarQuantizer']]], + ['trained',['trained',['../structfaiss_1_1ScalarQuantizer.html#a30b411b10780a74079bbbfaff678c86f',1,'faiss::ScalarQuantizer']]], ['transfer_5fthresholds',['transfer_thresholds',['../structfaiss_1_1IndexLSH.html#ac95fb0b3cb8fe2b265be9822c41c448c',1,'faiss::IndexLSH']]], ['transform_5ftranspose',['transform_transpose',['../structfaiss_1_1LinearTransform.html#a1642efca4f5eb524c29722b0441c4d13',1,'faiss::LinearTransform']]], ['transpose',['transpose',['../classfaiss_1_1gpu_1_1Tensor.html#aa8b48391a291a7e214c7204d81cd9d73',1,'faiss::gpu::Tensor']]] diff --git a/docs/html/search/classes_68.js b/docs/html/search/classes_68.js index 2852bd351..a1ac4903a 100644 --- a/docs/html/search/classes_68.js +++ b/docs/html/search/classes_68.js @@ -7,6 +7,7 @@ var searchData= ['hammingcomputer4',['HammingComputer4',['../structfaiss_1_1HammingComputer4.html',1,'faiss']]], ['hammingcomputer64',['HammingComputer64',['../structfaiss_1_1HammingComputer64.html',1,'faiss']]], ['hammingcomputer8',['HammingComputer8',['../structfaiss_1_1HammingComputer8.html',1,'faiss']]], + ['hammingcomputerdefault',['HammingComputerDefault',['../structfaiss_1_1HammingComputerDefault.html',1,'faiss']]], ['hammingcomputerm4',['HammingComputerM4',['../structfaiss_1_1HammingComputerM4.html',1,'faiss']]], ['hammingcomputerm8',['HammingComputerM8',['../structfaiss_1_1HammingComputerM8.html',1,'faiss']]], ['heaparray',['HeapArray',['../structfaiss_1_1HeapArray.html',1,'faiss']]], diff --git a/docs/html/search/enums_71.js b/docs/html/search/enums_71.js index dd3ebb561..aaffbc743 100644 --- a/docs/html/search/enums_71.js +++ b/docs/html/search/enums_71.js @@ -1,4 +1,4 @@ var searchData= [ - ['quantizertype',['QuantizerType',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer::QuantizerType()'],['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer::QuantizerType()']]] + ['quantizertype',['QuantizerType',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952e',1,'faiss::ScalarQuantizer']]] ]; diff --git a/docs/html/search/enums_72.js b/docs/html/search/enums_72.js index 19d9edb19..f9aaa947a 100644 --- a/docs/html/search/enums_72.js +++ b/docs/html/search/enums_72.js @@ -1,4 +1,4 @@ var searchData= [ - ['rangestat',['RangeStat',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer::RangeStat()'],['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer::RangeStat()']]] + ['rangestat',['RangeStat',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06',1,'faiss::ScalarQuantizer']]] ]; diff --git a/docs/html/search/enumvalues_71.js b/docs/html/search/enumvalues_71.js index cf4210389..38c61affb 100644 --- a/docs/html/search/enumvalues_71.js +++ b/docs/html/search/enumvalues_71.js @@ -1,6 +1,6 @@ var searchData= [ - ['qt_5f4bit',['QT_4bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea7cdbb1cb1c21f8f5866f28aa564b4c0b',1,'faiss::ScalarQuantizer']]], - ['qt_5f8bit',['QT_8bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eae2f5d4b1376630eb0ea76600c95bd9a2',1,'faiss::ScalarQuantizer']]], - ['qt_5f8bit_5funiform',['QT_8bit_uniform',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eae121980fe6d146604e3086889ebc5754',1,'faiss::ScalarQuantizer']]] + ['qt_5f4bit',['QT_4bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952eacd3d1bd71533a7bc52149e4b3d1db13b',1,'faiss::ScalarQuantizer']]], + ['qt_5f8bit',['QT_8bit',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea1650389e3efa052ff60177d502328a2c',1,'faiss::ScalarQuantizer']]], + ['qt_5f8bit_5funiform',['QT_8bit_uniform',['../structfaiss_1_1ScalarQuantizer.html#a1201dbd1611fa5c10782ade5d0e4952ea029f07a15ea64e7e73daaf9633ac429a',1,'faiss::ScalarQuantizer']]] ]; diff --git a/docs/html/search/enumvalues_72.js b/docs/html/search/enumvalues_72.js index d590c9b06..4909f11db 100644 --- a/docs/html/search/enumvalues_72.js +++ b/docs/html/search/enumvalues_72.js @@ -1,7 +1,7 @@ var searchData= [ - ['rs_5fmeanstd',['RS_meanstd',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ad64366c7a0eea89fb52b177f251e687c',1,'faiss::ScalarQuantizer']]], - ['rs_5fminmax',['RS_minmax',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06a4c0f67a6585c03b1e4039a23825d7df8',1,'faiss::ScalarQuantizer']]], - ['rs_5foptim',['RS_optim',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06af1df5f45cf110c5c235c413ca31797a7',1,'faiss::ScalarQuantizer']]], - ['rs_5fquantiles',['RS_quantiles',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06a895bd1d41b5b36a1537df9a515a416f7',1,'faiss::ScalarQuantizer']]] + ['rs_5fmeanstd',['RS_meanstd',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06afb4b9f4ee9003fa0193e6de69632f7a0',1,'faiss::ScalarQuantizer']]], + ['rs_5fminmax',['RS_minmax',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06aa52f2f14616c61c04baf6323d43588fd',1,'faiss::ScalarQuantizer']]], + ['rs_5foptim',['RS_optim',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ab0709ff74c1b882b64a7fdd7ca5df9a3',1,'faiss::ScalarQuantizer']]], + ['rs_5fquantiles',['RS_quantiles',['../structfaiss_1_1ScalarQuantizer.html#a867ad0000e4ccfd40bbb1e01e7882d06ae41cccec3a7acbcb3a47fa63c2bfb4c8',1,'faiss::ScalarQuantizer']]] ]; diff --git a/docs/html/search/functions_61.js b/docs/html/search/functions_61.js index bc0a4aeb7..9962a8c76 100644 --- a/docs/html/search/functions_61.js +++ b/docs/html/search/functions_61.js @@ -5,7 +5,7 @@ var searchData= ['add_5fcore',['add_core',['../structfaiss_1_1IndexIVFFlat.html#aea729c3d8c70bdd93f8e413e834851a4',1,'faiss::IndexIVFFlat::add_core()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#a938285c16dafe294775643b820637444',1,'faiss::IndexIVFFlatIPBounds::add_core()'],['../structfaiss_1_1IndexIVFPQR.html#a186b746f22b65ddf416b1e821b0866ec',1,'faiss::IndexIVFPQR::add_core()']]], ['add_5fcore_5fo',['add_core_o',['../structfaiss_1_1IndexIVFPQ.html#ac0cb8421b9885d691696d2ff4f76894b',1,'faiss::IndexIVFPQ']]], ['add_5frange',['add_range',['../structfaiss_1_1ParameterSpace.html#aeaa27a715fe3fceef5da18d894976833',1,'faiss::ParameterSpace']]], - ['add_5fwith_5fids',['add_with_ids',['../classfaiss_1_1gpu_1_1GpuIndex.html#a47f6969fe60d82b8e3407557ba9eec88',1,'faiss::gpu::GpuIndex::add_with_ids()'],['../structfaiss_1_1Index.html#aa6931dfe054b33b02c842ff75f7a0c7f',1,'faiss::Index::add_with_ids()'],['../structfaiss_1_1IndexIVFFlat.html#a5f7356766632d3ce2838f285aa6b8e76',1,'faiss::IndexIVFFlat::add_with_ids()'],['../structfaiss_1_1IndexIVFPQ.html#a981c2748bfbd9b018494f119279a0342',1,'faiss::IndexIVFPQ::add_with_ids()'],['../structfaiss_1_1IndexIVFPQR.html#a4b6154a5194d574d037ba78c137a2fa5',1,'faiss::IndexIVFPQR::add_with_ids()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids(idx_t n, const float *x, const long *xids) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids(idx_t n, const float *x, const long *xids) override'],['../structfaiss_1_1IndexIDMap.html#aeace75e53648c052d05c357b744e090b',1,'faiss::IndexIDMap::add_with_ids()'],['../structfaiss_1_1IndexIDMap2.html#a33ff76975891695c2fa45ed26fc8eae9',1,'faiss::IndexIDMap2::add_with_ids()'],['../structfaiss_1_1IndexShards.html#a1f771d50133494f682f05c9ab9e39ad9',1,'faiss::IndexShards::add_with_ids()'],['../structfaiss_1_1IndexPreTransform.html#a07fef0553b2ef2907f394470f61898b2',1,'faiss::IndexPreTransform::add_with_ids()']]], + ['add_5fwith_5fids',['add_with_ids',['../classfaiss_1_1gpu_1_1GpuIndex.html#a47f6969fe60d82b8e3407557ba9eec88',1,'faiss::gpu::GpuIndex::add_with_ids()'],['../structfaiss_1_1Index.html#aa6931dfe054b33b02c842ff75f7a0c7f',1,'faiss::Index::add_with_ids()'],['../structfaiss_1_1IndexIVFFlat.html#a5f7356766632d3ce2838f285aa6b8e76',1,'faiss::IndexIVFFlat::add_with_ids()'],['../structfaiss_1_1IndexIVFPQ.html#a981c2748bfbd9b018494f119279a0342',1,'faiss::IndexIVFPQ::add_with_ids()'],['../structfaiss_1_1IndexIVFPQR.html#a4b6154a5194d574d037ba78c137a2fa5',1,'faiss::IndexIVFPQR::add_with_ids()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afa95c17787b7e3dbed9309b440d4d748',1,'faiss::IndexIVFScalarQuantizer::add_with_ids()'],['../structfaiss_1_1IndexIDMap.html#aeace75e53648c052d05c357b744e090b',1,'faiss::IndexIDMap::add_with_ids()'],['../structfaiss_1_1IndexIDMap2.html#a33ff76975891695c2fa45ed26fc8eae9',1,'faiss::IndexIDMap2::add_with_ids()'],['../structfaiss_1_1IndexShards.html#a1f771d50133494f682f05c9ab9e39ad9',1,'faiss::IndexShards::add_with_ids()'],['../structfaiss_1_1IndexPreTransform.html#a07fef0553b2ef2907f394470f61898b2',1,'faiss::IndexPreTransform::add_with_ids()']]], ['addcodevectorsfromcpu',['addCodeVectorsFromCpu',['../classfaiss_1_1gpu_1_1IVFFlat.html#a0bedde6dcb7c2f10f277461b97486f52',1,'faiss::gpu::IVFFlat::addCodeVectorsFromCpu()'],['../classfaiss_1_1gpu_1_1IVFPQ.html#a9992b38226dc8f92ca2691582fabb675',1,'faiss::gpu::IVFPQ::addCodeVectorsFromCpu()']]], ['addimpl_5f',['addImpl_',['../classfaiss_1_1gpu_1_1GpuIndex.html#a345819c6214c2a6eb7874dde1145036f',1,'faiss::gpu::GpuIndex::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ae0c916b911eda2f1a09a55f42ebc729c',1,'faiss::gpu::GpuIndexFlat::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a64bd89e18b8199ae7a88066890b10a0e',1,'faiss::gpu::GpuIndexIVFFlat::addImpl_()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a50e74f0621ca2fe5688825f434ad2bb2',1,'faiss::gpu::GpuIndexIVFPQ::addImpl_()']]], ['addindex',['addIndex',['../classfaiss_1_1gpu_1_1IndexProxy.html#af9bb81e75f8d5471094e4d4776a56f63',1,'faiss::gpu::IndexProxy']]], diff --git a/docs/html/search/functions_63.js b/docs/html/search/functions_63.js index 2824811ef..0a839f3e4 100644 --- a/docs/html/search/functions_63.js +++ b/docs/html/search/functions_63.js @@ -14,7 +14,7 @@ var searchData= ['compute',['compute',['../structfaiss_1_1Score3Computer.html#a07a726903418960a2d8000506d88f8e6',1,'faiss::Score3Computer']]], ['compute_5fcode',['compute_code',['../structfaiss_1_1ProductQuantizer.html#a08b130e3a21f2699a4e3bbec121fb838',1,'faiss::ProductQuantizer']]], ['compute_5fcode_5ffrom_5fdistance_5ftable',['compute_code_from_distance_table',['../structfaiss_1_1ProductQuantizer.html#a95060fedd7c09eb20e968fd2fdb4b316',1,'faiss::ProductQuantizer']]], - ['compute_5fcodes',['compute_codes',['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes(const float *x, uint8_t *codes, size_t n) const '],['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes(const float *x, uint8_t *codes, size_t n) const '],['../structfaiss_1_1ProductQuantizer.html#ae5a340ee5a4b1d35a565b167de2a2ef1',1,'faiss::ProductQuantizer::compute_codes()']]], + ['compute_5fcodes',['compute_codes',['../structfaiss_1_1ScalarQuantizer.html#a2bccf276565c4f80fed3d0c715c58816',1,'faiss::ScalarQuantizer::compute_codes()'],['../structfaiss_1_1ProductQuantizer.html#ae5a340ee5a4b1d35a565b167de2a2ef1',1,'faiss::ProductQuantizer::compute_codes()']]], ['compute_5fcost',['compute_cost',['../structfaiss_1_1Score3Computer.html#a1c4537d67802aef28ccc57c4bd87f766',1,'faiss::Score3Computer']]], ['compute_5fdistance_5fsubset',['compute_distance_subset',['../structfaiss_1_1IndexFlat.html#a14b51786e7f98be1954eef35d02813a7',1,'faiss::IndexFlat']]], ['compute_5fdistance_5ftable',['compute_distance_table',['../structfaiss_1_1ProductQuantizer.html#a36361f41bcd2fa698f3c39eb7111ed09',1,'faiss::ProductQuantizer']]], diff --git a/docs/html/search/functions_64.js b/docs/html/search/functions_64.js index e47d486e8..183d99fdd 100644 --- a/docs/html/search/functions_64.js +++ b/docs/html/search/functions_64.js @@ -2,7 +2,7 @@ var searchData= [ ['data',['data',['../classfaiss_1_1gpu_1_1Tensor.html#a37d3ac0dffcaad29f09d6e85fb07b335',1,'faiss::gpu::Tensor::data()'],['../classfaiss_1_1gpu_1_1Tensor.html#a9a098dad7e211328d1ae8b00d02839ce',1,'faiss::gpu::Tensor::data() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#aae8c90b402493f5656f94701157a7417',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::data()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a750047ff919799af43b4861b580c82e3',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::data() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a30dff4e7bea94cd894e17f6bdd7a7eb1',1,'faiss::gpu::detail::SubTensor::data()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a6e7097578ba17c10895ec0dafa385901',1,'faiss::gpu::detail::SubTensor::data() const ']]], ['dataas',['dataAs',['../classfaiss_1_1gpu_1_1Tensor.html#a7c987316708113dafd11971092d59f69',1,'faiss::gpu::Tensor::dataAs()'],['../classfaiss_1_1gpu_1_1Tensor.html#ad02cd32977ebf89636c8d085b4470c2e',1,'faiss::gpu::Tensor::dataAs() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a23e80555a443797d60ae16d605dacd23',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::dataAs()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor_3_01TensorType_00_010_00_01PtrTraits_01_4.html#a0ec3a48f265de627490e7cdf540e9fc5',1,'faiss::gpu::detail::SubTensor< TensorType, 0, PtrTraits >::dataAs() const '],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a9825bed624c3abb6337a1ab7654d7db7',1,'faiss::gpu::detail::SubTensor::dataAs()'],['../classfaiss_1_1gpu_1_1detail_1_1SubTensor.html#a485abbadb5b5de23e88822366857a78f',1,'faiss::gpu::detail::SubTensor::dataAs() const ']]], - ['decode',['decode',['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode(const uint8_t *code, float *x, size_t n) const '],['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode(const uint8_t *code, float *x, size_t n) const '],['../structfaiss_1_1ProductQuantizer.html#a7afbf9d96276f021981e99f064254208',1,'faiss::ProductQuantizer::decode()']]], + ['decode',['decode',['../structfaiss_1_1ScalarQuantizer.html#a7ab9e9158da1777d45e6f9bf73bfd489',1,'faiss::ScalarQuantizer::decode()'],['../structfaiss_1_1ProductQuantizer.html#a7afbf9d96276f021981e99f064254208',1,'faiss::ProductQuantizer::decode()']]], ['decode_5fmultiple',['decode_multiple',['../structfaiss_1_1IndexIVFPQ.html#ae1fb0cc3051dec8e322a78c443f8fc9a',1,'faiss::IndexIVFPQ']]], ['devicetensor',['DeviceTensor',['../classfaiss_1_1gpu_1_1DeviceTensor.html#a7268e52fdb20e0ead0b299a38ebb3025',1,'faiss::gpu::DeviceTensor::DeviceTensor()'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#a93dbc2c1cf3160acdf00ad782bfe1611',1,'faiss::gpu::DeviceTensor::DeviceTensor(DeviceTensor< T, Dim, Contig, IndexT, PtrTraits > &&t)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#a2d2be43bcc1329788d5d3290754acb6b',1,'faiss::gpu::DeviceTensor::DeviceTensor(const IndexT sizes[Dim], MemorySpace space=MemorySpace::Device)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#a8a21879d40ae1094431c9b77f9a9b2b5',1,'faiss::gpu::DeviceTensor::DeviceTensor(DeviceMemory &m, const IndexT sizes[Dim], cudaStream_t stream, MemorySpace space=MemorySpace::Device)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#af8d94ced6662edd87fc508b5b33a8375',1,'faiss::gpu::DeviceTensor::DeviceTensor(DataPtrType data, const IndexT sizes[Dim], MemorySpace space=MemorySpace::Device)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#af65cec92b7b36b625af243ce1946d8f1',1,'faiss::gpu::DeviceTensor::DeviceTensor(DataPtrType data, const IndexT sizes[Dim], const IndexT strides[Dim], MemorySpace space=MemorySpace::Device)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#ae8428613b769249fe47ff53f88dc3a6b',1,'faiss::gpu::DeviceTensor::DeviceTensor(Tensor< T, Dim, Contig, IndexT, PtrTraits > &t, cudaStream_t stream, MemorySpace space=MemorySpace::Device)'],['../classfaiss_1_1gpu_1_1DeviceTensor.html#ac64ad9b519cdb8545ed44398a4f0608c',1,'faiss::gpu::DeviceTensor::DeviceTensor(DeviceMemory &m, Tensor< T, Dim, Contig, IndexT, PtrTraits > &t, cudaStream_t stream, MemorySpace space=MemorySpace::Device)']]], ['display',['display',['../structfaiss_1_1OperatingPoints.html#ab146ed35f0c8f0c48983a054337a98e1',1,'faiss::OperatingPoints::display()'],['../structfaiss_1_1ParameterSpace.html#aa4bb1f0008689903aa936baee61d09d0',1,'faiss::ParameterSpace::display()'],['../structfaiss_1_1Index.html#a373c30e3d87d1d4e616f450d87152b1a',1,'faiss::Index::display()']]], diff --git a/docs/html/search/functions_67.js b/docs/html/search/functions_67.js index ab18b1213..f0ddc7272 100644 --- a/docs/html/search/functions_67.js +++ b/docs/html/search/functions_67.js @@ -6,8 +6,16 @@ var searchData= ['get_5fmem_5fusage_5fkb',['get_mem_usage_kb',['../namespacefaiss.html#aa3af5769b0b649f112332a874c64d361',1,'faiss']]], ['get_5fval',['get_val',['../structfaiss_1_1HeapArray.html#ae97911f6f85d152a5b45e459063b6858',1,'faiss::HeapArray']]], ['getalloc',['getAlloc',['../structfaiss_1_1gpu_1_1StackDeviceMemory_1_1Stack.html#ab45d128f288728df5baf03defd50cec7',1,'faiss::gpu::StackDeviceMemory::Stack']]], + ['getalternatestreams',['getAlternateStreams',['../classfaiss_1_1gpu_1_1GpuResources.html#afb469bf3b107f43ef0d6abe4a014bb5b',1,'faiss::gpu::GpuResources::getAlternateStreams()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a9ebf68604864cb890a4c2e3d0a6f9952',1,'faiss::gpu::StandardGpuResources::getAlternateStreams()']]], + ['getalternatestreamscurrentdevice',['getAlternateStreamsCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a622f95597cc2ed2f10f3ae9400dc685b',1,'faiss::gpu::GpuResources']]], + ['getasynccopystream',['getAsyncCopyStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a104b291ed4116033752144e90856c2e7',1,'faiss::gpu::GpuResources::getAsyncCopyStream()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#adf89d4731c826df889f51fe42287b15d',1,'faiss::gpu::StandardGpuResources::getAsyncCopyStream()']]], + ['getasynccopystreamcurrentdevice',['getAsyncCopyStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#aefb90d15fade57cdfcff03ec800183d4',1,'faiss::gpu::GpuResources']]], ['getbitspercode',['getBitsPerCode',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#af87058de254e1430587a16b76f1e4377',1,'faiss::gpu::GpuIndexIVFPQ']]], + ['getblashandle',['getBlasHandle',['../classfaiss_1_1gpu_1_1GpuResources.html#aa2682b8503dfdab4f7f5ef867035ad29',1,'faiss::gpu::GpuResources::getBlasHandle()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a7560435c7f45fd59d94ee947330a58da',1,'faiss::gpu::StandardGpuResources::getBlasHandle()']]], + ['getblashandlecurrentdevice',['getBlasHandleCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a00cb7bcbc5f1a00da673f30749149b12',1,'faiss::gpu::GpuResources']]], ['getcentroidspersubquantizer',['getCentroidsPerSubQuantizer',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a2f50e79af6727962cd89534438d4769e',1,'faiss::gpu::GpuIndexIVFPQ']]], + ['getdefaultstream',['getDefaultStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a6c564198df6ba675920c993e2af34b8c',1,'faiss::gpu::GpuResources::getDefaultStream()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a954f34ef68fd36b8d502ca3a21f7e8a8',1,'faiss::gpu::StandardGpuResources::getDefaultStream()']]], + ['getdefaultstreamcurrentdevice',['getDefaultStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#aa0354aa570c24e17a9f8a6a45b153ed2',1,'faiss::gpu::GpuResources']]], ['getdevice',['getDevice',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a1a3f8580febe15b3eee91cc95bdb9c80',1,'faiss::gpu::DeviceMemory::getDevice()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#ab9dac6d8953630121f60fb804599f648',1,'faiss::gpu::StackDeviceMemory::getDevice()']]], ['getdim',['getDim',['../classfaiss_1_1gpu_1_1IVFBase.html#a4d44e8aebc380b7c846a8d8e6e835540',1,'faiss::gpu::IVFBase']]], ['getgpudata',['getGpuData',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a310b00d4443920a855b11276d488c9a7',1,'faiss::gpu::GpuIndexFlat']]], @@ -17,12 +25,15 @@ var searchData= ['getlistlength',['getListLength',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ab7f77961857e560b4dbb81888a8c8bf8',1,'faiss::gpu::GpuIndexIVFPQ::getListLength()'],['../classfaiss_1_1gpu_1_1IVFBase.html#a7b1ee21f9919fb077db5e48e91943582',1,'faiss::gpu::IVFBase::getListLength()']]], ['getlistvectors',['getListVectors',['../classfaiss_1_1gpu_1_1IVFFlat.html#a78473b609750b8ec7dfe3d137f50c650',1,'faiss::gpu::IVFFlat']]], ['getmemory',['getMemory',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a4adf60b9a0561e6319aa5cb7f42558d7',1,'faiss::gpu::DeviceMemory::getMemory()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#a9d9a5dcdb2d016cf00d14b8831db638b',1,'faiss::gpu::StackDeviceMemory::getMemory()']]], + ['getmemorymanager',['getMemoryManager',['../classfaiss_1_1gpu_1_1GpuResources.html#a7fec58e9414f313fde4988a62f06cfab',1,'faiss::gpu::GpuResources::getMemoryManager()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a35da92117dd4b47ee773444af716d634',1,'faiss::gpu::StandardGpuResources::getMemoryManager()']]], + ['getmemorymanagercurrentdevice',['getMemoryManagerCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#a1dda2dc3db1bd62cde6657c5cdbfb6e1',1,'faiss::gpu::GpuResources']]], ['getmillisecs',['getmillisecs',['../namespacefaiss.html#af2a71f7d5402ae02ce169a4cc83020eb',1,'faiss']]], ['getminpagingsize',['getMinPagingSize',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a44532c7e5165d36e5da57272d37544ae',1,'faiss::gpu::GpuIndexFlat']]], ['getnumlists',['getNumLists',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a43a63e93d55b79eac38173f219743ddf',1,'faiss::gpu::GpuIndexIVF::getNumLists()'],['../classfaiss_1_1gpu_1_1IVFBase.html#abd66dc9d32e6150b930d78f74d7dd2d7',1,'faiss::gpu::IVFBase::getNumLists()']]], ['getnumprobes',['getNumProbes',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a13bce124f8acada641daf60d6edddb33',1,'faiss::gpu::GpuIndexIVF']]], ['getnumsubquantizers',['getNumSubQuantizers',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a3869ea7898487334fb67ee499f38988d',1,'faiss::gpu::GpuIndexIVFPQ']]], ['getnumvecs',['getNumVecs',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a51b5aa0d68670ec7ccb32b0353c7387f',1,'faiss::gpu::GpuIndexFlat']]], + ['getpinnedmemory',['getPinnedMemory',['../classfaiss_1_1gpu_1_1GpuResources.html#ad1b018745239e03d0044b659335c17a8',1,'faiss::gpu::GpuResources::getPinnedMemory()'],['../classfaiss_1_1gpu_1_1StandardGpuResources.html#ae7418f127cac2ac663ac0ae2e6f88e8d',1,'faiss::gpu::StandardGpuResources::getPinnedMemory()']]], ['getpqcentroids',['getPQCentroids',['../classfaiss_1_1gpu_1_1IVFPQ.html#a3e8bff50f894c243c62e832f923e88e7',1,'faiss::gpu::IVFPQ']]], ['getprecomputedcodes',['getPrecomputedCodes',['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#a679b0aaa229d571aeb842673e3493cc5',1,'faiss::gpu::GpuIndexIVFPQ']]], ['getquantizer',['getQuantizer',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#afe6eb789377072b309d7a385aa0d1c5e',1,'faiss::gpu::GpuIndexIVF']]], diff --git a/docs/html/search/functions_6d.js b/docs/html/search/functions_6d.js index 109b41c2f..14d5c22f7 100644 --- a/docs/html/search/functions_6d.js +++ b/docs/html/search/functions_6d.js @@ -4,7 +4,7 @@ var searchData= ['matrix_5fqr',['matrix_qr',['../namespacefaiss.html#afb68fe89ad5e948974da1b70d7b4157c',1,'faiss']]], ['maxdiff',['maxDiff',['../classfaiss_1_1gpu_1_1HostTensor.html#a61823ac9c1cfcf296357c383b50d9010',1,'faiss::gpu::HostTensor']]], ['merge_5ffrom',['merge_from',['../structfaiss_1_1IndexIVF.html#a0f22cc237c30c935df5b6560aecf8f01',1,'faiss::IndexIVF']]], - ['merge_5ffrom_5fresiduals',['merge_from_residuals',['../structfaiss_1_1IndexIVF.html#aacaf0b2529a9d9def094ea3728a12824',1,'faiss::IndexIVF::merge_from_residuals()'],['../structfaiss_1_1IndexIVFFlat.html#a8fc1695a87f33db1a16f8c50c3344cd3',1,'faiss::IndexIVFFlat::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQ.html#a6b8964e2da609a9261a8a35ae347ecb2',1,'faiss::IndexIVFPQ::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQR.html#af6c7ee3bc917cc5d4ab04ff64269ee06',1,'faiss::IndexIVFPQR::merge_from_residuals()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals(IndexIVF &other) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals(IndexIVF &other) override']]], + ['merge_5ffrom_5fresiduals',['merge_from_residuals',['../structfaiss_1_1IndexIVF.html#aacaf0b2529a9d9def094ea3728a12824',1,'faiss::IndexIVF::merge_from_residuals()'],['../structfaiss_1_1IndexIVFFlat.html#a8fc1695a87f33db1a16f8c50c3344cd3',1,'faiss::IndexIVFFlat::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQ.html#a6b8964e2da609a9261a8a35ae347ecb2',1,'faiss::IndexIVFPQ::merge_from_residuals()'],['../structfaiss_1_1IndexIVFPQR.html#af6c7ee3bc917cc5d4ab04ff64269ee06',1,'faiss::IndexIVFPQR::merge_from_residuals()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#afd54410889924a0cb544f1e3fd5babe9',1,'faiss::IndexIVFScalarQuantizer::merge_from_residuals()']]], ['merge_5fresult_5ftable_5fwith',['merge_result_table_with',['../namespacefaiss.html#afb7b33f6892678ba79aaf5e71777837c',1,'faiss']]], ['merge_5fwith',['merge_with',['../structfaiss_1_1OperatingPoints.html#a84baddccd8b803dee460739f8bcbc0c9',1,'faiss::OperatingPoints']]], ['mergewarpq',['mergeWarpQ',['../structfaiss_1_1gpu_1_1BlockSelect.html#a08aa08d16ec29c7b7dccc65edd5115cd',1,'faiss::gpu::BlockSelect::mergeWarpQ()'],['../structfaiss_1_1gpu_1_1WarpSelect.html#a408cbf9a09094078cb62018400f30076',1,'faiss::gpu::WarpSelect::mergeWarpQ()']]], diff --git a/docs/html/search/functions_73.js b/docs/html/search/functions_73.js index cf0267e50..80490604b 100644 --- a/docs/html/search/functions_73.js +++ b/docs/html/search/functions_73.js @@ -1,6 +1,6 @@ var searchData= [ - ['search',['search',['../classfaiss_1_1gpu_1_1GpuIndex.html#a6f1cadb5e8970c9c1fdf15eddb9d874f',1,'faiss::gpu::GpuIndex::search()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ac0f0301829363f920e619f673a4d97f3',1,'faiss::gpu::GpuIndexFlat::search()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#a25ed68079907eeeca9d441cdd4fc0740',1,'faiss::gpu::IndexProxy::search()'],['../structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7',1,'faiss::Index::search()'],['../structfaiss_1_1IndexFlat.html#a85510d70f4675197df9988651e4692c9',1,'faiss::IndexFlat::search()'],['../structfaiss_1_1IndexFlatL2BaseShift.html#a16e9bf1aec9d18b3ebbe78fea6bfecc0',1,'faiss::IndexFlatL2BaseShift::search()'],['../structfaiss_1_1IndexRefineFlat.html#ad04444de1e2c26c463cc52f3c076dd41',1,'faiss::IndexRefineFlat::search()'],['../structfaiss_1_1IndexFlat1D.html#a65736f2900865cd156faba4fcd260d05',1,'faiss::IndexFlat1D::search()'],['../structfaiss_1_1IndexIVFFlat.html#acd2bdb06fcbe9d1f5799cf78aa6cdf0d',1,'faiss::IndexIVFFlat::search()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#aac063e96413e0e90d87898df8a60088b',1,'faiss::IndexIVFFlatIPBounds::search()'],['../structfaiss_1_1IndexIVFPQ.html#afa7c9a7ae0316d2a05acb60ab2b7a31a',1,'faiss::IndexIVFPQ::search()'],['../structfaiss_1_1IndexIVFPQR.html#a3e982ee6f1a3a025148270701867d04f',1,'faiss::IndexIVFPQR::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexLSH.html#a66b6afb56afa1f58e2d93abfdfd223ee',1,'faiss::IndexLSH::search()'],['../structfaiss_1_1IndexPQ.html#a491ba3ed34093513e6a850fbca0abdd2',1,'faiss::IndexPQ::search()'],['../structfaiss_1_1MultiIndexQuantizer.html#a999ee03f4e65f453377e209d10e25681',1,'faiss::MultiIndexQuantizer::search()'],['../structfaiss_1_1IndexScalarQuantizer.html#abf24732c29106bb808148c3d30599662',1,'faiss::IndexScalarQuantizer::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexIDMap.html#a2f36fa9150a465b48952afbba856e2a1',1,'faiss::IndexIDMap::search()'],['../structfaiss_1_1IndexShards.html#a83391295650370e8987358a898bb2cca',1,'faiss::IndexShards::search()'],['../structfaiss_1_1IndexSplitVectors.html#a4a010daf51e44d9717e94400cc23c159',1,'faiss::IndexSplitVectors::search()'],['../structfaiss_1_1ProductQuantizer.html#a1ae7892a15b9f6809a3ba1a123a7831b',1,'faiss::ProductQuantizer::search()'],['../structfaiss_1_1IndexPreTransform.html#a7c2c820895d87083742969c281ae4911',1,'faiss::IndexPreTransform::search()']]], + ['search',['search',['../classfaiss_1_1gpu_1_1GpuIndex.html#a6f1cadb5e8970c9c1fdf15eddb9d874f',1,'faiss::gpu::GpuIndex::search()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#ac0f0301829363f920e619f673a4d97f3',1,'faiss::gpu::GpuIndexFlat::search()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#a25ed68079907eeeca9d441cdd4fc0740',1,'faiss::gpu::IndexProxy::search()'],['../structfaiss_1_1Index.html#aced51b1ebc33c47ab3ae15ea906559a7',1,'faiss::Index::search()'],['../structfaiss_1_1IndexFlat.html#a85510d70f4675197df9988651e4692c9',1,'faiss::IndexFlat::search()'],['../structfaiss_1_1IndexFlatL2BaseShift.html#a16e9bf1aec9d18b3ebbe78fea6bfecc0',1,'faiss::IndexFlatL2BaseShift::search()'],['../structfaiss_1_1IndexRefineFlat.html#ad04444de1e2c26c463cc52f3c076dd41',1,'faiss::IndexRefineFlat::search()'],['../structfaiss_1_1IndexFlat1D.html#a65736f2900865cd156faba4fcd260d05',1,'faiss::IndexFlat1D::search()'],['../structfaiss_1_1IndexIVFFlat.html#acd2bdb06fcbe9d1f5799cf78aa6cdf0d',1,'faiss::IndexIVFFlat::search()'],['../structfaiss_1_1IndexIVFFlatIPBounds.html#aac063e96413e0e90d87898df8a60088b',1,'faiss::IndexIVFFlatIPBounds::search()'],['../structfaiss_1_1IndexIVFPQ.html#afa7c9a7ae0316d2a05acb60ab2b7a31a',1,'faiss::IndexIVFPQ::search()'],['../structfaiss_1_1IndexIVFPQR.html#a3e982ee6f1a3a025148270701867d04f',1,'faiss::IndexIVFPQR::search()'],['../structfaiss_1_1IndexLSH.html#a66b6afb56afa1f58e2d93abfdfd223ee',1,'faiss::IndexLSH::search()'],['../structfaiss_1_1IndexPQ.html#a491ba3ed34093513e6a850fbca0abdd2',1,'faiss::IndexPQ::search()'],['../structfaiss_1_1MultiIndexQuantizer.html#a999ee03f4e65f453377e209d10e25681',1,'faiss::MultiIndexQuantizer::search()'],['../structfaiss_1_1IndexScalarQuantizer.html#abf24732c29106bb808148c3d30599662',1,'faiss::IndexScalarQuantizer::search()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#a0e1197a21c9291a2d570116f72fd2196',1,'faiss::IndexIVFScalarQuantizer::search()'],['../structfaiss_1_1IndexIDMap.html#a2f36fa9150a465b48952afbba856e2a1',1,'faiss::IndexIDMap::search()'],['../structfaiss_1_1IndexShards.html#a83391295650370e8987358a898bb2cca',1,'faiss::IndexShards::search()'],['../structfaiss_1_1IndexSplitVectors.html#a4a010daf51e44d9717e94400cc23c159',1,'faiss::IndexSplitVectors::search()'],['../structfaiss_1_1ProductQuantizer.html#a1ae7892a15b9f6809a3ba1a123a7831b',1,'faiss::ProductQuantizer::search()'],['../structfaiss_1_1IndexPreTransform.html#a7c2c820895d87083742969c281ae4911',1,'faiss::IndexPreTransform::search()']]], ['search_5fip',['search_ip',['../structfaiss_1_1ProductQuantizer.html#a66be226806ca2abcaaf1653cdc690aa6',1,'faiss::ProductQuantizer']]], ['search_5fknn_5finner_5fproduct',['search_knn_inner_product',['../structfaiss_1_1IndexIVFFlat.html#a5ac4f051396a1535426baec8f401aa93',1,'faiss::IndexIVFFlat']]], ['search_5fknn_5fl2sqr',['search_knn_L2sqr',['../structfaiss_1_1IndexIVFFlat.html#a9ca8cc3ca71ff91f1e5e2db3b8ead615',1,'faiss::IndexIVFFlat']]], @@ -15,6 +15,8 @@ var searchData= ['set_5flims',['set_lims',['../structfaiss_1_1RangeSearchPartialResult.html#ab6a385008493c7b630e4e7bc56e3da74',1,'faiss::RangeSearchPartialResult']]], ['set_5fparams',['set_params',['../structfaiss_1_1ProductQuantizer.html#ad291f113c6d44a634ddc1972f9a3c775',1,'faiss::ProductQuantizer']]], ['set_5fresult',['set_result',['../structfaiss_1_1RangeSearchPartialResult.html#aa6639358995ac081f8a931a7790d0caf',1,'faiss::RangeSearchPartialResult']]], + ['setdefaultnullstreamalldevices',['setDefaultNullStreamAllDevices',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a5374f336f1957c266d7a5c185eb962a1',1,'faiss::gpu::StandardGpuResources']]], + ['setdefaultstream',['setDefaultStream',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#a5924b424c36dba8300866f1b98c438cb',1,'faiss::gpu::StandardGpuResources']]], ['setminpagingsize',['setMinPagingSize',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a752f8129ccb94fa0c6f346ae03ff536d',1,'faiss::gpu::GpuIndexFlat']]], ['setnumprobes',['setNumProbes',['../classfaiss_1_1gpu_1_1GpuIndexIVF.html#a1efac4b9801d57fa6d0085d6aed9c1f2',1,'faiss::gpu::GpuIndexIVF']]], ['setpinnedmemory',['setPinnedMemory',['../classfaiss_1_1gpu_1_1StandardGpuResources.html#af9acb23ac323f85fa5dab4ed968ccd51',1,'faiss::gpu::StandardGpuResources']]], @@ -27,5 +29,7 @@ var searchData= ['stackdevicememory',['StackDeviceMemory',['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#a130f900c32ba91ae1f872c7ee506a93e',1,'faiss::gpu::StackDeviceMemory::StackDeviceMemory(int device, size_t allocPerDevice)'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#afd7a84b8cd1f747d873cdd1ab07e8a4b',1,'faiss::gpu::StackDeviceMemory::StackDeviceMemory(int device, void *p, size_t size, bool isOwner)']]], ['stop',['stop',['../classfaiss_1_1gpu_1_1WorkerThread.html#a68963d8c18822d7736c96e82367f2f12',1,'faiss::gpu::WorkerThread']]], ['streamwaitonevent',['streamWaitOnEvent',['../classfaiss_1_1gpu_1_1CudaEvent.html#ad8968b298b95788c7679d7e5aa0571eb',1,'faiss::gpu::CudaEvent']]], - ['strides',['strides',['../classfaiss_1_1gpu_1_1Tensor.html#a9a0a293f287e9cba68f31c9e57b79c64',1,'faiss::gpu::Tensor']]] + ['strides',['strides',['../classfaiss_1_1gpu_1_1Tensor.html#a9a0a293f287e9cba68f31c9e57b79c64',1,'faiss::gpu::Tensor']]], + ['syncdefaultstream',['syncDefaultStream',['../classfaiss_1_1gpu_1_1GpuResources.html#a130deab9f6d49cbdde8f9da45ce868fd',1,'faiss::gpu::GpuResources']]], + ['syncdefaultstreamcurrentdevice',['syncDefaultStreamCurrentDevice',['../classfaiss_1_1gpu_1_1GpuResources.html#adf6a5653ec2bbb0e9d58a0e1dd73897f',1,'faiss::gpu::GpuResources']]] ]; diff --git a/docs/html/search/functions_74.js b/docs/html/search/functions_74.js index 99c064a91..b919ffb73 100644 --- a/docs/html/search/functions_74.js +++ b/docs/html/search/functions_74.js @@ -3,8 +3,8 @@ var searchData= ['t_5ffor_5fperf',['t_for_perf',['../structfaiss_1_1OperatingPoints.html#a3a0723e0900f7048ac9567341de5ee56',1,'faiss::OperatingPoints']]], ['tensor',['Tensor',['../classfaiss_1_1gpu_1_1Tensor.html#a151fd78dd5695b1346739e32a9e76309',1,'faiss::gpu::Tensor::Tensor()'],['../classfaiss_1_1gpu_1_1Tensor.html#ad91651847f8b9f68bbf8e55cdfadf60b',1,'faiss::gpu::Tensor::Tensor(Tensor< T, Dim, Contig, IndexT, PtrTraits > &t)=default'],['../classfaiss_1_1gpu_1_1Tensor.html#a8ae06b3adf94ff6e57c3779e3b0efc1d',1,'faiss::gpu::Tensor::Tensor(Tensor< T, Dim, Contig, IndexT, PtrTraits > &&t)=default'],['../classfaiss_1_1gpu_1_1Tensor.html#a08a79780414069111c471d67af5676ac',1,'faiss::gpu::Tensor::Tensor(DataPtrType data, const IndexT sizes[Dim])'],['../classfaiss_1_1gpu_1_1Tensor.html#a8da5c2001d2f5e97abe9f6ad9eed34a9',1,'faiss::gpu::Tensor::Tensor(DataPtrType data, const IndexT sizes[Dim], const IndexT strides[Dim])']]], ['tostring',['toString',['../classfaiss_1_1gpu_1_1DeviceMemory.html#a35640c7cd2d5be8a95c4e841f02c3f3e',1,'faiss::gpu::DeviceMemory::toString()'],['../classfaiss_1_1gpu_1_1StackDeviceMemory.html#ae4fab99808556307b17241c45503a4b0',1,'faiss::gpu::StackDeviceMemory::toString()'],['../structfaiss_1_1gpu_1_1StackDeviceMemory_1_1Stack.html#a1c91f4d50ecb8bb659054227d32fb47b',1,'faiss::gpu::StackDeviceMemory::Stack::toString()']]], - ['train',['train',['../structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf',1,'faiss::Clustering::train()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a0e74fad76628ddfb5ae3dc1d1c69f7e8',1,'faiss::gpu::GpuIndexFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a3c5b3760acb01814892fe93c72f08304',1,'faiss::gpu::GpuIndexIVFFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ac4814acafa4bc340a4c4bdcafd469b56',1,'faiss::gpu::GpuIndexIVFPQ::train()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#aee6fe7e95b02238103a6a2d1f6d2cd00',1,'faiss::gpu::IndexProxy::train()'],['../structfaiss_1_1Index.html#a8f67dfd73993e192dc78f2c93d9d9532',1,'faiss::Index::train()'],['../structfaiss_1_1IndexRefineFlat.html#a79c4c9b9ffabc4460ef4def6eb962e68',1,'faiss::IndexRefineFlat::train()'],['../structfaiss_1_1IndexIVF.html#a7a1d5eec194db0977b2318c6ed6a2b86',1,'faiss::IndexIVF::train()'],['../structfaiss_1_1IndexIVFPQCompact.html#a0ef8132fae22a50616fe1201c8b20588',1,'faiss::IndexIVFPQCompact::train()'],['../structfaiss_1_1IndexLSH.html#a01f569a16a812aa3945b8a0b64eaff06',1,'faiss::IndexLSH::train()'],['../structfaiss_1_1IndexPQ.html#a87898add5ab4d86ba901ca79778fc11e',1,'faiss::IndexPQ::train()'],['../structfaiss_1_1MultiIndexQuantizer.html#a6fa1d1a295eb2d4377b8de5096ab3ef4',1,'faiss::MultiIndexQuantizer::train()'],['../structfaiss_1_1IndexScalarQuantizer.html#a300647e9cdac9acd160f2c55c610056b',1,'faiss::IndexScalarQuantizer::train()'],['../structfaiss_1_1IndexIDMap.html#ac873cb03aa323a06dca5d6f3af5fe559',1,'faiss::IndexIDMap::train()'],['../structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b',1,'faiss::IndexShards::train()'],['../structfaiss_1_1IndexSplitVectors.html#aafa4c780e325855fe247052453967845',1,'faiss::IndexSplitVectors::train()'],['../structfaiss_1_1VectorTransform.html#a7350d4dd28d60866d55ba4f75d2da84c',1,'faiss::VectorTransform::train()'],['../structfaiss_1_1PCAMatrix.html#a8f2dd12da8dce3cbeb22da9c5d4ec3e7',1,'faiss::PCAMatrix::train()'],['../structfaiss_1_1OPQMatrix.html#a1e314577db0c6cd4a709503f73eb71e2',1,'faiss::OPQMatrix::train()'],['../structfaiss_1_1IndexPreTransform.html#a416aaf28d7a533dcf7d2d7de434e993c',1,'faiss::IndexPreTransform::train()']]], - ['train_5fresidual',['train_residual',['../structfaiss_1_1IndexIVF.html#a567ef760fd09d09ce2ee4f4e6c2d7280',1,'faiss::IndexIVF::train_residual()'],['../structfaiss_1_1IndexIVFPQ.html#af6565a5d8bab7be3df19c50d235bd662',1,'faiss::IndexIVFPQ::train_residual()'],['../structfaiss_1_1IndexIVFPQR.html#a68ed7cae5bec89fcdcb6a1d2addbd5a8',1,'faiss::IndexIVFPQR::train_residual()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual(idx_t n, const float *x) override'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual(idx_t n, const float *x) override']]], + ['train',['train',['../structfaiss_1_1Clustering.html#a839f210abb11c7a1c7162e336e0ff9cf',1,'faiss::Clustering::train()'],['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a0e74fad76628ddfb5ae3dc1d1c69f7e8',1,'faiss::gpu::GpuIndexFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFFlat.html#a3c5b3760acb01814892fe93c72f08304',1,'faiss::gpu::GpuIndexIVFFlat::train()'],['../classfaiss_1_1gpu_1_1GpuIndexIVFPQ.html#ac4814acafa4bc340a4c4bdcafd469b56',1,'faiss::gpu::GpuIndexIVFPQ::train()'],['../classfaiss_1_1gpu_1_1IndexProxy.html#aee6fe7e95b02238103a6a2d1f6d2cd00',1,'faiss::gpu::IndexProxy::train()'],['../structfaiss_1_1Index.html#a1ffe916c958605c38b0b1bfad42485e4',1,'faiss::Index::train()'],['../structfaiss_1_1IndexRefineFlat.html#a79c4c9b9ffabc4460ef4def6eb962e68',1,'faiss::IndexRefineFlat::train()'],['../structfaiss_1_1IndexIVF.html#a7a1d5eec194db0977b2318c6ed6a2b86',1,'faiss::IndexIVF::train()'],['../structfaiss_1_1IndexIVFPQCompact.html#a0ef8132fae22a50616fe1201c8b20588',1,'faiss::IndexIVFPQCompact::train()'],['../structfaiss_1_1IndexLSH.html#a01f569a16a812aa3945b8a0b64eaff06',1,'faiss::IndexLSH::train()'],['../structfaiss_1_1IndexPQ.html#a87898add5ab4d86ba901ca79778fc11e',1,'faiss::IndexPQ::train()'],['../structfaiss_1_1MultiIndexQuantizer.html#a6fa1d1a295eb2d4377b8de5096ab3ef4',1,'faiss::MultiIndexQuantizer::train()'],['../structfaiss_1_1IndexScalarQuantizer.html#a300647e9cdac9acd160f2c55c610056b',1,'faiss::IndexScalarQuantizer::train()'],['../structfaiss_1_1IndexIDMap.html#ac873cb03aa323a06dca5d6f3af5fe559',1,'faiss::IndexIDMap::train()'],['../structfaiss_1_1IndexShards.html#a36fbcc85eed9bf2ea15587f04be9ae0b',1,'faiss::IndexShards::train()'],['../structfaiss_1_1IndexSplitVectors.html#aafa4c780e325855fe247052453967845',1,'faiss::IndexSplitVectors::train()'],['../structfaiss_1_1VectorTransform.html#a7350d4dd28d60866d55ba4f75d2da84c',1,'faiss::VectorTransform::train()'],['../structfaiss_1_1PCAMatrix.html#a8f2dd12da8dce3cbeb22da9c5d4ec3e7',1,'faiss::PCAMatrix::train()'],['../structfaiss_1_1OPQMatrix.html#a1e314577db0c6cd4a709503f73eb71e2',1,'faiss::OPQMatrix::train()'],['../structfaiss_1_1IndexPreTransform.html#a416aaf28d7a533dcf7d2d7de434e993c',1,'faiss::IndexPreTransform::train()']]], + ['train_5fresidual',['train_residual',['../structfaiss_1_1IndexIVF.html#a567ef760fd09d09ce2ee4f4e6c2d7280',1,'faiss::IndexIVF::train_residual()'],['../structfaiss_1_1IndexIVFPQ.html#af6565a5d8bab7be3df19c50d235bd662',1,'faiss::IndexIVFPQ::train_residual()'],['../structfaiss_1_1IndexIVFPQR.html#a68ed7cae5bec89fcdcb6a1d2addbd5a8',1,'faiss::IndexIVFPQR::train_residual()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#ac05d7fbfed59c85d1cf8ae526d279744',1,'faiss::IndexIVFScalarQuantizer::train_residual()']]], ['train_5fresidual_5fo',['train_residual_o',['../structfaiss_1_1IndexIVFPQ.html#a4e06f04853dcb424dc393de5f641e917',1,'faiss::IndexIVFPQ']]], ['transfer_5fthresholds',['transfer_thresholds',['../structfaiss_1_1IndexLSH.html#ac95fb0b3cb8fe2b265be9822c41c448c',1,'faiss::IndexLSH']]], ['transform_5ftranspose',['transform_transpose',['../structfaiss_1_1LinearTransform.html#a1642efca4f5eb524c29722b0441c4d13',1,'faiss::LinearTransform']]], diff --git a/docs/html/search/variables_63.js b/docs/html/search/variables_63.js index 07935df8e..81f45d629 100644 --- a/docs/html/search/variables_63.js +++ b/docs/html/search/variables_63.js @@ -3,7 +3,7 @@ var searchData= ['centroids',['centroids',['../structfaiss_1_1Clustering.html#a64c5ec0b4a7967d8be2872974b455ff1',1,'faiss::Clustering::centroids()'],['../structfaiss_1_1ProductQuantizer.html#aab1109a29ba0544358e274d727b23cae',1,'faiss::ProductQuantizer::centroids()']]], ['cno',['cno',['../structfaiss_1_1OperatingPoint.html#a2c023f1484e4748e3e97681bb1f4b78e',1,'faiss::OperatingPoint']]], ['code_5fsize',['code_size',['../structfaiss_1_1IndexIVFPQ.html#a31c6fb2faa4dadea4c0594338be7be90',1,'faiss::IndexIVFPQ::code_size()'],['../structfaiss_1_1ScalarQuantizer.html#a647b8774e4cd8ca5623a194f5c7f8a33',1,'faiss::ScalarQuantizer::code_size()'],['../structfaiss_1_1ProductQuantizer.html#aa61330eadb84772b71018b093773a5f9',1,'faiss::ProductQuantizer::code_size()']]], - ['codes',['codes',['../structfaiss_1_1IndexIVFScalarQuantizer.html#aa4764c6d0d4175e01e3c92d3334bc996',1,'faiss::IndexIVFScalarQuantizer::codes()'],['../structfaiss_1_1IndexLSH.html#a55c0f1127850af0d06ef22fc8b791572',1,'faiss::IndexLSH::codes()'],['../structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5',1,'faiss::IndexPQ::codes()'],['../structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be',1,'faiss::IndexScalarQuantizer::codes()']]], + ['codes',['codes',['../structfaiss_1_1IndexLSH.html#a55c0f1127850af0d06ef22fc8b791572',1,'faiss::IndexLSH::codes()'],['../structfaiss_1_1IndexPQ.html#a490b64b12384951ed66548a3a48f91e5',1,'faiss::IndexPQ::codes()'],['../structfaiss_1_1IndexScalarQuantizer.html#a861fa059f9d4ced9147e08193a2be9be',1,'faiss::IndexScalarQuantizer::codes()'],['../structfaiss_1_1IndexIVFScalarQuantizer.html#abc335510a1855faecb3e445c49a9b204',1,'faiss::IndexIVFScalarQuantizer::codes()']]], ['compact_5fcodes',['compact_codes',['../structfaiss_1_1IndexIVFPQCompact.html#aaaf53cae0e47baf3fb1199ce4d789694',1,'faiss::IndexIVFPQCompact']]], ['compact_5fids',['compact_ids',['../structfaiss_1_1IndexIVFPQCompact.html#a1fa62ed464c15768479c92646ed484c7',1,'faiss::IndexIVFPQCompact']]], ['config_5f',['config_',['../classfaiss_1_1gpu_1_1GpuIndexFlat.html#a9efdc92bf03d2d6820fb989cf77e8067',1,'faiss::gpu::GpuIndexFlat']]], diff --git a/docs/html/search/variables_74.js b/docs/html/search/variables_74.js index 120de5e11..3db810b76 100644 --- a/docs/html/search/variables_74.js +++ b/docs/html/search/variables_74.js @@ -7,5 +7,5 @@ var searchData= ['threaded',['threaded',['../structfaiss_1_1IndexShards.html#a493da171720f2c3f35058f793fb9a6ce',1,'faiss::IndexShards']]], ['thresholds',['thresholds',['../structfaiss_1_1IndexLSH.html#ae203ad895b15ae16fc1a748661b84df3',1,'faiss::IndexLSH']]], ['train_5fthresholds',['train_thresholds',['../structfaiss_1_1IndexLSH.html#a5d4d6ea1fc709605d5b2061d1bce27d6',1,'faiss::IndexLSH']]], - ['trained',['trained',['../structfaiss_1_1ScalarQuantizer.html#a64d1560806e6746d6cd1fee089c6a13f',1,'faiss::ScalarQuantizer']]] + ['trained',['trained',['../structfaiss_1_1ScalarQuantizer.html#a30b411b10780a74079bbbfaff678c86f',1,'faiss::ScalarQuantizer']]] ]; diff --git a/docs/html/structfaiss_1_1BaseShiftDistanceCorrection-members.html b/docs/html/structfaiss_1_1BaseShiftDistanceCorrection-members.html index 9a1abf86c..03867253e 100644 --- a/docs/html/structfaiss_1_1BaseShiftDistanceCorrection-members.html +++ b/docs/html/structfaiss_1_1BaseShiftDistanceCorrection-members.html @@ -94,7 +94,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

    This is the complete list of members for faiss::BaseShiftDistanceCorrection, including all inherited members.

    - +
    base_shift (defined in faiss::BaseShiftDistanceCorrection)faiss::BaseShiftDistanceCorrection
    operator()(float dis, size_t qno, size_t bno) const (defined in faiss::BaseShiftDistanceCorrection)faiss::BaseShiftDistanceCorrectioninline
    operator()(float dis, size_t, size_t bno) const (defined in faiss::BaseShiftDistanceCorrection)faiss::BaseShiftDistanceCorrectioninline
    diff --git a/docs/html/structfaiss_1_1BaseShiftDistanceCorrection.html b/docs/html/structfaiss_1_1BaseShiftDistanceCorrection.html index f18f490df..ebb664247 100644 --- a/docs/html/structfaiss_1_1BaseShiftDistanceCorrection.html +++ b/docs/html/structfaiss_1_1BaseShiftDistanceCorrection.html @@ -97,9 +97,9 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - - + +

    Public Member Functions

    -float operator() (float dis, size_t qno, size_t bno) const
     
    +float operator() (float dis, size_t, size_t bno) const
     
    diff --git a/docs/html/structfaiss_1_1GenHammingComputer16.html b/docs/html/structfaiss_1_1GenHammingComputer16.html index 60f1aea7d..d3d8fab6b 100644 --- a/docs/html/structfaiss_1_1GenHammingComputer16.html +++ b/docs/html/structfaiss_1_1GenHammingComputer16.html @@ -115,7 +115,7 @@ uint64_t 

    Public Attributes

    a1

    Detailed Description

    -

    Definition at line 353 of file hamming.h.

    +

    Definition at line 372 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1GenHammingComputer32.html b/docs/html/structfaiss_1_1GenHammingComputer32.html index 934a17f73..89ba1b581 100644 --- a/docs/html/structfaiss_1_1GenHammingComputer32.html +++ b/docs/html/structfaiss_1_1GenHammingComputer32.html @@ -121,7 +121,7 @@ uint64_t a3

    Detailed Description

    -

    Definition at line 369 of file hamming.h.

    +

    Definition at line 388 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1GenHammingComputer8.html b/docs/html/structfaiss_1_1GenHammingComputer8.html index 3cb1222e7..a3ab6fc54 100644 --- a/docs/html/structfaiss_1_1GenHammingComputer8.html +++ b/docs/html/structfaiss_1_1GenHammingComputer8.html @@ -112,7 +112,7 @@ uint64_t a0

    Detailed Description

    -

    Definition at line 338 of file hamming.h.

    +

    Definition at line 357 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1GenHammingComputerM8.html b/docs/html/structfaiss_1_1GenHammingComputerM8.html index bbe90e361..5813cc232 100644 --- a/docs/html/structfaiss_1_1GenHammingComputerM8.html +++ b/docs/html/structfaiss_1_1GenHammingComputerM8.html @@ -115,7 +115,7 @@ int n

    Detailed Description

    -

    Definition at line 388 of file hamming.h.

    +

    Definition at line 407 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1HammingComputer.html b/docs/html/structfaiss_1_1HammingComputer.html index 1328c384b..26dd30d3d 100644 --- a/docs/html/structfaiss_1_1HammingComputer.html +++ b/docs/html/structfaiss_1_1HammingComputer.html @@ -131,7 +131,7 @@ int n struct faiss::HammingComputer< CODE_SIZE > -

    Definition at line 301 of file hamming.h.

    +

    Definition at line 320 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1HammingComputerDefault-members.html b/docs/html/structfaiss_1_1HammingComputerDefault-members.html new file mode 100644 index 000000000..18995b713 --- /dev/null +++ b/docs/html/structfaiss_1_1HammingComputerDefault-members.html @@ -0,0 +1,108 @@ + + + + + + +Faiss: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Faiss +
    +
    +
    + + + + + + + + + +
    + +
    + + +
    +
    +
    +
    faiss::HammingComputerDefault Member List
    +
    +
    + +

    This is the complete list of members for faiss::HammingComputerDefault, including all inherited members.

    + + + + + +
    a (defined in faiss::HammingComputerDefault)faiss::HammingComputerDefault
    hamming(const uint8_t *b8) const (defined in faiss::HammingComputerDefault)faiss::HammingComputerDefaultinline
    HammingComputerDefault(const uint8_t *a8, int code_size) (defined in faiss::HammingComputerDefault)faiss::HammingComputerDefaultinline
    n (defined in faiss::HammingComputerDefault)faiss::HammingComputerDefault
    + +
    +Generated by   +doxygen + 1.8.5 +
    + + diff --git a/docs/html/structfaiss_1_1HammingComputerDefault.html b/docs/html/structfaiss_1_1HammingComputerDefault.html new file mode 100644 index 000000000..4701b7d7f --- /dev/null +++ b/docs/html/structfaiss_1_1HammingComputerDefault.html @@ -0,0 +1,130 @@ + + + + + + +Faiss: faiss::HammingComputerDefault Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Faiss +
    +
    +
    + + + + + + + + + +
    + +
    + + +
    +
    +
    +Public Member Functions | +Public Attributes | +List of all members
    +
    +
    faiss::HammingComputerDefault Struct Reference
    +
    +
    + + + + + + +

    +Public Member Functions

    + HammingComputerDefault (const uint8_t *a8, int code_size)
     
    +int hamming (const uint8_t *b8) const
     
    + + + + + +

    +Public Attributes

    +const uint8_t * a
     
    +int n
     
    +

    Detailed Description

    +
    +

    Definition at line 255 of file hamming.h.

    +
    The documentation for this struct was generated from the following file:
      +
    • /data/users/matthijs/github_faiss/faiss/hamming.h
      • +
    +
    + +
    +Generated by   +doxygen + 1.8.5 +
    + + diff --git a/docs/html/structfaiss_1_1HammingComputerM4.html b/docs/html/structfaiss_1_1HammingComputerM4.html index 8f745dc90..44832e955 100644 --- a/docs/html/structfaiss_1_1HammingComputerM4.html +++ b/docs/html/structfaiss_1_1HammingComputerM4.html @@ -115,7 +115,7 @@ int n

    Detailed Description

    -

    Definition at line 276 of file hamming.h.

    +

    Definition at line 295 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1HammingComputerM8.html b/docs/html/structfaiss_1_1HammingComputerM8.html index 76b4af6b4..4ab32edad 100644 --- a/docs/html/structfaiss_1_1HammingComputerM8.html +++ b/docs/html/structfaiss_1_1HammingComputerM8.html @@ -124,7 +124,7 @@ int n

    Detailed Description

    -

    Definition at line 255 of file hamming.h.

    +

    Definition at line 274 of file hamming.h.

    The documentation for this struct was generated from the following file:
    • /data/users/matthijs/github_faiss/faiss/hamming.h
    diff --git a/docs/html/structfaiss_1_1Index-members.html b/docs/html/structfaiss_1_1Index-members.html index ed7c48889..b4c88e8be 100644 --- a/docs/html/structfaiss_1_1Index-members.html +++ b/docs/html/structfaiss_1_1Index-members.html @@ -110,7 +110,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); remove_ids(const IDSelector &sel)faiss::Indexvirtual reset()=0faiss::Indexpure virtual search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const =0faiss::Indexpure virtual - train(idx_t n, const float *x)faiss::Indexinlinevirtual + train(idx_t, const float *)faiss::Indexinlinevirtual verbosefaiss::Index ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual diff --git a/docs/html/structfaiss_1_1Index.html b/docs/html/structfaiss_1_1Index.html index 9398d658e..36d2128e7 100644 --- a/docs/html/structfaiss_1_1Index.html +++ b/docs/html/structfaiss_1_1Index.html @@ -131,8 +131,8 @@ Public Member Functions  Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)   -virtual void train (idx_t n, const float *x) -  +virtual void train (idx_t, const float *) +  virtual void add (idx_t n, const float *x)=0   virtual void add_with_ids (idx_t n, const float *x, const long *xids) @@ -278,9 +278,9 @@ bool faiss::IndexPreTransform, faiss::IndexIVFPQR, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, faiss::IndexShards, faiss::IndexIVFScalarQuantizer, faiss::IndexIDMap2, faiss::gpu::GpuIndex, faiss::IndexIVFPQ, and faiss::IndexIDMap.

    +

    Reimplemented in faiss::IndexPreTransform, faiss::IndexIVFPQR, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, faiss::IndexShards, faiss::IndexIDMap2, faiss::gpu::GpuIndex, faiss::IndexIVFPQ, and faiss::IndexIDMap.

    -

    Definition at line 31 of file Index.cpp.

    +

    Definition at line 30 of file Index.cpp.

    @@ -373,7 +373,7 @@ bool 58 of file Index.cpp.

    +

    Definition at line 57 of file Index.cpp.

    @@ -391,7 +391,7 @@ bool 

    Display the actual class name and some more info

    -

    Definition at line 66 of file Index.cpp.

    +

    Definition at line 65 of file Index.cpp.

    @@ -498,7 +498,7 @@ bool faiss::IndexIVFFlat, faiss::MultiIndexQuantizer, faiss::IndexScalarQuantizer, faiss::gpu::GpuIndexFlat, faiss::IndexIVFPQ, faiss::IndexIDMap2, faiss::gpu::IndexProxy, faiss::IndexPQ, and faiss::IndexFlat.

    -

    Definition at line 44 of file Index.cpp.

    +

    Definition at line 43 of file Index.cpp.

    @@ -550,7 +550,7 @@ bool faiss::IndexPreTransform, faiss::IndexIVFPQR, faiss::IndexScalarQuantizer, faiss::gpu::GpuIndexFlat, faiss::IndexIVFPQ, and faiss::IndexPQ.

    -

    Definition at line 50 of file Index.cpp.

    +

    Definition at line 49 of file Index.cpp.

    @@ -643,11 +643,11 @@ bool faiss::IndexPreTransform, faiss::IndexIVFFlatIPBounds, faiss::IndexIVFPQR, faiss::IndexFlat1D, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, faiss::MultiIndexQuantizer, faiss::IndexSplitVectors, faiss::IndexRefineFlat, faiss::IndexShards, faiss::IndexScalarQuantizer, faiss::IndexIVFScalarQuantizer, faiss::gpu::GpuIndexFlat, faiss::IndexFlatL2BaseShift, faiss::gpu::GpuIndex, faiss::IndexIVFPQ, faiss::gpu::IndexProxy, faiss::IndexLSH, faiss::IndexPQ, faiss::IndexIDMap, and faiss::IndexFlat.

    +

    Implemented in faiss::IndexPreTransform, faiss::IndexIVFFlatIPBounds, faiss::IndexIVFPQR, faiss::IndexFlat1D, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, faiss::MultiIndexQuantizer, faiss::IndexSplitVectors, faiss::IndexRefineFlat, faiss::IndexShards, faiss::IndexScalarQuantizer, faiss::gpu::GpuIndexFlat, faiss::IndexFlatL2BaseShift, faiss::gpu::GpuIndex, faiss::IndexIVFPQ, faiss::gpu::IndexProxy, faiss::IndexLSH, faiss::IndexPQ, faiss::IndexIDMap, and faiss::IndexFlat.

    - +
    @@ -658,13 +658,13 @@ bool  - + - + diff --git a/docs/html/structfaiss_1_1IndexFlat-members.html b/docs/html/structfaiss_1_1IndexFlat-members.html index 913bfe4ad..3ebc750d3 100644 --- a/docs/html/structfaiss_1_1IndexFlat-members.html +++ b/docs/html/structfaiss_1_1IndexFlat-members.html @@ -113,7 +113,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - + diff --git a/docs/html/structfaiss_1_1IndexFlat.html b/docs/html/structfaiss_1_1IndexFlat.html index aea1dbd96..d9bf13982 100644 --- a/docs/html/structfaiss_1_1IndexFlat.html +++ b/docs/html/structfaiss_1_1IndexFlat.html @@ -135,8 +135,8 @@ void  - - + + diff --git a/docs/html/structfaiss_1_1IndexFlat1D-members.html b/docs/html/structfaiss_1_1IndexFlat1D-members.html index 95bbf71cc..680144781 100644 --- a/docs/html/structfaiss_1_1IndexFlat1D-members.html +++ b/docs/html/structfaiss_1_1IndexFlat1D-members.html @@ -118,7 +118,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - + diff --git a/docs/html/structfaiss_1_1IndexFlat1D.html b/docs/html/structfaiss_1_1IndexFlat1D.html index 73af30420..8a4c08961 100644 --- a/docs/html/structfaiss_1_1IndexFlat1D.html +++ b/docs/html/structfaiss_1_1IndexFlat1D.html @@ -148,8 +148,8 @@ void  - - + + diff --git a/docs/html/structfaiss_1_1IndexFlatIP-members.html b/docs/html/structfaiss_1_1IndexFlatIP-members.html index 2af70f2b0..61bbbe364 100644 --- a/docs/html/structfaiss_1_1IndexFlatIP-members.html +++ b/docs/html/structfaiss_1_1IndexFlatIP-members.html @@ -115,7 +115,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - + diff --git a/docs/html/structfaiss_1_1IndexFlatIP.html b/docs/html/structfaiss_1_1IndexFlatIP.html index 4be57745e..eeb99ff2e 100644 --- a/docs/html/structfaiss_1_1IndexFlatIP.html +++ b/docs/html/structfaiss_1_1IndexFlatIP.html @@ -133,8 +133,8 @@ void  - - + + diff --git a/docs/html/structfaiss_1_1IndexFlatL2-members.html b/docs/html/structfaiss_1_1IndexFlatL2-members.html index 1c36183a5..c9dcef929 100644 --- a/docs/html/structfaiss_1_1IndexFlatL2-members.html +++ b/docs/html/structfaiss_1_1IndexFlatL2-members.html @@ -115,7 +115,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - + diff --git a/docs/html/structfaiss_1_1IndexFlatL2.html b/docs/html/structfaiss_1_1IndexFlatL2.html index 16f782815..a32581f06 100644 --- a/docs/html/structfaiss_1_1IndexFlatL2.html +++ b/docs/html/structfaiss_1_1IndexFlatL2.html @@ -135,8 +135,8 @@ void  - - + + diff --git a/docs/html/structfaiss_1_1IndexFlatL2BaseShift-members.html b/docs/html/structfaiss_1_1IndexFlatL2BaseShift-members.html index 3f67a9ca5..1d5ee6961 100644 --- a/docs/html/structfaiss_1_1IndexFlatL2BaseShift-members.html +++ b/docs/html/structfaiss_1_1IndexFlatL2BaseShift-members.html @@ -117,7 +117,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - + diff --git a/docs/html/structfaiss_1_1IndexFlatL2BaseShift.html b/docs/html/structfaiss_1_1IndexFlatL2BaseShift.html index 799b8380b..84239a39b 100644 --- a/docs/html/structfaiss_1_1IndexFlatL2BaseShift.html +++ b/docs/html/structfaiss_1_1IndexFlatL2BaseShift.html @@ -139,8 +139,8 @@ void  - - + + diff --git a/docs/html/structfaiss_1_1IndexIDMap.html b/docs/html/structfaiss_1_1IndexIDMap.html index 8d171246c..dce8ab9de 100644 --- a/docs/html/structfaiss_1_1IndexIDMap.html +++ b/docs/html/structfaiss_1_1IndexIDMap.html @@ -325,13 +325,13 @@ typedef long  - + - + @@ -354,7 +354,7 @@ typedef long 
    virtual void faiss::Index::train ( idx_t n, ,
    const float * x  
    remove_ids(const IDSelector &sel) overridefaiss::IndexFlatvirtual
    reset() overridefaiss::IndexFlatvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexFlatvirtual
    train(idx_t n, const float *x)faiss::Indexinlinevirtual
    train(idx_t, const float *)faiss::Indexinlinevirtual
    verbosefaiss::Index
    xbfaiss::IndexFlat
    ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual
     Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)
     
    virtual void train (idx_t n, const float *x)
     
    virtual void train (idx_t, const float *)
     
    virtual void add_with_ids (idx_t n, const float *x, const long *xids)
     
    void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1)
    remove_ids(const IDSelector &sel) overridefaiss::IndexFlatvirtual
    reset() overridefaiss::IndexFlat1Dvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexFlat1Dvirtual
    train(idx_t n, const float *x)faiss::Indexinlinevirtual
    train(idx_t, const float *)faiss::Indexinlinevirtual
    update_permutation()faiss::IndexFlat1D
    verbosefaiss::Index
    xbfaiss::IndexFlat
     Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)
     
    virtual void train (idx_t n, const float *x)
     
    virtual void train (idx_t, const float *)
     
    virtual void add_with_ids (idx_t n, const float *x, const long *xids)
     
    void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1)
    remove_ids(const IDSelector &sel) overridefaiss::IndexFlatvirtual
    reset() overridefaiss::IndexFlatvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexFlatvirtual
    train(idx_t n, const float *x)faiss::Indexinlinevirtual
    train(idx_t, const float *)faiss::Indexinlinevirtual
    verbosefaiss::Index
    xbfaiss::IndexFlat
    ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual
     Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)
     
    virtual void train (idx_t n, const float *x)
     
    virtual void train (idx_t, const float *)
     
    virtual void add_with_ids (idx_t n, const float *x, const long *xids)
     
    void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1)
    remove_ids(const IDSelector &sel) overridefaiss::IndexFlatvirtual
    reset() overridefaiss::IndexFlatvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexFlatvirtual
    train(idx_t n, const float *x)faiss::Indexinlinevirtual
    train(idx_t, const float *)faiss::Indexinlinevirtual
    verbosefaiss::Index
    xbfaiss::IndexFlat
    ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual
     Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)
     
    virtual void train (idx_t n, const float *x)
     
    virtual void train (idx_t, const float *)
     
    virtual void add_with_ids (idx_t n, const float *x, const long *xids)
     
    void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1)
    reset() overridefaiss::IndexFlatvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexFlatL2BaseShiftvirtual
    shift (defined in faiss::IndexFlatL2BaseShift)faiss::IndexFlatL2BaseShift
    train(idx_t n, const float *x)faiss::Indexinlinevirtual
    train(idx_t, const float *)faiss::Indexinlinevirtual
    verbosefaiss::Index
    xbfaiss::IndexFlat
    ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual
     Index (idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT)
     
    virtual void train (idx_t n, const float *x)
     
    virtual void train (idx_t, const float *)
     
    virtual void add_with_ids (idx_t n, const float *x, const long *xids)
     
    void assign (idx_t n, const float *x, idx_t *labels, idx_t k=1)
    void faiss::IndexIDMap::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 47 of file MetaIndexes.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexIVF.html b/docs/html/structfaiss_1_1IndexIVF.html index 43d5ecf26..3daa66682 100644 --- a/docs/html/structfaiss_1_1IndexIVF.html +++ b/docs/html/structfaiss_1_1IndexIVF.html @@ -102,11 +102,10 @@ Inheritance diagram for faiss::IndexIVF:
    -faiss::Index +faiss::Index faiss::IndexIVFFlat faiss::IndexIVFPQ faiss::IndexIVFScalarQuantizer -faiss::IndexIVFScalarQuantizer faiss::IndexIVFFlatIPBounds faiss::IndexIVFPQCompact faiss::IndexIVFPQR @@ -346,7 +345,7 @@ typedef long 

    moves the entries from another dataset to self. On output, other is empty. add_id is added to all moved ids (for sequential ids, this would be this->ntotal

    -

    Definition at line 169 of file IndexIVF.cpp.

    +

    Definition at line 168 of file IndexIVF.cpp.

    @@ -373,7 +372,7 @@ typedef long 

    implemented by sub-classes

    -

    Implemented in faiss::IndexIVFPQR, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, faiss::IndexIVFPQ, and faiss::IndexIVFScalarQuantizer.

    +

    Implemented in faiss::IndexIVFPQR, faiss::IndexIVFFlat, faiss::IndexIVFScalarQuantizer, and faiss::IndexIVFPQ.

    @@ -410,7 +409,7 @@ typedef long 

    Sub-classes that encode the residuals can train their encoders here does nothing by default

    -

    Reimplemented in faiss::IndexIVFPQR, faiss::IndexIVFScalarQuantizer, faiss::IndexIVFScalarQuantizer, and faiss::IndexIVFPQ.

    +

    Reimplemented in faiss::IndexIVFPQR, faiss::IndexIVFScalarQuantizer, and faiss::IndexIVFPQ.

    Definition at line 131 of file IndexIVF.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexIVF.png b/docs/html/structfaiss_1_1IndexIVF.png index 42f4d8aea..9c00d31e9 100644 Binary files a/docs/html/structfaiss_1_1IndexIVF.png and b/docs/html/structfaiss_1_1IndexIVF.png differ diff --git a/docs/html/structfaiss_1_1IndexIVFFlat.html b/docs/html/structfaiss_1_1IndexIVFFlat.html index edf199c63..3d2ac119f 100644 --- a/docs/html/structfaiss_1_1IndexIVFFlat.html +++ b/docs/html/structfaiss_1_1IndexIVFFlat.html @@ -305,7 +305,7 @@ typedef long 
    		copy a subset of the entries index to the other index

    if subset_type == 0: copies ids in [a1, a2) if subset_type == 1: copies ids if id % a1 == a2

    -

    Definition at line 463 of file IndexIVF.cpp.

    +

    Definition at line 462 of file IndexIVF.cpp.

    @@ -334,7 +334,7 @@ typedef long     		Implements faiss::IndexIVF.

    -

    Definition at line 451 of file IndexIVF.cpp.

    +

    Definition at line 450 of file IndexIVF.cpp.

    @@ -394,7 +394,7 @@ typedef long     		Reimplemented from faiss::Index.

    -

    Definition at line 401 of file IndexIVF.cpp.

    +

    Definition at line 400 of file IndexIVF.cpp.

    @@ -441,7 +441,7 @@ typedef long     		Reimplemented from faiss::Index.

    -

    Definition at line 573 of file IndexIVF.cpp.

    +

    Definition at line 572 of file IndexIVF.cpp.

    @@ -470,7 +470,7 @@ typedef long     		Reimplemented from faiss::Index.

    -

    Definition at line 541 of file IndexIVF.cpp.

    +

    Definition at line 540 of file IndexIVF.cpp.

    @@ -538,7 +538,7 @@ typedef long     		Reimplemented in faiss::IndexIVFFlatIPBounds.

    -

    Definition at line 373 of file IndexIVF.cpp.

    +

    Definition at line 372 of file IndexIVF.cpp.

    @@ -582,7 +582,7 @@ typedef long     		 -

    Definition at line 488 of file IndexIVF.cpp.

    +

    Definition at line 487 of file IndexIVF.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexIVFFlatIPBounds.html b/docs/html/structfaiss_1_1IndexIVFFlatIPBounds.html index 7c0e466fa..dd0ed09d0 100644 --- a/docs/html/structfaiss_1_1IndexIVFFlatIPBounds.html +++ b/docs/html/structfaiss_1_1IndexIVFFlatIPBounds.html @@ -339,7 +339,7 @@ typedef long     		Reimplemented from faiss::IndexIVFFlat.

    -

    Definition at line 694 of file IndexIVF.cpp.

    +

    Definition at line 693 of file IndexIVF.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexIVFPQCompact.html b/docs/html/structfaiss_1_1IndexIVFPQCompact.html index 2e8a0e594..cab3dda8b 100644 --- a/docs/html/structfaiss_1_1IndexIVFPQCompact.html +++ b/docs/html/structfaiss_1_1IndexIVFPQCompact.html @@ -444,7 +444,7 @@ bool     		faiss::IndexIVFPQ.

    -

    Definition at line 1483 of file IndexIVFPQ.cpp.

    +

    Definition at line 1482 of file IndexIVFPQ.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer-members.html b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer-members.html index be1bbd823..c72b764f8 100644 --- a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer-members.html +++ b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer-members.html @@ -95,31 +95,27 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + @@ -135,10 +131,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - - - - + + diff --git a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.html b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.html index 5034bdbc9..0c8476ec5 100644 --- a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.html +++ b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.html @@ -103,9 +103,7 @@ Inheritance diagram for faiss::IndexIVFScalarQuantizer: faiss::IndexIVF -faiss::IndexIVF faiss::Index -faiss::Index
    add(idx_t n, const float *x) overridefaiss::IndexIVFvirtual
    add_with_ids(idx_t n, const float *x, const long *xids) overridefaiss::IndexIVFScalarQuantizervirtual
    add_with_ids(idx_t n, const float *x, const long *xids) overridefaiss::IndexIVFScalarQuantizervirtual
    assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)faiss::Index
    code_size (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    codesfaiss::IndexIVFScalarQuantizer
    compute_residual(const float *x, float *residual, idx_t key) const faiss::Index
    cpfaiss::IndexIVF
    dfaiss::Index
    direct_map (defined in faiss::IndexIVF)faiss::IndexIVF
    display() const faiss::Index
    get_list_size(size_t list_no) const (defined in faiss::IndexIVF)faiss::IndexIVFinline
    idsfaiss::IndexIVF
    idx_t typedeffaiss::Index
    imbalance_factor() const faiss::IndexIVF
    Index(idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT) (defined in faiss::Index)faiss::Indexinlineexplicit
    IndexIVF(Index *quantizer, size_t d, size_t nlist, MetricType metric=METRIC_INNER_PRODUCT)faiss::IndexIVF
    IndexIVF() (defined in faiss::IndexIVF)faiss::IndexIVF
    IndexIVFScalarQuantizer(Index *quantizer, size_t d, size_t nlist, ScalarQuantizer::QuantizerType qtype, MetricType metric=METRIC_L2) (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    IndexIVFScalarQuantizer() (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    IndexIVFScalarQuantizer(Index *quantizer, size_t d, size_t nlist, ScalarQuantizer::QuantizerType qtype, MetricType metric=METRIC_L2) (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    IndexIVFScalarQuantizer() (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    is_trainedfaiss::Index
    maintain_direct_mapfaiss::IndexIVF
    make_direct_map(bool new_maintain_direct_map=true)faiss::IndexIVF
    merge_from(IndexIVF &other, idx_t add_id)faiss::IndexIVFvirtual
    merge_from_residuals(IndexIVF &other) overridefaiss::IndexIVFScalarQuantizervirtual
    assign(idx_t n, const float *x, idx_t *labels, idx_t k=1)faiss::Index
    code_size (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    codesfaiss::IndexIVFScalarQuantizer
    compute_residual(const float *x, float *residual, idx_t key) const faiss::Index
    cpfaiss::IndexIVF
    dfaiss::Index
    direct_map (defined in faiss::IndexIVF)faiss::IndexIVF
    display() const faiss::Index
    get_list_size(size_t list_no) const (defined in faiss::IndexIVF)faiss::IndexIVFinline
    idsfaiss::IndexIVF
    idx_t typedeffaiss::Index
    imbalance_factor() const faiss::IndexIVF
    Index(idx_t d=0, MetricType metric=METRIC_INNER_PRODUCT) (defined in faiss::Index)faiss::Indexinlineexplicit
    IndexIVF(Index *quantizer, size_t d, size_t nlist, MetricType metric=METRIC_INNER_PRODUCT)faiss::IndexIVF
    IndexIVF() (defined in faiss::IndexIVF)faiss::IndexIVF
    IndexIVFScalarQuantizer(Index *quantizer, size_t d, size_t nlist, ScalarQuantizer::QuantizerType qtype, MetricType metric=METRIC_L2) (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    IndexIVFScalarQuantizer() (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    is_trainedfaiss::Index
    maintain_direct_mapfaiss::IndexIVF
    make_direct_map(bool new_maintain_direct_map=true)faiss::IndexIVF
    merge_from(IndexIVF &other, idx_t add_id)faiss::IndexIVFvirtual
    merge_from_residuals(IndexIVF &other) overridefaiss::IndexIVFScalarQuantizervirtual
    metric_typefaiss::Index
    nlistfaiss::IndexIVF
    remove_ids(const IDSelector &sel)faiss::Indexvirtual
    reset() overridefaiss::IndexIVFvirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexIVFScalarQuantizervirtual
    search(idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const overridefaiss::IndexIVFScalarQuantizervirtual
    sq (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    train(idx_t n, const float *x) overridefaiss::IndexIVFvirtual
    train_residual(idx_t n, const float *x) overridefaiss::IndexIVFScalarQuantizervirtual
    sq (defined in faiss::IndexIVFScalarQuantizer)faiss::IndexIVFScalarQuantizer
    train(idx_t n, const float *x) overridefaiss::IndexIVFvirtual
    train_residual(idx_t n, const float *x) overridefaiss::IndexIVFScalarQuantizervirtual
    verbosefaiss::Index
    ~Index() (defined in faiss::Index)faiss::Indexinlinevirtual
    @@ -122,17 +120,6 @@ Public Member Functions - - - - - - - - - - @@ -190,11 +177,11 @@ Public Attributes - - - +< uint8_t > >  + + @@ -264,7 +251,7 @@ typedef long  - + - + @@ -403,7 +403,7 @@ bool  - + - + @@ -666,7 +666,7 @@ bool  - + - + @@ -514,7 +514,7 @@ typedef long  - + - + @@ -345,7 +345,7 @@ typedef long  - + - + @@ -481,7 +481,7 @@ typedef long  - + - + @@ -409,7 +409,7 @@ typedef long  - + - + @@ -350,9 +350,9 @@ typedef long  - + - + @@ -381,9 +381,9 @@ typedef long 
     
    void merge_from_residuals (IndexIVF &other) override
     
    - IndexIVFScalarQuantizer (Index *quantizer, size_t d, size_t nlist, ScalarQuantizer::QuantizerType qtype, MetricType metric=METRIC_L2)
     
    void train_residual (idx_t n, const float *x) override
     
    void add_with_ids (idx_t n, const float *x, const long *xids) override
     
    void search (idx_t n, const float *x, idx_t k, float *distances, idx_t *labels) const override
     
    void merge_from_residuals (IndexIVF &other) override
     
    - Public Member Functions inherited from faiss::IndexIVF
     IndexIVF (Index *quantizer, size_t d, size_t nlist, MetricType metric=METRIC_INNER_PRODUCT)
     
    size_t code_size
     
    +
    std::vector< std::vector
    -< uint8_t > >     		codes
     inverted list codes.
     
    codes
     inverted list codes.
     
    - Public Attributes inherited from faiss::IndexIVF
    size_t nlist

    Detailed Description

    An IVF implementation where the components of the residuals are encoded with a scalar uniform quantizer. All distance computations are asymmetric, so the encoded vectors are decoded and approximate distances are computed.

    -

    Definition at line 86 of file IndexIVFScalarQuantizer.h.

    +

    Definition at line 129 of file IndexScalarQuantizer.h.

    Member Function Documentation

    @@ -314,57 +301,7 @@ typedef long 
    		Reimplemented from faiss::Index.

    -

    Definition at line 733 of file IndexIVFScalarQuantizer.cpp.

    - - - - -
    -
    - - - - - -
    - - - - - - - - - - - - - - - - - - - - - - - - -
    void faiss::IndexIVFScalarQuantizer::add_with_ids (idx_t n,
    const float * x,
    const long * xids 
    )
    -     		-overridevirtual
    -
    -

    Same as add, but stores xids instead of sequential ids.

    -

    The default implementation fails with an assertion, as it is not supported by all indexes.

    -
    Parameters
    - - -
    xidsif non-null, ids to store for the vectors (size n)
    -
    -
    - -

    Reimplemented from faiss::Index.

    +

    Definition at line 843 of file IndexScalarQuantizer.cpp.

    @@ -393,34 +330,7 @@ typedef long     		Implements faiss::IndexIVF.

    -

    Definition at line 882 of file IndexIVFScalarQuantizer.cpp.

    - - - - -
    -
    - - - - - -
    - - - - - - - - -
    void faiss::IndexIVFScalarQuantizer::merge_from_residuals (IndexIVF & other)
    -     		-overridevirtual
    -
    -

    implemented by sub-classes

    - -

    Implements faiss::IndexIVF.

    +

    Definition at line 992 of file IndexScalarQuantizer.cpp.

    @@ -486,71 +396,7 @@ typedef long     		Implements faiss::Index.

    -

    Definition at line 849 of file IndexIVFScalarQuantizer.cpp.

    - - - - -
    -
    - - - - - -
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    void faiss::IndexIVFScalarQuantizer::search (idx_t n,
    const float * x,
    idx_t k,
    float * distances,
    idx_t * labels 
    ) const
    -     		-overridevirtual
    -
    -

    query n vectors of dimension d to the index.

    -

    return at most k vectors. If there are not enough results for a query, the result array is padded with -1s.

    -
    Parameters
    - - - - -
    xinput vectors to search, size n * d
    labelsoutput labels of the NNs, size n*k
    distancesoutput pairwise distances, size n*k
    -
    -
    - -

    Implements faiss::Index.

    +

    Definition at line 959 of file IndexScalarQuantizer.cpp.

    @@ -589,51 +435,12 @@ typedef long     		Reimplemented from faiss::IndexIVF.

    -

    Definition at line 714 of file IndexIVFScalarQuantizer.cpp.

    - - - - -
    -
    - - - - - -
    - - - - - - - - - - - - - - - - - - -
    void faiss::IndexIVFScalarQuantizer::train_residual (idx_t n,
    const float * x 
    )
    -     		-overridevirtual
    -
    -

    Sub-classes that encode the residuals can train their encoders here does nothing by default

    - -

    Reimplemented from faiss::IndexIVF.

    +

    Definition at line 824 of file IndexScalarQuantizer.cpp.

    The documentation for this struct was generated from the following files: diff --git a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.png b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.png index 25a5038d2..ae3cf9d4e 100644 Binary files a/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.png and b/docs/html/structfaiss_1_1IndexIVFScalarQuantizer.png differ diff --git a/docs/html/structfaiss_1_1IndexLSH.html b/docs/html/structfaiss_1_1IndexLSH.html index 94a5a984a..bfbd918dd 100644 --- a/docs/html/structfaiss_1_1IndexLSH.html +++ b/docs/html/structfaiss_1_1IndexLSH.html @@ -374,13 +374,13 @@ bool     		void faiss::IndexLSH::train ( idx_t n, ,
    const float * x  
    faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 85 of file IndexLSH.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexPQ.html b/docs/html/structfaiss_1_1IndexPQ.html index 08edb80ca..330e7741c 100644 --- a/docs/html/structfaiss_1_1IndexPQ.html +++ b/docs/html/structfaiss_1_1IndexPQ.html @@ -637,13 +637,13 @@ bool     		void faiss::IndexPQ::train ( idx_t n, ,
    const float * x  
    faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 54 of file IndexPQ.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexPreTransform.html b/docs/html/structfaiss_1_1IndexPreTransform.html index 4ccea10fb..4bf389943 100644 --- a/docs/html/structfaiss_1_1IndexPreTransform.html +++ b/docs/html/structfaiss_1_1IndexPreTransform.html @@ -485,13 +485,13 @@ typedef long     		void IndexPreTransform::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 790 of file VectorTransform.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexRefineFlat.html b/docs/html/structfaiss_1_1IndexRefineFlat.html index 8ad48937f..61f826812 100644 --- a/docs/html/structfaiss_1_1IndexRefineFlat.html +++ b/docs/html/structfaiss_1_1IndexRefineFlat.html @@ -316,13 +316,13 @@ typedef long     		void faiss::IndexRefineFlat::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 171 of file IndexFlat.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexScalarQuantizer.html b/docs/html/structfaiss_1_1IndexScalarQuantizer.html index 999ba9629..f2999c602 100644 --- a/docs/html/structfaiss_1_1IndexScalarQuantizer.html +++ b/docs/html/structfaiss_1_1IndexScalarQuantizer.html @@ -452,13 +452,13 @@ typedef long     		void faiss::IndexScalarQuantizer::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 713 of file IndexScalarQuantizer.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexShards.html b/docs/html/structfaiss_1_1IndexShards.html index 305f59814..f6cccb7db 100644 --- a/docs/html/structfaiss_1_1IndexShards.html +++ b/docs/html/structfaiss_1_1IndexShards.html @@ -380,13 +380,13 @@ typedef long     		void faiss::IndexShards::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    Definition at line 385 of file MetaIndexes.cpp.

    diff --git a/docs/html/structfaiss_1_1IndexSplitVectors.html b/docs/html/structfaiss_1_1IndexSplitVectors.html index 1fb47615e..3457c3a60 100644 --- a/docs/html/structfaiss_1_1IndexSplitVectors.html +++ b/docs/html/structfaiss_1_1IndexSplitVectors.html @@ -306,7 +306,7 @@ typedef long     		Implements faiss::Index.

    -

    Definition at line 655 of file MetaIndexes.cpp.

    +

    Definition at line 654 of file MetaIndexes.cpp.

    @@ -321,13 +321,13 @@ typedef long     		void faiss::IndexSplitVectors::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    -

    Definition at line 713 of file MetaIndexes.cpp.

    +

    Definition at line 711 of file MetaIndexes.cpp.

    diff --git a/docs/html/structfaiss_1_1MultiIndexQuantizer.html b/docs/html/structfaiss_1_1MultiIndexQuantizer.html index cb04da8c3..de04aad73 100644 --- a/docs/html/structfaiss_1_1MultiIndexQuantizer.html +++ b/docs/html/structfaiss_1_1MultiIndexQuantizer.html @@ -271,7 +271,7 @@ typedef long     		Reimplemented from faiss::Index.

    -

    Definition at line 860 of file IndexPQ.cpp.

    +

    Definition at line 861 of file IndexPQ.cpp.

    @@ -337,7 +337,7 @@ typedef long     		Implements faiss::Index.

    -

    Definition at line 804 of file IndexPQ.cpp.

    +

    Definition at line 805 of file IndexPQ.cpp.

    @@ -352,13 +352,13 @@ typedef long     		void faiss::MultiIndexQuantizer::train ( idx_t n, ,
    const float * x  
    -

    Reimplemented from faiss::Index.

    +

    Reimplemented from faiss::Index.

    -

    Definition at line 793 of file IndexPQ.cpp.

    +

    Definition at line 794 of file IndexPQ.cpp.

    diff --git a/docs/html/structfaiss_1_1NopDistanceCorrection-members.html b/docs/html/structfaiss_1_1NopDistanceCorrection-members.html index 9aaababd7..53654a9bb 100644 --- a/docs/html/structfaiss_1_1NopDistanceCorrection-members.html +++ b/docs/html/structfaiss_1_1NopDistanceCorrection-members.html @@ -93,7 +93,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

    This is the complete list of members for faiss::NopDistanceCorrection, including all inherited members.

    - +
    operator()(float dis, size_t qno, size_t bno) const (defined in faiss::NopDistanceCorrection)faiss::NopDistanceCorrectioninline
    operator()(float dis, size_t, size_t) const (defined in faiss::NopDistanceCorrection)faiss::NopDistanceCorrectioninline
    diff --git a/docs/html/structfaiss_1_1NopDistanceCorrection.html b/docs/html/structfaiss_1_1NopDistanceCorrection.html index 8cac65028..803e7a5ff 100644 --- a/docs/html/structfaiss_1_1NopDistanceCorrection.html +++ b/docs/html/structfaiss_1_1NopDistanceCorrection.html @@ -96,9 +96,9 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - - + +

    Public Member Functions

    -float operator() (float dis, size_t qno, size_t bno) const
     
    +float operator() (float dis, size_t, size_t) const
     

    Detailed Description

    diff --git a/docs/html/structfaiss_1_1ScalarQuantizer-members.html b/docs/html/structfaiss_1_1ScalarQuantizer-members.html index cd93e13ce..6703fa123 100644 --- a/docs/html/structfaiss_1_1ScalarQuantizer-members.html +++ b/docs/html/structfaiss_1_1ScalarQuantizer-members.html @@ -95,32 +95,25 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); - - - + - + - - + + - - - - - - - - + + + + - - +
    code_sizefaiss::ScalarQuantizer
    compute_codes(const float *x, uint8_t *codes, size_t n) const faiss::ScalarQuantizer
    compute_codes(const float *x, uint8_t *codes, size_t n) const faiss::ScalarQuantizer
    dfaiss::ScalarQuantizer
    decode(const uint8_t *code, float *x, size_t n) const faiss::ScalarQuantizer
    dfaiss::ScalarQuantizer
    decode(const uint8_t *code, float *x, size_t n) const faiss::ScalarQuantizer
    QT_4bit enum valuefaiss::ScalarQuantizer
    QT_4bit enum valuefaiss::ScalarQuantizer
    QT_4bit_uniform enum value (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    QT_8bit enum valuefaiss::ScalarQuantizer
    QT_8bit_uniform enum valuefaiss::ScalarQuantizer
    QT_8bit enum valuefaiss::ScalarQuantizer
    QT_8bit_uniform enum valuefaiss::ScalarQuantizer
    qtype (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    QuantizerType enum namefaiss::ScalarQuantizer
    QuantizerType enum namefaiss::ScalarQuantizer
    RangeStat enum namefaiss::ScalarQuantizer
    RangeStat enum namefaiss::ScalarQuantizer
    rangestat (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    rangestat_arg (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    RS_meanstd enum valuefaiss::ScalarQuantizer
    RS_minmax enum valuefaiss::ScalarQuantizer
    RS_optim enum valuefaiss::ScalarQuantizer
    RS_quantiles enum valuefaiss::ScalarQuantizer
    ScalarQuantizer(size_t d, QuantizerType qtype) (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    ScalarQuantizer() (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    RS_meanstd enum valuefaiss::ScalarQuantizer
    RS_minmax enum valuefaiss::ScalarQuantizer
    RS_optim enum valuefaiss::ScalarQuantizer
    RS_quantiles enum valuefaiss::ScalarQuantizer
    ScalarQuantizer(size_t d, QuantizerType qtype) (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    ScalarQuantizer() (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    train(size_t n, const float *x) (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    train(size_t n, const float *x) (defined in faiss::ScalarQuantizer)faiss::ScalarQuantizer
    trainedfaiss::ScalarQuantizer
    trainedfaiss::ScalarQuantizer
    diff --git a/docs/html/structfaiss_1_1ScalarQuantizer.html b/docs/html/structfaiss_1_1ScalarQuantizer.html index f9c231f94..0e6b716b6 100644 --- a/docs/html/structfaiss_1_1ScalarQuantizer.html +++ b/docs/html/structfaiss_1_1ScalarQuantizer.html @@ -96,60 +96,20 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    -

    #include <IndexIVFScalarQuantizer.h>

    +

    #include <IndexScalarQuantizer.h>

    - - - - - -

    Public Types

    enum  QuantizerType {
    -  QT_8bit, -QT_4bit, -QT_8bit_uniform, -QT_4bit_uniform, -
    -  QT_8bit, -QT_4bit, -QT_8bit_uniform, +
    enum  QuantizerType { QT_8bit, +QT_4bit, +QT_8bit_uniform, QT_4bit_uniform -
    }
     
    enum  RangeStat {
    -  RS_minmax, -RS_meanstd, -RS_quantiles, -RS_optim, -
    -  RS_minmax, -RS_meanstd, -RS_quantiles, -RS_optim -
    - }
     
    enum  QuantizerType {
    -  QT_8bit, -QT_4bit, -QT_8bit_uniform, -QT_4bit_uniform, -
    -  QT_8bit, -QT_4bit, -QT_8bit_uniform, -QT_4bit_uniform -
    - }
     
    enum  RangeStat {
    -  RS_minmax, -RS_meanstd, -RS_quantiles, -RS_optim, -
    -  RS_minmax, -RS_meanstd, -RS_quantiles, -RS_optim -
    +
    enum  RangeStat { RS_minmax, +RS_meanstd, +RS_quantiles, +RS_optim }
     
    @@ -169,20 +129,6 @@ void  - - - - - - - - - -
    decode (const uint8_t *code, float *x, size_t n) const
     decode a vector from a given code (or n vectors if third argument)
     
    - ScalarQuantizer (size_t d, QuantizerType qtype)
     
    -void train (size_t n, const float *x)
     
    -void compute_codes (const float *x, uint8_t *codes, size_t n) const
     same as compute_code for several vectors
     
    -void decode (const uint8_t *code, float *x, size_t n) const
     decode a vector from a given code (or n vectors if third argument)
     
    @@ -203,17 +149,15 @@ size_t  - - - + + +

    Public Attributes

    code_size
     bytes per vector
     
    -std::vector< float > trained
     trained values (including the range)
     
    +std::vector< float > trained
     trained values (including the range)
     

    Detailed Description

    -

    An IVF implementation where the components of the residuals are encoded with a scalar uniform quantizer. All distance computations are asymmetric, so the encoded vectors are decoded and approximate distances are computed.

    -

    The uniform quantizer has a range [vmin, vmax]. The range can be the same for all dimensions (uniform) or specific per dimension (default).

    -

    The uniform quantizer has a range [vmin, vmax]. The range can be the same for all dimensions (uniform) or specific per dimension (default).

    +

    The uniform quantizer has a range [vmin, vmax]. The range can be the same for all dimensions (uniform) or specific per dimension (default).

    -

    Definition at line 34 of file IndexIVFScalarQuantizer.h.

    +

    Definition at line 30 of file IndexScalarQuantizer.h.

    Member Enumeration Documentation

    @@ -225,62 +169,19 @@ std::vector< float > 
    - - - - - -
    Enumerator
    QT_8bit  +
    Enumerator
    QT_8bit 

    8 bits per component

    QT_4bit  +
    QT_4bit 

    4 bits per component

    QT_8bit_uniform  -

    same, shared range for all dimensions

    -
    QT_8bit  -

    8 bits per component

    -
    QT_4bit  -

    4 bits per component

    -
    QT_8bit_uniform  +
    QT_8bit_uniform 

    same, shared range for all dimensions

    Definition at line 32 of file IndexScalarQuantizer.h.

    -
    - - -
    -
    - - - - -
    enum faiss::ScalarQuantizer::QuantizerType
    -
    - - - - - - - -
    Enumerator
    QT_8bit  -

    8 bits per component

    -
    QT_4bit  -

    4 bits per component

    -
    QT_8bit_uniform  -

    same, shared range for all dimensions

    -
    QT_8bit  -

    8 bits per component

    -
    QT_4bit  -

    4 bits per component

    -
    QT_8bit_uniform  -

    same, shared range for all dimensions

    -
    - -

    Definition at line 36 of file IndexIVFScalarQuantizer.h.

    -
    @@ -294,81 +195,26 @@ std::vector< float > 

    The uniform encoder can estimate the range of representable values of the unform encoder using different statistics. Here rs = rangestat_arg

    - - - - - - - -
    Enumerator
    RS_minmax  +
    Enumerator
    RS_minmax 

    [min - rs*(max-min), max + rs*(max-min)]

    RS_meanstd  +
    RS_meanstd 

    [mean - std * rs, mean + std * rs]

    RS_quantiles  +
    RS_quantiles 

    [Q(rs), Q(1-rs)]

    RS_optim  -

    alternate optimization of reconstruction error

    -
    RS_minmax  -

    [min - rs*(max-min), max + rs*(max-min)]

    -
    RS_meanstd  -

    [mean - std * rs, mean + std * rs]

    -
    RS_quantiles  -

    [Q(rs), Q(1-rs)]

    -
    RS_optim  +
    RS_optim 

    alternate optimization of reconstruction error

    Definition at line 46 of file IndexScalarQuantizer.h.

    -
    - - -
    -
    - - - - -
    enum faiss::ScalarQuantizer::RangeStat
    -
    -

    The uniform encoder can estimate the range of representable values of the unform encoder using different statistics. Here rs = rangestat_arg

    - - - - - - - - - -
    Enumerator
    RS_minmax  -

    [min - rs*(max-min), max + rs*(max-min)]

    -
    RS_meanstd  -

    [mean - std * rs, mean + std * rs]

    -
    RS_quantiles  -

    [Q(rs), Q(1-rs)]

    -
    RS_optim  -

    alternate optimization of reconstruction error

    -
    RS_minmax  -

    [min - rs*(max-min), max + rs*(max-min)]

    -
    RS_meanstd  -

    [mean - std * rs, mean + std * rs]

    -
    RS_quantiles  -

    [Q(rs), Q(1-rs)]

    -
    RS_optim  -

    alternate optimization of reconstruction error

    -
    - -

    Definition at line 50 of file IndexIVFScalarQuantizer.h.

    -
    The documentation for this struct was generated from the following files: diff --git a/docs/html/utils_8cpp_source.html b/docs/html/utils_8cpp_source.html index a26a18c32..9e892f1c8 100644 --- a/docs/html/utils_8cpp_source.html +++ b/docs/html/utils_8cpp_source.html @@ -1012,8 +1012,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    927 
    928 
    929 struct NopDistanceCorrection {
    -
    930  float operator()(float dis, size_t qno, size_t bno) const {
    -
    931  return dis;
    +
    930  float operator()(float dis, size_t /*qno*/, size_t /*bno*/) const {
    +
    931  return dis;
    932  }
    933 };
    934 
    @@ -1032,8 +1032,8 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    947 
    948 struct BaseShiftDistanceCorrection {
    949  const float *base_shift;
    -
    950  float operator()(float dis, size_t qno, size_t bno) const {
    -
    951  return dis - base_shift[bno];
    +
    950  float operator()(float dis, size_t /*qno*/, size_t bno) const {
    +
    951  return dis - base_shift[bno];
    952  }
    953 };
    954 
    diff --git a/gpu/GpuResources.cpp b/gpu/GpuResources.cpp index 0298847f6..848d43b19 100644 --- a/gpu/GpuResources.cpp +++ b/gpu/GpuResources.cpp @@ -41,4 +41,14 @@ GpuResources::getAsyncCopyStreamCurrentDevice() { return getAsyncCopyStream(getCurrentDevice()); } +void +GpuResources::syncDefaultStream(int device) { + CUDA_VERIFY(cudaStreamSynchronize(getDefaultStream(device))); +} + +void +GpuResources::syncDefaultStreamCurrentDevice() { + syncDefaultStream(getCurrentDevice()); +} + } } // namespace diff --git a/gpu/GpuResources.h b/gpu/GpuResources.h index 61097b19a..07197fa97 100644 --- a/gpu/GpuResources.h +++ b/gpu/GpuResources.h @@ -29,26 +29,46 @@ class GpuResources { /// of demand virtual void initializeForDevice(int device) = 0; + /// Returns the cuBLAS handle that we use for the given device virtual cublasHandle_t getBlasHandle(int device) = 0; + /// Returns the stream that we order all computation on for the + /// given device virtual cudaStream_t getDefaultStream(int device) = 0; + /// Returns the set of alternative streams that we use for the given device virtual std::vector getAlternateStreams(int device) = 0; + /// Returns the temporary memory manager for the given device virtual DeviceMemory& getMemoryManager(int device) = 0; + /// Returns the available CPU pinned memory buffer virtual std::pair getPinnedMemory() = 0; + /// Returns the stream on which we perform async CPU <-> GPU copies virtual cudaStream_t getAsyncCopyStream(int device) = 0; + /// Calls getBlasHandle with the current device cublasHandle_t getBlasHandleCurrentDevice(); + /// Calls getDefaultStream with the current device cudaStream_t getDefaultStreamCurrentDevice(); + /// Synchronizes the CPU with respect to the default stream for the + /// given device + // equivalent to cudaDeviceSynchronize(getDefaultStream(device)) + void syncDefaultStream(int device); + + /// Calls syncDefaultStream for the current device + void syncDefaultStreamCurrentDevice(); + + /// Calls getAlternateStreams for the current device std::vector getAlternateStreamsCurrentDevice(); + /// Calls getMemoryManager for the current device DeviceMemory& getMemoryManagerCurrentDevice(); + /// Calls getAsyncCopyStream for the current device cudaStream_t getAsyncCopyStreamCurrentDevice(); }; diff --git a/gpu/StandardGpuResources.cpp b/gpu/StandardGpuResources.cpp index 2e6bb7c95..3df8e0f52 100644 --- a/gpu/StandardGpuResources.cpp +++ b/gpu/StandardGpuResources.cpp @@ -38,7 +38,12 @@ StandardGpuResources::~StandardGpuResources() { for (auto& entry : defaultStreams_) { DeviceScope scope(entry.first); - CUDA_VERIFY(cudaStreamDestroy(entry.second)); + auto it = userDefaultStreams_.find(entry.first); + if (it == userDefaultStreams_.end()) { + // The user did not specify this stream, thus we are the ones + // who have created it + CUDA_VERIFY(cudaStreamDestroy(entry.second)); + } } for (auto& entry : alternateStreams_) { @@ -94,6 +99,25 @@ StandardGpuResources::setPinnedMemory(size_t size) { pinnedMemSize_ = size; } +void +StandardGpuResources::setDefaultStream(int device, cudaStream_t stream) { + auto it = defaultStreams_.find(device); + if (it != defaultStreams_.end()) { + // Replace this stream with the user stream + CUDA_VERIFY(cudaStreamDestroy(it->second)); + it->second = stream; + } + + userDefaultStreams_[device] = stream; +} + +void +StandardGpuResources::setDefaultNullStreamAllDevices() { + for (int dev = 0; dev < getNumDevices(); ++dev) { + setDefaultStream(dev, nullptr); + } +} + void StandardGpuResources::initializeForDevice(int device) { // Use default streams as a marker for whether or not a certain @@ -125,8 +149,14 @@ StandardGpuResources::initializeForDevice(int device) { // Create streams cudaStream_t defaultStream = 0; - CUDA_VERIFY(cudaStreamCreateWithFlags(&defaultStream, - cudaStreamNonBlocking)); + auto it = userDefaultStreams_.find(device); + if (it != userDefaultStreams_.end()) { + // We already have a stream provided by the user + defaultStream = it->second; + } else { + CUDA_VERIFY(cudaStreamCreateWithFlags(&defaultStream, + cudaStreamNonBlocking)); + } defaultStreams_[device] = defaultStream; diff --git a/gpu/StandardGpuResources.h b/gpu/StandardGpuResources.h index c08883e35..59d6aa778 100644 --- a/gpu/StandardGpuResources.h +++ b/gpu/StandardGpuResources.h @@ -42,6 +42,13 @@ class StandardGpuResources : public GpuResources { /// transfers void setPinnedMemory(size_t size); + /// Called to change the stream for work ordering + void setDefaultStream(int device, cudaStream_t stream); + + /// Called to change the work ordering streams to the null stream + /// for all devices + void setDefaultNullStreamAllDevices(); + public: /// Internal system calls void initializeForDevice(int device) override; @@ -62,6 +69,10 @@ class StandardGpuResources : public GpuResources { /// Our default stream that work is ordered on, one per each device std::unordered_map defaultStreams_; + /// This contains particular streams as set by the user for + /// ordering, if any + std::unordered_map userDefaultStreams_; + /// Other streams we can use, per each device std::unordered_map > alternateStreams_; diff --git a/gpu/test/TestUtils.cpp b/gpu/test/TestUtils.cpp index 9e10b1acc..faa9b5c8e 100644 --- a/gpu/test/TestUtils.cpp +++ b/gpu/test/TestUtils.cpp @@ -95,7 +95,7 @@ void compareIndices(faiss::Index& refIndex, } template -inline T lookup(const T* p, int i, int j, int dim1, int dim2) { +inline T lookup(const T* p, int i, int j, int /*dim1*/, int dim2) { return p[i * dim2 + j]; } diff --git a/hamming.cpp b/hamming.cpp index 0861d9d2c..59c88aea2 100644 --- a/hamming.cpp +++ b/hamming.cpp @@ -498,10 +498,14 @@ void hammings_knn ( (32, ha, a, b, nb, order, true); break; default: - FAISS_THROW_IF_NOT (ncodes % 8 == 0); - hammings_knn_hc - (ncodes, ha, a, b, nb, order, true); + if(ncodes % 8 == 0) { + hammings_knn_hc + (ncodes, ha, a, b, nb, order, true); + } else { + hammings_knn_hc + (ncodes, ha, a, b, nb, order, true); + } } } diff --git a/hamming.h b/hamming.h index 68cc44933..15dd35acd 100644 --- a/hamming.h +++ b/hamming.h @@ -252,6 +252,25 @@ struct HammingComputer64 { }; +struct HammingComputerDefault { + const uint8_t *a; + int n; + + HammingComputerDefault (const uint8_t *a8, int code_size) { + a = a8; + n = code_size; + } + + int hamming (const uint8_t *b8) const { + int accu = 0; + for (int i = 0; i < n; i++) + accu += popcount64 (a[i] ^ b8[i]); + return accu; + } + +}; + + struct HammingComputerM8 { const uint64_t *a; int n; diff --git a/python/swigfaiss.py b/python/swigfaiss.py index bd84a178f..e21dc275e 100644 --- a/python/swigfaiss.py +++ b/python/swigfaiss.py @@ -209,6 +209,46 @@ class OperatingPointVector(_object): OperatingPointVector_swigregister = _swigfaiss.OperatingPointVector_swigregister OperatingPointVector_swigregister(OperatingPointVector) +class FloatVectorVector(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, FloatVectorVector, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, FloatVectorVector, name) + __repr__ = _swig_repr + def __init__(self): + this = _swigfaiss.new_FloatVectorVector() + try: self.this.append(this) + except: self.this = this + def push_back(self, *args): return _swigfaiss.FloatVectorVector_push_back(self, *args) + def data(self): return _swigfaiss.FloatVectorVector_data(self) + def size(self): return _swigfaiss.FloatVectorVector_size(self) + def at(self, *args): return _swigfaiss.FloatVectorVector_at(self, *args) + def resize(self, *args): return _swigfaiss.FloatVectorVector_resize(self, *args) + __swig_destroy__ = _swigfaiss.delete_FloatVectorVector + __del__ = lambda self : None; +FloatVectorVector_swigregister = _swigfaiss.FloatVectorVector_swigregister +FloatVectorVector_swigregister(FloatVectorVector) + +class ByteVectorVector(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, ByteVectorVector, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, ByteVectorVector, name) + __repr__ = _swig_repr + def __init__(self): + this = _swigfaiss.new_ByteVectorVector() + try: self.this.append(this) + except: self.this = this + def push_back(self, *args): return _swigfaiss.ByteVectorVector_push_back(self, *args) + def data(self): return _swigfaiss.ByteVectorVector_data(self) + def size(self): return _swigfaiss.ByteVectorVector_size(self) + def at(self, *args): return _swigfaiss.ByteVectorVector_at(self, *args) + def resize(self, *args): return _swigfaiss.ByteVectorVector_resize(self, *args) + __swig_destroy__ = _swigfaiss.delete_ByteVectorVector + __del__ = lambda self : None; +ByteVectorVector_swigregister = _swigfaiss.ByteVectorVector_swigregister +ByteVectorVector_swigregister(ByteVectorVector) + def popcount64(*args): return _swigfaiss.popcount64(*args) @@ -402,6 +442,28 @@ class HammingComputer64(_object): HammingComputer64_swigregister = _swigfaiss.HammingComputer64_swigregister HammingComputer64_swigregister(HammingComputer64) +class HammingComputerDefault(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, HammingComputerDefault, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, HammingComputerDefault, name) + __repr__ = _swig_repr + __swig_setmethods__["a"] = _swigfaiss.HammingComputerDefault_a_set + __swig_getmethods__["a"] = _swigfaiss.HammingComputerDefault_a_get + if _newclass:a = _swig_property(_swigfaiss.HammingComputerDefault_a_get, _swigfaiss.HammingComputerDefault_a_set) + __swig_setmethods__["n"] = _swigfaiss.HammingComputerDefault_n_set + __swig_getmethods__["n"] = _swigfaiss.HammingComputerDefault_n_get + if _newclass:n = _swig_property(_swigfaiss.HammingComputerDefault_n_get, _swigfaiss.HammingComputerDefault_n_set) + def __init__(self, *args): + this = _swigfaiss.new_HammingComputerDefault(*args) + try: self.this.append(this) + except: self.this = this + def hamming(self, *args): return _swigfaiss.HammingComputerDefault_hamming(self, *args) + __swig_destroy__ = _swigfaiss.delete_HammingComputerDefault + __del__ = lambda self : None; +HammingComputerDefault_swigregister = _swigfaiss.HammingComputerDefault_swigregister +HammingComputerDefault_swigregister(HammingComputerDefault) + class HammingComputerM8(_object): __swig_setmethods__ = {} __setattr__ = lambda self, name, value: _swig_setattr(self, HammingComputerM8, name, value) @@ -2575,6 +2637,18 @@ omp_get_max_threads = _swigfaiss.omp_get_max_threads def memcpy(*args): return _swigfaiss.memcpy(*args) memcpy = _swigfaiss.memcpy + +def cast_integer_to_float_ptr(*args): + return _swigfaiss.cast_integer_to_float_ptr(*args) +cast_integer_to_float_ptr = _swigfaiss.cast_integer_to_float_ptr + +def cast_integer_to_long_ptr(*args): + return _swigfaiss.cast_integer_to_long_ptr(*args) +cast_integer_to_long_ptr = _swigfaiss.cast_integer_to_long_ptr + +def cast_integer_to_int_ptr(*args): + return _swigfaiss.cast_integer_to_int_ptr(*args) +cast_integer_to_int_ptr = _swigfaiss.cast_integer_to_int_ptr class RangeSearchResult(_object): __swig_setmethods__ = {} __setattr__ = lambda self, name, value: _swig_setattr(self, RangeSearchResult, name, value) diff --git a/python/swigfaiss_gpu.py b/python/swigfaiss_gpu.py index 5a1ab39e8..456688358 100644 --- a/python/swigfaiss_gpu.py +++ b/python/swigfaiss_gpu.py @@ -209,6 +209,46 @@ class OperatingPointVector(_object): OperatingPointVector_swigregister = _swigfaiss_gpu.OperatingPointVector_swigregister OperatingPointVector_swigregister(OperatingPointVector) +class FloatVectorVector(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, FloatVectorVector, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, FloatVectorVector, name) + __repr__ = _swig_repr + def __init__(self): + this = _swigfaiss_gpu.new_FloatVectorVector() + try: self.this.append(this) + except: self.this = this + def push_back(self, *args): return _swigfaiss_gpu.FloatVectorVector_push_back(self, *args) + def data(self): return _swigfaiss_gpu.FloatVectorVector_data(self) + def size(self): return _swigfaiss_gpu.FloatVectorVector_size(self) + def at(self, *args): return _swigfaiss_gpu.FloatVectorVector_at(self, *args) + def resize(self, *args): return _swigfaiss_gpu.FloatVectorVector_resize(self, *args) + __swig_destroy__ = _swigfaiss_gpu.delete_FloatVectorVector + __del__ = lambda self : None; +FloatVectorVector_swigregister = _swigfaiss_gpu.FloatVectorVector_swigregister +FloatVectorVector_swigregister(FloatVectorVector) + +class ByteVectorVector(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, ByteVectorVector, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, ByteVectorVector, name) + __repr__ = _swig_repr + def __init__(self): + this = _swigfaiss_gpu.new_ByteVectorVector() + try: self.this.append(this) + except: self.this = this + def push_back(self, *args): return _swigfaiss_gpu.ByteVectorVector_push_back(self, *args) + def data(self): return _swigfaiss_gpu.ByteVectorVector_data(self) + def size(self): return _swigfaiss_gpu.ByteVectorVector_size(self) + def at(self, *args): return _swigfaiss_gpu.ByteVectorVector_at(self, *args) + def resize(self, *args): return _swigfaiss_gpu.ByteVectorVector_resize(self, *args) + __swig_destroy__ = _swigfaiss_gpu.delete_ByteVectorVector + __del__ = lambda self : None; +ByteVectorVector_swigregister = _swigfaiss_gpu.ByteVectorVector_swigregister +ByteVectorVector_swigregister(ByteVectorVector) + class GpuResourcesVector(_object): __swig_setmethods__ = {} __setattr__ = lambda self, name, value: _swig_setattr(self, GpuResourcesVector, name, value) @@ -422,6 +462,28 @@ class HammingComputer64(_object): HammingComputer64_swigregister = _swigfaiss_gpu.HammingComputer64_swigregister HammingComputer64_swigregister(HammingComputer64) +class HammingComputerDefault(_object): + __swig_setmethods__ = {} + __setattr__ = lambda self, name, value: _swig_setattr(self, HammingComputerDefault, name, value) + __swig_getmethods__ = {} + __getattr__ = lambda self, name: _swig_getattr(self, HammingComputerDefault, name) + __repr__ = _swig_repr + __swig_setmethods__["a"] = _swigfaiss_gpu.HammingComputerDefault_a_set + __swig_getmethods__["a"] = _swigfaiss_gpu.HammingComputerDefault_a_get + if _newclass:a = _swig_property(_swigfaiss_gpu.HammingComputerDefault_a_get, _swigfaiss_gpu.HammingComputerDefault_a_set) + __swig_setmethods__["n"] = _swigfaiss_gpu.HammingComputerDefault_n_set + __swig_getmethods__["n"] = _swigfaiss_gpu.HammingComputerDefault_n_get + if _newclass:n = _swig_property(_swigfaiss_gpu.HammingComputerDefault_n_get, _swigfaiss_gpu.HammingComputerDefault_n_set) + def __init__(self, *args): + this = _swigfaiss_gpu.new_HammingComputerDefault(*args) + try: self.this.append(this) + except: self.this = this + def hamming(self, *args): return _swigfaiss_gpu.HammingComputerDefault_hamming(self, *args) + __swig_destroy__ = _swigfaiss_gpu.delete_HammingComputerDefault + __del__ = lambda self : None; +HammingComputerDefault_swigregister = _swigfaiss_gpu.HammingComputerDefault_swigregister +HammingComputerDefault_swigregister(HammingComputerDefault) + class HammingComputerM8(_object): __swig_setmethods__ = {} __setattr__ = lambda self, name, value: _swig_setattr(self, HammingComputerM8, name, value) @@ -586,6 +648,8 @@ class GpuResources(_object): def getAsyncCopyStream(self, *args): return _swigfaiss_gpu.GpuResources_getAsyncCopyStream(self, *args) def getBlasHandleCurrentDevice(self): return _swigfaiss_gpu.GpuResources_getBlasHandleCurrentDevice(self) def getDefaultStreamCurrentDevice(self): return _swigfaiss_gpu.GpuResources_getDefaultStreamCurrentDevice(self) + def syncDefaultStream(self, *args): return _swigfaiss_gpu.GpuResources_syncDefaultStream(self, *args) + def syncDefaultStreamCurrentDevice(self): return _swigfaiss_gpu.GpuResources_syncDefaultStreamCurrentDevice(self) def getAlternateStreamsCurrentDevice(self): return _swigfaiss_gpu.GpuResources_getAlternateStreamsCurrentDevice(self) def getAsyncCopyStreamCurrentDevice(self): return _swigfaiss_gpu.GpuResources_getAsyncCopyStreamCurrentDevice(self) GpuResources_swigregister = _swigfaiss_gpu.GpuResources_swigregister @@ -609,6 +673,8 @@ class StandardGpuResources(GpuResources): def setTempMemory(self, *args): return _swigfaiss_gpu.StandardGpuResources_setTempMemory(self, *args) def setTempMemoryFraction(self, *args): return _swigfaiss_gpu.StandardGpuResources_setTempMemoryFraction(self, *args) def setPinnedMemory(self, *args): return _swigfaiss_gpu.StandardGpuResources_setPinnedMemory(self, *args) + def setDefaultStream(self, *args): return _swigfaiss_gpu.StandardGpuResources_setDefaultStream(self, *args) + def setDefaultNullStreamAllDevices(self): return _swigfaiss_gpu.StandardGpuResources_setDefaultNullStreamAllDevices(self) def initializeForDevice(self, *args): return _swigfaiss_gpu.StandardGpuResources_initializeForDevice(self, *args) def getBlasHandle(self, *args): return _swigfaiss_gpu.StandardGpuResources_getBlasHandle(self, *args) def getDefaultStream(self, *args): return _swigfaiss_gpu.StandardGpuResources_getDefaultStream(self, *args) @@ -3049,6 +3115,18 @@ omp_get_max_threads = _swigfaiss_gpu.omp_get_max_threads def memcpy(*args): return _swigfaiss_gpu.memcpy(*args) memcpy = _swigfaiss_gpu.memcpy + +def cast_integer_to_float_ptr(*args): + return _swigfaiss_gpu.cast_integer_to_float_ptr(*args) +cast_integer_to_float_ptr = _swigfaiss_gpu.cast_integer_to_float_ptr + +def cast_integer_to_long_ptr(*args): + return _swigfaiss_gpu.cast_integer_to_long_ptr(*args) +cast_integer_to_long_ptr = _swigfaiss_gpu.cast_integer_to_long_ptr + +def cast_integer_to_int_ptr(*args): + return _swigfaiss_gpu.cast_integer_to_int_ptr(*args) +cast_integer_to_int_ptr = _swigfaiss_gpu.cast_integer_to_int_ptr class RangeSearchResult(_object): __swig_setmethods__ = {} __setattr__ = lambda self, name, value: _swig_setattr(self, RangeSearchResult, name, value) diff --git a/python/swigfaiss_gpu_wrap.cxx b/python/swigfaiss_gpu_wrap.cxx index faafea633..58a71ef02 100644 --- a/python/swigfaiss_gpu_wrap.cxx +++ b/python/swigfaiss_gpu_wrap.cxx @@ -2957,126 +2957,128 @@ SWIG_Python_NonDynamicSetAttr(PyObject *obj, PyObject *name, PyObject *value) { #define SWIGTYPE_p_faiss__HammingComputer4 swig_types[20] #define SWIGTYPE_p_faiss__HammingComputer64 swig_types[21] #define SWIGTYPE_p_faiss__HammingComputer8 swig_types[22] -#define SWIGTYPE_p_faiss__HammingComputerM4 swig_types[23] -#define SWIGTYPE_p_faiss__HammingComputerM8 swig_types[24] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t swig_types[25] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_int_long_t_t swig_types[26] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_float_long_t_t swig_types[27] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_int_long_t_t swig_types[28] -#define SWIGTYPE_p_faiss__IDSelector swig_types[29] -#define SWIGTYPE_p_faiss__IDSelectorBatch swig_types[30] -#define SWIGTYPE_p_faiss__IDSelectorRange swig_types[31] -#define SWIGTYPE_p_faiss__Index swig_types[32] -#define SWIGTYPE_p_faiss__IndexFlat swig_types[33] -#define SWIGTYPE_p_faiss__IndexFlat1D swig_types[34] -#define SWIGTYPE_p_faiss__IndexFlatIP swig_types[35] -#define SWIGTYPE_p_faiss__IndexFlatL2 swig_types[36] -#define SWIGTYPE_p_faiss__IndexFlatL2BaseShift swig_types[37] -#define SWIGTYPE_p_faiss__IndexIDMap swig_types[38] -#define SWIGTYPE_p_faiss__IndexIDMap2 swig_types[39] -#define SWIGTYPE_p_faiss__IndexIVF swig_types[40] -#define SWIGTYPE_p_faiss__IndexIVFFlat swig_types[41] -#define SWIGTYPE_p_faiss__IndexIVFFlatIPBounds swig_types[42] -#define SWIGTYPE_p_faiss__IndexIVFFlatStats swig_types[43] -#define SWIGTYPE_p_faiss__IndexIVFPQ swig_types[44] -#define SWIGTYPE_p_faiss__IndexIVFPQCompact swig_types[45] -#define SWIGTYPE_p_faiss__IndexIVFPQR swig_types[46] -#define SWIGTYPE_p_faiss__IndexIVFPQStats swig_types[47] -#define SWIGTYPE_p_faiss__IndexIVFScalarQuantizer swig_types[48] -#define SWIGTYPE_p_faiss__IndexLSH swig_types[49] -#define SWIGTYPE_p_faiss__IndexPQ swig_types[50] -#define SWIGTYPE_p_faiss__IndexPQStats swig_types[51] -#define SWIGTYPE_p_faiss__IndexPreTransform swig_types[52] -#define SWIGTYPE_p_faiss__IndexRefineFlat swig_types[53] -#define SWIGTYPE_p_faiss__IndexScalarQuantizer swig_types[54] -#define SWIGTYPE_p_faiss__IndexShards swig_types[55] -#define SWIGTYPE_p_faiss__IndexSplitVectors swig_types[56] -#define SWIGTYPE_p_faiss__IntersectionCriterion swig_types[57] -#define SWIGTYPE_p_faiss__LinearTransform swig_types[58] -#define SWIGTYPE_p_faiss__MultiIndexQuantizer swig_types[59] -#define SWIGTYPE_p_faiss__NormalizationTransform swig_types[60] -#define SWIGTYPE_p_faiss__OPQMatrix swig_types[61] -#define SWIGTYPE_p_faiss__OneRecallAtRCriterion swig_types[62] -#define SWIGTYPE_p_faiss__OperatingPoint swig_types[63] -#define SWIGTYPE_p_faiss__OperatingPoints swig_types[64] -#define SWIGTYPE_p_faiss__PCAMatrix swig_types[65] -#define SWIGTYPE_p_faiss__ParameterRange swig_types[66] -#define SWIGTYPE_p_faiss__ParameterSpace swig_types[67] -#define SWIGTYPE_p_faiss__PermutationObjective swig_types[68] -#define SWIGTYPE_p_faiss__PolysemousTraining swig_types[69] -#define SWIGTYPE_p_faiss__ProductQuantizer swig_types[70] -#define SWIGTYPE_p_faiss__RandomGenerator swig_types[71] -#define SWIGTYPE_p_faiss__RandomRotationMatrix swig_types[72] -#define SWIGTYPE_p_faiss__RangeSearchPartialResult swig_types[73] -#define SWIGTYPE_p_faiss__RangeSearchPartialResult__QueryResult swig_types[74] -#define SWIGTYPE_p_faiss__RangeSearchResult swig_types[75] -#define SWIGTYPE_p_faiss__RemapDimensionsTransform swig_types[76] -#define SWIGTYPE_p_faiss__ReproduceDistancesObjective swig_types[77] -#define SWIGTYPE_p_faiss__ScalarQuantizer swig_types[78] -#define SWIGTYPE_p_faiss__SimulatedAnnealingOptimizer swig_types[79] -#define SWIGTYPE_p_faiss__SimulatedAnnealingParameters swig_types[80] -#define SWIGTYPE_p_faiss__VectorTransform swig_types[81] -#define SWIGTYPE_p_faiss__gpu__FlatIndex swig_types[82] -#define SWIGTYPE_p_faiss__gpu__GpuClonerOptions swig_types[83] -#define SWIGTYPE_p_faiss__gpu__GpuIndex swig_types[84] -#define SWIGTYPE_p_faiss__gpu__GpuIndexConfig swig_types[85] -#define SWIGTYPE_p_faiss__gpu__GpuIndexFlat swig_types[86] -#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatConfig swig_types[87] -#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatIP swig_types[88] -#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatL2 swig_types[89] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVF swig_types[90] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFConfig swig_types[91] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat swig_types[92] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlatConfig swig_types[93] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ swig_types[94] -#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQConfig swig_types[95] -#define SWIGTYPE_p_faiss__gpu__GpuMultipleClonerOptions swig_types[96] -#define SWIGTYPE_p_faiss__gpu__GpuParameterSpace swig_types[97] -#define SWIGTYPE_p_faiss__gpu__GpuResources swig_types[98] -#define SWIGTYPE_p_faiss__gpu__IndexProxy swig_types[99] -#define SWIGTYPE_p_faiss__gpu__StandardGpuResources swig_types[100] -#define SWIGTYPE_p_float swig_types[101] -#define SWIGTYPE_p_idx_t swig_types[102] -#define SWIGTYPE_p_int swig_types[103] -#define SWIGTYPE_p_long swig_types[104] -#define SWIGTYPE_p_p_faiss__LinearTransform swig_types[105] -#define SWIGTYPE_p_p_faiss__NormalizationTransform swig_types[106] -#define SWIGTYPE_p_p_faiss__OPQMatrix swig_types[107] -#define SWIGTYPE_p_p_faiss__PCAMatrix swig_types[108] -#define SWIGTYPE_p_p_faiss__RandomRotationMatrix swig_types[109] -#define SWIGTYPE_p_p_faiss__RemapDimensionsTransform swig_types[110] -#define SWIGTYPE_p_p_faiss__VectorTransform swig_types[111] -#define SWIGTYPE_p_p_faiss__gpu__GpuResources swig_types[112] -#define SWIGTYPE_p_p_faiss__gpu__StandardGpuResources swig_types[113] -#define SWIGTYPE_p_p_void swig_types[114] -#define SWIGTYPE_p_std__functionT_void_ffaiss__Index_pF_t swig_types[115] -#define SWIGTYPE_p_std__pairT_void_p_unsigned_long_t swig_types[116] -#define SWIGTYPE_p_std__unordered_mapT_long_long_t swig_types[117] -#define SWIGTYPE_p_std__vectorT_cudaStream_t_t swig_types[118] -#define SWIGTYPE_p_std__vectorT_double_t swig_types[119] -#define SWIGTYPE_p_std__vectorT_faiss__BufferList__Buffer_t swig_types[120] -#define SWIGTYPE_p_std__vectorT_faiss__Index_p_t swig_types[121] -#define SWIGTYPE_p_std__vectorT_faiss__OperatingPoint_t swig_types[122] -#define SWIGTYPE_p_std__vectorT_faiss__ParameterRange_t swig_types[123] -#define SWIGTYPE_p_std__vectorT_faiss__RangeSearchPartialResult__QueryResult_t swig_types[124] -#define SWIGTYPE_p_std__vectorT_faiss__VectorTransform_p_t swig_types[125] -#define SWIGTYPE_p_std__vectorT_faiss__gpu__GpuResources_p_t swig_types[126] -#define SWIGTYPE_p_std__vectorT_float_t swig_types[127] -#define SWIGTYPE_p_std__vectorT_int_t swig_types[128] -#define SWIGTYPE_p_std__vectorT_long_t swig_types[129] -#define SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t swig_types[130] -#define SWIGTYPE_p_std__vectorT_std__vectorT_long_t_t swig_types[131] -#define SWIGTYPE_p_std__vectorT_std__vectorT_uint8_t_t_t swig_types[132] -#define SWIGTYPE_p_std__vectorT_uint8_t_t swig_types[133] -#define SWIGTYPE_p_std__vectorT_unsigned_char_t swig_types[134] -#define SWIGTYPE_p_std__vectorT_unsigned_long_t swig_types[135] -#define SWIGTYPE_p_uint32_t swig_types[136] -#define SWIGTYPE_p_uint8_t swig_types[137] -#define SWIGTYPE_p_unsigned_char swig_types[138] -#define SWIGTYPE_p_unsigned_long swig_types[139] -#define SWIGTYPE_p_void swig_types[140] -static swig_type_info *swig_types[142]; -static swig_module_info swig_module = {swig_types, 141, 0, 0, 0, 0}; +#define SWIGTYPE_p_faiss__HammingComputerDefault swig_types[23] +#define SWIGTYPE_p_faiss__HammingComputerM4 swig_types[24] +#define SWIGTYPE_p_faiss__HammingComputerM8 swig_types[25] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t swig_types[26] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_int_long_t_t swig_types[27] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_float_long_t_t swig_types[28] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_int_long_t_t swig_types[29] +#define SWIGTYPE_p_faiss__IDSelector swig_types[30] +#define SWIGTYPE_p_faiss__IDSelectorBatch swig_types[31] +#define SWIGTYPE_p_faiss__IDSelectorRange swig_types[32] +#define SWIGTYPE_p_faiss__Index swig_types[33] +#define SWIGTYPE_p_faiss__IndexFlat swig_types[34] +#define SWIGTYPE_p_faiss__IndexFlat1D swig_types[35] +#define SWIGTYPE_p_faiss__IndexFlatIP swig_types[36] +#define SWIGTYPE_p_faiss__IndexFlatL2 swig_types[37] +#define SWIGTYPE_p_faiss__IndexFlatL2BaseShift swig_types[38] +#define SWIGTYPE_p_faiss__IndexIDMap swig_types[39] +#define SWIGTYPE_p_faiss__IndexIDMap2 swig_types[40] +#define SWIGTYPE_p_faiss__IndexIVF swig_types[41] +#define SWIGTYPE_p_faiss__IndexIVFFlat swig_types[42] +#define SWIGTYPE_p_faiss__IndexIVFFlatIPBounds swig_types[43] +#define SWIGTYPE_p_faiss__IndexIVFFlatStats swig_types[44] +#define SWIGTYPE_p_faiss__IndexIVFPQ swig_types[45] +#define SWIGTYPE_p_faiss__IndexIVFPQCompact swig_types[46] +#define SWIGTYPE_p_faiss__IndexIVFPQR swig_types[47] +#define SWIGTYPE_p_faiss__IndexIVFPQStats swig_types[48] +#define SWIGTYPE_p_faiss__IndexIVFScalarQuantizer swig_types[49] +#define SWIGTYPE_p_faiss__IndexLSH swig_types[50] +#define SWIGTYPE_p_faiss__IndexPQ swig_types[51] +#define SWIGTYPE_p_faiss__IndexPQStats swig_types[52] +#define SWIGTYPE_p_faiss__IndexPreTransform swig_types[53] +#define SWIGTYPE_p_faiss__IndexRefineFlat swig_types[54] +#define SWIGTYPE_p_faiss__IndexScalarQuantizer swig_types[55] +#define SWIGTYPE_p_faiss__IndexShards swig_types[56] +#define SWIGTYPE_p_faiss__IndexSplitVectors swig_types[57] +#define SWIGTYPE_p_faiss__IntersectionCriterion swig_types[58] +#define SWIGTYPE_p_faiss__LinearTransform swig_types[59] +#define SWIGTYPE_p_faiss__MultiIndexQuantizer swig_types[60] +#define SWIGTYPE_p_faiss__NormalizationTransform swig_types[61] +#define SWIGTYPE_p_faiss__OPQMatrix swig_types[62] +#define SWIGTYPE_p_faiss__OneRecallAtRCriterion swig_types[63] +#define SWIGTYPE_p_faiss__OperatingPoint swig_types[64] +#define SWIGTYPE_p_faiss__OperatingPoints swig_types[65] +#define SWIGTYPE_p_faiss__PCAMatrix swig_types[66] +#define SWIGTYPE_p_faiss__ParameterRange swig_types[67] +#define SWIGTYPE_p_faiss__ParameterSpace swig_types[68] +#define SWIGTYPE_p_faiss__PermutationObjective swig_types[69] +#define SWIGTYPE_p_faiss__PolysemousTraining swig_types[70] +#define SWIGTYPE_p_faiss__ProductQuantizer swig_types[71] +#define SWIGTYPE_p_faiss__RandomGenerator swig_types[72] +#define SWIGTYPE_p_faiss__RandomRotationMatrix swig_types[73] +#define SWIGTYPE_p_faiss__RangeSearchPartialResult swig_types[74] +#define SWIGTYPE_p_faiss__RangeSearchPartialResult__QueryResult swig_types[75] +#define SWIGTYPE_p_faiss__RangeSearchResult swig_types[76] +#define SWIGTYPE_p_faiss__RemapDimensionsTransform swig_types[77] +#define SWIGTYPE_p_faiss__ReproduceDistancesObjective swig_types[78] +#define SWIGTYPE_p_faiss__ScalarQuantizer swig_types[79] +#define SWIGTYPE_p_faiss__SimulatedAnnealingOptimizer swig_types[80] +#define SWIGTYPE_p_faiss__SimulatedAnnealingParameters swig_types[81] +#define SWIGTYPE_p_faiss__VectorTransform swig_types[82] +#define SWIGTYPE_p_faiss__gpu__FlatIndex swig_types[83] +#define SWIGTYPE_p_faiss__gpu__GpuClonerOptions swig_types[84] +#define SWIGTYPE_p_faiss__gpu__GpuIndex swig_types[85] +#define SWIGTYPE_p_faiss__gpu__GpuIndexConfig swig_types[86] +#define SWIGTYPE_p_faiss__gpu__GpuIndexFlat swig_types[87] +#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatConfig swig_types[88] +#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatIP swig_types[89] +#define SWIGTYPE_p_faiss__gpu__GpuIndexFlatL2 swig_types[90] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVF swig_types[91] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFConfig swig_types[92] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat swig_types[93] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlatConfig swig_types[94] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ swig_types[95] +#define SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQConfig swig_types[96] +#define SWIGTYPE_p_faiss__gpu__GpuMultipleClonerOptions swig_types[97] +#define SWIGTYPE_p_faiss__gpu__GpuParameterSpace swig_types[98] +#define SWIGTYPE_p_faiss__gpu__GpuResources swig_types[99] +#define SWIGTYPE_p_faiss__gpu__IndexProxy swig_types[100] +#define SWIGTYPE_p_faiss__gpu__StandardGpuResources swig_types[101] +#define SWIGTYPE_p_float swig_types[102] +#define SWIGTYPE_p_idx_t swig_types[103] +#define SWIGTYPE_p_int swig_types[104] +#define SWIGTYPE_p_long swig_types[105] +#define SWIGTYPE_p_p_faiss__LinearTransform swig_types[106] +#define SWIGTYPE_p_p_faiss__NormalizationTransform swig_types[107] +#define SWIGTYPE_p_p_faiss__OPQMatrix swig_types[108] +#define SWIGTYPE_p_p_faiss__PCAMatrix swig_types[109] +#define SWIGTYPE_p_p_faiss__RandomRotationMatrix swig_types[110] +#define SWIGTYPE_p_p_faiss__RemapDimensionsTransform swig_types[111] +#define SWIGTYPE_p_p_faiss__VectorTransform swig_types[112] +#define SWIGTYPE_p_p_faiss__gpu__GpuResources swig_types[113] +#define SWIGTYPE_p_p_faiss__gpu__StandardGpuResources swig_types[114] +#define SWIGTYPE_p_p_void swig_types[115] +#define SWIGTYPE_p_std__functionT_void_ffaiss__Index_pF_t swig_types[116] +#define SWIGTYPE_p_std__pairT_void_p_unsigned_long_t swig_types[117] +#define SWIGTYPE_p_std__unordered_mapT_long_long_t swig_types[118] +#define SWIGTYPE_p_std__vectorT_cudaStream_t_t swig_types[119] +#define SWIGTYPE_p_std__vectorT_double_t swig_types[120] +#define SWIGTYPE_p_std__vectorT_faiss__BufferList__Buffer_t swig_types[121] +#define SWIGTYPE_p_std__vectorT_faiss__Index_p_t swig_types[122] +#define SWIGTYPE_p_std__vectorT_faiss__OperatingPoint_t swig_types[123] +#define SWIGTYPE_p_std__vectorT_faiss__ParameterRange_t swig_types[124] +#define SWIGTYPE_p_std__vectorT_faiss__RangeSearchPartialResult__QueryResult_t swig_types[125] +#define SWIGTYPE_p_std__vectorT_faiss__VectorTransform_p_t swig_types[126] +#define SWIGTYPE_p_std__vectorT_faiss__gpu__GpuResources_p_t swig_types[127] +#define SWIGTYPE_p_std__vectorT_float_t swig_types[128] +#define SWIGTYPE_p_std__vectorT_int_t swig_types[129] +#define SWIGTYPE_p_std__vectorT_long_t swig_types[130] +#define SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t swig_types[131] +#define SWIGTYPE_p_std__vectorT_std__vectorT_long_t_t swig_types[132] +#define SWIGTYPE_p_std__vectorT_std__vectorT_uint8_t_t_t swig_types[133] +#define SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t swig_types[134] +#define SWIGTYPE_p_std__vectorT_uint8_t_t swig_types[135] +#define SWIGTYPE_p_std__vectorT_unsigned_char_t swig_types[136] +#define SWIGTYPE_p_std__vectorT_unsigned_long_t swig_types[137] +#define SWIGTYPE_p_uint32_t swig_types[138] +#define SWIGTYPE_p_uint8_t swig_types[139] +#define SWIGTYPE_p_unsigned_char swig_types[140] +#define SWIGTYPE_p_unsigned_long swig_types[141] +#define SWIGTYPE_p_void swig_types[142] +static swig_type_info *swig_types[144]; +static swig_module_info swig_module = {swig_types, 143, 0, 0, 0, 0}; #define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name) #define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name) @@ -3786,6 +3788,20 @@ PyObject * rev_swig_ptr(unsigned char *src, npy_intp size) { } +float * cast_integer_to_float_ptr (long x) { + return (float*)x; +} + +long * cast_integer_to_long_ptr (long x) { + return (long*)x; +} + +int * cast_integer_to_int_ptr (long x) { + return (int*)x; +} + + + // may be useful for lua code launched in background from shell #include @@ -5044,6 +5060,374 @@ SWIGINTERN PyObject *OperatingPointVector_swigregister(PyObject *SWIGUNUSEDPARM( return SWIG_Py_Void(); } +SWIGINTERN PyObject *_wrap_new_FloatVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)":new_FloatVectorVector")) SWIG_fail; + result = (std::vector< std::vector< float > > *)new std::vector< std::vector< float > >(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_push_back(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + std::vector< float > arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_push_back",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_push_back" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + { + res2 = SWIG_ConvertPtr(obj1, &argp2, SWIGTYPE_p_std__vectorT_float_t, 0 | 0); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "FloatVectorVector_push_back" "', argument " "2"" of type '" "std::vector< float >""'"); + } + if (!argp2) { + SWIG_exception_fail(SWIG_ValueError, "invalid null reference " "in method '" "FloatVectorVector_push_back" "', argument " "2"" of type '" "std::vector< float >""'"); + } else { + std::vector< float > * temp = reinterpret_cast< std::vector< float > * >(argp2); + arg2 = *temp; + if (SWIG_IsNewObj(res2)) delete temp; + } + } + (arg1)->push_back(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_data(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + std::vector< float > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:FloatVectorVector_data",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_data" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + result = (std::vector< float > *)(arg1)->data(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_float_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_size(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + size_t result; + + if (!PyArg_ParseTuple(args,(char *)"O:FloatVectorVector_size",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_size" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + result = (size_t)(arg1)->size(); + resultobj = SWIG_From_size_t(static_cast< size_t >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_at(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + std::vector< float > result; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_at",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_at" "', argument " "1"" of type '" "std::vector< std::vector< float > > const *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "FloatVectorVector_at" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + result = ((std::vector< std::vector< float > > const *)arg1)->at(arg2); + resultobj = SWIG_NewPointerObj((new std::vector< float >(static_cast< const std::vector< float >& >(result))), SWIGTYPE_p_std__vectorT_float_t, SWIG_POINTER_OWN | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_resize(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_resize",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_resize" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "FloatVectorVector_resize" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + (arg1)->resize(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_FloatVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_FloatVectorVector",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_FloatVectorVector" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *FloatVectorVector_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + +SWIGINTERN PyObject *_wrap_new_ByteVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)":new_ByteVectorVector")) SWIG_fail; + result = (std::vector< std::vector< unsigned char > > *)new std::vector< std::vector< unsigned char > >(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_push_back(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + SwigValueWrapper< std::vector< unsigned char > > arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_push_back",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_push_back" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + { + res2 = SWIG_ConvertPtr(obj1, &argp2, SWIGTYPE_p_std__vectorT_unsigned_char_t, 0 | 0); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "ByteVectorVector_push_back" "', argument " "2"" of type '" "std::vector< unsigned char >""'"); + } + if (!argp2) { + SWIG_exception_fail(SWIG_ValueError, "invalid null reference " "in method '" "ByteVectorVector_push_back" "', argument " "2"" of type '" "std::vector< unsigned char >""'"); + } else { + std::vector< unsigned char > * temp = reinterpret_cast< std::vector< unsigned char > * >(argp2); + arg2 = *temp; + if (SWIG_IsNewObj(res2)) delete temp; + } + } + (arg1)->push_back(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_data(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + std::vector< unsigned char > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:ByteVectorVector_data",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_data" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + result = (std::vector< unsigned char > *)(arg1)->data(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_unsigned_char_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_size(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + size_t result; + + if (!PyArg_ParseTuple(args,(char *)"O:ByteVectorVector_size",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_size" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + result = (size_t)(arg1)->size(); + resultobj = SWIG_From_size_t(static_cast< size_t >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_at(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + SwigValueWrapper< std::vector< unsigned char > > result; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_at",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_at" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > const *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "ByteVectorVector_at" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + result = ((std::vector< std::vector< unsigned char > > const *)arg1)->at(arg2); + resultobj = SWIG_NewPointerObj((new std::vector< unsigned char >(static_cast< const std::vector< unsigned char >& >(result))), SWIGTYPE_p_std__vectorT_unsigned_char_t, SWIG_POINTER_OWN | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_resize(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_resize",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_resize" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "ByteVectorVector_resize" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + (arg1)->resize(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_ByteVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_ByteVectorVector",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_ByteVectorVector" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *ByteVectorVector_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + SWIGINTERN PyObject *_wrap_new_GpuResourcesVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; std::vector< faiss::gpu::GpuResources * > *result = 0 ; @@ -7529,6 +7913,220 @@ SWIGINTERN PyObject *HammingComputer64_swigregister(PyObject *SWIGUNUSEDPARM(sel return SWIG_Py_Void(); } +SWIGINTERN PyObject *_wrap_HammingComputerDefault_a_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + uint8_t *arg2 = (uint8_t *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 = 0 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_a_set",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_a_set" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + res2 = SWIG_ConvertPtr(obj1, &argp2,SWIGTYPE_p_uint8_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "HammingComputerDefault_a_set" "', argument " "2"" of type '" "uint8_t const *""'"); + } + arg2 = reinterpret_cast< uint8_t * >(argp2); + if (arg1) (arg1)->a = (uint8_t const *)arg2; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_a_get(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + uint8_t *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:HammingComputerDefault_a_get",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_a_get" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + result = (uint8_t *) ((arg1)->a); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_uint8_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_n_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + int arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_n_set",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_n_set" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "HammingComputerDefault_n_set" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + if (arg1) (arg1)->n = arg2; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_n_get(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + int result; + + if (!PyArg_ParseTuple(args,(char *)"O:HammingComputerDefault_n_get",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_n_get" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + result = (int) ((arg1)->n); + resultobj = SWIG_From_int(static_cast< int >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_new_HammingComputerDefault(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + uint8_t *arg1 = (uint8_t *) 0 ; + int arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + faiss::HammingComputerDefault *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:new_HammingComputerDefault",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_uint8_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "new_HammingComputerDefault" "', argument " "1"" of type '" "uint8_t const *""'"); + } + arg1 = reinterpret_cast< uint8_t * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "new_HammingComputerDefault" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + { + Py_BEGIN_ALLOW_THREADS + try { + result = (faiss::HammingComputerDefault *)new faiss::HammingComputerDefault((uint8_t const *)arg1,arg2); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_hamming(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + uint8_t *arg2 = (uint8_t *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 = 0 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + int result; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_hamming",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_hamming" "', argument " "1"" of type '" "faiss::HammingComputerDefault const *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + res2 = SWIG_ConvertPtr(obj1, &argp2,SWIGTYPE_p_uint8_t, 0 | 0 ); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "HammingComputerDefault_hamming" "', argument " "2"" of type '" "uint8_t const *""'"); + } + arg2 = reinterpret_cast< uint8_t * >(argp2); + { + Py_BEGIN_ALLOW_THREADS + try { + result = (int)((faiss::HammingComputerDefault const *)arg1)->hamming((uint8_t const *)arg2); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_From_int(static_cast< int >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_HammingComputerDefault(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_HammingComputerDefault",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_HammingComputerDefault" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *HammingComputerDefault_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + SWIGINTERN PyObject *_wrap_HammingComputerM8_a_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::HammingComputerM8 *arg1 = (faiss::HammingComputerM8 *) 0 ; @@ -9482,6 +10080,77 @@ fail: } +SWIGINTERN PyObject *_wrap_GpuResources_syncDefaultStream(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::gpu::GpuResources *arg1 = (faiss::gpu::GpuResources *) 0 ; + int arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:GpuResources_syncDefaultStream",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__gpu__GpuResources, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "GpuResources_syncDefaultStream" "', argument " "1"" of type '" "faiss::gpu::GpuResources *""'"); + } + arg1 = reinterpret_cast< faiss::gpu::GpuResources * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "GpuResources_syncDefaultStream" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + { + Py_BEGIN_ALLOW_THREADS + try { + (arg1)->syncDefaultStream(arg2); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_GpuResources_syncDefaultStreamCurrentDevice(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::gpu::GpuResources *arg1 = (faiss::gpu::GpuResources *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:GpuResources_syncDefaultStreamCurrentDevice",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__gpu__GpuResources, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "GpuResources_syncDefaultStreamCurrentDevice" "', argument " "1"" of type '" "faiss::gpu::GpuResources *""'"); + } + arg1 = reinterpret_cast< faiss::gpu::GpuResources * >(argp1); + { + Py_BEGIN_ALLOW_THREADS + try { + (arg1)->syncDefaultStreamCurrentDevice(); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + SWIGINTERN PyObject *_wrap_GpuResources_getAlternateStreamsCurrentDevice(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::gpu::GpuResources *arg1 = (faiss::gpu::GpuResources *) 0 ; @@ -9758,6 +10427,94 @@ fail: } +SWIGINTERN PyObject *_wrap_StandardGpuResources_setDefaultStream(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::gpu::StandardGpuResources *arg1 = (faiss::gpu::StandardGpuResources *) 0 ; + int arg2 ; + cudaStream_t arg3 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + void *argp3 ; + int res3 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + PyObject * obj2 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OOO:StandardGpuResources_setDefaultStream",&obj0,&obj1,&obj2)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__gpu__StandardGpuResources, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "StandardGpuResources_setDefaultStream" "', argument " "1"" of type '" "faiss::gpu::StandardGpuResources *""'"); + } + arg1 = reinterpret_cast< faiss::gpu::StandardGpuResources * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "StandardGpuResources_setDefaultStream" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + { + res3 = SWIG_ConvertPtr(obj2, &argp3, SWIGTYPE_p_cudaStream_t, 0 | 0); + if (!SWIG_IsOK(res3)) { + SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "StandardGpuResources_setDefaultStream" "', argument " "3"" of type '" "cudaStream_t""'"); + } + if (!argp3) { + SWIG_exception_fail(SWIG_ValueError, "invalid null reference " "in method '" "StandardGpuResources_setDefaultStream" "', argument " "3"" of type '" "cudaStream_t""'"); + } else { + cudaStream_t * temp = reinterpret_cast< cudaStream_t * >(argp3); + arg3 = *temp; + if (SWIG_IsNewObj(res3)) delete temp; + } + } + { + Py_BEGIN_ALLOW_THREADS + try { + (arg1)->setDefaultStream(arg2,arg3); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_StandardGpuResources_setDefaultNullStreamAllDevices(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::gpu::StandardGpuResources *arg1 = (faiss::gpu::StandardGpuResources *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:StandardGpuResources_setDefaultNullStreamAllDevices",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__gpu__StandardGpuResources, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "StandardGpuResources_setDefaultNullStreamAllDevices" "', argument " "1"" of type '" "faiss::gpu::StandardGpuResources *""'"); + } + arg1 = reinterpret_cast< faiss::gpu::StandardGpuResources * >(argp1); + { + Py_BEGIN_ALLOW_THREADS + try { + (arg1)->setDefaultNullStreamAllDevices(); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + SWIGINTERN PyObject *_wrap_StandardGpuResources_initializeForDevice(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::gpu::StandardGpuResources *arg1 = (faiss::gpu::StandardGpuResources *) 0 ; @@ -47300,100 +48057,100 @@ SWIGINTERN PyObject *_wrap_downcast_index(PyObject *SWIGUNUSEDPARM(self), PyObje Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,0); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,0); } else @@ -47442,37 +48199,37 @@ SWIGINTERN PyObject *_wrap_downcast_VectorTransform(PyObject *SWIGUNUSEDPARM(sel Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,0); } else @@ -47655,100 +48412,100 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_0(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -47797,100 +48554,100 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_1(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -47949,100 +48706,100 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_2(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -48094,100 +48851,100 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_3(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -48350,37 +49107,37 @@ SWIGINTERN PyObject *_wrap_read_VectorTransform(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,SWIG_POINTER_OWN); } else @@ -48504,100 +49261,100 @@ SWIGINTERN PyObject *_wrap_clone_index(PyObject *SWIGUNUSEDPARM(self), PyObject Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -48655,37 +49412,37 @@ SWIGINTERN PyObject *_wrap_Cloner_clone_VectorTransform(PyObject *SWIGUNUSEDPARM Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,SWIG_POINTER_OWN); } else @@ -48738,100 +49495,100 @@ SWIGINTERN PyObject *_wrap_Cloner_clone_Index(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,0); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,0); } else @@ -51898,100 +52655,100 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_0(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52052,100 +52809,100 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_1(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52250,100 +53007,100 @@ SWIGINTERN PyObject *_wrap_index_gpu_to_cpu(PyObject *SWIGUNUSEDPARM(self), PyOb Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52419,100 +53176,100 @@ SWIGINTERN PyObject *_wrap_index_cpu_to_gpu__SWIG_0(PyObject *SWIGUNUSEDPARM(sel Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52579,100 +53336,100 @@ SWIGINTERN PyObject *_wrap_index_cpu_to_gpu__SWIG_1(PyObject *SWIGUNUSEDPARM(sel Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52819,100 +53576,100 @@ SWIGINTERN PyObject *_wrap_index_cpu_to_gpu_multiple__SWIG_0(PyObject *SWIGUNUSE Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -52985,100 +53742,100 @@ SWIGINTERN PyObject *_wrap_index_cpu_to_gpu_multiple__SWIG_1(PyObject *SWIGUNUSE Py_END_ALLOW_THREADS } { - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__IndexProxy,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:../swigfaiss.swig,403,DOWNCAST_GPU@*/ + /*@SWIG:../swigfaiss.swig,407,DOWNCAST_GPU@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__gpu__GpuIndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ // default for non-recognized classes - /*@SWIG:../swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:../swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -58371,6 +59128,72 @@ fail: } +SWIGINTERN PyObject *_wrap_cast_integer_to_float_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + float *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_float_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_float_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (float *)cast_integer_to_float_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_float, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_cast_integer_to_long_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + long *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_long_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_long_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (long *)cast_integer_to_long_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_long, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_cast_integer_to_int_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + int *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_int_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_int_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (int *)cast_integer_to_int_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_int, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + SWIGINTERN PyObject *_wrap_RangeSearchResult_nq_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::RangeSearchResult *arg1 = (faiss::RangeSearchResult *) 0 ; @@ -59864,6 +60687,22 @@ static PyMethodDef SwigMethods[] = { { (char *)"OperatingPointVector_resize", _wrap_OperatingPointVector_resize, METH_VARARGS, NULL}, { (char *)"delete_OperatingPointVector", _wrap_delete_OperatingPointVector, METH_VARARGS, NULL}, { (char *)"OperatingPointVector_swigregister", OperatingPointVector_swigregister, METH_VARARGS, NULL}, + { (char *)"new_FloatVectorVector", _wrap_new_FloatVectorVector, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_push_back", _wrap_FloatVectorVector_push_back, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_data", _wrap_FloatVectorVector_data, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_size", _wrap_FloatVectorVector_size, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_at", _wrap_FloatVectorVector_at, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_resize", _wrap_FloatVectorVector_resize, METH_VARARGS, NULL}, + { (char *)"delete_FloatVectorVector", _wrap_delete_FloatVectorVector, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_swigregister", FloatVectorVector_swigregister, METH_VARARGS, NULL}, + { (char *)"new_ByteVectorVector", _wrap_new_ByteVectorVector, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_push_back", _wrap_ByteVectorVector_push_back, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_data", _wrap_ByteVectorVector_data, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_size", _wrap_ByteVectorVector_size, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_at", _wrap_ByteVectorVector_at, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_resize", _wrap_ByteVectorVector_resize, METH_VARARGS, NULL}, + { (char *)"delete_ByteVectorVector", _wrap_delete_ByteVectorVector, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_swigregister", ByteVectorVector_swigregister, METH_VARARGS, NULL}, { (char *)"new_GpuResourcesVector", _wrap_new_GpuResourcesVector, METH_VARARGS, NULL}, { (char *)"GpuResourcesVector_push_back", _wrap_GpuResourcesVector_push_back, METH_VARARGS, NULL}, { (char *)"GpuResourcesVector_data", _wrap_GpuResourcesVector_data, METH_VARARGS, NULL}, @@ -59944,6 +60783,14 @@ static PyMethodDef SwigMethods[] = { { (char *)"HammingComputer64_hamming", _wrap_HammingComputer64_hamming, METH_VARARGS, NULL}, { (char *)"delete_HammingComputer64", _wrap_delete_HammingComputer64, METH_VARARGS, NULL}, { (char *)"HammingComputer64_swigregister", HammingComputer64_swigregister, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_a_set", _wrap_HammingComputerDefault_a_set, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_a_get", _wrap_HammingComputerDefault_a_get, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_n_set", _wrap_HammingComputerDefault_n_set, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_n_get", _wrap_HammingComputerDefault_n_get, METH_VARARGS, NULL}, + { (char *)"new_HammingComputerDefault", _wrap_new_HammingComputerDefault, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_hamming", _wrap_HammingComputerDefault_hamming, METH_VARARGS, NULL}, + { (char *)"delete_HammingComputerDefault", _wrap_delete_HammingComputerDefault, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_swigregister", HammingComputerDefault_swigregister, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_a_set", _wrap_HammingComputerM8_a_set, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_a_get", _wrap_HammingComputerM8_a_get, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_n_set", _wrap_HammingComputerM8_n_set, METH_VARARGS, NULL}, @@ -60006,6 +60853,8 @@ static PyMethodDef SwigMethods[] = { { (char *)"GpuResources_getAsyncCopyStream", _wrap_GpuResources_getAsyncCopyStream, METH_VARARGS, NULL}, { (char *)"GpuResources_getBlasHandleCurrentDevice", _wrap_GpuResources_getBlasHandleCurrentDevice, METH_VARARGS, NULL}, { (char *)"GpuResources_getDefaultStreamCurrentDevice", _wrap_GpuResources_getDefaultStreamCurrentDevice, METH_VARARGS, NULL}, + { (char *)"GpuResources_syncDefaultStream", _wrap_GpuResources_syncDefaultStream, METH_VARARGS, NULL}, + { (char *)"GpuResources_syncDefaultStreamCurrentDevice", _wrap_GpuResources_syncDefaultStreamCurrentDevice, METH_VARARGS, NULL}, { (char *)"GpuResources_getAlternateStreamsCurrentDevice", _wrap_GpuResources_getAlternateStreamsCurrentDevice, METH_VARARGS, NULL}, { (char *)"GpuResources_getAsyncCopyStreamCurrentDevice", _wrap_GpuResources_getAsyncCopyStreamCurrentDevice, METH_VARARGS, NULL}, { (char *)"GpuResources_swigregister", GpuResources_swigregister, METH_VARARGS, NULL}, @@ -60015,6 +60864,8 @@ static PyMethodDef SwigMethods[] = { { (char *)"StandardGpuResources_setTempMemory", _wrap_StandardGpuResources_setTempMemory, METH_VARARGS, NULL}, { (char *)"StandardGpuResources_setTempMemoryFraction", _wrap_StandardGpuResources_setTempMemoryFraction, METH_VARARGS, NULL}, { (char *)"StandardGpuResources_setPinnedMemory", _wrap_StandardGpuResources_setPinnedMemory, METH_VARARGS, NULL}, + { (char *)"StandardGpuResources_setDefaultStream", _wrap_StandardGpuResources_setDefaultStream, METH_VARARGS, NULL}, + { (char *)"StandardGpuResources_setDefaultNullStreamAllDevices", _wrap_StandardGpuResources_setDefaultNullStreamAllDevices, METH_VARARGS, NULL}, { (char *)"StandardGpuResources_initializeForDevice", _wrap_StandardGpuResources_initializeForDevice, METH_VARARGS, NULL}, { (char *)"StandardGpuResources_getBlasHandle", _wrap_StandardGpuResources_getBlasHandle, METH_VARARGS, NULL}, { (char *)"StandardGpuResources_getDefaultStream", _wrap_StandardGpuResources_getDefaultStream, METH_VARARGS, NULL}, @@ -61061,6 +61912,9 @@ static PyMethodDef SwigMethods[] = { { (char *)"omp_set_num_threads", _wrap_omp_set_num_threads, METH_VARARGS, NULL}, { (char *)"omp_get_max_threads", _wrap_omp_get_max_threads, METH_VARARGS, NULL}, { (char *)"memcpy", _wrap_memcpy, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_float_ptr", _wrap_cast_integer_to_float_ptr, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_long_ptr", _wrap_cast_integer_to_long_ptr, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_int_ptr", _wrap_cast_integer_to_int_ptr, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_nq_set", _wrap_RangeSearchResult_nq_set, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_nq_get", _wrap_RangeSearchResult_nq_get, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_lims_set", _wrap_RangeSearchResult_lims_set, METH_VARARGS, NULL}, @@ -61417,6 +62271,7 @@ static swig_type_info _swigt__p_faiss__HammingComputer32 = {"_p_faiss__HammingCo static swig_type_info _swigt__p_faiss__HammingComputer4 = {"_p_faiss__HammingComputer4", "faiss::HammingComputer4 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputer64 = {"_p_faiss__HammingComputer64", "faiss::HammingComputer64 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputer8 = {"_p_faiss__HammingComputer8", "faiss::HammingComputer8 *", 0, 0, (void*)0, 0}; +static swig_type_info _swigt__p_faiss__HammingComputerDefault = {"_p_faiss__HammingComputerDefault", "faiss::HammingComputerDefault *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputerM4 = {"_p_faiss__HammingComputerM4", "faiss::HammingComputerM4 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputerM8 = {"_p_faiss__HammingComputerM8", "faiss::HammingComputerM8 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t = {"_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t", "faiss::HeapArray< faiss::CMax< float,long > > *|faiss::float_maxheap_array_t *", 0, 0, (void*)0, 0}; @@ -61527,6 +62382,7 @@ static swig_type_info _swigt__p_std__vectorT_long_t = {"_p_std__vectorT_long_t", static swig_type_info _swigt__p_std__vectorT_std__vectorT_float_t_t = {"_p_std__vectorT_std__vectorT_float_t_t", "std::vector< std::vector< float > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_std__vectorT_long_t_t = {"_p_std__vectorT_std__vectorT_long_t_t", "std::vector< std::vector< long > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_std__vectorT_uint8_t_t_t = {"_p_std__vectorT_std__vectorT_uint8_t_t_t", "std::vector< std::vector< uint8_t > > *", 0, 0, (void*)0, 0}; +static swig_type_info _swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t = {"_p_std__vectorT_std__vectorT_unsigned_char_t_t", "std::vector< std::vector< unsigned char > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_uint8_t_t = {"_p_std__vectorT_uint8_t_t", "std::vector< uint8_t > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_unsigned_char_t = {"_p_std__vectorT_unsigned_char_t", "std::vector< unsigned char > *|std::vector< faiss::IndexLSH::uint8_t > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_unsigned_long_t = {"_p_std__vectorT_unsigned_long_t", "std::vector< unsigned long > *|std::vector< uint64_t > *", 0, 0, (void*)0, 0}; @@ -61560,6 +62416,7 @@ static swig_type_info *swig_type_initial[] = { &_swigt__p_faiss__HammingComputer4, &_swigt__p_faiss__HammingComputer64, &_swigt__p_faiss__HammingComputer8, + &_swigt__p_faiss__HammingComputerDefault, &_swigt__p_faiss__HammingComputerM4, &_swigt__p_faiss__HammingComputerM8, &_swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, @@ -61670,6 +62527,7 @@ static swig_type_info *swig_type_initial[] = { &_swigt__p_std__vectorT_std__vectorT_float_t_t, &_swigt__p_std__vectorT_std__vectorT_long_t_t, &_swigt__p_std__vectorT_std__vectorT_uint8_t_t_t, + &_swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t, &_swigt__p_std__vectorT_uint8_t_t, &_swigt__p_std__vectorT_unsigned_char_t, &_swigt__p_std__vectorT_unsigned_long_t, @@ -61703,6 +62561,7 @@ static swig_cast_info _swigc__p_faiss__HammingComputer32[] = { {&_swigt__p_fais static swig_cast_info _swigc__p_faiss__HammingComputer4[] = { {&_swigt__p_faiss__HammingComputer4, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputer64[] = { {&_swigt__p_faiss__HammingComputer64, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputer8[] = { {&_swigt__p_faiss__HammingComputer8, 0, 0, 0},{0, 0, 0, 0}}; +static swig_cast_info _swigc__p_faiss__HammingComputerDefault[] = { {&_swigt__p_faiss__HammingComputerDefault, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputerM4[] = { {&_swigt__p_faiss__HammingComputerM4, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputerM8[] = { {&_swigt__p_faiss__HammingComputerM8, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t[] = { {&_swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, 0, 0, 0},{0, 0, 0, 0}}; @@ -61813,6 +62672,7 @@ static swig_cast_info _swigc__p_std__vectorT_long_t[] = { {&_swigt__p_std__vect static swig_cast_info _swigc__p_std__vectorT_std__vectorT_float_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_float_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_std__vectorT_long_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_long_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_std__vectorT_uint8_t_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_uint8_t_t_t, 0, 0, 0},{0, 0, 0, 0}}; +static swig_cast_info _swigc__p_std__vectorT_std__vectorT_unsigned_char_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_uint8_t_t[] = { {&_swigt__p_std__vectorT_uint8_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_unsigned_char_t[] = { {&_swigt__p_std__vectorT_unsigned_char_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_unsigned_long_t[] = { {&_swigt__p_std__vectorT_unsigned_long_t, 0, 0, 0},{0, 0, 0, 0}}; @@ -61846,6 +62706,7 @@ static swig_cast_info *swig_cast_initial[] = { _swigc__p_faiss__HammingComputer4, _swigc__p_faiss__HammingComputer64, _swigc__p_faiss__HammingComputer8, + _swigc__p_faiss__HammingComputerDefault, _swigc__p_faiss__HammingComputerM4, _swigc__p_faiss__HammingComputerM8, _swigc__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, @@ -61956,6 +62817,7 @@ static swig_cast_info *swig_cast_initial[] = { _swigc__p_std__vectorT_std__vectorT_float_t_t, _swigc__p_std__vectorT_std__vectorT_long_t_t, _swigc__p_std__vectorT_std__vectorT_uint8_t_t_t, + _swigc__p_std__vectorT_std__vectorT_unsigned_char_t_t, _swigc__p_std__vectorT_uint8_t_t, _swigc__p_std__vectorT_unsigned_char_t, _swigc__p_std__vectorT_unsigned_long_t, diff --git a/python/swigfaiss_wrap.cxx b/python/swigfaiss_wrap.cxx index c39a16c8b..a705e42c4 100644 --- a/python/swigfaiss_wrap.cxx +++ b/python/swigfaiss_wrap.cxx @@ -2955,100 +2955,102 @@ SWIG_Python_NonDynamicSetAttr(PyObject *obj, PyObject *name, PyObject *value) { #define SWIGTYPE_p_faiss__HammingComputer4 swig_types[18] #define SWIGTYPE_p_faiss__HammingComputer64 swig_types[19] #define SWIGTYPE_p_faiss__HammingComputer8 swig_types[20] -#define SWIGTYPE_p_faiss__HammingComputerM4 swig_types[21] -#define SWIGTYPE_p_faiss__HammingComputerM8 swig_types[22] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t swig_types[23] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_int_long_t_t swig_types[24] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_float_long_t_t swig_types[25] -#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_int_long_t_t swig_types[26] -#define SWIGTYPE_p_faiss__IDSelector swig_types[27] -#define SWIGTYPE_p_faiss__IDSelectorBatch swig_types[28] -#define SWIGTYPE_p_faiss__IDSelectorRange swig_types[29] -#define SWIGTYPE_p_faiss__Index swig_types[30] -#define SWIGTYPE_p_faiss__IndexFlat swig_types[31] -#define SWIGTYPE_p_faiss__IndexFlat1D swig_types[32] -#define SWIGTYPE_p_faiss__IndexFlatIP swig_types[33] -#define SWIGTYPE_p_faiss__IndexFlatL2 swig_types[34] -#define SWIGTYPE_p_faiss__IndexFlatL2BaseShift swig_types[35] -#define SWIGTYPE_p_faiss__IndexIDMap swig_types[36] -#define SWIGTYPE_p_faiss__IndexIDMap2 swig_types[37] -#define SWIGTYPE_p_faiss__IndexIVF swig_types[38] -#define SWIGTYPE_p_faiss__IndexIVFFlat swig_types[39] -#define SWIGTYPE_p_faiss__IndexIVFFlatIPBounds swig_types[40] -#define SWIGTYPE_p_faiss__IndexIVFFlatStats swig_types[41] -#define SWIGTYPE_p_faiss__IndexIVFPQ swig_types[42] -#define SWIGTYPE_p_faiss__IndexIVFPQCompact swig_types[43] -#define SWIGTYPE_p_faiss__IndexIVFPQR swig_types[44] -#define SWIGTYPE_p_faiss__IndexIVFPQStats swig_types[45] -#define SWIGTYPE_p_faiss__IndexIVFScalarQuantizer swig_types[46] -#define SWIGTYPE_p_faiss__IndexLSH swig_types[47] -#define SWIGTYPE_p_faiss__IndexPQ swig_types[48] -#define SWIGTYPE_p_faiss__IndexPQStats swig_types[49] -#define SWIGTYPE_p_faiss__IndexPreTransform swig_types[50] -#define SWIGTYPE_p_faiss__IndexRefineFlat swig_types[51] -#define SWIGTYPE_p_faiss__IndexScalarQuantizer swig_types[52] -#define SWIGTYPE_p_faiss__IndexShards swig_types[53] -#define SWIGTYPE_p_faiss__IndexSplitVectors swig_types[54] -#define SWIGTYPE_p_faiss__IntersectionCriterion swig_types[55] -#define SWIGTYPE_p_faiss__LinearTransform swig_types[56] -#define SWIGTYPE_p_faiss__MultiIndexQuantizer swig_types[57] -#define SWIGTYPE_p_faiss__NormalizationTransform swig_types[58] -#define SWIGTYPE_p_faiss__OPQMatrix swig_types[59] -#define SWIGTYPE_p_faiss__OneRecallAtRCriterion swig_types[60] -#define SWIGTYPE_p_faiss__OperatingPoint swig_types[61] -#define SWIGTYPE_p_faiss__OperatingPoints swig_types[62] -#define SWIGTYPE_p_faiss__PCAMatrix swig_types[63] -#define SWIGTYPE_p_faiss__ParameterRange swig_types[64] -#define SWIGTYPE_p_faiss__ParameterSpace swig_types[65] -#define SWIGTYPE_p_faiss__PermutationObjective swig_types[66] -#define SWIGTYPE_p_faiss__PolysemousTraining swig_types[67] -#define SWIGTYPE_p_faiss__ProductQuantizer swig_types[68] -#define SWIGTYPE_p_faiss__RandomGenerator swig_types[69] -#define SWIGTYPE_p_faiss__RandomRotationMatrix swig_types[70] -#define SWIGTYPE_p_faiss__RangeSearchPartialResult swig_types[71] -#define SWIGTYPE_p_faiss__RangeSearchPartialResult__QueryResult swig_types[72] -#define SWIGTYPE_p_faiss__RangeSearchResult swig_types[73] -#define SWIGTYPE_p_faiss__RemapDimensionsTransform swig_types[74] -#define SWIGTYPE_p_faiss__ReproduceDistancesObjective swig_types[75] -#define SWIGTYPE_p_faiss__ScalarQuantizer swig_types[76] -#define SWIGTYPE_p_faiss__SimulatedAnnealingOptimizer swig_types[77] -#define SWIGTYPE_p_faiss__SimulatedAnnealingParameters swig_types[78] -#define SWIGTYPE_p_faiss__VectorTransform swig_types[79] -#define SWIGTYPE_p_float swig_types[80] -#define SWIGTYPE_p_idx_t swig_types[81] -#define SWIGTYPE_p_int swig_types[82] -#define SWIGTYPE_p_long swig_types[83] -#define SWIGTYPE_p_p_faiss__LinearTransform swig_types[84] -#define SWIGTYPE_p_p_faiss__NormalizationTransform swig_types[85] -#define SWIGTYPE_p_p_faiss__OPQMatrix swig_types[86] -#define SWIGTYPE_p_p_faiss__PCAMatrix swig_types[87] -#define SWIGTYPE_p_p_faiss__RandomRotationMatrix swig_types[88] -#define SWIGTYPE_p_p_faiss__RemapDimensionsTransform swig_types[89] -#define SWIGTYPE_p_p_faiss__VectorTransform swig_types[90] -#define SWIGTYPE_p_std__unordered_mapT_long_long_t swig_types[91] -#define SWIGTYPE_p_std__vectorT_double_t swig_types[92] -#define SWIGTYPE_p_std__vectorT_faiss__BufferList__Buffer_t swig_types[93] -#define SWIGTYPE_p_std__vectorT_faiss__Index_p_t swig_types[94] -#define SWIGTYPE_p_std__vectorT_faiss__OperatingPoint_t swig_types[95] -#define SWIGTYPE_p_std__vectorT_faiss__ParameterRange_t swig_types[96] -#define SWIGTYPE_p_std__vectorT_faiss__RangeSearchPartialResult__QueryResult_t swig_types[97] -#define SWIGTYPE_p_std__vectorT_faiss__VectorTransform_p_t swig_types[98] -#define SWIGTYPE_p_std__vectorT_float_t swig_types[99] -#define SWIGTYPE_p_std__vectorT_int_t swig_types[100] -#define SWIGTYPE_p_std__vectorT_long_t swig_types[101] -#define SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t swig_types[102] -#define SWIGTYPE_p_std__vectorT_std__vectorT_long_t_t swig_types[103] -#define SWIGTYPE_p_std__vectorT_std__vectorT_uint8_t_t_t swig_types[104] -#define SWIGTYPE_p_std__vectorT_uint8_t_t swig_types[105] -#define SWIGTYPE_p_std__vectorT_unsigned_char_t swig_types[106] -#define SWIGTYPE_p_std__vectorT_unsigned_long_t swig_types[107] -#define SWIGTYPE_p_uint32_t swig_types[108] -#define SWIGTYPE_p_uint8_t swig_types[109] -#define SWIGTYPE_p_unsigned_char swig_types[110] -#define SWIGTYPE_p_unsigned_long swig_types[111] -#define SWIGTYPE_p_void swig_types[112] -static swig_type_info *swig_types[114]; -static swig_module_info swig_module = {swig_types, 113, 0, 0, 0, 0}; +#define SWIGTYPE_p_faiss__HammingComputerDefault swig_types[21] +#define SWIGTYPE_p_faiss__HammingComputerM4 swig_types[22] +#define SWIGTYPE_p_faiss__HammingComputerM8 swig_types[23] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t swig_types[24] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMaxT_int_long_t_t swig_types[25] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_float_long_t_t swig_types[26] +#define SWIGTYPE_p_faiss__HeapArrayT_faiss__CMinT_int_long_t_t swig_types[27] +#define SWIGTYPE_p_faiss__IDSelector swig_types[28] +#define SWIGTYPE_p_faiss__IDSelectorBatch swig_types[29] +#define SWIGTYPE_p_faiss__IDSelectorRange swig_types[30] +#define SWIGTYPE_p_faiss__Index swig_types[31] +#define SWIGTYPE_p_faiss__IndexFlat swig_types[32] +#define SWIGTYPE_p_faiss__IndexFlat1D swig_types[33] +#define SWIGTYPE_p_faiss__IndexFlatIP swig_types[34] +#define SWIGTYPE_p_faiss__IndexFlatL2 swig_types[35] +#define SWIGTYPE_p_faiss__IndexFlatL2BaseShift swig_types[36] +#define SWIGTYPE_p_faiss__IndexIDMap swig_types[37] +#define SWIGTYPE_p_faiss__IndexIDMap2 swig_types[38] +#define SWIGTYPE_p_faiss__IndexIVF swig_types[39] +#define SWIGTYPE_p_faiss__IndexIVFFlat swig_types[40] +#define SWIGTYPE_p_faiss__IndexIVFFlatIPBounds swig_types[41] +#define SWIGTYPE_p_faiss__IndexIVFFlatStats swig_types[42] +#define SWIGTYPE_p_faiss__IndexIVFPQ swig_types[43] +#define SWIGTYPE_p_faiss__IndexIVFPQCompact swig_types[44] +#define SWIGTYPE_p_faiss__IndexIVFPQR swig_types[45] +#define SWIGTYPE_p_faiss__IndexIVFPQStats swig_types[46] +#define SWIGTYPE_p_faiss__IndexIVFScalarQuantizer swig_types[47] +#define SWIGTYPE_p_faiss__IndexLSH swig_types[48] +#define SWIGTYPE_p_faiss__IndexPQ swig_types[49] +#define SWIGTYPE_p_faiss__IndexPQStats swig_types[50] +#define SWIGTYPE_p_faiss__IndexPreTransform swig_types[51] +#define SWIGTYPE_p_faiss__IndexRefineFlat swig_types[52] +#define SWIGTYPE_p_faiss__IndexScalarQuantizer swig_types[53] +#define SWIGTYPE_p_faiss__IndexShards swig_types[54] +#define SWIGTYPE_p_faiss__IndexSplitVectors swig_types[55] +#define SWIGTYPE_p_faiss__IntersectionCriterion swig_types[56] +#define SWIGTYPE_p_faiss__LinearTransform swig_types[57] +#define SWIGTYPE_p_faiss__MultiIndexQuantizer swig_types[58] +#define SWIGTYPE_p_faiss__NormalizationTransform swig_types[59] +#define SWIGTYPE_p_faiss__OPQMatrix swig_types[60] +#define SWIGTYPE_p_faiss__OneRecallAtRCriterion swig_types[61] +#define SWIGTYPE_p_faiss__OperatingPoint swig_types[62] +#define SWIGTYPE_p_faiss__OperatingPoints swig_types[63] +#define SWIGTYPE_p_faiss__PCAMatrix swig_types[64] +#define SWIGTYPE_p_faiss__ParameterRange swig_types[65] +#define SWIGTYPE_p_faiss__ParameterSpace swig_types[66] +#define SWIGTYPE_p_faiss__PermutationObjective swig_types[67] +#define SWIGTYPE_p_faiss__PolysemousTraining swig_types[68] +#define SWIGTYPE_p_faiss__ProductQuantizer swig_types[69] +#define SWIGTYPE_p_faiss__RandomGenerator swig_types[70] +#define SWIGTYPE_p_faiss__RandomRotationMatrix swig_types[71] +#define SWIGTYPE_p_faiss__RangeSearchPartialResult swig_types[72] +#define SWIGTYPE_p_faiss__RangeSearchPartialResult__QueryResult swig_types[73] +#define SWIGTYPE_p_faiss__RangeSearchResult swig_types[74] +#define SWIGTYPE_p_faiss__RemapDimensionsTransform swig_types[75] +#define SWIGTYPE_p_faiss__ReproduceDistancesObjective swig_types[76] +#define SWIGTYPE_p_faiss__ScalarQuantizer swig_types[77] +#define SWIGTYPE_p_faiss__SimulatedAnnealingOptimizer swig_types[78] +#define SWIGTYPE_p_faiss__SimulatedAnnealingParameters swig_types[79] +#define SWIGTYPE_p_faiss__VectorTransform swig_types[80] +#define SWIGTYPE_p_float swig_types[81] +#define SWIGTYPE_p_idx_t swig_types[82] +#define SWIGTYPE_p_int swig_types[83] +#define SWIGTYPE_p_long swig_types[84] +#define SWIGTYPE_p_p_faiss__LinearTransform swig_types[85] +#define SWIGTYPE_p_p_faiss__NormalizationTransform swig_types[86] +#define SWIGTYPE_p_p_faiss__OPQMatrix swig_types[87] +#define SWIGTYPE_p_p_faiss__PCAMatrix swig_types[88] +#define SWIGTYPE_p_p_faiss__RandomRotationMatrix swig_types[89] +#define SWIGTYPE_p_p_faiss__RemapDimensionsTransform swig_types[90] +#define SWIGTYPE_p_p_faiss__VectorTransform swig_types[91] +#define SWIGTYPE_p_std__unordered_mapT_long_long_t swig_types[92] +#define SWIGTYPE_p_std__vectorT_double_t swig_types[93] +#define SWIGTYPE_p_std__vectorT_faiss__BufferList__Buffer_t swig_types[94] +#define SWIGTYPE_p_std__vectorT_faiss__Index_p_t swig_types[95] +#define SWIGTYPE_p_std__vectorT_faiss__OperatingPoint_t swig_types[96] +#define SWIGTYPE_p_std__vectorT_faiss__ParameterRange_t swig_types[97] +#define SWIGTYPE_p_std__vectorT_faiss__RangeSearchPartialResult__QueryResult_t swig_types[98] +#define SWIGTYPE_p_std__vectorT_faiss__VectorTransform_p_t swig_types[99] +#define SWIGTYPE_p_std__vectorT_float_t swig_types[100] +#define SWIGTYPE_p_std__vectorT_int_t swig_types[101] +#define SWIGTYPE_p_std__vectorT_long_t swig_types[102] +#define SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t swig_types[103] +#define SWIGTYPE_p_std__vectorT_std__vectorT_long_t_t swig_types[104] +#define SWIGTYPE_p_std__vectorT_std__vectorT_uint8_t_t_t swig_types[105] +#define SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t swig_types[106] +#define SWIGTYPE_p_std__vectorT_uint8_t_t swig_types[107] +#define SWIGTYPE_p_std__vectorT_unsigned_char_t swig_types[108] +#define SWIGTYPE_p_std__vectorT_unsigned_long_t swig_types[109] +#define SWIGTYPE_p_uint32_t swig_types[110] +#define SWIGTYPE_p_uint8_t swig_types[111] +#define SWIGTYPE_p_unsigned_char swig_types[112] +#define SWIGTYPE_p_unsigned_long swig_types[113] +#define SWIGTYPE_p_void swig_types[114] +static swig_type_info *swig_types[116]; +static swig_module_info swig_module = {swig_types, 115, 0, 0, 0, 0}; #define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name) #define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name) @@ -3744,6 +3746,20 @@ PyObject * rev_swig_ptr(unsigned char *src, npy_intp size) { } +float * cast_integer_to_float_ptr (long x) { + return (float*)x; +} + +long * cast_integer_to_long_ptr (long x) { + return (long*)x; +} + +int * cast_integer_to_int_ptr (long x) { + return (int*)x; +} + + + // may be useful for lua code launched in background from shell #include @@ -5002,6 +5018,374 @@ SWIGINTERN PyObject *OperatingPointVector_swigregister(PyObject *SWIGUNUSEDPARM( return SWIG_Py_Void(); } +SWIGINTERN PyObject *_wrap_new_FloatVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)":new_FloatVectorVector")) SWIG_fail; + result = (std::vector< std::vector< float > > *)new std::vector< std::vector< float > >(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_push_back(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + std::vector< float > arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_push_back",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_push_back" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + { + res2 = SWIG_ConvertPtr(obj1, &argp2, SWIGTYPE_p_std__vectorT_float_t, 0 | 0); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "FloatVectorVector_push_back" "', argument " "2"" of type '" "std::vector< float >""'"); + } + if (!argp2) { + SWIG_exception_fail(SWIG_ValueError, "invalid null reference " "in method '" "FloatVectorVector_push_back" "', argument " "2"" of type '" "std::vector< float >""'"); + } else { + std::vector< float > * temp = reinterpret_cast< std::vector< float > * >(argp2); + arg2 = *temp; + if (SWIG_IsNewObj(res2)) delete temp; + } + } + (arg1)->push_back(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_data(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + std::vector< float > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:FloatVectorVector_data",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_data" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + result = (std::vector< float > *)(arg1)->data(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_float_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_size(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + size_t result; + + if (!PyArg_ParseTuple(args,(char *)"O:FloatVectorVector_size",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_size" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + result = (size_t)(arg1)->size(); + resultobj = SWIG_From_size_t(static_cast< size_t >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_at(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + std::vector< float > result; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_at",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_at" "', argument " "1"" of type '" "std::vector< std::vector< float > > const *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "FloatVectorVector_at" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + result = ((std::vector< std::vector< float > > const *)arg1)->at(arg2); + resultobj = SWIG_NewPointerObj((new std::vector< float >(static_cast< const std::vector< float >& >(result))), SWIGTYPE_p_std__vectorT_float_t, SWIG_POINTER_OWN | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_FloatVectorVector_resize(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:FloatVectorVector_resize",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "FloatVectorVector_resize" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "FloatVectorVector_resize" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + (arg1)->resize(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_FloatVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< float > > *arg1 = (std::vector< std::vector< float > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_FloatVectorVector",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_FloatVectorVector" "', argument " "1"" of type '" "std::vector< std::vector< float > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< float > > * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *FloatVectorVector_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_std__vectorT_std__vectorT_float_t_t, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + +SWIGINTERN PyObject *_wrap_new_ByteVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)":new_ByteVectorVector")) SWIG_fail; + result = (std::vector< std::vector< unsigned char > > *)new std::vector< std::vector< unsigned char > >(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_push_back(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + SwigValueWrapper< std::vector< unsigned char > > arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_push_back",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_push_back" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + { + res2 = SWIG_ConvertPtr(obj1, &argp2, SWIGTYPE_p_std__vectorT_unsigned_char_t, 0 | 0); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "ByteVectorVector_push_back" "', argument " "2"" of type '" "std::vector< unsigned char >""'"); + } + if (!argp2) { + SWIG_exception_fail(SWIG_ValueError, "invalid null reference " "in method '" "ByteVectorVector_push_back" "', argument " "2"" of type '" "std::vector< unsigned char >""'"); + } else { + std::vector< unsigned char > * temp = reinterpret_cast< std::vector< unsigned char > * >(argp2); + arg2 = *temp; + if (SWIG_IsNewObj(res2)) delete temp; + } + } + (arg1)->push_back(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_data(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + std::vector< unsigned char > *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:ByteVectorVector_data",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_data" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + result = (std::vector< unsigned char > *)(arg1)->data(); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_std__vectorT_unsigned_char_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_size(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + size_t result; + + if (!PyArg_ParseTuple(args,(char *)"O:ByteVectorVector_size",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_size" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + result = (size_t)(arg1)->size(); + resultobj = SWIG_From_size_t(static_cast< size_t >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_at(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + SwigValueWrapper< std::vector< unsigned char > > result; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_at",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_at" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > const *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "ByteVectorVector_at" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + result = ((std::vector< std::vector< unsigned char > > const *)arg1)->at(arg2); + resultobj = SWIG_NewPointerObj((new std::vector< unsigned char >(static_cast< const std::vector< unsigned char >& >(result))), SWIGTYPE_p_std__vectorT_unsigned_char_t, SWIG_POINTER_OWN | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_ByteVectorVector_resize(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + size_t arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + size_t val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:ByteVectorVector_resize",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "ByteVectorVector_resize" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + ecode2 = SWIG_AsVal_size_t(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "ByteVectorVector_resize" "', argument " "2"" of type '" "size_t""'"); + } + arg2 = static_cast< size_t >(val2); + (arg1)->resize(arg2); + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_ByteVectorVector(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + std::vector< std::vector< unsigned char > > *arg1 = (std::vector< std::vector< unsigned char > > *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_ByteVectorVector",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_ByteVectorVector" "', argument " "1"" of type '" "std::vector< std::vector< unsigned char > > *""'"); + } + arg1 = reinterpret_cast< std::vector< std::vector< unsigned char > > * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *ByteVectorVector_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_std__vectorT_std__vectorT_unsigned_char_t_t, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + SWIGINTERN PyObject *_wrap_popcount64(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; uint64_t arg1 ; @@ -7311,6 +7695,220 @@ SWIGINTERN PyObject *HammingComputer64_swigregister(PyObject *SWIGUNUSEDPARM(sel return SWIG_Py_Void(); } +SWIGINTERN PyObject *_wrap_HammingComputerDefault_a_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + uint8_t *arg2 = (uint8_t *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 = 0 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_a_set",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_a_set" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + res2 = SWIG_ConvertPtr(obj1, &argp2,SWIGTYPE_p_uint8_t, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "HammingComputerDefault_a_set" "', argument " "2"" of type '" "uint8_t const *""'"); + } + arg2 = reinterpret_cast< uint8_t * >(argp2); + if (arg1) (arg1)->a = (uint8_t const *)arg2; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_a_get(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + uint8_t *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:HammingComputerDefault_a_get",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_a_get" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + result = (uint8_t *) ((arg1)->a); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_uint8_t, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_n_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + int arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_n_set",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_n_set" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "HammingComputerDefault_n_set" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + if (arg1) (arg1)->n = arg2; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_n_get(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + int result; + + if (!PyArg_ParseTuple(args,(char *)"O:HammingComputerDefault_n_get",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_n_get" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + result = (int) ((arg1)->n); + resultobj = SWIG_From_int(static_cast< int >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_new_HammingComputerDefault(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + uint8_t *arg1 = (uint8_t *) 0 ; + int arg2 ; + void *argp1 = 0 ; + int res1 = 0 ; + int val2 ; + int ecode2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + faiss::HammingComputerDefault *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"OO:new_HammingComputerDefault",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_uint8_t, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "new_HammingComputerDefault" "', argument " "1"" of type '" "uint8_t const *""'"); + } + arg1 = reinterpret_cast< uint8_t * >(argp1); + ecode2 = SWIG_AsVal_int(obj1, &val2); + if (!SWIG_IsOK(ecode2)) { + SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "new_HammingComputerDefault" "', argument " "2"" of type '" "int""'"); + } + arg2 = static_cast< int >(val2); + { + Py_BEGIN_ALLOW_THREADS + try { + result = (faiss::HammingComputerDefault *)new faiss::HammingComputerDefault((uint8_t const *)arg1,arg2); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_POINTER_NEW | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_HammingComputerDefault_hamming(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + uint8_t *arg2 = (uint8_t *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + void *argp2 = 0 ; + int res2 = 0 ; + PyObject * obj0 = 0 ; + PyObject * obj1 = 0 ; + int result; + + if (!PyArg_ParseTuple(args,(char *)"OO:HammingComputerDefault_hamming",&obj0,&obj1)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, 0 | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "HammingComputerDefault_hamming" "', argument " "1"" of type '" "faiss::HammingComputerDefault const *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + res2 = SWIG_ConvertPtr(obj1, &argp2,SWIGTYPE_p_uint8_t, 0 | 0 ); + if (!SWIG_IsOK(res2)) { + SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "HammingComputerDefault_hamming" "', argument " "2"" of type '" "uint8_t const *""'"); + } + arg2 = reinterpret_cast< uint8_t * >(argp2); + { + Py_BEGIN_ALLOW_THREADS + try { + result = (int)((faiss::HammingComputerDefault const *)arg1)->hamming((uint8_t const *)arg2); + } catch(faiss::FaissException & e) { + PyEval_RestoreThread(_save); + PyErr_SetString(PyExc_RuntimeError, e.what()); + SWIG_fail; + } + Py_END_ALLOW_THREADS + } + resultobj = SWIG_From_int(static_cast< int >(result)); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_delete_HammingComputerDefault(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + faiss::HammingComputerDefault *arg1 = (faiss::HammingComputerDefault *) 0 ; + void *argp1 = 0 ; + int res1 = 0 ; + PyObject * obj0 = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:delete_HammingComputerDefault",&obj0)) SWIG_fail; + res1 = SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_POINTER_DISOWN | 0 ); + if (!SWIG_IsOK(res1)) { + SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_HammingComputerDefault" "', argument " "1"" of type '" "faiss::HammingComputerDefault *""'"); + } + arg1 = reinterpret_cast< faiss::HammingComputerDefault * >(argp1); + delete arg1; + resultobj = SWIG_Py_Void(); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *HammingComputerDefault_swigregister(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *obj; + if (!PyArg_ParseTuple(args,(char*)"O:swigregister", &obj)) return NULL; + SWIG_TypeNewClientData(SWIGTYPE_p_faiss__HammingComputerDefault, SWIG_NewClientData(obj)); + return SWIG_Py_Void(); +} + SWIGINTERN PyObject *_wrap_HammingComputerM8_a_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::HammingComputerM8 *arg1 = (faiss::HammingComputerM8 *) 0 ; @@ -40396,72 +40994,72 @@ SWIGINTERN PyObject *_wrap_downcast_index(PyObject *SWIGUNUSEDPARM(self), PyObje Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,0); } else @@ -40473,7 +41071,7 @@ SWIGINTERN PyObject *_wrap_downcast_index(PyObject *SWIGUNUSEDPARM(self), PyObje // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,0); } else @@ -40522,37 +41120,37 @@ SWIGINTERN PyObject *_wrap_downcast_VectorTransform(PyObject *SWIGUNUSEDPARM(sel Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,0); } else @@ -40735,72 +41333,72 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_0(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -40812,7 +41410,7 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_0(PyObject *SWIGUNUSEDPARM(self), Py // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -40861,72 +41459,72 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_1(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -40938,7 +41536,7 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_1(PyObject *SWIGUNUSEDPARM(self), Py // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -40997,72 +41595,72 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_2(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -41074,7 +41672,7 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_2(PyObject *SWIGUNUSEDPARM(self), Py // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -41126,72 +41724,72 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_3(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -41203,7 +41801,7 @@ SWIGINTERN PyObject *_wrap_read_index__SWIG_3(PyObject *SWIGUNUSEDPARM(self), Py // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -41366,37 +41964,37 @@ SWIGINTERN PyObject *_wrap_read_VectorTransform(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,SWIG_POINTER_OWN); } else @@ -41520,72 +42118,72 @@ SWIGINTERN PyObject *_wrap_clone_index(PyObject *SWIGUNUSEDPARM(self), PyObject Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -41597,7 +42195,7 @@ SWIGINTERN PyObject *_wrap_clone_index(PyObject *SWIGUNUSEDPARM(self), PyObject // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -41655,37 +42253,37 @@ SWIGINTERN PyObject *_wrap_Cloner_clone_VectorTransform(PyObject *SWIGUNUSEDPARM Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RemapDimensionsTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__OPQMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__PCAMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__RandomRotationMatrix,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__LinearTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__NormalizationTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__VectorTransform,SWIG_POINTER_OWN); } else @@ -41738,72 +42336,72 @@ SWIGINTERN PyObject *_wrap_Cloner_clone_Index(PyObject *SWIGUNUSEDPARM(self), Py Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,0); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,0); } else @@ -41815,7 +42413,7 @@ SWIGINTERN PyObject *_wrap_Cloner_clone_Index(PyObject *SWIGUNUSEDPARM(self), Py // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,0); } else @@ -44882,72 +45480,72 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_0(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -44959,7 +45557,7 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_0(PyObject *SWIGUNUSEDPARM(self), // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -45020,72 +45618,72 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_1(PyObject *SWIGUNUSEDPARM(self), Py_END_ALLOW_THREADS } { - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIDMap,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexShards,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQCompact,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQR,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVFFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexIVF,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexFlat,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPQ,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexScalarQuantizer,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexLSH,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__IndexPreTransform,SWIG_POINTER_OWN); } else /*@SWIG@*/ - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__MultiIndexQuantizer,SWIG_POINTER_OWN); } else @@ -45097,7 +45695,7 @@ SWIGINTERN PyObject *_wrap_index_factory__SWIG_1(PyObject *SWIGUNUSEDPARM(self), // default for non-recognized classes - /*@SWIG:swigfaiss.swig,397,DOWNCAST@*/ + /*@SWIG:swigfaiss.swig,401,DOWNCAST@*/ if (dynamic_cast (result)) { resultobj = SWIG_NewPointerObj(result,SWIGTYPE_p_faiss__Index,SWIG_POINTER_OWN); } else @@ -50237,6 +50835,72 @@ fail: } +SWIGINTERN PyObject *_wrap_cast_integer_to_float_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + float *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_float_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_float_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (float *)cast_integer_to_float_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_float, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_cast_integer_to_long_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + long *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_long_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_long_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (long *)cast_integer_to_long_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_long, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + +SWIGINTERN PyObject *_wrap_cast_integer_to_int_ptr(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { + PyObject *resultobj = 0; + long arg1 ; + long val1 ; + int ecode1 = 0 ; + PyObject * obj0 = 0 ; + int *result = 0 ; + + if (!PyArg_ParseTuple(args,(char *)"O:cast_integer_to_int_ptr",&obj0)) SWIG_fail; + ecode1 = SWIG_AsVal_long(obj0, &val1); + if (!SWIG_IsOK(ecode1)) { + SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "cast_integer_to_int_ptr" "', argument " "1"" of type '" "long""'"); + } + arg1 = static_cast< long >(val1); + result = (int *)cast_integer_to_int_ptr(arg1); + resultobj = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_int, 0 | 0 ); + return resultobj; +fail: + return NULL; +} + + SWIGINTERN PyObject *_wrap_RangeSearchResult_nq_set(PyObject *SWIGUNUSEDPARM(self), PyObject *args) { PyObject *resultobj = 0; faiss::RangeSearchResult *arg1 = (faiss::RangeSearchResult *) 0 ; @@ -51730,6 +52394,22 @@ static PyMethodDef SwigMethods[] = { { (char *)"OperatingPointVector_resize", _wrap_OperatingPointVector_resize, METH_VARARGS, NULL}, { (char *)"delete_OperatingPointVector", _wrap_delete_OperatingPointVector, METH_VARARGS, NULL}, { (char *)"OperatingPointVector_swigregister", OperatingPointVector_swigregister, METH_VARARGS, NULL}, + { (char *)"new_FloatVectorVector", _wrap_new_FloatVectorVector, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_push_back", _wrap_FloatVectorVector_push_back, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_data", _wrap_FloatVectorVector_data, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_size", _wrap_FloatVectorVector_size, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_at", _wrap_FloatVectorVector_at, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_resize", _wrap_FloatVectorVector_resize, METH_VARARGS, NULL}, + { (char *)"delete_FloatVectorVector", _wrap_delete_FloatVectorVector, METH_VARARGS, NULL}, + { (char *)"FloatVectorVector_swigregister", FloatVectorVector_swigregister, METH_VARARGS, NULL}, + { (char *)"new_ByteVectorVector", _wrap_new_ByteVectorVector, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_push_back", _wrap_ByteVectorVector_push_back, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_data", _wrap_ByteVectorVector_data, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_size", _wrap_ByteVectorVector_size, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_at", _wrap_ByteVectorVector_at, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_resize", _wrap_ByteVectorVector_resize, METH_VARARGS, NULL}, + { (char *)"delete_ByteVectorVector", _wrap_delete_ByteVectorVector, METH_VARARGS, NULL}, + { (char *)"ByteVectorVector_swigregister", ByteVectorVector_swigregister, METH_VARARGS, NULL}, { (char *)"popcount64", _wrap_popcount64, METH_VARARGS, NULL}, { (char *)"hammings", _wrap_hammings, METH_VARARGS, NULL}, { (char *)"bitvec_print", _wrap_bitvec_print, METH_VARARGS, NULL}, @@ -51802,6 +52482,14 @@ static PyMethodDef SwigMethods[] = { { (char *)"HammingComputer64_hamming", _wrap_HammingComputer64_hamming, METH_VARARGS, NULL}, { (char *)"delete_HammingComputer64", _wrap_delete_HammingComputer64, METH_VARARGS, NULL}, { (char *)"HammingComputer64_swigregister", HammingComputer64_swigregister, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_a_set", _wrap_HammingComputerDefault_a_set, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_a_get", _wrap_HammingComputerDefault_a_get, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_n_set", _wrap_HammingComputerDefault_n_set, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_n_get", _wrap_HammingComputerDefault_n_get, METH_VARARGS, NULL}, + { (char *)"new_HammingComputerDefault", _wrap_new_HammingComputerDefault, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_hamming", _wrap_HammingComputerDefault_hamming, METH_VARARGS, NULL}, + { (char *)"delete_HammingComputerDefault", _wrap_delete_HammingComputerDefault, METH_VARARGS, NULL}, + { (char *)"HammingComputerDefault_swigregister", HammingComputerDefault_swigregister, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_a_set", _wrap_HammingComputerM8_a_set, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_a_get", _wrap_HammingComputerM8_a_get, METH_VARARGS, NULL}, { (char *)"HammingComputerM8_n_set", _wrap_HammingComputerM8_n_set, METH_VARARGS, NULL}, @@ -52745,6 +53433,9 @@ static PyMethodDef SwigMethods[] = { { (char *)"omp_set_num_threads", _wrap_omp_set_num_threads, METH_VARARGS, NULL}, { (char *)"omp_get_max_threads", _wrap_omp_get_max_threads, METH_VARARGS, NULL}, { (char *)"memcpy", _wrap_memcpy, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_float_ptr", _wrap_cast_integer_to_float_ptr, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_long_ptr", _wrap_cast_integer_to_long_ptr, METH_VARARGS, NULL}, + { (char *)"cast_integer_to_int_ptr", _wrap_cast_integer_to_int_ptr, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_nq_set", _wrap_RangeSearchResult_nq_set, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_nq_get", _wrap_RangeSearchResult_nq_get, METH_VARARGS, NULL}, { (char *)"RangeSearchResult_lims_set", _wrap_RangeSearchResult_lims_set, METH_VARARGS, NULL}, @@ -53015,6 +53706,7 @@ static swig_type_info _swigt__p_faiss__HammingComputer32 = {"_p_faiss__HammingCo static swig_type_info _swigt__p_faiss__HammingComputer4 = {"_p_faiss__HammingComputer4", "faiss::HammingComputer4 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputer64 = {"_p_faiss__HammingComputer64", "faiss::HammingComputer64 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputer8 = {"_p_faiss__HammingComputer8", "faiss::HammingComputer8 *", 0, 0, (void*)0, 0}; +static swig_type_info _swigt__p_faiss__HammingComputerDefault = {"_p_faiss__HammingComputerDefault", "faiss::HammingComputerDefault *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputerM4 = {"_p_faiss__HammingComputerM4", "faiss::HammingComputerM4 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HammingComputerM8 = {"_p_faiss__HammingComputerM8", "faiss::HammingComputerM8 *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t = {"_p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t", "faiss::HeapArray< faiss::CMax< float,long > > *|faiss::float_maxheap_array_t *", 0, 0, (void*)0, 0}; @@ -53099,6 +53791,7 @@ static swig_type_info _swigt__p_std__vectorT_long_t = {"_p_std__vectorT_long_t", static swig_type_info _swigt__p_std__vectorT_std__vectorT_float_t_t = {"_p_std__vectorT_std__vectorT_float_t_t", "std::vector< std::vector< float > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_std__vectorT_long_t_t = {"_p_std__vectorT_std__vectorT_long_t_t", "std::vector< std::vector< long > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_std__vectorT_uint8_t_t_t = {"_p_std__vectorT_std__vectorT_uint8_t_t_t", "std::vector< std::vector< uint8_t > > *", 0, 0, (void*)0, 0}; +static swig_type_info _swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t = {"_p_std__vectorT_std__vectorT_unsigned_char_t_t", "std::vector< std::vector< unsigned char > > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_uint8_t_t = {"_p_std__vectorT_uint8_t_t", "std::vector< uint8_t > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_unsigned_char_t = {"_p_std__vectorT_unsigned_char_t", "std::vector< unsigned char > *|std::vector< faiss::IndexLSH::uint8_t > *", 0, 0, (void*)0, 0}; static swig_type_info _swigt__p_std__vectorT_unsigned_long_t = {"_p_std__vectorT_unsigned_long_t", "std::vector< unsigned long > *|std::vector< uint64_t > *", 0, 0, (void*)0, 0}; @@ -53130,6 +53823,7 @@ static swig_type_info *swig_type_initial[] = { &_swigt__p_faiss__HammingComputer4, &_swigt__p_faiss__HammingComputer64, &_swigt__p_faiss__HammingComputer8, + &_swigt__p_faiss__HammingComputerDefault, &_swigt__p_faiss__HammingComputerM4, &_swigt__p_faiss__HammingComputerM8, &_swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, @@ -53214,6 +53908,7 @@ static swig_type_info *swig_type_initial[] = { &_swigt__p_std__vectorT_std__vectorT_float_t_t, &_swigt__p_std__vectorT_std__vectorT_long_t_t, &_swigt__p_std__vectorT_std__vectorT_uint8_t_t_t, + &_swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t, &_swigt__p_std__vectorT_uint8_t_t, &_swigt__p_std__vectorT_unsigned_char_t, &_swigt__p_std__vectorT_unsigned_long_t, @@ -53245,6 +53940,7 @@ static swig_cast_info _swigc__p_faiss__HammingComputer32[] = { {&_swigt__p_fais static swig_cast_info _swigc__p_faiss__HammingComputer4[] = { {&_swigt__p_faiss__HammingComputer4, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputer64[] = { {&_swigt__p_faiss__HammingComputer64, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputer8[] = { {&_swigt__p_faiss__HammingComputer8, 0, 0, 0},{0, 0, 0, 0}}; +static swig_cast_info _swigc__p_faiss__HammingComputerDefault[] = { {&_swigt__p_faiss__HammingComputerDefault, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputerM4[] = { {&_swigt__p_faiss__HammingComputerM4, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HammingComputerM8[] = { {&_swigt__p_faiss__HammingComputerM8, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t[] = { {&_swigt__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, 0, 0, 0},{0, 0, 0, 0}}; @@ -53329,6 +54025,7 @@ static swig_cast_info _swigc__p_std__vectorT_long_t[] = { {&_swigt__p_std__vect static swig_cast_info _swigc__p_std__vectorT_std__vectorT_float_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_float_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_std__vectorT_long_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_long_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_std__vectorT_uint8_t_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_uint8_t_t_t, 0, 0, 0},{0, 0, 0, 0}}; +static swig_cast_info _swigc__p_std__vectorT_std__vectorT_unsigned_char_t_t[] = { {&_swigt__p_std__vectorT_std__vectorT_unsigned_char_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_uint8_t_t[] = { {&_swigt__p_std__vectorT_uint8_t_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_unsigned_char_t[] = { {&_swigt__p_std__vectorT_unsigned_char_t, 0, 0, 0},{0, 0, 0, 0}}; static swig_cast_info _swigc__p_std__vectorT_unsigned_long_t[] = { {&_swigt__p_std__vectorT_unsigned_long_t, 0, 0, 0},{0, 0, 0, 0}}; @@ -53360,6 +54057,7 @@ static swig_cast_info *swig_cast_initial[] = { _swigc__p_faiss__HammingComputer4, _swigc__p_faiss__HammingComputer64, _swigc__p_faiss__HammingComputer8, + _swigc__p_faiss__HammingComputerDefault, _swigc__p_faiss__HammingComputerM4, _swigc__p_faiss__HammingComputerM8, _swigc__p_faiss__HeapArrayT_faiss__CMaxT_float_long_t_t, @@ -53444,6 +54142,7 @@ static swig_cast_info *swig_cast_initial[] = { _swigc__p_std__vectorT_std__vectorT_float_t_t, _swigc__p_std__vectorT_std__vectorT_long_t_t, _swigc__p_std__vectorT_std__vectorT_uint8_t_t_t, + _swigc__p_std__vectorT_std__vectorT_unsigned_char_t_t, _swigc__p_std__vectorT_uint8_t_t, _swigc__p_std__vectorT_unsigned_char_t, _swigc__p_std__vectorT_unsigned_long_t, diff --git a/swigfaiss.swig b/swigfaiss.swig index 41809e267..dff3b6d00 100644 --- a/swigfaiss.swig +++ b/swigfaiss.swig @@ -124,6 +124,10 @@ namespace std { %template(IntVector) std::vector; %template(VectorTransformVector) std::vector; %template(OperatingPointVector) std::vector; +%template(FloatVectorVector) std::vector >; +%template(ByteVectorVector) std::vector >; + + #ifdef GPU_WRAPPER %template(GpuResourcesVector) std::vector; @@ -665,6 +669,26 @@ int omp_get_max_threads (); void *memcpy(void *dest, const void *src, size_t n); +/******************************************************************* + * For Faiss/Pytorch interop via pointers encoded as longs + *******************************************************************/ + +%inline %{ +float * cast_integer_to_float_ptr (long x) { + return (float*)x; +} + +long * cast_integer_to_long_ptr (long x) { + return (long*)x; +} + +int * cast_integer_to_int_ptr (long x) { + return (int*)x; +} + +%} + + /******************************************************************* * Range search interface diff --git a/utils.cpp b/utils.cpp index fd925ddbe..6be38b348 100644 --- a/utils.cpp +++ b/utils.cpp @@ -927,8 +927,8 @@ void knn_inner_product (const float * x, struct NopDistanceCorrection { - float operator()(float dis, size_t qno, size_t bno) const { - return dis; + float operator()(float dis, size_t /*qno*/, size_t /*bno*/) const { + return dis; } }; @@ -947,8 +947,8 @@ void knn_L2sqr (const float * x, struct BaseShiftDistanceCorrection { const float *base_shift; - float operator()(float dis, size_t qno, size_t bno) const { - return dis - base_shift[bno]; + float operator()(float dis, size_t /*qno*/, size_t bno) const { + return dis - base_shift[bno]; } };