Add note on gap for MIN/MAX
This commit is contained in:
parent
f65fbe9517
commit
b64f3c7181
1 changed files with 35 additions and 0 deletions
|
|
@ -11,9 +11,27 @@ use super::*;
|
|||
impl char {
|
||||
/// The lowest valid code point a `char` can have, `'\0'`.
|
||||
///
|
||||
/// Unlike integer types, `char` actually has a gap in the middle,
|
||||
/// meaning that the range of possible `char`s is smaller than you
|
||||
/// might expect. Ranges of `char` will automatically hop this gap
|
||||
/// for you:
|
||||
///
|
||||
/// ```
|
||||
/// #![feature(char_min)]
|
||||
/// let dist = u32::from(char::MAX) - u32::from(char::MIN);
|
||||
/// let size = (char::MIN..=char::MAX).count();
|
||||
/// assert!(dist < size);
|
||||
/// ```
|
||||
///
|
||||
/// Despite this gap, the `MIN` and [`MAX`] values can be used as bounds for
|
||||
/// all `char` values.
|
||||
///
|
||||
/// [`MAX`]: char::MAX
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// #![feature(char_min)]
|
||||
/// # fn something_which_returns_char() -> char { 'a' }
|
||||
/// let c: char = something_which_returns_char();
|
||||
/// assert!(char::MIN <= c);
|
||||
|
|
@ -26,6 +44,23 @@ impl char {
|
|||
|
||||
/// The highest valid code point a `char` can have, `'\u{10FFFF}'`.
|
||||
///
|
||||
/// Unlike integer types, `char` actually has a gap in the middle,
|
||||
/// meaning that the range of possible `char`s is smaller than you
|
||||
/// might expect. Ranges of `char` will automatically hop this gap
|
||||
/// for you:
|
||||
///
|
||||
/// ```
|
||||
/// #![feature(char_min)]
|
||||
/// let dist = u32::from(char::MAX) - u32::from(char::MIN);
|
||||
/// let size = (char::MIN..=char::MAX).count();
|
||||
/// assert!(dist < size);
|
||||
/// ```
|
||||
///
|
||||
/// Despite this gap, the [`MIN`] and `MAX` values can be used as bounds for
|
||||
/// all `char` values.
|
||||
///
|
||||
/// [`MIN`]: char::MIN
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue