Safe Haskell	None
Language	Haskell2010

Agda.Utils.BinTree1

Description

Binary trees, used for O(1) append.

Documentation

data BinTree1 a Source #

Instances

Instances details

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

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

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

toList1 :: BinTree1 a -> List1 a Source #