All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.ortools.sat.AutomatonConstraintProtoOrBuilder Maven / Gradle / Ivy

The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: ortools/sat/cp_model.proto

package com.google.ortools.sat;

public interface AutomatonConstraintProtoOrBuilder extends
    // @@protoc_insertion_point(interface_extends:operations_research.sat.AutomatonConstraintProto)
    com.google.protobuf.MessageOrBuilder {

  /**
   * 
   * 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.
   * 
* * int64 starting_state = 2; * @return The startingState. */ long getStartingState(); /** * repeated int64 final_states = 3; * @return A list containing the finalStates. */ java.util.List getFinalStatesList(); /** * repeated int64 final_states = 3; * @return The count of finalStates. */ int getFinalStatesCount(); /** * repeated int64 final_states = 3; * @param index The index of the element to return. * @return The finalStates at the given index. */ long getFinalStates(int index); /** *
   * 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.
   * 
* * repeated int64 transition_tail = 4; * @return A list containing the transitionTail. */ java.util.List getTransitionTailList(); /** *
   * 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.
   * 
* * repeated int64 transition_tail = 4; * @return The count of transitionTail. */ int getTransitionTailCount(); /** *
   * 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.
   * 
* * repeated int64 transition_tail = 4; * @param index The index of the element to return. * @return The transitionTail at the given index. */ long getTransitionTail(int index); /** * repeated int64 transition_head = 5; * @return A list containing the transitionHead. */ java.util.List getTransitionHeadList(); /** * repeated int64 transition_head = 5; * @return The count of transitionHead. */ int getTransitionHeadCount(); /** * repeated int64 transition_head = 5; * @param index The index of the element to return. * @return The transitionHead at the given index. */ long getTransitionHead(int index); /** * repeated int64 transition_label = 6; * @return A list containing the transitionLabel. */ java.util.List getTransitionLabelList(); /** * repeated int64 transition_label = 6; * @return The count of transitionLabel. */ int getTransitionLabelCount(); /** * repeated int64 transition_label = 6; * @param index The index of the element to return. * @return The transitionLabel at the given index. */ long getTransitionLabel(int index); /** *
   * The sequence of variables. The automaton is ran for vars_size() "steps" and
   * the value of vars[i] corresponds to the transition label at step i.
   * 
* * repeated int32 vars = 7; * @return A list containing the vars. */ java.util.List getVarsList(); /** *
   * The sequence of variables. The automaton is ran for vars_size() "steps" and
   * the value of vars[i] corresponds to the transition label at step i.
   * 
* * repeated int32 vars = 7; * @return The count of vars. */ int getVarsCount(); /** *
   * The sequence of variables. The automaton is ran for vars_size() "steps" and
   * the value of vars[i] corresponds to the transition label at step i.
   * 
* * repeated int32 vars = 7; * @param index The index of the element to return. * @return The vars at the given index. */ int getVars(int index); }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy