TrieMap-2.0.3: Automatic type inference of generalized tries with Template Haskell.

Data.TrieMap.Modifiers

Documentation

newtype Ordered a Source

Constructors

Ord
Fields unOrd :: a

Instances

Functor Ordered
Eq a => Eq (Ordered a)
Ord a => Ord (Ordered a)
Ord k => TrieKey (Ordered k)	`TrieMap (Ordered k) a` is based on Data.Map.

newtype Rev k Source

Constructors

Rev
Fields getRev :: k

Instances

Functor Rev
Eq k => Eq (Rev k)
Ord k => Ord (Rev k)
TrieKey k => TrieKey (Rev k)	`TrieMap (Rev k) a` is a wrapper around a `TrieMap k a` that reverses the order of the operations.

newtype Key k Source

Constructors

Key
Fields getKey :: k

Instances

Repr k => Repr (Key k)
TKey k => TrieKey (Key k)	`TrieMap (Key k) a` is a wrapper around a `TrieMap (Rep k) a`.