harper 0.0.1

A library to implement SSGs.
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83

use std::sync::Arc;

use derive_more::Debug;
use rustc_hash::FxHashMap;

use crate::fstree::{EntryId, FsTree};
use crate::taxonomy::*;

#[derive(Debug)]
pub struct Site {
    #[debug(ignore)]
    pub tree: Arc<FsTree>,
    pub items: Vec<Arc<Item>>,
    pub collections: FxHashMap<EntryId, Arc<Collection>>,
}

impl Site {
    pub fn new(tree: Arc<FsTree>) -> Site {
        Site { tree, collections: FxHashMap::default(), items: vec![] }
    }

    pub fn get_or_insert_collection(&mut self, root: EntryId) -> &mut Collection {
        let arc = self.collections.entry(root)
            .or_insert_with(|| Arc::new(Collection::new(self.tree.clone(), root)));

        Arc::get_mut(arc).expect("&mut -> &mut")
    }

    pub fn new_resource(&mut self, id: EntryId) -> Arc<Item> {
        let item = Arc::new(Item::new(self.tree.clone(), id));
        self.items.push(item.clone());
        item
    }
}

impl Site {
    fn vis_heading(&self, siblings: &[bool], id: EntryId, root: EntryId, prefix: &str) {
        let (entry, root) = (&self.tree[id], &self.tree[root]);
        for (j, sibling) in siblings.iter().enumerate() {
            match (sibling, j == siblings.len() - 1) {
                (false, false) => print!("    "),
                (false, true) => print!("└── "),
                (true, false) => print!("│   "),
                (true, true) => print!("├── "),
            }
        }

        println!("{prefix}{}", entry.path.strip_prefix(&root.path).unwrap().display());
    }

    pub fn visualize(&self) {
        let root_id = self.tree.root_id();
        self.vis_heading(&[], root_id, root_id, "🗂 ");

        for (i, collection) in self.collections.values().enumerate() {
            let i_sib = i < self.collections.len() - 1;
            self.vis_heading(&[i_sib], collection.root, self.tree.root_id(), "");

            for (j, (&data_id, data_items)) in collection.data.iter().enumerate() {
                let j_sib = !collection.items.is_empty()
                    || collection.index.is_some()
                    || j < collection.data.len() - 1;

                self.vis_heading(&[i_sib, j_sib], data_id, collection.root, "📦 ");

                for (k, item) in data_items.iter().enumerate() {
                    let k_sib = k < data_items.len() - 1;
                    self.vis_heading(&[i_sib, j_sib, k_sib], item.id, data_id, "💾 ");
                }
            }

            if let Some(item) = &collection.index {
                let j_sib = !collection.items.is_empty();
                self.vis_heading(&[i_sib, j_sib], item.id, collection.root, "📑 ");
            }

            for (j, item) in collection.items.iter().enumerate() {
                let j_sib = j < collection.items.len() - 1;
                self.vis_heading(&[i_sib, j_sib], item.id, collection.root, "📝 ");
            }
        }
    }
}