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
44 lines
1.1 KiB
C++
44 lines
1.1 KiB
C++
/**
|
|
* 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 "RemapIndices.h"
|
|
#include "../../FaissAssert.h"
|
|
|
|
namespace faiss { namespace gpu {
|
|
|
|
// Utility function to translate (list id, offset) to a user index on
|
|
// the CPU. In a cpp in order to use OpenMP
|
|
void ivfOffsetToUserIndex(
|
|
long* indices,
|
|
int numLists,
|
|
int queries,
|
|
int k,
|
|
const std::vector<std::vector<long>>& listOffsetToUserIndex) {
|
|
FAISS_ASSERT(numLists == listOffsetToUserIndex.size());
|
|
|
|
#pragma omp parallel for
|
|
for (int q = 0; q < queries; ++q) {
|
|
for (int r = 0; r < k; ++r) {
|
|
long offsetIndex = indices[q * k + r];
|
|
|
|
if (offsetIndex < 0) continue;
|
|
|
|
int listId = (int) (offsetIndex >> 32);
|
|
int listOffset = (int) (offsetIndex & 0xffffffff);
|
|
|
|
FAISS_ASSERT(listId < numLists);
|
|
auto& listIndices = listOffsetToUserIndex[listId];
|
|
|
|
FAISS_ASSERT(listOffset < listIndices.size());
|
|
indices[q * k + r] = listIndices[listOffset];
|
|
}
|
|
}
|
|
}
|
|
|
|
} } // namespace
|