Mirrors/rust
1
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2026-05-22 02:00:00 +03:00
Code Issues Packages Projects Releases Wiki Activity

adding algorithm explanation for partition_in_place iter method and bounding complexity to current implementation

Browse Source
This commit is contained in:
Satyarth Agrahari
2021-05-18 07:59:16 +05:30
parent 196050305c
commit 85e4177184
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
library/core/src/iter/traits/iterator.rs
+4
View File
@@ -1849,6 +1849,10 @@ fn extend<'a, T, B: Extend<T>>(
///
/// The relative order of partitioned items is not maintained.
///
/// # Current implementation
/// Current algorithms tries finding the first element for which the predicate evaluates
/// to false, and the last element for which it evaluates to true and repeatedly swaps them.
///
/// Time Complexity: *O*(*N*)
///
/// See also [`is_partitioned()`] and [`partition()`].