tree-flat 0.1.3

TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

/// Create a virtual representation of a folder structure
use tree_flat::prelude::*;

fn main() {
    let mut tree = Tree::with_capacity("Users", 6);

    let mut root = tree.tree_root_mut();

    let mut child = root.push("jhon_doe");
    child.push("file1.rs");
    child.push("file2.rs");

    let mut child = root.push("jane_doe");
    child.push("cat.jpg");

    //All  the data is flat!
    assert_eq!(
        tree.as_data(),
        ["Users", "jhon_doe", "file1.rs", "file2.rs", "jane_doe", "cat.jpg",]
    );
    assert_eq!(tree.as_level(), [0, 1, 2, 2, 1, 2,]);
    assert_eq!(tree.as_parents(), [0, 0, 1, 1, 0, 4,]);

    println!("{}", &tree);

    //Iteration is in pre-order, as was build:
    for path in &tree {
        let level = path.level();
        let parent = path.parent();
        println!("LEVEL {} / PARENT: {} : {}", level, parent, path);
    }
}