README.md

kv-trie

An IN MEMORY trie.

None if it is meant to be exceptionally quick or efficient but i will try to maintain a sense of the aesthetic.

The Remove method prunes as it goes, making it more memory efficient but slower.

i have left the old benchmarks as antiquity.

V3 Benches in release mode 19/11/22 {
    Get elapsed: 1.23µs
    Insert elapsed: 4.29µs
    Second insert to same key() elapsed: 609.00000ns
    Insert 10000 items average elapsed: 8.74µs
    Remove elapsed: 3.99µs
    Remove 10000 items average elapsed: 6.77µs
    ~ 1243252 branches, 10000 leafs. After 10000 inserts.
}


-------------------------------------------------------------------------------------------------------------------

V2 benchmarks 30/10/22  {
    Speed Benchmarks:
        Insert elapsed: 111.36µs
        Second insert to same key() elapsed: 43.90µs
        Get elapsed: 41.42µs
        Insert 10000 items average elapsed: 67.53µs

    Storage Benchmarks:
        122_682_717 branches,  1_000_000 leafs. After 1000000 inserts
        2968.405 Mb used space.
        0 wasted as option arrays were removed :3.
        performance decreases for insert increases for get.
}

 V1 benchmarks 30/10/22 { 
    Speed Benchmarks {
        Insert elapsed: 104.05µs
        Second insert to same key() elapsed: 36.46µs
        Get elapsed: 65.64µs
        Insert 10000 items average elapsed: 52.77µs
    }
    
    Storage Benchmarks {
        123_683_540 is_some,  1_855_253_116 is_none. After 1000000 inserts
        2968.405 Mb used space
        44_526.08 Mb wasted space
        93.75% wasted 
    }
}