# TrieMap: An implementation of generalized tries with sophisticated map type inference.

Versions | 0.0.1.0, 0.0.1.1, 0.0.1.2, 0.5.0, 0.5.1, 0.5.2, 0.5.3, 0.5.4, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.7.0, 0.7.1, 0.7.2, 1.0.0, 1.5.0, 2.0.0, 2.0.1, 2.0.2, 2.0.3, 3.0.0, 3.0.1, 4.0.0, 4.0.1, 4.1.0 |
---|---|

Dependencies | base (>=4 && <=5), containers [details] |

License | BSD-3-Clause |

Author | |

Maintainer | wasserman.louis@gmail.com |

Category | Data Structures |

Uploaded | by LouisWasserman at Sat Aug 15 22:55:31 UTC 2009 |

Distributions | NixOS:4.1.0 |

Downloads | 10306 total (83 in the last 30 days) |

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |

Generalized trie implementation that automatically infers map types. Keys must implement the class `TrieMap.Algebraic.Algebraic`

, which
declares that they are isomorphic to an *algebraic type*,
defined recursively as follows:

() and

`Int`

are algebraic types.If

, then`Ord`

a

is an algebraic type.`Ordered`

aIf

`a,b`

are algebraic types, then so are`(a, b)`

and`Either a b`

.If

`a`

is algebraic, so is`[a]`

.

This package exports almost the entire collection of methods available in Data.Map, and several new methods as well. In addition, each method will automatically infer the correct map type.

## Downloads

- TrieMap-0.0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)