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

import Unison.Merge.Updated (Updated)

-- | A diff operation is one of:
--
--   * An add (where nothing was)
--   * A delete (of the thing that was)
--   * An update (from old to new)
data DiffOp a
  = DiffOp'Add !a
  | DiffOp'Delete !a
  | DiffOp'Update !(Updated a)
  deriving stock ((forall m. Monoid m => DiffOp m -> m)
-> (forall m a. Monoid m => (a -> m) -> DiffOp a -> m)
-> (forall m a. Monoid m => (a -> m) -> DiffOp a -> m)
-> (forall a b. (a -> b -> b) -> b -> DiffOp a -> b)
-> (forall a b. (a -> b -> b) -> b -> DiffOp a -> b)
-> (forall b a. (b -> a -> b) -> b -> DiffOp a -> b)
-> (forall b a. (b -> a -> b) -> b -> DiffOp a -> b)
-> (forall a. (a -> a -> a) -> DiffOp a -> a)
-> (forall a. (a -> a -> a) -> DiffOp a -> a)
-> (forall a. DiffOp a -> [a])
-> (forall a. DiffOp a -> Bool)
-> (forall a. DiffOp a -> Int)
-> (forall a. Eq a => a -> DiffOp a -> Bool)
-> (forall a. Ord a => DiffOp a -> a)
-> (forall a. Ord a => DiffOp a -> a)
-> (forall a. Num a => DiffOp a -> a)
-> (forall a. Num a => DiffOp a -> a)
-> Foldable DiffOp
forall a. Eq a => a -> DiffOp a -> Bool
forall a. Num a => DiffOp a -> a
forall a. Ord a => DiffOp a -> a
forall m. Monoid m => DiffOp m -> m
forall a. DiffOp a -> Bool
forall a. DiffOp a -> Int
forall a. DiffOp a -> [a]
forall a. (a -> a -> a) -> DiffOp a -> a
forall m a. Monoid m => (a -> m) -> DiffOp a -> m
forall b a. (b -> a -> b) -> b -> DiffOp a -> b
forall a b. (a -> b -> b) -> b -> DiffOp 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 => DiffOp m -> m
fold :: forall m. Monoid m => DiffOp m -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> DiffOp a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> DiffOp a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> DiffOp a -> m
foldMap' :: forall m a. Monoid m => (a -> m) -> DiffOp a -> m
$cfoldr :: forall a b. (a -> b -> b) -> b -> DiffOp a -> b
foldr :: forall a b. (a -> b -> b) -> b -> DiffOp a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> DiffOp a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> DiffOp a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> DiffOp a -> b
foldl :: forall b a. (b -> a -> b) -> b -> DiffOp a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> DiffOp a -> b
foldl' :: forall b a. (b -> a -> b) -> b -> DiffOp a -> b
$cfoldr1 :: forall a. (a -> a -> a) -> DiffOp a -> a
foldr1 :: forall a. (a -> a -> a) -> DiffOp a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> DiffOp a -> a
foldl1 :: forall a. (a -> a -> a) -> DiffOp a -> a
$ctoList :: forall a. DiffOp a -> [a]
toList :: forall a. DiffOp a -> [a]
$cnull :: forall a. DiffOp a -> Bool
null :: forall a. DiffOp a -> Bool
$clength :: forall a. DiffOp a -> Int
length :: forall a. DiffOp a -> Int
$celem :: forall a. Eq a => a -> DiffOp a -> Bool
elem :: forall a. Eq a => a -> DiffOp a -> Bool
$cmaximum :: forall a. Ord a => DiffOp a -> a
maximum :: forall a. Ord a => DiffOp a -> a
$cminimum :: forall a. Ord a => DiffOp a -> a
minimum :: forall a. Ord a => DiffOp a -> a
$csum :: forall a. Num a => DiffOp a -> a
sum :: forall a. Num a => DiffOp a -> a
$cproduct :: forall a. Num a => DiffOp a -> a
product :: forall a. Num a => DiffOp a -> a
Foldable, (forall a b. (a -> b) -> DiffOp a -> DiffOp b)
-> (forall a b. a -> DiffOp b -> DiffOp a) -> Functor DiffOp
forall a b. a -> DiffOp b -> DiffOp a
forall a b. (a -> b) -> DiffOp a -> DiffOp 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) -> DiffOp a -> DiffOp b
fmap :: forall a b. (a -> b) -> DiffOp a -> DiffOp b
$c<$ :: forall a b. a -> DiffOp b -> DiffOp a
<$ :: forall a b. a -> DiffOp b -> DiffOp a
Functor, Int -> DiffOp a -> ShowS
[DiffOp a] -> ShowS
DiffOp a -> String
(Int -> DiffOp a -> ShowS)
-> (DiffOp a -> String) -> ([DiffOp a] -> ShowS) -> Show (DiffOp a)
forall a. Show a => Int -> DiffOp a -> ShowS
forall a. Show a => [DiffOp a] -> ShowS
forall a. Show a => DiffOp a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall a. Show a => Int -> DiffOp a -> ShowS
showsPrec :: Int -> DiffOp a -> ShowS
$cshow :: forall a. Show a => DiffOp a -> String
show :: DiffOp a -> String
$cshowList :: forall a. Show a => [DiffOp a] -> ShowS
showList :: [DiffOp a] -> ShowS
Show, Functor DiffOp
Foldable DiffOp
(Functor DiffOp, Foldable DiffOp) =>
(forall (f :: * -> *) a b.
 Applicative f =>
 (a -> f b) -> DiffOp a -> f (DiffOp b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    DiffOp (f a) -> f (DiffOp a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> DiffOp a -> m (DiffOp b))
-> (forall (m :: * -> *) a.
    Monad m =>
    DiffOp (m a) -> m (DiffOp a))
-> Traversable DiffOp
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 => DiffOp (m a) -> m (DiffOp a)
forall (f :: * -> *) a.
Applicative f =>
DiffOp (f a) -> f (DiffOp a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> DiffOp a -> m (DiffOp b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> DiffOp a -> f (DiffOp b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> DiffOp a -> f (DiffOp b)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> DiffOp a -> f (DiffOp b)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
DiffOp (f a) -> f (DiffOp a)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
DiffOp (f a) -> f (DiffOp a)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> DiffOp a -> m (DiffOp b)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> DiffOp a -> m (DiffOp b)
$csequence :: forall (m :: * -> *) a. Monad m => DiffOp (m a) -> m (DiffOp a)
sequence :: forall (m :: * -> *) a. Monad m => DiffOp (m a) -> m (DiffOp a)
Traversable)