Struct Dfa

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

Fields§

§states: Vec<DfaState>

Implementations§

Source§

impl Dfa

Source

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");
Source

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

Source

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

Source

pub fn opt(self) -> Dfa

Trait Implementations§

Source§

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

Source§

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

Returns all the nodes in this graph.
Source§

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

Returns all of the edges in this graph.
Source§

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

The source node for edge.
Source§

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

The target node for edge.
Source§

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

Source§

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

Must return a DOT compatible identifier naming the graph.
Source§

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.
Source§

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.
Source§

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.
Source§

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

Maps e to one of the graphviz color names. If None is returned, no color attribute is specified.
Source§

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

Maps n to one of the graphviz shape names. If None is returned, no shape attribute is specified.
Source§

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

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

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

Maps n to one of the graphviz color names. If None is returned, no color attribute is specified.
Source§

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.
Source§

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.
Source§

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

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

fn kind(&self) -> Kind

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

Auto Trait Implementations§

§

impl Freeze for Dfa

§

impl RefUnwindSafe for Dfa

§

impl Send for Dfa

§

impl Sync for Dfa

§

impl Unpin for Dfa

§

impl UnwindSafe for Dfa

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.