@@ -1499,11 +1499,11 @@ void ConstraintSystem::shrink(Expr *expr) {
1499
1499
if (auto dictionaryExpr = dyn_cast<DictionaryExpr>(expr)) {
1500
1500
bool isPrimaryExpr = expr == PrimaryExpr;
1501
1501
for (auto element : dictionaryExpr->getElements ()) {
1502
- unsigned numOverlaods = 0 ;
1503
- element->walk (OverloadSetCounter (numOverlaods ));
1502
+ unsigned numOverloads = 0 ;
1503
+ element->walk (OverloadSetCounter (numOverloads ));
1504
1504
1505
1505
// There are no overload sets in the element; skip it.
1506
- if (numOverlaods == 0 )
1506
+ if (numOverloads == 0 )
1507
1507
continue ;
1508
1508
1509
1509
// FIXME: Could we avoid creating a separate dictionary expression
@@ -1592,7 +1592,7 @@ void ConstraintSystem::shrink(Expr *expr) {
1592
1592
1593
1593
// If there are fewer than two overloads in the chain
1594
1594
// there is no point of solving this expression,
1595
- // because we won't be able to reduce it's domain.
1595
+ // because we won't be able to reduce its domain.
1596
1596
if (numOverloadSets > 1 )
1597
1597
SubExprs.push (Candidate (CS, expr, expr == PrimaryExpr));
1598
1598
@@ -1643,7 +1643,7 @@ ConstraintSystem::solve(Expr *&expr,
1643
1643
assert (!solverState && " use solveRec for recursive calls" );
1644
1644
1645
1645
// Try to shrink the system by reducing disjunction domains. This
1646
- // goes through every sub-expression and generate it's own sub-system, to
1646
+ // goes through every sub-expression and generate its own sub-system, to
1647
1647
// try to reduce the domains of those subexpressions.
1648
1648
shrink (expr);
1649
1649
0 commit comments