render_regex 0.0.0

SVG visualization of regex DFAs.
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

//! Intermediate representation (IR) for visualizing regex structures like AST, NFA, DFA.

use std::collections::HashMap;

#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum NodeType {
    Ast,
    Nfa,
    Dfa,
    Generic
}

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum ShapeHint {
    Circle,
    Box,
    Diamond,
}

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum EdgeStyle {
    Solid,
    Dashed,
    Dotted,
}

#[derive(Debug, Clone)]
pub struct VisualNode {
    pub id: usize,
    pub label: String,
    pub shape: ShapeHint,
    pub is_accept: bool,
    pub node_type: NodeType,
}

#[derive(Debug, Clone)]
pub struct VisualEdge {
    pub from: usize,
    pub to: usize,
    pub label: String,
    pub bend_offset: f32,
    pub style: EdgeStyle,
}

#[derive(Debug, Clone)]
pub struct VisualGraph {
    pub nodes: Vec<VisualNode>,
    pub edges: Vec<VisualEdge>,
}

impl VisualGraph {
    pub fn new() -> Self {
        Self { nodes: vec![], edges: vec![] }
    }

    pub fn with_capacity(n: usize, e: usize) -> Self {
        Self {
            nodes: Vec::with_capacity(n),
            edges: Vec::with_capacity(e),
        }
    }

    pub fn node_map(&self) -> HashMap<usize, &VisualNode> {
        self.nodes.iter().map(|n| (n.id, n)).collect()
    }
}