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

Go to download
Show more of this group Show more artifacts with this name
Show all versions of google-or-tools Show documentation
Publishing Google OR-Tools as a Maven dependency
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 IntegerVariableProtoOrBuilder extends
    // @@protoc_insertion_point(interface_extends:operations_research.sat.IntegerVariableProto)
    com.google.protobuf.MessageOrBuilder {

  /**
   *    * For debug/logging only. Can be empty.
   * 
   *
   * string name = 1;
   * @return The name.
   */
  java.lang.String getName();
  /**
   *    * For debug/logging only. Can be empty.
   * 
   *
   * string name = 1;
   * @return The bytes for name.
   */
  com.google.protobuf.ByteString
      getNameBytes();

  /**
   *    * The variable domain given as a sorted list of n disjoint intervals
   * [min, max] and encoded as [min_0, max_0,  ..., min_{n-1}, max_{n-1}].
   * The most common example being just [min, max].
   * If min == max, then this is a constant variable.
   * We have:
   *  - domain_size() is always even.
   *  - min == domain.front();
   *  - max == domain.back();
   *  - for all i < n   :      min_i <= max_i
   *  - for all i < n-1 :  max_i + 1 < min_{i+1}.
   * Note that we check at validation that a variable domain is small enough so
   * that we don't run into integer overflow in our algorithms. Because of that,
   * you cannot just have "unbounded" variable like [0, kint64max] and should
   * try to specify tighter domains.
   * 
   *
   * repeated int64 domain = 2;
   * @return A list containing the domain.
   */
  java.util.List getDomainList();
  /**
   *    * The variable domain given as a sorted list of n disjoint intervals
   * [min, max] and encoded as [min_0, max_0,  ..., min_{n-1}, max_{n-1}].
   * The most common example being just [min, max].
   * If min == max, then this is a constant variable.
   * We have:
   *  - domain_size() is always even.
   *  - min == domain.front();
   *  - max == domain.back();
   *  - for all i < n   :      min_i <= max_i
   *  - for all i < n-1 :  max_i + 1 < min_{i+1}.
   * Note that we check at validation that a variable domain is small enough so
   * that we don't run into integer overflow in our algorithms. Because of that,
   * you cannot just have "unbounded" variable like [0, kint64max] and should
   * try to specify tighter domains.
   * 
   *
   * repeated int64 domain = 2;
   * @return The count of domain.
   */
  int getDomainCount();
  /**
   *    * The variable domain given as a sorted list of n disjoint intervals
   * [min, max] and encoded as [min_0, max_0,  ..., min_{n-1}, max_{n-1}].
   * The most common example being just [min, max].
   * If min == max, then this is a constant variable.
   * We have:
   *  - domain_size() is always even.
   *  - min == domain.front();
   *  - max == domain.back();
   *  - for all i < n   :      min_i <= max_i
   *  - for all i < n-1 :  max_i + 1 < min_{i+1}.
   * Note that we check at validation that a variable domain is small enough so
   * that we don't run into integer overflow in our algorithms. Because of that,
   * you cannot just have "unbounded" variable like [0, kint64max] and should
   * try to specify tighter domains.
   * 
   *
   * repeated int64 domain = 2;
   * @param index The index of the element to return.
   * @return The domain at the given index.
   */
  long getDomain(int index);
}