2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#488 in Text processing

Download history 603/week @ 2022-12-07 541/week @ 2022-12-14 499/week @ 2022-12-21 406/week @ 2022-12-28 920/week @ 2023-01-04 738/week @ 2023-01-11 714/week @ 2023-01-18 783/week @ 2023-01-25 834/week @ 2023-02-01 601/week @ 2023-02-08 833/week @ 2023-02-15 1569/week @ 2023-02-22 1481/week @ 2023-03-01 853/week @ 2023-03-08 850/week @ 2023-03-15 874/week @ 2023-03-22

4,689 downloads per month
Used in 20 crates (7 directly)

MIT license

5KB

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