unisonweb/unison
1
0
Fork 0
mirror of https://github.com/unisonweb/unison.git synced 2024-09-22 07:48:10 +03:00
Code Issues Projects Releases Wiki Activity

deleted some old comments

Browse Source
This commit is contained in:
Arya Irani 2020-08-10 11:18:26 -04:00
parent d0c2fed081
commit a425ca299d
1 changed files with 0 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
unison-core/src/Unison/Pattern.hs
View File

@ -15,22 +15,6 @@ import Unison.LabeledDependency (LabeledDependency)
type ConstructorId = Int
-- Pattern -> Pattern loc
-- Or, `data Pattern` becomes `data PatternP loc`,
-- and introduce `type Pattern = PatternP ()`
-- To have this refactoring break a minimum of stuff:
--
-- Need backwards compat Pattern type
-- Need backwards compat patterns (ignore the `loc` parameter)
-- Need backwards compat constructors (that specialize `loc` to `()`)
-- For the new typechecker and parser, they should import the module PatternP, which
-- will go away after refactoring but which will have the alias:
-- type Pattern loc = Pattern.PatternP loc
-- pattern Var loc = VarP loc
-- etc
-- pattern Var = VarP ()
data Pattern loc
= Unbound loc
| Var loc
@ -144,11 +128,6 @@ foldMap' f p = case p of
SequenceLiteral _ ps -> f p <> foldMap (foldMap' f) ps
SequenceOp _ p1 _ p2 -> f p <> foldMap' f p1 <> foldMap' f p2
-- idea: rename Pattern to PatternP0
-- newtype Pattern loc = Pattern (PatternP0 loc)
-- instance Eq (Pattern loc) where
-- (Pattern p) == (Pattern p2) = void p == void p2
generalizedDependencies
:: Ord r
=> (Reference -> r)