squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

unitalicize O(1) complexities

Browse source
This commit is contained in:
Takashi Idobe 2021-09-24 08:33:49 -05:00 committed by GitHub
parent cb1c06fdd8
commit cebba31d4a
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
library/alloc/src/collections/linked_list.rs
View file

@ -658,7 +658,7 @@ impl<T> LinkedList<T> {
/// Provides a reference to the front element, or `None` if the list is
/// empty.
///
/// This operation should compute in *O*(*1*) time.
/// This operation should compute in *O*(1) time.
///
/// # Examples
///
@ -680,7 +680,7 @@ impl<T> LinkedList<T> {
/// Provides a mutable reference to the front element, or `None` if the list
/// is empty.
///
/// This operation should compute in *O*(*1*) time.
/// This operation should compute in *O*(1) time.
///
/// # Examples
///
@ -708,7 +708,7 @@ impl<T> LinkedList<T> {
/// Provides a reference to the back element, or `None` if the list is
/// empty.
///
/// This operation should compute in *O*(*1*) time.
/// This operation should compute in *O*(1) time.
///
/// # Examples
///
@ -730,7 +730,7 @@ impl<T> LinkedList<T> {
/// Provides a mutable reference to the back element, or `None` if the list
/// is empty.
///
/// This operation should compute in *O*(*1*) time.
/// This operation should compute in *O*(1) time.
///
/// # Examples
///