adoctra-core 0.0.2

Core parser and document model for the adoctra AsciiDoc toolchain
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

//! Source edits from the shared ordered quote matcher. The later syntax scan
//! reads original coordinates and never scans generated text as new quotes.
use crate::attribute_quotes::Quote;
use crate::inline_pass::Passes;
use crate::substitution_context::Evaluation;
use crate::{AttributeFormat as F, Inline, Span};
use std::collections::BTreeMap;

pub(crate) struct Edit {
    pub end: usize,
    pub nodes: Vec<Inline>,
}

pub(crate) struct Quotes {
    pub edits: BTreeMap<usize, Edit>,
    pub matches: Vec<Quote>,
    pub passes: Passes,
}

impl Quotes {
    pub fn new(src: &str, base: usize, attrs: &mut Evaluation<'_>, compat: bool) -> Self {
        let (text, mut passes) = Passes::extract(src, base, attrs, compat);
        let mut matches = Vec::new();
        let text = crate::attribute_quotes::apply_text(
            text,
            compat,
            attrs,
            &mut matches,
            true,
            &mut passes.diagnostics,
        );
        let (text, refs) = crate::inline_attributes::apply(text, attrs, &mut passes.diagnostics);
        let mut edits: BTreeMap<usize, Edit> = BTreeMap::new();
        let mut covered = base;
        for node in crate::inline_attributes::nodes(text, refs) {
            let span = node.span();
            if span.start > covered {
                edits.insert(
                    covered,
                    Edit {
                        end: span.start,
                        nodes: Vec::new(),
                    },
                );
            }
            covered = covered.max(span.end);
            if matches!(&node, Inline::Text { value, .. }
                if src.get(span.start - base..span.end - base) == Some(value.as_str()))
            {
                continue;
            }
            // A decorated typographic opener emits both a wrapper and a quote
            // from overlapping source ranges. Apply both in one source edit.
            let start = edits
                .range(..=span.start)
                .next_back()
                .filter(|(_, edit)| edit.end > span.start)
                .map_or(span.start, |(&start, _)| start);
            let edit = edits.entry(start).or_insert_with(|| Edit {
                end: span.end,
                nodes: Vec::new(),
            });
            edit.end = edit.end.max(span.end);
            edit.nodes.push(node);
        }
        if covered < base + src.len() {
            edits.insert(
                covered,
                Edit {
                    end: base + src.len(),
                    nodes: Vec::new(),
                },
            );
        }
        // Metadata can consume {name} before normal attribute expansion. Keep
        // an empty source node just as the later link matcher does, so tools
        // can still locate the declaration use without rendering it twice.
        let closes: Vec<_> = src.match_indices('}').map(|(at, _)| at).collect();
        for (at, _) in src.match_indices('{') {
            if passes.contains(base + at) || (at > 0 && src.as_bytes()[at - 1] == b'\\') {
                continue;
            }
            let reference = crate::inline_attributes::reference(src, at).or_else(|| {
                attrs
                    .stateful()
                    .then(|| crate::substitution_context::expression(src, at, &closes))
                    .flatten()
            });
            let Some((end, name, false)) = reference else {
                continue;
            };
            if let Some((_, edit)) = edits.range_mut(..=base + at).next_back() {
                if base + end <= edit.end && !edit.nodes.iter().any(|n|
                    matches!(n, Inline::AttributeRef { span, .. } if span.start == base + at)) {
                    edit.nodes.push(Inline::AttributeRef {
                        name: name.into(), value: Some(String::new()), parts: Vec::new(),
                        span: Span::new(base + at, base + end),
                    });
                }
            }
        }
        matches.sort_by_key(|q| q.span.start);
        Self {
            edits,
            matches,
            passes,
        }
    }

    pub fn rebuild(&self, nodes: Vec<Inline>, range: std::ops::Range<usize>) -> Vec<Inline> {
        let start = self.matches.partition_point(|q| q.span.start < range.start);
        let templates = self.matches[start..]
            .iter()
            .take_while(|q| q.span.start < range.end)
            .filter(|q| !q.decorated && q.span.end <= range.end)
            .filter_map(|q| node(q.format?, q.span))
            .collect();
        crate::attribute_macros::rebuild(nodes, templates)
    }

    pub fn syntax(&self) -> impl Iterator<Item = Inline> + '_ {
        self.matches.iter().filter_map(|q| node(q.format?, q.span))
    }
}

pub(crate) fn node(kind: F, span: Span) -> Option<Inline> {
    let children = Vec::new();
    Some(match kind {
        F::Strong => Inline::Strong { children, span },
        F::Emphasis => Inline::Emphasis { children, span },
        F::Monospace => Inline::Monospace { children, span },
        F::Mark | F::Span => Inline::Mark { children, span },
        F::Superscript => Inline::Superscript { children, span },
        F::Subscript => Inline::Subscript { children, span },
    })
}