Data.Trie.Pred.Mutable

Tail

data PredStep s k r

Constructors

forall a . Typeable a => PredStep

Fields

predPred :: !(PredKey s k a)

predData :: !(Maybe (a -> r))

predSub :: !(HashTableTrie s k (a -> r))

data RawValue s k a

Constructors

RawValue

Fields

rawValue :: !(Maybe a)

rawChildren :: !(HashTableTrie s k a)

data HashTableTrie s k a

Constructors

HashTableTrie

Fields

rawValues :: !(HashTable s k (RawValue s k a))

predPreds :: [PredStep s k a]

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

rootedBase :: !(Maybe a)

rootedSub :: !(HashTableTrie s k a)

rootedPredSet :: !(PredSet s k)

newR :: ST s (RootedHashTableTrie s k a)

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])]