Create an emptiness-check instantiator, given the name of an emptiness check.
name should have the form "name"
or "name(options)"
.
On error, the function returns 0. If the name of the algorithm was unknown, *err
will be set to name
. If some fragment of the options could not be parsed, *err
will point to that fragment.
Actually instantiate the emptiness check, for a.
unsigned int spot::emptiness_check_instantiator::max_acceptance_conditions |
( |
) | |
const |
Maximum number of acceptance conditions supported by the emptiness check.
- Returns
-1U
if no upper bound exists.
unsigned int spot::emptiness_check_instantiator::min_acceptance_conditions |
( |
) | |
const |
Minimum number of acceptance conditions supported by the emptiness check.
const option_map& spot::emptiness_check_instantiator::options |
( |
) | |
const |
|
inline |
The documentation for this class was generated from the following file: