Interface IntegerVariableProtoOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
All Known Implementing Classes:
IntegerVariableProto, IntegerVariableProto.Builder

@Generated public interface IntegerVariableProtoOrBuilder extends com.google.protobuf.MessageOrBuilder
  • Method Summary

    Modifier and Type
    Method
    Description
    long
    getDomain(int index)
    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}].
    int
    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 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}].
    For debug/logging only.
    com.google.protobuf.ByteString
    For debug/logging only.

    Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

    isInitialized

    Methods inherited from interface com.google.protobuf.MessageOrBuilder

    findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
  • Method Details

    • getName

      String getName()
      For debug/logging only. Can be empty.
      
      string name = 1;
      Returns:
      The name.
    • getNameBytes

      com.google.protobuf.ByteString getNameBytes()
      For debug/logging only. Can be empty.
      
      string name = 1;
      Returns:
      The bytes for name.
    • getDomainList

      List<Long> 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;
      Returns:
      A list containing the domain.
    • getDomainCount

      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;
      Returns:
      The count of domain.
    • getDomain

      long getDomain(int index)
      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;
      Parameters:
      index - The index of the element to return.
      Returns:
      The domain at the given index.