#non-empty #collection #hash-map #hash-set #rest #element #index-map

non-empty-collections

Non-empty hash-map and hash-set implementations

8 releases

Uses old Rust 2015

0.1.9 Sep 17, 2019
0.1.8 Aug 18, 2018
0.1.7 Jul 24, 2018

#2227 in Data structures

45 downloads per month

MIT/Apache

45KB
1K SLoC

non-empty-collections

Non-empty hash map and hash set implementations based on indexmap::IndexMap and indexmap::IndexSet respectively, which are guaranteed to be non-empty by the type system of Rust.

pipeline status crates.io docs.rs

[Release docs]

[Master docs]

Currently not all the methods of IndexMap or IndexSet are ported to NonEmptyIndexMap and NonEmptyIndexSet, so if you are missing something, PRs are welcome! :)

Right now both implementations are too naïve: non-emptiness is achieved by declaring map and set types as a pair of an element and the rest of the collection. While the idea itself is not bad, it adds an additional overhead on basically every operation since we have to execute everything twice: on the first element and then on the rest.

License: MIT/Apache-2.0

Dependencies

~1MB
~20K SLoC