mirror of
https://github.com/facebookresearch/faiss.git
synced 2025-06-03 21:54:02 +08:00
26 lines
567 B
C
26 lines
567 B
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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
// -*- c++ -*-
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <faiss/Index.h>
|
||
|
|
#include <faiss/IndexBinary.h>
|
||
|
|
|
||
|
|
namespace faiss {
|
||
|
|
|
||
|
|
/** Build and index with the sequence of processing steps described in
|
||
|
|
* the string. */
|
||
|
|
Index *index_factory (int d, const char *description,
|
||
|
|
MetricType metric = METRIC_L2);
|
||
|
|
|
||
|
|
IndexBinary *index_binary_factory (int d, const char *description);
|
||
|
|
|
||
|
|
|
||
|
|
}
|