language-servers/rust-analyzer
1
0
Fork 0
mirror of https://github.com/rust-lang/rust-analyzer.git synced 2025-10-02 06:41:48 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

A couple of small improvements to ra_prof printing

Browse source 
Based on suggestions from @matklad.

Signed-off-by: Michal Terepeta <michal.terepeta@gmail.com>
This commit is contained in:
Michal Terepeta 2020-01-29 20:55:35 +01:00
parent 39cbb6b620
commit 644c383f65
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
crates/ra_prof/src/lib.rs
View file

@ -271,10 +271,10 @@ fn print_for_idx(
/// In other words, a postorder of the call graph. In particular, the root is the last element of /// In other words, a postorder of the call graph. In particular, the root is the last element of
/// `msgs`. /// `msgs`.
fn idx_to_children(msgs: &[Message]) -> Vec<Vec<usize>> { fn idx_to_children(msgs: &[Message]) -> Vec<Vec<usize>> {
// Initialize with the index of the root; `ancestors` should be never empty. // Initialize with the index of the root; `msgs` and `ancestors` should be never empty.
assert!(!msgs.is_empty());
let mut ancestors = vec![msgs.len() - 1]; let mut ancestors = vec![msgs.len() - 1];
let mut result: Vec<Vec<usize>> = vec![]; let mut result: Vec<Vec<usize>> = vec![vec![]; msgs.len()];
result.resize_with(msgs.len(), Default::default);
for (idx, msg) in msgs[..msgs.len() - 1].iter().enumerate().rev() { for (idx, msg) in msgs[..msgs.len() - 1].iter().enumerate().rev() {
// We need to find the parent of the current message, i.e., the last ancestor that has a // We need to find the parent of the current message, i.e., the last ancestor that has a
// level lower than the current message. // level lower than the current message.