1
Fork 0

Fix typos

This commit is contained in:
Dániel Buga 2020-10-29 16:51:46 +01:00
parent 717eb6ccea
commit 3fba948510
5 changed files with 9 additions and 9 deletions

View file

@ -148,7 +148,7 @@ struct LoweringContext<'a, 'hir: 'a> {
is_collecting_in_band_lifetimes: bool, is_collecting_in_band_lifetimes: bool,
/// Currently in-scope lifetimes defined in impl headers, fn headers, or HRTB. /// Currently in-scope lifetimes defined in impl headers, fn headers, or HRTB.
/// When `is_collectin_in_band_lifetimes` is true, each lifetime is checked /// When `is_collecting_in_band_lifetimes` is true, each lifetime is checked
/// against this list to see if it is already in-scope, or if a definition /// against this list to see if it is already in-scope, or if a definition
/// needs to be created for it. /// needs to be created for it.
/// ///
@ -257,7 +257,7 @@ enum ImplTraitPosition {
/// Disallowed in `let` / `const` / `static` bindings. /// Disallowed in `let` / `const` / `static` bindings.
Binding, Binding,
/// All other posiitons. /// All other positions.
Other, Other,
} }
@ -363,7 +363,7 @@ enum ParenthesizedGenericArgs {
/// elided bounds follow special rules. Note that this only covers /// elided bounds follow special rules. Note that this only covers
/// cases where *nothing* is written; the `'_` in `Box<dyn Foo + /// cases where *nothing* is written; the `'_` in `Box<dyn Foo +
/// '_>` is a case of "modern" elision. /// '_>` is a case of "modern" elision.
/// - **Deprecated** -- this coverse cases like `Ref<T>`, where the lifetime /// - **Deprecated** -- this covers cases like `Ref<T>`, where the lifetime
/// parameter to ref is completely elided. `Ref<'_, T>` would be the modern, /// parameter to ref is completely elided. `Ref<'_, T>` would be the modern,
/// non-deprecated equivalent. /// non-deprecated equivalent.
/// ///

View file

@ -516,7 +516,7 @@ impl<'a> AstValidator<'a> {
self.session.source_map().guess_head_span(self.extern_mod.unwrap().span) self.session.source_map().guess_head_span(self.extern_mod.unwrap().span)
} }
/// An `fn` in `extern { ... }` cannot have qualfiers, e.g. `async fn`. /// An `fn` in `extern { ... }` cannot have qualifiers, e.g. `async fn`.
fn check_foreign_fn_headerless(&self, ident: Ident, span: Span, header: FnHeader) { fn check_foreign_fn_headerless(&self, ident: Ident, span: Span, header: FnHeader) {
if header.has_qualifiers() { if header.has_qualifiers() {
self.err_handler() self.err_handler()

View file

@ -24,7 +24,7 @@ mod drop;
pub use copy::CopyTaggedPtr; pub use copy::CopyTaggedPtr;
pub use drop::TaggedPtr; pub use drop::TaggedPtr;
/// This describes the pointer type encaspulated by TaggedPtr. /// This describes the pointer type encapsulated by TaggedPtr.
/// ///
/// # Safety /// # Safety
/// ///

View file

@ -18,7 +18,7 @@ pub struct TransitiveRelation<T: Eq + Hash> {
edges: Vec<Edge>, edges: Vec<Edge>,
// This is a cached transitive closure derived from the edges. // This is a cached transitive closure derived from the edges.
// Currently, we build it lazilly and just throw out any existing // Currently, we build it lazily and just throw out any existing
// copy whenever a new edge is added. (The Lock is to permit // copy whenever a new edge is added. (The Lock is to permit
// the lazy computation.) This is kind of silly, except for the // the lazy computation.) This is kind of silly, except for the
// fact its size is tied to `self.elements.len()`, so I wanted to // fact its size is tied to `self.elements.len()`, so I wanted to
@ -255,7 +255,7 @@ impl<T: Clone + Debug + Eq + Hash> TransitiveRelation<T> {
// argument is that, after step 2, we know that no element // argument is that, after step 2, we know that no element
// can reach its successors (in the vector, not the graph). // can reach its successors (in the vector, not the graph).
// After step 3, we know that no element can reach any of // After step 3, we know that no element can reach any of
// its predecesssors (because of step 2) nor successors // its predecessors (because of step 2) nor successors
// (because we just called `pare_down`) // (because we just called `pare_down`)
// //
// This same algorithm is used in `parents` below. // This same algorithm is used in `parents` below.

View file

@ -513,7 +513,7 @@ impl Emitter for SilentEmitter {
/// Maximum number of lines we will print for a multiline suggestion; arbitrary. /// Maximum number of lines we will print for a multiline suggestion; arbitrary.
/// ///
/// This should be replaced with a more involved mechanism to output multiline suggestions that /// This should be replaced with a more involved mechanism to output multiline suggestions that
/// more closely mimmics the regular diagnostic output, where irrelevant code lines are elided. /// more closely mimics the regular diagnostic output, where irrelevant code lines are elided.
pub const MAX_SUGGESTION_HIGHLIGHT_LINES: usize = 6; pub const MAX_SUGGESTION_HIGHLIGHT_LINES: usize = 6;
/// Maximum number of suggestions to be shown /// Maximum number of suggestions to be shown
/// ///
@ -887,7 +887,7 @@ impl EmitterWriter {
// or the next are vertical line placeholders. // or the next are vertical line placeholders.
|| (annotation.takes_space() // If either this or the next annotation is || (annotation.takes_space() // If either this or the next annotation is
&& next.has_label()) // multiline start/end, move it to a new line && next.has_label()) // multiline start/end, move it to a new line
|| (annotation.has_label() // so as not to overlap the orizontal lines. || (annotation.has_label() // so as not to overlap the horizontal lines.
&& next.takes_space()) && next.takes_space())
|| (annotation.takes_space() && next.takes_space()) || (annotation.takes_space() && next.takes_space())
|| (overlaps(next, annotation, l) || (overlaps(next, annotation, l)