@BurningWitness thanks for updating README
, much clearer now.
I whipped up a quick benchmark against the previous version of the package, but the results are somewhat off. Am I missing some important pragmas / patterns? The source code is at GitHub - Bodigrim/radix-tree at benchmarks. We take a listing of GHC sources (~5000 files), create a radix tree and then lookup every key in it. On my machine numbers are
Old:
603 μs ± 28 μs
New:
2.31 ms ± 221 μs
It feels expensive to lookup for Feed
, which presumably emits byte by byte, but I cannot find any other way to do it.