Baike.dev
All toolsOnline toolsAI codingTrendingOpen sourceNewsSubmit
Log in
< Back to tools
I

instant-distance

> 编程语言
Open source

Fast approximate nearest neighbor searching in Rust, based on HNSW index

347 stars0 likes2 views
WebsiteGitHub

About

Fast approximate nearest neighbor searching in Rust, based on HNSW index

Instant Distance: fast HNSW indexing

Instance Distance is a fast pure-Rust implementation of the Hierarchical Navigable Small Worlds paper by Malkov and Yashunin for finding approximate nearest neighbors. This implementation powers the Instant Domain Search backend services used for word vector indexing.

What it does

Instant Distance is an implementation of a fast approximate nearest neighbor search algorithm. The algorithm is used to find the closest point(s) to a given point in a set. As one example, it can be used to make simple translations.

Using the library

Rust

toml
[dependencies]
instant-distance = "0.5.0"

Example

…

Testing

Rust:

cargo t -p instant-distance --all-features

Python:

make test-python

Issues· 0 open

View all issuesOpen on GitHub

No open issues yet, or sync has not completed.

> Tags

Rustapproximate-nearest-neighbor-searchhnswrust

No comments yet. Be the first to share.

> Details

PublishedAug 1, 2026
UpdatedSep 18, 2026
Category编程语言
PricingOpen source

> Related tools

T
TypeScript
JavaScript 的超集,为前端与全栈提供静态类型
P
Python
通用编程语言,广泛用于 Web、数据与 AI
G
Go
Google 推出的简洁高效系统语言