sascha
/
difftastic
mirror of https://github.com/Wilfred/difftastic/
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Tweak logging levels to make node counts more prominent

pull/261/head
Wilfred Hughes 2022-04-17 19:30:58 +07:00
parent 2b7a97f322
commit 83e56bdf27
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/dijkstra.rs
Unescape Escape View File

@ -55,7 +55,7 @@ fn shortest_path(start: Vertex) -> Vec<(Edge, Vertex)> {
} }
}; };
info!( debug!(
"Found predecessors for {} vertices (hashmap key: {} bytes, value: {} bytes), with {} left on heap.", "Found predecessors for {} vertices (hashmap key: {} bytes, value: {} bytes), with {} left on heap.",
predecessors.len(), predecessors.len(),
std::mem::size_of::<Vertex>(), std::mem::size_of::<Vertex>(),
@ -74,13 +74,13 @@ fn shortest_path(start: Vertex) -> Vec<(Edge, Vertex)> {
} }
route.reverse(); route.reverse();
info!("Found a path of {} with cost {}.", route.len(), cost); debug!("Found a path of {} with cost {}.", route.len(), cost);
let print_length = if env::var("DFT_VERBOSE").is_ok() { let print_length = if env::var("DFT_VERBOSE").is_ok() {
50 50
} else { } else {
5 5
}; };
info!( debug!(
"Initial {} items on path: {:#?}", "Initial {} items on path: {:#?}",
print_length, print_length,
route route

2
src/tree_sitter_parser.rs
Unescape Escape View File

@ -901,7 +901,7 @@ fn syntax_from_cursor<'a>(
let position = nl_pos.from_offsets(node.start_byte(), node.end_byte()); let position = nl_pos.from_offsets(node.start_byte(), node.end_byte());
let content = &src[node.start_byte()..node.end_byte()]; let content = &src[node.start_byte()..node.end_byte()];
warn!( debug!(
"Tree-sitter syntax error at {:?}: {}", "Tree-sitter syntax error at {:?}: {}",
position.get(0), position.get(0),
content content