rust-annie 0.1.2

No project description provided

Rust-annie

A lightning-fast, Rust-powered brute-force k-NN library for Python, with optional batch queries, thread-safety, and on-disk persistence.

---

📝 Table of Contents

1. Features
2. Installation
3. Quick Start
4. Examples
   • Single Query
   • Batch Query
   • Thread-Safe Usage
5. Benchmark Results
6. API Reference
7. Development & CI
8. Roadmap
9. Contributing
10. License

---

🚀 Features

• Ultra-fast brute-force k-NN search (Euclidean , Cosine, Manhattan)
• Batch queries over multiple vectors
• Thread-safe wrapper with GIL release for true concurrency
• Zero-copy NumPy integration (via PyO3 & rust-numpy)
• On-disk persistence with bincode + serde
• Multi-platform wheels (manylinux, musllinux, Windows, macOS)
• Automated CI with correctness & performance checks

---

⚙️ Installation

# Stable release from PyPI:
pip install rust-annie

# Or install from source (requires Rust toolchain + maturin):
git clone https://github.com/yourusername/rust_annie.git
cd rust_annie
pip install maturin
maturin develop --release

🎉 Quick Start

import numpy as np
from rust_annie import AnnIndex, Distance

# Create an 8-dim Euclidean index
idx = AnnIndex(8, Distance.EUCLIDEAN)

# Add 100 random vectors
data = np.random.rand(100, 8).astype(np.float32)
ids  = np.arange(100, dtype=np.int64)
idx.add(data, ids)

# Query one vector
labels, dists = idx.search(data[0], k=5)
print("Nearest IDs:", labels)
print("Distances :", dists)

---

📚 Examples

Single Query

from rust_annie import AnnIndex, Distance
import numpy as np

idx = AnnIndex(4, Distance.COSINE)
data = np.random.rand(50, 4).astype(np.float32)
ids  = np.arange(50, dtype=np.int64)
idx.add(data, ids)

labels, dists = idx.search(data[10], k=3)
print(labels, dists)

Batch Query

from rust_annie import AnnIndex, Distance
import numpy as np

idx = AnnIndex(16, Distance.EUCLIDEAN)
data = np.random.rand(1000, 16).astype(np.float32)
ids  = np.arange(1000, dtype=np.int64)
idx.add(data, ids)

# Query 32 vectors at once:
queries = data[:32]
labels_batch, dists_batch = idx.search_batch(queries, k=10)
print(labels_batch.shape)  # (32, 10)

Thread-Safe Usage

from rust_annie import ThreadSafeAnnIndex, Distance
import numpy as np
from concurrent.futures import ThreadPoolExecutor

idx = ThreadSafeAnnIndex(32, Distance.EUCLIDEAN)
data = np.random.rand(500, 32).astype(np.float32)
ids  = np.arange(500, dtype=np.int64)
idx.add(data, ids)

def task(q):
    return idx.search(q, k=5)

with ThreadPoolExecutor(max_workers=8) as executor:
    futures = [executor.submit(task, data[i]) for i in range(8)]
    for f in futures:
        print(f.result())

---

📈 Benchmark Results

Measured on a 6-core CPU:

Mode	Per-query Time
Pure-Python (NumPy - 𝑙2)	~2.8 ms
Rust AnnIndex single query	~0.7 ms
Rust AnnIndex batch (64 queries)	~0.23 ms

That’s a ~4× speedup vs. NumPy!

---

📖 API Reference

rust_annie.AnnIndex(dim: int, metric: Distance)

Create a new brute-force index.

Methods

• add(data: np.ndarray[N×D], ids: np.ndarray[N]) -> None
• search(query: np.ndarray[D], k: int) -> (ids: np.ndarray[k], dists: np.ndarray[k])
• search_batch(data: np.ndarray[N×D], k: int) -> (ids: np.ndarray[N×k], dists: np.ndarray[N×k])
• remove(ids: Sequence[int]) -> None
• save(path: str) -> None
• load(path: str) -> AnnIndex (static)

rust_annie.Distance

Enum: Distance.EUCLIDEAN, Distance.COSINE.Distance.MANHATTAN

rust_annie.ThreadSafeAnnIndex

Same API as AnnIndex, safe for concurrent use.

---

🔧 Development & CI

CI runs on GitHub Actions, building wheels on Linux, Windows, macOS, plus:

• cargo test
• pytest
• benchmark.py & batch_benchmark.py

# Locally run tests & benchmarks
cargo test
pytest
python benchmark.py
python batch_benchmark.py

---

🚧 Roadmap

• SIMD-accelerated dot products
• Rayon parallelism & GIL release
• Integrate HNSW/FAISS for sub-ms ANN at scale
• GPU‐backed search (CUDA/ROCm)
• Richer Python docs & type hints

---

🤝 Contributing

Contributions are welcome! Please:

1. Fork the repo
2. Create a feature branch
3. Add tests & docs
4. Submit a Pull Request

See CONTRIBUTING.md for details.

---

📜 License

This project is licensed under the MIT License. See LICENSE for details.