2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#1409 in Text processing

Download history 1031/week @ 2023-12-14 584/week @ 2023-12-21 538/week @ 2023-12-28 705/week @ 2024-01-04 1292/week @ 2024-01-11 1190/week @ 2024-01-18 1142/week @ 2024-01-25 1523/week @ 2024-02-01 1234/week @ 2024-02-08 1175/week @ 2024-02-15 1250/week @ 2024-02-22 1302/week @ 2024-02-29 1504/week @ 2024-03-07 1910/week @ 2024-03-14 2473/week @ 2024-03-21 1343/week @ 2024-03-28

7,453 downloads per month
Used in 13 crates (9 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