USearch

更快且小巧的向量检索与聚类引擎。这是一款高性能、轻量级的相似搜索和聚类引擎，单头文件设计，可嵌入主流数据库，支持向量和多模态数据（文本、图像、地理坐标）。它基于 HNSW 算法实现高效的近似最近邻搜索，兼容多种编程语言和精度类型，适用于推荐系统、向量数据库、智能检索、地理空间分析等场景。

c++#include#include using namespace unum::usearch;int main(int argc, char **argv) {metric_punned_t metric(3, metric_kind_t::l2sq_k, scalar_kind_t::f32_k);// If you plan to store more than 4 Billion entries - use `index_dense_big_t`.// Or directly instantiate the template variant you need - `index_dense_gt`.index_dense_t index = index_dense_t::make(metric);float vec[3] = {0.1, 0.3, 0.2};index.reserve(10); // Pre-allocate memory for 10 vectors index.add(42, &vec[0]); // Pass a key and a vector auto results = index.search(&vec[0], 5); // Pass a query and limit number of results for (std::size_t i = 0; i != results.size(); ++i)// You can access the following properties of every match:// results[i].element.key, results[i].element.vector, results[i].distance;std::printf("Found matching key: %zu", results[i].member.key);return 0;}