v0.2.0

What's Changed

• implement bulk construction from iterator by @nicolaskagami in #6
• implement a more efficient way to build and calculate leaves by @nicolaskagami in #8
• implement iter() and utility methods by @nicolaskagami in #12
• implement return of old value on insert by @nicolaskagami in #13
• make poptrie generic over Prefix instead of Key by @nicolaskagami in #10
• remove unsafe from iter_mut by @nicolaskagami in #15
• support external prefix types by @nicolaskagami in #16
• clean internal nodes on remove by @nicolaskagami in #17

Full Changelog: 0.1.1...0.2.0

v0.1.1

Poptrie v0.1.1

Improved documentation and added a simple lookup benchmark.

Full Changelog: 0.1.0...0.1.1

v0.1.0

Poptrie v0.1.0

First version of poptrie with leafvec optimization. It's already faster than alternatives like PrefixMap when running with native POPCOUNT and BEXTR instructions. Currently the Key trait is not sealed, allowing custom keys, but this may change in the future (a breaking change).

API

Function	Description
new()	Construct a new, empty poptrie
insert(key, key_length, value)	Insert a value associated with the given prefix
lookup(key)	Longest-prefix match lookup, returns Option<&V>
contains_key(key, key_length)	Returns true if the exact prefix is present
remove(key, key_length)	Remove a prefix and return its value

Full Changelog: https://github.com/nicolaskagami/poptrie/commits/0.1.0