2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#2902 in Text processing

Download history 6880/week @ 2026-01-31 5905/week @ 2026-02-07 6758/week @ 2026-02-14 9488/week @ 2026-02-21 9406/week @ 2026-02-28 61602/week @ 2026-03-07 49953/week @ 2026-03-14 9551/week @ 2026-03-21 8482/week @ 2026-03-28 8245/week @ 2026-04-04 10598/week @ 2026-04-11 11874/week @ 2026-04-18 16948/week @ 2026-04-25 22287/week @ 2026-05-02 18277/week @ 2026-05-09 12797/week @ 2026-05-16

72,204 downloads per month
Used in 33 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