TrieMap-1.0.0: Automatic type inference of generalized tries.

Data.TrieMap.Class

Documentation

newtype TMap k a Source

Constructors

TMap
Fields getTMap :: TrieMap (Rep k) (Elem a)

Instances

TKey k => Functor (TMap k)
TKey k => Foldable (TMap k)
TKey k => Traversable (TMap k)
(Eq k, TKey k, Eq a) => Eq (TMap k a)
(Ord k, TKey k, Ord a) => Ord (TMap k a)
(Show k, Show a, TKey k) => Show (TMap k a)
TKey k => Monoid (TMap k a)
(TKey k, Repr a) => Repr (TMap k a)

newtype TSet a Source

Constructors

TSet (TMap a ())

Instances

TKey a => Eq (TSet a)
(TKey a, Ord a) => Ord (TSet a)
(TKey a, Show a) => Show (TSet a)
TKey a => Monoid (TSet a)

class (Repr k, TrieKey (Rep k)) => TKey k Source

Instances

(Repr k, TrieKey (Rep k)) => TKey k

class Ord k => TrieKey k Source

Associated Types

data TrieMap k :: * -> *Source

Instances

TrieKey Word32
TrieKey ()
TrieKey k => TrieKey [k]
Ord k => TrieKey (Ordered k)
TrieKey k => TrieKey (Rev k)
TKey k => TrieKey (Key k)
(TrieKey k1, TrieKey k2) => TrieKey (Either k1 k2)
(TrieKey k1, TrieKey k2) => TrieKey (k1, k2)