contain-rs/interval-heap

Stars
15
Rank 1,330,614 (Top 27 %)
Language
Rust
License
Apache License 2.0
Created about 9 years ago
Updated almost 7 years ago

contain-rs/interval-heap

contain-rs

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

A double-ended priority queue implemented with an interval heap.

linked-hash-map

A HashMap wrapper that holds key-value pairs in insertion order

bit-vec

lru-cache

A cache that holds a limited number of key-value pairs

vec-map

A simple map based on a vector for small integer keys

linked-list

An alternative implementation of std::collections::LinkedList

bit-set

trie

An ordered map and set based on a trie.

cons-list

An immutable singly-linked list, as seen in basically every functional language

linear-map

A map backed by a vector

enum-set

A structure for holding a set of enum variants

compare

Experimental comparators for collections to be generic over

bst

An ordered map and set based on a binary search tree.

ordered_iter

Ordered iterators

par-vec

raw-vec

A Raw utility for managing contiguous heap allocations

blist

A deque implemented as a hybrid linked-list-of-arrays

discuss

A center for discussion and planning of the contain-rs organization.

string-joiner

admin

Administrative tools/configurations for the contain-rs organisation.