Regular constraints
[Using finite domain integers]
Collaboration diagram for Regular constraints:
![]() |
Classes | |
class | Gecode::REG |
Regular expressions More... | |
class | Gecode::DFA |
Deterministic finite automaton. More... | |
Functions | |
void | Gecode::regular (Space *home, const IntVarArgs &x, DFA &d, IntConLevel=ICL_DEF) |
Post propagator for regular constraint. |
Function Documentation
void Gecode::regular | ( | Space * | home, | |
const IntVarArgs & | x, | |||
DFA & | d, | |||
IntConLevel | = ICL_DEF | |||
) |
Post propagator for regular constraint.
The elements of x must be a word of the language described by the DFA d.
Definition at line 29 of file regular.cc.