next up previous
Next: References Up: Generic programming on automata Previous: Remarks

The algorithms

Generic programming implies that containers interface is minimal and that all algorithms on these containers are implemented outside. All algorithms take the form of a template function defined globally, but unlike STL current implementation we rather split the main file in several ones, sorting the algorithms by ``purpose'' (files containing functions on DFAs show the prefix dfalgo and nfalgo for NFAs) :
dfalgo_stream.hh ASCII streams input/output
dfalgo_lang.hh Algorithms on the DFAs languages
dfalgo_mini.hh Minimization algorithms
dfalgo_set.hh Union, intersection, difference
dfalgo_trie.hh Trie manipulation
dfalgo_ptrn.hh Pattern matching algorithms
dfalgo.hh General purpose algorithms

Vincent Lemaout