Safe Haskell	None
Language	Haskell2010

Agda.Utils.BinTree

Description

Binary trees, used for O(1) append.

Documentation

data BinTree a Source #

Instances

Instances details

Functor BinTree Source #
Instance details Defined in Agda.Utils.BinTree Methods fmap :: (a -> b) -> BinTree a -> BinTree b # (<$) :: a -> BinTree b -> BinTree a #
Foldable BinTree Source #
Instance details Defined in Agda.Utils.BinTree Methods fold :: Monoid m => BinTree m -> m # foldMap :: Monoid m => (a -> m) -> BinTree a -> m # foldMap' :: Monoid m => (a -> m) -> BinTree a -> m # foldr :: (a -> b -> b) -> b -> BinTree a -> b # foldr' :: (a -> b -> b) -> b -> BinTree a -> b # foldl :: (b -> a -> b) -> b -> BinTree a -> b # foldl' :: (b -> a -> b) -> b -> BinTree a -> b # foldr1 :: (a -> a -> a) -> BinTree a -> a # foldl1 :: (a -> a -> a) -> BinTree a -> a # toList :: BinTree a -> [a] # null :: BinTree a -> Bool # length :: BinTree a -> Int # elem :: Eq a => a -> BinTree a -> Bool # maximum :: Ord a => BinTree a -> a # minimum :: Ord a => BinTree a -> a # sum :: Num a => BinTree a -> a # product :: Num a => BinTree a -> a #
Traversable BinTree Source #
Instance details Defined in Agda.Utils.BinTree Methods traverse :: Applicative f => (a -> f b) -> BinTree a -> f (BinTree b) # sequenceA :: Applicative f => BinTree (f a) -> f (BinTree a) # mapM :: Monad m => (a -> m b) -> BinTree a -> m (BinTree b) # sequence :: Monad m => BinTree (m a) -> m (BinTree a) #
Singleton a (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods singleton :: a -> BinTree a Source #
Null (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods empty :: BinTree a Source # null :: BinTree a -> Bool Source #
Monoid (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods mempty :: BinTree a # mappend :: BinTree a -> BinTree a -> BinTree a # mconcat :: [BinTree a] -> BinTree a #
Semigroup (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods (<>) :: BinTree a -> BinTree a -> BinTree a # sconcat :: NonEmpty (BinTree a) -> BinTree a # stimes :: Integral b => b -> BinTree a -> BinTree a #
Eq a => Eq (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods (==) :: BinTree a -> BinTree a -> Bool # (/=) :: BinTree a -> BinTree a -> Bool #
Ord a => Ord (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods compare :: BinTree a -> BinTree a -> Ordering # (<) :: BinTree a -> BinTree a -> Bool # (<=) :: BinTree a -> BinTree a -> Bool # (>) :: BinTree a -> BinTree a -> Bool # (>=) :: BinTree a -> BinTree a -> Bool # max :: BinTree a -> BinTree a -> BinTree a # min :: BinTree a -> BinTree a -> BinTree a #
Show a => Show (BinTree a) Source #
Instance details Defined in Agda.Utils.BinTree Methods showsPrec :: Int -> BinTree a -> ShowS # show :: BinTree a -> String # showList :: [BinTree a] -> ShowS #

prependToList :: BinTree a -> [a] -> [a] Source #

toList :: BinTree a -> [a] Source #