mirror of
https://github.com/facebookresearch/faiss.git
synced 2026-10-12 02:13:36 +00:00
Tia Lim
0f0f728166
Summary: Pull Request resolved: https://github.com/facebookresearch/faiss/pull/5349 # this is a no-op change Ran `black -l 80` over all tracked Python files under `fbcode/faiss/`, using line length 80 to match faiss's documented coding style (`CONTRIBUTING.md`: "80 character line length (both for C++ and Python)"). 172 files were reformatted; 28 were already compliant. This is a pure-formatting change. `black` runs its AST-equivalence safety check on every file, so no identifiers, string/numeric values, operators, or control flow were altered — only whitespace, indentation, line wrapping, blank lines, trailing commas, and string-quote normalization (single to double quotes). `fbcode/faiss/` is intentionally excluded from Meta's standard Python autoformatter (`arc f` / `arc lint -a` report no formatter for these paths) because it mirrors to public GitHub, so the Python had drifted out of any consistent style. The C++ is already clang-format-clean (0 of 807 files change), so this effort is Python-only. This diff brings the Python to canonical `black` formatting. Excluded `demos/index_pq_flat_separate_codes_from_codebook.py`: it contains a Jupyter `!rm` shell-magic line and is not valid Python, so `black` cannot parse it. This is the base of a 3-diff stack: (1) this black reformat; (2) `.flake8` alignment (max-line-length 80 + black-compatible ignores E203/W503); (3) genuine lint fixes (F401/F403/F841/B011). Reviewed By: mnorris11 Differential Revision: D109736099 fbshipit-source-id: 9a054635766ed11aa3760a788395babd3d198abf
86 lines
2.6 KiB
Python
Executable File
86 lines
2.6 KiB
Python
Executable File
# Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
#
|
|
# This source code is licensed under the MIT license found in the
|
|
# LICENSE file in the root directory of this source tree.
|
|
|
|
from multiprocessing.pool import ThreadPool
|
|
import faiss
|
|
from typing import List, Tuple
|
|
|
|
from . import rpc
|
|
|
|
############################################################
|
|
# Server implementation
|
|
############################################################
|
|
|
|
|
|
class SearchServer(rpc.Server):
|
|
"""Assign version that can be exposed via RPC"""
|
|
|
|
def __init__(self, s: int, index: faiss.Index):
|
|
rpc.Server.__init__(self, s)
|
|
self.index = index
|
|
self.index_ivf = faiss.extract_index_ivf(index)
|
|
|
|
def set_nprobe(self, nprobe: int) -> int:
|
|
"""set nprobe field"""
|
|
self.index_ivf.nprobe = nprobe
|
|
|
|
def get_ntotal(self) -> int:
|
|
return self.index.ntotal
|
|
|
|
def __getattr__(self, f):
|
|
# all other functions get forwarded to the index
|
|
return getattr(self.index, f)
|
|
|
|
|
|
def run_index_server(index: faiss.Index, port: int, v6: bool = False):
|
|
"""serve requests for that index forever"""
|
|
rpc.run_server(lambda s: SearchServer(s, index), port, v6=v6)
|
|
|
|
|
|
############################################################
|
|
# Client implementation
|
|
############################################################
|
|
|
|
|
|
class ClientIndex:
|
|
"""manages a set of distance sub-indexes. The sub_indexes search a
|
|
subset of the inverted lists. Searches are merged afterwards
|
|
"""
|
|
|
|
def __init__(self, machine_ports: List[Tuple[str, int]], v6: bool = False):
|
|
"""connect to a series of (host, port) pairs"""
|
|
self.sub_indexes = []
|
|
for machine, port in machine_ports:
|
|
self.sub_indexes.append(rpc.Client(machine, port, v6))
|
|
|
|
self.ni = len(self.sub_indexes)
|
|
# pool of threads. Each thread manages one sub-index.
|
|
self.pool = ThreadPool(self.ni)
|
|
# test connection...
|
|
self.ntotal = self.get_ntotal()
|
|
self.verbose = False
|
|
|
|
def set_nprobe(self, nprobe: int) -> None:
|
|
self.pool.map(lambda idx: idx.set_nprobe(nprobe), self.sub_indexes)
|
|
|
|
def set_omp_num_threads(self, nt: int) -> None:
|
|
self.pool.map(lambda idx: idx.set_omp_num_threads(nt), self.sub_indexes)
|
|
|
|
def get_ntotal(self) -> None:
|
|
return sum(
|
|
self.pool.map(lambda idx: idx.get_ntotal(), self.sub_indexes)
|
|
)
|
|
|
|
def search(self, x, k: int):
|
|
|
|
rh = faiss.ResultHeap(x.shape[0], k)
|
|
|
|
for Di, Ii in self.pool.imap(
|
|
lambda idx: idx.search(x, k), self.sub_indexes
|
|
):
|
|
rh.add_result(Di, Ii)
|
|
rh.finalize()
|
|
return rh.D, rh.I
|