This project has moved and is read-only. For the latest updates, please go here.


Rating:        Based on 5 ratings
Reviewed:  3 reviews
Downloads: 1491
Change Set: 3c9caf2205a3
Released: Aug 21, 2013
Updated: Aug 21, 2013 by gmamaladze
Dev status: Stable Help Icon

Recommended Download

Application binaries
application, 21K, uploaded Aug 21, 2013 - 1491 downloads

Release Notes

  • Trie – the simple trie, allows only prefix search
  • SuffixTrie - allows also infix search
  • PatriciaTrie – compressed trie, more compact, a bit more efficient during look-up, but a quite slower durig build-up
  • SuffixPatriciaTrie – the same as PatriciaTrie, also enabling infix search
  • ParallelTrie – very primitively implemented parallel data structure which allows adding data and retriving results from different threads simultaneusly

Reviews for this release

Wow, implemented this on my website to improve the search (since we cache everything in memory) and we got a gigantic leap in performance. Highly recommended, very easy to implement (took me like 15 minutes to have something functional with it).
by alexmontreal on May 1, 2014 at 7:35 PM
This really rocked my socks off. Good job. Simple API's for these data structures that work exactly as advertised.
by ronnieoverby on Feb 5, 2015 at 6:38 PM
I'm extremely pleased with the ease of use and high performance of this implementation. I replaced a LINQ query with the Trie and enjoyed at least an order of magnitude improvement in performance, even when using a parallel LINQ query.
by GregBlock on Sep 17, 2014 at 8:37 PM