| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Unison.Merge.Rename
Synopsis
- data Rename = Rename {}
- makeRenames :: Updated (Defns (BiMultimap (Synhashed Referent) Name) (BiMultimap (Synhashed TypeReference) Name)) -> DefnsF List Rename Rename
- data SimpleRenames = SimpleRenames {}
- makeSimpleRenames :: DefnsF List Rename Rename -> Defns SimpleRenames SimpleRenames
Documentation
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
makeRenames :: Updated (Defns (BiMultimap (Synhashed Referent) Name) (BiMultimap (Synhashed TypeReference) Name)) -> DefnsF List Rename Rename Source #
data SimpleRenames Source #
A "simple" rename is one that moves one name to another, where neither the before- nor after-name have any aliases.