module Unison.Merge.Updated
  ( Updated (..),
  )
where

import Unison.Prelude

-- | An updated thing.
data Updated a = Updated
  { forall a. Updated a -> a
old :: a,
    forall a. Updated a -> a
new :: a
  }
  deriving stock ((forall m. Monoid m => Updated m -> m)
-> (forall m a. Monoid m => (a -> m) -> Updated a -> m)
-> (forall m a. Monoid m => (a -> m) -> Updated a -> m)
-> (forall a b. (a -> b -> b) -> b -> Updated a -> b)
-> (forall a b. (a -> b -> b) -> b -> Updated a -> b)
-> (forall b a. (b -> a -> b) -> b -> Updated a -> b)
-> (forall b a. (b -> a -> b) -> b -> Updated a -> b)
-> (forall a. (a -> a -> a) -> Updated a -> a)
-> (forall a. (a -> a -> a) -> Updated a -> a)
-> (forall a. Updated a -> [a])
-> (forall a. Updated a -> Bool)
-> (forall a. Updated a -> Int)
-> (forall a. Eq a => a -> Updated a -> Bool)
-> (forall a. Ord a => Updated a -> a)
-> (forall a. Ord a => Updated a -> a)
-> (forall a. Num a => Updated a -> a)
-> (forall a. Num a => Updated a -> a)
-> Foldable Updated
forall a. Eq a => a -> Updated a -> Bool
forall a. Num a => Updated a -> a
forall a. Ord a => Updated a -> a
forall m. Monoid m => Updated m -> m
forall a. Updated a -> Bool
forall a. Updated a -> Int
forall a. Updated a -> [a]
forall a. (a -> a -> a) -> Updated a -> a
forall m a. Monoid m => (a -> m) -> Updated a -> m
forall b a. (b -> a -> b) -> b -> Updated a -> b
forall a b. (a -> b -> b) -> b -> Updated a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
$cfold :: forall m. Monoid m => Updated m -> m
fold :: forall m. Monoid m => Updated m -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Updated a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Updated a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Updated a -> m
foldMap' :: forall m a. Monoid m => (a -> m) -> Updated a -> m
$cfoldr :: forall a b. (a -> b -> b) -> b -> Updated a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Updated a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Updated a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Updated a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Updated a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Updated a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Updated a -> b
foldl' :: forall b a. (b -> a -> b) -> b -> Updated a -> b
$cfoldr1 :: forall a. (a -> a -> a) -> Updated a -> a
foldr1 :: forall a. (a -> a -> a) -> Updated a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Updated a -> a
foldl1 :: forall a. (a -> a -> a) -> Updated a -> a
$ctoList :: forall a. Updated a -> [a]
toList :: forall a. Updated a -> [a]
$cnull :: forall a. Updated a -> Bool
null :: forall a. Updated a -> Bool
$clength :: forall a. Updated a -> Int
length :: forall a. Updated a -> Int
$celem :: forall a. Eq a => a -> Updated a -> Bool
elem :: forall a. Eq a => a -> Updated a -> Bool
$cmaximum :: forall a. Ord a => Updated a -> a
maximum :: forall a. Ord a => Updated a -> a
$cminimum :: forall a. Ord a => Updated a -> a
minimum :: forall a. Ord a => Updated a -> a
$csum :: forall a. Num a => Updated a -> a
sum :: forall a. Num a => Updated a -> a
$cproduct :: forall a. Num a => Updated a -> a
product :: forall a. Num a => Updated a -> a
Foldable, (forall a b. (a -> b) -> Updated a -> Updated b)
-> (forall a b. a -> Updated b -> Updated a) -> Functor Updated
forall a b. a -> Updated b -> Updated a
forall a b. (a -> b) -> Updated a -> Updated b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
$cfmap :: forall a b. (a -> b) -> Updated a -> Updated b
fmap :: forall a b. (a -> b) -> Updated a -> Updated b
$c<$ :: forall a b. a -> Updated b -> Updated a
<$ :: forall a b. a -> Updated b -> Updated a
Functor, (forall x. Updated a -> Rep (Updated a) x)
-> (forall x. Rep (Updated a) x -> Updated a)
-> Generic (Updated a)
forall x. Rep (Updated a) x -> Updated a
forall x. Updated a -> Rep (Updated a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Updated a) x -> Updated a
forall a x. Updated a -> Rep (Updated a) x
$cfrom :: forall a x. Updated a -> Rep (Updated a) x
from :: forall x. Updated a -> Rep (Updated a) x
$cto :: forall a x. Rep (Updated a) x -> Updated a
to :: forall x. Rep (Updated a) x -> Updated a
Generic, Int -> Updated a -> ShowS
[Updated a] -> ShowS
Updated a -> String
(Int -> Updated a -> ShowS)
-> (Updated a -> String)
-> ([Updated a] -> ShowS)
-> Show (Updated a)
forall a. Show a => Int -> Updated a -> ShowS
forall a. Show a => [Updated a] -> ShowS
forall a. Show a => Updated a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall a. Show a => Int -> Updated a -> ShowS
showsPrec :: Int -> Updated a -> ShowS
$cshow :: forall a. Show a => Updated a -> String
show :: Updated a -> String
$cshowList :: forall a. Show a => [Updated a] -> ShowS
showList :: [Updated a] -> ShowS
Show, Functor Updated
Foldable Updated
(Functor Updated, Foldable Updated) =>
(forall (f :: * -> *) a b.
 Applicative f =>
 (a -> f b) -> Updated a -> f (Updated b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Updated (f a) -> f (Updated a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Updated a -> m (Updated b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Updated (m a) -> m (Updated a))
-> Traversable Updated
forall (t :: * -> *).
(Functor t, Foldable t) =>
(forall (f :: * -> *) a b.
 Applicative f =>
 (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a. Monad m => Updated (m a) -> m (Updated a)
forall (f :: * -> *) a.
Applicative f =>
Updated (f a) -> f (Updated a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Updated a -> m (Updated b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Updated a -> f (Updated b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Updated a -> f (Updated b)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Updated a -> f (Updated b)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Updated (f a) -> f (Updated a)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Updated (f a) -> f (Updated a)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Updated a -> m (Updated b)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Updated a -> m (Updated b)
$csequence :: forall (m :: * -> *) a. Monad m => Updated (m a) -> m (Updated a)
sequence :: forall (m :: * -> *) a. Monad m => Updated (m a) -> m (Updated a)
Traversable)