bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

consistent big O notation

Browse source
This commit is contained in:
r00ster91 2021-09-24 12:44:28 +02:00
parent 197fc8591e
commit 956f87fb04
9 changed files with 26 additions and 25 deletions
Download patch file Download diff file Expand all files Collapse all files

2
compiler/rustc_data_structures/src/graph/scc/mod.rs
View file

@ -3,7 +3,7 @@
//! Also computes as the resulting DAG if each SCC is replaced with a
//! node in the graph. This uses [Tarjan's algorithm](
//! https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)
//! that completes in *O(n)* time.
//! that completes in *O*(*n*) time.
use crate::fx::FxHashSet;
use crate::graph::vec_graph::VecGraph;

2
compiler/rustc_data_structures/src/sorted_map.rs
View file

@ -9,7 +9,7 @@ mod index_map;
pub use index_map::SortedIndexMultiMap;
/// `SortedMap` is a data structure with similar characteristics as BTreeMap but
/// slightly different trade-offs: lookup, insertion, and removal are O(log(N))
/// slightly different trade-offs: lookup, insertion, and removal are *O*(log(*n*))
/// and elements can be iterated in order cheaply.
///
/// `SortedMap` can be faster than a `BTreeMap` for small sizes (<50) since it