Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Tree s a v
- singleton :: PrimMonad m => a -> v -> m (Tree (PrimState m) a v)
- cons :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
- snoc :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
- append :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
- split :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Maybe (Tree (PrimState m) a v), Maybe (Tree (PrimState m) a v))
- connected :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m Bool
- root :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
- aggregate :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m v
- toList :: PrimMonad m => Tree (PrimState m) a v -> m [a]
- readRoot :: PrimMonad m => Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
- freeze :: PrimMonad m => Tree (PrimState m) a v -> m (Tree a)
- print :: Show a => Tree (PrimState IO) a v -> IO ()
- assertInvariants :: (PrimMonad m, Monoid v, Eq v, Show v) => Tree (PrimState m) a v -> m ()
Documentation
Instances
cons :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source #
lv
must be a singleton tree
snoc :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source #
rv
must be a singleton tree
append :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source #
Appends two trees. Returns the root of the tree.
split :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Maybe (Tree (PrimState m) a v), Maybe (Tree (PrimState m) a v)) Source #
connected :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m Bool Source #