mirror of
https://github.com/facebookresearch/faiss.git
synced 2025-06-03 21:54:02 +08:00
3896b12c65
Bugfixes: - slow scanning of inverted lists (#836). Features: - add basic support for 6 new metrics in CPU `IndexFlat` and `IndexHNSW` (#848); - add support for `IndexIDMap`/`IndexIDMap2` with binary indexes (#780). Misc: - throw python exception for OOM (#758); - make `DistanceComputer` available for all random access indexes; - gradually moving from `long` to `int64_t` for portability.
37 lines
782 B
Python
37 lines
782 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
|
|
|
|
"""small test script to benchmark the SIMD implementation of the
|
|
distance computations for the additional metrics. Call eg. with L1 to
|
|
get L1 distance computations.
|
|
"""
|
|
|
|
import faiss
|
|
|
|
import sys
|
|
import time
|
|
|
|
d = 64
|
|
nq = 4096
|
|
nb = 16384
|
|
|
|
print("sample")
|
|
|
|
xq = faiss.randn((nq, d), 123)
|
|
xb = faiss.randn((nb, d), 123)
|
|
|
|
mt_name = "L2" if len(sys.argv) < 2 else sys.argv[1]
|
|
|
|
mt = getattr(faiss, "METRIC_" + mt_name)
|
|
|
|
print("distances")
|
|
t0 = time.time()
|
|
dis = faiss.pairwise_distances(xq, xb, mt)
|
|
t1 = time.time()
|
|
|
|
print("nq=%d nb=%d d=%d %s: %.3f s" % (nq, nb, d, mt_name, t1 - t0))
|