Data.Search.Trie

data Trie k v

Instances

• (Eq k, Eq v) => Eq (Trie k v)
• (Show k, Show v) => Show (Trie k v)
• (Ord k) => Semigroup (Trie k v)
• (Ord k) => Monoid (Trie k v)
• (Ord k) => Functor (Trie k)

values :: forall v k. Trie k v -> List v

update :: forall v k. Ord k => (v -> v) -> List k -> Trie k v -> Trie k v

Update the entry at a given path.

toUnfoldable :: forall v k p f. Unfoldable f => Unfoldable p => Trie k v -> f (Tuple (p k) v)

subtrieWithPrefixes :: forall v k. Ord k => List k -> Trie k v -> Maybe (Trie k v)

A version of subtrie that does not cut the prefixes.

subtrie :: forall v k. Ord k => List k -> Trie k v -> Maybe (Trie k v)

Returns a subtrie containing all paths with given prefix. Path prefixes are not saved.

size :: forall v k. Trie k v -> Int

Number of elements in a trie.

queryValues :: forall v k. Ord k => List k -> Trie k v -> List v

query :: forall v k. Ord k => List k -> Trie k v -> List (Tuple (List k) v)

lookup :: forall v k. Ord k => List k -> Trie k v -> Maybe v

isEmpty :: forall v k. Trie k v -> Boolean

insert :: forall v k. Ord k => List k -> v -> Trie k v -> Trie k v

Insert an entry into a trie.

fromList :: forall v k. Ord k => List (Tuple (List k) v) -> Trie k v

fromFoldable :: forall v k p f. Ord k => Foldable f => Foldable p => f (Tuple (p k) v) -> Trie k v

entriesUnordered :: forall v k. Trie k v -> List (Tuple (List k) v)

A version of entries defined using Data.Map.toUnfoldableUnordered.

entries :: forall v k. Trie k v -> List (Tuple (List k) v)

Resulting List will be sorted.

deleteByPrefix :: forall v k. Ord k => List k -> Trie k v -> Trie k v

Delete all entries by a given path prefix.

delete :: forall v k. Ord k => List k -> Trie k v -> Trie k v

Delete the entry at a given path.

alter :: forall v k. Ord k => List k -> (Maybe v -> Maybe v) -> Trie k v -> Trie k v

Delete, insert or update the entry by a given path. It is recommended to use specialized functions for each case.