mirror of
https://github.com/facebookresearch/faiss.git
synced 2025-06-03 21:54:02 +08:00
56a383f253
Summary: Pull Request resolved: https://github.com/facebookresearch/faiss/pull/3967 This diff just finds and replaces duplicate license headers. See the errors for "duplicate-license-header" in D64429711 under "linter-coverage-verification" signal. Reviewed By: asadoughi Differential Revision: D64484123 fbshipit-source-id: 906e8baa3a11a3bbee174a03dcc27681f9fd78c2
45 lines
1.1 KiB
C++
45 lines
1.1 KiB
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++ -*-
|
|
|
|
#include "index_factory_c.h"
|
|
#include <faiss/index_factory.h>
|
|
#include <cstring>
|
|
#include "macros_impl.h"
|
|
|
|
using faiss::Index;
|
|
|
|
/** Build an index with the sequence of processing steps described in
|
|
* the string.
|
|
*/
|
|
int faiss_index_factory(
|
|
FaissIndex** p_index,
|
|
int d,
|
|
const char* description,
|
|
FaissMetricType metric) {
|
|
try {
|
|
*p_index = reinterpret_cast<FaissIndex*>(faiss::index_factory(
|
|
d, description, static_cast<faiss::MetricType>(metric)));
|
|
}
|
|
CATCH_AND_HANDLE
|
|
}
|
|
|
|
/** Build an index with the sequence of processing steps described in
|
|
* the string.
|
|
*/
|
|
int faiss_index_binary_factory(
|
|
FaissIndexBinary** p_index,
|
|
int d,
|
|
const char* description) {
|
|
try {
|
|
*p_index = reinterpret_cast<FaissIndexBinary*>(
|
|
faiss::index_binary_factory(d, description));
|
|
}
|
|
CATCH_AND_HANDLE
|
|
}
|