|
19 | 19 |
|
20 | 20 | use indexmap::IndexMap; |
21 | 21 |
|
22 | | -use crate::HashMap; |
23 | 22 | use crate::display::{DisplayAs, DisplayFormatType}; |
24 | 23 | use crate::tree_node::{TreeNode, TreeNodeRecursion}; |
25 | 24 | use std::collections::BTreeMap; |
@@ -155,9 +154,9 @@ impl RenderTree { |
155 | 154 | // Rigure out what to render. |
156 | 155 | let mut render_text = String::new(); |
157 | 156 | if render_y == 0 { |
158 | | - render_text = node.name.clone(); |
| 157 | + render_text.clone_from(&node.name); |
159 | 158 | } else if render_y <= extra_info[x].len() { |
160 | | - render_text = extra_info[x][render_y - 1].clone(); |
| 159 | + render_text.clone_from(&extra_info[x][render_y - 1]); |
161 | 160 | } |
162 | 161 |
|
163 | 162 | render_text = Self::adjust_text_for_rendering( |
@@ -316,11 +315,7 @@ impl RenderTree { |
316 | 315 | let hide_key = key == "__main_content__"; |
317 | 316 |
|
318 | 317 | if str.is_empty() { |
319 | | - str = if hide_key{ |
320 | | - str |
321 | | - }else{ |
322 | | - key.to_string() |
323 | | - }; |
| 318 | + str = if hide_key { str } else { key.to_string() }; |
324 | 319 | } else if !is_multiline && total_size < available_width { |
325 | 320 | str = if hide_key { |
326 | 321 | str |
@@ -570,7 +565,7 @@ impl RenderTree { |
570 | 565 | fn get_node(&self, x: usize, y: usize) -> Option<Arc<RenderTreeNode>> { |
571 | 566 | if x >= self.width || y >= self.height { |
572 | 567 | return None; |
573 | | - }cargo test --test sqllogictests -- explain_tree.slt --nocapture |
| 568 | + } |
574 | 569 |
|
575 | 570 | let pos = self.get_position(x, y); |
576 | 571 | self.nodes.get(pos).and_then(|node| node.clone()) |
|
0 commit comments