pred-trie-0.5.1.2: Predicative tries

Safe HaskellNone
LanguageHaskell2010

Data.Trie.Pred.Mutable

Contents

Synopsis

Tail

data PredStep s k r #

Constructors

Typeable a => PredStep 

Fields

data RawValue s k a #

Constructors

RawValue 

Fields

data HashTableTrie s k a #

Constructors

HashTableTrie 

Fields

new :: ST s (HashTableTrie s k a) #

insert :: (Eq k, Hashable k) => NonEmpty k -> a -> HashTableTrie s k a -> ST s (HashTableTrie s k a) #

lookup :: (Eq k, Hashable k, Typeable s, Typeable k) => PredSet s k -> NonEmpty k -> HashTableTrie s k a -> ST s (Maybe a) #

match :: (Eq k, Hashable k, Typeable s, Typeable k) => PredSet s k -> NonEmpty k -> HashTableTrie s k a -> ST s (Maybe (NonEmpty k, a, [k])) #

matches :: (Eq k, Hashable k, Typeable s, Typeable k) => PredSet s k -> NonEmpty k -> HashTableTrie s k a -> ST s [(NonEmpty k, a, [k])] #

Rooted

data RootedHashTableTrie s k a #

Constructors

RootedHashTableTrie 

Fields

lookupR :: (Eq k, Hashable k, Typeable s, Typeable k, Typeable a) => [k] -> RootedHashTableTrie s k a -> ST s (Maybe a) #

matchR :: (Eq k, Hashable k, Typeable s, Typeable k, Typeable a) => [k] -> RootedHashTableTrie s k a -> ST s (Maybe ([k], a, [k])) #

matchesR :: (Eq k, Hashable k, Typeable s, Typeable k, Typeable a) => [k] -> RootedHashTableTrie s k a -> ST s [([k], a, [k])] #