Safe Haskell	Safe-Inferred
Language	Haskell2010

U.Codebase.Branch.Diff

Synopsis

newtype TreeDiff m = TreeDiff {
- unTreeDiff :: Cofree (Compose (Map NameSegment) m) DefinitionDiffs
}
hoistTreeDiff :: Functor m => (forall x. m x -> n x) -> TreeDiff m -> TreeDiff n
data NameChanges = NameChanges {
- termNameAdds :: [(Name, Referent)]
- termNameRemovals :: [(Name, Referent)]
- typeNameAdds :: [(Name, Reference)]
- typeNameRemovals :: [(Name, Reference)]
}
data DefinitionDiffs = DefinitionDiffs {
- termDiffs :: Map NameSegment (Diff Referent)
- typeDiffs :: Map NameSegment (Diff Reference)
}
data Diff a = Diff {
- adds :: Set a
- removals :: Set a
}
data NameBasedDiff = NameBasedDiff {
- terms :: Relation Reference Reference
- types :: Relation Reference Reference
}
diffBranches :: Branch Transaction -> Branch Transaction -> Transaction (TreeDiff Transaction)
allNameChanges :: Monad m => Maybe Name -> TreeDiff m -> m NameChanges
nameBasedDiff :: Monad m => TreeDiff m -> m NameBasedDiff
streamNameChanges :: (Monad m, Monoid r) => Maybe Name -> TreeDiff m -> (Maybe Name -> NameChanges -> m r) -> m r

Documentation

newtype TreeDiff m Source #

A tree of local diffs. Each node of the tree contains the definition diffs at that path.

Constructors

TreeDiff
Fields unTreeDiff :: Cofree (Compose (Map NameSegment) m) DefinitionDiffs

Instances

Instances details

Applicative m => Monoid (TreeDiff m) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods mempty :: TreeDiff m # mappend :: TreeDiff m -> TreeDiff m -> TreeDiff m # mconcat :: [TreeDiff m] -> TreeDiff m #
Applicative m => Semigroup (TreeDiff m) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (<>) :: TreeDiff m -> TreeDiff m -> TreeDiff m # sconcat :: NonEmpty (TreeDiff m) -> TreeDiff m # stimes :: Integral b => b -> TreeDiff m -> TreeDiff m #
Show1 m => Show (TreeDiff m) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods showsPrec :: Int -> TreeDiff m -> ShowS # show :: TreeDiff m -> String # showList :: [TreeDiff m] -> ShowS #
Eq1 m => Eq (TreeDiff m) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (==) :: TreeDiff m -> TreeDiff m -> Bool # (/=) :: TreeDiff m -> TreeDiff m -> Bool #
Ord1 m => Ord (TreeDiff m) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods compare :: TreeDiff m -> TreeDiff m -> Ordering # (<) :: TreeDiff m -> TreeDiff m -> Bool # (<=) :: TreeDiff m -> TreeDiff m -> Bool # (>) :: TreeDiff m -> TreeDiff m -> Bool # (>=) :: TreeDiff m -> TreeDiff m -> Bool # max :: TreeDiff m -> TreeDiff m -> TreeDiff m # min :: TreeDiff m -> TreeDiff m -> TreeDiff m #

hoistTreeDiff :: Functor m => (forall x. m x -> n x) -> TreeDiff m -> TreeDiff n Source #

data NameChanges Source #

A summary of a TreeDiff, containing all names added and removed. Note that there isn't a clear notion of a name "changing" since conflicts might muddy the notion by having multiple copies of both the from and to names, so we just talk about adds and removals instead.

Constructors

NameChanges
Fields termNameAdds :: [(Name, Referent)] termNameRemovals :: [(Name, Referent)] typeNameAdds :: [(Name, Reference)] typeNameRemovals :: [(Name, Reference)]

Instances

Instances details

Monoid NameChanges Source #
Instance details Defined in U.Codebase.Branch.Diff Methods mempty :: NameChanges # mappend :: NameChanges -> NameChanges -> NameChanges # mconcat :: [NameChanges] -> NameChanges #
Semigroup NameChanges Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (<>) :: NameChanges -> NameChanges -> NameChanges # sconcat :: NonEmpty NameChanges -> NameChanges # stimes :: Integral b => b -> NameChanges -> NameChanges #
Show NameChanges Source #
Instance details Defined in U.Codebase.Branch.Diff Methods showsPrec :: Int -> NameChanges -> ShowS # show :: NameChanges -> String # showList :: [NameChanges] -> ShowS #
Eq NameChanges Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (==) :: NameChanges -> NameChanges -> Bool # (/=) :: NameChanges -> NameChanges -> Bool #

data DefinitionDiffs Source #

Represents the changes to definitions at a given path, not including child paths.

Note: doesn't yet include any info on patch diffs. Feel free to add it.

Constructors

DefinitionDiffs
Fields termDiffs :: Map NameSegment (Diff Referent) typeDiffs :: Map NameSegment (Diff Reference)

Instances

Instances details

Monoid DefinitionDiffs Source #
Instance details Defined in U.Codebase.Branch.Diff Methods mempty :: DefinitionDiffs # mappend :: DefinitionDiffs -> DefinitionDiffs -> DefinitionDiffs # mconcat :: [DefinitionDiffs] -> DefinitionDiffs #
Semigroup DefinitionDiffs Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (<>) :: DefinitionDiffs -> DefinitionDiffs -> DefinitionDiffs # sconcat :: NonEmpty DefinitionDiffs -> DefinitionDiffs # stimes :: Integral b => b -> DefinitionDiffs -> DefinitionDiffs #
Show DefinitionDiffs Source #
Instance details Defined in U.Codebase.Branch.Diff Methods showsPrec :: Int -> DefinitionDiffs -> ShowS # show :: DefinitionDiffs -> String # showList :: [DefinitionDiffs] -> ShowS #
Eq DefinitionDiffs Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (==) :: DefinitionDiffs -> DefinitionDiffs -> Bool # (/=) :: DefinitionDiffs -> DefinitionDiffs -> Bool #
Ord DefinitionDiffs Source #
Instance details Defined in U.Codebase.Branch.Diff Methods compare :: DefinitionDiffs -> DefinitionDiffs -> Ordering # (<) :: DefinitionDiffs -> DefinitionDiffs -> Bool # (<=) :: DefinitionDiffs -> DefinitionDiffs -> Bool # (>) :: DefinitionDiffs -> DefinitionDiffs -> Bool # (>=) :: DefinitionDiffs -> DefinitionDiffs -> Bool # max :: DefinitionDiffs -> DefinitionDiffs -> DefinitionDiffs # min :: DefinitionDiffs -> DefinitionDiffs -> DefinitionDiffs #

data Diff a Source #

Constructors

Diff
Fields adds :: Set a removals :: Set a

Instances

Instances details

Show a => Show (Diff a) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods showsPrec :: Int -> Diff a -> ShowS # show :: Diff a -> String # showList :: [Diff a] -> ShowS #
Eq a => Eq (Diff a) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (==) :: Diff a -> Diff a -> Bool # (/=) :: Diff a -> Diff a -> Bool #
Ord a => Ord (Diff a) Source #
Instance details Defined in U.Codebase.Branch.Diff Methods compare :: Diff a -> Diff a -> Ordering # (<) :: Diff a -> Diff a -> Bool # (<=) :: Diff a -> Diff a -> Bool # (>) :: Diff a -> Diff a -> Bool # (>=) :: Diff a -> Diff a -> Bool # max :: Diff a -> Diff a -> Diff a # min :: Diff a -> Diff a -> Diff a #

data NameBasedDiff Source #

A name-based diff for namespaces N1 and N2 is (for both terms and types) a relation between references, where `a R b` if:

a has name n in N1, and b has the same name n in N2
a != b

Constructors

NameBasedDiff
Fields terms :: Relation Reference Reference types :: Relation Reference Reference

Instances

Instances details

Monoid NameBasedDiff Source #
Instance details Defined in U.Codebase.Branch.Diff Methods mempty :: NameBasedDiff # mappend :: NameBasedDiff -> NameBasedDiff -> NameBasedDiff # mconcat :: [NameBasedDiff] -> NameBasedDiff #
Semigroup NameBasedDiff Source #
Instance details Defined in U.Codebase.Branch.Diff Methods (<>) :: NameBasedDiff -> NameBasedDiff -> NameBasedDiff # sconcat :: NonEmpty NameBasedDiff -> NameBasedDiff # stimes :: Integral b => b -> NameBasedDiff -> NameBasedDiff #
Generic NameBasedDiff Source #
Instance details Defined in U.Codebase.Branch.Diff Associated Types type Rep NameBasedDiff :: Type -> Type # Methods from :: NameBasedDiff -> Rep NameBasedDiff x # to :: Rep NameBasedDiff x -> NameBasedDiff #
Show NameBasedDiff Source #
Instance details Defined in U.Codebase.Branch.Diff Methods showsPrec :: Int -> NameBasedDiff -> ShowS # show :: NameBasedDiff -> String # showList :: [NameBasedDiff] -> ShowS #
type Rep NameBasedDiff Source #
Instance details Defined in U.Codebase.Branch.Diff type Rep NameBasedDiff = D1 ('MetaData "NameBasedDiff" "U.Codebase.Branch.Diff" "unison-parser-typechecker-0.0.0-KNkVGbTXlis2lnVjsRIJUx" 'False) (C1 ('MetaCons "NameBasedDiff" 'PrefixI 'True) (S1 ('MetaSel ('Just "terms") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Relation Reference Reference)) :*: S1 ('MetaSel ('Just "types") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Relation Reference Reference))))

diffBranches :: Branch Transaction -> Branch Transaction -> Transaction (TreeDiff Transaction) Source #

Diff two Branches, returning a tree containing all of the changes

allNameChanges :: Monad m => Maybe Name -> TreeDiff m -> m NameChanges Source #

Get a summary of all of the name adds and removals from a tree diff.

The provided name will be prepended to all names in the output diff, and can be useful if diffing branches at a specific sub-tree, but you can pass Nothing if you're diffing from the root.

nameBasedDiff :: Monad m => TreeDiff m -> m NameBasedDiff Source #

Get a NameBasedDiff from a TreeDiff.

streamNameChanges :: (Monad m, Monoid r) => Maybe Name -> TreeDiff m -> (Maybe Name -> NameChanges -> m r) -> m r Source #

Stream a summary of all of the name adds and removals from a tree diff. Callback is passed the diff from one namespace level at a time, with the name representing that location. Accumulator is folded strictly, use () if you don't need one.