pire-0.2.5

Copyright(c) Andreas Reuleaux 2015 - 2018
LicenseBSD2
MaintainerAndreas Reuleaux <rx@a-rx.info>
Stabilityexperimental
Portabilitynon-portable
Safe HaskellSafe
LanguageHaskell2010

Refactor

Description

our refactoring monad RE (among others)

Synopsis

Documentation

data RE a Source #

our refactoring monad

Constructors

Re a 
Left_ RefactorError 
Err String 
Err_ 

Instances

Monad RE Source # 

Methods

(>>=) :: RE a -> (a -> RE b) -> RE b #

(>>) :: RE a -> RE b -> RE b #

return :: a -> RE a #

fail :: String -> RE a #

Functor RE Source # 

Methods

fmap :: (a -> b) -> RE a -> RE b #

(<$) :: a -> RE b -> RE a #

Applicative RE Source # 

Methods

pure :: a -> RE a #

(<*>) :: RE (a -> b) -> RE a -> RE b #

liftA2 :: (a -> b -> c) -> RE a -> RE b -> RE c #

(*>) :: RE a -> RE b -> RE b #

(<*) :: RE a -> RE b -> RE a #

Foldable RE Source # 

Methods

fold :: Monoid m => RE m -> m #

foldMap :: Monoid m => (a -> m) -> RE a -> m #

foldr :: (a -> b -> b) -> b -> RE a -> b #

foldr' :: (a -> b -> b) -> b -> RE a -> b #

foldl :: (b -> a -> b) -> b -> RE a -> b #

foldl' :: (b -> a -> b) -> b -> RE a -> b #

foldr1 :: (a -> a -> a) -> RE a -> a #

foldl1 :: (a -> a -> a) -> RE a -> a #

toList :: RE a -> [a] #

null :: RE a -> Bool #

length :: RE a -> Int #

elem :: Eq a => a -> RE a -> Bool #

maximum :: Ord a => RE a -> a #

minimum :: Ord a => RE a -> a #

sum :: Num a => RE a -> a #

product :: Num a => RE a -> a #

Traversable RE Source # 

Methods

traverse :: Applicative f => (a -> f b) -> RE a -> f (RE b) #

sequenceA :: Applicative f => RE (f a) -> f (RE a) #

mapM :: Monad m => (a -> m b) -> RE a -> m (RE b) #

sequence :: Monad m => RE (m a) -> m (RE a) #

Refactoring RE Source # 
Eq a => Eq (RE a) Source # 

Methods

(==) :: RE a -> RE a -> Bool #

(/=) :: RE a -> RE a -> Bool #

Ord a => Ord (RE a) Source # 

Methods

compare :: RE a -> RE a -> Ordering #

(<) :: RE a -> RE a -> Bool #

(<=) :: RE a -> RE a -> Bool #

(>) :: RE a -> RE a -> Bool #

(>=) :: RE a -> RE a -> Bool #

max :: RE a -> RE a -> RE a #

min :: RE a -> RE a -> RE a #

Show a => Show (RE a) Source # 

Methods

showsPrec :: Int -> RE a -> ShowS #

show :: RE a -> String #

showList :: [RE a] -> ShowS #

Pretty a => Pretty (RE a) Source # 

Methods

pretty :: RE a -> Doc ann #

prettyList :: [RE a] -> Doc ann #

fromRe :: RE p -> p Source #