insert() needs a bit of spit and polish

mattyv / FlashRadixTree

Associative container with the ability to search more efficiently if you know the key will be there. On par with std::map and well against std::unordered_map for most keys sizes, and especially where you have large keys with common prefixes.

GNU General Public License v3.0

0 stars 0 forks source link

insert() needs a bit of spit and polish #30

Open mattyv opened 6 months ago

mattyv commented 6 months ago

split function up into other functions refactor to reduce the number of variables flying around.