A library providing useful extension traits and convenience methods for ordered collections in Rust. NOTE: This library is not currently in active development, and much of the functionality has been either obsoleted by or superseded by similar or identical functionality of the standard library, or soon will be. Please use that instead, at least until I find a better direction to take this.
A sorted collections library
Provides compile time guarantees for sorted sequences.
An experimental sorted data structure
Skiplist implementation in Rust for fast insertion and removal, including a normal skiplist, ordered skiplist, and skipmap.
Skip list is a kind of ordered map and can store any value inside. See skip list wikipedia page to learn more about this data structure.
Collection of sorting algorithms implemented in Rust
This crate provides traits to insert elements to a sorted collection and keep the order.
an in-memory database in Rust for rows queried using bit (flag) columns
Direct ports of the standard library's BTreeMap, BTreeSet and BinaryHeap collections, but that sort according to a specified total order rather than the `Ord` trait
A Lodash inspired utility library to manipulate array and object for Rust
Configuration language designed specifically for ml/ai/data systems
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.