Skip to content

Commit bf88b11

Browse files
committed
Fix typos “a”→“an”
1 parent 2ad56d5 commit bf88b11

File tree

99 files changed

+157
-157
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

99 files changed

+157
-157
lines changed

compiler/rustc_ast/src/token.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -495,7 +495,7 @@ impl Token {
495495
self.lifetime().is_some()
496496
}
497497

498-
/// Returns `true` if the token is a identifier whose name is the given
498+
/// Returns `true` if the token is an identifier whose name is the given
499499
/// string slice.
500500
pub fn is_ident_named(&self, name: Symbol) -> bool {
501501
self.ident().map_or(false, |(ident, _)| ident.name == name)

compiler/rustc_ast_lowering/src/lib.rs

+2-2
Original file line numberDiff line numberDiff line change
@@ -1265,7 +1265,7 @@ impl<'a, 'hir> LoweringContext<'a, 'hir> {
12651265
ty,
12661266
);
12671267

1268-
// Construct a AnonConst where the expr is the "ty"'s path.
1268+
// Construct an AnonConst where the expr is the "ty"'s path.
12691269

12701270
let parent_def_id = self.current_hir_id_owner.0;
12711271
let node_id = self.resolver.next_node_id();
@@ -2690,7 +2690,7 @@ impl<'a, 'hir> LoweringContext<'a, 'hir> {
26902690
}
26912691

26922692
/// Report an error on illegal use of `'_` or a `&T` with no explicit lifetime;
2693-
/// return a "error lifetime".
2693+
/// return an "error lifetime".
26942694
fn new_error_lifetime(&mut self, id: Option<NodeId>, span: Span) -> hir::Lifetime {
26952695
let (id, msg, label) = match id {
26962696
Some(id) => (id, "`'_` cannot be used here", "`'_` is a reserved lifetime name"),

compiler/rustc_builtin_macros/src/deriving/generic/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1700,7 +1700,7 @@ where
17001700
/// One or more fields: call the base case function on the first value (which depends on
17011701
/// `use_fold`), and use that as the base case. Then perform `cs_fold` on the remainder of the
17021702
/// fields.
1703-
/// When the `substructure` is a `EnumNonMatchingCollapsed`, the result of `enum_nonmatch_f`
1703+
/// When the `substructure` is an `EnumNonMatchingCollapsed`, the result of `enum_nonmatch_f`
17041704
/// is returned. Statics may not be folded over.
17051705
/// See `cs_op` in `partial_ord.rs` for a model example.
17061706
pub fn cs_fold1<F, B>(

compiler/rustc_codegen_llvm/src/intrinsic.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -137,7 +137,7 @@ impl IntrinsicCallMethods<'tcx> for Builder<'a, 'll, 'tcx> {
137137
match scalar.value {
138138
Primitive::Int(..) => {
139139
if self.cx().size_of(ret_ty).bytes() < 4 {
140-
// `va_arg` should not be called on a integer type
140+
// `va_arg` should not be called on an integer type
141141
// less than 4 bytes in length. If it is, promote
142142
// the integer to a `i32` and truncate the result
143143
// back to the smaller type.

compiler/rustc_codegen_ssa/src/mir/rvalue.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -901,7 +901,7 @@ fn cast_float_to_int<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
901901
//
902902
// Performance note: Unordered comparison can be lowered to a "flipped"
903903
// comparison and a negation, and the negation can be merged into the
904-
// select. Therefore, it not necessarily any more expensive than a
904+
// select. Therefore, it not necessarily any more expensive than an
905905
// ordered ("normal") comparison. Whether these optimizations will be
906906
// performed is ultimately up to the backend, but at least x86 does
907907
// perform them.

compiler/rustc_data_structures/src/owning_ref/mod.rs

+24-24
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@ pub unsafe trait IntoErasedSendSync<'a> {
321321
/////////////////////////////////////////////////////////////////////////////
322322

323323
impl<O, T: ?Sized> OwningRef<O, T> {
324-
/// Creates a new owning reference from a owner
324+
/// Creates a new owning reference from an owner
325325
/// initialized to the direct dereference of it.
326326
///
327327
/// # Example
@@ -368,7 +368,7 @@ impl<O, T: ?Sized> OwningRef<O, T> {
368368
/// fn main() {
369369
/// let owning_ref = OwningRef::new(Box::new([1, 2, 3, 4]));
370370
///
371-
/// // create a owning reference that points at the
371+
/// // create an owning reference that points at the
372372
/// // third element of the array.
373373
/// let owning_ref = owning_ref.map(|array| &array[2]);
374374
/// assert_eq!(*owning_ref, 3);
@@ -396,7 +396,7 @@ impl<O, T: ?Sized> OwningRef<O, T> {
396396
/// fn main() {
397397
/// let owning_ref = OwningRef::new(Box::new([1, 2, 3, 4]));
398398
///
399-
/// // create a owning reference that points at the
399+
/// // create an owning reference that points at the
400400
/// // third element of the array.
401401
/// let owning_ref = owning_ref.try_map(|array| {
402402
/// if array[2] == 3 { Ok(&array[2]) } else { Err(()) }
@@ -430,7 +430,7 @@ impl<O, T: ?Sized> OwningRef<O, T> {
430430
/// in an additional `Box<O>`.
431431
///
432432
/// This can be used to safely erase the owner of any `OwningRef<O, T>`
433-
/// to a `OwningRef<Box<Erased>, T>`.
433+
/// to an `OwningRef<Box<Erased>, T>`.
434434
pub fn map_owner_box(self) -> OwningRef<Box<O>, T> {
435435
OwningRef { reference: self.reference, owner: Box::new(self.owner) }
436436
}
@@ -511,7 +511,7 @@ impl<O, T: ?Sized> OwningRef<O, T> {
511511
}
512512

513513
impl<O, T: ?Sized> OwningRefMut<O, T> {
514-
/// Creates a new owning reference from a owner
514+
/// Creates a new owning reference from an owner
515515
/// initialized to the direct dereference of it.
516516
///
517517
/// # Example
@@ -558,7 +558,7 @@ impl<O, T: ?Sized> OwningRefMut<O, T> {
558558
/// fn main() {
559559
/// let owning_ref_mut = OwningRefMut::new(Box::new([1, 2, 3, 4]));
560560
///
561-
/// // create a owning reference that points at the
561+
/// // create an owning reference that points at the
562562
/// // third element of the array.
563563
/// let owning_ref = owning_ref_mut.map(|array| &array[2]);
564564
/// assert_eq!(*owning_ref, 3);
@@ -586,7 +586,7 @@ impl<O, T: ?Sized> OwningRefMut<O, T> {
586586
/// fn main() {
587587
/// let owning_ref_mut = OwningRefMut::new(Box::new([1, 2, 3, 4]));
588588
///
589-
/// // create a owning reference that points at the
589+
/// // create an owning reference that points at the
590590
/// // third element of the array.
591591
/// let owning_ref_mut = owning_ref_mut.map_mut(|array| &mut array[2]);
592592
/// assert_eq!(*owning_ref_mut, 3);
@@ -614,7 +614,7 @@ impl<O, T: ?Sized> OwningRefMut<O, T> {
614614
/// fn main() {
615615
/// let owning_ref_mut = OwningRefMut::new(Box::new([1, 2, 3, 4]));
616616
///
617-
/// // create a owning reference that points at the
617+
/// // create an owning reference that points at the
618618
/// // third element of the array.
619619
/// let owning_ref = owning_ref_mut.try_map(|array| {
620620
/// if array[2] == 3 { Ok(&array[2]) } else { Err(()) }
@@ -644,7 +644,7 @@ impl<O, T: ?Sized> OwningRefMut<O, T> {
644644
/// fn main() {
645645
/// let owning_ref_mut = OwningRefMut::new(Box::new([1, 2, 3, 4]));
646646
///
647-
/// // create a owning reference that points at the
647+
/// // create an owning reference that points at the
648648
/// // third element of the array.
649649
/// let owning_ref_mut = owning_ref_mut.try_map_mut(|array| {
650650
/// if array[2] == 3 { Ok(&mut array[2]) } else { Err(()) }
@@ -678,7 +678,7 @@ impl<O, T: ?Sized> OwningRefMut<O, T> {
678678
/// in an additional `Box<O>`.
679679
///
680680
/// This can be used to safely erase the owner of any `OwningRefMut<O, T>`
681-
/// to a `OwningRefMut<Box<Erased>, T>`.
681+
/// to an `OwningRefMut<Box<Erased>, T>`.
682682
pub fn map_owner_box(self) -> OwningRefMut<Box<O>, T> {
683683
OwningRefMut { reference: self.reference, owner: Box::new(self.owner) }
684684
}
@@ -970,7 +970,7 @@ where
970970
}
971971
}
972972

973-
// ^ FIXME: Is a Into impl for calling into_inner() possible as well?
973+
// ^ FIXME: Is an Into impl for calling into_inner() possible as well?
974974

975975
impl<O, T: ?Sized> Debug for OwningRef<O, T>
976976
where
@@ -1139,27 +1139,27 @@ impl<T: 'static> ToHandleMut for RefCell<T> {
11391139
// about which handle creation to use (i.e., read() vs try_read()) as well as
11401140
// what to do with error results.
11411141

1142-
/// Typedef of a owning reference that uses a `Box` as the owner.
1142+
/// Typedef of an owning reference that uses a `Box` as the owner.
11431143
pub type BoxRef<T, U = T> = OwningRef<Box<T>, U>;
1144-
/// Typedef of a owning reference that uses a `Vec` as the owner.
1144+
/// Typedef of an owning reference that uses a `Vec` as the owner.
11451145
pub type VecRef<T, U = T> = OwningRef<Vec<T>, U>;
1146-
/// Typedef of a owning reference that uses a `String` as the owner.
1146+
/// Typedef of an owning reference that uses a `String` as the owner.
11471147
pub type StringRef = OwningRef<String, str>;
11481148

1149-
/// Typedef of a owning reference that uses a `Rc` as the owner.
1149+
/// Typedef of an owning reference that uses a `Rc` as the owner.
11501150
pub type RcRef<T, U = T> = OwningRef<Rc<T>, U>;
1151-
/// Typedef of a owning reference that uses a `Arc` as the owner.
1151+
/// Typedef of an owning reference that uses a `Arc` as the owner.
11521152
pub type ArcRef<T, U = T> = OwningRef<Arc<T>, U>;
11531153

1154-
/// Typedef of a owning reference that uses a `Ref` as the owner.
1154+
/// Typedef of an owning reference that uses a `Ref` as the owner.
11551155
pub type RefRef<'a, T, U = T> = OwningRef<Ref<'a, T>, U>;
1156-
/// Typedef of a owning reference that uses a `RefMut` as the owner.
1156+
/// Typedef of an owning reference that uses a `RefMut` as the owner.
11571157
pub type RefMutRef<'a, T, U = T> = OwningRef<RefMut<'a, T>, U>;
1158-
/// Typedef of a owning reference that uses a `MutexGuard` as the owner.
1158+
/// Typedef of an owning reference that uses a `MutexGuard` as the owner.
11591159
pub type MutexGuardRef<'a, T, U = T> = OwningRef<MutexGuard<'a, T>, U>;
1160-
/// Typedef of a owning reference that uses a `RwLockReadGuard` as the owner.
1160+
/// Typedef of an owning reference that uses a `RwLockReadGuard` as the owner.
11611161
pub type RwLockReadGuardRef<'a, T, U = T> = OwningRef<RwLockReadGuard<'a, T>, U>;
1162-
/// Typedef of a owning reference that uses a `RwLockWriteGuard` as the owner.
1162+
/// Typedef of an owning reference that uses a `RwLockWriteGuard` as the owner.
11631163
pub type RwLockWriteGuardRef<'a, T, U = T> = OwningRef<RwLockWriteGuard<'a, T>, U>;
11641164

11651165
/// Typedef of a mutable owning reference that uses a `Box` as the owner.
@@ -1219,11 +1219,11 @@ unsafe impl<'a, T: Send + Sync + 'a> IntoErasedSendSync<'a> for Arc<T> {
12191219
}
12201220
}
12211221

1222-
/// Typedef of a owning reference that uses an erased `Box` as the owner.
1222+
/// Typedef of an owning reference that uses an erased `Box` as the owner.
12231223
pub type ErasedBoxRef<U> = OwningRef<Box<dyn Erased>, U>;
1224-
/// Typedef of a owning reference that uses an erased `Rc` as the owner.
1224+
/// Typedef of an owning reference that uses an erased `Rc` as the owner.
12251225
pub type ErasedRcRef<U> = OwningRef<Rc<dyn Erased>, U>;
1226-
/// Typedef of a owning reference that uses an erased `Arc` as the owner.
1226+
/// Typedef of an owning reference that uses an erased `Arc` as the owner.
12271227
pub type ErasedArcRef<U> = OwningRef<Arc<dyn Erased>, U>;
12281228

12291229
/// Typedef of a mutable owning reference that uses an erased `Box` as the owner.

compiler/rustc_data_structures/src/profiling.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -220,7 +220,7 @@ impl SelfProfilerRef {
220220
VerboseTimingGuard::start(message, self.generic_activity(event_label))
221221
}
222222

223-
/// Start profiling a extra verbose generic activity. Profiling continues until the
223+
/// Start profiling an extra verbose generic activity. Profiling continues until the
224224
/// VerboseTimingGuard returned from this call is dropped. In addition to recording
225225
/// a measureme event, "extra verbose" generic activities also print a timing entry to
226226
/// stdout if the compiler is invoked with -Ztime-passes.

compiler/rustc_data_structures/src/sync.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@
1414
//!
1515
//! `MTRef` is an immutable reference if cfg!(parallel_compiler), and a mutable reference otherwise.
1616
//!
17-
//! `rustc_erase_owner!` erases a OwningRef owner into Erased or Erased + Send + Sync
17+
//! `rustc_erase_owner!` erases an OwningRef owner into Erased or Erased + Send + Sync
1818
//! depending on the value of cfg!(parallel_compiler).
1919
2020
use crate::owning_ref::{Erased, OwningRef};

compiler/rustc_data_structures/src/tiny_list.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
//!
66
//! - If you have a list that rarely stores more than one element, then this
77
//! data-structure can store the element without allocating and only uses as
8-
//! much space as a `Option<(T, usize)>`. If T can double as the `Option`
8+
//! much space as an `Option<(T, usize)>`. If T can double as the `Option`
99
//! discriminant, it will even only be as large as `T, usize`.
1010
//!
1111
//! If you expect to store more than 1 element in the common case, steer clear

compiler/rustc_hir/src/hir.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -2323,7 +2323,7 @@ pub enum TyKind<'hir> {
23232323
///
23242324
/// Type parameters may be stored in each `PathSegment`.
23252325
Path(QPath<'hir>),
2326-
/// A opaque type definition itself. This is currently only used for the
2326+
/// An opaque type definition itself. This is currently only used for the
23272327
/// `opaque type Foo: Trait` item that `impl Trait` in desugars to.
23282328
///
23292329
/// The generic argument list contains the lifetimes (and in the future

compiler/rustc_hir/src/intravisit.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -313,7 +313,7 @@ pub trait Visitor<'v>: Sized {
313313
}
314314

315315
/// When invoking `visit_all_item_likes()`, you need to supply an
316-
/// item-like visitor. This method converts a "intra-visit"
316+
/// item-like visitor. This method converts an "intra-visit"
317317
/// visitor into an item-like visitor that walks the entire tree.
318318
/// If you use this, you probably don't want to process the
319319
/// contents of nested item-like things, since the outer loop will

compiler/rustc_infer/src/infer/error_reporting/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1697,7 +1697,7 @@ impl<'a, 'tcx> InferCtxt<'a, 'tcx> {
16971697
}
16981698

16991699
// In some (most?) cases cause.body_id points to actual body, but in some cases
1700-
// it's a actual definition. According to the comments (e.g. in
1700+
// it's an actual definition. According to the comments (e.g. in
17011701
// librustc_typeck/check/compare_method.rs:compare_predicate_entailment) the latter
17021702
// is relied upon by some other code. This might (or might not) need cleanup.
17031703
let body_owner_def_id =

compiler/rustc_infer/src/infer/nll_relate/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -389,7 +389,7 @@ where
389389
}
390390
}
391391

392-
/// When we instantiate a inference variable with a value in
392+
/// When we instantiate an inference variable with a value in
393393
/// `relate_ty_var`, we always have the pair of a `TyVid` and a `Ty`,
394394
/// but the ordering may vary (depending on whether the inference
395395
/// variable was found on the `a` or `b` sides). Therefore, this trait

compiler/rustc_infer/src/infer/region_constraints/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -186,7 +186,7 @@ pub enum GenericKind<'tcx> {
186186
/// ('a: min) || ('b: min)
187187
/// }
188188
///
189-
/// This is described with a `AnyRegion('a, 'b)` node.
189+
/// This is described with an `AnyRegion('a, 'b)` node.
190190
#[derive(Debug, Clone)]
191191
pub enum VerifyBound<'tcx> {
192192
/// Given a kind K and a bound B, expands to a function like the

compiler/rustc_infer/src/traits/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ pub use self::project::{
2828
pub use rustc_middle::traits::*;
2929

3030
/// An `Obligation` represents some trait reference (e.g., `i32: Eq`) for
31-
/// which the "impl_source" must be found. The process of finding a "impl_source" is
31+
/// which the "impl_source" must be found. The process of finding an "impl_source" is
3232
/// called "resolving" the `Obligation`. This process consists of
3333
/// either identifying an `impl` (e.g., `impl Eq for i32`) that
3434
/// satisfies the obligation, or else finding a bound that is in

compiler/rustc_lint/src/types.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1171,7 +1171,7 @@ impl<'a, 'tcx> ImproperCTypesVisitor<'a, 'tcx> {
11711171
ty::Projection(..) => {
11721172
let ty = self.cx.tcx.normalize_erasing_regions(self.cx.param_env, ty);
11731173

1174-
// If `ty` is a opaque type directly then `super_visit_with` won't invoke
1174+
// If `ty` is an opaque type directly then `super_visit_with` won't invoke
11751175
// this function again.
11761176
if ty.has_opaque_types() {
11771177
self.visit_ty(ty)

compiler/rustc_metadata/src/creader.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -308,7 +308,7 @@ impl<'a> CrateLoader<'a> {
308308
}
309309

310310
// Alright, so we've gotten this far which means that `data` has the
311-
// right name, we don't have a hash, and we don't have a --extern
311+
// right name, we don't have a hash, and we don't have an --extern
312312
// pointing for ourselves. We're still not quite yet done because we
313313
// have to make sure that this crate was found in the crate lookup
314314
// path (this is a top-level dependency) as we don't want to

compiler/rustc_middle/src/hir/map/blocks.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -63,7 +63,7 @@ impl MaybeFnLike for hir::Expr<'_> {
6363
}
6464
}
6565

66-
/// Carries either an FnLikeNode or a Expr, as these are the two
66+
/// Carries either an FnLikeNode or an Expr, as these are the two
6767
/// constructs that correspond to "code" (as in, something from which
6868
/// we can construct a control-flow graph).
6969
#[derive(Copy, Clone)]

compiler/rustc_middle/src/middle/region.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -151,7 +151,7 @@ rustc_index::newtype_index! {
151151
static_assert_size!(ScopeData, 4);
152152

153153
impl Scope {
154-
/// Returns a item-local ID associated with this scope.
154+
/// Returns an item-local ID associated with this scope.
155155
///
156156
/// N.B., likely to be replaced as API is refined; e.g., pnkfelix
157157
/// anticipates `fn entry_node_id` and `fn each_exit_node_id`.

compiler/rustc_middle/src/mir/interpret/error.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ static_assert_size!(InterpErrorInfo<'_>, 8);
4646
/// Packages the kind of error we got from the const code interpreter
4747
/// up with a Rust-level backtrace of where the error occurred.
4848
/// These should always be constructed by calling `.into()` on
49-
/// a `InterpError`. In `rustc_mir::interpret`, we have `throw_err_*`
49+
/// an `InterpError`. In `rustc_mir::interpret`, we have `throw_err_*`
5050
/// macros for this.
5151
#[derive(Debug)]
5252
pub struct InterpErrorInfo<'tcx>(Box<InterpErrorInfoInner<'tcx>>);

compiler/rustc_middle/src/mir/interpret/value.rs

+2-2
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ use super::{
1717
/// Represents the result of const evaluation via the `eval_to_allocation` query.
1818
#[derive(Copy, Clone, HashStable, TyEncodable, TyDecodable, Debug, Hash, Eq, PartialEq)]
1919
pub struct ConstAlloc<'tcx> {
20-
// the value lives here, at offset 0, and that allocation definitely is a `AllocKind::Memory`
20+
// the value lives here, at offset 0, and that allocation definitely is an `AllocKind::Memory`
2121
// (so you can use `AllocMap::unwrap_memory`).
2222
pub alloc_id: AllocId,
2323
pub ty: Ty<'tcx>,
@@ -113,7 +113,7 @@ impl<'tcx> ConstValue<'tcx> {
113113
}
114114

115115
/// A `Scalar` represents an immediate, primitive value existing outside of a
116-
/// `memory::Allocation`. It is in many ways like a small chunk of a `Allocation`, up to 16 bytes in
116+
/// `memory::Allocation`. It is in many ways like a small chunk of an `Allocation`, up to 16 bytes in
117117
/// size. Like a range of bytes in an `Allocation`, a `Scalar` can either represent the raw bytes
118118
/// of a simple value or a pointer into another `Allocation`
119119
///

compiler/rustc_middle/src/traits/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -509,7 +509,7 @@ pub enum ImplSource<'tcx, N> {
509509
TraitUpcasting(ImplSourceTraitUpcastingData<'tcx, N>),
510510

511511
/// ImplSource automatically generated for a closure. The `DefId` is the ID
512-
/// of the closure expression. This is a `ImplSource::UserDefined` in spirit, but the
512+
/// of the closure expression. This is an `ImplSource::UserDefined` in spirit, but the
513513
/// impl is generated by the compiler and does not appear in the source.
514514
Closure(ImplSourceClosureData<'tcx, N>),
515515

compiler/rustc_middle/src/traits/select.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -111,7 +111,7 @@ pub enum SelectionCandidate<'tcx> {
111111
ProjectionCandidate(usize),
112112

113113
/// Implementation of a `Fn`-family trait by one of the anonymous types
114-
/// generated for a `||` expression.
114+
/// generated for an `||` expression.
115115
ClosureCandidate,
116116

117117
/// Implementation of a `Generator` trait by one of the anonymous types

compiler/rustc_middle/src/ty/adt.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -209,7 +209,7 @@ impl<'tcx> AdtDef {
209209
self.flags.contains(AdtFlags::IS_UNION)
210210
}
211211

212-
/// Returns `true` if this is a enum.
212+
/// Returns `true` if this is an enum.
213213
#[inline]
214214
pub fn is_enum(&self) -> bool {
215215
self.flags.contains(AdtFlags::IS_ENUM)

compiler/rustc_middle/src/ty/context.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1792,7 +1792,7 @@ pub mod tls {
17921792
if context == 0 {
17931793
f(None)
17941794
} else {
1795-
// We could get a `ImplicitCtxt` pointer from another thread.
1795+
// We could get an `ImplicitCtxt` pointer from another thread.
17961796
// Ensure that `ImplicitCtxt` is `Sync`.
17971797
sync::assert_sync::<ImplicitCtxt<'_, '_>>();
17981798

compiler/rustc_middle/src/ty/inhabitedness/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ use crate::ty::{DefId, SubstsRef};
99

1010
mod def_id_forest;
1111

12-
// The methods in this module calculate `DefIdForest`s of modules in which a
12+
// The methods in this module calculate `DefIdForest`s of modules in which an
1313
// `AdtDef`/`VariantDef`/`FieldDef` is visibly uninhabited.
1414
//
1515
// # Example

0 commit comments

Comments
 (0)