Open-Awesome
CategoriesAlternativesStacksSelf-HostedExplore
Open-Awesome

© 2026 Open-Awesome. Curated for the developer elite.

TermsPrivacyAboutGitHubRSS
  1. Home
  2. Rust
  3. tst

tst

MITRust

A Rust implementation of ternary search trees with map and set APIs similar to std::collections.

GitHubGitHub
27 stars5 forks0 contributors

Overview

Ternary search tree collection in rust

Quick Stats

Stars27
Forks5
Contributors0
Open Issues0
Last commit1 year ago
CreatedSince 2015

Tags

#spell-checking#trie#autocomplete#data-structures#rust-library#prefix-tree#no-std#associative-map

Built With

R
Rust

Included in

Rust56.6k
Auto-fetched 9 hours ago

Related Projects

itertoolsitertools

Extra iterator adaptors, iterator methods, free functions, and macros.

Stars3,166
Forks355
Last commit3 days ago
NumKongNumKong

SIMD-accelerated distances, dot products, matrix ops, geospatial & geometric kernels for 16 numeric types — from 6-bit floats to 64-bit complex — across x86, Arm, RISC-V, and WASM, with bindings for Python, Rust, C, C++, Swift, JS, and Go 📐

Stars1,882
Forks130
Last commit14 hours ago
rpdsrpds

Rust persistent data structures

Stars1,769
Forks74
Last commit1 month ago
nutypenutype

Rust newtype with guarantees 🇺🇦 🦀

Stars1,768
Forks36
Last commit7 days ago
Community-curated · Updated weekly · 100% open source

Found a gem we're missing?

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

Submit a projectStar on GitHub