2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#1294 in Text processing

Download history 3059/week @ 2025-02-05 2310/week @ 2025-02-12 2744/week @ 2025-02-19 2797/week @ 2025-02-26 3134/week @ 2025-03-05 3471/week @ 2025-03-12 3595/week @ 2025-03-19 3021/week @ 2025-03-26 2424/week @ 2025-04-02 2505/week @ 2025-04-09 3228/week @ 2025-04-16 3820/week @ 2025-04-23 3462/week @ 2025-04-30 3183/week @ 2025-05-07 2783/week @ 2025-05-14 2603/week @ 2025-05-21

12,611 downloads per month
Used in 19 crates (10 directly)

MIT license

6KB

Crate to write an ascii tree.

 let l1 = Leaf(vec![String::from("line1"), String::from("line2"), String::from("line3"), String::from("line4")]);
 let l2 = Leaf(vec![String::from("only one line")]);
 let n1 = Node(String::from("node 1"), vec![l1.clone(), l2.clone()]);
 let n2 = Node(String::from("node 2"), vec![l2.clone(), l1.clone(), l2.clone()]);
 let n3 = Node(String::from("node 3"), vec![n1.clone(), l1.clone(), l2.clone()]);
 let n4 = Node(String::from("node 4"), vec![n1, n2, n3]);

 let mut output = String::new();
 let _ = write_tree(&mut output, &n4);

The result would be:

 node 4
 ├─ node 1
 │  ├─ line1
 │  │  line2
 │  │  line3
 │  │  line4
 │  └─ only one line
 ├─ node 2
 │  ├─ only one line
 │  ├─ line1
 │  │  line2
 │  │  line3
 │  │  line4
 │  └─ only one line
 └─ node 3
    ├─ node 1
    │  ├─ line1
    │  │  line2
    │  │  line3
    │  │  line4
    │  └─ only one line
    ├─ line1
    │  line2
    │  line3
    │  line4
    └─ only one line

No runtime deps