mirror of
https://github.com/facebookresearch/faiss.git
synced 2025-06-03 21:54:02 +08:00
a8118acbc5
Changelog: - changed license: BSD+Patents -> MIT - propagates exceptions raised in sub-indexes of IndexShards and IndexReplicas - support for searching several inverted lists in parallel (parallel_mode != 0) - better support for PQ codes where nbit != 8 or 16 - IVFSpectralHash implementation: spectral hash codes inside an IVF - 6-bit per component scalar quantizer (4 and 8 bit were already supported) - combinations of inverted lists: HStackInvertedLists and VStackInvertedLists - configurable number of threads for OnDiskInvertedLists prefetching (including 0=no prefetch) - more test and demo code compatible with Python 3 (print with parentheses) - refactored benchmark code: data loading is now in a single file
22 lines
671 B
Plaintext
22 lines
671 B
Plaintext
/**
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This source code is licensed under the MIT license found in the
|
|
* LICENSE file in the root directory of this source tree.
|
|
*/
|
|
|
|
|
|
#include "../utils/DeviceTensor.cuh"
|
|
|
|
namespace faiss { namespace gpu {
|
|
|
|
// Performs brute-force k-NN comparison between `vecs` and `query`, where they
|
|
// are encoded as binary vectors
|
|
void runBinaryDistance(Tensor<unsigned char, 2, true>& vecs,
|
|
Tensor<unsigned char, 2, true>& query,
|
|
Tensor<int, 2, true>& outK,
|
|
Tensor<int, 2, true>& outV,
|
|
int k, cudaStream_t stream);
|
|
|
|
} } // namespace
|