bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

update documents

Browse source
This commit is contained in:
VillSnow 2021-01-31 09:31:17 +09:00
parent 178108bf81
commit de21cdf792
1 changed files with 23 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

23
library/core/src/slice/mod.rs
View file

@ -2082,6 +2082,12 @@ impl<T> [T] {
/// [`Result::Err`] is returned, containing the index where a matching /// [`Result::Err`] is returned, containing the index where a matching
/// element could be inserted while maintaining sorted order. /// element could be inserted while maintaining sorted order.
/// ///
/// See also [`binary_search_by`], [`binary_search_by_key`], and [`partition_point`].
///
/// [`binary_search_by`]: #method.binary_search_by
/// [`binary_search_by_key`]: #method.binary_search_by_key
/// [`partition_point`]: #method.partition_point
///
/// # Examples /// # Examples
/// ///
/// Looks up a series of four elements. The first is found, with a /// Looks up a series of four elements. The first is found, with a
@ -2129,6 +2135,12 @@ impl<T> [T] {
/// [`Result::Err`] is returned, containing the index where a matching /// [`Result::Err`] is returned, containing the index where a matching
/// element could be inserted while maintaining sorted order. /// element could be inserted while maintaining sorted order.
/// ///
/// See also [`binary_search`], [`binary_search_by_key`], and [`partition_point`].
///
/// [`binary_search`]: #method.binary_search
/// [`binary_search_by_key`]: #method.binary_search_by_key
/// [`partition_point`]: #method.partition_point
///
/// # Examples /// # Examples
/// ///
/// Looks up a series of four elements. The first is found, with a /// Looks up a series of four elements. The first is found, with a
@ -2186,7 +2198,12 @@ impl<T> [T] {
/// [`Result::Err`] is returned, containing the index where a matching /// [`Result::Err`] is returned, containing the index where a matching
/// element could be inserted while maintaining sorted order. /// element could be inserted while maintaining sorted order.
/// ///
/// See also [`binary_search`], [`binary_search_by`], and [`partition_point`].
///
/// [`sort_by_key`]: #method.sort_by_key /// [`sort_by_key`]: #method.sort_by_key
/// [`binary_search`]: #method.binary_search
/// [`binary_search_by`]: #method.binary_search_by
/// [`partition_point`]: #method.partition_point
/// ///
/// # Examples /// # Examples
/// ///
@ -3399,6 +3416,12 @@ impl<T> [T] {
/// If this slice is not partitioned, the returned result is unspecified and meaningless, /// If this slice is not partitioned, the returned result is unspecified and meaningless,
/// as this method performs a kind of binary search. /// as this method performs a kind of binary search.
/// ///
/// See also [`binary_search`], [`binary_search_by`], and [`binary_search_by_key`].
///
/// [`binary_search`]: #method.binary_search
/// [`binary_search_by`]: #method.binary_search_by
/// [`binary_search_by_key`]: #method.binary_search_by_key
///
/// # Examples /// # Examples
/// ///
/// ``` /// ```