search

kawu / dawg

Directed acyclic word graphs
BSD 2-Clause "Simplified" License
11 stars 1 forks source link

Add benchmarks #32

Open kawu opened 10 years ago

kawu commented 10 years ago

Or copy from the dawg-new library.

unhammer commented 8 years ago

There's a packed-dawg package with benchmarks at https://github.com/AndrasKovacs/dawg/blob/master/Benchmarks.hs – a comparison here would be interesting (packed-dawg only works on 0-255 Char values though).

There's also https://hackage.haskell.org/package/bytestring-trie which is extremely compact and fast, but of course requires keys to be bytestrings.