Interface LinearBooleanProblemOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
All Known Implementing Classes:
LinearBooleanProblem, LinearBooleanProblem.Builder
@Generated public interface LinearBooleanProblemOrBuilder extends com.google.protobuf.MessageOrBuilder

  • Method Details

    • hasName

      boolean hasName()
       The name of the problem.
      optional string name = 1 [default = ""];
      Returns:
      Whether the name field is set.

    • getName

      String getName()
       The name of the problem.
      optional string name = 1 [default = ""];
      Returns:
      The name.

    • getNameBytes

      com.google.protobuf.ByteString getNameBytes()
       The name of the problem.
      optional string name = 1 [default = ""];
      Returns:
      The bytes for name.

    • hasNumVariables

      boolean hasNumVariables()
       The number of variables in the problem.
 All the signed representation of the problem literals must be in
 [-num_variables, num_variables], excluding 0.
      optional int32 num_variables = 3;
      Returns:
      Whether the numVariables field is set.

    • getNumVariables

      int getNumVariables()
       The number of variables in the problem.
 All the signed representation of the problem literals must be in
 [-num_variables, num_variables], excluding 0.
      optional int32 num_variables = 3;
      Returns:
      The numVariables.

    • getConstraintsList

      List<LinearBooleanConstraint> getConstraintsList()
       The constraints of the problem.
      repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

    • getConstraints

      LinearBooleanConstraint getConstraints(int index)
       The constraints of the problem.
      repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

    • getConstraintsCount

      int getConstraintsCount()
       The constraints of the problem.
      repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

    • getConstraintsOrBuilderList

      List<? extends LinearBooleanConstraintOrBuilder> getConstraintsOrBuilderList()
       The constraints of the problem.
      repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

    • getConstraintsOrBuilder

      LinearBooleanConstraintOrBuilder getConstraintsOrBuilder(int index)
       The constraints of the problem.
      repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

    • hasObjective

      boolean hasObjective()
       The objective of the problem.
 If left empty, we just have a satisfiability problem.
      optional .operations_research.sat.LinearObjective objective = 5;
      Returns:
      Whether the objective field is set.

    • getObjective

      LinearObjective getObjective()
       The objective of the problem.
 If left empty, we just have a satisfiability problem.
      optional .operations_research.sat.LinearObjective objective = 5;
      Returns:
      The objective.

    • getObjectiveOrBuilder

      LinearObjectiveOrBuilder getObjectiveOrBuilder()
       The objective of the problem.
 If left empty, we just have a satisfiability problem.
      optional .operations_research.sat.LinearObjective objective = 5;

    • getVarNamesList

      List<String> getVarNamesList()
       The names of the problem variables. The variables index are 0-based and
 var_names[i] will be the name of the i-th variable which correspond to
 literals +(i + 1) or -(i + 1). This is optional and can be left empty.
      repeated string var_names = 6;
      Returns:
      A list containing the varNames.

    • getVarNamesCount

      int getVarNamesCount()
       The names of the problem variables. The variables index are 0-based and
 var_names[i] will be the name of the i-th variable which correspond to
 literals +(i + 1) or -(i + 1). This is optional and can be left empty.
      repeated string var_names = 6;
      Returns:
      The count of varNames.

    • getVarNames

      String getVarNames(int index)
       The names of the problem variables. The variables index are 0-based and
 var_names[i] will be the name of the i-th variable which correspond to
 literals +(i + 1) or -(i + 1). This is optional and can be left empty.
      repeated string var_names = 6;
      Parameters:
      index - The index of the element to return.
      Returns:
      The varNames at the given index.

    • getVarNamesBytes

      com.google.protobuf.ByteString getVarNamesBytes(int index)
       The names of the problem variables. The variables index are 0-based and
 var_names[i] will be the name of the i-th variable which correspond to
 literals +(i + 1) or -(i + 1). This is optional and can be left empty.
      repeated string var_names = 6;
      Parameters:
      index - The index of the value to return.
      Returns:
      The bytes of the varNames at the given index.

    • hasAssignment

      boolean hasAssignment()
       Stores an assignment of the problem variables. That may be an initial
 feasible solution, just a partial assignment or the optimal solution.
      optional .operations_research.sat.BooleanAssignment assignment = 7;
      Returns:
      Whether the assignment field is set.

    • getAssignment

      BooleanAssignment getAssignment()
       Stores an assignment of the problem variables. That may be an initial
 feasible solution, just a partial assignment or the optimal solution.
      optional .operations_research.sat.BooleanAssignment assignment = 7;
      Returns:
      The assignment.

    • getAssignmentOrBuilder

      BooleanAssignmentOrBuilder getAssignmentOrBuilder()
       Stores an assignment of the problem variables. That may be an initial
 feasible solution, just a partial assignment or the optimal solution.
      optional .operations_research.sat.BooleanAssignment assignment = 7;

    • hasOriginalNumVariables

      boolean hasOriginalNumVariables()
       Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
 variables need to be created. This stores the number of variables in the
 original problem (which are in one to one correspondence with the first
 variables of this problem).
      optional int32 original_num_variables = 8;
      Returns:
      Whether the originalNumVariables field is set.

    • getOriginalNumVariables

      int getOriginalNumVariables()
       Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
 variables need to be created. This stores the number of variables in the
 original problem (which are in one to one correspondence with the first
 variables of this problem).
      optional int32 original_num_variables = 8;
      Returns:
      The originalNumVariables.