Struct regex_dfa_gen::dfa::Dfa

pub struct Dfa {
    pub states: Vec<DfaState>,
}

Fields

states: Vec<DfaState>

Implementations

impl Dfa

pub fn render_to<W: Write>(&self, w: &mut W) -> Result<()>

get the dot file.

use regex_dfa_gen::ast::AstNode;
use regex_dfa_gen::nfa::Nfa;
use regex_dfa_gen::dfa::{ DfaBuilder, Dfa };
use std::fs::File;
 
let ast : AstNode = r"([A-Z]*|A[a-z]*?)H".parse::<AstNode>().unwrap();
let nfa = Nfa::from_ast(&ast);
let dfa = DfaBuilder::from_nfa(&nfa).to_dfa();
 
let mut f = File::create("dfa.dot").unwrap();
dfa.render_to(&mut f).expect("msg");

pub fn from_nfa(nfa: &Nfa) -> Dfa

pub fn replace(self, pair: HashMap<usize, usize>) -> Dfa

pub fn opt(self) -> Dfa

Trait Implementations

impl<'a> GraphWalk<'a, (usize, Option<usize>), (usize, usize, Range<char>, bool)> for Dfa

fn nodes(&self) -> Nodes<'a, (usize, Option<usize>)>

Returns all the nodes in this graph.

fn edges(&'a self) -> Edges<'a, (usize, usize, CharRange, bool)>

Returns all of the edges in this graph.

fn source(&self, e: &(usize, usize, CharRange, bool)) -> (usize, Option<usize>)

The source node for edge.

fn target(&self, e: &(usize, usize, CharRange, bool)) -> (usize, Option<usize>)

The target node for edge.

impl<'a> Labeller<'a, (usize, Option<usize>), (usize, usize, Range<char>, bool)> for Dfa

fn graph_id(&'a self) -> Id<'a>

Must return a DOT compatible identifier naming the graph.

fn node_id(&'a self, n: &(usize, Option<usize>)) -> Id<'a>

Maps n to a unique identifier with respect to self. The implementer is responsible for ensuring that the returned name is a valid DOT identifier.

fn node_label<'b>(&'b self, n: &(usize, Option<usize>)) -> LabelText<'b>

Maps n to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is just the output from node_id.

fn edge_label<'b>(
    &'b self,
    (_, _, ch, _): &(usize, usize, CharRange, bool)
) -> LabelText<'b>

Maps e to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is in fact the empty string.

fn edge_color<'b>(
    &'b self,
    (_, _, _, is_greedy): &(usize, usize, CharRange, bool)
) -> Option<LabelText<'b>>

Maps e to one of the [graphviz color names][1]. If None is returned, no color attribute is specified.

fn node_shape(&'a self, _node: &N) -> Option<LabelText<'a>>

Maps n to one of the [graphviz shape names][1]. If None is returned, no shape attribute is specified.

fn node_style(&'a self, _n: &N) -> Style

Maps n to a style that will be used in the rendered output.

fn node_color(&'a self, _node: &N) -> Option<LabelText<'a>>

Maps n to one of the [graphviz color names][1]. If None is returned, no color attribute is specified.

fn edge_end_arrow(&'a self, _e: &E) -> Arrow

Maps e to arrow style that will be used on the end of an edge. Defaults to default arrow style.

fn edge_start_arrow(&'a self, _e: &E) -> Arrow

Maps e to arrow style that will be used on the end of an edge. Defaults to default arrow style.

fn edge_style(&'a self, _e: &E) -> Style

Maps e to a style that will be used in the rendered output.

fn kind(&self) -> Kind

The kind of graph, defaults to Kind::Digraph.