transaction-0.1.1.3: Monadic representation of transactions.

CopyrightKadzuya Okamoto 2018
LicenseMIT
Stabilityexperimental
Portabilityunknown
Safe HaskellNone
LanguageHaskell2010

Data.Transaction

Contents

Description

Monadic representation of transactions.

Synopsis

Constructors

action :: a -> Transaction a Source #

>>> :{
toList $ do
  action 4
  action 5
  action 6
:}
[4,5,6]
>>> :{
toList $ filter even $ do
  action 4
  action 5
  action 6
:}
[4,6]

Converters

reduce :: (b -> a -> b) -> b -> Transaction a -> b Source #

An alias of foldl for convenience.

tMap :: (a -> b) -> Transaction a -> Transaction b Source #

An alias of first for convenience.

>>> :{
toList $ do
  action 4
  tMap (+1) $ do
    action 5
    action 6
  action 7
:}
[4,6,7,7]

tFilter :: (a -> Bool) -> Transaction a -> Transaction a Source #

Deprecated: Use filter instead.

An alias of filter.

>>> :{
toList $ do
  action 4
  tFilter even $ do
    action 5
    action 6
  action 7
:}
[4,6,7]
>>> :{
toList $ do
  action 4
  filter even $ do
    action 5
    action 6
  action 7
:}
[4,6,7]

tFilterMap :: (a -> Maybe b) -> Transaction a -> Transaction b Source #

Deprecated: This will be removed in a future release.

>>> :{
toList $ do
  action 4
  tFilterMap (\x -> if even x then Just (x + 1) else Nothing) $ do
    action 5
    action 6
  action 7
:}
[4,7,7]

Types

data TransactionM a x Source #

Instances

Bifunctor TransactionM Source # 

Methods

bimap :: (a -> b) -> (c -> d) -> TransactionM a c -> TransactionM b d #

first :: (a -> b) -> TransactionM a c -> TransactionM b c #

second :: (b -> c) -> TransactionM a b -> TransactionM a c #

Monad (TransactionM a) Source # 

Methods

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

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

return :: a -> TransactionM a a #

fail :: String -> TransactionM a a #

Functor (TransactionM a) Source # 

Methods

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

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

Applicative (TransactionM a) Source # 

Methods

pure :: a -> TransactionM a a #

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

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

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

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

Semigroup (Transaction a) Source # 
Monoid (Transaction a) Source # 
SemiSequence (Transaction a) Source # 
IsSequence (Transaction a) Source # 

Methods

fromList :: [Element (Transaction a)] -> Transaction a #

lengthIndex :: Transaction a -> Index (Transaction a) #

break :: (Element (Transaction a) -> Bool) -> Transaction a -> (Transaction a, Transaction a) #

span :: (Element (Transaction a) -> Bool) -> Transaction a -> (Transaction a, Transaction a) #

dropWhile :: (Element (Transaction a) -> Bool) -> Transaction a -> Transaction a #

takeWhile :: (Element (Transaction a) -> Bool) -> Transaction a -> Transaction a #

splitAt :: Index (Transaction a) -> Transaction a -> (Transaction a, Transaction a) #

unsafeSplitAt :: Index (Transaction a) -> Transaction a -> (Transaction a, Transaction a) #

take :: Index (Transaction a) -> Transaction a -> Transaction a #

unsafeTake :: Index (Transaction a) -> Transaction a -> Transaction a #

drop :: Index (Transaction a) -> Transaction a -> Transaction a #

unsafeDrop :: Index (Transaction a) -> Transaction a -> Transaction a #

dropEnd :: Index (Transaction a) -> Transaction a -> Transaction a #

partition :: (Element (Transaction a) -> Bool) -> Transaction a -> (Transaction a, Transaction a) #

uncons :: Transaction a -> Maybe (Element (Transaction a), Transaction a) #

unsnoc :: Transaction a -> Maybe (Transaction a, Element (Transaction a)) #

filter :: (Element (Transaction a) -> Bool) -> Transaction a -> Transaction a #

filterM :: Monad m => (Element (Transaction a) -> m Bool) -> Transaction a -> m (Transaction a) #

replicate :: Index (Transaction a) -> Element (Transaction a) -> Transaction a #

replicateM :: Monad m => Index (Transaction a) -> m (Element (Transaction a)) -> m (Transaction a) #

groupBy :: (Element (Transaction a) -> Element (Transaction a) -> Bool) -> Transaction a -> [Transaction a] #

groupAllOn :: Eq b => (Element (Transaction a) -> b) -> Transaction a -> [Transaction a] #

subsequences :: Transaction a -> [Transaction a] #

permutations :: Transaction a -> [Transaction a] #

tailEx :: Transaction a -> Transaction a #

tailMay :: Transaction a -> Maybe (Transaction a) #

initEx :: Transaction a -> Transaction a #

initMay :: Transaction a -> Maybe (Transaction a) #

unsafeTail :: Transaction a -> Transaction a #

unsafeInit :: Transaction a -> Transaction a #

index :: Transaction a -> Index (Transaction a) -> Maybe (Element (Transaction a)) #

indexEx :: Transaction a -> Index (Transaction a) -> Element (Transaction a) #

unsafeIndex :: Transaction a -> Index (Transaction a) -> Element (Transaction a) #

splitWhen :: (Element (Transaction a) -> Bool) -> Transaction a -> [Transaction a] #

MonoFunctor (Transaction a) Source # 
MonoFoldable (Transaction a) Source # 

Methods

ofoldMap :: Monoid m => (Element (Transaction a) -> m) -> Transaction a -> m #

ofoldr :: (Element (Transaction a) -> b -> b) -> b -> Transaction a -> b #

ofoldl' :: (a -> Element (Transaction a) -> a) -> a -> Transaction a -> a #

otoList :: Transaction a -> [Element (Transaction a)] #

oall :: (Element (Transaction a) -> Bool) -> Transaction a -> Bool #

oany :: (Element (Transaction a) -> Bool) -> Transaction a -> Bool #

onull :: Transaction a -> Bool #

olength :: Transaction a -> Int #

olength64 :: Transaction a -> Int64 #

ocompareLength :: Integral i => Transaction a -> i -> Ordering #

otraverse_ :: Applicative f => (Element (Transaction a) -> f b) -> Transaction a -> f () #

ofor_ :: Applicative f => Transaction a -> (Element (Transaction a) -> f b) -> f () #

omapM_ :: Applicative m => (Element (Transaction a) -> m ()) -> Transaction a -> m () #

oforM_ :: Applicative m => Transaction a -> (Element (Transaction a) -> m ()) -> m () #

ofoldlM :: Monad m => (a -> Element (Transaction a) -> m a) -> a -> Transaction a -> m a #

ofoldMap1Ex :: Semigroup m => (Element (Transaction a) -> m) -> Transaction a -> m #

ofoldr1Ex :: (Element (Transaction a) -> Element (Transaction a) -> Element (Transaction a)) -> Transaction a -> Element (Transaction a) #

ofoldl1Ex' :: (Element (Transaction a) -> Element (Transaction a) -> Element (Transaction a)) -> Transaction a -> Element (Transaction a) #

headEx :: Transaction a -> Element (Transaction a) #

lastEx :: Transaction a -> Element (Transaction a) #

unsafeHead :: Transaction a -> Element (Transaction a) #

unsafeLast :: Transaction a -> Element (Transaction a) #

maximumByEx :: (Element (Transaction a) -> Element (Transaction a) -> Ordering) -> Transaction a -> Element (Transaction a) #

minimumByEx :: (Element (Transaction a) -> Element (Transaction a) -> Ordering) -> Transaction a -> Element (Transaction a) #

oelem :: Element (Transaction a) -> Transaction a -> Bool #

onotElem :: Element (Transaction a) -> Transaction a -> Bool #

MonoTraversable (Transaction a) Source # 
MonoPointed (Transaction a) Source # 
GrowingAppend (Transaction a) Source # 
type Index (Transaction a) Source # 
type Index (Transaction a) = Int
type Element (Transaction a) Source # 
type Element (Transaction a) = a