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
36 lines
917 B
Python
36 lines
917 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 python2
|
|
|
|
import unittest
|
|
import faiss
|
|
|
|
|
|
class TestBinaryFactory(unittest.TestCase):
|
|
|
|
def test_factory_IVF(self):
|
|
|
|
index = faiss.index_binary_factory(16, "BIVF10")
|
|
assert index.invlists is not None
|
|
assert index.nlist == 10
|
|
assert index.code_size == 2
|
|
|
|
def test_factory_Flat(self):
|
|
|
|
index = faiss.index_binary_factory(16, "BFlat")
|
|
assert index.code_size == 2
|
|
|
|
def test_factory_HNSW(self):
|
|
|
|
index = faiss.index_binary_factory(256, "BHNSW32")
|
|
assert index.code_size == 32
|
|
|
|
def test_factory_IVF_HNSW(self):
|
|
|
|
index = faiss.index_binary_factory(256, "BIVF1024_BHNSW32")
|
|
assert index.code_size == 32
|
|
assert index.nlist == 1024
|