Module

# Data.Search.Trie.Internal

- Package
- purescript-search-trie
- Repository
- klntsky/purescript-search-trie

### #deleteByPrefix Source

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

Delete all entries by a given path prefix.

### #descend Source

`descend :: forall k v. Ord k => List k -> Zipper k v -> { mbValue :: Maybe v, children :: Map k (Trie k v), ctxs :: List (Ctx k v) }`

Follows a given path, constructing new branches as necessary.
Returns the contents of the last branch with context from which the trie
can be restored using `fromZipper`

.

### #entriesUnordered Source

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

A version of `entries`

defined using Data.Map.toUnfoldableUnordered.

### #toUnfoldable Source

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