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
use std::{
collections::{BTreeMap, BTreeSet},
fmt::Debug,
};
use super::util::ComponentPath;
use crate::{
ir::{ContextField, Vid},
util::{BTreeMapOccupiedError, BTreeMapTryInsertExt},
};
#[derive(Debug, Default)]
pub(super) struct TagHandler<'a> {
tags: BTreeMap<&'a str, TagEntry<'a>>,
used_tags: BTreeSet<&'a str>,
component_imported_tags: Vec<(Vid, Vec<ContextField>)>,
}
#[derive(Debug, Clone)]
pub(super) struct TagEntry<'a> {
pub(super) name: &'a str,
pub(super) field: ContextField,
pub(super) path: ComponentPath,
}
impl<'a> TagEntry<'a> {
fn new(name: &'a str, field: ContextField, path: ComponentPath) -> Self {
Self { name, field, path }
}
}
impl<'a> TagHandler<'a> {
#[inline]
pub(super) fn new() -> Self {
Default::default()
}
pub(super) fn register_tag(
&mut self,
name: &'a str,
field: ContextField,
path: &ComponentPath,
) -> Result<(), BTreeMapOccupiedError<'_, &'a str, TagEntry<'a>>> {
self.tags
.insert_or_error(name, TagEntry::new(name, field, path.clone()))?;
Ok(())
}
pub(super) fn begin_subcomponent(&mut self, component_root: Vid) {
self.component_imported_tags.push((component_root, vec![]));
}
pub(super) fn end_subcomponent(&mut self, component_root: Vid) -> Vec<ContextField> {
let (expected_vid, external_tags) = self.component_imported_tags.pop().unwrap();
assert_eq!(expected_vid, component_root);
external_tags
}
pub(super) fn reference_tag(
&mut self,
name: &str,
use_path: &ComponentPath,
use_vid: Vid,
) -> Result<&TagEntry, TagLookupError> {
let entry = self
.tags
.get(name)
.ok_or_else(|| TagLookupError::UndefinedTag(name.to_string()))?;
if entry.path.is_parent(use_path) {
if entry.field.vertex_id <= use_vid {
if &entry.path != use_path {
let importing_component_root = use_path[entry.path.len()];
let (component_root, imported_tags) = self
.component_imported_tags
.get_mut(entry.path.len() - 1)
.unwrap();
assert_eq!(*component_root, importing_component_root);
imported_tags.push(entry.field.clone());
}
self.used_tags.insert(entry.name);
Ok(entry)
} else {
Err(TagLookupError::TagUsedBeforeDefinition(name.to_string()))
}
} else {
Err(TagLookupError::TagDefinedInsideFold(name.to_string()))
}
}
pub(super) fn finish(self) -> Result<(), BTreeSet<&'a str>> {
let unused_tags: BTreeSet<_> = self
.tags
.keys()
.copied()
.into_iter()
.filter(|x| !self.used_tags.contains(x))
.collect();
if unused_tags.is_empty() {
Ok(())
} else {
Err(unused_tags)
}
}
}
pub(super) enum TagLookupError {
UndefinedTag(String),
TagUsedBeforeDefinition(String),
TagDefinedInsideFold(String),
}