reglibcpp  1.0.0
(Naïve) C++ implementation of models for regular languages
Public Member Functions | Public Attributes | List of all members
reg::nfa::builder::pImpl Struct Reference

Private implementation details of NFA builders. More...

Public Member Functions

 pImpl ()=default
 Constructs empty private implementation object. More...
 
 pImpl (string &initial, unordered_set< string > &acceptingStates, unordered_set< char32_t > &alphabet, unordered_map< string, unordered_map< char32_t, unordered_set< string >>> &transitions)
 Constructs private implementation object with provided members. More...
 

Public Attributes

string initial
 Name of the prospective NFA's initial state. More...
 
unordered_set< string > acceptingStates
 Set of names of the prospective NFA's accept states. More...
 
unordered_set< char32_t > alphabet
 Set of symbols processable by the prospective NFA. More...
 
unordered_map< string, unordered_map< char32_t, unordered_set< string > > > transitions
 Transition function (state × symbol → set of states) of the prospective NFA. More...
 

Detailed Description

Private implementation details of NFA builders.

Definition at line 328 of file nfa.cpp.

Constructor & Destructor Documentation

◆ pImpl() [1/2]

reg::nfa::builder::pImpl::pImpl ( )
default

Constructs empty private implementation object.

◆ pImpl() [2/2]

reg::nfa::builder::pImpl::pImpl ( string &  initial,
unordered_set< string > &  acceptingStates,
unordered_set< char32_t > &  alphabet,
unordered_map< string, unordered_map< char32_t, unordered_set< string >>> &  transitions 
)
inline

Constructs private implementation object with provided members.

Definition at line 340 of file nfa.cpp.

345  :
346  initial(move(initial)),
348  alphabet(move(alphabet)),
349  transitions(move(transitions)) {}
string initial
Name of the prospective NFA&#39;s initial state.
Definition: nfa.cpp:329
unordered_set< char32_t > alphabet
Set of symbols processable by the prospective NFA.
Definition: nfa.cpp:331
unordered_set< string > acceptingStates
Set of names of the prospective NFA&#39;s accept states.
Definition: nfa.cpp:330
unordered_map< string, unordered_map< char32_t, unordered_set< string > > > transitions
Transition function (state × symbol → set of states) of the prospective NFA.
Definition: nfa.cpp:332

Member Data Documentation

◆ acceptingStates

unordered_set<string> reg::nfa::builder::pImpl::acceptingStates

Set of names of the prospective NFA's accept states.

Definition at line 330 of file nfa.cpp.

◆ alphabet

unordered_set<char32_t> reg::nfa::builder::pImpl::alphabet

Set of symbols processable by the prospective NFA.

Definition at line 331 of file nfa.cpp.

◆ initial

string reg::nfa::builder::pImpl::initial

Name of the prospective NFA's initial state.

Definition at line 329 of file nfa.cpp.

◆ transitions

unordered_map<string,unordered_map<char32_t,unordered_set<string> > > reg::nfa::builder::pImpl::transitions

Transition function (state × symbol → set of states) of the prospective NFA.

Also encodes the set of states in its set of keys.

Definition at line 332 of file nfa.cpp.


The documentation for this struct was generated from the following file: