liwe 0.0.68

IWE core library
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153

use std::collections::{HashMap, HashSet};

use crate::model::{Key, NodeId};

use super::{graph_node::GraphNode, Graph};

#[derive(Default, Clone)]
pub struct RefIndex {
    block_references: HashMap<Key, HashSet<NodeId>>,
    inline_references: HashMap<Key, HashSet<NodeId>>,
}

impl RefIndex {
    pub fn new() -> RefIndex {
        RefIndex::default()
    }

    pub fn merge(&mut self, other: RefIndex) {
        for (key, set) in other.block_references {
            self.block_references.entry(key).or_default().extend(set);
        }
        for (key, set) in other.inline_references {
            self.inline_references.entry(key).or_default().extend(set);
        }
    }

    pub fn get_block_references_to(&self, key: &Key) -> Vec<NodeId> {
        self.block_references
            .get(key)
            .map(|set| set.iter().cloned().collect())
            .unwrap_or_default()
    }

    pub fn get_inline_references_to(&self, key: &Key) -> Vec<NodeId> {
        self.inline_references
            .get(key)
            .map(|set| set.iter().cloned().collect())
            .unwrap_or_default()
    }

    pub fn block_reference_target_keys(&self) -> impl Iterator<Item = &Key> {
        self.block_references.keys()
    }

    pub fn inline_reference_target_keys(&self) -> impl Iterator<Item = &Key> {
        self.inline_references.keys()
    }

    pub fn index_node(&mut self, graph: &Graph, node_id: NodeId) {
        match graph.graph_node(node_id) {
            GraphNode::Reference(reference) => {
                self.block_references
                    .entry(reference.key().clone())
                    .or_default()
                    .insert(reference.id());

                if let Some(child_id) = reference.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Section(section) => {
                for key in graph.get_line(section.line_id()).ref_keys() {
                    self.inline_references
                        .entry(key.clone())
                        .or_default()
                        .insert(section.id());
                }
                if let Some(child_id) = section.child_id() {
                    self.index_node(graph, child_id);
                }

                if let Some(child_id) = section.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Leaf(leaf) => {
                for key in graph.get_line(leaf.line_id()).ref_keys() {
                    self.inline_references
                        .entry(key.clone())
                        .or_default()
                        .insert(leaf.id());
                }

                if let Some(child_id) = leaf.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Document(document) => {
                if let Some(child_id) = document.child_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Quote(quote) => {
                if let Some(child_id) = quote.child_id() {
                    self.index_node(graph, child_id);
                }
                if let Some(child_id) = quote.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::BulletList(bullet_list) => {
                if let Some(child_id) = bullet_list.child_id() {
                    self.index_node(graph, child_id);
                }
                if let Some(child_id) = bullet_list.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::OrderedList(ordered_list) => {
                if let Some(child_id) = ordered_list.child_id() {
                    self.index_node(graph, child_id);
                }
                if let Some(child_id) = ordered_list.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Empty => {}
            GraphNode::Raw(raw_leaf) => {
                if let Some(child_id) = raw_leaf.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::HorizontalRule(horizontal_rule) => {
                if let Some(child_id) = horizontal_rule.next_id() {
                    self.index_node(graph, child_id);
                }
            }
            GraphNode::Table(table) => {
                for line_id in table.header() {
                    for key in graph.get_line(*line_id).ref_keys() {
                        self.inline_references
                            .entry(key.clone())
                            .or_default()
                            .insert(table.id());
                    }
                }
                for row in table.rows() {
                    for line_id in row {
                        for key in graph.get_line(*line_id).ref_keys() {
                            self.inline_references
                                .entry(key.clone())
                                .or_default()
                                .insert(table.id());
                        }
                    }
                }
                if let Some(next_id) = table.next_id() {
                    self.index_node(graph, next_id);
                }
            }
        }
    }
}