Safe Haskell | Safe |
---|---|

Language | Haskell2010 |

Defines the `Tree`

data structure and operations on it to implement the random
selection algorithm described in Data.Random.Choose.

# Documentation

insert :: a -> Tree a -> Tree a Source #

Trivial insertion into the root of a tree, increasing its size by 1 and leaving its children unmodified.

Remove items from the tree until its size is at most `limit`

.
This may involve disambiguation if eviction takes place.