Replace predecessor with range in collections documentation

Fixes #81548.
This commit is contained in:
Konrad Borowski 2021-01-30 14:24:00 +01:00
parent ebaea9e850
commit 56c27360b1

View File

@ -110,10 +110,10 @@
//! //!
//! For Sets, all operations have the cost of the equivalent Map operation. //! For Sets, all operations have the cost of the equivalent Map operation.
//! //!
//! | | get | insert | remove | predecessor | append | //! | | get | insert | remove | range | append |
//! |--------------|-----------|-----------|-----------|-------------|--------| //! |--------------|-----------|-----------|-----------|-----------|--------|
//! | [`HashMap`] | O(1)~ | O(1)~* | O(1)~ | N/A | N/A | //! | [`HashMap`] | O(1)~ | O(1)~* | O(1)~ | N/A | N/A |
//! | [`BTreeMap`] | O(log(n)) | O(log(n)) | O(log(n)) | O(log(n)) | O(n+m) | //! | [`BTreeMap`] | O(log(n)) | O(log(n)) | O(log(n)) | O(log(n)) | O(n+m) |
//! //!
//! # Correct and Efficient Usage of Collections //! # Correct and Efficient Usage of Collections
//! //!