Safe Haskell	None
Language	Haskell2010

Data.Graph.Dynamic.Internal.Avl

Contents

Debugging only

Synopsis

data Tree s a v
singleton :: PrimMonad 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)
concat :: (PrimMonad m, Monoid v) => NonEmpty (Tree (PrimState m) a v) -> m (Tree (PrimState m) a v)
join :: (PrimMonad m, Monoid v) => Maybe (Tree (PrimState m) a v) -> Tree (PrimState m) a v -> Maybe (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))
root :: PrimMonad m => Tree (PrimState m) a v -> m (Tree (PrimState m) a v)
connected :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m Bool
label :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m a
aggregate :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m v
toList :: PrimMonad m => Tree (PrimState m) a v -> m [a]
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 ()
assertSingleton :: PrimMonad m => Tree (PrimState m) a v -> m ()
assertRoot :: PrimMonad m => Tree (PrimState m) a v -> m ()

Documentation

data Tree s a v Source #

Instances

TestTree Tree Source #
Instance details Defined in Data.Graph.Dynamic.Internal.Avl Methods print :: Show a => Tree (PrimState IO) a v -> IO () Source # assertInvariants :: (PrimMonad m, Monoid v, Eq v, Show v) => Tree (PrimState m) a v -> m () Source # assertSingleton :: (PrimMonad m, Monoid v, Eq v, Show v) => Tree (PrimState m) a v -> m () Source # assertRoot :: (PrimMonad m, Monoid v, Eq v, Show v) => Tree (PrimState m) a v -> m () Source #
Tree Tree Source #
Instance details Defined in Data.Graph.Dynamic.Internal.Avl Associated Types type TreeGen Tree :: Type -> Type Source # Methods newTreeGen :: PrimMonad m => Proxy Tree -> m (TreeGen Tree (PrimState m)) Source # singleton :: (PrimMonad m, Monoid v) => TreeGen Tree (PrimState m) -> a -> v -> m (Tree (PrimState m) a v) Source # append :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source # cons :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source # snoc :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source # 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 # root :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source # readRoot :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source # label :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m a Source # aggregate :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m v Source # toList :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m [a] Source #
Eq (Tree s a v) Source #
Instance details Defined in Data.Graph.Dynamic.Internal.Avl Methods (==) :: Tree s a v -> Tree s a v -> Bool # (/=) :: Tree s a v -> Tree s a v -> Bool #
type TreeGen Tree Source #
Instance details Defined in Data.Graph.Dynamic.Internal.Avl type TreeGen Tree

singleton :: PrimMonad m => a -> v -> m (Tree (PrimState m) a v) Source #

append :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source #

concat :: (PrimMonad m, Monoid v) => NonEmpty (Tree (PrimState m) a v) -> m (Tree (PrimState m) a v) Source #

join :: (PrimMonad m, Monoid v) => Maybe (Tree (PrimState m) a v) -> Tree (PrimState m) a v -> Maybe (Tree (PrimState m) a v) -> m (Tree (PrimState m) a v) Source #

split :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m (Maybe (Tree (PrimState m) a v), Maybe (Tree (PrimState m) a v)) Source #

root :: PrimMonad m => Tree (PrimState m) a v -> m (Tree (PrimState m) a v) Source #

connected :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> Tree (PrimState m) a v -> m Bool Source #

label :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m a Source #

aggregate :: (PrimMonad m, Monoid v) => Tree (PrimState m) a v -> m v Source #

toList :: PrimMonad m => Tree (PrimState m) a v -> m [a] Source #

For debugging/testing.

Debugging only

freeze :: PrimMonad m => Tree (PrimState m) a v -> m (Tree a) Source #

For debugging/testing.

print :: Show a => Tree (PrimState IO) a v -> IO () Source #

assertInvariants :: (PrimMonad m, Monoid v, Eq v, Show v) => Tree (PrimState m) a v -> m () Source #

assertSingleton :: PrimMonad m => Tree (PrimState m) a v -> m () Source #

assertRoot :: PrimMonad m => Tree (PrimState m) a v -> m () Source #