24 #ifdef INSTANTIATE_OPTIONS
25 #define DECLARE_OPTION(name,type,default_value) \
26 internal::option_t<type> name(#name,default_value)
28 #define DECLARE_OPTION(name,type,default_value) \
29 extern internal::option_t<type> name
161 #undef DECLARE_OPTION
#define DECLARE_OPTION(name, type, default_value)
Definition: declaration.incl.hh:28
internal::option_t< bool > PREPOST_PARADIGM
Option used to specify whether to consider initial/final status of states as normal transitions.
internal::option_t< quotient_algo_t > QUOTIENT_ALGO
Option used to specify the algorithm to use for computing quotients.
direction_t
Used in some algorithms in which one may considers transitions forward or backwards.
Definition: enums.hh:35
internal::option_t< bool > KEEP_HISTORY
Option used to specify whether to keep the history of states.
internal::option_t< bool > SAFE
Option used when performing some test is costly or impossible.
internal::option_t< io_format_t > IO_FORMAT
Option used to specify an input or output format.
internal::option_t< bool > AUTOPROMOTE
Option used to specify whether to automatically promote an automaton (or automata) if its context doe...
state_elim_order_t
The different strategies for choosing which state to eliminate first when transforming an automaton i...
Definition: enums.hh:107
internal::option_t< minim_algo_t > MINIM_ALGO
Option used to specify the algorithm to use for computing minimization.
internal::option_t< layout_t > LAYOUT
Option used when displaying an automaton with dot.
layout_t
The different layout that we may pass to program dot to compute geometry of automata.
Definition: enums.hh:44
quotient_algo_t
The different algorithms for computing the minimal quotient.
Definition: enums.hh:64
internal::option_t< bool > IN_PLACE
Option used when an algorithm may be done in place.
internal::option_t< direction_t > DIRECTION
Option used when there are "forward" or "backward" strategies.
internal::option_t< bool > PRUNE
Option used when in the process of the algorithm, some elements (e.g.
internal::option_t< exp_to_aut_algo_t > EXP_TO_AUT_ALGO
Option used when a rational expression is computed from an automaton.
internal::option_t< state_elim_order_t > STATE_ELIM_ORDER
Option used to specify the order in which states should be eliminated (typically in functions such as...
minim_algo_t
The different algorithms for computing the minimal automaton.
Definition: enums.hh:55
io_format_t
The different format for input/output of automata and expressions.
Definition: enums.hh:123
exp_to_aut_algo_t
The different algorithms for transforming an expression into an automaton.
Definition: enums.hh:70
@ BACKWARD
Definition: enums.hh:37
@ MIN_INOUT_DEGREE
States are eliminated by increasing in-out degree.
Definition: enums.hh:112
@ HORIZONTAL
Spring top down layout.
Definition: enums.hh:48
@ MOORE
Definition: enums.hh:65
@ DETERMINIZE_QUOTIENT
Determinizes, then computes the minimal quotient (see quotient_algo_t).
Definition: enums.hh:57
@ JSON
The current Awali format.
Definition: enums.hh:128
@ STANDARD_AND_QUOTIENT
Standard automaton followed by quotient.
Definition: enums.hh:100
Main namespace of Awali.
Definition: ato.hh:22