TrieMap-1.5.0: 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) 

newtype Rev k Source

Constructors

Rev 

Fields

getRev :: k
 

Instances

Functor Rev 
ReprT Rev 
Eq k => Eq (Rev k) 
Ord k => Ord (Rev k) 
Repr a => Repr (Rev a) 
TrieKey k => TrieKey (Rev k) 

newtype Key k Source

Constructors

Key 

Fields

getKey :: k
 

Instances

(Repr k, Eq (Rep k)) => Eq (Key k) 
(Repr k, Ord (Rep k)) => Ord (Key k) 
Repr k => Repr (Key k) 
TKey k => TrieKey (Key k)