Fix typos in doc comments.
This commit is contained in:
parent
b5c04e6d9e
commit
86633b6389
5 changed files with 7 additions and 7 deletions
|
@ -427,7 +427,7 @@ pub trait TryInto<T>: Sized {
|
||||||
/// - [`try_from`] is reflexive, which means that `TryFrom<T> for T`
|
/// - [`try_from`] is reflexive, which means that `TryFrom<T> for T`
|
||||||
/// is implemented and cannot fail -- the associated `Error` type for
|
/// is implemented and cannot fail -- the associated `Error` type for
|
||||||
/// calling `T::try_from()` on a value of type `T` is [`Infallible`].
|
/// calling `T::try_from()` on a value of type `T` is [`Infallible`].
|
||||||
/// When the [`!`] type is stablized [`Infallible`] and [`!`] will be
|
/// When the [`!`] type is stabilized [`Infallible`] and [`!`] will be
|
||||||
/// equivalent.
|
/// equivalent.
|
||||||
///
|
///
|
||||||
/// `TryFrom<T>` can be implemented as follows:
|
/// `TryFrom<T>` can be implemented as follows:
|
||||||
|
|
|
@ -434,7 +434,7 @@ impl<T> MaybeUninit<T> {
|
||||||
/// Reads the value from the `MaybeUninit<T>` container. The resulting `T` is subject
|
/// Reads the value from the `MaybeUninit<T>` container. The resulting `T` is subject
|
||||||
/// to the usual drop handling.
|
/// to the usual drop handling.
|
||||||
///
|
///
|
||||||
/// Whenever possible, it is preferrable to use [`assume_init`] instead, which
|
/// Whenever possible, it is preferable to use [`assume_init`] instead, which
|
||||||
/// prevents duplicating the content of the `MaybeUninit<T>`.
|
/// prevents duplicating the content of the `MaybeUninit<T>`.
|
||||||
///
|
///
|
||||||
/// # Safety
|
/// # Safety
|
||||||
|
|
|
@ -1611,7 +1611,7 @@ impl<T: ?Sized> *const T {
|
||||||
/// The offset is expressed in number of `T` elements, and not bytes. The value returned can be
|
/// The offset is expressed in number of `T` elements, and not bytes. The value returned can be
|
||||||
/// used with the `add` method.
|
/// used with the `add` method.
|
||||||
///
|
///
|
||||||
/// There are no guarantees whatsover that offsetting the pointer will not overflow or go
|
/// There are no guarantees whatsoever that offsetting the pointer will not overflow or go
|
||||||
/// beyond the allocation that the pointer points into. It is up to the caller to ensure that
|
/// beyond the allocation that the pointer points into. It is up to the caller to ensure that
|
||||||
/// the returned offset is correct in all terms other than alignment.
|
/// the returned offset is correct in all terms other than alignment.
|
||||||
///
|
///
|
||||||
|
@ -2412,7 +2412,7 @@ impl<T: ?Sized> *mut T {
|
||||||
/// The offset is expressed in number of `T` elements, and not bytes. The value returned can be
|
/// The offset is expressed in number of `T` elements, and not bytes. The value returned can be
|
||||||
/// used with the `add` method.
|
/// used with the `add` method.
|
||||||
///
|
///
|
||||||
/// There are no guarantees whatsover that offsetting the pointer will not overflow or go
|
/// There are no guarantees whatsoever that offsetting the pointer will not overflow or go
|
||||||
/// beyond the allocation that the pointer points into. It is up to the caller to ensure that
|
/// beyond the allocation that the pointer points into. It is up to the caller to ensure that
|
||||||
/// the returned offset is correct in all terms other than alignment.
|
/// the returned offset is correct in all terms other than alignment.
|
||||||
///
|
///
|
||||||
|
|
|
@ -167,7 +167,7 @@ struct TraitObligationStack<'prev, 'tcx> {
|
||||||
/// ok on the premise that if `A: AutoTrait` held, but we indeed
|
/// ok on the premise that if `A: AutoTrait` held, but we indeed
|
||||||
/// encountered a problem (later on) with `A: AutoTrait. So we
|
/// encountered a problem (later on) with `A: AutoTrait. So we
|
||||||
/// currently set a flag on the stack node for `B: AutoTrait` (as
|
/// currently set a flag on the stack node for `B: AutoTrait` (as
|
||||||
/// well as the second instance of `A: AutoTrait`) to supress
|
/// well as the second instance of `A: AutoTrait`) to suppress
|
||||||
/// caching.
|
/// caching.
|
||||||
///
|
///
|
||||||
/// This is a simple, targeted fix. A more-performant fix requires
|
/// This is a simple, targeted fix. A more-performant fix requires
|
||||||
|
@ -1105,7 +1105,7 @@ impl<'cx, 'tcx> SelectionContext<'cx, 'tcx> {
|
||||||
///
|
///
|
||||||
/// - is a defaulted trait,
|
/// - is a defaulted trait,
|
||||||
/// - it also appears in the backtrace at some position `X`,
|
/// - it also appears in the backtrace at some position `X`,
|
||||||
/// - all the predicates at positions `X..` between `X` an the top are
|
/// - all the predicates at positions `X..` between `X` and the top are
|
||||||
/// also defaulted traits.
|
/// also defaulted traits.
|
||||||
pub fn coinductive_match<I>(&mut self, cycle: I) -> bool
|
pub fn coinductive_match<I>(&mut self, cycle: I) -> bool
|
||||||
where
|
where
|
||||||
|
|
|
@ -368,7 +368,7 @@ pub fn stream_to_parser_with_base_dir<'a>(
|
||||||
|
|
||||||
/// A sequence separator.
|
/// A sequence separator.
|
||||||
pub struct SeqSep {
|
pub struct SeqSep {
|
||||||
/// The seperator token.
|
/// The separator token.
|
||||||
pub sep: Option<TokenKind>,
|
pub sep: Option<TokenKind>,
|
||||||
/// `true` if a trailing separator is allowed.
|
/// `true` if a trailing separator is allowed.
|
||||||
pub trailing_sep_allowed: bool,
|
pub trailing_sep_allowed: bool,
|
||||||
|
|
Loading…
Reference in a new issue