Data.Magma

Documentation

class Magma a where

Methods

(<>) :: a -> a -> a

Instances

Magma All

Defined in Data.Magma

Methods

(<>) :: All -> All -> All

Magma Any

Defined in Data.Magma

Methods

(<>) :: Any -> Any -> Any

Magma ()

Defined in Data.Magma

Methods

(<>) :: () -> () -> ()

Magma (First a)

Defined in Data.Magma

Methods

(<>) :: First a -> First a -> First a

Magma (Last a)

Defined in Data.Magma

Methods

(<>) :: Last a -> Last a -> Last a

Ord a => Magma (Max a)

Defined in Data.Magma

Methods

(<>) :: Max a -> Max a -> Max a

Ord a => Magma (Min a)

Defined in Data.Magma

Methods

(<>) :: Min a -> Min a -> Min a

Monoid m => Magma (WrappedMonoid m)

Defined in Data.Magma

Methods

(<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m

Magma a => Magma (Dual a)

Defined in Data.Magma

Methods

(<>) :: Dual a -> Dual a -> Dual a

Magma (Endo a)

Defined in Data.Magma

Methods

(<>) :: Endo a -> Endo a -> Endo a

Num a => Magma (Product a)

Defined in Data.Magma

Methods

(<>) :: Product a -> Product a -> Product a

Num a => Magma (Sum a)

Defined in Data.Magma

Methods

(<>) :: Sum a -> Sum a -> Sum a

Magma (BinaryTree a)

Defined in Data.Magma

Methods

(<>) :: BinaryTree a -> BinaryTree a -> BinaryTree a

(Magma a, Magma b) => Magma (a, b)

Defined in Data.Magma

Methods

(<>) :: (a, b) -> (a, b) -> (a, b)

data BinaryTree a

Constructors

Leaf a

Node (BinaryTree a) (BinaryTree a)

Instances

Foldable BinaryTree

Defined in Data.Magma

Methods

fold :: Monoid m => BinaryTree m -> m

foldMap :: Monoid m => (a -> m) -> BinaryTree a -> m

foldMap' :: Monoid m => (a -> m) -> BinaryTree a -> m

foldr :: (a -> b -> b) -> b -> BinaryTree a -> b

foldr' :: (a -> b -> b) -> b -> BinaryTree a -> b

foldl :: (b -> a -> b) -> b -> BinaryTree a -> b

foldl' :: (b -> a -> b) -> b -> BinaryTree a -> b

foldr1 :: (a -> a -> a) -> BinaryTree a -> a

foldl1 :: (a -> a -> a) -> BinaryTree a -> a

toList :: BinaryTree a -> [a]

null :: BinaryTree a -> Bool

length :: BinaryTree a -> Int

elem :: Eq a => a -> BinaryTree a -> Bool

maximum :: Ord a => BinaryTree a -> a

minimum :: Ord a => BinaryTree a -> a

sum :: Num a => BinaryTree a -> a

product :: Num a => BinaryTree a -> a

Traversable BinaryTree

Defined in Data.Magma

Methods

traverse :: Applicative f => (a -> f b) -> BinaryTree a -> f (BinaryTree b)

sequenceA :: Applicative f => BinaryTree (f a) -> f (BinaryTree a)

mapM :: Monad m => (a -> m b) -> BinaryTree a -> m (BinaryTree b)

sequence :: Monad m => BinaryTree (m a) -> m (BinaryTree a)

Applicative BinaryTree

Defined in Data.Magma

Methods

pure :: a -> BinaryTree a

(<*>) :: BinaryTree (a -> b) -> BinaryTree a -> BinaryTree b

liftA2 :: (a -> b -> c) -> BinaryTree a -> BinaryTree b -> BinaryTree c

(*>) :: BinaryTree a -> BinaryTree b -> BinaryTree b

(<*) :: BinaryTree a -> BinaryTree b -> BinaryTree a

Functor BinaryTree

Defined in Data.Magma

Methods

fmap :: (a -> b) -> BinaryTree a -> BinaryTree b

(<$) :: a -> BinaryTree b -> BinaryTree a

Monad BinaryTree

Defined in Data.Magma

Methods

(>>=) :: BinaryTree a -> (a -> BinaryTree b) -> BinaryTree b

(>>) :: BinaryTree a -> BinaryTree b -> BinaryTree b

return :: a -> BinaryTree a

Read a => Read (BinaryTree a)

Defined in Data.Magma

Methods

readsPrec :: Int -> ReadS (BinaryTree a)

readList :: ReadS [BinaryTree a]

readPrec :: ReadPrec (BinaryTree a)

readListPrec :: ReadPrec [BinaryTree a]

Show a => Show (BinaryTree a)

Defined in Data.Magma

Methods

showsPrec :: Int -> BinaryTree a -> ShowS

show :: BinaryTree a -> String

showList :: [BinaryTree a] -> ShowS

NFData a => NFData (BinaryTree a)

Defined in Data.Magma

Methods

rnf :: BinaryTree a -> ()

Eq a => Eq (BinaryTree a)

Defined in Data.Magma

Methods

(==) :: BinaryTree a -> BinaryTree a -> Bool

(/=) :: BinaryTree a -> BinaryTree a -> Bool

Ord a => Ord (BinaryTree a)

Defined in Data.Magma

Methods

compare :: BinaryTree a -> BinaryTree a -> Ordering

(<) :: BinaryTree a -> BinaryTree a -> Bool

(<=) :: BinaryTree a -> BinaryTree a -> Bool

(>) :: BinaryTree a -> BinaryTree a -> Bool

(>=) :: BinaryTree a -> BinaryTree a -> Bool

max :: BinaryTree a -> BinaryTree a -> BinaryTree a

min :: BinaryTree a -> BinaryTree a -> BinaryTree a

Magma (BinaryTree a)

Defined in Data.Magma

Methods

(<>) :: BinaryTree a -> BinaryTree a -> BinaryTree a

cataBinaryTree :: (a -> r) -> (r -> r -> r) -> BinaryTree a -> r

anaBinaryTree :: (b -> Either a (b, b)) -> b -> BinaryTree a

foldMap :: Magma m => (a -> m) -> BinaryTree a -> m

_Leaf :: forall p f a. (Choice p, Applicative f) => p a (f a) -> p (BinaryTree a) (f (BinaryTree a))

_Leaf :: Prism' (BinaryTree a) a

_Node :: forall p f a. (Choice p, Applicative f) => p (BinaryTree a, BinaryTree a) (f (BinaryTree a, BinaryTree a)) -> p (BinaryTree a) (f (BinaryTree a))

_Node :: Prism' (BinaryTree a) (BinaryTree a, BinaryTree a)

nodeLeft :: Applicative f => (BinaryTree a -> f (BinaryTree a)) -> BinaryTree a -> f (BinaryTree a)

nodeLeft :: Traversal' (BinaryTree a) (BinaryTree a)

nodeRight :: Applicative f => (BinaryTree a -> f (BinaryTree a)) -> BinaryTree a -> f (BinaryTree a)

nodeRight :: Traversal' (BinaryTree a) (BinaryTree a)