regast-core 0.1.0

Parse-tree matching backends for regast
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

use regast_syntax::{AnchorKind, NodeId};

#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub struct IrId(pub(crate) u32);

impl IrId {
    #[must_use]
    pub const fn index(self) -> u32 {
        self.0
    }
}

#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub struct ClassSetId(pub(crate) u32);

#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub enum Prov {
    Ast(NodeId),
    Synth(NodeId),
}

#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub enum IrKind {
    Zero,
    One,
    Anchor(AnchorKind, Prov),
    Class(ClassSetId, Prov),
    Alt(IrId, IrId, Prov, bool),
    Seq(IrId, IrId, Prov),
    Star(IrId, Prov, bool),
}

impl IrKind {
    #[must_use]
    pub const fn provenance(&self) -> Option<Prov> {
        match self {
            Self::Zero | Self::One => None,
            Self::Anchor(_, prov)
            | Self::Class(_, prov)
            | Self::Alt(_, _, prov, _)
            | Self::Seq(_, _, prov)
            | Self::Star(_, prov, _) => Some(*prov),
        }
    }
}