diff options
Diffstat (limited to 'crates/hir_ty/src/diagnostics')
| -rw-r--r-- | crates/hir_ty/src/diagnostics/expr.rs | 4 | ||||
| -rw-r--r-- | crates/hir_ty/src/diagnostics/match_check.rs | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/crates/hir_ty/src/diagnostics/expr.rs b/crates/hir_ty/src/diagnostics/expr.rs index a1c484fdf..107417c27 100644 --- a/crates/hir_ty/src/diagnostics/expr.rs +++ b/crates/hir_ty/src/diagnostics/expr.rs | |||
| @@ -379,7 +379,7 @@ pub fn record_literal_missing_fields( | |||
| 379 | id: ExprId, | 379 | id: ExprId, |
| 380 | expr: &Expr, | 380 | expr: &Expr, |
| 381 | ) -> Option<(VariantId, Vec<LocalFieldId>, /*exhaustive*/ bool)> { | 381 | ) -> Option<(VariantId, Vec<LocalFieldId>, /*exhaustive*/ bool)> { |
| 382 | let (fields, exhausitve) = match expr { | 382 | let (fields, exhaustive) = match expr { |
| 383 | Expr::RecordLit { path: _, fields, spread } => (fields, spread.is_none()), | 383 | Expr::RecordLit { path: _, fields, spread } => (fields, spread.is_none()), |
| 384 | _ => return None, | 384 | _ => return None, |
| 385 | }; | 385 | }; |
| @@ -400,7 +400,7 @@ pub fn record_literal_missing_fields( | |||
| 400 | if missed_fields.is_empty() { | 400 | if missed_fields.is_empty() { |
| 401 | return None; | 401 | return None; |
| 402 | } | 402 | } |
| 403 | Some((variant_def, missed_fields, exhausitve)) | 403 | Some((variant_def, missed_fields, exhaustive)) |
| 404 | } | 404 | } |
| 405 | 405 | ||
| 406 | pub fn record_pattern_missing_fields( | 406 | pub fn record_pattern_missing_fields( |
diff --git a/crates/hir_ty/src/diagnostics/match_check.rs b/crates/hir_ty/src/diagnostics/match_check.rs index 62c329731..61c47eec8 100644 --- a/crates/hir_ty/src/diagnostics/match_check.rs +++ b/crates/hir_ty/src/diagnostics/match_check.rs | |||
| @@ -14,7 +14,7 @@ | |||
| 14 | //! The algorithm implemented here is a modified version of the one described in | 14 | //! The algorithm implemented here is a modified version of the one described in |
| 15 | //! <http://moscova.inria.fr/~maranget/papers/warn/index.html>. | 15 | //! <http://moscova.inria.fr/~maranget/papers/warn/index.html>. |
| 16 | //! However, to save future implementors from reading the original paper, we | 16 | //! However, to save future implementors from reading the original paper, we |
| 17 | //! summarise the algorithm here to hopefully save time and be a little clearer | 17 | //! summarize the algorithm here to hopefully save time and be a little clearer |
| 18 | //! (without being so rigorous). | 18 | //! (without being so rigorous). |
| 19 | //! | 19 | //! |
| 20 | //! The core of the algorithm revolves about a "usefulness" check. In particular, we | 20 | //! The core of the algorithm revolves about a "usefulness" check. In particular, we |
| @@ -132,7 +132,7 @@ | |||
| 132 | //! The algorithm is inductive (on the number of columns: i.e., components of tuple patterns). | 132 | //! The algorithm is inductive (on the number of columns: i.e., components of tuple patterns). |
| 133 | //! That means we're going to check the components from left-to-right, so the algorithm | 133 | //! That means we're going to check the components from left-to-right, so the algorithm |
| 134 | //! operates principally on the first component of the matrix and new pattern-stack `p`. | 134 | //! operates principally on the first component of the matrix and new pattern-stack `p`. |
| 135 | //! This algorithm is realised in the `is_useful` function. | 135 | //! This algorithm is realized in the `is_useful` function. |
| 136 | //! | 136 | //! |
| 137 | //! Base case (`n = 0`, i.e., an empty tuple pattern): | 137 | //! Base case (`n = 0`, i.e., an empty tuple pattern): |
| 138 | //! - If `P` already contains an empty pattern (i.e., if the number of patterns `m > 0`), then | 138 | //! - If `P` already contains an empty pattern (i.e., if the number of patterns `m > 0`), then |