2 releases

Uses old Rust 2015

0.1.1 Jun 5, 2018
0.1.0 Dec 12, 2017

#926 in Text processing

Download history 3553/week @ 2024-09-24 2937/week @ 2024-10-01 3066/week @ 2024-10-08 3773/week @ 2024-10-15 7216/week @ 2024-10-22 6199/week @ 2024-10-29 5118/week @ 2024-11-05 3347/week @ 2024-11-12 2340/week @ 2024-11-19 2378/week @ 2024-11-26 2571/week @ 2024-12-03 2592/week @ 2024-12-10 2682/week @ 2024-12-17 1374/week @ 2024-12-24 1422/week @ 2024-12-31 1927/week @ 2025-01-07

7,976 downloads per month
Used in 16 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