| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Unison.Merge
Contents
Synopsis
- data Diffblob libdep = Diffblob {
- conflicts :: TwoWay (DefnsF (Map Name) TermReference TypeReference)
- declNameLookups :: GThreeWay PartialDeclNameLookup DeclNameLookup
- defns :: ThreeWay UnconflictedLocalDefnsView
- defnsIds :: ThreeWay (DefnsF Set TermReferenceId TypeReferenceId)
- diff :: DefnsF2 (Map Name) CombinedDiffOp Referent TypeReference
- diffsFromLCA :: TwoWay (DefnsF3 (Map Name) DiffOp Synhashed Referent TypeReference)
- hydratedNarrowedDefns :: Defns (Map TermReferenceId (Term Symbol Ann, Type Symbol Ann)) (Map TypeReferenceId (Decl Symbol Ann))
- libdeps :: Updated (Map NameSegment libdep)
- libdepsDiffs :: TwoWay (Map NameSegment (DiffOp libdep))
- propagatedUpdates :: TwoWay (DefnsF (Map Name) (Updated Referent) (Updated TypeReference))
- simpleRenames :: TwoWay (Defns SimpleRenames SimpleRenames)
- unconflicts :: DefnsF Unconflicts Referent TypeReference
- makeDiffblob :: (Eq libdep, Monad m) => DiffblobLog m -> (ThreeWay (DefnsF Set TermReferenceId TypeReferenceId) -> m (Defns (Map TermReferenceId (Term Symbol Ann, Type Symbol Ann)) (Map TypeReferenceId (Decl Symbol Ann)))) -> (ThreeWay (Set LabeledDependency) -> m (ThreeWay Names)) -> ThreeWay UnconflictedLocalDefnsView -> ThreeWay (Map NameSegment libdep) -> GThreeWay PartialDeclNameLookup DeclNameLookup -> m (Diffblob libdep)
- data DiffblobLog (m :: Type -> Type) = DiffblobLog {
- logDefns :: ThreeWay (DefnsF (Map Name) Referent TypeReference) -> m ()
- logNarrowedDefns :: TwoWay (Updated (DefnsF (Map Name) Referent TypeReference)) -> m ()
- logSynhashedNarrowedDefns :: TwoWay (GUpdated (DefnsF2 (Map Name) Synhashed Referent TypeReference) (DefnsF2 (Map Name) Synhashed Referent TypeReference)) -> m ()
- logDiffsFromLCA :: TwoWay (DefnsF3 (Map Name) DiffOp Synhashed Referent TypeReference) -> m ()
- logDiff :: DefnsF2 (Map Name) CombinedDiffOp Referent TypeReference -> m ()
- emptyDiffblobLog :: forall (m :: Type -> Type). Applicative m => DiffblobLog m
- data Mergeblob libdep = Mergeblob {
- conflicts :: TwoWay (DefnsF (Map Name) TermReferenceId TypeReferenceId)
- typecheckedFile :: Maybe (TypecheckedUnisonFile Symbol Ann)
- unconflictedDefns :: DefnsF (Map Name) Referent TypeReference
- uniqueTypeGuids :: TwoWay (Map Name Text)
- unparsedFile :: Pretty ColorText
- unparsedSoloFiles :: ThreeWay (Pretty ColorText)
- data MergeblobError
- makeMergeblob :: Monad m => (ThreeWay (DefnsF Set TermReferenceId TypeReferenceId) -> m (Defns (Map TermReferenceId (Term Symbol Ann, Type Symbol Ann)) (Map TypeReferenceId (Decl Symbol Ann)))) -> (DefnsF Set TermReferenceId TypeReferenceId -> DefnsF Set TermReference TypeReference -> m (DefnsF Set TermReferenceId TypeReferenceId)) -> m (Updated Names) -> (DefnsF Set TermReference TypeReference -> m (TypeLookup Symbol Ann)) -> Diffblob libdep -> TwoWay Text -> m (Either MergeblobError (Mergeblob libdep))
- data CombinedDiffOp a
- = CombinedDiffOp'Add !(EitherWayI a)
- | CombinedDiffOp'Delete !(EitherWayI a)
- | CombinedDiffOp'Update !(EitherWayI (Updated a))
- | CombinedDiffOp'Conflict !(TwoWay a)
- data DiffOp a
- = DiffOp'Add !a
- | DiffOp'Delete !a
- | DiffOp'Update !(Updated a)
- data EitherWay a
- data EitherWayI a
- = OnlyAlice a
- | OnlyBob a
- | AliceAndBob a
- data GThreeWay a b = GThreeWay {}
- data GUpdated a b = Updated {}
- data LibdepDiffOp a
- = AddLibdep !a
- | AddBothLibdeps !a !a
- | DeleteLibdep
- data Rename = Rename {}
- data SimpleRenames = SimpleRenames {}
- data Synhashed a = Synhashed {}
- data ThreeWay a = ThreeWay {}
- data TwoOrThreeWay a = TwoOrThreeWay {}
- data TwoWay a = TwoWay {}
- data TwoWayI a = TwoWayI {}
- data Unconflicts v = Unconflicts {}
- type Updated a = GUpdated a a
Documentation
Constructors
| Diffblob | |
Fields
| |
makeDiffblob :: (Eq libdep, Monad m) => DiffblobLog m -> (ThreeWay (DefnsF Set TermReferenceId TypeReferenceId) -> m (Defns (Map TermReferenceId (Term Symbol Ann, Type Symbol Ann)) (Map TypeReferenceId (Decl Symbol Ann)))) -> (ThreeWay (Set LabeledDependency) -> m (ThreeWay Names)) -> ThreeWay UnconflictedLocalDefnsView -> ThreeWay (Map NameSegment libdep) -> GThreeWay PartialDeclNameLookup DeclNameLookup -> m (Diffblob libdep) Source #
data DiffblobLog (m :: Type -> Type) Source #
Constructors
| DiffblobLog | |
Fields
| |
emptyDiffblobLog :: forall (m :: Type -> Type). Applicative m => DiffblobLog m Source #
data Mergeblob libdep Source #
Constructors
data MergeblobError Source #
makeMergeblob :: Monad m => (ThreeWay (DefnsF Set TermReferenceId TypeReferenceId) -> m (Defns (Map TermReferenceId (Term Symbol Ann, Type Symbol Ann)) (Map TypeReferenceId (Decl Symbol Ann)))) -> (DefnsF Set TermReferenceId TypeReferenceId -> DefnsF Set TermReference TypeReference -> m (DefnsF Set TermReferenceId TypeReferenceId)) -> m (Updated Names) -> (DefnsF Set TermReference TypeReference -> m (TypeLookup Symbol Ann)) -> Diffblob libdep -> TwoWay Text -> m (Either MergeblobError (Mergeblob libdep)) Source #
Types
data CombinedDiffOp a Source #
The combined result of two diffs on the same thing.
Constructors
| CombinedDiffOp'Add !(EitherWayI a) | |
| CombinedDiffOp'Delete !(EitherWayI a) | |
| CombinedDiffOp'Update !(EitherWayI (Updated a)) | |
| CombinedDiffOp'Conflict !(TwoWay a) |
Instances
A diff operation is one of:
- An add (where nothing was)
- A delete (of the thing that was)
- An update (from old to new)
Constructors
| DiffOp'Add !a | |
| DiffOp'Delete !a | |
| DiffOp'Update !(Updated a) |
Alice exclusive-or Bob?
data EitherWayI a Source #
Alice inclusive-or Bob?
Constructors
| OnlyAlice a | |
| OnlyBob a | |
| AliceAndBob a |
Instances
| Functor EitherWayI Source # | |||||
Defined in Unison.Merge.EitherWayI Methods fmap :: (a -> b) -> EitherWayI a -> EitherWayI b # (<$) :: a -> EitherWayI b -> EitherWayI a # | |||||
| NFData a => NFData (EitherWayI a) Source # | |||||
Defined in Unison.Merge.EitherWayI Methods rnf :: EitherWayI a -> () # | |||||
| Generic (EitherWayI a) Source # | |||||
Defined in Unison.Merge.EitherWayI Associated Types
| |||||
| Show a => Show (EitherWayI a) Source # | |||||
Defined in Unison.Merge.EitherWayI Methods showsPrec :: Int -> EitherWayI a -> ShowS # show :: EitherWayI a -> String # showList :: [EitherWayI a] -> ShowS # | |||||
| type Rep (EitherWayI a) Source # | |||||
Defined in Unison.Merge.EitherWayI type Rep (EitherWayI a) = D1 ('MetaData "EitherWayI" "Unison.Merge.EitherWayI" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "OnlyAlice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: (C1 ('MetaCons "OnlyBob" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "AliceAndBob" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) | |||||
Instances
| Generic (GThreeWay a b) Source # | |||||
Defined in Unison.Merge.Internal.Types Associated Types
| |||||
| type Rep (GThreeWay a b) Source # | |||||
Defined in Unison.Merge.Internal.Types type Rep (GThreeWay a b) = D1 ('MetaData "GThreeWay" "Unison.Merge.Internal.Types" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "GThreeWay" 'PrefixI 'True) (S1 ('MetaSel ('Just "lca") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Just "alice") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b) :*: S1 ('MetaSel ('Just "bob") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b)))) | |||||
An updated thing.
Instances
| (NFData a, NFData b) => NFData (GUpdated a b) Source # | |||||
Defined in Unison.Merge.Updated | |||||
| Generic (GUpdated a b) Source # | |||||
Defined in Unison.Merge.Updated Associated Types
| |||||
| (Show a, Show b) => Show (GUpdated a b) Source # | |||||
| type Rep (GUpdated a b) Source # | |||||
Defined in Unison.Merge.Updated type Rep (GUpdated a b) = D1 ('MetaData "GUpdated" "Unison.Merge.Updated" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "Updated" 'PrefixI 'True) (S1 ('MetaSel ('Just "old") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "new") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) | |||||
data LibdepDiffOp a Source #
Constructors
| AddLibdep !a | |
| AddBothLibdeps !a !a | |
| DeleteLibdep |
A "rename" is a venn partition of two non-empty sets of names: both set differences and the set intersection.
Invariant: the sets are all disjoint Invariant: it is not the case that adds and deletes are both empty
data SimpleRenames Source #
A "simple" rename is one that moves one name to another, where neither the before- nor after-name have any aliases.
A small utility type that represents a syntactic-hashed thing.
The synhash itself is a lazy field so that we can avoid computing it in certain cases, just using laziness.
Instances
| Functor Synhashed Source # | |||||
| Generic (Synhashed a) Source # | |||||
Defined in Unison.Merge.Synhashed Associated Types
| |||||
| Show a => Show (Synhashed a) Source # | |||||
| Eq (Synhashed a) Source # | |||||
| Ord (Synhashed a) Source # | |||||
Defined in Unison.Merge.Synhashed | |||||
| type Rep (Synhashed a) Source # | |||||
Defined in Unison.Merge.Synhashed type Rep (Synhashed a) = D1 ('MetaData "Synhashed" "Unison.Merge.Synhashed" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "Synhashed" 'PrefixI 'True) (S1 ('MetaSel ('Just "hash") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Hash) :*: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a))) | |||||
Instances
| Applicative ThreeWay Source # | |||||
| Functor ThreeWay Source # | |||||
| Foldable ThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods fold :: Monoid m => ThreeWay m -> m # foldMap :: Monoid m => (a -> m) -> ThreeWay a -> m # foldMap' :: Monoid m => (a -> m) -> ThreeWay a -> m # foldr :: (a -> b -> b) -> b -> ThreeWay a -> b # foldr' :: (a -> b -> b) -> b -> ThreeWay a -> b # foldl :: (b -> a -> b) -> b -> ThreeWay a -> b # foldl' :: (b -> a -> b) -> b -> ThreeWay a -> b # foldr1 :: (a -> a -> a) -> ThreeWay a -> a # foldl1 :: (a -> a -> a) -> ThreeWay a -> a # elem :: Eq a => a -> ThreeWay a -> Bool # maximum :: Ord a => ThreeWay a -> a # minimum :: Ord a => ThreeWay a -> a # | |||||
| Traversable ThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types | |||||
| Semialign ThreeWay Source # | |||||
| Unzip ThreeWay Source # | |||||
| Zip ThreeWay Source # | |||||
| Generic (ThreeWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types Associated Types
| |||||
| type Rep (ThreeWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types type Rep (ThreeWay a) = D1 ('MetaData "ThreeWay" "Unison.Merge.Internal.Types" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "ThreeWay" 'PrefixI 'True) (S1 ('MetaSel ('Just "lca") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: (S1 ('MetaSel ('Just "alice") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Just "bob") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))) | |||||
data TwoOrThreeWay a Source #
Constructors
| TwoOrThreeWay | |
Instances
| Applicative TwoOrThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods pure :: a -> TwoOrThreeWay a # (<*>) :: TwoOrThreeWay (a -> b) -> TwoOrThreeWay a -> TwoOrThreeWay b # liftA2 :: (a -> b -> c) -> TwoOrThreeWay a -> TwoOrThreeWay b -> TwoOrThreeWay c # (*>) :: TwoOrThreeWay a -> TwoOrThreeWay b -> TwoOrThreeWay b # (<*) :: TwoOrThreeWay a -> TwoOrThreeWay b -> TwoOrThreeWay a # | |||||
| Functor TwoOrThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods fmap :: (a -> b) -> TwoOrThreeWay a -> TwoOrThreeWay b # (<$) :: a -> TwoOrThreeWay b -> TwoOrThreeWay a # | |||||
| Foldable TwoOrThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods fold :: Monoid m => TwoOrThreeWay m -> m # foldMap :: Monoid m => (a -> m) -> TwoOrThreeWay a -> m # foldMap' :: Monoid m => (a -> m) -> TwoOrThreeWay a -> m # foldr :: (a -> b -> b) -> b -> TwoOrThreeWay a -> b # foldr' :: (a -> b -> b) -> b -> TwoOrThreeWay a -> b # foldl :: (b -> a -> b) -> b -> TwoOrThreeWay a -> b # foldl' :: (b -> a -> b) -> b -> TwoOrThreeWay a -> b # foldr1 :: (a -> a -> a) -> TwoOrThreeWay a -> a # foldl1 :: (a -> a -> a) -> TwoOrThreeWay a -> a # toList :: TwoOrThreeWay a -> [a] # null :: TwoOrThreeWay a -> Bool # length :: TwoOrThreeWay a -> Int # elem :: Eq a => a -> TwoOrThreeWay a -> Bool # maximum :: Ord a => TwoOrThreeWay a -> a # minimum :: Ord a => TwoOrThreeWay a -> a # sum :: Num a => TwoOrThreeWay a -> a # product :: Num a => TwoOrThreeWay a -> a # | |||||
| Traversable TwoOrThreeWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods traverse :: Applicative f => (a -> f b) -> TwoOrThreeWay a -> f (TwoOrThreeWay b) # sequenceA :: Applicative f => TwoOrThreeWay (f a) -> f (TwoOrThreeWay a) # mapM :: Monad m => (a -> m b) -> TwoOrThreeWay a -> m (TwoOrThreeWay b) # sequence :: Monad m => TwoOrThreeWay (m a) -> m (TwoOrThreeWay a) # | |||||
| Generic (TwoOrThreeWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types Associated Types
Methods from :: TwoOrThreeWay a -> Rep (TwoOrThreeWay a) x # to :: Rep (TwoOrThreeWay a) x -> TwoOrThreeWay a # | |||||
| type Rep (TwoOrThreeWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types type Rep (TwoOrThreeWay a) = D1 ('MetaData "TwoOrThreeWay" "Unison.Merge.Internal.Types" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "TwoOrThreeWay" 'PrefixI 'True) (S1 ('MetaSel ('Just "lca") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe a)) :*: (S1 ('MetaSel ('Just "alice") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "bob") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) | |||||
Instances
| Applicative TwoWay Source # | |||||
| Functor TwoWay Source # | |||||
| Foldable TwoWay Source # | |||||
Defined in Unison.Merge.Internal.Types Methods fold :: Monoid m => TwoWay m -> m # foldMap :: Monoid m => (a -> m) -> TwoWay a -> m # foldMap' :: Monoid m => (a -> m) -> TwoWay a -> m # foldr :: (a -> b -> b) -> b -> TwoWay a -> b # foldr' :: (a -> b -> b) -> b -> TwoWay a -> b # foldl :: (b -> a -> b) -> b -> TwoWay a -> b # foldl' :: (b -> a -> b) -> b -> TwoWay a -> b # foldr1 :: (a -> a -> a) -> TwoWay a -> a # foldl1 :: (a -> a -> a) -> TwoWay a -> a # elem :: Eq a => a -> TwoWay a -> Bool # maximum :: Ord a => TwoWay a -> a # minimum :: Ord a => TwoWay a -> a # | |||||
| Traversable TwoWay Source # | |||||
| Semialign TwoWay Source # | |||||
| Unzip TwoWay Source # | |||||
| Zip TwoWay Source # | |||||
| NFData a => NFData (TwoWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types | |||||
| Monoid a => Monoid (TwoWay a) Source # | |||||
| Semigroup a => Semigroup (TwoWay a) Source # | |||||
| Generic (TwoWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types Associated Types
| |||||
| Show a => Show (TwoWay a) Source # | |||||
| type Rep (TwoWay a) Source # | |||||
Defined in Unison.Merge.Internal.Types type Rep (TwoWay a) = D1 ('MetaData "TwoWay" "Unison.Merge.Internal.Types" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "TwoWay" 'PrefixI 'True) (S1 ('MetaSel ('Just "alice") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "bob") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) | |||||
"Two-way inclusive".
Instances
| Applicative TwoWayI Source # | |||||
| Functor TwoWayI Source # | |||||
| Foldable TwoWayI Source # | |||||
Defined in Unison.Merge.TwoWayI Methods fold :: Monoid m => TwoWayI m -> m # foldMap :: Monoid m => (a -> m) -> TwoWayI a -> m # foldMap' :: Monoid m => (a -> m) -> TwoWayI a -> m # foldr :: (a -> b -> b) -> b -> TwoWayI a -> b # foldr' :: (a -> b -> b) -> b -> TwoWayI a -> b # foldl :: (b -> a -> b) -> b -> TwoWayI a -> b # foldl' :: (b -> a -> b) -> b -> TwoWayI a -> b # foldr1 :: (a -> a -> a) -> TwoWayI a -> a # foldl1 :: (a -> a -> a) -> TwoWayI a -> a # elem :: Eq a => a -> TwoWayI a -> Bool # maximum :: Ord a => TwoWayI a -> a # minimum :: Ord a => TwoWayI a -> a # | |||||
| Semialign TwoWayI Source # | |||||
| Zip TwoWayI Source # | |||||
| Monoid a => Monoid (TwoWayI a) Source # | |||||
| Semigroup a => Semigroup (TwoWayI a) Source # | |||||
| Generic (TwoWayI a) Source # | |||||
Defined in Unison.Merge.TwoWayI Associated Types
| |||||
| type Rep (TwoWayI a) Source # | |||||
Defined in Unison.Merge.TwoWayI type Rep (TwoWayI a) = D1 ('MetaData "TwoWayI" "Unison.Merge.TwoWayI" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" 'False) (C1 ('MetaCons "TwoWayI" 'PrefixI 'True) (S1 ('MetaSel ('Just "alice") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Just "bob") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "both") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) | |||||
data Unconflicts v Source #
Constructors
| Unconflicts | |
Instances
| Functor Unconflicts Source # | |||||
Defined in Unison.Merge.Unconflicts Methods fmap :: (a -> b) -> Unconflicts a -> Unconflicts b # (<$) :: a -> Unconflicts b -> Unconflicts a # | |||||
| Foldable Unconflicts Source # | |||||
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 # | |||||
| Generic (Unconflicts v) Source # | |||||
Defined in Unison.Merge.Unconflicts Associated Types
Methods from :: Unconflicts v -> Rep (Unconflicts v) x # to :: Rep (Unconflicts v) x -> Unconflicts v # | |||||
| type Rep (Unconflicts v) Source # | |||||
Defined in Unison.Merge.Unconflicts type Rep (Unconflicts v) = D1 ('MetaData "Unconflicts" "Unison.Merge.Unconflicts" "unison-merge-0.0.0-GSvoCsyhOYv85493H4kvpC" '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)))))) | |||||