com.google.ortools.constraintsolver.ConstraintSolverParametersOrBuilder 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
A project to publish Google OR-Tools as a dependable dependency in Maven.
The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: ortools/constraint_solver/solver_parameters.proto

package com.google.ortools.constraintsolver;

public interface ConstraintSolverParametersOrBuilder extends
    // @@protoc_insertion_point(interface_extends:operations_research.ConstraintSolverParameters)
    com.google.protobuf.MessageOrBuilder {

  /**
   *    * This parameter indicates if the solver should compress the trail
   * during the search. No compression means that the solver will be faster,
   * but will use more memory.
   * 
   *
   * .operations_research.ConstraintSolverParameters.TrailCompression compress_trail = 1;
   */
  int getCompressTrailValue();
  /**
   *    * This parameter indicates if the solver should compress the trail
   * during the search. No compression means that the solver will be faster,
   * but will use more memory.
   * 
   *
   * .operations_research.ConstraintSolverParameters.TrailCompression compress_trail = 1;
   */
  com.google.ortools.constraintsolver.ConstraintSolverParameters.TrailCompression getCompressTrail();

  /**
   *    * This parameter indicates the default size of a block of the trail.
   * Compression applies at the block level.
   * 
   *
   * int32 trail_block_size = 2;
   */
  int getTrailBlockSize();

  /**
   *    * When a sum/min/max operation is applied on a large array, this
   * array is recursively split into blocks of size 'array_split_size'.
   * 
   *
   * int32 array_split_size = 3;
   */
  int getArraySplitSize();

  /**
   *    * This parameters indicates if the solver should store the names of
   * the objets it manages.
   * 
   *
   * bool store_names = 4;
   */
  boolean getStoreNames();

  /**
   *    * Create names for cast variables.
   * 
   *
   * bool name_cast_variables = 5;
   */
  boolean getNameCastVariables();

  /**
   *    * Should anonymous variables be given a name.
   * 
   *
   * bool name_all_variables = 6;
   */
  boolean getNameAllVariables();

  /**
   *    * Activate propagation profiling.
   * 
   *
   * bool profile_propagation = 7;
   */
  boolean getProfilePropagation();

  /**
   *    * Export propagation profiling data to file.
   * 
   *
   * string profile_file = 8;
   */
  java.lang.String getProfileFile();
  /**
   *    * Export propagation profiling data to file.
   * 
   *
   * string profile_file = 8;
   */
  com.google.protobuf.ByteString
      getProfileFileBytes();

  /**
   *    * Activate local search profiling.
   * 
   *
   * bool profile_local_search = 16;
   */
  boolean getProfileLocalSearch();

  /**
   *    * Print local search profiling data after solving.
   * 
   *
   * bool print_local_search_profile = 17;
   */
  boolean getPrintLocalSearchProfile();

  /**
   *    * Activate propagate tracing.
   * 
   *
   * bool trace_propagation = 9;
   */
  boolean getTracePropagation();

  /**
   *    * Trace search.
   * 
   *
   * bool trace_search = 10;
   */
  boolean getTraceSearch();

  /**
   *    * Print the model before solving.
   * 
   *
   * bool print_model = 11;
   */
  boolean getPrintModel();

  /**
   *    * Print model statistics before solving.
   * 
   *
   * bool print_model_stats = 12;
   */
  boolean getPrintModelStats();

  /**
   *    * Print added constraints.
   * 
   *
   * bool print_added_constraints = 13;
   */
  boolean getPrintAddedConstraints();

  /**
   *    * Export model to file.
   * 
   *
   * string export_file = 14;
   */
  java.lang.String getExportFile();
  /**
   *    * Export model to file.
   * 
   *
   * string export_file = 14;
   */
  com.google.protobuf.ByteString
      getExportFileBytes();

  /**
   * bool disable_solve = 15;
   */
  boolean getDisableSolve();

  /**
   *    * Control the implementation of the table constraint.
   * 
   *
   * bool use_compact_table = 100;
   */
  boolean getUseCompactTable();

  /**
   * bool use_small_table = 101;
   */
  boolean getUseSmallTable();

  /**
   * bool use_sat_table = 102;
   */
  boolean getUseSatTable();

  /**
   * int32 ac4r_table_threshold = 103;
   */
  int getAc4RTableThreshold();

  /**
   * bool use_mdd_table = 104;
   */
  boolean getUseMddTable();

  /**
   *    * Control the propagation of the cumulative constraint.
   * 
   *
   * bool use_cumulative_edge_finder = 105;
   */
  boolean getUseCumulativeEdgeFinder();

  /**
   * bool use_cumulative_time_table = 106;
   */
  boolean getUseCumulativeTimeTable();

  /**
   * bool use_cumulative_time_table_sync = 112;
   */
  boolean getUseCumulativeTimeTableSync();

  /**
   * bool use_sequence_high_demand_tasks = 107;
   */
  boolean getUseSequenceHighDemandTasks();

  /**
   * bool use_all_possible_disjunctions = 108;
   */
  boolean getUseAllPossibleDisjunctions();

  /**
   * int32 max_edge_finder_size = 109;
   */
  int getMaxEdgeFinderSize();

  /**
   *    * Control the propagation of the diffn constraint.
   * 
   *
   * bool diffn_use_cumulative = 110;
   */
  boolean getDiffnUseCumulative();

  /**
   *    * Control the implementation of the element constraint.
   * 
   *
   * bool use_element_rmq = 111;
   */
  boolean getUseElementRmq();
}