Safe Haskell	Safe-Inferred
Language	Haskell2010

Unison.Merge.Unconflicts

Synopsis

data Unconflicts v = Unconflicts {
- adds :: !(TwoWayI (Map Name v))
- deletes :: !(TwoWayI (Map Name v))
- updates :: !(TwoWayI (Map Name v))
}
empty :: Unconflicts v
apply :: forall v. Unconflicts v -> Map Name v -> Map Name v
soloDeletedNames :: DefnsF Unconflicts term typ -> TwoWay (DefnsF Set Name Name)
soloUpdatedNames :: DefnsF Unconflicts term typ -> TwoWay (DefnsF Set Name Name)
bothUpdatedNames :: DefnsF Unconflicts term typ -> DefnsF Set Name Name

Documentation

data Unconflicts v Source #

Constructors

Unconflicts
Fields adds :: !(TwoWayI (Map Name v)) deletes :: !(TwoWayI (Map Name v)) updates :: !(TwoWayI (Map Name v))

Instances

Instances details

Foldable Unconflicts Source #
Instance details Defined in Unison.Merge.Unconflicts Methods fold :: Monoid m => Unconflicts m -> m # foldMap :: Monoid m => (a -> m) -> Unconflicts a -> m # foldMap' :: Monoid m => (a -> m) -> Unconflicts a -> m # foldr :: (a -> b -> b) -> b -> Unconflicts a -> b # foldr' :: (a -> b -> b) -> b -> Unconflicts a -> b # foldl :: (b -> a -> b) -> b -> Unconflicts a -> b # foldl' :: (b -> a -> b) -> b -> Unconflicts a -> b # foldr1 :: (a -> a -> a) -> Unconflicts a -> a # foldl1 :: (a -> a -> a) -> Unconflicts a -> a # toList :: Unconflicts a -> [a] # null :: Unconflicts a -> Bool # length :: Unconflicts a -> Int # elem :: Eq a => a -> Unconflicts a -> Bool # maximum :: Ord a => Unconflicts a -> a # minimum :: Ord a => Unconflicts a -> a # sum :: Num a => Unconflicts a -> a # product :: Num a => Unconflicts a -> a #
Functor Unconflicts Source #
Instance details Defined in Unison.Merge.Unconflicts Methods fmap :: (a -> b) -> Unconflicts a -> Unconflicts b # (<$) :: a -> Unconflicts b -> Unconflicts a #
Generic (Unconflicts v) Source #
Instance details Defined in Unison.Merge.Unconflicts Associated Types type Rep (Unconflicts v) :: Type -> Type # Methods from :: Unconflicts v -> Rep (Unconflicts v) x # to :: Rep (Unconflicts v) x -> Unconflicts v #
type Rep (Unconflicts v) Source #
Instance details Defined in Unison.Merge.Unconflicts type Rep (Unconflicts v) = D1 ('MetaData "Unconflicts" "Unison.Merge.Unconflicts" "unison-merge-0.0.0-K12d73YxIdk6Q1NPSio3eV" 'False) (C1 ('MetaCons "Unconflicts" 'PrefixI 'True) (S1 ('MetaSel ('Just "adds") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (TwoWayI (Map Name v))) :: (S1 ('MetaSel ('Just "deletes") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (TwoWayI (Map Name v))) :: S1 ('MetaSel ('Just "updates") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (TwoWayI (Map Name v))))))

empty :: Unconflicts v Source #

apply :: forall v. Unconflicts v -> Map Name v -> Map Name v Source #

Apply unconflicts to a namespace.

soloDeletedNames :: DefnsF Unconflicts term typ -> TwoWay (DefnsF Set Name Name) Source #

soloUpdatedNames :: DefnsF Unconflicts term typ -> TwoWay (DefnsF Set Name Name) Source #

bothUpdatedNames :: DefnsF Unconflicts term typ -> DefnsF Set Name Name Source #