Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Merge.Updated

Synopsis

type Updated a = GUpdated a a
data GUpdated a b = Updated {
- old :: a
- new :: b
}
bimap :: (a -> b) -> (c -> d) -> GUpdated a c -> GUpdated b d
bitraverse :: Applicative f => (a -> f b) -> (c -> f d) -> GUpdated a c -> f (GUpdated b d)
foldMap :: Semigroup m => (a -> m) -> Updated a -> m
fromPair :: (a, b) -> GUpdated a b
map :: (a -> b) -> Updated a -> Updated b
sequenceDefns :: Updated (Defns terms types) -> Defns (Updated terms) (Updated types)
toPair :: GUpdated a b -> (a, b)
traverse :: Applicative f => (a -> f b) -> Updated a -> f (Updated b)
unzip :: GUpdated (a, b) (c, d) -> (GUpdated a c, GUpdated b d)
unzipWith :: (a -> (b, c)) -> Updated a -> (Updated b, Updated c)
zipWith :: (a -> b -> c) -> Updated a -> Updated b -> Updated c

Documentation

An updated thing.

Constructors

Updated
Fields old :: a new :: b

Instances details

Generic (GUpdated a b) Source #
Instance details Defined in Unison.Merge.Updated Associated Types type Rep (GUpdated a b) :: Type -> Type # Methods from :: GUpdated a b -> Rep (GUpdated a b) x # to :: Rep (GUpdated a b) x -> GUpdated a b #
(Show a, Show b) => Show (GUpdated a b) Source #
Instance details Defined in Unison.Merge.Updated Methods showsPrec :: Int -> GUpdated a b -> ShowS # show :: GUpdated a b -> String # showList :: [GUpdated a b] -> ShowS #
(NFData a, NFData b) => NFData (GUpdated a b) Source #
Instance details Defined in Unison.Merge.Updated Methods rnf :: GUpdated a b -> () #
type Rep (GUpdated a b) Source #
Instance details Defined in Unison.Merge.Updated type Rep (GUpdated a b) = D1 ('MetaData "GUpdated" "Unison.Merge.Updated" "unison-merge-0.0.0-CsoqdT2tgnzJVh8bRze97e" 'False) (C1 ('MetaCons "Updated" 'PrefixI 'True) (S1 ('MetaSel ('Just "old") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "new") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))

bimap :: (a -> b) -> (c -> d) -> GUpdated a c -> GUpdated b d Source #

bitraverse :: Applicative f => (a -> f b) -> (c -> f d) -> GUpdated a c -> f (GUpdated b d) Source #

foldMap :: Semigroup m => (a -> m) -> Updated a -> m Source #

map :: (a -> b) -> Updated a -> Updated b Source #

zipWith :: (a -> b -> c) -> Updated a -> Updated b -> Updated c Source #