2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#1579 in Text processing

Download history 1954/week @ 2024-03-13 2423/week @ 2024-03-20 1776/week @ 2024-03-27 2090/week @ 2024-04-03 1742/week @ 2024-04-10 1728/week @ 2024-04-17 2549/week @ 2024-04-24 1934/week @ 2024-05-01 2189/week @ 2024-05-08 2422/week @ 2024-05-15 2297/week @ 2024-05-22 2666/week @ 2024-05-29 3458/week @ 2024-06-05 3315/week @ 2024-06-12 2495/week @ 2024-06-19 2797/week @ 2024-06-26

12,492 downloads per month
Used in 14 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