language-servers/roc
1
0
Fork 0
mirror of https://github.com/roc-lang/roc.git synced 2025-11-02 05:48:17 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 6

s/rtfeldman/roc-lang/g in links to GitHub repos

Browse source
This commit is contained in:
Richard Feldman 2022-08-12 15:24:09 -04:00
parent af8a81de9f
commit 97e2900bf5
No known key found for this signature in database
GPG key ID: F1F21AA5B1D9E43B
84 changed files with 174 additions and 174 deletions
Download patch file Download diff file Expand all files Collapse all files

2
crates/compiler/unify/src/lib.rs
View file

@ -1,5 +1,5 @@
#![warn(clippy::dbg_macro)]
// See github.com/rtfeldman/roc/issues/800 for discussion of the large_enum_variant check.
// See github.com/roc-lang/roc/issues/800 for discussion of the large_enum_variant check.
#![allow(clippy::large_enum_variant)]
pub mod unify;

4
crates/compiler/unify/src/unify.rs
View file

@ -1005,7 +1005,7 @@ fn unify_lambda_set<M: MetaCollector>(
FlexVar(_) => {
if M::UNIFYING_SPECIALIZATION {
// TODO: It appears that this can happen in well-typed, reasonable programs, but it's
// open question as to why! See also https://github.com/rtfeldman/roc/issues/3163.
// open question as to why! See also https://github.com/roc-lang/roc/issues/3163.
let zero_lambda_set = LambdaSet {
solved: UnionLabels::default(),
recursion_var: OptVariable::NONE,
@ -1209,7 +1209,7 @@ fn separate_union_lambdas<M: MetaCollector>(
// Lambda sets are effectively tags under another name, and their usage can also result
// in the arguments of a lambda name being recursive. It very well may happen that
// during unification, a lambda set previously marked as not recursive becomes
// recursive. See the docs of [LambdaSet] for one example, or https://github.com/rtfeldman/roc/pull/2307.
// recursive. See the docs of [LambdaSet] for one example, or https://github.com/roc-lang/roc/pull/2307.
//
// Like with tag unions, if it has, we'll always pass through this branch. So, take
// this opportunity to promote the lambda set to recursive if need be.