Rollup merge of #110417 - jsoref:spelling-compiler, r=Nilstrieb
Spelling compiler This is per https://github.com/rust-lang/rust/pull/110392#issuecomment-1510193656 I'm going to delay performing a squash because I really don't expect people to be perfectly happy w/ my changes, I really am a human and I really do make mistakes. r? Nilstrieb I'm going to be flying this evening, but I should be able to squash / respond to reviews w/in a day or two. I tried to be careful about dropping changes to `tests`, afaict only two files had changes that were likely related to the changes for a given commit (this is where not having eagerly squashed should have given me an advantage), but, that said, picking things apart can be error prone.
This commit is contained in:
commit
aa87addfb3
101 changed files with 159 additions and 159 deletions
|
@ -80,7 +80,7 @@ infer_subtype = ...so that the {$requirement ->
|
|||
[no_else] `if` missing an `else` returns `()`
|
||||
[fn_main_correct_type] `main` function has the correct type
|
||||
[fn_start_correct_type] `#[start]` function has the correct type
|
||||
[intristic_correct_type] intrinsic has the correct type
|
||||
[intrinsic_correct_type] intrinsic has the correct type
|
||||
[method_correct_type] method receiver has the correct type
|
||||
*[other] types are compatible
|
||||
}
|
||||
|
@ -93,7 +93,7 @@ infer_subtype_2 = ...so that {$requirement ->
|
|||
[no_else] `if` missing an `else` returns `()`
|
||||
[fn_main_correct_type] `main` function has the correct type
|
||||
[fn_start_correct_type] `#[start]` function has the correct type
|
||||
[intristic_correct_type] intrinsic has the correct type
|
||||
[intrinsic_correct_type] intrinsic has the correct type
|
||||
[method_correct_type] method receiver has the correct type
|
||||
*[other] types are compatible
|
||||
}
|
||||
|
@ -341,8 +341,8 @@ infer_await_note = calling an async function returns a future
|
|||
|
||||
infer_prlf_defined_with_sub = the lifetime `{$sub_symbol}` defined here...
|
||||
infer_prlf_defined_without_sub = the lifetime defined here...
|
||||
infer_prlf_must_oultive_with_sup = ...must outlive the lifetime `{$sup_symbol}` defined here
|
||||
infer_prlf_must_oultive_without_sup = ...must outlive the lifetime defined here
|
||||
infer_prlf_must_outlive_with_sup = ...must outlive the lifetime `{$sup_symbol}` defined here
|
||||
infer_prlf_must_outlive_without_sup = ...must outlive the lifetime defined here
|
||||
infer_prlf_known_limitation = this is a known limitation that will be removed in the future (see issue #100013 <https://github.com/rust-lang/rust/issues/100013> for more information)
|
||||
|
||||
infer_opaque_captures_lifetime = hidden type for `{$opaque_ty}` captures lifetime that does not appear in bounds
|
||||
|
@ -380,7 +380,7 @@ infer_oc_no_else = `if` may be missing an `else` clause
|
|||
infer_oc_no_diverge = `else` clause of `let...else` does not diverge
|
||||
infer_oc_fn_main_correct_type = `main` function has wrong type
|
||||
infer_oc_fn_start_correct_type = `#[start]` function has wrong type
|
||||
infer_oc_intristic_correct_type = intrinsic has wrong type
|
||||
infer_oc_intrinsic_correct_type = intrinsic has wrong type
|
||||
infer_oc_method_correct_type = mismatched `self` parameter type
|
||||
infer_oc_closure_selfref = closure/generator type that references itself
|
||||
infer_oc_cant_coerce = cannot coerce intrinsics to function pointers
|
||||
|
|
|
@ -71,7 +71,7 @@ pub struct AmbiguousImpl<'a> {
|
|||
// Copy of `AnnotationRequired` for E0284
|
||||
#[derive(Diagnostic)]
|
||||
#[diag(infer_type_annotations_needed, code = "E0284")]
|
||||
pub struct AmbigousReturn<'a> {
|
||||
pub struct AmbiguousReturn<'a> {
|
||||
#[primary_span]
|
||||
pub span: Span,
|
||||
pub source_kind: &'static str,
|
||||
|
@ -1085,7 +1085,7 @@ pub enum PlaceholderRelationLfNotSatisfied {
|
|||
span: Span,
|
||||
#[note(infer_prlf_defined_with_sub)]
|
||||
sub_span: Span,
|
||||
#[note(infer_prlf_must_oultive_with_sup)]
|
||||
#[note(infer_prlf_must_outlive_with_sup)]
|
||||
sup_span: Span,
|
||||
sub_symbol: Symbol,
|
||||
sup_symbol: Symbol,
|
||||
|
@ -1098,7 +1098,7 @@ pub enum PlaceholderRelationLfNotSatisfied {
|
|||
span: Span,
|
||||
#[note(infer_prlf_defined_with_sub)]
|
||||
sub_span: Span,
|
||||
#[note(infer_prlf_must_oultive_without_sup)]
|
||||
#[note(infer_prlf_must_outlive_without_sup)]
|
||||
sup_span: Span,
|
||||
sub_symbol: Symbol,
|
||||
#[note(infer_prlf_known_limitation)]
|
||||
|
@ -1110,7 +1110,7 @@ pub enum PlaceholderRelationLfNotSatisfied {
|
|||
span: Span,
|
||||
#[note(infer_prlf_defined_without_sub)]
|
||||
sub_span: Span,
|
||||
#[note(infer_prlf_must_oultive_with_sup)]
|
||||
#[note(infer_prlf_must_outlive_with_sup)]
|
||||
sup_span: Span,
|
||||
sup_symbol: Symbol,
|
||||
#[note(infer_prlf_known_limitation)]
|
||||
|
@ -1122,7 +1122,7 @@ pub enum PlaceholderRelationLfNotSatisfied {
|
|||
span: Span,
|
||||
#[note(infer_prlf_defined_without_sub)]
|
||||
sub_span: Span,
|
||||
#[note(infer_prlf_must_oultive_without_sup)]
|
||||
#[note(infer_prlf_must_outlive_without_sup)]
|
||||
sup_span: Span,
|
||||
#[note(infer_prlf_known_limitation)]
|
||||
note: (),
|
||||
|
@ -1488,8 +1488,8 @@ pub enum ObligationCauseFailureCode {
|
|||
#[subdiagnostic]
|
||||
subdiags: Vec<TypeErrorAdditionalDiags>,
|
||||
},
|
||||
#[diag(infer_oc_intristic_correct_type, code = "E0308")]
|
||||
IntristicCorrectType {
|
||||
#[diag(infer_oc_intrinsic_correct_type, code = "E0308")]
|
||||
IntrinsicCorrectType {
|
||||
#[primary_span]
|
||||
span: Span,
|
||||
#[subdiagnostic]
|
||||
|
|
|
@ -467,11 +467,11 @@ impl<'tcx> InferCtxt<'tcx> {
|
|||
}
|
||||
}
|
||||
GenericArgKind::Const(result_value) => {
|
||||
if let ty::ConstKind::Bound(debrujin, b) = result_value.kind() {
|
||||
if let ty::ConstKind::Bound(debruijn, b) = result_value.kind() {
|
||||
// ...in which case we would set `canonical_vars[0]` to `Some(const X)`.
|
||||
|
||||
// We only allow a `ty::INNERMOST` index in substitutions.
|
||||
assert_eq!(debrujin, ty::INNERMOST);
|
||||
assert_eq!(debruijn, ty::INNERMOST);
|
||||
opt_values[b] = Some(*original_value);
|
||||
}
|
||||
}
|
||||
|
|
|
@ -832,7 +832,7 @@ pub trait ObligationEmittingRelation<'tcx>: TypeRelation<'tcx> {
|
|||
|
||||
/// Register predicates that must hold in order for this relation to hold. Uses
|
||||
/// a default obligation cause, [`ObligationEmittingRelation::register_obligations`] should
|
||||
/// be used if control over the obligaton causes is required.
|
||||
/// be used if control over the obligation causes is required.
|
||||
fn register_predicates(&mut self, obligations: impl IntoIterator<Item: ToPredicate<'tcx>>);
|
||||
|
||||
/// Register an obligation that both constants must be equal to each other.
|
||||
|
|
|
@ -178,7 +178,7 @@ impl<'tcx> TypeRelation<'tcx> for Equate<'_, '_, 'tcx> {
|
|||
where
|
||||
T: Relate<'tcx>,
|
||||
{
|
||||
// A binder is equal to itself if it's structually equal to itself
|
||||
// A binder is equal to itself if it's structurally equal to itself
|
||||
if a == b {
|
||||
return Ok(a);
|
||||
}
|
||||
|
|
|
@ -2886,7 +2886,7 @@ impl<'tcx> ObligationCauseExt<'tcx> for ObligationCause<'tcx> {
|
|||
LetElse => ObligationCauseFailureCode::NoDiverge { span, subdiags },
|
||||
MainFunctionType => ObligationCauseFailureCode::FnMainCorrectType { span },
|
||||
StartFunctionType => ObligationCauseFailureCode::FnStartCorrectType { span, subdiags },
|
||||
IntrinsicType => ObligationCauseFailureCode::IntristicCorrectType { span, subdiags },
|
||||
IntrinsicType => ObligationCauseFailureCode::IntrinsicCorrectType { span, subdiags },
|
||||
MethodReceiver => ObligationCauseFailureCode::MethodCorrectType { span, subdiags },
|
||||
|
||||
// In the case where we have no more specific thing to
|
||||
|
@ -2943,7 +2943,7 @@ impl IntoDiagnosticArg for ObligationCauseAsDiagArg<'_> {
|
|||
IfExpressionWithNoElse => "no_else",
|
||||
MainFunctionType => "fn_main_correct_type",
|
||||
StartFunctionType => "fn_start_correct_type",
|
||||
IntrinsicType => "intristic_correct_type",
|
||||
IntrinsicType => "intrinsic_correct_type",
|
||||
MethodReceiver => "method_correct_type",
|
||||
_ => "other",
|
||||
}
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
use crate::errors::{
|
||||
AmbigousReturn, AmbiguousImpl, AnnotationRequired, InferenceBadError, NeedTypeInfoInGenerator,
|
||||
AmbiguousImpl, AmbiguousReturn, AnnotationRequired, InferenceBadError, NeedTypeInfoInGenerator,
|
||||
SourceKindMultiSuggestion, SourceKindSubdiag,
|
||||
};
|
||||
use crate::infer::error_reporting::TypeErrCtxt;
|
||||
|
@ -368,7 +368,7 @@ impl<'tcx> InferCtxt<'tcx> {
|
|||
bad_label,
|
||||
}
|
||||
.into_diagnostic(&self.tcx.sess.parse_sess.span_diagnostic),
|
||||
TypeAnnotationNeeded::E0284 => AmbigousReturn {
|
||||
TypeAnnotationNeeded::E0284 => AmbiguousReturn {
|
||||
span,
|
||||
source_kind,
|
||||
source_name,
|
||||
|
@ -573,7 +573,7 @@ impl<'tcx> TypeErrCtxt<'_, 'tcx> {
|
|||
bad_label: None,
|
||||
}
|
||||
.into_diagnostic(&self.tcx.sess.parse_sess.span_diagnostic),
|
||||
TypeAnnotationNeeded::E0284 => AmbigousReturn {
|
||||
TypeAnnotationNeeded::E0284 => AmbiguousReturn {
|
||||
span,
|
||||
source_kind,
|
||||
source_name: &name,
|
||||
|
|
|
@ -42,7 +42,7 @@ impl<'a, 'tcx> CombineFields<'a, 'tcx> {
|
|||
|
||||
// Next, we instantiate each bound region in the subtype
|
||||
// with a fresh region variable. These region variables --
|
||||
// but no other pre-existing region variables -- can name
|
||||
// but no other preexisting region variables -- can name
|
||||
// the placeholders.
|
||||
let sub_prime = self.infcx.instantiate_binder_with_fresh_vars(span, HigherRankedType, sub);
|
||||
|
||||
|
|
|
@ -210,7 +210,7 @@ impl<'tcx> TypeRelation<'tcx> for Sub<'_, '_, 'tcx> {
|
|||
where
|
||||
T: Relate<'tcx>,
|
||||
{
|
||||
// A binder is always a subtype of itself if it's structually equal to itself
|
||||
// A binder is always a subtype of itself if it's structurally equal to itself
|
||||
if a == b {
|
||||
return Ok(a);
|
||||
}
|
||||
|
|
|
@ -103,7 +103,7 @@ pub enum ProjectionCacheEntry<'tcx> {
|
|||
/// if this field is set. Evaluation only
|
||||
/// cares about the final result, so we don't
|
||||
/// care about any region constraint side-effects
|
||||
/// produced by evaluating the sub-boligations.
|
||||
/// produced by evaluating the sub-obligations.
|
||||
///
|
||||
/// Additionally, we will clear out the sub-obligations
|
||||
/// entirely if we ever evaluate the cache entry (along
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue