Skip to content

Commit

Permalink
unitalicize O(1) complexities
Browse files Browse the repository at this point in the history
  • Loading branch information
Takashiidobe authored Sep 24, 2021
1 parent cb1c06f commit cebba31
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions library/alloc/src/collections/linked_list.rs
Original file line number Diff line number Diff line change
Expand Up @@ -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
///
Expand All @@ -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
///
Expand Down Expand Up @@ -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
///
Expand All @@ -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
///
Expand Down

0 comments on commit cebba31

Please sign in to comment.