Search results

Jump to: navigation, search
  • * [https://hackage.haskell.org/package/bytestring-trie bytestring-trie] is an efficient and fast way of storing and looking up strings as keys, as
    15 KB (2,213 words) - 11:19, 27 December 2016
  • {--- The Trie data structure ---} data Trie = Node [String] (Array Int Trie) | Empty
    12 KB (1,746 words) - 05:55, 21 February 2010
  • ==A trie structure== module Trie where
    4 KB (656 words) - 11:03, 13 January 2007
  • * Can we write a legal Map-based version of Ketil's Trie somehow? | Generalised Trie #1 || 23.8s || 93M || +RTS -K32m || removed
    56 KB (8,172 words) - 22:25, 18 February 2010
  • ...p://hackage.haskell.org/cgi-bin/hackage-scripts/package/MemoTrie MemoTrie: Trie-based memo functions]
    12 KB (1,702 words) - 16:05, 28 April 2014
  • ...a generic finite map a while ago and determined that the generic memoized trie was better in almost all cases; it was simpler semantically and didn't have
    14 KB (2,191 words) - 17:03, 18 February 2012
  • ...ature of the List monad and how one can deal with strings swiftly by using trie data structures.
    8 KB (1,102 words) - 12:57, 17 December 2012
  • ...first release of my new HashMap container, based on the hash array mapped trie data structure.
    4 KB (594 words) - 12:51, 17 December 2012
  • ...ta type that uses a recently developed data structure, a hash array mapped trie, to achieve better real world performance. I will describe the design and i
    876 bytes (134 words) - 13:45, 17 December 2012