- File:
-
- 1 edited
-
src/ResolvExpr/ResolveAssertions.cc (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/ResolvExpr/ResolveAssertions.cc
r2fb35df raca6a54c 277 277 const DeclarationWithType * candidate = cdata.id; 278 278 279 // ignore deleted candidates. 280 // NOTE: this behavior is different from main resolver. 281 // further investigations might be needed to determine 282 // if we should implement the same rule here 283 // (i.e. error if unique best match is deleted) 284 if (candidate->isDeleted) continue; 285 286 // build independent unification context. for candidate 279 // build independent unification context for candidate 287 280 AssertionSet have, newNeed; 288 281 TypeEnvironment newEnv{ resn.alt.env }; … … 397 390 398 391 /// Limit to depth of recursion of assertion satisfaction 399 static const int recursionLimit = 4;392 static const int recursionLimit = 7; 400 393 /// Maximum number of simultaneously-deferred assertions to attempt concurrent satisfaction of 401 394 static const int deferLimit = 10;
Note:
See TracChangeset
for help on using the changeset viewer.