3 ms·
It doesn't beat a hashtable, but has faster sequential (=ordered) reads, and can do range iterators. The examples to not reflect that. All random accesses are
by rurban 8mo ago
It doesn't beat a hashtable, but has faster sequential (=ordered) reads, and can do range iterators. The examples to not reflect that.
All random accesses are slower.
- deleted 8mo ago[deleted]