tst
Ternary search tree
A Rust implementation of a ternary search tree data structure used for efficient string matching and lookup.
Ternary search tree collection in rust
23 stars
3 watching
5 forks
Language: Rust
last commit: about 2 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
| A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
| A library implementing a balanced binary search tree data structure with customizable key extraction and comparison functions. | 23 |
| A compact data structure for efficiently storing and retrieving strings | 47 |
| An experiment in using TypeScript with Redux and Angular to implement a simple application with search functionality | 39 |
| A utility to search for phrases in a tree data structure | 16 |
| Converts a dynamically typed Parse Tree to a strongly typed Abstract Syntax Tree and provides automatic conversion via derive. | 83 |
| An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
| A Go library implementing a fast and efficient prefix tree data structure for storing and retrieving key-value pairs in various formats. | 41 |
| A tool that uses tree-sitter grammars to search for structure in code files. | 301 |
| A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
| A web assembly-based vector similarity search engine that uses k-d tree for fast search and indexing. | 892 |
| An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
| Tools to search and refactor Ruby code directly in its abstract syntax tree | 256 |
| A Rust client for ingesting data into a remote time series database | 13 |
| Provides full text search support to models in Laravel applications using the TNTSearch service | 1,103 |