Description
A Haskell library providing a simple lazy infinite trie indexed by integers. It can represent mappings from integer-like keys in a structure that is computed only as needed.
Developers use it in memoization, algorithms, and functional data structures. Lazy infinite structures are useful, but code should avoid retaining more of the trie than necessary.