mathieu/granite-rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Add time complexities to linked_list.rs

Browse source
This commit is contained in:
Takashi Idobe 2021-09-23 17:58:02 -05:00 • committed by GitHub
parent 2b862bed98
commit d63e0f0e47
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 10 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -631,6 +631,8 @@ impl<T> LinkedList<T> {
/// Returns `true` if the `LinkedList` contains an element equal to the
/// given value.
///
/// This operation should compute in *O*(*n*) time.
///
/// # Examples
///
/// ```
@ -655,6 +657,8 @@ 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.
///
/// # Examples
///
@ -675,6 +679,8 @@ 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.
///
/// # Examples
///
@ -701,6 +707,8 @@ 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.
///
/// # Examples
///
@ -721,6 +729,8 @@ 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.
///
/// # Examples
///