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
25 lines
646 B
Python
25 lines
646 B
Python
# 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.
|
|
|
|
#! /usr/bin/env python3
|
|
# this is a slow computation to test whether ctrl-C handling works
|
|
import faiss
|
|
import numpy as np
|
|
|
|
def test_slow():
|
|
d = 256
|
|
index = faiss.index_cpu_to_gpu(faiss.StandardGpuResources(),
|
|
0, faiss.IndexFlatL2(d))
|
|
x = np.random.rand(10 ** 6, d).astype('float32')
|
|
print('add')
|
|
index.add(x)
|
|
print('search')
|
|
index.search(x, 10)
|
|
print('done')
|
|
|
|
|
|
if __name__ == '__main__':
|
|
test_slow()
|