Data.Separated.After

Documentation

data After s a

An s that comes after an a

Constructors

After a s

Instances

Bitraversable After

bitraverse f g (After a s) = After <$> g a <*> f s

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> After a b -> f (After c d)

Bifoldable After

bifoldMap f g (After a s) = g a <> f s

Methods

bifold :: Monoid m => After m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> After a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> After a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> After a b -> c

Bifunctor After

Methods

bimap :: (a -> b) -> (c -> d) -> After a c -> After b d

first :: (a -> b) -> After a c -> After b c

second :: (b -> c) -> After a b -> After a c

Swapped After

Methods

swapped :: (Profunctor p, Functor f) => p (After b a) (f (After d c)) -> p (After a b) (f (After c d))

Functor (After s)

Methods

fmap :: (a -> b) -> After s a -> After s b

(<$) :: a -> After s b -> After s a

Foldable (After s)

Methods

fold :: Monoid m => After s m -> m

foldMap :: Monoid m => (a -> m) -> After s a -> m

foldr :: (a -> b -> b) -> b -> After s a -> b

foldr' :: (a -> b -> b) -> b -> After s a -> b

foldl :: (b -> a -> b) -> b -> After s a -> b

foldl' :: (b -> a -> b) -> b -> After s a -> b

foldr1 :: (a -> a -> a) -> After s a -> a

foldl1 :: (a -> a -> a) -> After s a -> a

toList :: After s a -> [a]

null :: After s a -> Bool

length :: After s a -> Int

elem :: Eq a => a -> After s a -> Bool

maximum :: Ord a => After s a -> a

minimum :: Ord a => After s a -> a

sum :: Num a => After s a -> a

product :: Num a => After s a -> a

Traversable (After s)

Methods

traverse :: Applicative f => (a -> f b) -> After s a -> f (After s b)

sequenceA :: Applicative f => After s (f a) -> f (After s a)

mapM :: Monad m => (a -> m b) -> After s a -> m (After s b)

sequence :: Monad m => After s (m a) -> m (After s a)

Eq s => Eq1 (After s)

Methods

liftEq :: (a -> b -> Bool) -> After s a -> After s b -> Bool

Ord s => Ord1 (After s)

Methods

liftCompare :: (a -> b -> Ordering) -> After s a -> After s b -> Ordering

Show s => Show1 (After s)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> After s a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [After s a] -> ShowS

Generic1 * (After s)

Associated Types

type Rep1 (After s) (f :: After s -> *) :: k -> *

Methods

from1 :: f a -> Rep1 (After s) f a

to1 :: Rep1 (After s) f a -> f a

(Eq s, Eq a) => Eq (After s a)

Methods

(==) :: After s a -> After s a -> Bool

(/=) :: After s a -> After s a -> Bool

(Ord s, Ord a) => Ord (After s a)

Methods

compare :: After s a -> After s a -> Ordering

(<) :: After s a -> After s a -> Bool

(<=) :: After s a -> After s a -> Bool

(>) :: After s a -> After s a -> Bool

(>=) :: After s a -> After s a -> Bool

max :: After s a -> After s a -> After s a

min :: After s a -> After s a -> After s a

(Show s, Show a) => Show (After s a)

Methods

showsPrec :: Int -> After s a -> ShowS

show :: After s a -> String

showList :: [After s a] -> ShowS

Generic (After s a)

Associated Types

type Rep (After s a) :: * -> *

Methods

from :: After s a -> Rep (After s a) x

to :: Rep (After s a) x -> After s a

type Rep1 * (After s)

type Rep1 * (After s) = D1 * (MetaData "After" "Data.Separated.Internal" "separated-0.3.2.1-E7YQiadtVn83kx2pgxVpuR" False) (C1 * (MetaCons "After" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * s))))

type Rep (After s a)

type Rep (After s a) = D1 * (MetaData "After" "Data.Separated.Internal" "separated-0.3.2.1-E7YQiadtVn83kx2pgxVpuR" False) (C1 * (MetaCons "After" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * s))))

Isos

after :: Iso (a, s) (b, t) (After s a) (After t b)

After s a is isomorphic to (a, s)

afterBefore :: Iso (Before s a) (Before t b) (After a s) (After b t)

After s a is isomorphic to Before a s

afterBefore == from beforeAfter