Data.WordTrie

Documentation

data Trie a

A Trie indexed by Word64s.

Constructors

Fork

Fields

• trieVal :: Maybe a
• trieMap :: Map Word64 (Trie a)

Instances

Functor Trie

Defined in Data.WordTrie

Methods

fmap :: (a -> b) -> Trie a -> Trie b

(<$) :: a -> Trie b -> Trie a

Eq a => Eq (Trie a)

Defined in Data.WordTrie

Methods

(==) :: Trie a -> Trie a -> Bool

(/=) :: Trie a -> Trie a -> Bool

Show a => Show (Trie a)

Defined in Data.WordTrie

Methods

showsPrec :: Int -> Trie a -> ShowS

show :: Trie a -> String

showList :: [Trie a] -> ShowS

empty :: Trie a

The empty trie

insertWith :: a -> (a -> a) -> [Word64] -> Trie a -> Trie a

Inserts or modifies an element to a trie

insert :: a -> [Word64] -> Trie a -> Trie a

Inserts a value overwriting any previous value associated with this key

lookup :: [Word64] -> Trie a -> Maybe a

Performs a lookup on a trie

zipWith :: (a -> b -> c) -> Trie a -> Trie b -> Trie c

Computes the intersection of two tries

mapAccum :: (a -> b -> (a, c)) -> a -> Trie b -> (a, Trie c)

Maps over the trie carrying an accumulating parameter around

toList :: Trie a -> [([Word64], a)]

Flattens a trie into a list