This constraint forces a sequence of expressions to be accepted by an automaton.
More...
|
static pb::MessageParser< AutomatonConstraintProto > | Parser [get] |
|
static pbr::MessageDescriptor | Descriptor [get] |
|
long | StartingState [get, set] |
| A state is identified by a non-negative number. It is preferable to keep all the states dense in says [0, num_states). The automaton starts at starting_state and must finish in any of the final states.
|
|
pbc::RepeatedField< long > | FinalStates [get] |
|
pbc::RepeatedField< long > | TransitionTail [get] |
| List of transitions (all 3 vectors have the same size). Both tail and head are states, label is any variable value. No two outgoing transitions from the same state can have the same label.
|
|
pbc::RepeatedField< long > | TransitionHead [get] |
|
pbc::RepeatedField< long > | TransitionLabel [get] |
|
pbc::RepeatedField< int > | Vars [get] |
| Legacy field.
|
|
pbc::RepeatedField< global::Google.OrTools.Sat.LinearExpressionProto > | Exprs [get] |
| The sequence of affine expressions (a * var + b). The automaton is ran for exprs_size() "steps" and the value of exprs[i] corresponds to the transition label at step i.
|
|
This constraint forces a sequence of expressions to be accepted by an automaton.
Definition at line 4552 of file CpModel.pb.cs.
◆ AutomatonConstraintProto() [1/2]
Google.OrTools.Sat.AutomatonConstraintProto.AutomatonConstraintProto |
( |
| ) |
|
|
inline |
◆ AutomatonConstraintProto() [2/2]
◆ CalculateSize()
int Google.OrTools.Sat.AutomatonConstraintProto.CalculateSize |
( |
| ) |
|
|
inline |
◆ Clone()
◆ Equals() [1/2]
◆ Equals() [2/2]
override bool Google.OrTools.Sat.AutomatonConstraintProto.Equals |
( |
object | other | ) |
|
|
inline |
◆ GetHashCode()
override int Google.OrTools.Sat.AutomatonConstraintProto.GetHashCode |
( |
| ) |
|
|
inline |
◆ MergeFrom() [1/2]
◆ MergeFrom() [2/2]
void Google.OrTools.Sat.AutomatonConstraintProto.MergeFrom |
( |
pb.CodedInputStream | input | ) |
|
|
inline |
◆ ToString()
override string Google.OrTools.Sat.AutomatonConstraintProto.ToString |
( |
| ) |
|
|
inline |
◆ WriteTo()
void Google.OrTools.Sat.AutomatonConstraintProto.WriteTo |
( |
pb.CodedOutputStream | output | ) |
|
|
inline |
◆ ExprsFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.ExprsFieldNumber = 8 |
|
static |
◆ FinalStatesFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.FinalStatesFieldNumber = 3 |
|
static |
Field number for the "final_states" field.
Definition at line 4620 of file CpModel.pb.cs.
◆ StartingStateFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.StartingStateFieldNumber = 2 |
|
static |
Field number for the "starting_state" field.
Definition at line 4603 of file CpModel.pb.cs.
◆ TransitionHeadFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.TransitionHeadFieldNumber = 5 |
|
static |
Field number for the "transition_head" field.
Definition at line 4647 of file CpModel.pb.cs.
◆ TransitionLabelFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.TransitionLabelFieldNumber = 6 |
|
static |
Field number for the "transition_label" field.
Definition at line 4658 of file CpModel.pb.cs.
◆ TransitionTailFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.TransitionTailFieldNumber = 4 |
|
static |
Field number for the "transition_tail" field.
Definition at line 4631 of file CpModel.pb.cs.
◆ VarsFieldNumber
const int Google.OrTools.Sat.AutomatonConstraintProto.VarsFieldNumber = 7 |
|
static |
◆ Descriptor
pbr.MessageDescriptor Google.OrTools.Sat.AutomatonConstraintProto.Descriptor |
|
staticget |
◆ Exprs
pbc.RepeatedField<global.Google.OrTools.Sat.LinearExpressionProto> Google.OrTools.Sat.AutomatonConstraintProto.Exprs |
|
get |
The sequence of affine expressions (a * var + b). The automaton is ran for exprs_size() "steps" and the value of exprs[i] corresponds to the transition label at step i.
Definition at line 4694 of file CpModel.pb.cs.
◆ FinalStates
pbc.RepeatedField<long> Google.OrTools.Sat.AutomatonConstraintProto.FinalStates |
|
get |
◆ Parser
◆ StartingState
long Google.OrTools.Sat.AutomatonConstraintProto.StartingState |
|
getset |
A state is identified by a non-negative number. It is preferable to keep all the states dense in says [0, num_states). The automaton starts at starting_state and must finish in any of the final states.
Definition at line 4612 of file CpModel.pb.cs.
◆ TransitionHead
pbc.RepeatedField<long> Google.OrTools.Sat.AutomatonConstraintProto.TransitionHead |
|
get |
◆ TransitionLabel
pbc.RepeatedField<long> Google.OrTools.Sat.AutomatonConstraintProto.TransitionLabel |
|
get |
◆ TransitionTail
pbc.RepeatedField<long> Google.OrTools.Sat.AutomatonConstraintProto.TransitionTail |
|
get |
List of transitions (all 3 vectors have the same size). Both tail and head are states, label is any variable value. No two outgoing transitions from the same state can have the same label.
Definition at line 4642 of file CpModel.pb.cs.
◆ Vars
pbc.RepeatedField<int> Google.OrTools.Sat.AutomatonConstraintProto.Vars |
|
get |
The documentation for this class was generated from the following file: