Data.Radix1Tree.Word8.Strict.Zipper

Spine-strict radix tree location manipulation.

Allows lookup and successive insertion without retaining the entirety of the key in memory.

Documentation

data Context1 a

A location inside the radix tree.

descend :: Feed1 -> Either (Radix1Tree a) (Context1 a) -> Maybe (Context1 a)

\(\mathcal{O}(\min(x,k))\). Move down the tree by the extent of the given key. Returns Nothing if the resulting position is outside of the tree.

Since: 1.1

focus :: Context1 a -> Maybe (a, a -> Radix1Tree a)

\(\mathcal{O}(1)\). Retrieve the value at the current position, if any exists, together with the insertion function for the current position.

Since: 1.1