Copyright | Jeremy Groven |
---|---|
License | BSD3 |
Safe Haskell | None |
Language | Haskell2010 |
Functions for "updating" StableTrees, in the functional sense. This covers insertion, deletion, etc.
- insert :: (Ord k, StableKey k) => k -> v -> StableTree k v -> StableTree k v
- delete :: (Ord k, StableKey k) => k -> StableTree k v -> StableTree k v
Documentation
insert :: (Ord k, StableKey k) => k -> v -> StableTree k v -> StableTree k v Source
Insert a key/value into a StableTree
. If the key exists, its existing
value is overwritten.
delete :: (Ord k, StableKey k) => k -> StableTree k v -> StableTree k v Source
Remove a key from the StableTree
. If the key is not found, the tree is
returned unchanged.