File hamming-inl.h¶
Defines
-
SPECIALIZED_HC(CODE_SIZE)¶
-
namespace faiss
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.
Throughout the library, vectors are provided as float * pointers. Most algorithms can be optimized when several vectors are processed (added/searched) together in a batch. In this case, they are passed in as a matrix. When n vectors of size d are provided as float * x, component j of vector i is
x[ i * d + j ]
where 0 <= i < n and 0 <= j < d. In other words, matrices are always compact. When specifying the size of the matrix, we call it an n*d matrix, which implies a row-major storage.
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. I/O functions can read/write to a filename, a file handle or to an object that abstracts the medium.
The read functions return objects that should be deallocated with delete. All references within these objectes are owned by the object.
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. Definition of inverted lists + a few common classes that implement the interface.
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. Since IVF (inverted file) indexes are of so much use for large-scale use cases, we group a few functions related to them in this small library. Most functions work both on IndexIVFs and IndexIVFs embedded within an IndexPreTransform.
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. In this file are the implementations of extra metrics beyond L2 and inner product
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. Defines a few objects that apply transformations to a set of vectors Often these are pre-processing steps.
Functions
- SPECIALIZED_HC (4)
- SPECIALIZED_HC (8)
- SPECIALIZED_HC (16)
- SPECIALIZED_HC (20)
- SPECIALIZED_HC (32)
- SPECIALIZED_HC (64)
-
inline int generalized_hamming_64(uint64_t a)¶
-
void generalized_hammings_knn_hc(int_maxheap_array_t *ha, const uint8_t *a, const uint8_t *b, size_t nb, size_t code_size, int ordered = true)¶
generalized Hamming distances (= count number of code bytes that are the same)
Variables
-
const uint8_t hamdis_tab_ham_bytes[256]¶
-
struct HammingComputer4¶
Public Functions
-
inline HammingComputer4()¶
-
inline HammingComputer4(const uint8_t *a, int code_size)¶
-
inline void set(const uint8_t *a, int code_size)¶
-
inline int hamming(const uint8_t *b) const¶
Public Members
-
uint32_t a0¶
-
inline HammingComputer4()¶
-
struct HammingComputer8¶
Public Functions
-
inline HammingComputer8()¶
-
inline HammingComputer8(const uint8_t *a, int code_size)¶
-
inline void set(const uint8_t *a, int code_size)¶
-
inline int hamming(const uint8_t *b) const¶
Public Members
-
uint64_t a0¶
-
inline HammingComputer8()¶
-
struct HammingComputer16¶
-
struct HammingComputer20¶
-
struct HammingComputer32¶
-
struct HammingComputer64¶
-
struct HammingComputerDefault¶
Subclassed by faiss::HammingComputer< CODE_SIZE >
-
struct HammingComputerM8¶
-
struct HammingComputerM4¶
-
template<int CODE_SIZE>
struct HammingComputer : public faiss::HammingComputerDefault¶
-
struct GenHammingComputer8¶
Public Functions
-
inline GenHammingComputer8(const uint8_t *a, int code_size)¶
-
inline int hamming(const uint8_t *b) const¶
Public Members
-
uint64_t a0¶
-
inline GenHammingComputer8(const uint8_t *a, int code_size)¶
-
struct GenHammingComputer16¶
-
struct GenHammingComputer32¶
-
struct GenHammingComputerM8¶
-
template<class HammingComputer>
struct HCounterState¶ - #include <hamming-inl.h>
This class maintains a list of best distances seen so far.
Since the distances are in a limited range (0 to nbit), the object maintains one list per possible distance, and fills in only the n-first lists, such that the sum of sizes of the n lists is below k.