homepage: ''
changelog-type: markdown
hash: ff23f3092a53f1275180f32d2475d4009a33939eb04a2869a1308e5e80e8651b
test-bench-deps:
  mwc-random: -any
  base: -any
  hspec: -any
  criterion: -any
  trie-simple: -any
  containers: -any
  deepseq: -any
  QuickCheck: -any
  vector: -any
maintainer: viercc@gmail.com
synopsis: Simple Map-based Trie
changelog: ! '# 0.4.1.1


  - Initial release.


'
basic-deps:
  base: ! '>=4.9 && <4.13'
  containers: ! '>=0.5.7.1 && <0.6'
  mtl: ! '>=2.2.1 && <2.3'
  deepseq: ! '>=1.4.2.0 && <1.5'
all-versions:
- '0.4.1.1'
author: Koji Miyazato
latest: '0.4.1.1'
description-type: markdown
description: ! "# trie-simple\n\nTrie data structure `TMap` to hold mapping from list
  of characters to\nsomething, i.e. isomorphic to `Map [c] v`.\nThis package also
  contains `TSet`, which is isomorphic to `Set` of lists of\ncharacters.\n\nThis package
  implements these structures using `Map` from containers\npackage, and require the
  character type to be only `Ord`.\n\nAdvantages of using this package over `Map`
  or `Set` are:\n\n  * 2x Faster `lookup` (`member`) operation\n  * Retrieving subset
  of map or set with given prefix\n  * `append`, `prefixes`, and `suffixes` support\n
  \ * Can be more memory-efficient (but not always; needs\n    benchmark anyway).\n\n##
  Benchmarks\n\nBenchmarks compared against plain `Map` and `Set`.\n\n![benchmark
  chart for TMap](https://raw.githubusercontent.com/viercc/trie-simple/master/doc/benchTMap.png)\n\n![benchmark
  chart for TSet](https://raw.githubusercontent.com/viercc/trie-simple/master/doc/benchTSet.png)\n\n##
  About License\n\n[LICENSE](LICENSE) tells the licence of this project, EXCEPT\none
  file for benchmark input data. See [ABOUT](ABOUT) for that\nfile.\n\nIf you install
  `trie-simple` from Hackage, that input data is not\nincluded in the distributed
  files.\n"
license-name: BSD3

Update from Hackage at 2018-12-01T23:49:27Z
Update from Hackage at 2018-12-01T23:49:27Z
