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

com.google.ortools.sat.ReservoirConstraintProtoOrBuilder 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 ReservoirConstraintProtoOrBuilder extends
    // @@protoc_insertion_point(interface_extends:operations_research.sat.ReservoirConstraintProto)
    com.google.protobuf.MessageOrBuilder {

  /**
   * int64 min_level = 1;
   * @return The minLevel.
   */
  long getMinLevel();

  /**
   * int64 max_level = 2;
   * @return The maxLevel.
   */
  long getMaxLevel();

  /**
   * 
   * variables.
   * 
* * repeated int32 times = 3; * @return A list containing the times. */ java.util.List getTimesList(); /** *
   * variables.
   * 
* * repeated int32 times = 3; * @return The count of times. */ int getTimesCount(); /** *
   * variables.
   * 
* * repeated int32 times = 3; * @param index The index of the element to return. * @return The times at the given index. */ int getTimes(int index); /** *
   * constants, can be negative.
   * 
* * repeated int64 demands = 4; * @return A list containing the demands. */ java.util.List getDemandsList(); /** *
   * constants, can be negative.
   * 
* * repeated int64 demands = 4; * @return The count of demands. */ int getDemandsCount(); /** *
   * constants, can be negative.
   * 
* * repeated int64 demands = 4; * @param index The index of the element to return. * @return The demands at the given index. */ long getDemands(int index); /** *
   * literals.
   * 
* * repeated int32 actives = 5; * @return A list containing the actives. */ java.util.List getActivesList(); /** *
   * literals.
   * 
* * repeated int32 actives = 5; * @return The count of actives. */ int getActivesCount(); /** *
   * literals.
   * 
* * repeated int32 actives = 5; * @param index The index of the element to return. * @return The actives at the given index. */ int getActives(int index); }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy