6#ifndef ortools_2fsat_2fsat_5fparameters_2eproto_2epb_2eh
7#define ortools_2fsat_2fsat_5fparameters_2eproto_2epb_2eh
14#include "google/protobuf/runtime_version.h"
15#if PROTOBUF_VERSION != 6031001
16#error "Protobuf C++ gencode is built with an incompatible version of"
17#error "Protobuf C++ headers/runtime. See"
18#error "https://protobuf.dev/support/cross-version-runtime-guarantee/#cpp"
20#include "google/protobuf/io/coded_stream.h"
21#include "google/protobuf/arena.h"
22#include "google/protobuf/arenastring.h"
23#include "google/protobuf/generated_message_tctable_decl.h"
24#include "google/protobuf/generated_message_util.h"
25#include "google/protobuf/metadata_lite.h"
26#include "google/protobuf/generated_message_reflection.h"
27#include "google/protobuf/message.h"
28#include "google/protobuf/message_lite.h"
29#include "google/protobuf/repeated_field.h"
30#include "google/protobuf/extension_set.h"
31#include "google/protobuf/generated_enum_reflection.h"
32#include "google/protobuf/unknown_field_set.h"
36#include "google/protobuf/port_def.inc"
38#define PROTOBUF_INTERNAL_EXPORT_ortools_2fsat_2fsat_5fparameters_2eproto OR_PROTO_DLL
91internal::EnumTraitsT<::operations_research::sat::SatParameters_BinaryMinizationAlgorithm_internal_data_>
92 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_BinaryMinizationAlgorithm>;
94internal::EnumTraitsT<::operations_research::sat::SatParameters_ClauseOrdering_internal_data_>
95 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_ClauseOrdering>;
97internal::EnumTraitsT<::operations_research::sat::SatParameters_ClauseProtection_internal_data_>
98 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_ClauseProtection>;
100internal::EnumTraitsT<::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm_internal_data_>
101 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm>;
103internal::EnumTraitsT<::operations_research::sat::SatParameters_FPRoundingMethod_internal_data_>
104 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_FPRoundingMethod>;
106internal::EnumTraitsT<::operations_research::sat::SatParameters_MaxSatAssumptionOrder_internal_data_>
107 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_MaxSatAssumptionOrder>;
109internal::EnumTraitsT<::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm_internal_data_>
110 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm>;
112internal::EnumTraitsT<::operations_research::sat::SatParameters_Polarity_internal_data_>
113 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_Polarity>;
115internal::EnumTraitsT<::operations_research::sat::SatParameters_RestartAlgorithm_internal_data_>
116 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_RestartAlgorithm>;
118internal::EnumTraitsT<::operations_research::sat::SatParameters_SearchBranching_internal_data_>
119 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_SearchBranching>;
121internal::EnumTraitsT<::operations_research::sat::SatParameters_SharedTreeSplitStrategy_internal_data_>
122 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_SharedTreeSplitStrategy>;
124internal::EnumTraitsT<::operations_research::sat::SatParameters_VariableOrder_internal_data_>
125 internal::EnumTraitsImpl::value<::operations_research::sat::SatParameters_VariableOrder>;
143 return 0 <= value && value <= 2;
149 static_assert(::std::is_same<T, SatParameters_VariableOrder>::value ||
150 ::std::is_integral<T>::value,
151 "Incorrect type passed to VariableOrder_Name().");
156 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_VariableOrder_descriptor, 0, 2>(
157 static_cast<int>(value));
176 return 0 <= value && value <= 2;
182 static_assert(::std::is_same<T, SatParameters_Polarity>::value ||
183 ::std::is_integral<T>::value,
184 "Incorrect type passed to Polarity_Name().");
189 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_Polarity_descriptor, 0, 2>(
190 static_cast<int>(value));
210 return 0 <= value && value <= 3;
216 static_assert(::std::is_same<T, SatParameters_ConflictMinimizationAlgorithm>::value ||
217 ::std::is_integral<T>::value,
218 "Incorrect type passed to ConflictMinimizationAlgorithm_Name().");
223 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_ConflictMinimizationAlgorithm_descriptor, 0, 3>(
224 static_cast<int>(value));
245 return 0 <= value && value <= 4;
251 static_assert(::std::is_same<T, SatParameters_BinaryMinizationAlgorithm>::value ||
252 ::std::is_integral<T>::value,
253 "Incorrect type passed to BinaryMinizationAlgorithm_Name().");
258 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_BinaryMinizationAlgorithm_descriptor, 0, 4>(
259 static_cast<int>(value));
278 return 0 <= value && value <= 2;
284 static_assert(::std::is_same<T, SatParameters_ClauseProtection>::value ||
285 ::std::is_integral<T>::value,
286 "Incorrect type passed to ClauseProtection_Name().");
291 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_ClauseProtection_descriptor, 0, 2>(
292 static_cast<int>(value));
310 return 0 <= value && value <= 1;
316 static_assert(::std::is_same<T, SatParameters_ClauseOrdering>::value ||
317 ::std::is_integral<T>::value,
318 "Incorrect type passed to ClauseOrdering_Name().");
323 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_ClauseOrdering_descriptor, 0, 1>(
324 static_cast<int>(value));
345 return 0 <= value && value <= 4;
351 static_assert(::std::is_same<T, SatParameters_RestartAlgorithm>::value ||
352 ::std::is_integral<T>::value,
353 "Incorrect type passed to RestartAlgorithm_Name().");
358 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_RestartAlgorithm_descriptor, 0, 4>(
359 static_cast<int>(value));
378 return 0 <= value && value <= 2;
384 static_assert(::std::is_same<T, SatParameters_MaxSatAssumptionOrder>::value ||
385 ::std::is_integral<T>::value,
386 "Incorrect type passed to MaxSatAssumptionOrder_Name().");
391 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_MaxSatAssumptionOrder_descriptor, 0, 2>(
392 static_cast<int>(value));
411 return 0 <= value && value <= 2;
417 static_assert(::std::is_same<T, SatParameters_MaxSatStratificationAlgorithm>::value ||
418 ::std::is_integral<T>::value,
419 "Incorrect type passed to MaxSatStratificationAlgorithm_Name().");
424 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_MaxSatStratificationAlgorithm_descriptor, 0, 2>(
425 static_cast<int>(value));
450 return 0 <= value && value <= 8;
456 static_assert(::std::is_same<T, SatParameters_SearchBranching>::value ||
457 ::std::is_integral<T>::value,
458 "Incorrect type passed to SearchBranching_Name().");
463 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_SearchBranching_descriptor, 0, 8>(
464 static_cast<int>(value));
485 return 0 <= value && value <= 4;
491 static_assert(::std::is_same<T, SatParameters_SharedTreeSplitStrategy>::value ||
492 ::std::is_integral<T>::value,
493 "Incorrect type passed to SharedTreeSplitStrategy_Name().");
498 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_SharedTreeSplitStrategy_descriptor, 0, 4>(
499 static_cast<int>(value));
519 return 0 <= value && value <= 3;
525 static_assert(::std::is_same<T, SatParameters_FPRoundingMethod>::value ||
526 ::std::is_integral<T>::value,
527 "Incorrect type passed to FPRoundingMethod_Name().");
532 return ::google::protobuf::internal::NameOfDenseEnum<SatParameters_FPRoundingMethod_descriptor, 0, 3>(
533 static_cast<int>(value));
546class OR_PROTO_DLL SatParameters final :
public ::google::protobuf::Message
552#if defined(PROTOBUF_CUSTOM_VTABLE)
553 void operator delete(
SatParameters* PROTOBUF_NONNULL msg, std::destroying_delete_t) {
555 ::google::protobuf::internal::SizedDelete(msg,
sizeof(
SatParameters));
559 template <
typename =
void>
560 explicit PROTOBUF_CONSTEXPR
SatParameters(::google::protobuf::internal::ConstantInitialized);
570 if (
this == &from)
return *
this;
571 if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {
579 inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const
580 ABSL_ATTRIBUTE_LIFETIME_BOUND {
581 return _internal_metadata_.
unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);
583 inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()
584 ABSL_ATTRIBUTE_LIFETIME_BOUND {
585 return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();
588 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {
589 return GetDescriptor();
591 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {
592 return default_instance().GetMetadata().descriptor;
594 static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {
595 return default_instance().GetMetadata().reflection;
601 static constexpr int kIndexInFileMessages = 0;
604 if (other ==
this)
return;
605 if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {
608 ::google::protobuf::internal::GenericSwap(
this, other);
611 void UnsafeArenaSwap(SatParameters* PROTOBUF_NONNULL other) {
612 if (other ==
this)
return;
613 ABSL_DCHECK(GetArena() == other->GetArena());
619 SatParameters* PROTOBUF_NONNULL New(::google::protobuf::Arena* PROTOBUF_NULLABLE arena =
nullptr)
const {
620 return ::google::protobuf::Message::DefaultConstruct<SatParameters>(arena);
622 using ::google::protobuf::Message::CopyFrom;
624 using ::google::protobuf::Message::MergeFrom;
625 void MergeFrom(
const SatParameters& from) { SatParameters::MergeImpl(*
this, from); }
628 static void MergeImpl(::google::protobuf::MessageLite& to_msg,
629 const ::google::protobuf::MessageLite& from_msg);
635 ABSL_ATTRIBUTE_REINITIALIZES
void Clear() PROTOBUF_FINAL;
636 #if defined(PROTOBUF_CUSTOM_VTABLE)
638 static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);
639 static ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
640 const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,
641 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);
644 ::size_t ByteSizeLong()
const {
return ByteSizeLong(*
this); }
645 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
646 ::uint8_t* PROTOBUF_NONNULL target,
647 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream)
const {
648 return _InternalSerialize(*
this, target, stream);
651 ::size_t ByteSizeLong() const final;
652 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
653 ::uint8_t* PROTOBUF_NONNULL target,
654 ::
google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;
656 int GetCachedSize()
const {
return _impl_._cached_size_.Get(); }
659 void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
663 template <
typename T>
665 static ::absl::string_view FullMessageName() {
return "operations_research.sat.SatParameters"; }
668 explicit SatParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
671 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena,
SatParameters&& from) noexcept
673 *
this = ::std::move(from);
675 const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;
676 static
void* PROTOBUF_NONNULL PlacementNew_(
677 const
void* PROTOBUF_NONNULL,
void* PROTOBUF_NONNULL mem,
678 ::
google::protobuf::Arena* PROTOBUF_NULLABLE arena);
679 static constexpr auto InternalNewImpl_();
682 static constexpr auto InternalGenerateClassData_();
684 ::
google::protobuf::Metadata GetMetadata() const;
699 template <
typename T>
700 static inline const ::std::string& VariableOrder_Name(T value) {
703 static inline bool VariableOrder_Parse(
704 ::absl::string_view name, VariableOrder* PROTOBUF_NONNULL value) {
720 template <
typename T>
721 static inline const ::std::string& Polarity_Name(T value) {
724 static inline bool Polarity_Parse(
725 ::absl::string_view name, Polarity* PROTOBUF_NONNULL value) {
742 template <
typename T>
743 static inline const ::std::string& ConflictMinimizationAlgorithm_Name(T value) {
746 static inline bool ConflictMinimizationAlgorithm_Parse(
747 ::absl::string_view name, ConflictMinimizationAlgorithm* PROTOBUF_NONNULL value) {
765 template <
typename T>
766 static inline const ::std::string& BinaryMinizationAlgorithm_Name(T value) {
769 static inline bool BinaryMinizationAlgorithm_Parse(
770 ::absl::string_view name, BinaryMinizationAlgorithm* PROTOBUF_NONNULL value) {
786 template <
typename T>
787 static inline const ::std::string& ClauseProtection_Name(T value) {
790 static inline bool ClauseProtection_Parse(
791 ::absl::string_view name, ClauseProtection* PROTOBUF_NONNULL value) {
806 template <
typename T>
807 static inline const ::std::string& ClauseOrdering_Name(T value) {
810 static inline bool ClauseOrdering_Parse(
811 ::absl::string_view name, ClauseOrdering* PROTOBUF_NONNULL value) {
829 template <
typename T>
830 static inline const ::std::string& RestartAlgorithm_Name(T value) {
833 static inline bool RestartAlgorithm_Parse(
834 ::absl::string_view name, RestartAlgorithm* PROTOBUF_NONNULL value) {
850 template <
typename T>
851 static inline const ::std::string& MaxSatAssumptionOrder_Name(T value) {
854 static inline bool MaxSatAssumptionOrder_Parse(
855 ::absl::string_view name, MaxSatAssumptionOrder* PROTOBUF_NONNULL value) {
871 template <
typename T>
872 static inline const ::std::string& MaxSatStratificationAlgorithm_Name(T value) {
875 static inline bool MaxSatStratificationAlgorithm_Parse(
876 ::absl::string_view name, MaxSatStratificationAlgorithm* PROTOBUF_NONNULL value) {
898 template <
typename T>
899 static inline const ::std::string& SearchBranching_Name(T value) {
902 static inline bool SearchBranching_Parse(
903 ::absl::string_view name, SearchBranching* PROTOBUF_NONNULL value) {
921 template <
typename T>
922 static inline const ::std::string& SharedTreeSplitStrategy_Name(T value) {
925 static inline bool SharedTreeSplitStrategy_Parse(
926 ::absl::string_view name, SharedTreeSplitStrategy* PROTOBUF_NONNULL value) {
943 template <
typename T>
944 static inline const ::std::string& FPRoundingMethod_Name(T value) {
947 static inline bool FPRoundingMethod_Parse(
948 ::absl::string_view name, FPRoundingMethod* PROTOBUF_NONNULL value) {
954 kRestartAlgorithmsFieldNumber = 61,
955 kSubsolversFieldNumber = 207,
1233 int _internal_restart_algorithms_size()
const;
1245 const ::google::protobuf::RepeatedField<int>& _internal_restart_algorithms()
const;
1246 ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL _internal_mutable_restart_algorithms();
1252 int _internal_subsolvers_size()
const;
1256 const ::std::string&
subsolvers(
int index)
const;
1258 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1261 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1263 const ::google::protobuf::RepeatedPtrField<::std::string>&
subsolvers()
const;
1264 ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
mutable_subsolvers();
1267 const ::google::protobuf::RepeatedPtrField<::std::string>& _internal_subsolvers()
const;
1268 ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL _internal_mutable_subsolvers();
1274 int _internal_ignore_subsolvers_size()
const;
1280 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1283 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1285 const ::google::protobuf::RepeatedPtrField<::std::string>&
ignore_subsolvers()
const;
1289 const ::google::protobuf::RepeatedPtrField<::std::string>& _internal_ignore_subsolvers()
const;
1290 ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL _internal_mutable_ignore_subsolvers();
1296 int _internal_subsolver_params_size()
const;
1301 ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>* PROTOBUF_NONNULL
mutable_subsolver_params();
1304 const ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>& _internal_subsolver_params()
const;
1305 ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>* PROTOBUF_NONNULL _internal_mutable_subsolver_params();
1307 const ::operations_research::sat::SatParameters&
subsolver_params(
int index)
const;
1309 const ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>&
subsolver_params()
const;
1313 int _internal_extra_subsolvers_size()
const;
1319 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1322 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1324 const ::google::protobuf::RepeatedPtrField<::std::string>&
extra_subsolvers()
const;
1328 const ::google::protobuf::RepeatedPtrField<::std::string>& _internal_extra_subsolvers()
const;
1329 ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL _internal_mutable_extra_subsolvers();
1335 int _internal_filter_subsolvers_size()
const;
1341 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1344 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1346 const ::google::protobuf::RepeatedPtrField<::std::string>&
filter_subsolvers()
const;
1350 const ::google::protobuf::RepeatedPtrField<::std::string>& _internal_filter_subsolvers()
const;
1351 ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL _internal_mutable_filter_subsolvers();
1358 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1365 const ::std::string& _internal_default_restart_algorithms()
const;
1366 PROTOBUF_ALWAYS_INLINE
void _internal_set_default_restart_algorithms(const ::std::string& value);
1367 ::std::string* PROTOBUF_NONNULL _internal_mutable_default_restart_algorithms();
1373 const ::std::string&
name()
const;
1374 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1375 void set_name(Arg_&& arg, Args_... args);
1381 const ::std::string& _internal_name()
const;
1382 PROTOBUF_ALWAYS_INLINE
void _internal_set_name(const ::std::string& value);
1383 ::std::string* PROTOBUF_NONNULL _internal_mutable_name();
1390 template <
typename Arg_ = const ::std::string&,
typename... Args_>
1397 const ::std::string& _internal_log_prefix()
const;
1398 PROTOBUF_ALWAYS_INLINE
void _internal_set_log_prefix(const ::std::string& value);
1399 ::std::string* PROTOBUF_NONNULL _internal_mutable_log_prefix();
1420 ::int32_t _internal_clause_cleanup_target()
const;
1421 void _internal_set_clause_cleanup_target(::int32_t value);
1431 double _internal_random_branches_ratio()
const;
1432 void _internal_set_random_branches_ratio(
double value);
1442 double _internal_random_polarity_ratio()
const;
1443 void _internal_set_random_polarity_ratio(
double value);
1453 bool _internal_log_search_progress()
const;
1454 void _internal_set_log_search_progress(
bool value);
1464 bool _internal_use_pb_resolution()
const;
1465 void _internal_set_use_pb_resolution(
bool value);
1475 bool _internal_minimize_reduction_during_pb_resolution()
const;
1476 void _internal_set_minimize_reduction_during_pb_resolution(
bool value);
1486 bool _internal_max_sat_reverse_assumption_order()
const;
1487 void _internal_set_max_sat_reverse_assumption_order(
bool value);
1530 double _internal_strategy_change_increase_ratio()
const;
1531 void _internal_set_strategy_change_increase_ratio(
double value);
1541 ::int32_t _internal_num_conflicts_before_strategy_changes()
const;
1542 void _internal_set_num_conflicts_before_strategy_changes(::int32_t value);
1552 bool _internal_use_blocking_restart()
const;
1553 void _internal_set_use_blocking_restart(
bool value);
1563 bool _internal_use_erwa_heuristic()
const;
1564 void _internal_set_use_erwa_heuristic(
bool value);
1574 bool _internal_also_bump_variables_in_conflict_reasons()
const;
1575 void _internal_set_also_bump_variables_in_conflict_reasons(
bool value);
1585 bool _internal_use_overload_checker_in_cumulative()
const;
1586 void _internal_set_use_overload_checker_in_cumulative(
bool value);
1596 double _internal_initial_variables_activity()
const;
1597 void _internal_set_initial_variables_activity(
double value);
1618 bool _internal_use_timetable_edge_finding_in_cumulative()
const;
1619 void _internal_set_use_timetable_edge_finding_in_cumulative(
bool value);
1629 bool _internal_optimize_with_core()
const;
1630 void _internal_set_optimize_with_core(
bool value);
1640 bool _internal_optimize_with_max_hs()
const;
1641 void _internal_set_optimize_with_max_hs(
bool value);
1651 bool _internal_enumerate_all_solutions()
const;
1652 void _internal_set_enumerate_all_solutions(
bool value);
1662 bool _internal_only_add_cuts_at_level_zero()
const;
1663 void _internal_set_only_add_cuts_at_level_zero(
bool value);
1673 bool _internal_stop_after_first_solution()
const;
1674 void _internal_set_stop_after_first_solution(
bool value);
1684 bool _internal_use_lns_only()
const;
1685 void _internal_set_use_lns_only(
bool value);
1695 bool _internal_randomize_search()
const;
1696 void _internal_set_randomize_search(
bool value);
1706 ::int32_t _internal_num_search_workers()
const;
1707 void _internal_set_num_search_workers(::int32_t value);
1717 ::int64_t _internal_search_random_variable_pool_size()
const;
1718 void _internal_set_search_random_variable_pool_size(::int64_t value);
1728 bool _internal_use_optional_variables()
const;
1729 void _internal_set_use_optional_variables(
bool value);
1739 bool _internal_exploit_best_solution()
const;
1740 void _internal_set_exploit_best_solution(
bool value);
1750 bool _internal_fill_tightened_domains_in_response()
const;
1751 void _internal_set_fill_tightened_domains_in_response(
bool value);
1761 bool _internal_use_combined_no_overlap()
const;
1762 void _internal_set_use_combined_no_overlap(
bool value);
1772 ::int32_t _internal_interleave_batch_size()
const;
1773 void _internal_set_interleave_batch_size(::int32_t value);
1783 bool _internal_interleave_search()
const;
1784 void _internal_set_interleave_search(
bool value);
1794 bool _internal_diversify_lns_params()
const;
1795 void _internal_set_diversify_lns_params(
bool value);
1805 bool _internal_stop_after_presolve()
const;
1806 void _internal_set_stop_after_presolve(
bool value);
1816 bool _internal_exploit_relaxation_solution()
const;
1817 void _internal_set_exploit_relaxation_solution(
bool value);
1827 ::int32_t _internal_debug_max_num_presolve_operations()
const;
1828 void _internal_set_debug_max_num_presolve_operations(::int32_t value);
1838 double _internal_relative_gap_limit()
const;
1839 void _internal_set_relative_gap_limit(
double value);
1849 bool _internal_debug_postsolve_with_full_solver()
const;
1850 void _internal_set_debug_postsolve_with_full_solver(
bool value);
1860 bool _internal_repair_hint()
const;
1861 void _internal_set_repair_hint(
bool value);
1871 bool _internal_expand_alldiff_constraints()
const;
1872 void _internal_set_expand_alldiff_constraints(
bool value);
1882 bool _internal_keep_all_feasible_solutions_in_presolve()
const;
1883 void _internal_set_keep_all_feasible_solutions_in_presolve(
bool value);
1893 bool _internal_presolve_extract_integer_enforcement()
const;
1894 void _internal_set_presolve_extract_integer_enforcement(
bool value);
1904 bool _internal_polish_lp_solution()
const;
1905 void _internal_set_polish_lp_solution(
bool value);
1915 bool _internal_use_probing_search()
const;
1916 void _internal_set_use_probing_search(
bool value);
1926 bool _internal_permute_variable_randomly()
const;
1927 void _internal_set_permute_variable_randomly(
bool value);
1937 bool _internal_permute_presolve_constraint_order()
const;
1938 void _internal_set_permute_presolve_constraint_order(
bool value);
1948 bool _internal_use_absl_random()
const;
1949 void _internal_set_use_absl_random(
bool value);
1959 bool _internal_disable_constraint_expansion()
const;
1960 void _internal_set_disable_constraint_expansion(
bool value);
1970 bool _internal_log_to_response()
const;
1971 void _internal_set_log_to_response(
bool value);
1981 bool _internal_optimize_with_lb_tree_search()
const;
1982 void _internal_set_optimize_with_lb_tree_search(
bool value);
1992 bool _internal_log_subsolver_statistics()
const;
1993 void _internal_set_log_subsolver_statistics(
bool value);
2003 bool _internal_fix_variables_to_their_hinted_value()
const;
2004 void _internal_set_fix_variables_to_their_hinted_value(
bool value);
2014 bool _internal_fill_additional_solutions_in_response()
const;
2015 void _internal_set_fill_additional_solutions_in_response(
bool value);
2025 bool _internal_debug_crash_on_bad_hint()
const;
2026 void _internal_set_debug_crash_on_bad_hint(
bool value);
2036 bool _internal_add_objective_cut()
const;
2037 void _internal_set_add_objective_cut(
bool value);
2047 bool _internal_use_timetabling_in_no_overlap_2d()
const;
2048 void _internal_set_use_timetabling_in_no_overlap_2d(
bool value);
2058 bool _internal_use_energetic_reasoning_in_no_overlap_2d()
const;
2059 void _internal_set_use_energetic_reasoning_in_no_overlap_2d(
bool value);
2069 ::int32_t _internal_num_workers()
const;
2070 void _internal_set_num_workers(::int32_t value);
2080 bool _internal_use_hard_precedences_in_cumulative()
const;
2081 void _internal_set_use_hard_precedences_in_cumulative(
bool value);
2091 bool _internal_detect_table_with_cost()
const;
2092 void _internal_set_detect_table_with_cost(
bool value);
2102 bool _internal_exploit_all_precedences()
const;
2103 void _internal_set_exploit_all_precedences(
bool value);
2113 bool _internal_only_solve_ip()
const;
2114 void _internal_set_only_solve_ip(
bool value);
2124 bool _internal_encode_complex_linear_constraint_with_integer()
const;
2125 void _internal_set_encode_complex_linear_constraint_with_integer(
bool value);
2135 bool _internal_mip_scale_large_domain()
const;
2136 void _internal_set_mip_scale_large_domain(
bool value);
2146 bool _internal_use_objective_lb_search()
const;
2147 void _internal_set_use_objective_lb_search(
bool value);
2157 bool _internal_use_strong_propagation_in_disjunctive()
const;
2158 void _internal_set_use_strong_propagation_in_disjunctive(
bool value);
2168 ::int32_t _internal_shared_tree_num_workers()
const;
2169 void _internal_set_shared_tree_num_workers(::int32_t value);
2190 ::int32_t _internal_num_violation_ls()
const;
2191 void _internal_set_num_violation_ls(::int32_t value);
2201 bool _internal_use_shared_tree_search()
const;
2202 void _internal_set_use_shared_tree_search(
bool value);
2212 bool _internal_use_ls_only()
const;
2213 void _internal_set_use_ls_only(
bool value);
2223 bool _internal_stop_after_root_propagation()
const;
2224 void _internal_set_stop_after_root_propagation(
bool value);
2234 bool _internal_use_objective_shaving_search()
const;
2235 void _internal_set_use_objective_shaving_search(
bool value);
2245 bool _internal_push_all_tasks_toward_start()
const;
2246 void _internal_set_push_all_tasks_toward_start(
bool value);
2256 bool _internal_use_dynamic_precedence_in_disjunctive()
const;
2257 void _internal_set_use_dynamic_precedence_in_disjunctive(
bool value);
2267 bool _internal_use_dynamic_precedence_in_cumulative()
const;
2268 void _internal_set_use_dynamic_precedence_in_cumulative(
bool value);
2278 bool _internal_use_area_energetic_reasoning_in_no_overlap_2d()
const;
2279 void _internal_set_use_area_energetic_reasoning_in_no_overlap_2d(
bool value);
2289 ::int32_t _internal_max_lin_max_size_for_expansion()
const;
2290 void _internal_set_max_lin_max_size_for_expansion(::int32_t value);
2300 bool _internal_detect_linearized_product()
const;
2301 void _internal_set_detect_linearized_product(
bool value);
2311 bool _internal_mip_treat_high_magnitude_bounds_as_infinity()
const;
2312 void _internal_set_mip_treat_high_magnitude_bounds_as_infinity(
bool value);
2322 bool _internal_save_lp_basis_in_lb_tree_search()
const;
2323 void _internal_set_save_lp_basis_in_lb_tree_search(
bool value);
2333 bool _internal_share_glue_clauses()
const;
2334 void _internal_set_share_glue_clauses(
bool value);
2344 bool _internal_use_conservative_scale_overload_checker()
const;
2345 void _internal_set_use_conservative_scale_overload_checker(
bool value);
2355 bool _internal_encode_cumulative_as_reservoir()
const;
2356 void _internal_set_encode_cumulative_as_reservoir(
bool value);
2366 bool _internal_expand_reservoir_using_circuit()
const;
2367 void _internal_set_expand_reservoir_using_circuit(
bool value);
2377 bool _internal_inprocessing_minimization_use_all_orderings()
const;
2378 void _internal_set_inprocessing_minimization_use_all_orderings(
bool value);
2388 ::int32_t _internal_max_num_deterministic_batches()
const;
2389 void _internal_set_max_num_deterministic_batches(::int32_t value);
2399 ::int32_t _internal_num_full_subsolvers()
const;
2400 void _internal_set_num_full_subsolvers(::int32_t value);
2410 bool _internal_use_try_edge_reasoning_in_no_overlap_2d()
const;
2411 void _internal_set_use_try_edge_reasoning_in_no_overlap_2d(
bool value);
2421 bool _internal_use_symmetry_in_lp()
const;
2422 void _internal_set_use_symmetry_in_lp(
bool value);
2432 bool _internal_keep_symmetry_in_presolve()
const;
2433 void _internal_set_keep_symmetry_in_presolve(
bool value);
2443 bool _internal_debug_crash_if_presolve_breaks_hint()
const;
2444 void _internal_set_debug_crash_if_presolve_breaks_hint(
bool value);
2454 ::int32_t _internal_routing_cut_subset_size_for_binary_relation_bound()
const;
2455 void _internal_set_routing_cut_subset_size_for_binary_relation_bound(::int32_t value);
2465 ::int32_t _internal_routing_cut_subset_size_for_tight_binary_relation_bound()
const;
2466 void _internal_set_routing_cut_subset_size_for_tight_binary_relation_bound(::int32_t value);
2476 bool _internal_polarity_exploit_ls_hints()
const;
2477 void _internal_set_polarity_exploit_ls_hints(
bool value);
2487 bool _internal_use_all_different_for_circuit()
const;
2488 void _internal_set_use_all_different_for_circuit(
bool value);
2498 bool _internal_filter_sat_postsolve_clauses()
const;
2499 void _internal_set_filter_sat_postsolve_clauses(
bool value);
2509 ::int32_t _internal_maximum_regions_to_split_in_disconnected_no_overlap_2d()
const;
2510 void _internal_set_maximum_regions_to_split_in_disconnected_no_overlap_2d(::int32_t value);
2542 double _internal_variable_activity_decay()
const;
2543 void _internal_set_variable_activity_decay(
double value);
2553 double _internal_max_variable_activity_value()
const;
2554 void _internal_set_max_variable_activity_value(
double value);
2564 double _internal_clause_activity_decay()
const;
2565 void _internal_set_clause_activity_decay(
double value);
2575 ::int32_t _internal_clause_cleanup_period()
const;
2576 void _internal_set_clause_cleanup_period(::int32_t value);
2586 ::int32_t _internal_glucose_decay_increment_period()
const;
2587 void _internal_set_glucose_decay_increment_period(::int32_t value);
2597 double _internal_max_clause_activity_value()
const;
2598 void _internal_set_max_clause_activity_value(
double value);
2608 double _internal_glucose_max_decay()
const;
2609 void _internal_set_glucose_max_decay(
double value);
2619 double _internal_glucose_decay_increment()
const;
2620 void _internal_set_glucose_decay_increment(
double value);
2630 ::int32_t _internal_restart_period()
const;
2631 void _internal_set_restart_period(::int32_t value);
2641 ::int32_t _internal_random_seed()
const;
2642 void _internal_set_random_seed(::int32_t value);
2652 double _internal_max_time_in_seconds()
const;
2653 void _internal_set_max_time_in_seconds(
double value);
2663 ::int64_t _internal_max_number_of_conflicts()
const;
2664 void _internal_set_max_number_of_conflicts(::int64_t value);
2674 ::int64_t _internal_max_memory_in_mb()
const;
2675 void _internal_set_max_memory_in_mb(::int64_t value);
2696 ::int32_t _internal_pb_cleanup_increment()
const;
2697 void _internal_set_pb_cleanup_increment(::int32_t value);
2707 bool _internal_use_optimization_hints()
const;
2708 void _internal_set_use_optimization_hints(
bool value);
2718 bool _internal_use_phase_saving()
const;
2719 void _internal_set_use_phase_saving(
bool value);
2729 bool _internal_count_assumption_levels_in_lbd()
const;
2730 void _internal_set_count_assumption_levels_in_lbd(
bool value);
2740 bool _internal_subsumption_during_conflict_analysis()
const;
2741 void _internal_set_subsumption_during_conflict_analysis(
bool value);
2751 ::int32_t _internal_core_minimization_level()
const;
2752 void _internal_set_core_minimization_level(::int32_t value);
2762 double _internal_pb_cleanup_ratio()
const;
2763 void _internal_set_pb_cleanup_ratio(
double value);
2784 ::int32_t _internal_presolve_bve_threshold()
const;
2785 void _internal_set_presolve_bve_threshold(::int32_t value);
2795 double _internal_presolve_probing_deterministic_time_limit()
const;
2796 void _internal_set_presolve_probing_deterministic_time_limit(
double value);
2806 ::int32_t _internal_presolve_bve_clause_weight()
const;
2807 void _internal_set_presolve_bve_clause_weight(::int32_t value);
2817 ::int32_t _internal_clause_cleanup_lbd_bound()
const;
2818 void _internal_set_clause_cleanup_lbd_bound(::int32_t value);
2828 double _internal_restart_dl_average_ratio()
const;
2829 void _internal_set_restart_dl_average_ratio(
double value);
2839 ::int32_t _internal_restart_running_window_size()
const;
2840 void _internal_set_restart_running_window_size(::int32_t value);
2850 ::int32_t _internal_blocking_restart_window_size()
const;
2851 void _internal_set_blocking_restart_window_size(::int32_t value);
2861 double _internal_blocking_restart_multiplier()
const;
2862 void _internal_set_blocking_restart_multiplier(
double value);
2872 double _internal_max_deterministic_time()
const;
2873 void _internal_set_max_deterministic_time(
double value);
2883 double _internal_restart_lbd_average_ratio()
const;
2884 void _internal_set_restart_lbd_average_ratio(
double value);
2894 ::int32_t _internal_presolve_bva_threshold()
const;
2895 void _internal_set_presolve_bva_threshold(::int32_t value);
2905 bool _internal_presolve_use_bva()
const;
2906 void _internal_set_presolve_use_bva(
bool value);
2916 bool _internal_use_precedences_in_disjunctive_constraint()
const;
2917 void _internal_set_use_precedences_in_disjunctive_constraint(
bool value);
2927 bool _internal_use_disjunctive_constraint_in_cumulative()
const;
2928 void _internal_set_use_disjunctive_constraint_in_cumulative(
bool value);
2938 bool _internal_find_multiple_cores()
const;
2939 void _internal_set_find_multiple_cores(
bool value);
2949 bool _internal_cp_model_presolve()
const;
2950 void _internal_set_cp_model_presolve(
bool value);
2960 bool _internal_presolve_blocked_clause()
const;
2961 void _internal_set_presolve_blocked_clause(
bool value);
2971 bool _internal_cover_optimization()
const;
2972 void _internal_set_cover_optimization(
bool value);
2982 bool _internal_cp_model_use_sat_presolve()
const;
2983 void _internal_set_cp_model_use_sat_presolve(
bool value);
2993 ::int32_t _internal_linearization_level()
const;
2994 void _internal_set_linearization_level(::int32_t value);
3004 ::int32_t _internal_max_num_cuts()
const;
3005 void _internal_set_max_num_cuts(::int32_t value);
3015 ::int32_t _internal_binary_search_num_conflicts()
const;
3016 void _internal_set_binary_search_num_conflicts(::int32_t value);
3026 bool _internal_exploit_integer_lp_solution()
const;
3027 void _internal_set_exploit_integer_lp_solution(
bool value);
3037 bool _internal_auto_detect_greater_than_at_least_one_of()
const;
3038 void _internal_set_auto_detect_greater_than_at_least_one_of(
bool value);
3048 bool _internal_instantiate_all_variables()
const;
3049 void _internal_set_instantiate_all_variables(
bool value);
3059 bool _internal_use_exact_lp_reason()
const;
3060 void _internal_set_use_exact_lp_reason(
bool value);
3070 ::int32_t _internal_boolean_encoding_level()
const;
3071 void _internal_set_boolean_encoding_level(::int32_t value);
3081 ::int32_t _internal_cp_model_probing_level()
const;
3082 void _internal_set_cp_model_probing_level(::int32_t value);
3092 bool _internal_add_lp_constraints_lazily()
const;
3093 void _internal_set_add_lp_constraints_lazily(
bool value);
3103 bool _internal_share_objective_bounds()
const;
3104 void _internal_set_share_objective_bounds(
bool value);
3114 bool _internal_share_level_zero_bounds()
const;
3115 void _internal_set_share_level_zero_bounds(
bool value);
3125 bool _internal_exploit_all_lp_solution()
const;
3126 void _internal_set_exploit_all_lp_solution(
bool value);
3136 double _internal_min_orthogonality_for_lp_constraints()
const;
3137 void _internal_set_min_orthogonality_for_lp_constraints(
double value);
3147 ::int32_t _internal_max_integer_rounding_scaling()
const;
3148 void _internal_set_max_integer_rounding_scaling(::int32_t value);
3158 ::int32_t _internal_max_consecutive_inactive_count()
const;
3159 void _internal_set_max_consecutive_inactive_count(::int32_t value);
3169 ::int64_t _internal_pseudo_cost_reliability_threshold()
const;
3170 void _internal_set_pseudo_cost_reliability_threshold(::int64_t value);
3180 ::int32_t _internal_new_constraints_batch_size()
const;
3181 void _internal_set_new_constraints_batch_size(::int32_t value);
3191 bool _internal_add_cg_cuts()
const;
3192 void _internal_set_add_cg_cuts(
bool value);
3202 bool _internal_add_mir_cuts()
const;
3203 void _internal_set_add_mir_cuts(
bool value);
3213 bool _internal_use_rins_lns()
const;
3214 void _internal_set_use_rins_lns(
bool value);
3224 bool _internal_exploit_objective()
const;
3225 void _internal_set_exploit_objective(
bool value);
3235 double _internal_mip_max_bound()
const;
3236 void _internal_set_mip_max_bound(
double value);
3246 double _internal_mip_var_scaling()
const;
3247 void _internal_set_mip_var_scaling(
double value);
3257 double _internal_mip_wanted_precision()
const;
3258 void _internal_set_mip_wanted_precision(
double value);
3268 double _internal_mip_check_precision()
const;
3269 void _internal_set_mip_check_precision(
double value);
3279 ::int32_t _internal_mip_max_activity_exponent()
const;
3280 void _internal_set_mip_max_activity_exponent(::int32_t value);
3290 ::int32_t _internal_max_presolve_iterations()
const;
3291 void _internal_set_max_presolve_iterations(::int32_t value);
3301 double _internal_merge_no_overlap_work_limit()
const;
3302 void _internal_set_merge_no_overlap_work_limit(
double value);
3312 double _internal_merge_at_most_one_work_limit()
const;
3313 void _internal_set_merge_at_most_one_work_limit(
double value);
3323 ::int32_t _internal_presolve_substitution_level()
const;
3324 void _internal_set_presolve_substitution_level(::int32_t value);
3334 ::int32_t _internal_max_all_diff_cut_size()
const;
3335 void _internal_set_max_all_diff_cut_size(::int32_t value);
3345 bool _internal_catch_sigint_signal()
const;
3346 void _internal_set_catch_sigint_signal(
bool value);
3356 bool _internal_use_implied_bounds()
const;
3357 void _internal_set_use_implied_bounds(
bool value);
3367 bool _internal_add_lin_max_cuts()
const;
3368 void _internal_set_add_lin_max_cuts(
bool value);
3378 bool _internal_use_sat_inprocessing()
const;
3379 void _internal_set_use_sat_inprocessing(
bool value);
3389 ::int32_t _internal_hint_conflict_limit()
const;
3390 void _internal_set_hint_conflict_limit(::int32_t value);
3400 double _internal_cut_max_active_count_value()
const;
3401 void _internal_set_cut_max_active_count_value(
double value);
3411 ::int32_t _internal_max_cut_rounds_at_level_zero()
const;
3412 void _internal_set_max_cut_rounds_at_level_zero(::int32_t value);
3422 ::int32_t _internal_cut_cleanup_target()
const;
3423 void _internal_set_cut_cleanup_target(::int32_t value);
3433 double _internal_cut_active_count_decay()
const;
3434 void _internal_set_cut_active_count_decay(
double value);
3444 double _internal_absolute_gap_limit()
const;
3445 void _internal_set_absolute_gap_limit(
double value);
3466 bool _internal_use_feasibility_pump()
const;
3467 void _internal_set_use_feasibility_pump(
bool value);
3477 bool _internal_mip_automatically_scale_variables()
const;
3478 void _internal_set_mip_automatically_scale_variables(
bool value);
3488 bool _internal_add_zero_half_cuts()
const;
3489 void _internal_set_add_zero_half_cuts(
bool value);
3499 bool _internal_add_clique_cuts()
const;
3500 void _internal_set_add_clique_cuts(
bool value);
3510 ::int32_t _internal_polarity_rephase_increment()
const;
3511 void _internal_set_polarity_rephase_increment(::int32_t value);
3521 ::int32_t _internal_symmetry_level()
const;
3522 void _internal_set_symmetry_level(::int32_t value);
3532 bool _internal_convert_intervals()
const;
3533 void _internal_set_convert_intervals(
bool value);
3543 bool _internal_expand_reservoir_constraints()
const;
3544 void _internal_set_expand_reservoir_constraints(
bool value);
3554 bool _internal_log_to_stdout()
const;
3555 void _internal_set_log_to_stdout(
bool value);
3565 bool _internal_mip_compute_true_objective_bound()
const;
3566 void _internal_set_mip_compute_true_objective_bound(
bool value);
3576 ::int32_t _internal_max_domain_size_when_encoding_eq_neq_constraints()
const;
3577 void _internal_set_max_domain_size_when_encoding_eq_neq_constraints(::int32_t value);
3587 double _internal_clause_cleanup_ratio()
const;
3588 void _internal_set_clause_cleanup_ratio(
double value);
3598 ::int32_t _internal_solution_pool_size()
const;
3599 void _internal_set_solution_pool_size(::int32_t value);
3609 ::int32_t _internal_cut_level()
const;
3610 void _internal_set_cut_level(::int32_t value);
3620 double _internal_mip_max_valid_magnitude()
const;
3621 void _internal_set_mip_max_valid_magnitude(
double value);
3631 ::int64_t _internal_presolve_inclusion_work_limit()
const;
3632 void _internal_set_presolve_inclusion_work_limit(::int64_t value);
3642 double _internal_shaving_deterministic_time_in_probing_search()
const;
3643 void _internal_set_shaving_deterministic_time_in_probing_search(
double value);
3653 double _internal_shaving_search_deterministic_time()
const;
3654 void _internal_set_shaving_search_deterministic_time(
double value);
3664 bool _internal_ignore_names()
const;
3665 void _internal_set_ignore_names(
bool value);
3675 bool _internal_share_binary_clauses()
const;
3676 void _internal_set_share_binary_clauses(
bool value);
3686 bool _internal_use_dual_scheduling_heuristics()
const;
3687 void _internal_set_use_dual_scheduling_heuristics(
bool value);
3697 bool _internal_new_linear_propagation()
const;
3698 void _internal_set_new_linear_propagation(
bool value);
3708 ::int32_t _internal_table_compression_level()
const;
3709 void _internal_set_table_compression_level(::int32_t value);
3719 double _internal_propagation_loop_detection_factor()
const;
3720 void _internal_set_propagation_loop_detection_factor(
double value);
3730 double _internal_probing_deterministic_time_limit()
const;
3731 void _internal_set_probing_deterministic_time_limit(
double value);
3741 ::int32_t _internal_root_lp_iterations()
const;
3742 void _internal_set_root_lp_iterations(::int32_t value);
3752 ::int32_t _internal_max_size_to_create_precedence_literals_in_disjunctive()
const;
3753 void _internal_set_max_size_to_create_precedence_literals_in_disjunctive(::int32_t value);
3763 double _internal_mip_drop_tolerance()
const;
3764 void _internal_set_mip_drop_tolerance(
double value);
3774 double _internal_feasibility_jump_decay()
const;
3775 void _internal_set_feasibility_jump_decay(
double value);
3785 ::int32_t _internal_shared_tree_max_nodes_per_worker()
const;
3786 void _internal_set_shared_tree_max_nodes_per_worker(::int32_t value);
3796 bool _internal_infer_all_diffs()
const;
3797 void _internal_set_infer_all_diffs(
bool value);
3807 bool _internal_find_big_linear_overlap()
const;
3808 void _internal_set_find_big_linear_overlap(
bool value);
3818 bool _internal_feasibility_jump_enable_restarts()
const;
3819 void _internal_set_feasibility_jump_enable_restarts(
bool value);
3829 bool _internal_use_lb_relax_lns()
const;
3830 void _internal_set_use_lb_relax_lns(
bool value);
3840 double _internal_feasibility_jump_var_randomization_probability()
const;
3841 void _internal_set_feasibility_jump_var_randomization_probability(
double value);
3851 double _internal_feasibility_jump_var_perburbation_range_ratio()
const;
3852 void _internal_set_feasibility_jump_var_perburbation_range_ratio(
double value);
3862 ::int32_t _internal_violation_ls_perturbation_period()
const;
3863 void _internal_set_violation_ls_perturbation_period(::int32_t value);
3873 ::int32_t _internal_linear_split_size()
const;
3874 void _internal_set_linear_split_size(::int32_t value);
3884 ::int32_t _internal_feasibility_jump_linearization_level()
const;
3885 void _internal_set_feasibility_jump_linearization_level(::int32_t value);
3895 ::int32_t _internal_feasibility_jump_restart_factor()
const;
3896 void _internal_set_feasibility_jump_restart_factor(::int32_t value);
3906 double _internal_violation_ls_compound_move_probability()
const;
3907 void _internal_set_violation_ls_compound_move_probability(
double value);
3917 ::int32_t _internal_max_num_intervals_for_timetable_edge_finding()
const;
3918 void _internal_set_max_num_intervals_for_timetable_edge_finding(::int32_t value);
3928 ::int32_t _internal_mip_presolve_level()
const;
3929 void _internal_set_mip_presolve_level(::int32_t value);
3939 double _internal_lp_primal_tolerance()
const;
3940 void _internal_set_lp_primal_tolerance(
double value);
3950 double _internal_lp_dual_tolerance()
const;
3951 void _internal_set_lp_dual_tolerance(
double value);
3961 ::int32_t _internal_feasibility_jump_max_expanded_constraint_size()
const;
3962 void _internal_set_feasibility_jump_max_expanded_constraint_size(::int32_t value);
3972 ::int32_t _internal_at_most_one_max_expansion_size()
const;
3973 void _internal_set_at_most_one_max_expansion_size(::int32_t value);
3983 double _internal_inprocessing_dtime_ratio()
const;
3984 void _internal_set_inprocessing_dtime_ratio(
double value);
3994 ::int32_t _internal_probing_num_combinations_limit()
const;
3995 void _internal_set_probing_num_combinations_limit(::int32_t value);
4005 bool _internal_use_feasibility_jump()
const;
4006 void _internal_set_use_feasibility_jump(
bool value);
4016 bool _internal_use_extended_probing()
const;
4017 void _internal_set_use_extended_probing(
bool value);
4027 bool _internal_add_rlt_cuts()
const;
4028 void _internal_set_add_rlt_cuts(
bool value);
4038 bool _internal_use_lns()
const;
4039 void _internal_set_use_lns(
bool value);
4049 double _internal_inprocessing_probing_dtime()
const;
4050 void _internal_set_inprocessing_probing_dtime(
double value);
4060 double _internal_inprocessing_minimization_dtime()
const;
4061 void _internal_set_inprocessing_minimization_dtime(
double value);
4071 ::int32_t _internal_max_pairs_pairwise_reasoning_in_no_overlap_2d()
const;
4072 void _internal_set_max_pairs_pairwise_reasoning_in_no_overlap_2d(::int32_t value);
4082 ::int32_t _internal_shared_tree_worker_min_restarts_per_subtree()
const;
4083 void _internal_set_shared_tree_worker_min_restarts_per_subtree(::int32_t value);
4093 double _internal_shared_tree_open_leaves_per_worker()
const;
4094 void _internal_set_shared_tree_open_leaves_per_worker(
double value);
4104 ::int64_t _internal_shaving_search_threshold()
const;
4105 void _internal_set_shaving_search_threshold(::int64_t value);
4115 double _internal_feasibility_jump_batch_dtime()
const;
4116 void _internal_set_feasibility_jump_batch_dtime(
double value);
4126 ::int32_t _internal_variables_shaving_level()
const;
4127 void _internal_set_variables_shaving_level(::int32_t value);
4137 ::int32_t _internal_lb_relax_num_workers_threshold()
const;
4138 void _internal_set_lb_relax_num_workers_threshold(::int32_t value);
4148 bool _internal_shared_tree_worker_enable_trail_sharing()
const;
4149 void _internal_set_shared_tree_worker_enable_trail_sharing(
bool value);
4159 bool _internal_inprocessing_minimization_use_conflict_analysis()
const;
4160 void _internal_set_inprocessing_minimization_use_conflict_analysis(
bool value);
4170 bool _internal_minimize_shared_clauses()
const;
4171 void _internal_set_minimize_shared_clauses(
bool value);
4181 bool _internal_shared_tree_worker_enable_phase_sharing()
const;
4182 void _internal_set_shared_tree_worker_enable_phase_sharing(
bool value);
4192 ::int32_t _internal_shared_tree_balance_tolerance()
const;
4193 void _internal_set_shared_tree_balance_tolerance(::int32_t value);
4203 double _internal_symmetry_detection_deterministic_time_limit()
const;
4204 void _internal_set_symmetry_detection_deterministic_time_limit(
double value);
4214 double _internal_lns_initial_difficulty()
const;
4215 void _internal_set_lns_initial_difficulty(
double value);
4225 double _internal_lns_initial_deterministic_limit()
const;
4226 void _internal_set_lns_initial_deterministic_limit(
double value);
4236 double _internal_routing_cut_dp_effort()
const;
4237 void _internal_set_routing_cut_dp_effort(
double value);
4247 ::int32_t _internal_routing_cut_subset_size_for_exact_binary_relation_bound()
const;
4248 void _internal_set_routing_cut_subset_size_for_exact_binary_relation_bound(::int32_t value);
4258 bool _internal_remove_fixed_variables_early()
const;
4259 void _internal_set_remove_fixed_variables_early(
bool value);
4269 bool _internal_use_linear3_for_no_overlap_2d_precedences()
const;
4270 void _internal_set_use_linear3_for_no_overlap_2d_precedences(
bool value);
4280 ::int32_t _internal_routing_cut_max_infeasible_path_length()
const;
4281 void _internal_set_routing_cut_max_infeasible_path_length(::int32_t value);
4291 ::int32_t _internal_routing_cut_subset_size_for_shortest_paths_bound()
const;
4292 void _internal_set_routing_cut_subset_size_for_shortest_paths_bound(::int32_t value);
4302 ::int32_t _internal_max_alldiff_domain_size()
const;
4303 void _internal_set_max_alldiff_domain_size(::int32_t value);
4313 ::int32_t _internal_no_overlap_2d_boolean_relations_limit()
const;
4314 void _internal_set_no_overlap_2d_boolean_relations_limit(::int32_t value);
4324 double _internal_share_glue_clauses_dtime()
const;
4325 void _internal_set_share_glue_clauses_dtime(
double value);
4331 friend class ::google::protobuf::internal::TcParser;
4332 static const ::google::protobuf::internal::TcParseTable<5, 275,
4337 friend class ::google::protobuf::MessageLite;
4338 friend class ::google::protobuf::Arena;
4339 template <
typename T>
4340 friend class ::google::protobuf::Arena::InternalHelper;
4341 using InternalArenaConstructable_ = void;
4342 using DestructorSkippable_ = void;
4344 inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized)
noexcept;
4345 inline explicit Impl_(
4346 ::google::protobuf::internal::InternalVisibility visibility,
4347 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
4348 inline explicit Impl_(
4349 ::google::protobuf::internal::InternalVisibility visibility,
4350 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena,
const Impl_& from,
4352 ::google::protobuf::internal::HasBits<9> _has_bits_;
4353 ::google::protobuf::internal::CachedSize _cached_size_;
4354 ::google::protobuf::RepeatedField<int> restart_algorithms_;
4355 ::google::protobuf::RepeatedPtrField<::std::string> subsolvers_;
4356 ::google::protobuf::RepeatedPtrField<::std::string> ignore_subsolvers_;
4357 ::google::protobuf::RepeatedPtrField< ::operations_research::sat::SatParameters > subsolver_params_;
4358 ::google::protobuf::RepeatedPtrField<::std::string> extra_subsolvers_;
4359 ::google::protobuf::RepeatedPtrField<::std::string> filter_subsolvers_;
4360 static const ::google::protobuf::internal::LazyString _i_give_permission_to_break_this_code_default_default_restart_algorithms_;
4361 ::google::protobuf::internal::ArenaStringPtr default_restart_algorithms_;
4362 ::google::protobuf::internal::ArenaStringPtr name_;
4363 ::google::protobuf::internal::ArenaStringPtr log_prefix_;
4364 int preferred_variable_order_;
4365 ::int32_t clause_cleanup_target_;
4366 double random_branches_ratio_;
4367 double random_polarity_ratio_;
4368 bool log_search_progress_;
4369 bool use_pb_resolution_;
4370 bool minimize_reduction_during_pb_resolution_;
4371 bool max_sat_reverse_assumption_order_;
4372 int max_sat_assumption_order_;
4373 int clause_cleanup_protection_;
4374 int clause_cleanup_ordering_;
4375 double strategy_change_increase_ratio_;
4376 ::int32_t num_conflicts_before_strategy_changes_;
4377 bool use_blocking_restart_;
4378 bool use_erwa_heuristic_;
4379 bool also_bump_variables_in_conflict_reasons_;
4380 bool use_overload_checker_in_cumulative_;
4381 double initial_variables_activity_;
4382 int search_branching_;
4383 bool use_timetable_edge_finding_in_cumulative_;
4384 bool optimize_with_core_;
4385 bool optimize_with_max_hs_;
4386 bool enumerate_all_solutions_;
4387 bool only_add_cuts_at_level_zero_;
4388 bool stop_after_first_solution_;
4390 bool randomize_search_;
4391 ::int32_t num_search_workers_;
4392 ::int64_t search_random_variable_pool_size_;
4393 bool use_optional_variables_;
4394 bool exploit_best_solution_;
4395 bool fill_tightened_domains_in_response_;
4396 bool use_combined_no_overlap_;
4397 ::int32_t interleave_batch_size_;
4398 bool interleave_search_;
4399 bool diversify_lns_params_;
4400 bool stop_after_presolve_;
4401 bool exploit_relaxation_solution_;
4402 ::int32_t debug_max_num_presolve_operations_;
4403 double relative_gap_limit_;
4404 bool debug_postsolve_with_full_solver_;
4406 bool expand_alldiff_constraints_;
4407 bool keep_all_feasible_solutions_in_presolve_;
4408 bool presolve_extract_integer_enforcement_;
4409 bool polish_lp_solution_;
4410 bool use_probing_search_;
4411 bool permute_variable_randomly_;
4412 bool permute_presolve_constraint_order_;
4413 bool use_absl_random_;
4414 bool disable_constraint_expansion_;
4415 bool log_to_response_;
4416 bool optimize_with_lb_tree_search_;
4417 bool log_subsolver_statistics_;
4418 bool fix_variables_to_their_hinted_value_;
4419 bool fill_additional_solutions_in_response_;
4420 bool debug_crash_on_bad_hint_;
4421 bool add_objective_cut_;
4422 bool use_timetabling_in_no_overlap_2d_;
4423 bool use_energetic_reasoning_in_no_overlap_2d_;
4424 ::int32_t num_workers_;
4425 bool use_hard_precedences_in_cumulative_;
4426 bool detect_table_with_cost_;
4427 bool exploit_all_precedences_;
4428 bool only_solve_ip_;
4429 bool encode_complex_linear_constraint_with_integer_;
4430 bool mip_scale_large_domain_;
4431 bool use_objective_lb_search_;
4432 bool use_strong_propagation_in_disjunctive_;
4433 ::int32_t shared_tree_num_workers_;
4434 int shared_tree_split_strategy_;
4435 ::int32_t num_violation_ls_;
4436 bool use_shared_tree_search_;
4438 bool stop_after_root_propagation_;
4439 bool use_objective_shaving_search_;
4440 bool push_all_tasks_toward_start_;
4441 bool use_dynamic_precedence_in_disjunctive_;
4442 bool use_dynamic_precedence_in_cumulative_;
4443 bool use_area_energetic_reasoning_in_no_overlap_2d_;
4444 ::int32_t max_lin_max_size_for_expansion_;
4445 bool detect_linearized_product_;
4446 bool mip_treat_high_magnitude_bounds_as_infinity_;
4447 bool save_lp_basis_in_lb_tree_search_;
4448 bool share_glue_clauses_;
4449 bool use_conservative_scale_overload_checker_;
4450 bool encode_cumulative_as_reservoir_;
4451 bool expand_reservoir_using_circuit_;
4452 bool inprocessing_minimization_use_all_orderings_;
4453 ::int32_t max_num_deterministic_batches_;
4454 ::int32_t num_full_subsolvers_;
4455 bool use_try_edge_reasoning_in_no_overlap_2d_;
4456 bool use_symmetry_in_lp_;
4457 bool keep_symmetry_in_presolve_;
4458 bool debug_crash_if_presolve_breaks_hint_;
4459 ::int32_t routing_cut_subset_size_for_binary_relation_bound_;
4460 ::int32_t routing_cut_subset_size_for_tight_binary_relation_bound_;
4461 bool polarity_exploit_ls_hints_;
4462 bool use_all_different_for_circuit_;
4463 bool filter_sat_postsolve_clauses_;
4464 ::int32_t maximum_regions_to_split_in_disconnected_no_overlap_2d_;
4465 int initial_polarity_;
4466 int minimization_algorithm_;
4467 double variable_activity_decay_;
4468 double max_variable_activity_value_;
4469 double clause_activity_decay_;
4470 ::int32_t clause_cleanup_period_;
4471 ::int32_t glucose_decay_increment_period_;
4472 double max_clause_activity_value_;
4473 double glucose_max_decay_;
4474 double glucose_decay_increment_;
4475 ::int32_t restart_period_;
4476 ::int32_t random_seed_;
4477 double max_time_in_seconds_;
4478 ::int64_t max_number_of_conflicts_;
4479 ::int64_t max_memory_in_mb_;
4480 int binary_minimization_algorithm_;
4481 ::int32_t pb_cleanup_increment_;
4482 bool use_optimization_hints_;
4483 bool use_phase_saving_;
4484 bool count_assumption_levels_in_lbd_;
4485 bool subsumption_during_conflict_analysis_;
4486 ::int32_t core_minimization_level_;
4487 double pb_cleanup_ratio_;
4488 int max_sat_stratification_;
4489 ::int32_t presolve_bve_threshold_;
4490 double presolve_probing_deterministic_time_limit_;
4491 ::int32_t presolve_bve_clause_weight_;
4492 ::int32_t clause_cleanup_lbd_bound_;
4493 double restart_dl_average_ratio_;
4494 ::int32_t restart_running_window_size_;
4495 ::int32_t blocking_restart_window_size_;
4496 double blocking_restart_multiplier_;
4497 double max_deterministic_time_;
4498 double restart_lbd_average_ratio_;
4499 ::int32_t presolve_bva_threshold_;
4500 bool presolve_use_bva_;
4501 bool use_precedences_in_disjunctive_constraint_;
4502 bool use_disjunctive_constraint_in_cumulative_;
4503 bool find_multiple_cores_;
4504 bool cp_model_presolve_;
4505 bool presolve_blocked_clause_;
4506 bool cover_optimization_;
4507 bool cp_model_use_sat_presolve_;
4508 ::int32_t linearization_level_;
4509 ::int32_t max_num_cuts_;
4510 ::int32_t binary_search_num_conflicts_;
4511 bool exploit_integer_lp_solution_;
4512 bool auto_detect_greater_than_at_least_one_of_;
4513 bool instantiate_all_variables_;
4514 bool use_exact_lp_reason_;
4515 ::int32_t boolean_encoding_level_;
4516 ::int32_t cp_model_probing_level_;
4517 bool add_lp_constraints_lazily_;
4518 bool share_objective_bounds_;
4519 bool share_level_zero_bounds_;
4520 bool exploit_all_lp_solution_;
4521 double min_orthogonality_for_lp_constraints_;
4522 ::int32_t max_integer_rounding_scaling_;
4523 ::int32_t max_consecutive_inactive_count_;
4524 ::int64_t pseudo_cost_reliability_threshold_;
4525 ::int32_t new_constraints_batch_size_;
4529 bool exploit_objective_;
4530 double mip_max_bound_;
4531 double mip_var_scaling_;
4532 double mip_wanted_precision_;
4533 double mip_check_precision_;
4534 ::int32_t mip_max_activity_exponent_;
4535 ::int32_t max_presolve_iterations_;
4536 double merge_no_overlap_work_limit_;
4537 double merge_at_most_one_work_limit_;
4538 ::int32_t presolve_substitution_level_;
4539 ::int32_t max_all_diff_cut_size_;
4540 bool catch_sigint_signal_;
4541 bool use_implied_bounds_;
4542 bool add_lin_max_cuts_;
4543 bool use_sat_inprocessing_;
4544 ::int32_t hint_conflict_limit_;
4545 double cut_max_active_count_value_;
4546 ::int32_t max_cut_rounds_at_level_zero_;
4547 ::int32_t cut_cleanup_target_;
4548 double cut_active_count_decay_;
4549 double absolute_gap_limit_;
4551 bool use_feasibility_pump_;
4552 bool mip_automatically_scale_variables_;
4553 bool add_zero_half_cuts_;
4554 bool add_clique_cuts_;
4555 ::int32_t polarity_rephase_increment_;
4556 ::int32_t symmetry_level_;
4557 bool convert_intervals_;
4558 bool expand_reservoir_constraints_;
4559 bool log_to_stdout_;
4560 bool mip_compute_true_objective_bound_;
4561 ::int32_t max_domain_size_when_encoding_eq_neq_constraints_;
4562 double clause_cleanup_ratio_;
4563 ::int32_t solution_pool_size_;
4564 ::int32_t cut_level_;
4565 double mip_max_valid_magnitude_;
4566 ::int64_t presolve_inclusion_work_limit_;
4567 double shaving_deterministic_time_in_probing_search_;
4568 double shaving_search_deterministic_time_;
4570 bool share_binary_clauses_;
4571 bool use_dual_scheduling_heuristics_;
4572 bool new_linear_propagation_;
4573 ::int32_t table_compression_level_;
4574 double propagation_loop_detection_factor_;
4575 double probing_deterministic_time_limit_;
4576 ::int32_t root_lp_iterations_;
4577 ::int32_t max_size_to_create_precedence_literals_in_disjunctive_;
4578 double mip_drop_tolerance_;
4579 double feasibility_jump_decay_;
4580 ::int32_t shared_tree_max_nodes_per_worker_;
4581 bool infer_all_diffs_;
4582 bool find_big_linear_overlap_;
4583 bool feasibility_jump_enable_restarts_;
4584 bool use_lb_relax_lns_;
4585 double feasibility_jump_var_randomization_probability_;
4586 double feasibility_jump_var_perburbation_range_ratio_;
4587 ::int32_t violation_ls_perturbation_period_;
4588 ::int32_t linear_split_size_;
4589 ::int32_t feasibility_jump_linearization_level_;
4590 ::int32_t feasibility_jump_restart_factor_;
4591 double violation_ls_compound_move_probability_;
4592 ::int32_t max_num_intervals_for_timetable_edge_finding_;
4593 ::int32_t mip_presolve_level_;
4594 double lp_primal_tolerance_;
4595 double lp_dual_tolerance_;
4596 ::int32_t feasibility_jump_max_expanded_constraint_size_;
4597 ::int32_t at_most_one_max_expansion_size_;
4598 double inprocessing_dtime_ratio_;
4599 ::int32_t probing_num_combinations_limit_;
4600 bool use_feasibility_jump_;
4601 bool use_extended_probing_;
4604 double inprocessing_probing_dtime_;
4605 double inprocessing_minimization_dtime_;
4606 ::int32_t max_pairs_pairwise_reasoning_in_no_overlap_2d_;
4607 ::int32_t shared_tree_worker_min_restarts_per_subtree_;
4608 double shared_tree_open_leaves_per_worker_;
4609 ::int64_t shaving_search_threshold_;
4610 double feasibility_jump_batch_dtime_;
4611 ::int32_t variables_shaving_level_;
4612 ::int32_t lb_relax_num_workers_threshold_;
4613 bool shared_tree_worker_enable_trail_sharing_;
4614 bool inprocessing_minimization_use_conflict_analysis_;
4615 bool minimize_shared_clauses_;
4616 bool shared_tree_worker_enable_phase_sharing_;
4617 ::int32_t shared_tree_balance_tolerance_;
4618 double symmetry_detection_deterministic_time_limit_;
4619 double lns_initial_difficulty_;
4620 double lns_initial_deterministic_limit_;
4621 double routing_cut_dp_effort_;
4622 ::int32_t routing_cut_subset_size_for_exact_binary_relation_bound_;
4623 bool remove_fixed_variables_early_;
4624 bool use_linear3_for_no_overlap_2d_precedences_;
4625 ::int32_t routing_cut_max_infeasible_path_length_;
4626 ::int32_t routing_cut_subset_size_for_shortest_paths_bound_;
4627 ::int32_t max_alldiff_domain_size_;
4628 ::int32_t no_overlap_2d_boolean_relations_limit_;
4629 double share_glue_clauses_dtime_;
4630 PROTOBUF_TSAN_DECLARE_MEMBER
4632 union { Impl_ _impl_; };
4633 friend struct ::TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto;
4647#pragma GCC diagnostic push
4648#pragma GCC diagnostic ignored "-Wstrict-aliasing"
4656 bool value = (
_impl_._has_bits_[0] & 0x00000002u) != 0;
4660 ::google::protobuf::internal::TSanWrite(&
_impl_);
4661 _impl_.name_.ClearToEmpty();
4662 _impl_._has_bits_[0] &= ~0x00000002u;
4665 ABSL_ATTRIBUTE_LIFETIME_BOUND {
4667 return _internal_name();
4669template <
typename Arg_,
typename... Args_>
4671 ::google::protobuf::internal::TSanWrite(&
_impl_);
4672 _impl_._has_bits_[0] |= 0x00000002u;
4673 _impl_.name_.Set(
static_cast<Arg_&&
>(arg), args..., GetArena());
4677 ABSL_ATTRIBUTE_LIFETIME_BOUND {
4678 ::std::string* _s = _internal_mutable_name();
4682inline const ::std::string& SatParameters::_internal_name()
const {
4683 ::google::protobuf::internal::TSanRead(&
_impl_);
4684 return _impl_.name_.Get();
4686inline void SatParameters::_internal_set_name(const ::std::string& value) {
4687 ::google::protobuf::internal::TSanWrite(&
_impl_);
4688 _impl_._has_bits_[0] |= 0x00000002u;
4689 _impl_.name_.Set(value, GetArena());
4691inline ::std::string* PROTOBUF_NONNULL SatParameters::_internal_mutable_name() {
4692 ::google::protobuf::internal::TSanWrite(&
_impl_);
4693 _impl_._has_bits_[0] |= 0x00000002u;
4694 return _impl_.name_.Mutable( GetArena());
4697 ::google::protobuf::internal::TSanWrite(&
_impl_);
4699 if ((
_impl_._has_bits_[0] & 0x00000002u) == 0) {
4702 _impl_._has_bits_[0] &= ~0x00000002u;
4703 auto* released =
_impl_.name_.Release();
4704 if (::google::protobuf::internal::DebugHardenForceCopyDefaultString()) {
4705 _impl_.name_.Set(
"", GetArena());
4710 ::google::protobuf::internal::TSanWrite(&
_impl_);
4711 if (value !=
nullptr) {
4712 _impl_._has_bits_[0] |= 0x00000002u;
4716 _impl_.name_.SetAllocated(value, GetArena());
4717 if (::google::protobuf::internal::DebugHardenForceCopyDefaultString() &&
_impl_.name_.IsDefault()) {
4718 _impl_.name_.Set(
"", GetArena());
4725 bool value = (
_impl_._has_bits_[0] & 0x00000008u) != 0;
4729 ::google::protobuf::internal::TSanWrite(&
_impl_);
4730 _impl_.preferred_variable_order_ = 0;
4731 _impl_._has_bits_[0] &= ~0x00000008u;
4735 return _internal_preferred_variable_order();
4738 _internal_set_preferred_variable_order(value);
4739 _impl_._has_bits_[0] |= 0x00000008u;
4742inline ::operations_research::sat::SatParameters_VariableOrder SatParameters::_internal_preferred_variable_order()
const {
4743 ::google::protobuf::internal::TSanRead(&
_impl_);
4747 ::google::protobuf::internal::TSanWrite(&
_impl_);
4749 assert(::google::protobuf::internal::ValidateEnum(
4751 _impl_.preferred_variable_order_ = value;
4756 bool value = (
_impl_._has_bits_[3] & 0x00000100u) != 0;
4760 ::google::protobuf::internal::TSanWrite(&
_impl_);
4761 _impl_.initial_polarity_ = 1;
4762 _impl_._has_bits_[3] &= ~0x00000100u;
4766 return _internal_initial_polarity();
4769 _internal_set_initial_polarity(value);
4770 _impl_._has_bits_[3] |= 0x00000100u;
4773inline ::operations_research::sat::SatParameters_Polarity SatParameters::_internal_initial_polarity()
const {
4774 ::google::protobuf::internal::TSanRead(&
_impl_);
4778 ::google::protobuf::internal::TSanWrite(&
_impl_);
4780 assert(::google::protobuf::internal::ValidateEnum(
4782 _impl_.initial_polarity_ = value;
4787 bool value = (
_impl_._has_bits_[3] & 0x04000000u) != 0;
4791 ::google::protobuf::internal::TSanWrite(&
_impl_);
4792 _impl_.use_phase_saving_ =
true;
4793 _impl_._has_bits_[3] &= ~0x04000000u;
4797 return _internal_use_phase_saving();
4800 _internal_set_use_phase_saving(value);
4801 _impl_._has_bits_[3] |= 0x04000000u;
4804inline bool SatParameters::_internal_use_phase_saving()
const {
4805 ::google::protobuf::internal::TSanRead(&
_impl_);
4806 return _impl_.use_phase_saving_;
4808inline void SatParameters::_internal_set_use_phase_saving(
bool value) {
4809 ::google::protobuf::internal::TSanWrite(&
_impl_);
4810 _impl_.use_phase_saving_ = value;
4815 bool value = (
_impl_._has_bits_[6] & 0x00000004u) != 0;
4819 ::google::protobuf::internal::TSanWrite(&
_impl_);
4820 _impl_.polarity_rephase_increment_ = 1000;
4821 _impl_._has_bits_[6] &= ~0x00000004u;
4825 return _internal_polarity_rephase_increment();
4828 _internal_set_polarity_rephase_increment(value);
4829 _impl_._has_bits_[6] |= 0x00000004u;
4832inline ::int32_t SatParameters::_internal_polarity_rephase_increment()
const {
4833 ::google::protobuf::internal::TSanRead(&
_impl_);
4834 return _impl_.polarity_rephase_increment_;
4836inline void SatParameters::_internal_set_polarity_rephase_increment(::int32_t value) {
4837 ::google::protobuf::internal::TSanWrite(&
_impl_);
4838 _impl_.polarity_rephase_increment_ = value;
4843 bool value = (
_impl_._has_bits_[3] & 0x00000010u) != 0;
4847 ::google::protobuf::internal::TSanWrite(&
_impl_);
4848 _impl_.polarity_exploit_ls_hints_ =
false;
4849 _impl_._has_bits_[3] &= ~0x00000010u;
4853 return _internal_polarity_exploit_ls_hints();
4856 _internal_set_polarity_exploit_ls_hints(value);
4857 _impl_._has_bits_[3] |= 0x00000010u;
4860inline bool SatParameters::_internal_polarity_exploit_ls_hints()
const {
4861 ::google::protobuf::internal::TSanRead(&
_impl_);
4862 return _impl_.polarity_exploit_ls_hints_;
4864inline void SatParameters::_internal_set_polarity_exploit_ls_hints(
bool value) {
4865 ::google::protobuf::internal::TSanWrite(&
_impl_);
4866 _impl_.polarity_exploit_ls_hints_ = value;
4871 bool value = (
_impl_._has_bits_[0] & 0x00000040u) != 0;
4875 ::google::protobuf::internal::TSanWrite(&
_impl_);
4876 _impl_.random_polarity_ratio_ = 0;
4877 _impl_._has_bits_[0] &= ~0x00000040u;
4881 return _internal_random_polarity_ratio();
4884 _internal_set_random_polarity_ratio(value);
4885 _impl_._has_bits_[0] |= 0x00000040u;
4888inline double SatParameters::_internal_random_polarity_ratio()
const {
4889 ::google::protobuf::internal::TSanRead(&
_impl_);
4890 return _impl_.random_polarity_ratio_;
4892inline void SatParameters::_internal_set_random_polarity_ratio(
double value) {
4893 ::google::protobuf::internal::TSanWrite(&
_impl_);
4894 _impl_.random_polarity_ratio_ = value;
4899 bool value = (
_impl_._has_bits_[0] & 0x00000020u) != 0;
4903 ::google::protobuf::internal::TSanWrite(&
_impl_);
4904 _impl_.random_branches_ratio_ = 0;
4905 _impl_._has_bits_[0] &= ~0x00000020u;
4909 return _internal_random_branches_ratio();
4912 _internal_set_random_branches_ratio(value);
4913 _impl_._has_bits_[0] |= 0x00000020u;
4916inline double SatParameters::_internal_random_branches_ratio()
const {
4917 ::google::protobuf::internal::TSanRead(&
_impl_);
4918 return _impl_.random_branches_ratio_;
4920inline void SatParameters::_internal_set_random_branches_ratio(
double value) {
4921 ::google::protobuf::internal::TSanWrite(&
_impl_);
4922 _impl_.random_branches_ratio_ = value;
4927 bool value = (
_impl_._has_bits_[0] & 0x00020000u) != 0;
4931 ::google::protobuf::internal::TSanWrite(&
_impl_);
4932 _impl_.use_erwa_heuristic_ =
false;
4933 _impl_._has_bits_[0] &= ~0x00020000u;
4937 return _internal_use_erwa_heuristic();
4940 _internal_set_use_erwa_heuristic(value);
4941 _impl_._has_bits_[0] |= 0x00020000u;
4944inline bool SatParameters::_internal_use_erwa_heuristic()
const {
4945 ::google::protobuf::internal::TSanRead(&
_impl_);
4946 return _impl_.use_erwa_heuristic_;
4948inline void SatParameters::_internal_set_use_erwa_heuristic(
bool value) {
4949 ::google::protobuf::internal::TSanWrite(&
_impl_);
4950 _impl_.use_erwa_heuristic_ = value;
4955 bool value = (
_impl_._has_bits_[0] & 0x00100000u) != 0;
4959 ::google::protobuf::internal::TSanWrite(&
_impl_);
4960 _impl_.initial_variables_activity_ = 0;
4961 _impl_._has_bits_[0] &= ~0x00100000u;
4965 return _internal_initial_variables_activity();
4968 _internal_set_initial_variables_activity(value);
4969 _impl_._has_bits_[0] |= 0x00100000u;
4972inline double SatParameters::_internal_initial_variables_activity()
const {
4973 ::google::protobuf::internal::TSanRead(&
_impl_);
4974 return _impl_.initial_variables_activity_;
4976inline void SatParameters::_internal_set_initial_variables_activity(
double value) {
4977 ::google::protobuf::internal::TSanWrite(&
_impl_);
4978 _impl_.initial_variables_activity_ = value;
4983 bool value = (
_impl_._has_bits_[0] & 0x00040000u) != 0;
4987 ::google::protobuf::internal::TSanWrite(&
_impl_);
4988 _impl_.also_bump_variables_in_conflict_reasons_ =
false;
4989 _impl_._has_bits_[0] &= ~0x00040000u;
4993 return _internal_also_bump_variables_in_conflict_reasons();
4996 _internal_set_also_bump_variables_in_conflict_reasons(value);
4997 _impl_._has_bits_[0] |= 0x00040000u;
5000inline bool SatParameters::_internal_also_bump_variables_in_conflict_reasons()
const {
5001 ::google::protobuf::internal::TSanRead(&
_impl_);
5002 return _impl_.also_bump_variables_in_conflict_reasons_;
5004inline void SatParameters::_internal_set_also_bump_variables_in_conflict_reasons(
bool value) {
5005 ::google::protobuf::internal::TSanWrite(&
_impl_);
5006 _impl_.also_bump_variables_in_conflict_reasons_ = value;
5011 bool value = (
_impl_._has_bits_[3] & 0x00000200u) != 0;
5015 ::google::protobuf::internal::TSanWrite(&
_impl_);
5016 _impl_.minimization_algorithm_ = 2;
5017 _impl_._has_bits_[3] &= ~0x00000200u;
5021 return _internal_minimization_algorithm();
5024 _internal_set_minimization_algorithm(value);
5025 _impl_._has_bits_[3] |= 0x00000200u;
5028inline ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm SatParameters::_internal_minimization_algorithm()
const {
5029 ::google::protobuf::internal::TSanRead(&
_impl_);
5033 ::google::protobuf::internal::TSanWrite(&
_impl_);
5035 assert(::google::protobuf::internal::ValidateEnum(
5037 _impl_.minimization_algorithm_ = value;
5042 bool value = (
_impl_._has_bits_[3] & 0x00800000u) != 0;
5046 ::google::protobuf::internal::TSanWrite(&
_impl_);
5047 _impl_.binary_minimization_algorithm_ = 1;
5048 _impl_._has_bits_[3] &= ~0x00800000u;
5052 return _internal_binary_minimization_algorithm();
5055 _internal_set_binary_minimization_algorithm(value);
5056 _impl_._has_bits_[3] |= 0x00800000u;
5059inline ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm SatParameters::_internal_binary_minimization_algorithm()
const {
5060 ::google::protobuf::internal::TSanRead(&
_impl_);
5064 ::google::protobuf::internal::TSanWrite(&
_impl_);
5066 assert(::google::protobuf::internal::ValidateEnum(
5068 _impl_.binary_minimization_algorithm_ = value;
5073 bool value = (
_impl_._has_bits_[3] & 0x10000000u) != 0;
5077 ::google::protobuf::internal::TSanWrite(&
_impl_);
5078 _impl_.subsumption_during_conflict_analysis_ =
true;
5079 _impl_._has_bits_[3] &= ~0x10000000u;
5083 return _internal_subsumption_during_conflict_analysis();
5086 _internal_set_subsumption_during_conflict_analysis(value);
5087 _impl_._has_bits_[3] |= 0x10000000u;
5090inline bool SatParameters::_internal_subsumption_during_conflict_analysis()
const {
5091 ::google::protobuf::internal::TSanRead(&
_impl_);
5092 return _impl_.subsumption_during_conflict_analysis_;
5094inline void SatParameters::_internal_set_subsumption_during_conflict_analysis(
bool value) {
5095 ::google::protobuf::internal::TSanWrite(&
_impl_);
5096 _impl_.subsumption_during_conflict_analysis_ = value;
5101 bool value = (
_impl_._has_bits_[3] & 0x00002000u) != 0;
5105 ::google::protobuf::internal::TSanWrite(&
_impl_);
5106 _impl_.clause_cleanup_period_ = 10000;
5107 _impl_._has_bits_[3] &= ~0x00002000u;
5111 return _internal_clause_cleanup_period();
5114 _internal_set_clause_cleanup_period(value);
5115 _impl_._has_bits_[3] |= 0x00002000u;
5118inline ::int32_t SatParameters::_internal_clause_cleanup_period()
const {
5119 ::google::protobuf::internal::TSanRead(&
_impl_);
5120 return _impl_.clause_cleanup_period_;
5122inline void SatParameters::_internal_set_clause_cleanup_period(::int32_t value) {
5123 ::google::protobuf::internal::TSanWrite(&
_impl_);
5124 _impl_.clause_cleanup_period_ = value;
5129 bool value = (
_impl_._has_bits_[0] & 0x00000010u) != 0;
5133 ::google::protobuf::internal::TSanWrite(&
_impl_);
5134 _impl_.clause_cleanup_target_ = 0;
5135 _impl_._has_bits_[0] &= ~0x00000010u;
5139 return _internal_clause_cleanup_target();
5142 _internal_set_clause_cleanup_target(value);
5143 _impl_._has_bits_[0] |= 0x00000010u;
5146inline ::int32_t SatParameters::_internal_clause_cleanup_target()
const {
5147 ::google::protobuf::internal::TSanRead(&
_impl_);
5148 return _impl_.clause_cleanup_target_;
5150inline void SatParameters::_internal_set_clause_cleanup_target(::int32_t value) {
5151 ::google::protobuf::internal::TSanWrite(&
_impl_);
5152 _impl_.clause_cleanup_target_ = value;
5157 bool value = (
_impl_._has_bits_[6] & 0x00000200u) != 0;
5161 ::google::protobuf::internal::TSanWrite(&
_impl_);
5162 _impl_.clause_cleanup_ratio_ = 0.5;
5163 _impl_._has_bits_[6] &= ~0x00000200u;
5167 return _internal_clause_cleanup_ratio();
5170 _internal_set_clause_cleanup_ratio(value);
5171 _impl_._has_bits_[6] |= 0x00000200u;
5174inline double SatParameters::_internal_clause_cleanup_ratio()
const {
5175 ::google::protobuf::internal::TSanRead(&
_impl_);
5176 return _impl_.clause_cleanup_ratio_;
5178inline void SatParameters::_internal_set_clause_cleanup_ratio(
double value) {
5179 ::google::protobuf::internal::TSanWrite(&
_impl_);
5180 _impl_.clause_cleanup_ratio_ = value;
5185 bool value = (
_impl_._has_bits_[0] & 0x00001000u) != 0;
5189 ::google::protobuf::internal::TSanWrite(&
_impl_);
5190 _impl_.clause_cleanup_protection_ = 0;
5191 _impl_._has_bits_[0] &= ~0x00001000u;
5195 return _internal_clause_cleanup_protection();
5198 _internal_set_clause_cleanup_protection(value);
5199 _impl_._has_bits_[0] |= 0x00001000u;
5202inline ::operations_research::sat::SatParameters_ClauseProtection SatParameters::_internal_clause_cleanup_protection()
const {
5203 ::google::protobuf::internal::TSanRead(&
_impl_);
5207 ::google::protobuf::internal::TSanWrite(&
_impl_);
5209 assert(::google::protobuf::internal::ValidateEnum(
5211 _impl_.clause_cleanup_protection_ = value;
5216 bool value = (
_impl_._has_bits_[4] & 0x00000008u) != 0;
5220 ::google::protobuf::internal::TSanWrite(&
_impl_);
5221 _impl_.clause_cleanup_lbd_bound_ = 5;
5222 _impl_._has_bits_[4] &= ~0x00000008u;
5226 return _internal_clause_cleanup_lbd_bound();
5229 _internal_set_clause_cleanup_lbd_bound(value);
5230 _impl_._has_bits_[4] |= 0x00000008u;
5233inline ::int32_t SatParameters::_internal_clause_cleanup_lbd_bound()
const {
5234 ::google::protobuf::internal::TSanRead(&
_impl_);
5235 return _impl_.clause_cleanup_lbd_bound_;
5237inline void SatParameters::_internal_set_clause_cleanup_lbd_bound(::int32_t value) {
5238 ::google::protobuf::internal::TSanWrite(&
_impl_);
5239 _impl_.clause_cleanup_lbd_bound_ = value;
5244 bool value = (
_impl_._has_bits_[0] & 0x00002000u) != 0;
5248 ::google::protobuf::internal::TSanWrite(&
_impl_);
5249 _impl_.clause_cleanup_ordering_ = 0;
5250 _impl_._has_bits_[0] &= ~0x00002000u;
5254 return _internal_clause_cleanup_ordering();
5257 _internal_set_clause_cleanup_ordering(value);
5258 _impl_._has_bits_[0] |= 0x00002000u;
5261inline ::operations_research::sat::SatParameters_ClauseOrdering SatParameters::_internal_clause_cleanup_ordering()
const {
5262 ::google::protobuf::internal::TSanRead(&
_impl_);
5266 ::google::protobuf::internal::TSanWrite(&
_impl_);
5268 assert(::google::protobuf::internal::ValidateEnum(
5270 _impl_.clause_cleanup_ordering_ = value;
5275 bool value = (
_impl_._has_bits_[3] & 0x01000000u) != 0;
5279 ::google::protobuf::internal::TSanWrite(&
_impl_);
5280 _impl_.pb_cleanup_increment_ = 200;
5281 _impl_._has_bits_[3] &= ~0x01000000u;
5285 return _internal_pb_cleanup_increment();
5288 _internal_set_pb_cleanup_increment(value);
5289 _impl_._has_bits_[3] |= 0x01000000u;
5292inline ::int32_t SatParameters::_internal_pb_cleanup_increment()
const {
5293 ::google::protobuf::internal::TSanRead(&
_impl_);
5294 return _impl_.pb_cleanup_increment_;
5296inline void SatParameters::_internal_set_pb_cleanup_increment(::int32_t value) {
5297 ::google::protobuf::internal::TSanWrite(&
_impl_);
5298 _impl_.pb_cleanup_increment_ = value;
5303 bool value = (
_impl_._has_bits_[3] & 0x40000000u) != 0;
5307 ::google::protobuf::internal::TSanWrite(&
_impl_);
5308 _impl_.pb_cleanup_ratio_ = 0.5;
5309 _impl_._has_bits_[3] &= ~0x40000000u;
5313 return _internal_pb_cleanup_ratio();
5316 _internal_set_pb_cleanup_ratio(value);
5317 _impl_._has_bits_[3] |= 0x40000000u;
5320inline double SatParameters::_internal_pb_cleanup_ratio()
const {
5321 ::google::protobuf::internal::TSanRead(&
_impl_);
5322 return _impl_.pb_cleanup_ratio_;
5324inline void SatParameters::_internal_set_pb_cleanup_ratio(
double value) {
5325 ::google::protobuf::internal::TSanWrite(&
_impl_);
5326 _impl_.pb_cleanup_ratio_ = value;
5331 bool value = (
_impl_._has_bits_[3] & 0x00000400u) != 0;
5335 ::google::protobuf::internal::TSanWrite(&
_impl_);
5336 _impl_.variable_activity_decay_ = 0.8;
5337 _impl_._has_bits_[3] &= ~0x00000400u;
5341 return _internal_variable_activity_decay();
5344 _internal_set_variable_activity_decay(value);
5345 _impl_._has_bits_[3] |= 0x00000400u;
5348inline double SatParameters::_internal_variable_activity_decay()
const {
5349 ::google::protobuf::internal::TSanRead(&
_impl_);
5350 return _impl_.variable_activity_decay_;
5352inline void SatParameters::_internal_set_variable_activity_decay(
double value) {
5353 ::google::protobuf::internal::TSanWrite(&
_impl_);
5354 _impl_.variable_activity_decay_ = value;
5359 bool value = (
_impl_._has_bits_[3] & 0x00000800u) != 0;
5363 ::google::protobuf::internal::TSanWrite(&
_impl_);
5364 _impl_.max_variable_activity_value_ = 1e+100;
5365 _impl_._has_bits_[3] &= ~0x00000800u;
5369 return _internal_max_variable_activity_value();
5372 _internal_set_max_variable_activity_value(value);
5373 _impl_._has_bits_[3] |= 0x00000800u;
5376inline double SatParameters::_internal_max_variable_activity_value()
const {
5377 ::google::protobuf::internal::TSanRead(&
_impl_);
5378 return _impl_.max_variable_activity_value_;
5380inline void SatParameters::_internal_set_max_variable_activity_value(
double value) {
5381 ::google::protobuf::internal::TSanWrite(&
_impl_);
5382 _impl_.max_variable_activity_value_ = value;
5387 bool value = (
_impl_._has_bits_[3] & 0x00010000u) != 0;
5391 ::google::protobuf::internal::TSanWrite(&
_impl_);
5392 _impl_.glucose_max_decay_ = 0.95;
5393 _impl_._has_bits_[3] &= ~0x00010000u;
5397 return _internal_glucose_max_decay();
5400 _internal_set_glucose_max_decay(value);
5401 _impl_._has_bits_[3] |= 0x00010000u;
5404inline double SatParameters::_internal_glucose_max_decay()
const {
5405 ::google::protobuf::internal::TSanRead(&
_impl_);
5406 return _impl_.glucose_max_decay_;
5408inline void SatParameters::_internal_set_glucose_max_decay(
double value) {
5409 ::google::protobuf::internal::TSanWrite(&
_impl_);
5410 _impl_.glucose_max_decay_ = value;
5415 bool value = (
_impl_._has_bits_[3] & 0x00020000u) != 0;
5419 ::google::protobuf::internal::TSanWrite(&
_impl_);
5420 _impl_.glucose_decay_increment_ = 0.01;
5421 _impl_._has_bits_[3] &= ~0x00020000u;
5425 return _internal_glucose_decay_increment();
5428 _internal_set_glucose_decay_increment(value);
5429 _impl_._has_bits_[3] |= 0x00020000u;
5432inline double SatParameters::_internal_glucose_decay_increment()
const {
5433 ::google::protobuf::internal::TSanRead(&
_impl_);
5434 return _impl_.glucose_decay_increment_;
5436inline void SatParameters::_internal_set_glucose_decay_increment(
double value) {
5437 ::google::protobuf::internal::TSanWrite(&
_impl_);
5438 _impl_.glucose_decay_increment_ = value;
5443 bool value = (
_impl_._has_bits_[3] & 0x00004000u) != 0;
5447 ::google::protobuf::internal::TSanWrite(&
_impl_);
5448 _impl_.glucose_decay_increment_period_ = 5000;
5449 _impl_._has_bits_[3] &= ~0x00004000u;
5453 return _internal_glucose_decay_increment_period();
5456 _internal_set_glucose_decay_increment_period(value);
5457 _impl_._has_bits_[3] |= 0x00004000u;
5460inline ::int32_t SatParameters::_internal_glucose_decay_increment_period()
const {
5461 ::google::protobuf::internal::TSanRead(&
_impl_);
5462 return _impl_.glucose_decay_increment_period_;
5464inline void SatParameters::_internal_set_glucose_decay_increment_period(::int32_t value) {
5465 ::google::protobuf::internal::TSanWrite(&
_impl_);
5466 _impl_.glucose_decay_increment_period_ = value;
5471 bool value = (
_impl_._has_bits_[3] & 0x00001000u) != 0;
5475 ::google::protobuf::internal::TSanWrite(&
_impl_);
5476 _impl_.clause_activity_decay_ = 0.999;
5477 _impl_._has_bits_[3] &= ~0x00001000u;
5481 return _internal_clause_activity_decay();
5484 _internal_set_clause_activity_decay(value);
5485 _impl_._has_bits_[3] |= 0x00001000u;
5488inline double SatParameters::_internal_clause_activity_decay()
const {
5489 ::google::protobuf::internal::TSanRead(&
_impl_);
5490 return _impl_.clause_activity_decay_;
5492inline void SatParameters::_internal_set_clause_activity_decay(
double value) {
5493 ::google::protobuf::internal::TSanWrite(&
_impl_);
5494 _impl_.clause_activity_decay_ = value;
5499 bool value = (
_impl_._has_bits_[3] & 0x00008000u) != 0;
5503 ::google::protobuf::internal::TSanWrite(&
_impl_);
5504 _impl_.max_clause_activity_value_ = 1e+20;
5505 _impl_._has_bits_[3] &= ~0x00008000u;
5509 return _internal_max_clause_activity_value();
5512 _internal_set_max_clause_activity_value(value);
5513 _impl_._has_bits_[3] |= 0x00008000u;
5516inline double SatParameters::_internal_max_clause_activity_value()
const {
5517 ::google::protobuf::internal::TSanRead(&
_impl_);
5518 return _impl_.max_clause_activity_value_;
5520inline void SatParameters::_internal_set_max_clause_activity_value(
double value) {
5521 ::google::protobuf::internal::TSanWrite(&
_impl_);
5522 _impl_.max_clause_activity_value_ = value;
5526inline int SatParameters::_internal_restart_algorithms_size()
const {
5527 return _internal_restart_algorithms().size();
5530 return _internal_restart_algorithms_size();
5533 ::google::protobuf::internal::TSanWrite(&
_impl_);
5542 assert(::google::protobuf::internal::ValidateEnum(
5544 _internal_mutable_restart_algorithms()->Set(index, value);
5549 assert(::google::protobuf::internal::ValidateEnum(
5551 ::google::protobuf::internal::TSanWrite(&
_impl_);
5552 _internal_mutable_restart_algorithms()->Add(value);
5556 ABSL_ATTRIBUTE_LIFETIME_BOUND {
5558 return _internal_restart_algorithms();
5561 ABSL_ATTRIBUTE_LIFETIME_BOUND {
5563 ::google::protobuf::internal::TSanWrite(&
_impl_);
5564 return _internal_mutable_restart_algorithms();
5566inline const ::google::protobuf::RepeatedField<int>& SatParameters::_internal_restart_algorithms()
5568 ::google::protobuf::internal::TSanRead(&
_impl_);
5569 return _impl_.restart_algorithms_;
5571inline ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL
5572SatParameters::_internal_mutable_restart_algorithms() {
5573 ::google::protobuf::internal::TSanRead(&
_impl_);
5574 return &
_impl_.restart_algorithms_;
5579 bool value = (
_impl_._has_bits_[0] & 0x00000001u) != 0;
5583 ::google::protobuf::internal::TSanWrite(&
_impl_);
5584 _impl_.default_restart_algorithms_.ClearToDefault(::operations_research::sat::SatParameters::Impl_::_i_give_permission_to_break_this_code_default_default_restart_algorithms_, GetArena());
5585 _impl_._has_bits_[0] &= ~0x00000001u;
5588 ABSL_ATTRIBUTE_LIFETIME_BOUND {
5590 if (
_impl_.default_restart_algorithms_.IsDefault()) {
5591 return Impl_::_i_give_permission_to_break_this_code_default_default_restart_algorithms_.get();
5593 return _internal_default_restart_algorithms();
5595template <
typename Arg_,
typename... Args_>
5597 ::google::protobuf::internal::TSanWrite(&
_impl_);
5598 _impl_._has_bits_[0] |= 0x00000001u;
5599 _impl_.default_restart_algorithms_.Set(
static_cast<Arg_&&
>(arg), args..., GetArena());
5603 ABSL_ATTRIBUTE_LIFETIME_BOUND {
5604 ::std::string* _s = _internal_mutable_default_restart_algorithms();
5608inline const ::std::string& SatParameters::_internal_default_restart_algorithms()
const {
5609 ::google::protobuf::internal::TSanRead(&
_impl_);
5610 return _impl_.default_restart_algorithms_.Get();
5612inline void SatParameters::_internal_set_default_restart_algorithms(const ::std::string& value) {
5613 ::google::protobuf::internal::TSanWrite(&
_impl_);
5614 _impl_._has_bits_[0] |= 0x00000001u;
5615 _impl_.default_restart_algorithms_.Set(value, GetArena());
5617inline ::std::string* PROTOBUF_NONNULL SatParameters::_internal_mutable_default_restart_algorithms() {
5618 ::google::protobuf::internal::TSanWrite(&
_impl_);
5619 _impl_._has_bits_[0] |= 0x00000001u;
5620 return _impl_.default_restart_algorithms_.Mutable(::operations_research::sat::SatParameters::Impl_::_i_give_permission_to_break_this_code_default_default_restart_algorithms_, GetArena());
5623 ::google::protobuf::internal::TSanWrite(&
_impl_);
5625 if ((
_impl_._has_bits_[0] & 0x00000001u) == 0) {
5628 _impl_._has_bits_[0] &= ~0x00000001u;
5629 return _impl_.default_restart_algorithms_.Release();
5632 ::google::protobuf::internal::TSanWrite(&
_impl_);
5633 if (value !=
nullptr) {
5634 _impl_._has_bits_[0] |= 0x00000001u;
5638 _impl_.default_restart_algorithms_.SetAllocated(value, GetArena());
5644 bool value = (
_impl_._has_bits_[3] & 0x00040000u) != 0;
5648 ::google::protobuf::internal::TSanWrite(&
_impl_);
5649 _impl_.restart_period_ = 50;
5650 _impl_._has_bits_[3] &= ~0x00040000u;
5654 return _internal_restart_period();
5657 _internal_set_restart_period(value);
5658 _impl_._has_bits_[3] |= 0x00040000u;
5661inline ::int32_t SatParameters::_internal_restart_period()
const {
5662 ::google::protobuf::internal::TSanRead(&
_impl_);
5663 return _impl_.restart_period_;
5665inline void SatParameters::_internal_set_restart_period(::int32_t value) {
5666 ::google::protobuf::internal::TSanWrite(&
_impl_);
5667 _impl_.restart_period_ = value;
5672 bool value = (
_impl_._has_bits_[4] & 0x00000020u) != 0;
5676 ::google::protobuf::internal::TSanWrite(&
_impl_);
5677 _impl_.restart_running_window_size_ = 50;
5678 _impl_._has_bits_[4] &= ~0x00000020u;
5682 return _internal_restart_running_window_size();
5685 _internal_set_restart_running_window_size(value);
5686 _impl_._has_bits_[4] |= 0x00000020u;
5689inline ::int32_t SatParameters::_internal_restart_running_window_size()
const {
5690 ::google::protobuf::internal::TSanRead(&
_impl_);
5691 return _impl_.restart_running_window_size_;
5693inline void SatParameters::_internal_set_restart_running_window_size(::int32_t value) {
5694 ::google::protobuf::internal::TSanWrite(&
_impl_);
5695 _impl_.restart_running_window_size_ = value;
5700 bool value = (
_impl_._has_bits_[4] & 0x00000010u) != 0;
5704 ::google::protobuf::internal::TSanWrite(&
_impl_);
5705 _impl_.restart_dl_average_ratio_ = 1;
5706 _impl_._has_bits_[4] &= ~0x00000010u;
5710 return _internal_restart_dl_average_ratio();
5713 _internal_set_restart_dl_average_ratio(value);
5714 _impl_._has_bits_[4] |= 0x00000010u;
5717inline double SatParameters::_internal_restart_dl_average_ratio()
const {
5718 ::google::protobuf::internal::TSanRead(&
_impl_);
5719 return _impl_.restart_dl_average_ratio_;
5721inline void SatParameters::_internal_set_restart_dl_average_ratio(
double value) {
5722 ::google::protobuf::internal::TSanWrite(&
_impl_);
5723 _impl_.restart_dl_average_ratio_ = value;
5728 bool value = (
_impl_._has_bits_[4] & 0x00000200u) != 0;
5732 ::google::protobuf::internal::TSanWrite(&
_impl_);
5733 _impl_.restart_lbd_average_ratio_ = 1;
5734 _impl_._has_bits_[4] &= ~0x00000200u;
5738 return _internal_restart_lbd_average_ratio();
5741 _internal_set_restart_lbd_average_ratio(value);
5742 _impl_._has_bits_[4] |= 0x00000200u;
5745inline double SatParameters::_internal_restart_lbd_average_ratio()
const {
5746 ::google::protobuf::internal::TSanRead(&
_impl_);
5747 return _impl_.restart_lbd_average_ratio_;
5749inline void SatParameters::_internal_set_restart_lbd_average_ratio(
double value) {
5750 ::google::protobuf::internal::TSanWrite(&
_impl_);
5751 _impl_.restart_lbd_average_ratio_ = value;
5756 bool value = (
_impl_._has_bits_[0] & 0x00010000u) != 0;
5760 ::google::protobuf::internal::TSanWrite(&
_impl_);
5761 _impl_.use_blocking_restart_ =
false;
5762 _impl_._has_bits_[0] &= ~0x00010000u;
5766 return _internal_use_blocking_restart();
5769 _internal_set_use_blocking_restart(value);
5770 _impl_._has_bits_[0] |= 0x00010000u;
5773inline bool SatParameters::_internal_use_blocking_restart()
const {
5774 ::google::protobuf::internal::TSanRead(&
_impl_);
5775 return _impl_.use_blocking_restart_;
5777inline void SatParameters::_internal_set_use_blocking_restart(
bool value) {
5778 ::google::protobuf::internal::TSanWrite(&
_impl_);
5779 _impl_.use_blocking_restart_ = value;
5784 bool value = (
_impl_._has_bits_[4] & 0x00000040u) != 0;
5788 ::google::protobuf::internal::TSanWrite(&
_impl_);
5789 _impl_.blocking_restart_window_size_ = 5000;
5790 _impl_._has_bits_[4] &= ~0x00000040u;
5794 return _internal_blocking_restart_window_size();
5797 _internal_set_blocking_restart_window_size(value);
5798 _impl_._has_bits_[4] |= 0x00000040u;
5801inline ::int32_t SatParameters::_internal_blocking_restart_window_size()
const {
5802 ::google::protobuf::internal::TSanRead(&
_impl_);
5803 return _impl_.blocking_restart_window_size_;
5805inline void SatParameters::_internal_set_blocking_restart_window_size(::int32_t value) {
5806 ::google::protobuf::internal::TSanWrite(&
_impl_);
5807 _impl_.blocking_restart_window_size_ = value;
5812 bool value = (
_impl_._has_bits_[4] & 0x00000080u) != 0;
5816 ::google::protobuf::internal::TSanWrite(&
_impl_);
5817 _impl_.blocking_restart_multiplier_ = 1.4;
5818 _impl_._has_bits_[4] &= ~0x00000080u;
5822 return _internal_blocking_restart_multiplier();
5825 _internal_set_blocking_restart_multiplier(value);
5826 _impl_._has_bits_[4] |= 0x00000080u;
5829inline double SatParameters::_internal_blocking_restart_multiplier()
const {
5830 ::google::protobuf::internal::TSanRead(&
_impl_);
5831 return _impl_.blocking_restart_multiplier_;
5833inline void SatParameters::_internal_set_blocking_restart_multiplier(
double value) {
5834 ::google::protobuf::internal::TSanWrite(&
_impl_);
5835 _impl_.blocking_restart_multiplier_ = value;
5840 bool value = (
_impl_._has_bits_[0] & 0x00008000u) != 0;
5844 ::google::protobuf::internal::TSanWrite(&
_impl_);
5845 _impl_.num_conflicts_before_strategy_changes_ = 0;
5846 _impl_._has_bits_[0] &= ~0x00008000u;
5850 return _internal_num_conflicts_before_strategy_changes();
5853 _internal_set_num_conflicts_before_strategy_changes(value);
5854 _impl_._has_bits_[0] |= 0x00008000u;
5857inline ::int32_t SatParameters::_internal_num_conflicts_before_strategy_changes()
const {
5858 ::google::protobuf::internal::TSanRead(&
_impl_);
5859 return _impl_.num_conflicts_before_strategy_changes_;
5861inline void SatParameters::_internal_set_num_conflicts_before_strategy_changes(::int32_t value) {
5862 ::google::protobuf::internal::TSanWrite(&
_impl_);
5863 _impl_.num_conflicts_before_strategy_changes_ = value;
5868 bool value = (
_impl_._has_bits_[0] & 0x00004000u) != 0;
5872 ::google::protobuf::internal::TSanWrite(&
_impl_);
5873 _impl_.strategy_change_increase_ratio_ = 0;
5874 _impl_._has_bits_[0] &= ~0x00004000u;
5878 return _internal_strategy_change_increase_ratio();
5881 _internal_set_strategy_change_increase_ratio(value);
5882 _impl_._has_bits_[0] |= 0x00004000u;
5885inline double SatParameters::_internal_strategy_change_increase_ratio()
const {
5886 ::google::protobuf::internal::TSanRead(&
_impl_);
5887 return _impl_.strategy_change_increase_ratio_;
5889inline void SatParameters::_internal_set_strategy_change_increase_ratio(
double value) {
5890 ::google::protobuf::internal::TSanWrite(&
_impl_);
5891 _impl_.strategy_change_increase_ratio_ = value;
5896 bool value = (
_impl_._has_bits_[3] & 0x00100000u) != 0;
5900 ::google::protobuf::internal::TSanWrite(&
_impl_);
5901 _impl_.max_time_in_seconds_ = std::numeric_limits<double>::infinity();
5902 _impl_._has_bits_[3] &= ~0x00100000u;
5906 return _internal_max_time_in_seconds();
5909 _internal_set_max_time_in_seconds(value);
5910 _impl_._has_bits_[3] |= 0x00100000u;
5913inline double SatParameters::_internal_max_time_in_seconds()
const {
5914 ::google::protobuf::internal::TSanRead(&
_impl_);
5915 return _impl_.max_time_in_seconds_;
5917inline void SatParameters::_internal_set_max_time_in_seconds(
double value) {
5918 ::google::protobuf::internal::TSanWrite(&
_impl_);
5919 _impl_.max_time_in_seconds_ = value;
5924 bool value = (
_impl_._has_bits_[4] & 0x00000100u) != 0;
5928 ::google::protobuf::internal::TSanWrite(&
_impl_);
5929 _impl_.max_deterministic_time_ = std::numeric_limits<double>::infinity();
5930 _impl_._has_bits_[4] &= ~0x00000100u;
5934 return _internal_max_deterministic_time();
5937 _internal_set_max_deterministic_time(value);
5938 _impl_._has_bits_[4] |= 0x00000100u;
5941inline double SatParameters::_internal_max_deterministic_time()
const {
5942 ::google::protobuf::internal::TSanRead(&
_impl_);
5943 return _impl_.max_deterministic_time_;
5945inline void SatParameters::_internal_set_max_deterministic_time(
double value) {
5946 ::google::protobuf::internal::TSanWrite(&
_impl_);
5947 _impl_.max_deterministic_time_ = value;
5952 bool value = (
_impl_._has_bits_[2] & 0x10000000u) != 0;
5956 ::google::protobuf::internal::TSanWrite(&
_impl_);
5957 _impl_.max_num_deterministic_batches_ = 0;
5958 _impl_._has_bits_[2] &= ~0x10000000u;
5962 return _internal_max_num_deterministic_batches();
5965 _internal_set_max_num_deterministic_batches(value);
5966 _impl_._has_bits_[2] |= 0x10000000u;
5969inline ::int32_t SatParameters::_internal_max_num_deterministic_batches()
const {
5970 ::google::protobuf::internal::TSanRead(&
_impl_);
5971 return _impl_.max_num_deterministic_batches_;
5973inline void SatParameters::_internal_set_max_num_deterministic_batches(::int32_t value) {
5974 ::google::protobuf::internal::TSanWrite(&
_impl_);
5975 _impl_.max_num_deterministic_batches_ = value;
5980 bool value = (
_impl_._has_bits_[3] & 0x00200000u) != 0;
5984 ::google::protobuf::internal::TSanWrite(&
_impl_);
5985 _impl_.max_number_of_conflicts_ = ::int64_t{9223372036854775807};
5986 _impl_._has_bits_[3] &= ~0x00200000u;
5990 return _internal_max_number_of_conflicts();
5993 _internal_set_max_number_of_conflicts(value);
5994 _impl_._has_bits_[3] |= 0x00200000u;
5997inline ::int64_t SatParameters::_internal_max_number_of_conflicts()
const {
5998 ::google::protobuf::internal::TSanRead(&
_impl_);
5999 return _impl_.max_number_of_conflicts_;
6001inline void SatParameters::_internal_set_max_number_of_conflicts(::int64_t value) {
6002 ::google::protobuf::internal::TSanWrite(&
_impl_);
6003 _impl_.max_number_of_conflicts_ = value;
6008 bool value = (
_impl_._has_bits_[3] & 0x00400000u) != 0;
6012 ::google::protobuf::internal::TSanWrite(&
_impl_);
6013 _impl_.max_memory_in_mb_ = ::int64_t{10000};
6014 _impl_._has_bits_[3] &= ~0x00400000u;
6018 return _internal_max_memory_in_mb();
6021 _internal_set_max_memory_in_mb(value);
6022 _impl_._has_bits_[3] |= 0x00400000u;
6025inline ::int64_t SatParameters::_internal_max_memory_in_mb()
const {
6026 ::google::protobuf::internal::TSanRead(&
_impl_);
6027 return _impl_.max_memory_in_mb_;
6029inline void SatParameters::_internal_set_max_memory_in_mb(::int64_t value) {
6030 ::google::protobuf::internal::TSanWrite(&
_impl_);
6031 _impl_.max_memory_in_mb_ = value;
6036 bool value = (
_impl_._has_bits_[5] & 0x10000000u) != 0;
6040 ::google::protobuf::internal::TSanWrite(&
_impl_);
6041 _impl_.absolute_gap_limit_ = 0.0001;
6042 _impl_._has_bits_[5] &= ~0x10000000u;
6046 return _internal_absolute_gap_limit();
6049 _internal_set_absolute_gap_limit(value);
6050 _impl_._has_bits_[5] |= 0x10000000u;
6053inline double SatParameters::_internal_absolute_gap_limit()
const {
6054 ::google::protobuf::internal::TSanRead(&
_impl_);
6055 return _impl_.absolute_gap_limit_;
6057inline void SatParameters::_internal_set_absolute_gap_limit(
double value) {
6058 ::google::protobuf::internal::TSanWrite(&
_impl_);
6059 _impl_.absolute_gap_limit_ = value;
6064 bool value = (
_impl_._has_bits_[1] & 0x00000400u) != 0;
6068 ::google::protobuf::internal::TSanWrite(&
_impl_);
6069 _impl_.relative_gap_limit_ = 0;
6070 _impl_._has_bits_[1] &= ~0x00000400u;
6074 return _internal_relative_gap_limit();
6077 _internal_set_relative_gap_limit(value);
6078 _impl_._has_bits_[1] |= 0x00000400u;
6081inline double SatParameters::_internal_relative_gap_limit()
const {
6082 ::google::protobuf::internal::TSanRead(&
_impl_);
6083 return _impl_.relative_gap_limit_;
6085inline void SatParameters::_internal_set_relative_gap_limit(
double value) {
6086 ::google::protobuf::internal::TSanWrite(&
_impl_);
6087 _impl_.relative_gap_limit_ = value;
6092 bool value = (
_impl_._has_bits_[3] & 0x00080000u) != 0;
6096 ::google::protobuf::internal::TSanWrite(&
_impl_);
6098 _impl_._has_bits_[3] &= ~0x00080000u;
6102 return _internal_random_seed();
6105 _internal_set_random_seed(value);
6106 _impl_._has_bits_[3] |= 0x00080000u;
6109inline ::int32_t SatParameters::_internal_random_seed()
const {
6110 ::google::protobuf::internal::TSanRead(&
_impl_);
6111 return _impl_.random_seed_;
6113inline void SatParameters::_internal_set_random_seed(::int32_t value) {
6114 ::google::protobuf::internal::TSanWrite(&
_impl_);
6115 _impl_.random_seed_ = value;
6120 bool value = (
_impl_._has_bits_[1] & 0x00040000u) != 0;
6124 ::google::protobuf::internal::TSanWrite(&
_impl_);
6125 _impl_.permute_variable_randomly_ =
false;
6126 _impl_._has_bits_[1] &= ~0x00040000u;
6130 return _internal_permute_variable_randomly();
6133 _internal_set_permute_variable_randomly(value);
6134 _impl_._has_bits_[1] |= 0x00040000u;
6137inline bool SatParameters::_internal_permute_variable_randomly()
const {
6138 ::google::protobuf::internal::TSanRead(&
_impl_);
6139 return _impl_.permute_variable_randomly_;
6141inline void SatParameters::_internal_set_permute_variable_randomly(
bool value) {
6142 ::google::protobuf::internal::TSanWrite(&
_impl_);
6143 _impl_.permute_variable_randomly_ = value;
6148 bool value = (
_impl_._has_bits_[1] & 0x00080000u) != 0;
6152 ::google::protobuf::internal::TSanWrite(&
_impl_);
6153 _impl_.permute_presolve_constraint_order_ =
false;
6154 _impl_._has_bits_[1] &= ~0x00080000u;
6158 return _internal_permute_presolve_constraint_order();
6161 _internal_set_permute_presolve_constraint_order(value);
6162 _impl_._has_bits_[1] |= 0x00080000u;
6165inline bool SatParameters::_internal_permute_presolve_constraint_order()
const {
6166 ::google::protobuf::internal::TSanRead(&
_impl_);
6167 return _impl_.permute_presolve_constraint_order_;
6169inline void SatParameters::_internal_set_permute_presolve_constraint_order(
bool value) {
6170 ::google::protobuf::internal::TSanWrite(&
_impl_);
6171 _impl_.permute_presolve_constraint_order_ = value;
6176 bool value = (
_impl_._has_bits_[1] & 0x00100000u) != 0;
6180 ::google::protobuf::internal::TSanWrite(&
_impl_);
6181 _impl_.use_absl_random_ =
false;
6182 _impl_._has_bits_[1] &= ~0x00100000u;
6186 return _internal_use_absl_random();
6189 _internal_set_use_absl_random(value);
6190 _impl_._has_bits_[1] |= 0x00100000u;
6193inline bool SatParameters::_internal_use_absl_random()
const {
6194 ::google::protobuf::internal::TSanRead(&
_impl_);
6195 return _impl_.use_absl_random_;
6197inline void SatParameters::_internal_set_use_absl_random(
bool value) {
6198 ::google::protobuf::internal::TSanWrite(&
_impl_);
6199 _impl_.use_absl_random_ = value;
6204 bool value = (
_impl_._has_bits_[0] & 0x00000080u) != 0;
6208 ::google::protobuf::internal::TSanWrite(&
_impl_);
6209 _impl_.log_search_progress_ =
false;
6210 _impl_._has_bits_[0] &= ~0x00000080u;
6214 return _internal_log_search_progress();
6217 _internal_set_log_search_progress(value);
6218 _impl_._has_bits_[0] |= 0x00000080u;
6221inline bool SatParameters::_internal_log_search_progress()
const {
6222 ::google::protobuf::internal::TSanRead(&
_impl_);
6223 return _impl_.log_search_progress_;
6225inline void SatParameters::_internal_set_log_search_progress(
bool value) {
6226 ::google::protobuf::internal::TSanWrite(&
_impl_);
6227 _impl_.log_search_progress_ = value;
6232 bool value = (
_impl_._has_bits_[1] & 0x01000000u) != 0;
6236 ::google::protobuf::internal::TSanWrite(&
_impl_);
6237 _impl_.log_subsolver_statistics_ =
false;
6238 _impl_._has_bits_[1] &= ~0x01000000u;
6242 return _internal_log_subsolver_statistics();
6245 _internal_set_log_subsolver_statistics(value);
6246 _impl_._has_bits_[1] |= 0x01000000u;
6249inline bool SatParameters::_internal_log_subsolver_statistics()
const {
6250 ::google::protobuf::internal::TSanRead(&
_impl_);
6251 return _impl_.log_subsolver_statistics_;
6253inline void SatParameters::_internal_set_log_subsolver_statistics(
bool value) {
6254 ::google::protobuf::internal::TSanWrite(&
_impl_);
6255 _impl_.log_subsolver_statistics_ = value;
6260 bool value = (
_impl_._has_bits_[0] & 0x00000004u) != 0;
6264 ::google::protobuf::internal::TSanWrite(&
_impl_);
6265 _impl_.log_prefix_.ClearToEmpty();
6266 _impl_._has_bits_[0] &= ~0x00000004u;
6269 ABSL_ATTRIBUTE_LIFETIME_BOUND {
6271 return _internal_log_prefix();
6273template <
typename Arg_,
typename... Args_>
6275 ::google::protobuf::internal::TSanWrite(&
_impl_);
6276 _impl_._has_bits_[0] |= 0x00000004u;
6277 _impl_.log_prefix_.Set(
static_cast<Arg_&&
>(arg), args..., GetArena());
6281 ABSL_ATTRIBUTE_LIFETIME_BOUND {
6282 ::std::string* _s = _internal_mutable_log_prefix();
6286inline const ::std::string& SatParameters::_internal_log_prefix()
const {
6287 ::google::protobuf::internal::TSanRead(&
_impl_);
6288 return _impl_.log_prefix_.Get();
6290inline void SatParameters::_internal_set_log_prefix(const ::std::string& value) {
6291 ::google::protobuf::internal::TSanWrite(&
_impl_);
6292 _impl_._has_bits_[0] |= 0x00000004u;
6293 _impl_.log_prefix_.Set(value, GetArena());
6295inline ::std::string* PROTOBUF_NONNULL SatParameters::_internal_mutable_log_prefix() {
6296 ::google::protobuf::internal::TSanWrite(&
_impl_);
6297 _impl_._has_bits_[0] |= 0x00000004u;
6298 return _impl_.log_prefix_.Mutable( GetArena());
6301 ::google::protobuf::internal::TSanWrite(&
_impl_);
6303 if ((
_impl_._has_bits_[0] & 0x00000004u) == 0) {
6306 _impl_._has_bits_[0] &= ~0x00000004u;
6307 auto* released =
_impl_.log_prefix_.Release();
6308 if (::google::protobuf::internal::DebugHardenForceCopyDefaultString()) {
6309 _impl_.log_prefix_.Set(
"", GetArena());
6314 ::google::protobuf::internal::TSanWrite(&
_impl_);
6315 if (value !=
nullptr) {
6316 _impl_._has_bits_[0] |= 0x00000004u;
6320 _impl_.log_prefix_.SetAllocated(value, GetArena());
6321 if (::google::protobuf::internal::DebugHardenForceCopyDefaultString() &&
_impl_.log_prefix_.IsDefault()) {
6322 _impl_.log_prefix_.Set(
"", GetArena());
6329 bool value = (
_impl_._has_bits_[6] & 0x00000040u) != 0;
6333 ::google::protobuf::internal::TSanWrite(&
_impl_);
6334 _impl_.log_to_stdout_ =
true;
6335 _impl_._has_bits_[6] &= ~0x00000040u;
6339 return _internal_log_to_stdout();
6342 _internal_set_log_to_stdout(value);
6343 _impl_._has_bits_[6] |= 0x00000040u;
6346inline bool SatParameters::_internal_log_to_stdout()
const {
6347 ::google::protobuf::internal::TSanRead(&
_impl_);
6348 return _impl_.log_to_stdout_;
6350inline void SatParameters::_internal_set_log_to_stdout(
bool value) {
6351 ::google::protobuf::internal::TSanWrite(&
_impl_);
6352 _impl_.log_to_stdout_ = value;
6357 bool value = (
_impl_._has_bits_[1] & 0x00400000u) != 0;
6361 ::google::protobuf::internal::TSanWrite(&
_impl_);
6362 _impl_.log_to_response_ =
false;
6363 _impl_._has_bits_[1] &= ~0x00400000u;
6367 return _internal_log_to_response();
6370 _internal_set_log_to_response(value);
6371 _impl_._has_bits_[1] |= 0x00400000u;
6374inline bool SatParameters::_internal_log_to_response()
const {
6375 ::google::protobuf::internal::TSanRead(&
_impl_);
6376 return _impl_.log_to_response_;
6378inline void SatParameters::_internal_set_log_to_response(
bool value) {
6379 ::google::protobuf::internal::TSanWrite(&
_impl_);
6380 _impl_.log_to_response_ = value;
6385 bool value = (
_impl_._has_bits_[0] & 0x00000100u) != 0;
6389 ::google::protobuf::internal::TSanWrite(&
_impl_);
6390 _impl_.use_pb_resolution_ =
false;
6391 _impl_._has_bits_[0] &= ~0x00000100u;
6395 return _internal_use_pb_resolution();
6398 _internal_set_use_pb_resolution(value);
6399 _impl_._has_bits_[0] |= 0x00000100u;
6402inline bool SatParameters::_internal_use_pb_resolution()
const {
6403 ::google::protobuf::internal::TSanRead(&
_impl_);
6404 return _impl_.use_pb_resolution_;
6406inline void SatParameters::_internal_set_use_pb_resolution(
bool value) {
6407 ::google::protobuf::internal::TSanWrite(&
_impl_);
6408 _impl_.use_pb_resolution_ = value;
6413 bool value = (
_impl_._has_bits_[0] & 0x00000200u) != 0;
6417 ::google::protobuf::internal::TSanWrite(&
_impl_);
6418 _impl_.minimize_reduction_during_pb_resolution_ =
false;
6419 _impl_._has_bits_[0] &= ~0x00000200u;
6423 return _internal_minimize_reduction_during_pb_resolution();
6426 _internal_set_minimize_reduction_during_pb_resolution(value);
6427 _impl_._has_bits_[0] |= 0x00000200u;
6430inline bool SatParameters::_internal_minimize_reduction_during_pb_resolution()
const {
6431 ::google::protobuf::internal::TSanRead(&
_impl_);
6432 return _impl_.minimize_reduction_during_pb_resolution_;
6434inline void SatParameters::_internal_set_minimize_reduction_during_pb_resolution(
bool value) {
6435 ::google::protobuf::internal::TSanWrite(&
_impl_);
6436 _impl_.minimize_reduction_during_pb_resolution_ = value;
6441 bool value = (
_impl_._has_bits_[3] & 0x08000000u) != 0;
6445 ::google::protobuf::internal::TSanWrite(&
_impl_);
6446 _impl_.count_assumption_levels_in_lbd_ =
true;
6447 _impl_._has_bits_[3] &= ~0x08000000u;
6451 return _internal_count_assumption_levels_in_lbd();
6454 _internal_set_count_assumption_levels_in_lbd(value);
6455 _impl_._has_bits_[3] |= 0x08000000u;
6458inline bool SatParameters::_internal_count_assumption_levels_in_lbd()
const {
6459 ::google::protobuf::internal::TSanRead(&
_impl_);
6460 return _impl_.count_assumption_levels_in_lbd_;
6462inline void SatParameters::_internal_set_count_assumption_levels_in_lbd(
bool value) {
6463 ::google::protobuf::internal::TSanWrite(&
_impl_);
6464 _impl_.count_assumption_levels_in_lbd_ = value;
6469 bool value = (
_impl_._has_bits_[4] & 0x00000001u) != 0;
6473 ::google::protobuf::internal::TSanWrite(&
_impl_);
6474 _impl_.presolve_bve_threshold_ = 500;
6475 _impl_._has_bits_[4] &= ~0x00000001u;
6479 return _internal_presolve_bve_threshold();
6482 _internal_set_presolve_bve_threshold(value);
6483 _impl_._has_bits_[4] |= 0x00000001u;
6486inline ::int32_t SatParameters::_internal_presolve_bve_threshold()
const {
6487 ::google::protobuf::internal::TSanRead(&
_impl_);
6488 return _impl_.presolve_bve_threshold_;
6490inline void SatParameters::_internal_set_presolve_bve_threshold(::int32_t value) {
6491 ::google::protobuf::internal::TSanWrite(&
_impl_);
6492 _impl_.presolve_bve_threshold_ = value;
6497 bool value = (
_impl_._has_bits_[3] & 0x00000040u) != 0;
6501 ::google::protobuf::internal::TSanWrite(&
_impl_);
6502 _impl_.filter_sat_postsolve_clauses_ =
false;
6503 _impl_._has_bits_[3] &= ~0x00000040u;
6507 return _internal_filter_sat_postsolve_clauses();
6510 _internal_set_filter_sat_postsolve_clauses(value);
6511 _impl_._has_bits_[3] |= 0x00000040u;
6514inline bool SatParameters::_internal_filter_sat_postsolve_clauses()
const {
6515 ::google::protobuf::internal::TSanRead(&
_impl_);
6516 return _impl_.filter_sat_postsolve_clauses_;
6518inline void SatParameters::_internal_set_filter_sat_postsolve_clauses(
bool value) {
6519 ::google::protobuf::internal::TSanWrite(&
_impl_);
6520 _impl_.filter_sat_postsolve_clauses_ = value;
6525 bool value = (
_impl_._has_bits_[4] & 0x00000004u) != 0;
6529 ::google::protobuf::internal::TSanWrite(&
_impl_);
6530 _impl_.presolve_bve_clause_weight_ = 3;
6531 _impl_._has_bits_[4] &= ~0x00000004u;
6535 return _internal_presolve_bve_clause_weight();
6538 _internal_set_presolve_bve_clause_weight(value);
6539 _impl_._has_bits_[4] |= 0x00000004u;
6542inline ::int32_t SatParameters::_internal_presolve_bve_clause_weight()
const {
6543 ::google::protobuf::internal::TSanRead(&
_impl_);
6544 return _impl_.presolve_bve_clause_weight_;
6546inline void SatParameters::_internal_set_presolve_bve_clause_weight(::int32_t value) {
6547 ::google::protobuf::internal::TSanWrite(&
_impl_);
6548 _impl_.presolve_bve_clause_weight_ = value;
6553 bool value = (
_impl_._has_bits_[6] & 0x00400000u) != 0;
6557 ::google::protobuf::internal::TSanWrite(&
_impl_);
6558 _impl_.probing_deterministic_time_limit_ = 1;
6559 _impl_._has_bits_[6] &= ~0x00400000u;
6563 return _internal_probing_deterministic_time_limit();
6566 _internal_set_probing_deterministic_time_limit(value);
6567 _impl_._has_bits_[6] |= 0x00400000u;
6570inline double SatParameters::_internal_probing_deterministic_time_limit()
const {
6571 ::google::protobuf::internal::TSanRead(&
_impl_);
6572 return _impl_.probing_deterministic_time_limit_;
6574inline void SatParameters::_internal_set_probing_deterministic_time_limit(
double value) {
6575 ::google::protobuf::internal::TSanWrite(&
_impl_);
6576 _impl_.probing_deterministic_time_limit_ = value;
6581 bool value = (
_impl_._has_bits_[4] & 0x00000002u) != 0;
6585 ::google::protobuf::internal::TSanWrite(&
_impl_);
6586 _impl_.presolve_probing_deterministic_time_limit_ = 30;
6587 _impl_._has_bits_[4] &= ~0x00000002u;
6591 return _internal_presolve_probing_deterministic_time_limit();
6594 _internal_set_presolve_probing_deterministic_time_limit(value);
6595 _impl_._has_bits_[4] |= 0x00000002u;
6598inline double SatParameters::_internal_presolve_probing_deterministic_time_limit()
const {
6599 ::google::protobuf::internal::TSanRead(&
_impl_);
6600 return _impl_.presolve_probing_deterministic_time_limit_;
6602inline void SatParameters::_internal_set_presolve_probing_deterministic_time_limit(
double value) {
6603 ::google::protobuf::internal::TSanWrite(&
_impl_);
6604 _impl_.presolve_probing_deterministic_time_limit_ = value;
6609 bool value = (
_impl_._has_bits_[4] & 0x00010000u) != 0;
6613 ::google::protobuf::internal::TSanWrite(&
_impl_);
6614 _impl_.presolve_blocked_clause_ =
true;
6615 _impl_._has_bits_[4] &= ~0x00010000u;
6619 return _internal_presolve_blocked_clause();
6622 _internal_set_presolve_blocked_clause(value);
6623 _impl_._has_bits_[4] |= 0x00010000u;
6626inline bool SatParameters::_internal_presolve_blocked_clause()
const {
6627 ::google::protobuf::internal::TSanRead(&
_impl_);
6628 return _impl_.presolve_blocked_clause_;
6630inline void SatParameters::_internal_set_presolve_blocked_clause(
bool value) {
6631 ::google::protobuf::internal::TSanWrite(&
_impl_);
6632 _impl_.presolve_blocked_clause_ = value;
6637 bool value = (
_impl_._has_bits_[4] & 0x00000800u) != 0;
6641 ::google::protobuf::internal::TSanWrite(&
_impl_);
6642 _impl_.presolve_use_bva_ =
true;
6643 _impl_._has_bits_[4] &= ~0x00000800u;
6647 return _internal_presolve_use_bva();
6650 _internal_set_presolve_use_bva(value);
6651 _impl_._has_bits_[4] |= 0x00000800u;
6654inline bool SatParameters::_internal_presolve_use_bva()
const {
6655 ::google::protobuf::internal::TSanRead(&
_impl_);
6656 return _impl_.presolve_use_bva_;
6658inline void SatParameters::_internal_set_presolve_use_bva(
bool value) {
6659 ::google::protobuf::internal::TSanWrite(&
_impl_);
6660 _impl_.presolve_use_bva_ = value;
6665 bool value = (
_impl_._has_bits_[4] & 0x00000400u) != 0;
6669 ::google::protobuf::internal::TSanWrite(&
_impl_);
6670 _impl_.presolve_bva_threshold_ = 1;
6671 _impl_._has_bits_[4] &= ~0x00000400u;
6675 return _internal_presolve_bva_threshold();
6678 _internal_set_presolve_bva_threshold(value);
6679 _impl_._has_bits_[4] |= 0x00000400u;
6682inline ::int32_t SatParameters::_internal_presolve_bva_threshold()
const {
6683 ::google::protobuf::internal::TSanRead(&
_impl_);
6684 return _impl_.presolve_bva_threshold_;
6686inline void SatParameters::_internal_set_presolve_bva_threshold(::int32_t value) {
6687 ::google::protobuf::internal::TSanWrite(&
_impl_);
6688 _impl_.presolve_bva_threshold_ = value;
6693 bool value = (
_impl_._has_bits_[5] & 0x00004000u) != 0;
6697 ::google::protobuf::internal::TSanWrite(&
_impl_);
6698 _impl_.max_presolve_iterations_ = 3;
6699 _impl_._has_bits_[5] &= ~0x00004000u;
6703 return _internal_max_presolve_iterations();
6706 _internal_set_max_presolve_iterations(value);
6707 _impl_._has_bits_[5] |= 0x00004000u;
6710inline ::int32_t SatParameters::_internal_max_presolve_iterations()
const {
6711 ::google::protobuf::internal::TSanRead(&
_impl_);
6712 return _impl_.max_presolve_iterations_;
6714inline void SatParameters::_internal_set_max_presolve_iterations(::int32_t value) {
6715 ::google::protobuf::internal::TSanWrite(&
_impl_);
6716 _impl_.max_presolve_iterations_ = value;
6721 bool value = (
_impl_._has_bits_[4] & 0x00008000u) != 0;
6725 ::google::protobuf::internal::TSanWrite(&
_impl_);
6726 _impl_.cp_model_presolve_ =
true;
6727 _impl_._has_bits_[4] &= ~0x00008000u;
6731 return _internal_cp_model_presolve();
6734 _internal_set_cp_model_presolve(value);
6735 _impl_._has_bits_[4] |= 0x00008000u;
6738inline bool SatParameters::_internal_cp_model_presolve()
const {
6739 ::google::protobuf::internal::TSanRead(&
_impl_);
6740 return _impl_.cp_model_presolve_;
6742inline void SatParameters::_internal_set_cp_model_presolve(
bool value) {
6743 ::google::protobuf::internal::TSanWrite(&
_impl_);
6744 _impl_.cp_model_presolve_ = value;
6749 bool value = (
_impl_._has_bits_[4] & 0x08000000u) != 0;
6753 ::google::protobuf::internal::TSanWrite(&
_impl_);
6754 _impl_.cp_model_probing_level_ = 2;
6755 _impl_._has_bits_[4] &= ~0x08000000u;
6759 return _internal_cp_model_probing_level();
6762 _internal_set_cp_model_probing_level(value);
6763 _impl_._has_bits_[4] |= 0x08000000u;
6766inline ::int32_t SatParameters::_internal_cp_model_probing_level()
const {
6767 ::google::protobuf::internal::TSanRead(&
_impl_);
6768 return _impl_.cp_model_probing_level_;
6770inline void SatParameters::_internal_set_cp_model_probing_level(::int32_t value) {
6771 ::google::protobuf::internal::TSanWrite(&
_impl_);
6772 _impl_.cp_model_probing_level_ = value;
6777 bool value = (
_impl_._has_bits_[4] & 0x00040000u) != 0;
6781 ::google::protobuf::internal::TSanWrite(&
_impl_);
6782 _impl_.cp_model_use_sat_presolve_ =
true;
6783 _impl_._has_bits_[4] &= ~0x00040000u;
6787 return _internal_cp_model_use_sat_presolve();
6790 _internal_set_cp_model_use_sat_presolve(value);
6791 _impl_._has_bits_[4] |= 0x00040000u;
6794inline bool SatParameters::_internal_cp_model_use_sat_presolve()
const {
6795 ::google::protobuf::internal::TSanRead(&
_impl_);
6796 return _impl_.cp_model_use_sat_presolve_;
6798inline void SatParameters::_internal_set_cp_model_use_sat_presolve(
bool value) {
6799 ::google::protobuf::internal::TSanWrite(&
_impl_);
6800 _impl_.cp_model_use_sat_presolve_ = value;
6805 bool value = (
_impl_._has_bits_[8] & 0x00000040u) != 0;
6809 ::google::protobuf::internal::TSanWrite(&
_impl_);
6810 _impl_.remove_fixed_variables_early_ =
true;
6811 _impl_._has_bits_[8] &= ~0x00000040u;
6815 return _internal_remove_fixed_variables_early();
6818 _internal_set_remove_fixed_variables_early(value);
6819 _impl_._has_bits_[8] |= 0x00000040u;
6822inline bool SatParameters::_internal_remove_fixed_variables_early()
const {
6823 ::google::protobuf::internal::TSanRead(&
_impl_);
6824 return _impl_.remove_fixed_variables_early_;
6826inline void SatParameters::_internal_set_remove_fixed_variables_early(
bool value) {
6827 ::google::protobuf::internal::TSanWrite(&
_impl_);
6828 _impl_.remove_fixed_variables_early_ = value;
6833 bool value = (
_impl_._has_bits_[2] & 0x00000002u) != 0;
6837 ::google::protobuf::internal::TSanWrite(&
_impl_);
6838 _impl_.detect_table_with_cost_ =
false;
6839 _impl_._has_bits_[2] &= ~0x00000002u;
6843 return _internal_detect_table_with_cost();
6846 _internal_set_detect_table_with_cost(value);
6847 _impl_._has_bits_[2] |= 0x00000002u;
6850inline bool SatParameters::_internal_detect_table_with_cost()
const {
6851 ::google::protobuf::internal::TSanRead(&
_impl_);
6852 return _impl_.detect_table_with_cost_;
6854inline void SatParameters::_internal_set_detect_table_with_cost(
bool value) {
6855 ::google::protobuf::internal::TSanWrite(&
_impl_);
6856 _impl_.detect_table_with_cost_ = value;
6861 bool value = (
_impl_._has_bits_[6] & 0x00100000u) != 0;
6865 ::google::protobuf::internal::TSanWrite(&
_impl_);
6866 _impl_.table_compression_level_ = 2;
6867 _impl_._has_bits_[6] &= ~0x00100000u;
6871 return _internal_table_compression_level();
6874 _internal_set_table_compression_level(value);
6875 _impl_._has_bits_[6] |= 0x00100000u;
6878inline ::int32_t SatParameters::_internal_table_compression_level()
const {
6879 ::google::protobuf::internal::TSanRead(&
_impl_);
6880 return _impl_.table_compression_level_;
6882inline void SatParameters::_internal_set_table_compression_level(::int32_t value) {
6883 ::google::protobuf::internal::TSanWrite(&
_impl_);
6884 _impl_.table_compression_level_ = value;
6889 bool value = (
_impl_._has_bits_[1] & 0x00002000u) != 0;
6893 ::google::protobuf::internal::TSanWrite(&
_impl_);
6894 _impl_.expand_alldiff_constraints_ =
false;
6895 _impl_._has_bits_[1] &= ~0x00002000u;
6899 return _internal_expand_alldiff_constraints();
6902 _internal_set_expand_alldiff_constraints(value);
6903 _impl_._has_bits_[1] |= 0x00002000u;
6906inline bool SatParameters::_internal_expand_alldiff_constraints()
const {
6907 ::google::protobuf::internal::TSanRead(&
_impl_);
6908 return _impl_.expand_alldiff_constraints_;
6910inline void SatParameters::_internal_set_expand_alldiff_constraints(
bool value) {
6911 ::google::protobuf::internal::TSanWrite(&
_impl_);
6912 _impl_.expand_alldiff_constraints_ = value;
6917 bool value = (
_impl_._has_bits_[8] & 0x00000400u) != 0;
6921 ::google::protobuf::internal::TSanWrite(&
_impl_);
6922 _impl_.max_alldiff_domain_size_ = 256;
6923 _impl_._has_bits_[8] &= ~0x00000400u;
6927 return _internal_max_alldiff_domain_size();
6930 _internal_set_max_alldiff_domain_size(value);
6931 _impl_._has_bits_[8] |= 0x00000400u;
6934inline ::int32_t SatParameters::_internal_max_alldiff_domain_size()
const {
6935 ::google::protobuf::internal::TSanRead(&
_impl_);
6936 return _impl_.max_alldiff_domain_size_;
6938inline void SatParameters::_internal_set_max_alldiff_domain_size(::int32_t value) {
6939 ::google::protobuf::internal::TSanWrite(&
_impl_);
6940 _impl_.max_alldiff_domain_size_ = value;
6945 bool value = (
_impl_._has_bits_[6] & 0x00000020u) != 0;
6949 ::google::protobuf::internal::TSanWrite(&
_impl_);
6950 _impl_.expand_reservoir_constraints_ =
true;
6951 _impl_._has_bits_[6] &= ~0x00000020u;
6955 return _internal_expand_reservoir_constraints();
6958 _internal_set_expand_reservoir_constraints(value);
6959 _impl_._has_bits_[6] |= 0x00000020u;
6962inline bool SatParameters::_internal_expand_reservoir_constraints()
const {
6963 ::google::protobuf::internal::TSanRead(&
_impl_);
6964 return _impl_.expand_reservoir_constraints_;
6966inline void SatParameters::_internal_set_expand_reservoir_constraints(
bool value) {
6967 ::google::protobuf::internal::TSanWrite(&
_impl_);
6968 _impl_.expand_reservoir_constraints_ = value;
6973 bool value = (
_impl_._has_bits_[2] & 0x04000000u) != 0;
6977 ::google::protobuf::internal::TSanWrite(&
_impl_);
6978 _impl_.expand_reservoir_using_circuit_ =
false;
6979 _impl_._has_bits_[2] &= ~0x04000000u;
6983 return _internal_expand_reservoir_using_circuit();
6986 _internal_set_expand_reservoir_using_circuit(value);
6987 _impl_._has_bits_[2] |= 0x04000000u;
6990inline bool SatParameters::_internal_expand_reservoir_using_circuit()
const {
6991 ::google::protobuf::internal::TSanRead(&
_impl_);
6992 return _impl_.expand_reservoir_using_circuit_;
6994inline void SatParameters::_internal_set_expand_reservoir_using_circuit(
bool value) {
6995 ::google::protobuf::internal::TSanWrite(&
_impl_);
6996 _impl_.expand_reservoir_using_circuit_ = value;
7001 bool value = (
_impl_._has_bits_[2] & 0x02000000u) != 0;
7005 ::google::protobuf::internal::TSanWrite(&
_impl_);
7006 _impl_.encode_cumulative_as_reservoir_ =
false;
7007 _impl_._has_bits_[2] &= ~0x02000000u;
7011 return _internal_encode_cumulative_as_reservoir();
7014 _internal_set_encode_cumulative_as_reservoir(value);
7015 _impl_._has_bits_[2] |= 0x02000000u;
7018inline bool SatParameters::_internal_encode_cumulative_as_reservoir()
const {
7019 ::google::protobuf::internal::TSanRead(&
_impl_);
7020 return _impl_.encode_cumulative_as_reservoir_;
7022inline void SatParameters::_internal_set_encode_cumulative_as_reservoir(
bool value) {
7023 ::google::protobuf::internal::TSanWrite(&
_impl_);
7024 _impl_.encode_cumulative_as_reservoir_ = value;
7029 bool value = (
_impl_._has_bits_[2] & 0x00080000u) != 0;
7033 ::google::protobuf::internal::TSanWrite(&
_impl_);
7034 _impl_.max_lin_max_size_for_expansion_ = 0;
7035 _impl_._has_bits_[2] &= ~0x00080000u;
7039 return _internal_max_lin_max_size_for_expansion();
7042 _internal_set_max_lin_max_size_for_expansion(value);
7043 _impl_._has_bits_[2] |= 0x00080000u;
7046inline ::int32_t SatParameters::_internal_max_lin_max_size_for_expansion()
const {
7047 ::google::protobuf::internal::TSanRead(&
_impl_);
7048 return _impl_.max_lin_max_size_for_expansion_;
7050inline void SatParameters::_internal_set_max_lin_max_size_for_expansion(::int32_t value) {
7051 ::google::protobuf::internal::TSanWrite(&
_impl_);
7052 _impl_.max_lin_max_size_for_expansion_ = value;
7057 bool value = (
_impl_._has_bits_[1] & 0x00200000u) != 0;
7061 ::google::protobuf::internal::TSanWrite(&
_impl_);
7062 _impl_.disable_constraint_expansion_ =
false;
7063 _impl_._has_bits_[1] &= ~0x00200000u;
7067 return _internal_disable_constraint_expansion();
7070 _internal_set_disable_constraint_expansion(value);
7071 _impl_._has_bits_[1] |= 0x00200000u;
7074inline bool SatParameters::_internal_disable_constraint_expansion()
const {
7075 ::google::protobuf::internal::TSanRead(&
_impl_);
7076 return _impl_.disable_constraint_expansion_;
7078inline void SatParameters::_internal_set_disable_constraint_expansion(
bool value) {
7079 ::google::protobuf::internal::TSanWrite(&
_impl_);
7080 _impl_.disable_constraint_expansion_ = value;
7085 bool value = (
_impl_._has_bits_[2] & 0x00000010u) != 0;
7089 ::google::protobuf::internal::TSanWrite(&
_impl_);
7090 _impl_.encode_complex_linear_constraint_with_integer_ =
false;
7091 _impl_._has_bits_[2] &= ~0x00000010u;
7095 return _internal_encode_complex_linear_constraint_with_integer();
7098 _internal_set_encode_complex_linear_constraint_with_integer(value);
7099 _impl_._has_bits_[2] |= 0x00000010u;
7102inline bool SatParameters::_internal_encode_complex_linear_constraint_with_integer()
const {
7103 ::google::protobuf::internal::TSanRead(&
_impl_);
7104 return _impl_.encode_complex_linear_constraint_with_integer_;
7106inline void SatParameters::_internal_set_encode_complex_linear_constraint_with_integer(
bool value) {
7107 ::google::protobuf::internal::TSanWrite(&
_impl_);
7108 _impl_.encode_complex_linear_constraint_with_integer_ = value;
7113 bool value = (
_impl_._has_bits_[5] & 0x00008000u) != 0;
7117 ::google::protobuf::internal::TSanWrite(&
_impl_);
7118 _impl_.merge_no_overlap_work_limit_ = 1000000000000;
7119 _impl_._has_bits_[5] &= ~0x00008000u;
7123 return _internal_merge_no_overlap_work_limit();
7126 _internal_set_merge_no_overlap_work_limit(value);
7127 _impl_._has_bits_[5] |= 0x00008000u;
7130inline double SatParameters::_internal_merge_no_overlap_work_limit()
const {
7131 ::google::protobuf::internal::TSanRead(&
_impl_);
7132 return _impl_.merge_no_overlap_work_limit_;
7134inline void SatParameters::_internal_set_merge_no_overlap_work_limit(
double value) {
7135 ::google::protobuf::internal::TSanWrite(&
_impl_);
7136 _impl_.merge_no_overlap_work_limit_ = value;
7141 bool value = (
_impl_._has_bits_[5] & 0x00010000u) != 0;
7145 ::google::protobuf::internal::TSanWrite(&
_impl_);
7146 _impl_.merge_at_most_one_work_limit_ = 100000000;
7147 _impl_._has_bits_[5] &= ~0x00010000u;
7151 return _internal_merge_at_most_one_work_limit();
7154 _internal_set_merge_at_most_one_work_limit(value);
7155 _impl_._has_bits_[5] |= 0x00010000u;
7158inline double SatParameters::_internal_merge_at_most_one_work_limit()
const {
7159 ::google::protobuf::internal::TSanRead(&
_impl_);
7160 return _impl_.merge_at_most_one_work_limit_;
7162inline void SatParameters::_internal_set_merge_at_most_one_work_limit(
double value) {
7163 ::google::protobuf::internal::TSanWrite(&
_impl_);
7164 _impl_.merge_at_most_one_work_limit_ = value;
7169 bool value = (
_impl_._has_bits_[5] & 0x00020000u) != 0;
7173 ::google::protobuf::internal::TSanWrite(&
_impl_);
7174 _impl_.presolve_substitution_level_ = 1;
7175 _impl_._has_bits_[5] &= ~0x00020000u;
7179 return _internal_presolve_substitution_level();
7182 _internal_set_presolve_substitution_level(value);
7183 _impl_._has_bits_[5] |= 0x00020000u;
7186inline ::int32_t SatParameters::_internal_presolve_substitution_level()
const {
7187 ::google::protobuf::internal::TSanRead(&
_impl_);
7188 return _impl_.presolve_substitution_level_;
7190inline void SatParameters::_internal_set_presolve_substitution_level(::int32_t value) {
7191 ::google::protobuf::internal::TSanWrite(&
_impl_);
7192 _impl_.presolve_substitution_level_ = value;
7197 bool value = (
_impl_._has_bits_[1] & 0x00008000u) != 0;
7201 ::google::protobuf::internal::TSanWrite(&
_impl_);
7202 _impl_.presolve_extract_integer_enforcement_ =
false;
7203 _impl_._has_bits_[1] &= ~0x00008000u;
7207 return _internal_presolve_extract_integer_enforcement();
7210 _internal_set_presolve_extract_integer_enforcement(value);
7211 _impl_._has_bits_[1] |= 0x00008000u;
7214inline bool SatParameters::_internal_presolve_extract_integer_enforcement()
const {
7215 ::google::protobuf::internal::TSanRead(&
_impl_);
7216 return _impl_.presolve_extract_integer_enforcement_;
7218inline void SatParameters::_internal_set_presolve_extract_integer_enforcement(
bool value) {
7219 ::google::protobuf::internal::TSanWrite(&
_impl_);
7220 _impl_.presolve_extract_integer_enforcement_ = value;
7225 bool value = (
_impl_._has_bits_[6] & 0x00002000u) != 0;
7229 ::google::protobuf::internal::TSanWrite(&
_impl_);
7230 _impl_.presolve_inclusion_work_limit_ = ::int64_t{100000000};
7231 _impl_._has_bits_[6] &= ~0x00002000u;
7235 return _internal_presolve_inclusion_work_limit();
7238 _internal_set_presolve_inclusion_work_limit(value);
7239 _impl_._has_bits_[6] |= 0x00002000u;
7242inline ::int64_t SatParameters::_internal_presolve_inclusion_work_limit()
const {
7243 ::google::protobuf::internal::TSanRead(&
_impl_);
7244 return _impl_.presolve_inclusion_work_limit_;
7246inline void SatParameters::_internal_set_presolve_inclusion_work_limit(::int64_t value) {
7247 ::google::protobuf::internal::TSanWrite(&
_impl_);
7248 _impl_.presolve_inclusion_work_limit_ = value;
7253 bool value = (
_impl_._has_bits_[6] & 0x00010000u) != 0;
7257 ::google::protobuf::internal::TSanWrite(&
_impl_);
7258 _impl_.ignore_names_ =
true;
7259 _impl_._has_bits_[6] &= ~0x00010000u;
7263 return _internal_ignore_names();
7266 _internal_set_ignore_names(value);
7267 _impl_._has_bits_[6] |= 0x00010000u;
7270inline bool SatParameters::_internal_ignore_names()
const {
7271 ::google::protobuf::internal::TSanRead(&
_impl_);
7272 return _impl_.ignore_names_;
7274inline void SatParameters::_internal_set_ignore_names(
bool value) {
7275 ::google::protobuf::internal::TSanWrite(&
_impl_);
7276 _impl_.ignore_names_ = value;
7281 bool value = (
_impl_._has_bits_[6] & 0x10000000u) != 0;
7285 ::google::protobuf::internal::TSanWrite(&
_impl_);
7286 _impl_.infer_all_diffs_ =
true;
7287 _impl_._has_bits_[6] &= ~0x10000000u;
7291 return _internal_infer_all_diffs();
7294 _internal_set_infer_all_diffs(value);
7295 _impl_._has_bits_[6] |= 0x10000000u;
7298inline bool SatParameters::_internal_infer_all_diffs()
const {
7299 ::google::protobuf::internal::TSanRead(&
_impl_);
7300 return _impl_.infer_all_diffs_;
7302inline void SatParameters::_internal_set_infer_all_diffs(
bool value) {
7303 ::google::protobuf::internal::TSanWrite(&
_impl_);
7304 _impl_.infer_all_diffs_ = value;
7309 bool value = (
_impl_._has_bits_[6] & 0x20000000u) != 0;
7313 ::google::protobuf::internal::TSanWrite(&
_impl_);
7314 _impl_.find_big_linear_overlap_ =
true;
7315 _impl_._has_bits_[6] &= ~0x20000000u;
7319 return _internal_find_big_linear_overlap();
7322 _internal_set_find_big_linear_overlap(value);
7323 _impl_._has_bits_[6] |= 0x20000000u;
7326inline bool SatParameters::_internal_find_big_linear_overlap()
const {
7327 ::google::protobuf::internal::TSanRead(&
_impl_);
7328 return _impl_.find_big_linear_overlap_;
7330inline void SatParameters::_internal_set_find_big_linear_overlap(
bool value) {
7331 ::google::protobuf::internal::TSanWrite(&
_impl_);
7332 _impl_.find_big_linear_overlap_ = value;
7337 bool value = (
_impl_._has_bits_[5] & 0x00400000u) != 0;
7341 ::google::protobuf::internal::TSanWrite(&
_impl_);
7342 _impl_.use_sat_inprocessing_ =
true;
7343 _impl_._has_bits_[5] &= ~0x00400000u;
7347 return _internal_use_sat_inprocessing();
7350 _internal_set_use_sat_inprocessing(value);
7351 _impl_._has_bits_[5] |= 0x00400000u;
7354inline bool SatParameters::_internal_use_sat_inprocessing()
const {
7355 ::google::protobuf::internal::TSanRead(&
_impl_);
7356 return _impl_.use_sat_inprocessing_;
7358inline void SatParameters::_internal_set_use_sat_inprocessing(
bool value) {
7359 ::google::protobuf::internal::TSanWrite(&
_impl_);
7360 _impl_.use_sat_inprocessing_ = value;
7365 bool value = (
_impl_._has_bits_[7] & 0x00002000u) != 0;
7369 ::google::protobuf::internal::TSanWrite(&
_impl_);
7370 _impl_.inprocessing_dtime_ratio_ = 0.2;
7371 _impl_._has_bits_[7] &= ~0x00002000u;
7375 return _internal_inprocessing_dtime_ratio();
7378 _internal_set_inprocessing_dtime_ratio(value);
7379 _impl_._has_bits_[7] |= 0x00002000u;
7382inline double SatParameters::_internal_inprocessing_dtime_ratio()
const {
7383 ::google::protobuf::internal::TSanRead(&
_impl_);
7384 return _impl_.inprocessing_dtime_ratio_;
7386inline void SatParameters::_internal_set_inprocessing_dtime_ratio(
double value) {
7387 ::google::protobuf::internal::TSanWrite(&
_impl_);
7388 _impl_.inprocessing_dtime_ratio_ = value;
7393 bool value = (
_impl_._has_bits_[7] & 0x00080000u) != 0;
7397 ::google::protobuf::internal::TSanWrite(&
_impl_);
7398 _impl_.inprocessing_probing_dtime_ = 1;
7399 _impl_._has_bits_[7] &= ~0x00080000u;
7403 return _internal_inprocessing_probing_dtime();
7406 _internal_set_inprocessing_probing_dtime(value);
7407 _impl_._has_bits_[7] |= 0x00080000u;
7410inline double SatParameters::_internal_inprocessing_probing_dtime()
const {
7411 ::google::protobuf::internal::TSanRead(&
_impl_);
7412 return _impl_.inprocessing_probing_dtime_;
7414inline void SatParameters::_internal_set_inprocessing_probing_dtime(
double value) {
7415 ::google::protobuf::internal::TSanWrite(&
_impl_);
7416 _impl_.inprocessing_probing_dtime_ = value;
7421 bool value = (
_impl_._has_bits_[7] & 0x00100000u) != 0;
7425 ::google::protobuf::internal::TSanWrite(&
_impl_);
7426 _impl_.inprocessing_minimization_dtime_ = 1;
7427 _impl_._has_bits_[7] &= ~0x00100000u;
7431 return _internal_inprocessing_minimization_dtime();
7434 _internal_set_inprocessing_minimization_dtime(value);
7435 _impl_._has_bits_[7] |= 0x00100000u;
7438inline double SatParameters::_internal_inprocessing_minimization_dtime()
const {
7439 ::google::protobuf::internal::TSanRead(&
_impl_);
7440 return _impl_.inprocessing_minimization_dtime_;
7442inline void SatParameters::_internal_set_inprocessing_minimization_dtime(
double value) {
7443 ::google::protobuf::internal::TSanWrite(&
_impl_);
7444 _impl_.inprocessing_minimization_dtime_ = value;
7449 bool value = (
_impl_._has_bits_[7] & 0x20000000u) != 0;
7453 ::google::protobuf::internal::TSanWrite(&
_impl_);
7454 _impl_.inprocessing_minimization_use_conflict_analysis_ =
true;
7455 _impl_._has_bits_[7] &= ~0x20000000u;
7459 return _internal_inprocessing_minimization_use_conflict_analysis();
7462 _internal_set_inprocessing_minimization_use_conflict_analysis(value);
7463 _impl_._has_bits_[7] |= 0x20000000u;
7466inline bool SatParameters::_internal_inprocessing_minimization_use_conflict_analysis()
const {
7467 ::google::protobuf::internal::TSanRead(&
_impl_);
7468 return _impl_.inprocessing_minimization_use_conflict_analysis_;
7470inline void SatParameters::_internal_set_inprocessing_minimization_use_conflict_analysis(
bool value) {
7471 ::google::protobuf::internal::TSanWrite(&
_impl_);
7472 _impl_.inprocessing_minimization_use_conflict_analysis_ = value;
7477 bool value = (
_impl_._has_bits_[2] & 0x08000000u) != 0;
7481 ::google::protobuf::internal::TSanWrite(&
_impl_);
7482 _impl_.inprocessing_minimization_use_all_orderings_ =
false;
7483 _impl_._has_bits_[2] &= ~0x08000000u;
7487 return _internal_inprocessing_minimization_use_all_orderings();
7490 _internal_set_inprocessing_minimization_use_all_orderings(value);
7491 _impl_._has_bits_[2] |= 0x08000000u;
7494inline bool SatParameters::_internal_inprocessing_minimization_use_all_orderings()
const {
7495 ::google::protobuf::internal::TSanRead(&
_impl_);
7496 return _impl_.inprocessing_minimization_use_all_orderings_;
7498inline void SatParameters::_internal_set_inprocessing_minimization_use_all_orderings(
bool value) {
7499 ::google::protobuf::internal::TSanWrite(&
_impl_);
7500 _impl_.inprocessing_minimization_use_all_orderings_ = value;
7505 bool value = (
_impl_._has_bits_[1] & 0x80000000u) != 0;
7509 ::google::protobuf::internal::TSanWrite(&
_impl_);
7511 _impl_._has_bits_[1] &= ~0x80000000u;
7515 return _internal_num_workers();
7518 _internal_set_num_workers(value);
7519 _impl_._has_bits_[1] |= 0x80000000u;
7522inline ::int32_t SatParameters::_internal_num_workers()
const {
7523 ::google::protobuf::internal::TSanRead(&
_impl_);
7524 return _impl_.num_workers_;
7526inline void SatParameters::_internal_set_num_workers(::int32_t value) {
7527 ::google::protobuf::internal::TSanWrite(&
_impl_);
7528 _impl_.num_workers_ = value;
7533 bool value = (
_impl_._has_bits_[0] & 0x40000000u) != 0;
7537 ::google::protobuf::internal::TSanWrite(&
_impl_);
7538 _impl_.num_search_workers_ = 0;
7539 _impl_._has_bits_[0] &= ~0x40000000u;
7543 return _internal_num_search_workers();
7546 _internal_set_num_search_workers(value);
7547 _impl_._has_bits_[0] |= 0x40000000u;
7550inline ::int32_t SatParameters::_internal_num_search_workers()
const {
7551 ::google::protobuf::internal::TSanRead(&
_impl_);
7552 return _impl_.num_search_workers_;
7554inline void SatParameters::_internal_set_num_search_workers(::int32_t value) {
7555 ::google::protobuf::internal::TSanWrite(&
_impl_);
7556 _impl_.num_search_workers_ = value;
7561 bool value = (
_impl_._has_bits_[2] & 0x20000000u) != 0;
7565 ::google::protobuf::internal::TSanWrite(&
_impl_);
7566 _impl_.num_full_subsolvers_ = 0;
7567 _impl_._has_bits_[2] &= ~0x20000000u;
7571 return _internal_num_full_subsolvers();
7574 _internal_set_num_full_subsolvers(value);
7575 _impl_._has_bits_[2] |= 0x20000000u;
7578inline ::int32_t SatParameters::_internal_num_full_subsolvers()
const {
7579 ::google::protobuf::internal::TSanRead(&
_impl_);
7580 return _impl_.num_full_subsolvers_;
7582inline void SatParameters::_internal_set_num_full_subsolvers(::int32_t value) {
7583 ::google::protobuf::internal::TSanWrite(&
_impl_);
7584 _impl_.num_full_subsolvers_ = value;
7588inline int SatParameters::_internal_subsolvers_size()
const {
7589 return _internal_subsolvers().size();
7592 return _internal_subsolvers_size();
7595 ::google::protobuf::internal::TSanWrite(&
_impl_);
7599 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7600 ::google::protobuf::internal::TSanWrite(&
_impl_);
7601 ::std::string* _s = _internal_mutable_subsolvers()->Add();
7606 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7608 return _internal_subsolvers().Get(index);
7611 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7613 return _internal_mutable_subsolvers()->Mutable(index);
7615template <
typename Arg_,
typename... Args_>
7617 ::google::protobuf::internal::AssignToString(*_internal_mutable_subsolvers()->Mutable(index), ::std::forward<Arg_>(value),
7621template <
typename Arg_,
typename... Args_>
7623 ::google::protobuf::internal::TSanWrite(&
_impl_);
7624 ::google::protobuf::internal::AddToRepeatedPtrField(*_internal_mutable_subsolvers(),
7625 ::std::forward<Arg_>(value),
7630 const ABSL_ATTRIBUTE_LIFETIME_BOUND {
7632 return _internal_subsolvers();
7634inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7637 ::google::protobuf::internal::TSanWrite(&
_impl_);
7638 return _internal_mutable_subsolvers();
7640inline const ::google::protobuf::RepeatedPtrField<::std::string>&
7641SatParameters::_internal_subsolvers()
const {
7642 ::google::protobuf::internal::TSanRead(&
_impl_);
7643 return _impl_.subsolvers_;
7645inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7646SatParameters::_internal_mutable_subsolvers() {
7647 ::google::protobuf::internal::TSanRead(&
_impl_);
7648 return &
_impl_.subsolvers_;
7652inline int SatParameters::_internal_extra_subsolvers_size()
const {
7653 return _internal_extra_subsolvers().size();
7656 return _internal_extra_subsolvers_size();
7659 ::google::protobuf::internal::TSanWrite(&
_impl_);
7663 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7664 ::google::protobuf::internal::TSanWrite(&
_impl_);
7665 ::std::string* _s = _internal_mutable_extra_subsolvers()->Add();
7670 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7672 return _internal_extra_subsolvers().Get(index);
7675 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7677 return _internal_mutable_extra_subsolvers()->Mutable(index);
7679template <
typename Arg_,
typename... Args_>
7681 ::google::protobuf::internal::AssignToString(*_internal_mutable_extra_subsolvers()->Mutable(index), ::std::forward<Arg_>(value),
7685template <
typename Arg_,
typename... Args_>
7687 ::google::protobuf::internal::TSanWrite(&
_impl_);
7688 ::google::protobuf::internal::AddToRepeatedPtrField(*_internal_mutable_extra_subsolvers(),
7689 ::std::forward<Arg_>(value),
7694 const ABSL_ATTRIBUTE_LIFETIME_BOUND {
7696 return _internal_extra_subsolvers();
7698inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7701 ::google::protobuf::internal::TSanWrite(&
_impl_);
7702 return _internal_mutable_extra_subsolvers();
7704inline const ::google::protobuf::RepeatedPtrField<::std::string>&
7705SatParameters::_internal_extra_subsolvers()
const {
7706 ::google::protobuf::internal::TSanRead(&
_impl_);
7707 return _impl_.extra_subsolvers_;
7709inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7710SatParameters::_internal_mutable_extra_subsolvers() {
7711 ::google::protobuf::internal::TSanRead(&
_impl_);
7712 return &
_impl_.extra_subsolvers_;
7716inline int SatParameters::_internal_ignore_subsolvers_size()
const {
7717 return _internal_ignore_subsolvers().size();
7720 return _internal_ignore_subsolvers_size();
7723 ::google::protobuf::internal::TSanWrite(&
_impl_);
7727 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7728 ::google::protobuf::internal::TSanWrite(&
_impl_);
7729 ::std::string* _s = _internal_mutable_ignore_subsolvers()->Add();
7734 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7736 return _internal_ignore_subsolvers().Get(index);
7739 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7741 return _internal_mutable_ignore_subsolvers()->Mutable(index);
7743template <
typename Arg_,
typename... Args_>
7745 ::google::protobuf::internal::AssignToString(*_internal_mutable_ignore_subsolvers()->Mutable(index), ::std::forward<Arg_>(value),
7749template <
typename Arg_,
typename... Args_>
7751 ::google::protobuf::internal::TSanWrite(&
_impl_);
7752 ::google::protobuf::internal::AddToRepeatedPtrField(*_internal_mutable_ignore_subsolvers(),
7753 ::std::forward<Arg_>(value),
7758 const ABSL_ATTRIBUTE_LIFETIME_BOUND {
7760 return _internal_ignore_subsolvers();
7762inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7765 ::google::protobuf::internal::TSanWrite(&
_impl_);
7766 return _internal_mutable_ignore_subsolvers();
7768inline const ::google::protobuf::RepeatedPtrField<::std::string>&
7769SatParameters::_internal_ignore_subsolvers()
const {
7770 ::google::protobuf::internal::TSanRead(&
_impl_);
7771 return _impl_.ignore_subsolvers_;
7773inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7774SatParameters::_internal_mutable_ignore_subsolvers() {
7775 ::google::protobuf::internal::TSanRead(&
_impl_);
7776 return &
_impl_.ignore_subsolvers_;
7780inline int SatParameters::_internal_filter_subsolvers_size()
const {
7781 return _internal_filter_subsolvers().size();
7784 return _internal_filter_subsolvers_size();
7787 ::google::protobuf::internal::TSanWrite(&
_impl_);
7791 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7792 ::google::protobuf::internal::TSanWrite(&
_impl_);
7793 ::std::string* _s = _internal_mutable_filter_subsolvers()->Add();
7798 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7800 return _internal_filter_subsolvers().Get(index);
7803 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7805 return _internal_mutable_filter_subsolvers()->Mutable(index);
7807template <
typename Arg_,
typename... Args_>
7809 ::google::protobuf::internal::AssignToString(*_internal_mutable_filter_subsolvers()->Mutable(index), ::std::forward<Arg_>(value),
7813template <
typename Arg_,
typename... Args_>
7815 ::google::protobuf::internal::TSanWrite(&
_impl_);
7816 ::google::protobuf::internal::AddToRepeatedPtrField(*_internal_mutable_filter_subsolvers(),
7817 ::std::forward<Arg_>(value),
7822 const ABSL_ATTRIBUTE_LIFETIME_BOUND {
7824 return _internal_filter_subsolvers();
7826inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7829 ::google::protobuf::internal::TSanWrite(&
_impl_);
7830 return _internal_mutable_filter_subsolvers();
7832inline const ::google::protobuf::RepeatedPtrField<::std::string>&
7833SatParameters::_internal_filter_subsolvers()
const {
7834 ::google::protobuf::internal::TSanRead(&
_impl_);
7835 return _impl_.filter_subsolvers_;
7837inline ::google::protobuf::RepeatedPtrField<::std::string>* PROTOBUF_NONNULL
7838SatParameters::_internal_mutable_filter_subsolvers() {
7839 ::google::protobuf::internal::TSanRead(&
_impl_);
7840 return &
_impl_.filter_subsolvers_;
7844inline int SatParameters::_internal_subsolver_params_size()
const {
7845 return _internal_subsolver_params().size();
7848 return _internal_subsolver_params_size();
7851 ::google::protobuf::internal::TSanWrite(&
_impl_);
7855 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7857 return _internal_mutable_subsolver_params()->Mutable(index);
7860 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7862 ::google::protobuf::internal::TSanWrite(&
_impl_);
7863 return _internal_mutable_subsolver_params();
7866 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7868 return _internal_subsolver_params().Get(index);
7871 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7872 ::google::protobuf::internal::TSanWrite(&
_impl_);
7878 ABSL_ATTRIBUTE_LIFETIME_BOUND {
7880 return _internal_subsolver_params();
7882inline const ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>&
7883SatParameters::_internal_subsolver_params()
const {
7884 ::google::protobuf::internal::TSanRead(&
_impl_);
7885 return _impl_.subsolver_params_;
7887inline ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters>* PROTOBUF_NONNULL
7888SatParameters::_internal_mutable_subsolver_params() {
7889 ::google::protobuf::internal::TSanRead(&
_impl_);
7890 return &
_impl_.subsolver_params_;
7895 bool value = (
_impl_._has_bits_[1] & 0x00000020u) != 0;
7899 ::google::protobuf::internal::TSanWrite(&
_impl_);
7900 _impl_.interleave_search_ =
false;
7901 _impl_._has_bits_[1] &= ~0x00000020u;
7905 return _internal_interleave_search();
7908 _internal_set_interleave_search(value);
7909 _impl_._has_bits_[1] |= 0x00000020u;
7912inline bool SatParameters::_internal_interleave_search()
const {
7913 ::google::protobuf::internal::TSanRead(&
_impl_);
7914 return _impl_.interleave_search_;
7916inline void SatParameters::_internal_set_interleave_search(
bool value) {
7917 ::google::protobuf::internal::TSanWrite(&
_impl_);
7918 _impl_.interleave_search_ = value;
7923 bool value = (
_impl_._has_bits_[1] & 0x00000010u) != 0;
7927 ::google::protobuf::internal::TSanWrite(&
_impl_);
7928 _impl_.interleave_batch_size_ = 0;
7929 _impl_._has_bits_[1] &= ~0x00000010u;
7933 return _internal_interleave_batch_size();
7936 _internal_set_interleave_batch_size(value);
7937 _impl_._has_bits_[1] |= 0x00000010u;
7940inline ::int32_t SatParameters::_internal_interleave_batch_size()
const {
7941 ::google::protobuf::internal::TSanRead(&
_impl_);
7942 return _impl_.interleave_batch_size_;
7944inline void SatParameters::_internal_set_interleave_batch_size(::int32_t value) {
7945 ::google::protobuf::internal::TSanWrite(&
_impl_);
7946 _impl_.interleave_batch_size_ = value;
7951 bool value = (
_impl_._has_bits_[4] & 0x20000000u) != 0;
7955 ::google::protobuf::internal::TSanWrite(&
_impl_);
7956 _impl_.share_objective_bounds_ =
true;
7957 _impl_._has_bits_[4] &= ~0x20000000u;
7961 return _internal_share_objective_bounds();
7964 _internal_set_share_objective_bounds(value);
7965 _impl_._has_bits_[4] |= 0x20000000u;
7968inline bool SatParameters::_internal_share_objective_bounds()
const {
7969 ::google::protobuf::internal::TSanRead(&
_impl_);
7970 return _impl_.share_objective_bounds_;
7972inline void SatParameters::_internal_set_share_objective_bounds(
bool value) {
7973 ::google::protobuf::internal::TSanWrite(&
_impl_);
7974 _impl_.share_objective_bounds_ = value;
7979 bool value = (
_impl_._has_bits_[4] & 0x40000000u) != 0;
7983 ::google::protobuf::internal::TSanWrite(&
_impl_);
7984 _impl_.share_level_zero_bounds_ =
true;
7985 _impl_._has_bits_[4] &= ~0x40000000u;
7989 return _internal_share_level_zero_bounds();
7992 _internal_set_share_level_zero_bounds(value);
7993 _impl_._has_bits_[4] |= 0x40000000u;
7996inline bool SatParameters::_internal_share_level_zero_bounds()
const {
7997 ::google::protobuf::internal::TSanRead(&
_impl_);
7998 return _impl_.share_level_zero_bounds_;
8000inline void SatParameters::_internal_set_share_level_zero_bounds(
bool value) {
8001 ::google::protobuf::internal::TSanWrite(&
_impl_);
8002 _impl_.share_level_zero_bounds_ = value;
8007 bool value = (
_impl_._has_bits_[6] & 0x00020000u) != 0;
8011 ::google::protobuf::internal::TSanWrite(&
_impl_);
8012 _impl_.share_binary_clauses_ =
true;
8013 _impl_._has_bits_[6] &= ~0x00020000u;
8017 return _internal_share_binary_clauses();
8020 _internal_set_share_binary_clauses(value);
8021 _impl_._has_bits_[6] |= 0x00020000u;
8024inline bool SatParameters::_internal_share_binary_clauses()
const {
8025 ::google::protobuf::internal::TSanRead(&
_impl_);
8026 return _impl_.share_binary_clauses_;
8028inline void SatParameters::_internal_set_share_binary_clauses(
bool value) {
8029 ::google::protobuf::internal::TSanWrite(&
_impl_);
8030 _impl_.share_binary_clauses_ = value;
8035 bool value = (
_impl_._has_bits_[2] & 0x00800000u) != 0;
8039 ::google::protobuf::internal::TSanWrite(&
_impl_);
8040 _impl_.share_glue_clauses_ =
false;
8041 _impl_._has_bits_[2] &= ~0x00800000u;
8045 return _internal_share_glue_clauses();
8048 _internal_set_share_glue_clauses(value);
8049 _impl_._has_bits_[2] |= 0x00800000u;
8052inline bool SatParameters::_internal_share_glue_clauses()
const {
8053 ::google::protobuf::internal::TSanRead(&
_impl_);
8054 return _impl_.share_glue_clauses_;
8056inline void SatParameters::_internal_set_share_glue_clauses(
bool value) {
8057 ::google::protobuf::internal::TSanWrite(&
_impl_);
8058 _impl_.share_glue_clauses_ = value;
8063 bool value = (
_impl_._has_bits_[7] & 0x40000000u) != 0;
8067 ::google::protobuf::internal::TSanWrite(&
_impl_);
8068 _impl_.minimize_shared_clauses_ =
true;
8069 _impl_._has_bits_[7] &= ~0x40000000u;
8073 return _internal_minimize_shared_clauses();
8076 _internal_set_minimize_shared_clauses(value);
8077 _impl_._has_bits_[7] |= 0x40000000u;
8080inline bool SatParameters::_internal_minimize_shared_clauses()
const {
8081 ::google::protobuf::internal::TSanRead(&
_impl_);
8082 return _impl_.minimize_shared_clauses_;
8084inline void SatParameters::_internal_set_minimize_shared_clauses(
bool value) {
8085 ::google::protobuf::internal::TSanWrite(&
_impl_);
8086 _impl_.minimize_shared_clauses_ = value;
8091 bool value = (
_impl_._has_bits_[8] & 0x00001000u) != 0;
8095 ::google::protobuf::internal::TSanWrite(&
_impl_);
8096 _impl_.share_glue_clauses_dtime_ = 1;
8097 _impl_._has_bits_[8] &= ~0x00001000u;
8101 return _internal_share_glue_clauses_dtime();
8104 _internal_set_share_glue_clauses_dtime(value);
8105 _impl_._has_bits_[8] |= 0x00001000u;
8108inline double SatParameters::_internal_share_glue_clauses_dtime()
const {
8109 ::google::protobuf::internal::TSanRead(&
_impl_);
8110 return _impl_.share_glue_clauses_dtime_;
8112inline void SatParameters::_internal_set_share_glue_clauses_dtime(
double value) {
8113 ::google::protobuf::internal::TSanWrite(&
_impl_);
8114 _impl_.share_glue_clauses_dtime_ = value;
8119 bool value = (
_impl_._has_bits_[1] & 0x00000800u) != 0;
8123 ::google::protobuf::internal::TSanWrite(&
_impl_);
8124 _impl_.debug_postsolve_with_full_solver_ =
false;
8125 _impl_._has_bits_[1] &= ~0x00000800u;
8129 return _internal_debug_postsolve_with_full_solver();
8132 _internal_set_debug_postsolve_with_full_solver(value);
8133 _impl_._has_bits_[1] |= 0x00000800u;
8136inline bool SatParameters::_internal_debug_postsolve_with_full_solver()
const {
8137 ::google::protobuf::internal::TSanRead(&
_impl_);
8138 return _impl_.debug_postsolve_with_full_solver_;
8140inline void SatParameters::_internal_set_debug_postsolve_with_full_solver(
bool value) {
8141 ::google::protobuf::internal::TSanWrite(&
_impl_);
8142 _impl_.debug_postsolve_with_full_solver_ = value;
8147 bool value = (
_impl_._has_bits_[1] & 0x00000200u) != 0;
8151 ::google::protobuf::internal::TSanWrite(&
_impl_);
8152 _impl_.debug_max_num_presolve_operations_ = 0;
8153 _impl_._has_bits_[1] &= ~0x00000200u;
8157 return _internal_debug_max_num_presolve_operations();
8160 _internal_set_debug_max_num_presolve_operations(value);
8161 _impl_._has_bits_[1] |= 0x00000200u;
8164inline ::int32_t SatParameters::_internal_debug_max_num_presolve_operations()
const {
8165 ::google::protobuf::internal::TSanRead(&
_impl_);
8166 return _impl_.debug_max_num_presolve_operations_;
8168inline void SatParameters::_internal_set_debug_max_num_presolve_operations(::int32_t value) {
8169 ::google::protobuf::internal::TSanWrite(&
_impl_);
8170 _impl_.debug_max_num_presolve_operations_ = value;
8175 bool value = (
_impl_._has_bits_[1] & 0x08000000u) != 0;
8179 ::google::protobuf::internal::TSanWrite(&
_impl_);
8180 _impl_.debug_crash_on_bad_hint_ =
false;
8181 _impl_._has_bits_[1] &= ~0x08000000u;
8185 return _internal_debug_crash_on_bad_hint();
8188 _internal_set_debug_crash_on_bad_hint(value);
8189 _impl_._has_bits_[1] |= 0x08000000u;
8192inline bool SatParameters::_internal_debug_crash_on_bad_hint()
const {
8193 ::google::protobuf::internal::TSanRead(&
_impl_);
8194 return _impl_.debug_crash_on_bad_hint_;
8196inline void SatParameters::_internal_set_debug_crash_on_bad_hint(
bool value) {
8197 ::google::protobuf::internal::TSanWrite(&
_impl_);
8198 _impl_.debug_crash_on_bad_hint_ = value;
8203 bool value = (
_impl_._has_bits_[3] & 0x00000002u) != 0;
8207 ::google::protobuf::internal::TSanWrite(&
_impl_);
8208 _impl_.debug_crash_if_presolve_breaks_hint_ =
false;
8209 _impl_._has_bits_[3] &= ~0x00000002u;
8213 return _internal_debug_crash_if_presolve_breaks_hint();
8216 _internal_set_debug_crash_if_presolve_breaks_hint(value);
8217 _impl_._has_bits_[3] |= 0x00000002u;
8220inline bool SatParameters::_internal_debug_crash_if_presolve_breaks_hint()
const {
8221 ::google::protobuf::internal::TSanRead(&
_impl_);
8222 return _impl_.debug_crash_if_presolve_breaks_hint_;
8224inline void SatParameters::_internal_set_debug_crash_if_presolve_breaks_hint(
bool value) {
8225 ::google::protobuf::internal::TSanWrite(&
_impl_);
8226 _impl_.debug_crash_if_presolve_breaks_hint_ = value;
8231 bool value = (
_impl_._has_bits_[3] & 0x02000000u) != 0;
8235 ::google::protobuf::internal::TSanWrite(&
_impl_);
8236 _impl_.use_optimization_hints_ =
true;
8237 _impl_._has_bits_[3] &= ~0x02000000u;
8241 return _internal_use_optimization_hints();
8244 _internal_set_use_optimization_hints(value);
8245 _impl_._has_bits_[3] |= 0x02000000u;
8248inline bool SatParameters::_internal_use_optimization_hints()
const {
8249 ::google::protobuf::internal::TSanRead(&
_impl_);
8250 return _impl_.use_optimization_hints_;
8252inline void SatParameters::_internal_set_use_optimization_hints(
bool value) {
8253 ::google::protobuf::internal::TSanWrite(&
_impl_);
8254 _impl_.use_optimization_hints_ = value;
8259 bool value = (
_impl_._has_bits_[3] & 0x20000000u) != 0;
8263 ::google::protobuf::internal::TSanWrite(&
_impl_);
8264 _impl_.core_minimization_level_ = 2;
8265 _impl_._has_bits_[3] &= ~0x20000000u;
8269 return _internal_core_minimization_level();
8272 _internal_set_core_minimization_level(value);
8273 _impl_._has_bits_[3] |= 0x20000000u;
8276inline ::int32_t SatParameters::_internal_core_minimization_level()
const {
8277 ::google::protobuf::internal::TSanRead(&
_impl_);
8278 return _impl_.core_minimization_level_;
8280inline void SatParameters::_internal_set_core_minimization_level(::int32_t value) {
8281 ::google::protobuf::internal::TSanWrite(&
_impl_);
8282 _impl_.core_minimization_level_ = value;
8287 bool value = (
_impl_._has_bits_[4] & 0x00004000u) != 0;
8291 ::google::protobuf::internal::TSanWrite(&
_impl_);
8292 _impl_.find_multiple_cores_ =
true;
8293 _impl_._has_bits_[4] &= ~0x00004000u;
8297 return _internal_find_multiple_cores();
8300 _internal_set_find_multiple_cores(value);
8301 _impl_._has_bits_[4] |= 0x00004000u;
8304inline bool SatParameters::_internal_find_multiple_cores()
const {
8305 ::google::protobuf::internal::TSanRead(&
_impl_);
8306 return _impl_.find_multiple_cores_;
8308inline void SatParameters::_internal_set_find_multiple_cores(
bool value) {
8309 ::google::protobuf::internal::TSanWrite(&
_impl_);
8310 _impl_.find_multiple_cores_ = value;
8315 bool value = (
_impl_._has_bits_[4] & 0x00020000u) != 0;
8319 ::google::protobuf::internal::TSanWrite(&
_impl_);
8320 _impl_.cover_optimization_ =
true;
8321 _impl_._has_bits_[4] &= ~0x00020000u;
8325 return _internal_cover_optimization();
8328 _internal_set_cover_optimization(value);
8329 _impl_._has_bits_[4] |= 0x00020000u;
8332inline bool SatParameters::_internal_cover_optimization()
const {
8333 ::google::protobuf::internal::TSanRead(&
_impl_);
8334 return _impl_.cover_optimization_;
8336inline void SatParameters::_internal_set_cover_optimization(
bool value) {
8337 ::google::protobuf::internal::TSanWrite(&
_impl_);
8338 _impl_.cover_optimization_ = value;
8343 bool value = (
_impl_._has_bits_[0] & 0x00000800u) != 0;
8347 ::google::protobuf::internal::TSanWrite(&
_impl_);
8348 _impl_.max_sat_assumption_order_ = 0;
8349 _impl_._has_bits_[0] &= ~0x00000800u;
8353 return _internal_max_sat_assumption_order();
8356 _internal_set_max_sat_assumption_order(value);
8357 _impl_._has_bits_[0] |= 0x00000800u;
8360inline ::operations_research::sat::SatParameters_MaxSatAssumptionOrder SatParameters::_internal_max_sat_assumption_order()
const {
8361 ::google::protobuf::internal::TSanRead(&
_impl_);
8365 ::google::protobuf::internal::TSanWrite(&
_impl_);
8367 assert(::google::protobuf::internal::ValidateEnum(
8369 _impl_.max_sat_assumption_order_ = value;
8374 bool value = (
_impl_._has_bits_[0] & 0x00000400u) != 0;
8378 ::google::protobuf::internal::TSanWrite(&
_impl_);
8379 _impl_.max_sat_reverse_assumption_order_ =
false;
8380 _impl_._has_bits_[0] &= ~0x00000400u;
8384 return _internal_max_sat_reverse_assumption_order();
8387 _internal_set_max_sat_reverse_assumption_order(value);
8388 _impl_._has_bits_[0] |= 0x00000400u;
8391inline bool SatParameters::_internal_max_sat_reverse_assumption_order()
const {
8392 ::google::protobuf::internal::TSanRead(&
_impl_);
8393 return _impl_.max_sat_reverse_assumption_order_;
8395inline void SatParameters::_internal_set_max_sat_reverse_assumption_order(
bool value) {
8396 ::google::protobuf::internal::TSanWrite(&
_impl_);
8397 _impl_.max_sat_reverse_assumption_order_ = value;
8402 bool value = (
_impl_._has_bits_[3] & 0x80000000u) != 0;
8406 ::google::protobuf::internal::TSanWrite(&
_impl_);
8407 _impl_.max_sat_stratification_ = 1;
8408 _impl_._has_bits_[3] &= ~0x80000000u;
8412 return _internal_max_sat_stratification();
8415 _internal_set_max_sat_stratification(value);
8416 _impl_._has_bits_[3] |= 0x80000000u;
8419inline ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm SatParameters::_internal_max_sat_stratification()
const {
8420 ::google::protobuf::internal::TSanRead(&
_impl_);
8424 ::google::protobuf::internal::TSanWrite(&
_impl_);
8426 assert(::google::protobuf::internal::ValidateEnum(
8428 _impl_.max_sat_stratification_ = value;
8433 bool value = (
_impl_._has_bits_[6] & 0x00200000u) != 0;
8437 ::google::protobuf::internal::TSanWrite(&
_impl_);
8438 _impl_.propagation_loop_detection_factor_ = 10;
8439 _impl_._has_bits_[6] &= ~0x00200000u;
8443 return _internal_propagation_loop_detection_factor();
8446 _internal_set_propagation_loop_detection_factor(value);
8447 _impl_._has_bits_[6] |= 0x00200000u;
8450inline double SatParameters::_internal_propagation_loop_detection_factor()
const {
8451 ::google::protobuf::internal::TSanRead(&
_impl_);
8452 return _impl_.propagation_loop_detection_factor_;
8454inline void SatParameters::_internal_set_propagation_loop_detection_factor(
double value) {
8455 ::google::protobuf::internal::TSanWrite(&
_impl_);
8456 _impl_.propagation_loop_detection_factor_ = value;
8461 bool value = (
_impl_._has_bits_[4] & 0x00001000u) != 0;
8465 ::google::protobuf::internal::TSanWrite(&
_impl_);
8466 _impl_.use_precedences_in_disjunctive_constraint_ =
true;
8467 _impl_._has_bits_[4] &= ~0x00001000u;
8471 return _internal_use_precedences_in_disjunctive_constraint();
8474 _internal_set_use_precedences_in_disjunctive_constraint(value);
8475 _impl_._has_bits_[4] |= 0x00001000u;
8478inline bool SatParameters::_internal_use_precedences_in_disjunctive_constraint()
const {
8479 ::google::protobuf::internal::TSanRead(&
_impl_);
8480 return _impl_.use_precedences_in_disjunctive_constraint_;
8482inline void SatParameters::_internal_set_use_precedences_in_disjunctive_constraint(
bool value) {
8483 ::google::protobuf::internal::TSanWrite(&
_impl_);
8484 _impl_.use_precedences_in_disjunctive_constraint_ = value;
8489 bool value = (
_impl_._has_bits_[6] & 0x01000000u) != 0;
8493 ::google::protobuf::internal::TSanWrite(&
_impl_);
8494 _impl_.max_size_to_create_precedence_literals_in_disjunctive_ = 60;
8495 _impl_._has_bits_[6] &= ~0x01000000u;
8499 return _internal_max_size_to_create_precedence_literals_in_disjunctive();
8502 _internal_set_max_size_to_create_precedence_literals_in_disjunctive(value);
8503 _impl_._has_bits_[6] |= 0x01000000u;
8506inline ::int32_t SatParameters::_internal_max_size_to_create_precedence_literals_in_disjunctive()
const {
8507 ::google::protobuf::internal::TSanRead(&
_impl_);
8508 return _impl_.max_size_to_create_precedence_literals_in_disjunctive_;
8510inline void SatParameters::_internal_set_max_size_to_create_precedence_literals_in_disjunctive(::int32_t value) {
8511 ::google::protobuf::internal::TSanWrite(&
_impl_);
8512 _impl_.max_size_to_create_precedence_literals_in_disjunctive_ = value;
8517 bool value = (
_impl_._has_bits_[2] & 0x00000080u) != 0;
8521 ::google::protobuf::internal::TSanWrite(&
_impl_);
8522 _impl_.use_strong_propagation_in_disjunctive_ =
false;
8523 _impl_._has_bits_[2] &= ~0x00000080u;
8527 return _internal_use_strong_propagation_in_disjunctive();
8530 _internal_set_use_strong_propagation_in_disjunctive(value);
8531 _impl_._has_bits_[2] |= 0x00000080u;
8534inline bool SatParameters::_internal_use_strong_propagation_in_disjunctive()
const {
8535 ::google::protobuf::internal::TSanRead(&
_impl_);
8536 return _impl_.use_strong_propagation_in_disjunctive_;
8538inline void SatParameters::_internal_set_use_strong_propagation_in_disjunctive(
bool value) {
8539 ::google::protobuf::internal::TSanWrite(&
_impl_);
8540 _impl_.use_strong_propagation_in_disjunctive_ = value;
8545 bool value = (
_impl_._has_bits_[2] & 0x00010000u) != 0;
8549 ::google::protobuf::internal::TSanWrite(&
_impl_);
8550 _impl_.use_dynamic_precedence_in_disjunctive_ =
false;
8551 _impl_._has_bits_[2] &= ~0x00010000u;
8555 return _internal_use_dynamic_precedence_in_disjunctive();
8558 _internal_set_use_dynamic_precedence_in_disjunctive(value);
8559 _impl_._has_bits_[2] |= 0x00010000u;
8562inline bool SatParameters::_internal_use_dynamic_precedence_in_disjunctive()
const {
8563 ::google::protobuf::internal::TSanRead(&
_impl_);
8564 return _impl_.use_dynamic_precedence_in_disjunctive_;
8566inline void SatParameters::_internal_set_use_dynamic_precedence_in_disjunctive(
bool value) {
8567 ::google::protobuf::internal::TSanWrite(&
_impl_);
8568 _impl_.use_dynamic_precedence_in_disjunctive_ = value;
8573 bool value = (
_impl_._has_bits_[2] & 0x00020000u) != 0;
8577 ::google::protobuf::internal::TSanWrite(&
_impl_);
8578 _impl_.use_dynamic_precedence_in_cumulative_ =
false;
8579 _impl_._has_bits_[2] &= ~0x00020000u;
8583 return _internal_use_dynamic_precedence_in_cumulative();
8586 _internal_set_use_dynamic_precedence_in_cumulative(value);
8587 _impl_._has_bits_[2] |= 0x00020000u;
8590inline bool SatParameters::_internal_use_dynamic_precedence_in_cumulative()
const {
8591 ::google::protobuf::internal::TSanRead(&
_impl_);
8592 return _impl_.use_dynamic_precedence_in_cumulative_;
8594inline void SatParameters::_internal_set_use_dynamic_precedence_in_cumulative(
bool value) {
8595 ::google::protobuf::internal::TSanWrite(&
_impl_);
8596 _impl_.use_dynamic_precedence_in_cumulative_ = value;
8601 bool value = (
_impl_._has_bits_[0] & 0x00080000u) != 0;
8605 ::google::protobuf::internal::TSanWrite(&
_impl_);
8606 _impl_.use_overload_checker_in_cumulative_ =
false;
8607 _impl_._has_bits_[0] &= ~0x00080000u;
8611 return _internal_use_overload_checker_in_cumulative();
8614 _internal_set_use_overload_checker_in_cumulative(value);
8615 _impl_._has_bits_[0] |= 0x00080000u;
8618inline bool SatParameters::_internal_use_overload_checker_in_cumulative()
const {
8619 ::google::protobuf::internal::TSanRead(&
_impl_);
8620 return _impl_.use_overload_checker_in_cumulative_;
8622inline void SatParameters::_internal_set_use_overload_checker_in_cumulative(
bool value) {
8623 ::google::protobuf::internal::TSanWrite(&
_impl_);
8624 _impl_.use_overload_checker_in_cumulative_ = value;
8629 bool value = (
_impl_._has_bits_[2] & 0x01000000u) != 0;
8633 ::google::protobuf::internal::TSanWrite(&
_impl_);
8634 _impl_.use_conservative_scale_overload_checker_ =
false;
8635 _impl_._has_bits_[2] &= ~0x01000000u;
8639 return _internal_use_conservative_scale_overload_checker();
8642 _internal_set_use_conservative_scale_overload_checker(value);
8643 _impl_._has_bits_[2] |= 0x01000000u;
8646inline bool SatParameters::_internal_use_conservative_scale_overload_checker()
const {
8647 ::google::protobuf::internal::TSanRead(&
_impl_);
8648 return _impl_.use_conservative_scale_overload_checker_;
8650inline void SatParameters::_internal_set_use_conservative_scale_overload_checker(
bool value) {
8651 ::google::protobuf::internal::TSanWrite(&
_impl_);
8652 _impl_.use_conservative_scale_overload_checker_ = value;
8657 bool value = (
_impl_._has_bits_[0] & 0x00400000u) != 0;
8661 ::google::protobuf::internal::TSanWrite(&
_impl_);
8662 _impl_.use_timetable_edge_finding_in_cumulative_ =
false;
8663 _impl_._has_bits_[0] &= ~0x00400000u;
8667 return _internal_use_timetable_edge_finding_in_cumulative();
8670 _internal_set_use_timetable_edge_finding_in_cumulative(value);
8671 _impl_._has_bits_[0] |= 0x00400000u;
8674inline bool SatParameters::_internal_use_timetable_edge_finding_in_cumulative()
const {
8675 ::google::protobuf::internal::TSanRead(&
_impl_);
8676 return _impl_.use_timetable_edge_finding_in_cumulative_;
8678inline void SatParameters::_internal_set_use_timetable_edge_finding_in_cumulative(
bool value) {
8679 ::google::protobuf::internal::TSanWrite(&
_impl_);
8680 _impl_.use_timetable_edge_finding_in_cumulative_ = value;
8685 bool value = (
_impl_._has_bits_[7] & 0x00000080u) != 0;
8689 ::google::protobuf::internal::TSanWrite(&
_impl_);
8690 _impl_.max_num_intervals_for_timetable_edge_finding_ = 100;
8691 _impl_._has_bits_[7] &= ~0x00000080u;
8695 return _internal_max_num_intervals_for_timetable_edge_finding();
8698 _internal_set_max_num_intervals_for_timetable_edge_finding(value);
8699 _impl_._has_bits_[7] |= 0x00000080u;
8702inline ::int32_t SatParameters::_internal_max_num_intervals_for_timetable_edge_finding()
const {
8703 ::google::protobuf::internal::TSanRead(&
_impl_);
8704 return _impl_.max_num_intervals_for_timetable_edge_finding_;
8706inline void SatParameters::_internal_set_max_num_intervals_for_timetable_edge_finding(::int32_t value) {
8707 ::google::protobuf::internal::TSanWrite(&
_impl_);
8708 _impl_.max_num_intervals_for_timetable_edge_finding_ = value;
8713 bool value = (
_impl_._has_bits_[2] & 0x00000001u) != 0;
8717 ::google::protobuf::internal::TSanWrite(&
_impl_);
8718 _impl_.use_hard_precedences_in_cumulative_ =
false;
8719 _impl_._has_bits_[2] &= ~0x00000001u;
8723 return _internal_use_hard_precedences_in_cumulative();
8726 _internal_set_use_hard_precedences_in_cumulative(value);
8727 _impl_._has_bits_[2] |= 0x00000001u;
8730inline bool SatParameters::_internal_use_hard_precedences_in_cumulative()
const {
8731 ::google::protobuf::internal::TSanRead(&
_impl_);
8732 return _impl_.use_hard_precedences_in_cumulative_;
8734inline void SatParameters::_internal_set_use_hard_precedences_in_cumulative(
bool value) {
8735 ::google::protobuf::internal::TSanWrite(&
_impl_);
8736 _impl_.use_hard_precedences_in_cumulative_ = value;
8741 bool value = (
_impl_._has_bits_[2] & 0x00000004u) != 0;
8745 ::google::protobuf::internal::TSanWrite(&
_impl_);
8746 _impl_.exploit_all_precedences_ =
false;
8747 _impl_._has_bits_[2] &= ~0x00000004u;
8751 return _internal_exploit_all_precedences();
8754 _internal_set_exploit_all_precedences(value);
8755 _impl_._has_bits_[2] |= 0x00000004u;
8758inline bool SatParameters::_internal_exploit_all_precedences()
const {
8759 ::google::protobuf::internal::TSanRead(&
_impl_);
8760 return _impl_.exploit_all_precedences_;
8762inline void SatParameters::_internal_set_exploit_all_precedences(
bool value) {
8763 ::google::protobuf::internal::TSanWrite(&
_impl_);
8764 _impl_.exploit_all_precedences_ = value;
8769 bool value = (
_impl_._has_bits_[4] & 0x00002000u) != 0;
8773 ::google::protobuf::internal::TSanWrite(&
_impl_);
8774 _impl_.use_disjunctive_constraint_in_cumulative_ =
true;
8775 _impl_._has_bits_[4] &= ~0x00002000u;
8779 return _internal_use_disjunctive_constraint_in_cumulative();
8782 _internal_set_use_disjunctive_constraint_in_cumulative(value);
8783 _impl_._has_bits_[4] |= 0x00002000u;
8786inline bool SatParameters::_internal_use_disjunctive_constraint_in_cumulative()
const {
8787 ::google::protobuf::internal::TSanRead(&
_impl_);
8788 return _impl_.use_disjunctive_constraint_in_cumulative_;
8790inline void SatParameters::_internal_set_use_disjunctive_constraint_in_cumulative(
bool value) {
8791 ::google::protobuf::internal::TSanWrite(&
_impl_);
8792 _impl_.use_disjunctive_constraint_in_cumulative_ = value;
8797 bool value = (
_impl_._has_bits_[8] & 0x00000800u) != 0;
8801 ::google::protobuf::internal::TSanWrite(&
_impl_);
8802 _impl_.no_overlap_2d_boolean_relations_limit_ = 10;
8803 _impl_._has_bits_[8] &= ~0x00000800u;
8807 return _internal_no_overlap_2d_boolean_relations_limit();
8810 _internal_set_no_overlap_2d_boolean_relations_limit(value);
8811 _impl_._has_bits_[8] |= 0x00000800u;
8814inline ::int32_t SatParameters::_internal_no_overlap_2d_boolean_relations_limit()
const {
8815 ::google::protobuf::internal::TSanRead(&
_impl_);
8816 return _impl_.no_overlap_2d_boolean_relations_limit_;
8818inline void SatParameters::_internal_set_no_overlap_2d_boolean_relations_limit(::int32_t value) {
8819 ::google::protobuf::internal::TSanWrite(&
_impl_);
8820 _impl_.no_overlap_2d_boolean_relations_limit_ = value;
8825 bool value = (
_impl_._has_bits_[1] & 0x20000000u) != 0;
8829 ::google::protobuf::internal::TSanWrite(&
_impl_);
8830 _impl_.use_timetabling_in_no_overlap_2d_ =
false;
8831 _impl_._has_bits_[1] &= ~0x20000000u;
8835 return _internal_use_timetabling_in_no_overlap_2d();
8838 _internal_set_use_timetabling_in_no_overlap_2d(value);
8839 _impl_._has_bits_[1] |= 0x20000000u;
8842inline bool SatParameters::_internal_use_timetabling_in_no_overlap_2d()
const {
8843 ::google::protobuf::internal::TSanRead(&
_impl_);
8844 return _impl_.use_timetabling_in_no_overlap_2d_;
8846inline void SatParameters::_internal_set_use_timetabling_in_no_overlap_2d(
bool value) {
8847 ::google::protobuf::internal::TSanWrite(&
_impl_);
8848 _impl_.use_timetabling_in_no_overlap_2d_ = value;
8853 bool value = (
_impl_._has_bits_[1] & 0x40000000u) != 0;
8857 ::google::protobuf::internal::TSanWrite(&
_impl_);
8858 _impl_.use_energetic_reasoning_in_no_overlap_2d_ =
false;
8859 _impl_._has_bits_[1] &= ~0x40000000u;
8863 return _internal_use_energetic_reasoning_in_no_overlap_2d();
8866 _internal_set_use_energetic_reasoning_in_no_overlap_2d(value);
8867 _impl_._has_bits_[1] |= 0x40000000u;
8870inline bool SatParameters::_internal_use_energetic_reasoning_in_no_overlap_2d()
const {
8871 ::google::protobuf::internal::TSanRead(&
_impl_);
8872 return _impl_.use_energetic_reasoning_in_no_overlap_2d_;
8874inline void SatParameters::_internal_set_use_energetic_reasoning_in_no_overlap_2d(
bool value) {
8875 ::google::protobuf::internal::TSanWrite(&
_impl_);
8876 _impl_.use_energetic_reasoning_in_no_overlap_2d_ = value;
8881 bool value = (
_impl_._has_bits_[2] & 0x00040000u) != 0;
8885 ::google::protobuf::internal::TSanWrite(&
_impl_);
8886 _impl_.use_area_energetic_reasoning_in_no_overlap_2d_ =
false;
8887 _impl_._has_bits_[2] &= ~0x00040000u;
8891 return _internal_use_area_energetic_reasoning_in_no_overlap_2d();
8894 _internal_set_use_area_energetic_reasoning_in_no_overlap_2d(value);
8895 _impl_._has_bits_[2] |= 0x00040000u;
8898inline bool SatParameters::_internal_use_area_energetic_reasoning_in_no_overlap_2d()
const {
8899 ::google::protobuf::internal::TSanRead(&
_impl_);
8900 return _impl_.use_area_energetic_reasoning_in_no_overlap_2d_;
8902inline void SatParameters::_internal_set_use_area_energetic_reasoning_in_no_overlap_2d(
bool value) {
8903 ::google::protobuf::internal::TSanWrite(&
_impl_);
8904 _impl_.use_area_energetic_reasoning_in_no_overlap_2d_ = value;
8909 bool value = (
_impl_._has_bits_[2] & 0x40000000u) != 0;
8913 ::google::protobuf::internal::TSanWrite(&
_impl_);
8914 _impl_.use_try_edge_reasoning_in_no_overlap_2d_ =
false;
8915 _impl_._has_bits_[2] &= ~0x40000000u;
8919 return _internal_use_try_edge_reasoning_in_no_overlap_2d();
8922 _internal_set_use_try_edge_reasoning_in_no_overlap_2d(value);
8923 _impl_._has_bits_[2] |= 0x40000000u;
8926inline bool SatParameters::_internal_use_try_edge_reasoning_in_no_overlap_2d()
const {
8927 ::google::protobuf::internal::TSanRead(&
_impl_);
8928 return _impl_.use_try_edge_reasoning_in_no_overlap_2d_;
8930inline void SatParameters::_internal_set_use_try_edge_reasoning_in_no_overlap_2d(
bool value) {
8931 ::google::protobuf::internal::TSanWrite(&
_impl_);
8932 _impl_.use_try_edge_reasoning_in_no_overlap_2d_ = value;
8937 bool value = (
_impl_._has_bits_[7] & 0x00200000u) != 0;
8941 ::google::protobuf::internal::TSanWrite(&
_impl_);
8942 _impl_.max_pairs_pairwise_reasoning_in_no_overlap_2d_ = 1250;
8943 _impl_._has_bits_[7] &= ~0x00200000u;
8947 return _internal_max_pairs_pairwise_reasoning_in_no_overlap_2d();
8950 _internal_set_max_pairs_pairwise_reasoning_in_no_overlap_2d(value);
8951 _impl_._has_bits_[7] |= 0x00200000u;
8954inline ::int32_t SatParameters::_internal_max_pairs_pairwise_reasoning_in_no_overlap_2d()
const {
8955 ::google::protobuf::internal::TSanRead(&
_impl_);
8956 return _impl_.max_pairs_pairwise_reasoning_in_no_overlap_2d_;
8958inline void SatParameters::_internal_set_max_pairs_pairwise_reasoning_in_no_overlap_2d(::int32_t value) {
8959 ::google::protobuf::internal::TSanWrite(&
_impl_);
8960 _impl_.max_pairs_pairwise_reasoning_in_no_overlap_2d_ = value;
8965 bool value = (
_impl_._has_bits_[3] & 0x00000080u) != 0;
8969 ::google::protobuf::internal::TSanWrite(&
_impl_);
8970 _impl_.maximum_regions_to_split_in_disconnected_no_overlap_2d_ = 0;
8971 _impl_._has_bits_[3] &= ~0x00000080u;
8975 return _internal_maximum_regions_to_split_in_disconnected_no_overlap_2d();
8978 _internal_set_maximum_regions_to_split_in_disconnected_no_overlap_2d(value);
8979 _impl_._has_bits_[3] |= 0x00000080u;
8982inline ::int32_t SatParameters::_internal_maximum_regions_to_split_in_disconnected_no_overlap_2d()
const {
8983 ::google::protobuf::internal::TSanRead(&
_impl_);
8984 return _impl_.maximum_regions_to_split_in_disconnected_no_overlap_2d_;
8986inline void SatParameters::_internal_set_maximum_regions_to_split_in_disconnected_no_overlap_2d(::int32_t value) {
8987 ::google::protobuf::internal::TSanWrite(&
_impl_);
8988 _impl_.maximum_regions_to_split_in_disconnected_no_overlap_2d_ = value;
8993 bool value = (
_impl_._has_bits_[8] & 0x00000080u) != 0;
8997 ::google::protobuf::internal::TSanWrite(&
_impl_);
8998 _impl_.use_linear3_for_no_overlap_2d_precedences_ =
true;
8999 _impl_._has_bits_[8] &= ~0x00000080u;
9003 return _internal_use_linear3_for_no_overlap_2d_precedences();
9006 _internal_set_use_linear3_for_no_overlap_2d_precedences(value);
9007 _impl_._has_bits_[8] |= 0x00000080u;
9010inline bool SatParameters::_internal_use_linear3_for_no_overlap_2d_precedences()
const {
9011 ::google::protobuf::internal::TSanRead(&
_impl_);
9012 return _impl_.use_linear3_for_no_overlap_2d_precedences_;
9014inline void SatParameters::_internal_set_use_linear3_for_no_overlap_2d_precedences(
bool value) {
9015 ::google::protobuf::internal::TSanWrite(&
_impl_);
9016 _impl_.use_linear3_for_no_overlap_2d_precedences_ = value;
9021 bool value = (
_impl_._has_bits_[6] & 0x00040000u) != 0;
9025 ::google::protobuf::internal::TSanWrite(&
_impl_);
9026 _impl_.use_dual_scheduling_heuristics_ =
true;
9027 _impl_._has_bits_[6] &= ~0x00040000u;
9031 return _internal_use_dual_scheduling_heuristics();
9034 _internal_set_use_dual_scheduling_heuristics(value);
9035 _impl_._has_bits_[6] |= 0x00040000u;
9038inline bool SatParameters::_internal_use_dual_scheduling_heuristics()
const {
9039 ::google::protobuf::internal::TSanRead(&
_impl_);
9040 return _impl_.use_dual_scheduling_heuristics_;
9042inline void SatParameters::_internal_set_use_dual_scheduling_heuristics(
bool value) {
9043 ::google::protobuf::internal::TSanWrite(&
_impl_);
9044 _impl_.use_dual_scheduling_heuristics_ = value;
9049 bool value = (
_impl_._has_bits_[3] & 0x00000020u) != 0;
9053 ::google::protobuf::internal::TSanWrite(&
_impl_);
9054 _impl_.use_all_different_for_circuit_ =
false;
9055 _impl_._has_bits_[3] &= ~0x00000020u;
9059 return _internal_use_all_different_for_circuit();
9062 _internal_set_use_all_different_for_circuit(value);
9063 _impl_._has_bits_[3] |= 0x00000020u;
9066inline bool SatParameters::_internal_use_all_different_for_circuit()
const {
9067 ::google::protobuf::internal::TSanRead(&
_impl_);
9068 return _impl_.use_all_different_for_circuit_;
9070inline void SatParameters::_internal_set_use_all_different_for_circuit(
bool value) {
9071 ::google::protobuf::internal::TSanWrite(&
_impl_);
9072 _impl_.use_all_different_for_circuit_ = value;
9077 bool value = (
_impl_._has_bits_[3] & 0x00000004u) != 0;
9081 ::google::protobuf::internal::TSanWrite(&
_impl_);
9082 _impl_.routing_cut_subset_size_for_binary_relation_bound_ = 0;
9083 _impl_._has_bits_[3] &= ~0x00000004u;
9087 return _internal_routing_cut_subset_size_for_binary_relation_bound();
9090 _internal_set_routing_cut_subset_size_for_binary_relation_bound(value);
9091 _impl_._has_bits_[3] |= 0x00000004u;
9094inline ::int32_t SatParameters::_internal_routing_cut_subset_size_for_binary_relation_bound()
const {
9095 ::google::protobuf::internal::TSanRead(&
_impl_);
9096 return _impl_.routing_cut_subset_size_for_binary_relation_bound_;
9098inline void SatParameters::_internal_set_routing_cut_subset_size_for_binary_relation_bound(::int32_t value) {
9099 ::google::protobuf::internal::TSanWrite(&
_impl_);
9100 _impl_.routing_cut_subset_size_for_binary_relation_bound_ = value;
9105 bool value = (
_impl_._has_bits_[3] & 0x00000008u) != 0;
9109 ::google::protobuf::internal::TSanWrite(&
_impl_);
9110 _impl_.routing_cut_subset_size_for_tight_binary_relation_bound_ = 0;
9111 _impl_._has_bits_[3] &= ~0x00000008u;
9115 return _internal_routing_cut_subset_size_for_tight_binary_relation_bound();
9118 _internal_set_routing_cut_subset_size_for_tight_binary_relation_bound(value);
9119 _impl_._has_bits_[3] |= 0x00000008u;
9122inline ::int32_t SatParameters::_internal_routing_cut_subset_size_for_tight_binary_relation_bound()
const {
9123 ::google::protobuf::internal::TSanRead(&
_impl_);
9124 return _impl_.routing_cut_subset_size_for_tight_binary_relation_bound_;
9126inline void SatParameters::_internal_set_routing_cut_subset_size_for_tight_binary_relation_bound(::int32_t value) {
9127 ::google::protobuf::internal::TSanWrite(&
_impl_);
9128 _impl_.routing_cut_subset_size_for_tight_binary_relation_bound_ = value;
9133 bool value = (
_impl_._has_bits_[8] & 0x00000020u) != 0;
9137 ::google::protobuf::internal::TSanWrite(&
_impl_);
9138 _impl_.routing_cut_subset_size_for_exact_binary_relation_bound_ = 8;
9139 _impl_._has_bits_[8] &= ~0x00000020u;
9143 return _internal_routing_cut_subset_size_for_exact_binary_relation_bound();
9146 _internal_set_routing_cut_subset_size_for_exact_binary_relation_bound(value);
9147 _impl_._has_bits_[8] |= 0x00000020u;
9150inline ::int32_t SatParameters::_internal_routing_cut_subset_size_for_exact_binary_relation_bound()
const {
9151 ::google::protobuf::internal::TSanRead(&
_impl_);
9152 return _impl_.routing_cut_subset_size_for_exact_binary_relation_bound_;
9154inline void SatParameters::_internal_set_routing_cut_subset_size_for_exact_binary_relation_bound(::int32_t value) {
9155 ::google::protobuf::internal::TSanWrite(&
_impl_);
9156 _impl_.routing_cut_subset_size_for_exact_binary_relation_bound_ = value;
9161 bool value = (
_impl_._has_bits_[8] & 0x00000200u) != 0;
9165 ::google::protobuf::internal::TSanWrite(&
_impl_);
9166 _impl_.routing_cut_subset_size_for_shortest_paths_bound_ = 8;
9167 _impl_._has_bits_[8] &= ~0x00000200u;
9171 return _internal_routing_cut_subset_size_for_shortest_paths_bound();
9174 _internal_set_routing_cut_subset_size_for_shortest_paths_bound(value);
9175 _impl_._has_bits_[8] |= 0x00000200u;
9178inline ::int32_t SatParameters::_internal_routing_cut_subset_size_for_shortest_paths_bound()
const {
9179 ::google::protobuf::internal::TSanRead(&
_impl_);
9180 return _impl_.routing_cut_subset_size_for_shortest_paths_bound_;
9182inline void SatParameters::_internal_set_routing_cut_subset_size_for_shortest_paths_bound(::int32_t value) {
9183 ::google::protobuf::internal::TSanWrite(&
_impl_);
9184 _impl_.routing_cut_subset_size_for_shortest_paths_bound_ = value;
9189 bool value = (
_impl_._has_bits_[8] & 0x00000010u) != 0;
9193 ::google::protobuf::internal::TSanWrite(&
_impl_);
9194 _impl_.routing_cut_dp_effort_ = 10000000;
9195 _impl_._has_bits_[8] &= ~0x00000010u;
9199 return _internal_routing_cut_dp_effort();
9202 _internal_set_routing_cut_dp_effort(value);
9203 _impl_._has_bits_[8] |= 0x00000010u;
9206inline double SatParameters::_internal_routing_cut_dp_effort()
const {
9207 ::google::protobuf::internal::TSanRead(&
_impl_);
9208 return _impl_.routing_cut_dp_effort_;
9210inline void SatParameters::_internal_set_routing_cut_dp_effort(
double value) {
9211 ::google::protobuf::internal::TSanWrite(&
_impl_);
9212 _impl_.routing_cut_dp_effort_ = value;
9217 bool value = (
_impl_._has_bits_[8] & 0x00000100u) != 0;
9221 ::google::protobuf::internal::TSanWrite(&
_impl_);
9222 _impl_.routing_cut_max_infeasible_path_length_ = 6;
9223 _impl_._has_bits_[8] &= ~0x00000100u;
9227 return _internal_routing_cut_max_infeasible_path_length();
9230 _internal_set_routing_cut_max_infeasible_path_length(value);
9231 _impl_._has_bits_[8] |= 0x00000100u;
9234inline ::int32_t SatParameters::_internal_routing_cut_max_infeasible_path_length()
const {
9235 ::google::protobuf::internal::TSanRead(&
_impl_);
9236 return _impl_.routing_cut_max_infeasible_path_length_;
9238inline void SatParameters::_internal_set_routing_cut_max_infeasible_path_length(::int32_t value) {
9239 ::google::protobuf::internal::TSanWrite(&
_impl_);
9240 _impl_.routing_cut_max_infeasible_path_length_ = value;
9245 bool value = (
_impl_._has_bits_[0] & 0x00200000u) != 0;
9249 ::google::protobuf::internal::TSanWrite(&
_impl_);
9250 _impl_.search_branching_ = 0;
9251 _impl_._has_bits_[0] &= ~0x00200000u;
9255 return _internal_search_branching();
9258 _internal_set_search_branching(value);
9259 _impl_._has_bits_[0] |= 0x00200000u;
9262inline ::operations_research::sat::SatParameters_SearchBranching SatParameters::_internal_search_branching()
const {
9263 ::google::protobuf::internal::TSanRead(&
_impl_);
9267 ::google::protobuf::internal::TSanWrite(&
_impl_);
9269 assert(::google::protobuf::internal::ValidateEnum(
9271 _impl_.search_branching_ = value;
9276 bool value = (
_impl_._has_bits_[5] & 0x00800000u) != 0;
9280 ::google::protobuf::internal::TSanWrite(&
_impl_);
9281 _impl_.hint_conflict_limit_ = 10;
9282 _impl_._has_bits_[5] &= ~0x00800000u;
9286 return _internal_hint_conflict_limit();
9289 _internal_set_hint_conflict_limit(value);
9290 _impl_._has_bits_[5] |= 0x00800000u;
9293inline ::int32_t SatParameters::_internal_hint_conflict_limit()
const {
9294 ::google::protobuf::internal::TSanRead(&
_impl_);
9295 return _impl_.hint_conflict_limit_;
9297inline void SatParameters::_internal_set_hint_conflict_limit(::int32_t value) {
9298 ::google::protobuf::internal::TSanWrite(&
_impl_);
9299 _impl_.hint_conflict_limit_ = value;
9304 bool value = (
_impl_._has_bits_[1] & 0x00001000u) != 0;
9308 ::google::protobuf::internal::TSanWrite(&
_impl_);
9309 _impl_.repair_hint_ =
false;
9310 _impl_._has_bits_[1] &= ~0x00001000u;
9314 return _internal_repair_hint();
9317 _internal_set_repair_hint(value);
9318 _impl_._has_bits_[1] |= 0x00001000u;
9321inline bool SatParameters::_internal_repair_hint()
const {
9322 ::google::protobuf::internal::TSanRead(&
_impl_);
9323 return _impl_.repair_hint_;
9325inline void SatParameters::_internal_set_repair_hint(
bool value) {
9326 ::google::protobuf::internal::TSanWrite(&
_impl_);
9327 _impl_.repair_hint_ = value;
9332 bool value = (
_impl_._has_bits_[1] & 0x02000000u) != 0;
9336 ::google::protobuf::internal::TSanWrite(&
_impl_);
9337 _impl_.fix_variables_to_their_hinted_value_ =
false;
9338 _impl_._has_bits_[1] &= ~0x02000000u;
9342 return _internal_fix_variables_to_their_hinted_value();
9345 _internal_set_fix_variables_to_their_hinted_value(value);
9346 _impl_._has_bits_[1] |= 0x02000000u;
9349inline bool SatParameters::_internal_fix_variables_to_their_hinted_value()
const {
9350 ::google::protobuf::internal::TSanRead(&
_impl_);
9351 return _impl_.fix_variables_to_their_hinted_value_;
9353inline void SatParameters::_internal_set_fix_variables_to_their_hinted_value(
bool value) {
9354 ::google::protobuf::internal::TSanWrite(&
_impl_);
9355 _impl_.fix_variables_to_their_hinted_value_ = value;
9360 bool value = (
_impl_._has_bits_[1] & 0x00020000u) != 0;
9364 ::google::protobuf::internal::TSanWrite(&
_impl_);
9365 _impl_.use_probing_search_ =
false;
9366 _impl_._has_bits_[1] &= ~0x00020000u;
9370 return _internal_use_probing_search();
9373 _internal_set_use_probing_search(value);
9374 _impl_._has_bits_[1] |= 0x00020000u;
9377inline bool SatParameters::_internal_use_probing_search()
const {
9378 ::google::protobuf::internal::TSanRead(&
_impl_);
9379 return _impl_.use_probing_search_;
9381inline void SatParameters::_internal_set_use_probing_search(
bool value) {
9382 ::google::protobuf::internal::TSanWrite(&
_impl_);
9383 _impl_.use_probing_search_ = value;
9388 bool value = (
_impl_._has_bits_[7] & 0x00010000u) != 0;
9392 ::google::protobuf::internal::TSanWrite(&
_impl_);
9393 _impl_.use_extended_probing_ =
true;
9394 _impl_._has_bits_[7] &= ~0x00010000u;
9398 return _internal_use_extended_probing();
9401 _internal_set_use_extended_probing(value);
9402 _impl_._has_bits_[7] |= 0x00010000u;
9405inline bool SatParameters::_internal_use_extended_probing()
const {
9406 ::google::protobuf::internal::TSanRead(&
_impl_);
9407 return _impl_.use_extended_probing_;
9409inline void SatParameters::_internal_set_use_extended_probing(
bool value) {
9410 ::google::protobuf::internal::TSanWrite(&
_impl_);
9411 _impl_.use_extended_probing_ = value;
9416 bool value = (
_impl_._has_bits_[7] & 0x00004000u) != 0;
9420 ::google::protobuf::internal::TSanWrite(&
_impl_);
9421 _impl_.probing_num_combinations_limit_ = 20000;
9422 _impl_._has_bits_[7] &= ~0x00004000u;
9426 return _internal_probing_num_combinations_limit();
9429 _internal_set_probing_num_combinations_limit(value);
9430 _impl_._has_bits_[7] |= 0x00004000u;
9433inline ::int32_t SatParameters::_internal_probing_num_combinations_limit()
const {
9434 ::google::protobuf::internal::TSanRead(&
_impl_);
9435 return _impl_.probing_num_combinations_limit_;
9437inline void SatParameters::_internal_set_probing_num_combinations_limit(::int32_t value) {
9438 ::google::protobuf::internal::TSanWrite(&
_impl_);
9439 _impl_.probing_num_combinations_limit_ = value;
9444 bool value = (
_impl_._has_bits_[6] & 0x00004000u) != 0;
9448 ::google::protobuf::internal::TSanWrite(&
_impl_);
9449 _impl_.shaving_deterministic_time_in_probing_search_ = 0.001;
9450 _impl_._has_bits_[6] &= ~0x00004000u;
9454 return _internal_shaving_deterministic_time_in_probing_search();
9457 _internal_set_shaving_deterministic_time_in_probing_search(value);
9458 _impl_._has_bits_[6] |= 0x00004000u;
9461inline double SatParameters::_internal_shaving_deterministic_time_in_probing_search()
const {
9462 ::google::protobuf::internal::TSanRead(&
_impl_);
9463 return _impl_.shaving_deterministic_time_in_probing_search_;
9465inline void SatParameters::_internal_set_shaving_deterministic_time_in_probing_search(
double value) {
9466 ::google::protobuf::internal::TSanWrite(&
_impl_);
9467 _impl_.shaving_deterministic_time_in_probing_search_ = value;
9472 bool value = (
_impl_._has_bits_[6] & 0x00008000u) != 0;
9476 ::google::protobuf::internal::TSanWrite(&
_impl_);
9477 _impl_.shaving_search_deterministic_time_ = 0.1;
9478 _impl_._has_bits_[6] &= ~0x00008000u;
9482 return _internal_shaving_search_deterministic_time();
9485 _internal_set_shaving_search_deterministic_time(value);
9486 _impl_._has_bits_[6] |= 0x00008000u;
9489inline double SatParameters::_internal_shaving_search_deterministic_time()
const {
9490 ::google::protobuf::internal::TSanRead(&
_impl_);
9491 return _impl_.shaving_search_deterministic_time_;
9493inline void SatParameters::_internal_set_shaving_search_deterministic_time(
double value) {
9494 ::google::protobuf::internal::TSanWrite(&
_impl_);
9495 _impl_.shaving_search_deterministic_time_ = value;
9500 bool value = (
_impl_._has_bits_[7] & 0x01000000u) != 0;
9504 ::google::protobuf::internal::TSanWrite(&
_impl_);
9505 _impl_.shaving_search_threshold_ = ::int64_t{64};
9506 _impl_._has_bits_[7] &= ~0x01000000u;
9510 return _internal_shaving_search_threshold();
9513 _internal_set_shaving_search_threshold(value);
9514 _impl_._has_bits_[7] |= 0x01000000u;
9517inline ::int64_t SatParameters::_internal_shaving_search_threshold()
const {
9518 ::google::protobuf::internal::TSanRead(&
_impl_);
9519 return _impl_.shaving_search_threshold_;
9521inline void SatParameters::_internal_set_shaving_search_threshold(::int64_t value) {
9522 ::google::protobuf::internal::TSanWrite(&
_impl_);
9523 _impl_.shaving_search_threshold_ = value;
9528 bool value = (
_impl_._has_bits_[2] & 0x00000040u) != 0;
9532 ::google::protobuf::internal::TSanWrite(&
_impl_);
9533 _impl_.use_objective_lb_search_ =
false;
9534 _impl_._has_bits_[2] &= ~0x00000040u;
9538 return _internal_use_objective_lb_search();
9541 _internal_set_use_objective_lb_search(value);
9542 _impl_._has_bits_[2] |= 0x00000040u;
9545inline bool SatParameters::_internal_use_objective_lb_search()
const {
9546 ::google::protobuf::internal::TSanRead(&
_impl_);
9547 return _impl_.use_objective_lb_search_;
9549inline void SatParameters::_internal_set_use_objective_lb_search(
bool value) {
9550 ::google::protobuf::internal::TSanWrite(&
_impl_);
9551 _impl_.use_objective_lb_search_ = value;
9556 bool value = (
_impl_._has_bits_[2] & 0x00004000u) != 0;
9560 ::google::protobuf::internal::TSanWrite(&
_impl_);
9561 _impl_.use_objective_shaving_search_ =
false;
9562 _impl_._has_bits_[2] &= ~0x00004000u;
9566 return _internal_use_objective_shaving_search();
9569 _internal_set_use_objective_shaving_search(value);
9570 _impl_._has_bits_[2] |= 0x00004000u;
9573inline bool SatParameters::_internal_use_objective_shaving_search()
const {
9574 ::google::protobuf::internal::TSanRead(&
_impl_);
9575 return _impl_.use_objective_shaving_search_;
9577inline void SatParameters::_internal_set_use_objective_shaving_search(
bool value) {
9578 ::google::protobuf::internal::TSanWrite(&
_impl_);
9579 _impl_.use_objective_shaving_search_ = value;
9584 bool value = (
_impl_._has_bits_[7] & 0x04000000u) != 0;
9588 ::google::protobuf::internal::TSanWrite(&
_impl_);
9589 _impl_.variables_shaving_level_ = -1;
9590 _impl_._has_bits_[7] &= ~0x04000000u;
9594 return _internal_variables_shaving_level();
9597 _internal_set_variables_shaving_level(value);
9598 _impl_._has_bits_[7] |= 0x04000000u;
9601inline ::int32_t SatParameters::_internal_variables_shaving_level()
const {
9602 ::google::protobuf::internal::TSanRead(&
_impl_);
9603 return _impl_.variables_shaving_level_;
9605inline void SatParameters::_internal_set_variables_shaving_level(::int32_t value) {
9606 ::google::protobuf::internal::TSanWrite(&
_impl_);
9607 _impl_.variables_shaving_level_ = value;
9612 bool value = (
_impl_._has_bits_[5] & 0x00000008u) != 0;
9616 ::google::protobuf::internal::TSanWrite(&
_impl_);
9617 _impl_.pseudo_cost_reliability_threshold_ = ::int64_t{100};
9618 _impl_._has_bits_[5] &= ~0x00000008u;
9622 return _internal_pseudo_cost_reliability_threshold();
9625 _internal_set_pseudo_cost_reliability_threshold(value);
9626 _impl_._has_bits_[5] |= 0x00000008u;
9629inline ::int64_t SatParameters::_internal_pseudo_cost_reliability_threshold()
const {
9630 ::google::protobuf::internal::TSanRead(&
_impl_);
9631 return _impl_.pseudo_cost_reliability_threshold_;
9633inline void SatParameters::_internal_set_pseudo_cost_reliability_threshold(::int64_t value) {
9634 ::google::protobuf::internal::TSanWrite(&
_impl_);
9635 _impl_.pseudo_cost_reliability_threshold_ = value;
9640 bool value = (
_impl_._has_bits_[0] & 0x00800000u) != 0;
9644 ::google::protobuf::internal::TSanWrite(&
_impl_);
9645 _impl_.optimize_with_core_ =
false;
9646 _impl_._has_bits_[0] &= ~0x00800000u;
9650 return _internal_optimize_with_core();
9653 _internal_set_optimize_with_core(value);
9654 _impl_._has_bits_[0] |= 0x00800000u;
9657inline bool SatParameters::_internal_optimize_with_core()
const {
9658 ::google::protobuf::internal::TSanRead(&
_impl_);
9659 return _impl_.optimize_with_core_;
9661inline void SatParameters::_internal_set_optimize_with_core(
bool value) {
9662 ::google::protobuf::internal::TSanWrite(&
_impl_);
9663 _impl_.optimize_with_core_ = value;
9668 bool value = (
_impl_._has_bits_[1] & 0x00800000u) != 0;
9672 ::google::protobuf::internal::TSanWrite(&
_impl_);
9673 _impl_.optimize_with_lb_tree_search_ =
false;
9674 _impl_._has_bits_[1] &= ~0x00800000u;
9678 return _internal_optimize_with_lb_tree_search();
9681 _internal_set_optimize_with_lb_tree_search(value);
9682 _impl_._has_bits_[1] |= 0x00800000u;
9685inline bool SatParameters::_internal_optimize_with_lb_tree_search()
const {
9686 ::google::protobuf::internal::TSanRead(&
_impl_);
9687 return _impl_.optimize_with_lb_tree_search_;
9689inline void SatParameters::_internal_set_optimize_with_lb_tree_search(
bool value) {
9690 ::google::protobuf::internal::TSanWrite(&
_impl_);
9691 _impl_.optimize_with_lb_tree_search_ = value;
9696 bool value = (
_impl_._has_bits_[2] & 0x00400000u) != 0;
9700 ::google::protobuf::internal::TSanWrite(&
_impl_);
9701 _impl_.save_lp_basis_in_lb_tree_search_ =
false;
9702 _impl_._has_bits_[2] &= ~0x00400000u;
9706 return _internal_save_lp_basis_in_lb_tree_search();
9709 _internal_set_save_lp_basis_in_lb_tree_search(value);
9710 _impl_._has_bits_[2] |= 0x00400000u;
9713inline bool SatParameters::_internal_save_lp_basis_in_lb_tree_search()
const {
9714 ::google::protobuf::internal::TSanRead(&
_impl_);
9715 return _impl_.save_lp_basis_in_lb_tree_search_;
9717inline void SatParameters::_internal_set_save_lp_basis_in_lb_tree_search(
bool value) {
9718 ::google::protobuf::internal::TSanWrite(&
_impl_);
9719 _impl_.save_lp_basis_in_lb_tree_search_ = value;
9724 bool value = (
_impl_._has_bits_[4] & 0x00200000u) != 0;
9728 ::google::protobuf::internal::TSanWrite(&
_impl_);
9729 _impl_.binary_search_num_conflicts_ = -1;
9730 _impl_._has_bits_[4] &= ~0x00200000u;
9734 return _internal_binary_search_num_conflicts();
9737 _internal_set_binary_search_num_conflicts(value);
9738 _impl_._has_bits_[4] |= 0x00200000u;
9741inline ::int32_t SatParameters::_internal_binary_search_num_conflicts()
const {
9742 ::google::protobuf::internal::TSanRead(&
_impl_);
9743 return _impl_.binary_search_num_conflicts_;
9745inline void SatParameters::_internal_set_binary_search_num_conflicts(::int32_t value) {
9746 ::google::protobuf::internal::TSanWrite(&
_impl_);
9747 _impl_.binary_search_num_conflicts_ = value;
9752 bool value = (
_impl_._has_bits_[0] & 0x01000000u) != 0;
9756 ::google::protobuf::internal::TSanWrite(&
_impl_);
9757 _impl_.optimize_with_max_hs_ =
false;
9758 _impl_._has_bits_[0] &= ~0x01000000u;
9762 return _internal_optimize_with_max_hs();
9765 _internal_set_optimize_with_max_hs(value);
9766 _impl_._has_bits_[0] |= 0x01000000u;
9769inline bool SatParameters::_internal_optimize_with_max_hs()
const {
9770 ::google::protobuf::internal::TSanRead(&
_impl_);
9771 return _impl_.optimize_with_max_hs_;
9773inline void SatParameters::_internal_set_optimize_with_max_hs(
bool value) {
9774 ::google::protobuf::internal::TSanWrite(&
_impl_);
9775 _impl_.optimize_with_max_hs_ = value;
9780 bool value = (
_impl_._has_bits_[7] & 0x00008000u) != 0;
9784 ::google::protobuf::internal::TSanWrite(&
_impl_);
9785 _impl_.use_feasibility_jump_ =
true;
9786 _impl_._has_bits_[7] &= ~0x00008000u;
9790 return _internal_use_feasibility_jump();
9793 _internal_set_use_feasibility_jump(value);
9794 _impl_._has_bits_[7] |= 0x00008000u;
9797inline bool SatParameters::_internal_use_feasibility_jump()
const {
9798 ::google::protobuf::internal::TSanRead(&
_impl_);
9799 return _impl_.use_feasibility_jump_;
9801inline void SatParameters::_internal_set_use_feasibility_jump(
bool value) {
9802 ::google::protobuf::internal::TSanWrite(&
_impl_);
9803 _impl_.use_feasibility_jump_ = value;
9808 bool value = (
_impl_._has_bits_[2] & 0x00001000u) != 0;
9812 ::google::protobuf::internal::TSanWrite(&
_impl_);
9813 _impl_.use_ls_only_ =
false;
9814 _impl_._has_bits_[2] &= ~0x00001000u;
9818 return _internal_use_ls_only();
9821 _internal_set_use_ls_only(value);
9822 _impl_._has_bits_[2] |= 0x00001000u;
9825inline bool SatParameters::_internal_use_ls_only()
const {
9826 ::google::protobuf::internal::TSanRead(&
_impl_);
9827 return _impl_.use_ls_only_;
9829inline void SatParameters::_internal_set_use_ls_only(
bool value) {
9830 ::google::protobuf::internal::TSanWrite(&
_impl_);
9831 _impl_.use_ls_only_ = value;
9836 bool value = (
_impl_._has_bits_[6] & 0x04000000u) != 0;
9840 ::google::protobuf::internal::TSanWrite(&
_impl_);
9841 _impl_.feasibility_jump_decay_ = 0.95;
9842 _impl_._has_bits_[6] &= ~0x04000000u;
9846 return _internal_feasibility_jump_decay();
9849 _internal_set_feasibility_jump_decay(value);
9850 _impl_._has_bits_[6] |= 0x04000000u;
9853inline double SatParameters::_internal_feasibility_jump_decay()
const {
9854 ::google::protobuf::internal::TSanRead(&
_impl_);
9855 return _impl_.feasibility_jump_decay_;
9857inline void SatParameters::_internal_set_feasibility_jump_decay(
double value) {
9858 ::google::protobuf::internal::TSanWrite(&
_impl_);
9859 _impl_.feasibility_jump_decay_ = value;
9864 bool value = (
_impl_._has_bits_[7] & 0x00000010u) != 0;
9868 ::google::protobuf::internal::TSanWrite(&
_impl_);
9869 _impl_.feasibility_jump_linearization_level_ = 2;
9870 _impl_._has_bits_[7] &= ~0x00000010u;
9874 return _internal_feasibility_jump_linearization_level();
9877 _internal_set_feasibility_jump_linearization_level(value);
9878 _impl_._has_bits_[7] |= 0x00000010u;
9881inline ::int32_t SatParameters::_internal_feasibility_jump_linearization_level()
const {
9882 ::google::protobuf::internal::TSanRead(&
_impl_);
9883 return _impl_.feasibility_jump_linearization_level_;
9885inline void SatParameters::_internal_set_feasibility_jump_linearization_level(::int32_t value) {
9886 ::google::protobuf::internal::TSanWrite(&
_impl_);
9887 _impl_.feasibility_jump_linearization_level_ = value;
9892 bool value = (
_impl_._has_bits_[7] & 0x00000020u) != 0;
9896 ::google::protobuf::internal::TSanWrite(&
_impl_);
9897 _impl_.feasibility_jump_restart_factor_ = 1;
9898 _impl_._has_bits_[7] &= ~0x00000020u;
9902 return _internal_feasibility_jump_restart_factor();
9905 _internal_set_feasibility_jump_restart_factor(value);
9906 _impl_._has_bits_[7] |= 0x00000020u;
9909inline ::int32_t SatParameters::_internal_feasibility_jump_restart_factor()
const {
9910 ::google::protobuf::internal::TSanRead(&
_impl_);
9911 return _impl_.feasibility_jump_restart_factor_;
9913inline void SatParameters::_internal_set_feasibility_jump_restart_factor(::int32_t value) {
9914 ::google::protobuf::internal::TSanWrite(&
_impl_);
9915 _impl_.feasibility_jump_restart_factor_ = value;
9920 bool value = (
_impl_._has_bits_[7] & 0x02000000u) != 0;
9924 ::google::protobuf::internal::TSanWrite(&
_impl_);
9925 _impl_.feasibility_jump_batch_dtime_ = 0.1;
9926 _impl_._has_bits_[7] &= ~0x02000000u;
9930 return _internal_feasibility_jump_batch_dtime();
9933 _internal_set_feasibility_jump_batch_dtime(value);
9934 _impl_._has_bits_[7] |= 0x02000000u;
9937inline double SatParameters::_internal_feasibility_jump_batch_dtime()
const {
9938 ::google::protobuf::internal::TSanRead(&
_impl_);
9939 return _impl_.feasibility_jump_batch_dtime_;
9941inline void SatParameters::_internal_set_feasibility_jump_batch_dtime(
double value) {
9942 ::google::protobuf::internal::TSanWrite(&
_impl_);
9943 _impl_.feasibility_jump_batch_dtime_ = value;
9948 bool value = (
_impl_._has_bits_[7] & 0x00000001u) != 0;
9952 ::google::protobuf::internal::TSanWrite(&
_impl_);
9953 _impl_.feasibility_jump_var_randomization_probability_ = 0.05;
9954 _impl_._has_bits_[7] &= ~0x00000001u;
9958 return _internal_feasibility_jump_var_randomization_probability();
9961 _internal_set_feasibility_jump_var_randomization_probability(value);
9962 _impl_._has_bits_[7] |= 0x00000001u;
9965inline double SatParameters::_internal_feasibility_jump_var_randomization_probability()
const {
9966 ::google::protobuf::internal::TSanRead(&
_impl_);
9967 return _impl_.feasibility_jump_var_randomization_probability_;
9969inline void SatParameters::_internal_set_feasibility_jump_var_randomization_probability(
double value) {
9970 ::google::protobuf::internal::TSanWrite(&
_impl_);
9971 _impl_.feasibility_jump_var_randomization_probability_ = value;
9976 bool value = (
_impl_._has_bits_[7] & 0x00000002u) != 0;
9980 ::google::protobuf::internal::TSanWrite(&
_impl_);
9981 _impl_.feasibility_jump_var_perburbation_range_ratio_ = 0.2;
9982 _impl_._has_bits_[7] &= ~0x00000002u;
9986 return _internal_feasibility_jump_var_perburbation_range_ratio();
9989 _internal_set_feasibility_jump_var_perburbation_range_ratio(value);
9990 _impl_._has_bits_[7] |= 0x00000002u;
9993inline double SatParameters::_internal_feasibility_jump_var_perburbation_range_ratio()
const {
9994 ::google::protobuf::internal::TSanRead(&
_impl_);
9995 return _impl_.feasibility_jump_var_perburbation_range_ratio_;
9997inline void SatParameters::_internal_set_feasibility_jump_var_perburbation_range_ratio(
double value) {
9998 ::google::protobuf::internal::TSanWrite(&
_impl_);
9999 _impl_.feasibility_jump_var_perburbation_range_ratio_ = value;
10004 bool value = (
_impl_._has_bits_[6] & 0x40000000u) != 0;
10008 ::google::protobuf::internal::TSanWrite(&
_impl_);
10009 _impl_.feasibility_jump_enable_restarts_ =
true;
10010 _impl_._has_bits_[6] &= ~0x40000000u;
10014 return _internal_feasibility_jump_enable_restarts();
10017 _internal_set_feasibility_jump_enable_restarts(value);
10018 _impl_._has_bits_[6] |= 0x40000000u;
10021inline bool SatParameters::_internal_feasibility_jump_enable_restarts()
const {
10022 ::google::protobuf::internal::TSanRead(&
_impl_);
10023 return _impl_.feasibility_jump_enable_restarts_;
10025inline void SatParameters::_internal_set_feasibility_jump_enable_restarts(
bool value) {
10026 ::google::protobuf::internal::TSanWrite(&
_impl_);
10027 _impl_.feasibility_jump_enable_restarts_ = value;
10032 bool value = (
_impl_._has_bits_[7] & 0x00000800u) != 0;
10036 ::google::protobuf::internal::TSanWrite(&
_impl_);
10037 _impl_.feasibility_jump_max_expanded_constraint_size_ = 500;
10038 _impl_._has_bits_[7] &= ~0x00000800u;
10042 return _internal_feasibility_jump_max_expanded_constraint_size();
10045 _internal_set_feasibility_jump_max_expanded_constraint_size(value);
10046 _impl_._has_bits_[7] |= 0x00000800u;
10049inline ::int32_t SatParameters::_internal_feasibility_jump_max_expanded_constraint_size()
const {
10050 ::google::protobuf::internal::TSanRead(&
_impl_);
10051 return _impl_.feasibility_jump_max_expanded_constraint_size_;
10053inline void SatParameters::_internal_set_feasibility_jump_max_expanded_constraint_size(::int32_t value) {
10054 ::google::protobuf::internal::TSanWrite(&
_impl_);
10055 _impl_.feasibility_jump_max_expanded_constraint_size_ = value;
10060 bool value = (
_impl_._has_bits_[2] & 0x00000400u) != 0;
10064 ::google::protobuf::internal::TSanWrite(&
_impl_);
10065 _impl_.num_violation_ls_ = 0;
10066 _impl_._has_bits_[2] &= ~0x00000400u;
10070 return _internal_num_violation_ls();
10073 _internal_set_num_violation_ls(value);
10074 _impl_._has_bits_[2] |= 0x00000400u;
10077inline ::int32_t SatParameters::_internal_num_violation_ls()
const {
10078 ::google::protobuf::internal::TSanRead(&
_impl_);
10079 return _impl_.num_violation_ls_;
10081inline void SatParameters::_internal_set_num_violation_ls(::int32_t value) {
10082 ::google::protobuf::internal::TSanWrite(&
_impl_);
10083 _impl_.num_violation_ls_ = value;
10088 bool value = (
_impl_._has_bits_[7] & 0x00000004u) != 0;
10092 ::google::protobuf::internal::TSanWrite(&
_impl_);
10093 _impl_.violation_ls_perturbation_period_ = 100;
10094 _impl_._has_bits_[7] &= ~0x00000004u;
10098 return _internal_violation_ls_perturbation_period();
10101 _internal_set_violation_ls_perturbation_period(value);
10102 _impl_._has_bits_[7] |= 0x00000004u;
10105inline ::int32_t SatParameters::_internal_violation_ls_perturbation_period()
const {
10106 ::google::protobuf::internal::TSanRead(&
_impl_);
10107 return _impl_.violation_ls_perturbation_period_;
10109inline void SatParameters::_internal_set_violation_ls_perturbation_period(::int32_t value) {
10110 ::google::protobuf::internal::TSanWrite(&
_impl_);
10111 _impl_.violation_ls_perturbation_period_ = value;
10116 bool value = (
_impl_._has_bits_[7] & 0x00000040u) != 0;
10120 ::google::protobuf::internal::TSanWrite(&
_impl_);
10121 _impl_.violation_ls_compound_move_probability_ = 0.5;
10122 _impl_._has_bits_[7] &= ~0x00000040u;
10126 return _internal_violation_ls_compound_move_probability();
10129 _internal_set_violation_ls_compound_move_probability(value);
10130 _impl_._has_bits_[7] |= 0x00000040u;
10133inline double SatParameters::_internal_violation_ls_compound_move_probability()
const {
10134 ::google::protobuf::internal::TSanRead(&
_impl_);
10135 return _impl_.violation_ls_compound_move_probability_;
10137inline void SatParameters::_internal_set_violation_ls_compound_move_probability(
double value) {
10138 ::google::protobuf::internal::TSanWrite(&
_impl_);
10139 _impl_.violation_ls_compound_move_probability_ = value;
10144 bool value = (
_impl_._has_bits_[2] & 0x00000100u) != 0;
10148 ::google::protobuf::internal::TSanWrite(&
_impl_);
10149 _impl_.shared_tree_num_workers_ = 0;
10150 _impl_._has_bits_[2] &= ~0x00000100u;
10154 return _internal_shared_tree_num_workers();
10157 _internal_set_shared_tree_num_workers(value);
10158 _impl_._has_bits_[2] |= 0x00000100u;
10161inline ::int32_t SatParameters::_internal_shared_tree_num_workers()
const {
10162 ::google::protobuf::internal::TSanRead(&
_impl_);
10163 return _impl_.shared_tree_num_workers_;
10165inline void SatParameters::_internal_set_shared_tree_num_workers(::int32_t value) {
10166 ::google::protobuf::internal::TSanWrite(&
_impl_);
10167 _impl_.shared_tree_num_workers_ = value;
10172 bool value = (
_impl_._has_bits_[2] & 0x00000800u) != 0;
10176 ::google::protobuf::internal::TSanWrite(&
_impl_);
10177 _impl_.use_shared_tree_search_ =
false;
10178 _impl_._has_bits_[2] &= ~0x00000800u;
10182 return _internal_use_shared_tree_search();
10185 _internal_set_use_shared_tree_search(value);
10186 _impl_._has_bits_[2] |= 0x00000800u;
10189inline bool SatParameters::_internal_use_shared_tree_search()
const {
10190 ::google::protobuf::internal::TSanRead(&
_impl_);
10191 return _impl_.use_shared_tree_search_;
10193inline void SatParameters::_internal_set_use_shared_tree_search(
bool value) {
10194 ::google::protobuf::internal::TSanWrite(&
_impl_);
10195 _impl_.use_shared_tree_search_ = value;
10200 bool value = (
_impl_._has_bits_[7] & 0x00400000u) != 0;
10204 ::google::protobuf::internal::TSanWrite(&
_impl_);
10205 _impl_.shared_tree_worker_min_restarts_per_subtree_ = 1;
10206 _impl_._has_bits_[7] &= ~0x00400000u;
10210 return _internal_shared_tree_worker_min_restarts_per_subtree();
10213 _internal_set_shared_tree_worker_min_restarts_per_subtree(value);
10214 _impl_._has_bits_[7] |= 0x00400000u;
10217inline ::int32_t SatParameters::_internal_shared_tree_worker_min_restarts_per_subtree()
const {
10218 ::google::protobuf::internal::TSanRead(&
_impl_);
10219 return _impl_.shared_tree_worker_min_restarts_per_subtree_;
10221inline void SatParameters::_internal_set_shared_tree_worker_min_restarts_per_subtree(::int32_t value) {
10222 ::google::protobuf::internal::TSanWrite(&
_impl_);
10223 _impl_.shared_tree_worker_min_restarts_per_subtree_ = value;
10228 bool value = (
_impl_._has_bits_[7] & 0x10000000u) != 0;
10232 ::google::protobuf::internal::TSanWrite(&
_impl_);
10233 _impl_.shared_tree_worker_enable_trail_sharing_ =
true;
10234 _impl_._has_bits_[7] &= ~0x10000000u;
10238 return _internal_shared_tree_worker_enable_trail_sharing();
10241 _internal_set_shared_tree_worker_enable_trail_sharing(value);
10242 _impl_._has_bits_[7] |= 0x10000000u;
10245inline bool SatParameters::_internal_shared_tree_worker_enable_trail_sharing()
const {
10246 ::google::protobuf::internal::TSanRead(&
_impl_);
10247 return _impl_.shared_tree_worker_enable_trail_sharing_;
10249inline void SatParameters::_internal_set_shared_tree_worker_enable_trail_sharing(
bool value) {
10250 ::google::protobuf::internal::TSanWrite(&
_impl_);
10251 _impl_.shared_tree_worker_enable_trail_sharing_ = value;
10256 bool value = (
_impl_._has_bits_[7] & 0x80000000u) != 0;
10260 ::google::protobuf::internal::TSanWrite(&
_impl_);
10261 _impl_.shared_tree_worker_enable_phase_sharing_ =
true;
10262 _impl_._has_bits_[7] &= ~0x80000000u;
10266 return _internal_shared_tree_worker_enable_phase_sharing();
10269 _internal_set_shared_tree_worker_enable_phase_sharing(value);
10270 _impl_._has_bits_[7] |= 0x80000000u;
10273inline bool SatParameters::_internal_shared_tree_worker_enable_phase_sharing()
const {
10274 ::google::protobuf::internal::TSanRead(&
_impl_);
10275 return _impl_.shared_tree_worker_enable_phase_sharing_;
10277inline void SatParameters::_internal_set_shared_tree_worker_enable_phase_sharing(
bool value) {
10278 ::google::protobuf::internal::TSanWrite(&
_impl_);
10279 _impl_.shared_tree_worker_enable_phase_sharing_ = value;
10284 bool value = (
_impl_._has_bits_[7] & 0x00800000u) != 0;
10288 ::google::protobuf::internal::TSanWrite(&
_impl_);
10289 _impl_.shared_tree_open_leaves_per_worker_ = 2;
10290 _impl_._has_bits_[7] &= ~0x00800000u;
10294 return _internal_shared_tree_open_leaves_per_worker();
10297 _internal_set_shared_tree_open_leaves_per_worker(value);
10298 _impl_._has_bits_[7] |= 0x00800000u;
10301inline double SatParameters::_internal_shared_tree_open_leaves_per_worker()
const {
10302 ::google::protobuf::internal::TSanRead(&
_impl_);
10303 return _impl_.shared_tree_open_leaves_per_worker_;
10305inline void SatParameters::_internal_set_shared_tree_open_leaves_per_worker(
double value) {
10306 ::google::protobuf::internal::TSanWrite(&
_impl_);
10307 _impl_.shared_tree_open_leaves_per_worker_ = value;
10312 bool value = (
_impl_._has_bits_[6] & 0x08000000u) != 0;
10316 ::google::protobuf::internal::TSanWrite(&
_impl_);
10317 _impl_.shared_tree_max_nodes_per_worker_ = 10000;
10318 _impl_._has_bits_[6] &= ~0x08000000u;
10322 return _internal_shared_tree_max_nodes_per_worker();
10325 _internal_set_shared_tree_max_nodes_per_worker(value);
10326 _impl_._has_bits_[6] |= 0x08000000u;
10329inline ::int32_t SatParameters::_internal_shared_tree_max_nodes_per_worker()
const {
10330 ::google::protobuf::internal::TSanRead(&
_impl_);
10331 return _impl_.shared_tree_max_nodes_per_worker_;
10333inline void SatParameters::_internal_set_shared_tree_max_nodes_per_worker(::int32_t value) {
10334 ::google::protobuf::internal::TSanWrite(&
_impl_);
10335 _impl_.shared_tree_max_nodes_per_worker_ = value;
10340 bool value = (
_impl_._has_bits_[2] & 0x00000200u) != 0;
10344 ::google::protobuf::internal::TSanWrite(&
_impl_);
10345 _impl_.shared_tree_split_strategy_ = 0;
10346 _impl_._has_bits_[2] &= ~0x00000200u;
10350 return _internal_shared_tree_split_strategy();
10353 _internal_set_shared_tree_split_strategy(value);
10354 _impl_._has_bits_[2] |= 0x00000200u;
10357inline ::operations_research::sat::SatParameters_SharedTreeSplitStrategy SatParameters::_internal_shared_tree_split_strategy()
const {
10358 ::google::protobuf::internal::TSanRead(&
_impl_);
10362 ::google::protobuf::internal::TSanWrite(&
_impl_);
10364 assert(::google::protobuf::internal::ValidateEnum(
10366 _impl_.shared_tree_split_strategy_ = value;
10371 bool value = (
_impl_._has_bits_[8] & 0x00000001u) != 0;
10375 ::google::protobuf::internal::TSanWrite(&
_impl_);
10376 _impl_.shared_tree_balance_tolerance_ = 1;
10377 _impl_._has_bits_[8] &= ~0x00000001u;
10381 return _internal_shared_tree_balance_tolerance();
10384 _internal_set_shared_tree_balance_tolerance(value);
10385 _impl_._has_bits_[8] |= 0x00000001u;
10388inline ::int32_t SatParameters::_internal_shared_tree_balance_tolerance()
const {
10389 ::google::protobuf::internal::TSanRead(&
_impl_);
10390 return _impl_.shared_tree_balance_tolerance_;
10392inline void SatParameters::_internal_set_shared_tree_balance_tolerance(::int32_t value) {
10393 ::google::protobuf::internal::TSanWrite(&
_impl_);
10394 _impl_.shared_tree_balance_tolerance_ = value;
10399 bool value = (
_impl_._has_bits_[0] & 0x02000000u) != 0;
10403 ::google::protobuf::internal::TSanWrite(&
_impl_);
10404 _impl_.enumerate_all_solutions_ =
false;
10405 _impl_._has_bits_[0] &= ~0x02000000u;
10409 return _internal_enumerate_all_solutions();
10412 _internal_set_enumerate_all_solutions(value);
10413 _impl_._has_bits_[0] |= 0x02000000u;
10416inline bool SatParameters::_internal_enumerate_all_solutions()
const {
10417 ::google::protobuf::internal::TSanRead(&
_impl_);
10418 return _impl_.enumerate_all_solutions_;
10420inline void SatParameters::_internal_set_enumerate_all_solutions(
bool value) {
10421 ::google::protobuf::internal::TSanWrite(&
_impl_);
10422 _impl_.enumerate_all_solutions_ = value;
10427 bool value = (
_impl_._has_bits_[1] & 0x00004000u) != 0;
10431 ::google::protobuf::internal::TSanWrite(&
_impl_);
10432 _impl_.keep_all_feasible_solutions_in_presolve_ =
false;
10433 _impl_._has_bits_[1] &= ~0x00004000u;
10437 return _internal_keep_all_feasible_solutions_in_presolve();
10440 _internal_set_keep_all_feasible_solutions_in_presolve(value);
10441 _impl_._has_bits_[1] |= 0x00004000u;
10444inline bool SatParameters::_internal_keep_all_feasible_solutions_in_presolve()
const {
10445 ::google::protobuf::internal::TSanRead(&
_impl_);
10446 return _impl_.keep_all_feasible_solutions_in_presolve_;
10448inline void SatParameters::_internal_set_keep_all_feasible_solutions_in_presolve(
bool value) {
10449 ::google::protobuf::internal::TSanWrite(&
_impl_);
10450 _impl_.keep_all_feasible_solutions_in_presolve_ = value;
10455 bool value = (
_impl_._has_bits_[1] & 0x00000004u) != 0;
10459 ::google::protobuf::internal::TSanWrite(&
_impl_);
10460 _impl_.fill_tightened_domains_in_response_ =
false;
10461 _impl_._has_bits_[1] &= ~0x00000004u;
10465 return _internal_fill_tightened_domains_in_response();
10468 _internal_set_fill_tightened_domains_in_response(value);
10469 _impl_._has_bits_[1] |= 0x00000004u;
10472inline bool SatParameters::_internal_fill_tightened_domains_in_response()
const {
10473 ::google::protobuf::internal::TSanRead(&
_impl_);
10474 return _impl_.fill_tightened_domains_in_response_;
10476inline void SatParameters::_internal_set_fill_tightened_domains_in_response(
bool value) {
10477 ::google::protobuf::internal::TSanWrite(&
_impl_);
10478 _impl_.fill_tightened_domains_in_response_ = value;
10483 bool value = (
_impl_._has_bits_[1] & 0x04000000u) != 0;
10487 ::google::protobuf::internal::TSanWrite(&
_impl_);
10488 _impl_.fill_additional_solutions_in_response_ =
false;
10489 _impl_._has_bits_[1] &= ~0x04000000u;
10493 return _internal_fill_additional_solutions_in_response();
10496 _internal_set_fill_additional_solutions_in_response(value);
10497 _impl_._has_bits_[1] |= 0x04000000u;
10500inline bool SatParameters::_internal_fill_additional_solutions_in_response()
const {
10501 ::google::protobuf::internal::TSanRead(&
_impl_);
10502 return _impl_.fill_additional_solutions_in_response_;
10504inline void SatParameters::_internal_set_fill_additional_solutions_in_response(
bool value) {
10505 ::google::protobuf::internal::TSanWrite(&
_impl_);
10506 _impl_.fill_additional_solutions_in_response_ = value;
10511 bool value = (
_impl_._has_bits_[4] & 0x01000000u) != 0;
10515 ::google::protobuf::internal::TSanWrite(&
_impl_);
10516 _impl_.instantiate_all_variables_ =
true;
10517 _impl_._has_bits_[4] &= ~0x01000000u;
10521 return _internal_instantiate_all_variables();
10524 _internal_set_instantiate_all_variables(value);
10525 _impl_._has_bits_[4] |= 0x01000000u;
10528inline bool SatParameters::_internal_instantiate_all_variables()
const {
10529 ::google::protobuf::internal::TSanRead(&
_impl_);
10530 return _impl_.instantiate_all_variables_;
10532inline void SatParameters::_internal_set_instantiate_all_variables(
bool value) {
10533 ::google::protobuf::internal::TSanWrite(&
_impl_);
10534 _impl_.instantiate_all_variables_ = value;
10539 bool value = (
_impl_._has_bits_[4] & 0x00800000u) != 0;
10543 ::google::protobuf::internal::TSanWrite(&
_impl_);
10544 _impl_.auto_detect_greater_than_at_least_one_of_ =
true;
10545 _impl_._has_bits_[4] &= ~0x00800000u;
10549 return _internal_auto_detect_greater_than_at_least_one_of();
10552 _internal_set_auto_detect_greater_than_at_least_one_of(value);
10553 _impl_._has_bits_[4] |= 0x00800000u;
10556inline bool SatParameters::_internal_auto_detect_greater_than_at_least_one_of()
const {
10557 ::google::protobuf::internal::TSanRead(&
_impl_);
10558 return _impl_.auto_detect_greater_than_at_least_one_of_;
10560inline void SatParameters::_internal_set_auto_detect_greater_than_at_least_one_of(
bool value) {
10561 ::google::protobuf::internal::TSanWrite(&
_impl_);
10562 _impl_.auto_detect_greater_than_at_least_one_of_ = value;
10567 bool value = (
_impl_._has_bits_[0] & 0x08000000u) != 0;
10571 ::google::protobuf::internal::TSanWrite(&
_impl_);
10572 _impl_.stop_after_first_solution_ =
false;
10573 _impl_._has_bits_[0] &= ~0x08000000u;
10577 return _internal_stop_after_first_solution();
10580 _internal_set_stop_after_first_solution(value);
10581 _impl_._has_bits_[0] |= 0x08000000u;
10584inline bool SatParameters::_internal_stop_after_first_solution()
const {
10585 ::google::protobuf::internal::TSanRead(&
_impl_);
10586 return _impl_.stop_after_first_solution_;
10588inline void SatParameters::_internal_set_stop_after_first_solution(
bool value) {
10589 ::google::protobuf::internal::TSanWrite(&
_impl_);
10590 _impl_.stop_after_first_solution_ = value;
10595 bool value = (
_impl_._has_bits_[1] & 0x00000080u) != 0;
10599 ::google::protobuf::internal::TSanWrite(&
_impl_);
10600 _impl_.stop_after_presolve_ =
false;
10601 _impl_._has_bits_[1] &= ~0x00000080u;
10605 return _internal_stop_after_presolve();
10608 _internal_set_stop_after_presolve(value);
10609 _impl_._has_bits_[1] |= 0x00000080u;
10612inline bool SatParameters::_internal_stop_after_presolve()
const {
10613 ::google::protobuf::internal::TSanRead(&
_impl_);
10614 return _impl_.stop_after_presolve_;
10616inline void SatParameters::_internal_set_stop_after_presolve(
bool value) {
10617 ::google::protobuf::internal::TSanWrite(&
_impl_);
10618 _impl_.stop_after_presolve_ = value;
10623 bool value = (
_impl_._has_bits_[2] & 0x00002000u) != 0;
10627 ::google::protobuf::internal::TSanWrite(&
_impl_);
10628 _impl_.stop_after_root_propagation_ =
false;
10629 _impl_._has_bits_[2] &= ~0x00002000u;
10633 return _internal_stop_after_root_propagation();
10636 _internal_set_stop_after_root_propagation(value);
10637 _impl_._has_bits_[2] |= 0x00002000u;
10640inline bool SatParameters::_internal_stop_after_root_propagation()
const {
10641 ::google::protobuf::internal::TSanRead(&
_impl_);
10642 return _impl_.stop_after_root_propagation_;
10644inline void SatParameters::_internal_set_stop_after_root_propagation(
bool value) {
10645 ::google::protobuf::internal::TSanWrite(&
_impl_);
10646 _impl_.stop_after_root_propagation_ = value;
10651 bool value = (
_impl_._has_bits_[8] & 0x00000004u) != 0;
10655 ::google::protobuf::internal::TSanWrite(&
_impl_);
10656 _impl_.lns_initial_difficulty_ = 0.5;
10657 _impl_._has_bits_[8] &= ~0x00000004u;
10661 return _internal_lns_initial_difficulty();
10664 _internal_set_lns_initial_difficulty(value);
10665 _impl_._has_bits_[8] |= 0x00000004u;
10668inline double SatParameters::_internal_lns_initial_difficulty()
const {
10669 ::google::protobuf::internal::TSanRead(&
_impl_);
10670 return _impl_.lns_initial_difficulty_;
10672inline void SatParameters::_internal_set_lns_initial_difficulty(
double value) {
10673 ::google::protobuf::internal::TSanWrite(&
_impl_);
10674 _impl_.lns_initial_difficulty_ = value;
10679 bool value = (
_impl_._has_bits_[8] & 0x00000008u) != 0;
10683 ::google::protobuf::internal::TSanWrite(&
_impl_);
10684 _impl_.lns_initial_deterministic_limit_ = 0.1;
10685 _impl_._has_bits_[8] &= ~0x00000008u;
10689 return _internal_lns_initial_deterministic_limit();
10692 _internal_set_lns_initial_deterministic_limit(value);
10693 _impl_._has_bits_[8] |= 0x00000008u;
10696inline double SatParameters::_internal_lns_initial_deterministic_limit()
const {
10697 ::google::protobuf::internal::TSanRead(&
_impl_);
10698 return _impl_.lns_initial_deterministic_limit_;
10700inline void SatParameters::_internal_set_lns_initial_deterministic_limit(
double value) {
10701 ::google::protobuf::internal::TSanWrite(&
_impl_);
10702 _impl_.lns_initial_deterministic_limit_ = value;
10707 bool value = (
_impl_._has_bits_[7] & 0x00040000u) != 0;
10711 ::google::protobuf::internal::TSanWrite(&
_impl_);
10713 _impl_._has_bits_[7] &= ~0x00040000u;
10717 return _internal_use_lns();
10720 _internal_set_use_lns(value);
10721 _impl_._has_bits_[7] |= 0x00040000u;
10724inline bool SatParameters::_internal_use_lns()
const {
10725 ::google::protobuf::internal::TSanRead(&
_impl_);
10728inline void SatParameters::_internal_set_use_lns(
bool value) {
10729 ::google::protobuf::internal::TSanWrite(&
_impl_);
10730 _impl_.use_lns_ = value;
10735 bool value = (
_impl_._has_bits_[0] & 0x10000000u) != 0;
10739 ::google::protobuf::internal::TSanWrite(&
_impl_);
10740 _impl_.use_lns_only_ =
false;
10741 _impl_._has_bits_[0] &= ~0x10000000u;
10745 return _internal_use_lns_only();
10748 _internal_set_use_lns_only(value);
10749 _impl_._has_bits_[0] |= 0x10000000u;
10752inline bool SatParameters::_internal_use_lns_only()
const {
10753 ::google::protobuf::internal::TSanRead(&
_impl_);
10754 return _impl_.use_lns_only_;
10756inline void SatParameters::_internal_set_use_lns_only(
bool value) {
10757 ::google::protobuf::internal::TSanWrite(&
_impl_);
10758 _impl_.use_lns_only_ = value;
10763 bool value = (
_impl_._has_bits_[6] & 0x00000400u) != 0;
10767 ::google::protobuf::internal::TSanWrite(&
_impl_);
10768 _impl_.solution_pool_size_ = 3;
10769 _impl_._has_bits_[6] &= ~0x00000400u;
10773 return _internal_solution_pool_size();
10776 _internal_set_solution_pool_size(value);
10777 _impl_._has_bits_[6] |= 0x00000400u;
10780inline ::int32_t SatParameters::_internal_solution_pool_size()
const {
10781 ::google::protobuf::internal::TSanRead(&
_impl_);
10782 return _impl_.solution_pool_size_;
10784inline void SatParameters::_internal_set_solution_pool_size(::int32_t value) {
10785 ::google::protobuf::internal::TSanWrite(&
_impl_);
10786 _impl_.solution_pool_size_ = value;
10791 bool value = (
_impl_._has_bits_[5] & 0x00000080u) != 0;
10795 ::google::protobuf::internal::TSanWrite(&
_impl_);
10796 _impl_.use_rins_lns_ =
true;
10797 _impl_._has_bits_[5] &= ~0x00000080u;
10801 return _internal_use_rins_lns();
10804 _internal_set_use_rins_lns(value);
10805 _impl_._has_bits_[5] |= 0x00000080u;
10808inline bool SatParameters::_internal_use_rins_lns()
const {
10809 ::google::protobuf::internal::TSanRead(&
_impl_);
10810 return _impl_.use_rins_lns_;
10812inline void SatParameters::_internal_set_use_rins_lns(
bool value) {
10813 ::google::protobuf::internal::TSanWrite(&
_impl_);
10814 _impl_.use_rins_lns_ = value;
10819 bool value = (
_impl_._has_bits_[5] & 0x40000000u) != 0;
10823 ::google::protobuf::internal::TSanWrite(&
_impl_);
10824 _impl_.use_feasibility_pump_ =
true;
10825 _impl_._has_bits_[5] &= ~0x40000000u;
10829 return _internal_use_feasibility_pump();
10832 _internal_set_use_feasibility_pump(value);
10833 _impl_._has_bits_[5] |= 0x40000000u;
10836inline bool SatParameters::_internal_use_feasibility_pump()
const {
10837 ::google::protobuf::internal::TSanRead(&
_impl_);
10838 return _impl_.use_feasibility_pump_;
10840inline void SatParameters::_internal_set_use_feasibility_pump(
bool value) {
10841 ::google::protobuf::internal::TSanWrite(&
_impl_);
10842 _impl_.use_feasibility_pump_ = value;
10847 bool value = (
_impl_._has_bits_[6] & 0x80000000u) != 0;
10851 ::google::protobuf::internal::TSanWrite(&
_impl_);
10852 _impl_.use_lb_relax_lns_ =
true;
10853 _impl_._has_bits_[6] &= ~0x80000000u;
10857 return _internal_use_lb_relax_lns();
10860 _internal_set_use_lb_relax_lns(value);
10861 _impl_._has_bits_[6] |= 0x80000000u;
10864inline bool SatParameters::_internal_use_lb_relax_lns()
const {
10865 ::google::protobuf::internal::TSanRead(&
_impl_);
10866 return _impl_.use_lb_relax_lns_;
10868inline void SatParameters::_internal_set_use_lb_relax_lns(
bool value) {
10869 ::google::protobuf::internal::TSanWrite(&
_impl_);
10870 _impl_.use_lb_relax_lns_ = value;
10875 bool value = (
_impl_._has_bits_[7] & 0x08000000u) != 0;
10879 ::google::protobuf::internal::TSanWrite(&
_impl_);
10880 _impl_.lb_relax_num_workers_threshold_ = 16;
10881 _impl_._has_bits_[7] &= ~0x08000000u;
10885 return _internal_lb_relax_num_workers_threshold();
10888 _internal_set_lb_relax_num_workers_threshold(value);
10889 _impl_._has_bits_[7] |= 0x08000000u;
10892inline ::int32_t SatParameters::_internal_lb_relax_num_workers_threshold()
const {
10893 ::google::protobuf::internal::TSanRead(&
_impl_);
10894 return _impl_.lb_relax_num_workers_threshold_;
10896inline void SatParameters::_internal_set_lb_relax_num_workers_threshold(::int32_t value) {
10897 ::google::protobuf::internal::TSanWrite(&
_impl_);
10898 _impl_.lb_relax_num_workers_threshold_ = value;
10903 bool value = (
_impl_._has_bits_[5] & 0x20000000u) != 0;
10907 ::google::protobuf::internal::TSanWrite(&
_impl_);
10908 _impl_.fp_rounding_ = 2;
10909 _impl_._has_bits_[5] &= ~0x20000000u;
10913 return _internal_fp_rounding();
10916 _internal_set_fp_rounding(value);
10917 _impl_._has_bits_[5] |= 0x20000000u;
10920inline ::operations_research::sat::SatParameters_FPRoundingMethod SatParameters::_internal_fp_rounding()
const {
10921 ::google::protobuf::internal::TSanRead(&
_impl_);
10925 ::google::protobuf::internal::TSanWrite(&
_impl_);
10927 assert(::google::protobuf::internal::ValidateEnum(
10929 _impl_.fp_rounding_ = value;
10934 bool value = (
_impl_._has_bits_[1] & 0x00000040u) != 0;
10938 ::google::protobuf::internal::TSanWrite(&
_impl_);
10939 _impl_.diversify_lns_params_ =
false;
10940 _impl_._has_bits_[1] &= ~0x00000040u;
10944 return _internal_diversify_lns_params();
10947 _internal_set_diversify_lns_params(value);
10948 _impl_._has_bits_[1] |= 0x00000040u;
10951inline bool SatParameters::_internal_diversify_lns_params()
const {
10952 ::google::protobuf::internal::TSanRead(&
_impl_);
10953 return _impl_.diversify_lns_params_;
10955inline void SatParameters::_internal_set_diversify_lns_params(
bool value) {
10956 ::google::protobuf::internal::TSanWrite(&
_impl_);
10957 _impl_.diversify_lns_params_ = value;
10962 bool value = (
_impl_._has_bits_[0] & 0x20000000u) != 0;
10966 ::google::protobuf::internal::TSanWrite(&
_impl_);
10967 _impl_.randomize_search_ =
false;
10968 _impl_._has_bits_[0] &= ~0x20000000u;
10972 return _internal_randomize_search();
10975 _internal_set_randomize_search(value);
10976 _impl_._has_bits_[0] |= 0x20000000u;
10979inline bool SatParameters::_internal_randomize_search()
const {
10980 ::google::protobuf::internal::TSanRead(&
_impl_);
10981 return _impl_.randomize_search_;
10983inline void SatParameters::_internal_set_randomize_search(
bool value) {
10984 ::google::protobuf::internal::TSanWrite(&
_impl_);
10985 _impl_.randomize_search_ = value;
10990 bool value = (
_impl_._has_bits_[0] & 0x80000000u) != 0;
10994 ::google::protobuf::internal::TSanWrite(&
_impl_);
10995 _impl_.search_random_variable_pool_size_ = ::int64_t{0};
10996 _impl_._has_bits_[0] &= ~0x80000000u;
11000 return _internal_search_random_variable_pool_size();
11003 _internal_set_search_random_variable_pool_size(value);
11004 _impl_._has_bits_[0] |= 0x80000000u;
11007inline ::int64_t SatParameters::_internal_search_random_variable_pool_size()
const {
11008 ::google::protobuf::internal::TSanRead(&
_impl_);
11009 return _impl_.search_random_variable_pool_size_;
11011inline void SatParameters::_internal_set_search_random_variable_pool_size(::int64_t value) {
11012 ::google::protobuf::internal::TSanWrite(&
_impl_);
11013 _impl_.search_random_variable_pool_size_ = value;
11018 bool value = (
_impl_._has_bits_[2] & 0x00008000u) != 0;
11022 ::google::protobuf::internal::TSanWrite(&
_impl_);
11023 _impl_.push_all_tasks_toward_start_ =
false;
11024 _impl_._has_bits_[2] &= ~0x00008000u;
11028 return _internal_push_all_tasks_toward_start();
11031 _internal_set_push_all_tasks_toward_start(value);
11032 _impl_._has_bits_[2] |= 0x00008000u;
11035inline bool SatParameters::_internal_push_all_tasks_toward_start()
const {
11036 ::google::protobuf::internal::TSanRead(&
_impl_);
11037 return _impl_.push_all_tasks_toward_start_;
11039inline void SatParameters::_internal_set_push_all_tasks_toward_start(
bool value) {
11040 ::google::protobuf::internal::TSanWrite(&
_impl_);
11041 _impl_.push_all_tasks_toward_start_ = value;
11046 bool value = (
_impl_._has_bits_[1] & 0x00000001u) != 0;
11050 ::google::protobuf::internal::TSanWrite(&
_impl_);
11051 _impl_.use_optional_variables_ =
false;
11052 _impl_._has_bits_[1] &= ~0x00000001u;
11056 return _internal_use_optional_variables();
11059 _internal_set_use_optional_variables(value);
11060 _impl_._has_bits_[1] |= 0x00000001u;
11063inline bool SatParameters::_internal_use_optional_variables()
const {
11064 ::google::protobuf::internal::TSanRead(&
_impl_);
11065 return _impl_.use_optional_variables_;
11067inline void SatParameters::_internal_set_use_optional_variables(
bool value) {
11068 ::google::protobuf::internal::TSanWrite(&
_impl_);
11069 _impl_.use_optional_variables_ = value;
11074 bool value = (
_impl_._has_bits_[4] & 0x02000000u) != 0;
11078 ::google::protobuf::internal::TSanWrite(&
_impl_);
11079 _impl_.use_exact_lp_reason_ =
true;
11080 _impl_._has_bits_[4] &= ~0x02000000u;
11084 return _internal_use_exact_lp_reason();
11087 _internal_set_use_exact_lp_reason(value);
11088 _impl_._has_bits_[4] |= 0x02000000u;
11091inline bool SatParameters::_internal_use_exact_lp_reason()
const {
11092 ::google::protobuf::internal::TSanRead(&
_impl_);
11093 return _impl_.use_exact_lp_reason_;
11095inline void SatParameters::_internal_set_use_exact_lp_reason(
bool value) {
11096 ::google::protobuf::internal::TSanWrite(&
_impl_);
11097 _impl_.use_exact_lp_reason_ = value;
11102 bool value = (
_impl_._has_bits_[1] & 0x00000008u) != 0;
11106 ::google::protobuf::internal::TSanWrite(&
_impl_);
11107 _impl_.use_combined_no_overlap_ =
false;
11108 _impl_._has_bits_[1] &= ~0x00000008u;
11112 return _internal_use_combined_no_overlap();
11115 _internal_set_use_combined_no_overlap(value);
11116 _impl_._has_bits_[1] |= 0x00000008u;
11119inline bool SatParameters::_internal_use_combined_no_overlap()
const {
11120 ::google::protobuf::internal::TSanRead(&
_impl_);
11121 return _impl_.use_combined_no_overlap_;
11123inline void SatParameters::_internal_set_use_combined_no_overlap(
bool value) {
11124 ::google::protobuf::internal::TSanWrite(&
_impl_);
11125 _impl_.use_combined_no_overlap_ = value;
11130 bool value = (
_impl_._has_bits_[7] & 0x00001000u) != 0;
11134 ::google::protobuf::internal::TSanWrite(&
_impl_);
11135 _impl_.at_most_one_max_expansion_size_ = 3;
11136 _impl_._has_bits_[7] &= ~0x00001000u;
11140 return _internal_at_most_one_max_expansion_size();
11143 _internal_set_at_most_one_max_expansion_size(value);
11144 _impl_._has_bits_[7] |= 0x00001000u;
11147inline ::int32_t SatParameters::_internal_at_most_one_max_expansion_size()
const {
11148 ::google::protobuf::internal::TSanRead(&
_impl_);
11149 return _impl_.at_most_one_max_expansion_size_;
11151inline void SatParameters::_internal_set_at_most_one_max_expansion_size(::int32_t value) {
11152 ::google::protobuf::internal::TSanWrite(&
_impl_);
11153 _impl_.at_most_one_max_expansion_size_ = value;
11158 bool value = (
_impl_._has_bits_[5] & 0x00080000u) != 0;
11162 ::google::protobuf::internal::TSanWrite(&
_impl_);
11163 _impl_.catch_sigint_signal_ =
true;
11164 _impl_._has_bits_[5] &= ~0x00080000u;
11168 return _internal_catch_sigint_signal();
11171 _internal_set_catch_sigint_signal(value);
11172 _impl_._has_bits_[5] |= 0x00080000u;
11175inline bool SatParameters::_internal_catch_sigint_signal()
const {
11176 ::google::protobuf::internal::TSanRead(&
_impl_);
11177 return _impl_.catch_sigint_signal_;
11179inline void SatParameters::_internal_set_catch_sigint_signal(
bool value) {
11180 ::google::protobuf::internal::TSanWrite(&
_impl_);
11181 _impl_.catch_sigint_signal_ = value;
11186 bool value = (
_impl_._has_bits_[5] & 0x00100000u) != 0;
11190 ::google::protobuf::internal::TSanWrite(&
_impl_);
11191 _impl_.use_implied_bounds_ =
true;
11192 _impl_._has_bits_[5] &= ~0x00100000u;
11196 return _internal_use_implied_bounds();
11199 _internal_set_use_implied_bounds(value);
11200 _impl_._has_bits_[5] |= 0x00100000u;
11203inline bool SatParameters::_internal_use_implied_bounds()
const {
11204 ::google::protobuf::internal::TSanRead(&
_impl_);
11205 return _impl_.use_implied_bounds_;
11207inline void SatParameters::_internal_set_use_implied_bounds(
bool value) {
11208 ::google::protobuf::internal::TSanWrite(&
_impl_);
11209 _impl_.use_implied_bounds_ = value;
11214 bool value = (
_impl_._has_bits_[1] & 0x00010000u) != 0;
11218 ::google::protobuf::internal::TSanWrite(&
_impl_);
11219 _impl_.polish_lp_solution_ =
false;
11220 _impl_._has_bits_[1] &= ~0x00010000u;
11224 return _internal_polish_lp_solution();
11227 _internal_set_polish_lp_solution(value);
11228 _impl_._has_bits_[1] |= 0x00010000u;
11231inline bool SatParameters::_internal_polish_lp_solution()
const {
11232 ::google::protobuf::internal::TSanRead(&
_impl_);
11233 return _impl_.polish_lp_solution_;
11235inline void SatParameters::_internal_set_polish_lp_solution(
bool value) {
11236 ::google::protobuf::internal::TSanWrite(&
_impl_);
11237 _impl_.polish_lp_solution_ = value;
11242 bool value = (
_impl_._has_bits_[7] & 0x00000200u) != 0;
11246 ::google::protobuf::internal::TSanWrite(&
_impl_);
11247 _impl_.lp_primal_tolerance_ = 1e-07;
11248 _impl_._has_bits_[7] &= ~0x00000200u;
11252 return _internal_lp_primal_tolerance();
11255 _internal_set_lp_primal_tolerance(value);
11256 _impl_._has_bits_[7] |= 0x00000200u;
11259inline double SatParameters::_internal_lp_primal_tolerance()
const {
11260 ::google::protobuf::internal::TSanRead(&
_impl_);
11261 return _impl_.lp_primal_tolerance_;
11263inline void SatParameters::_internal_set_lp_primal_tolerance(
double value) {
11264 ::google::protobuf::internal::TSanWrite(&
_impl_);
11265 _impl_.lp_primal_tolerance_ = value;
11270 bool value = (
_impl_._has_bits_[7] & 0x00000400u) != 0;
11274 ::google::protobuf::internal::TSanWrite(&
_impl_);
11275 _impl_.lp_dual_tolerance_ = 1e-07;
11276 _impl_._has_bits_[7] &= ~0x00000400u;
11280 return _internal_lp_dual_tolerance();
11283 _internal_set_lp_dual_tolerance(value);
11284 _impl_._has_bits_[7] |= 0x00000400u;
11287inline double SatParameters::_internal_lp_dual_tolerance()
const {
11288 ::google::protobuf::internal::TSanRead(&
_impl_);
11289 return _impl_.lp_dual_tolerance_;
11291inline void SatParameters::_internal_set_lp_dual_tolerance(
double value) {
11292 ::google::protobuf::internal::TSanWrite(&
_impl_);
11293 _impl_.lp_dual_tolerance_ = value;
11298 bool value = (
_impl_._has_bits_[6] & 0x00000010u) != 0;
11302 ::google::protobuf::internal::TSanWrite(&
_impl_);
11303 _impl_.convert_intervals_ =
true;
11304 _impl_._has_bits_[6] &= ~0x00000010u;
11308 return _internal_convert_intervals();
11311 _internal_set_convert_intervals(value);
11312 _impl_._has_bits_[6] |= 0x00000010u;
11315inline bool SatParameters::_internal_convert_intervals()
const {
11316 ::google::protobuf::internal::TSanRead(&
_impl_);
11317 return _impl_.convert_intervals_;
11319inline void SatParameters::_internal_set_convert_intervals(
bool value) {
11320 ::google::protobuf::internal::TSanWrite(&
_impl_);
11321 _impl_.convert_intervals_ = value;
11326 bool value = (
_impl_._has_bits_[6] & 0x00000008u) != 0;
11330 ::google::protobuf::internal::TSanWrite(&
_impl_);
11331 _impl_.symmetry_level_ = 2;
11332 _impl_._has_bits_[6] &= ~0x00000008u;
11336 return _internal_symmetry_level();
11339 _internal_set_symmetry_level(value);
11340 _impl_._has_bits_[6] |= 0x00000008u;
11343inline ::int32_t SatParameters::_internal_symmetry_level()
const {
11344 ::google::protobuf::internal::TSanRead(&
_impl_);
11345 return _impl_.symmetry_level_;
11347inline void SatParameters::_internal_set_symmetry_level(::int32_t value) {
11348 ::google::protobuf::internal::TSanWrite(&
_impl_);
11349 _impl_.symmetry_level_ = value;
11354 bool value = (
_impl_._has_bits_[2] & 0x80000000u) != 0;
11358 ::google::protobuf::internal::TSanWrite(&
_impl_);
11359 _impl_.use_symmetry_in_lp_ =
false;
11360 _impl_._has_bits_[2] &= ~0x80000000u;
11364 return _internal_use_symmetry_in_lp();
11367 _internal_set_use_symmetry_in_lp(value);
11368 _impl_._has_bits_[2] |= 0x80000000u;
11371inline bool SatParameters::_internal_use_symmetry_in_lp()
const {
11372 ::google::protobuf::internal::TSanRead(&
_impl_);
11373 return _impl_.use_symmetry_in_lp_;
11375inline void SatParameters::_internal_set_use_symmetry_in_lp(
bool value) {
11376 ::google::protobuf::internal::TSanWrite(&
_impl_);
11377 _impl_.use_symmetry_in_lp_ = value;
11382 bool value = (
_impl_._has_bits_[3] & 0x00000001u) != 0;
11386 ::google::protobuf::internal::TSanWrite(&
_impl_);
11387 _impl_.keep_symmetry_in_presolve_ =
false;
11388 _impl_._has_bits_[3] &= ~0x00000001u;
11392 return _internal_keep_symmetry_in_presolve();
11395 _internal_set_keep_symmetry_in_presolve(value);
11396 _impl_._has_bits_[3] |= 0x00000001u;
11399inline bool SatParameters::_internal_keep_symmetry_in_presolve()
const {
11400 ::google::protobuf::internal::TSanRead(&
_impl_);
11401 return _impl_.keep_symmetry_in_presolve_;
11403inline void SatParameters::_internal_set_keep_symmetry_in_presolve(
bool value) {
11404 ::google::protobuf::internal::TSanWrite(&
_impl_);
11405 _impl_.keep_symmetry_in_presolve_ = value;
11410 bool value = (
_impl_._has_bits_[8] & 0x00000002u) != 0;
11414 ::google::protobuf::internal::TSanWrite(&
_impl_);
11415 _impl_.symmetry_detection_deterministic_time_limit_ = 1;
11416 _impl_._has_bits_[8] &= ~0x00000002u;
11420 return _internal_symmetry_detection_deterministic_time_limit();
11423 _internal_set_symmetry_detection_deterministic_time_limit(value);
11424 _impl_._has_bits_[8] |= 0x00000002u;
11427inline double SatParameters::_internal_symmetry_detection_deterministic_time_limit()
const {
11428 ::google::protobuf::internal::TSanRead(&
_impl_);
11429 return _impl_.symmetry_detection_deterministic_time_limit_;
11431inline void SatParameters::_internal_set_symmetry_detection_deterministic_time_limit(
double value) {
11432 ::google::protobuf::internal::TSanWrite(&
_impl_);
11433 _impl_.symmetry_detection_deterministic_time_limit_ = value;
11438 bool value = (
_impl_._has_bits_[6] & 0x00080000u) != 0;
11442 ::google::protobuf::internal::TSanWrite(&
_impl_);
11443 _impl_.new_linear_propagation_ =
true;
11444 _impl_._has_bits_[6] &= ~0x00080000u;
11448 return _internal_new_linear_propagation();
11451 _internal_set_new_linear_propagation(value);
11452 _impl_._has_bits_[6] |= 0x00080000u;
11455inline bool SatParameters::_internal_new_linear_propagation()
const {
11456 ::google::protobuf::internal::TSanRead(&
_impl_);
11457 return _impl_.new_linear_propagation_;
11459inline void SatParameters::_internal_set_new_linear_propagation(
bool value) {
11460 ::google::protobuf::internal::TSanWrite(&
_impl_);
11461 _impl_.new_linear_propagation_ = value;
11466 bool value = (
_impl_._has_bits_[7] & 0x00000008u) != 0;
11470 ::google::protobuf::internal::TSanWrite(&
_impl_);
11471 _impl_.linear_split_size_ = 100;
11472 _impl_._has_bits_[7] &= ~0x00000008u;
11476 return _internal_linear_split_size();
11479 _internal_set_linear_split_size(value);
11480 _impl_._has_bits_[7] |= 0x00000008u;
11483inline ::int32_t SatParameters::_internal_linear_split_size()
const {
11484 ::google::protobuf::internal::TSanRead(&
_impl_);
11485 return _impl_.linear_split_size_;
11487inline void SatParameters::_internal_set_linear_split_size(::int32_t value) {
11488 ::google::protobuf::internal::TSanWrite(&
_impl_);
11489 _impl_.linear_split_size_ = value;
11494 bool value = (
_impl_._has_bits_[4] & 0x00080000u) != 0;
11498 ::google::protobuf::internal::TSanWrite(&
_impl_);
11499 _impl_.linearization_level_ = 1;
11500 _impl_._has_bits_[4] &= ~0x00080000u;
11504 return _internal_linearization_level();
11507 _internal_set_linearization_level(value);
11508 _impl_._has_bits_[4] |= 0x00080000u;
11511inline ::int32_t SatParameters::_internal_linearization_level()
const {
11512 ::google::protobuf::internal::TSanRead(&
_impl_);
11513 return _impl_.linearization_level_;
11515inline void SatParameters::_internal_set_linearization_level(::int32_t value) {
11516 ::google::protobuf::internal::TSanWrite(&
_impl_);
11517 _impl_.linearization_level_ = value;
11522 bool value = (
_impl_._has_bits_[4] & 0x04000000u) != 0;
11526 ::google::protobuf::internal::TSanWrite(&
_impl_);
11527 _impl_.boolean_encoding_level_ = 1;
11528 _impl_._has_bits_[4] &= ~0x04000000u;
11532 return _internal_boolean_encoding_level();
11535 _internal_set_boolean_encoding_level(value);
11536 _impl_._has_bits_[4] |= 0x04000000u;
11539inline ::int32_t SatParameters::_internal_boolean_encoding_level()
const {
11540 ::google::protobuf::internal::TSanRead(&
_impl_);
11541 return _impl_.boolean_encoding_level_;
11543inline void SatParameters::_internal_set_boolean_encoding_level(::int32_t value) {
11544 ::google::protobuf::internal::TSanWrite(&
_impl_);
11545 _impl_.boolean_encoding_level_ = value;
11550 bool value = (
_impl_._has_bits_[6] & 0x00000100u) != 0;
11554 ::google::protobuf::internal::TSanWrite(&
_impl_);
11555 _impl_.max_domain_size_when_encoding_eq_neq_constraints_ = 16;
11556 _impl_._has_bits_[6] &= ~0x00000100u;
11560 return _internal_max_domain_size_when_encoding_eq_neq_constraints();
11563 _internal_set_max_domain_size_when_encoding_eq_neq_constraints(value);
11564 _impl_._has_bits_[6] |= 0x00000100u;
11567inline ::int32_t SatParameters::_internal_max_domain_size_when_encoding_eq_neq_constraints()
const {
11568 ::google::protobuf::internal::TSanRead(&
_impl_);
11569 return _impl_.max_domain_size_when_encoding_eq_neq_constraints_;
11571inline void SatParameters::_internal_set_max_domain_size_when_encoding_eq_neq_constraints(::int32_t value) {
11572 ::google::protobuf::internal::TSanWrite(&
_impl_);
11573 _impl_.max_domain_size_when_encoding_eq_neq_constraints_ = value;
11578 bool value = (
_impl_._has_bits_[4] & 0x00100000u) != 0;
11582 ::google::protobuf::internal::TSanWrite(&
_impl_);
11583 _impl_.max_num_cuts_ = 10000;
11584 _impl_._has_bits_[4] &= ~0x00100000u;
11588 return _internal_max_num_cuts();
11591 _internal_set_max_num_cuts(value);
11592 _impl_._has_bits_[4] |= 0x00100000u;
11595inline ::int32_t SatParameters::_internal_max_num_cuts()
const {
11596 ::google::protobuf::internal::TSanRead(&
_impl_);
11597 return _impl_.max_num_cuts_;
11599inline void SatParameters::_internal_set_max_num_cuts(::int32_t value) {
11600 ::google::protobuf::internal::TSanWrite(&
_impl_);
11601 _impl_.max_num_cuts_ = value;
11606 bool value = (
_impl_._has_bits_[6] & 0x00000800u) != 0;
11610 ::google::protobuf::internal::TSanWrite(&
_impl_);
11612 _impl_._has_bits_[6] &= ~0x00000800u;
11616 return _internal_cut_level();
11619 _internal_set_cut_level(value);
11620 _impl_._has_bits_[6] |= 0x00000800u;
11623inline ::int32_t SatParameters::_internal_cut_level()
const {
11624 ::google::protobuf::internal::TSanRead(&
_impl_);
11625 return _impl_.cut_level_;
11627inline void SatParameters::_internal_set_cut_level(::int32_t value) {
11628 ::google::protobuf::internal::TSanWrite(&
_impl_);
11629 _impl_.cut_level_ = value;
11634 bool value = (
_impl_._has_bits_[0] & 0x04000000u) != 0;
11638 ::google::protobuf::internal::TSanWrite(&
_impl_);
11639 _impl_.only_add_cuts_at_level_zero_ =
false;
11640 _impl_._has_bits_[0] &= ~0x04000000u;
11644 return _internal_only_add_cuts_at_level_zero();
11647 _internal_set_only_add_cuts_at_level_zero(value);
11648 _impl_._has_bits_[0] |= 0x04000000u;
11651inline bool SatParameters::_internal_only_add_cuts_at_level_zero()
const {
11652 ::google::protobuf::internal::TSanRead(&
_impl_);
11653 return _impl_.only_add_cuts_at_level_zero_;
11655inline void SatParameters::_internal_set_only_add_cuts_at_level_zero(
bool value) {
11656 ::google::protobuf::internal::TSanWrite(&
_impl_);
11657 _impl_.only_add_cuts_at_level_zero_ = value;
11662 bool value = (
_impl_._has_bits_[1] & 0x10000000u) != 0;
11666 ::google::protobuf::internal::TSanWrite(&
_impl_);
11667 _impl_.add_objective_cut_ =
false;
11668 _impl_._has_bits_[1] &= ~0x10000000u;
11672 return _internal_add_objective_cut();
11675 _internal_set_add_objective_cut(value);
11676 _impl_._has_bits_[1] |= 0x10000000u;
11679inline bool SatParameters::_internal_add_objective_cut()
const {
11680 ::google::protobuf::internal::TSanRead(&
_impl_);
11681 return _impl_.add_objective_cut_;
11683inline void SatParameters::_internal_set_add_objective_cut(
bool value) {
11684 ::google::protobuf::internal::TSanWrite(&
_impl_);
11685 _impl_.add_objective_cut_ = value;
11690 bool value = (
_impl_._has_bits_[5] & 0x00000020u) != 0;
11694 ::google::protobuf::internal::TSanWrite(&
_impl_);
11695 _impl_.add_cg_cuts_ =
true;
11696 _impl_._has_bits_[5] &= ~0x00000020u;
11700 return _internal_add_cg_cuts();
11703 _internal_set_add_cg_cuts(value);
11704 _impl_._has_bits_[5] |= 0x00000020u;
11707inline bool SatParameters::_internal_add_cg_cuts()
const {
11708 ::google::protobuf::internal::TSanRead(&
_impl_);
11709 return _impl_.add_cg_cuts_;
11711inline void SatParameters::_internal_set_add_cg_cuts(
bool value) {
11712 ::google::protobuf::internal::TSanWrite(&
_impl_);
11713 _impl_.add_cg_cuts_ = value;
11718 bool value = (
_impl_._has_bits_[5] & 0x00000040u) != 0;
11722 ::google::protobuf::internal::TSanWrite(&
_impl_);
11723 _impl_.add_mir_cuts_ =
true;
11724 _impl_._has_bits_[5] &= ~0x00000040u;
11728 return _internal_add_mir_cuts();
11731 _internal_set_add_mir_cuts(value);
11732 _impl_._has_bits_[5] |= 0x00000040u;
11735inline bool SatParameters::_internal_add_mir_cuts()
const {
11736 ::google::protobuf::internal::TSanRead(&
_impl_);
11737 return _impl_.add_mir_cuts_;
11739inline void SatParameters::_internal_set_add_mir_cuts(
bool value) {
11740 ::google::protobuf::internal::TSanWrite(&
_impl_);
11741 _impl_.add_mir_cuts_ = value;
11746 bool value = (
_impl_._has_bits_[6] & 0x00000001u) != 0;
11750 ::google::protobuf::internal::TSanWrite(&
_impl_);
11751 _impl_.add_zero_half_cuts_ =
true;
11752 _impl_._has_bits_[6] &= ~0x00000001u;
11756 return _internal_add_zero_half_cuts();
11759 _internal_set_add_zero_half_cuts(value);
11760 _impl_._has_bits_[6] |= 0x00000001u;
11763inline bool SatParameters::_internal_add_zero_half_cuts()
const {
11764 ::google::protobuf::internal::TSanRead(&
_impl_);
11765 return _impl_.add_zero_half_cuts_;
11767inline void SatParameters::_internal_set_add_zero_half_cuts(
bool value) {
11768 ::google::protobuf::internal::TSanWrite(&
_impl_);
11769 _impl_.add_zero_half_cuts_ = value;
11774 bool value = (
_impl_._has_bits_[6] & 0x00000002u) != 0;
11778 ::google::protobuf::internal::TSanWrite(&
_impl_);
11779 _impl_.add_clique_cuts_ =
true;
11780 _impl_._has_bits_[6] &= ~0x00000002u;
11784 return _internal_add_clique_cuts();
11787 _internal_set_add_clique_cuts(value);
11788 _impl_._has_bits_[6] |= 0x00000002u;
11791inline bool SatParameters::_internal_add_clique_cuts()
const {
11792 ::google::protobuf::internal::TSanRead(&
_impl_);
11793 return _impl_.add_clique_cuts_;
11795inline void SatParameters::_internal_set_add_clique_cuts(
bool value) {
11796 ::google::protobuf::internal::TSanWrite(&
_impl_);
11797 _impl_.add_clique_cuts_ = value;
11802 bool value = (
_impl_._has_bits_[7] & 0x00020000u) != 0;
11806 ::google::protobuf::internal::TSanWrite(&
_impl_);
11807 _impl_.add_rlt_cuts_ =
true;
11808 _impl_._has_bits_[7] &= ~0x00020000u;
11812 return _internal_add_rlt_cuts();
11815 _internal_set_add_rlt_cuts(value);
11816 _impl_._has_bits_[7] |= 0x00020000u;
11819inline bool SatParameters::_internal_add_rlt_cuts()
const {
11820 ::google::protobuf::internal::TSanRead(&
_impl_);
11821 return _impl_.add_rlt_cuts_;
11823inline void SatParameters::_internal_set_add_rlt_cuts(
bool value) {
11824 ::google::protobuf::internal::TSanWrite(&
_impl_);
11825 _impl_.add_rlt_cuts_ = value;
11830 bool value = (
_impl_._has_bits_[5] & 0x00040000u) != 0;
11834 ::google::protobuf::internal::TSanWrite(&
_impl_);
11835 _impl_.max_all_diff_cut_size_ = 64;
11836 _impl_._has_bits_[5] &= ~0x00040000u;
11840 return _internal_max_all_diff_cut_size();
11843 _internal_set_max_all_diff_cut_size(value);
11844 _impl_._has_bits_[5] |= 0x00040000u;
11847inline ::int32_t SatParameters::_internal_max_all_diff_cut_size()
const {
11848 ::google::protobuf::internal::TSanRead(&
_impl_);
11849 return _impl_.max_all_diff_cut_size_;
11851inline void SatParameters::_internal_set_max_all_diff_cut_size(::int32_t value) {
11852 ::google::protobuf::internal::TSanWrite(&
_impl_);
11853 _impl_.max_all_diff_cut_size_ = value;
11858 bool value = (
_impl_._has_bits_[5] & 0x00200000u) != 0;
11862 ::google::protobuf::internal::TSanWrite(&
_impl_);
11863 _impl_.add_lin_max_cuts_ =
true;
11864 _impl_._has_bits_[5] &= ~0x00200000u;
11868 return _internal_add_lin_max_cuts();
11871 _internal_set_add_lin_max_cuts(value);
11872 _impl_._has_bits_[5] |= 0x00200000u;
11875inline bool SatParameters::_internal_add_lin_max_cuts()
const {
11876 ::google::protobuf::internal::TSanRead(&
_impl_);
11877 return _impl_.add_lin_max_cuts_;
11879inline void SatParameters::_internal_set_add_lin_max_cuts(
bool value) {
11880 ::google::protobuf::internal::TSanWrite(&
_impl_);
11881 _impl_.add_lin_max_cuts_ = value;
11886 bool value = (
_impl_._has_bits_[5] & 0x00000002u) != 0;
11890 ::google::protobuf::internal::TSanWrite(&
_impl_);
11891 _impl_.max_integer_rounding_scaling_ = 600;
11892 _impl_._has_bits_[5] &= ~0x00000002u;
11896 return _internal_max_integer_rounding_scaling();
11899 _internal_set_max_integer_rounding_scaling(value);
11900 _impl_._has_bits_[5] |= 0x00000002u;
11903inline ::int32_t SatParameters::_internal_max_integer_rounding_scaling()
const {
11904 ::google::protobuf::internal::TSanRead(&
_impl_);
11905 return _impl_.max_integer_rounding_scaling_;
11907inline void SatParameters::_internal_set_max_integer_rounding_scaling(::int32_t value) {
11908 ::google::protobuf::internal::TSanWrite(&
_impl_);
11909 _impl_.max_integer_rounding_scaling_ = value;
11914 bool value = (
_impl_._has_bits_[4] & 0x10000000u) != 0;
11918 ::google::protobuf::internal::TSanWrite(&
_impl_);
11919 _impl_.add_lp_constraints_lazily_ =
true;
11920 _impl_._has_bits_[4] &= ~0x10000000u;
11924 return _internal_add_lp_constraints_lazily();
11927 _internal_set_add_lp_constraints_lazily(value);
11928 _impl_._has_bits_[4] |= 0x10000000u;
11931inline bool SatParameters::_internal_add_lp_constraints_lazily()
const {
11932 ::google::protobuf::internal::TSanRead(&
_impl_);
11933 return _impl_.add_lp_constraints_lazily_;
11935inline void SatParameters::_internal_set_add_lp_constraints_lazily(
bool value) {
11936 ::google::protobuf::internal::TSanWrite(&
_impl_);
11937 _impl_.add_lp_constraints_lazily_ = value;
11942 bool value = (
_impl_._has_bits_[6] & 0x00800000u) != 0;
11946 ::google::protobuf::internal::TSanWrite(&
_impl_);
11947 _impl_.root_lp_iterations_ = 2000;
11948 _impl_._has_bits_[6] &= ~0x00800000u;
11952 return _internal_root_lp_iterations();
11955 _internal_set_root_lp_iterations(value);
11956 _impl_._has_bits_[6] |= 0x00800000u;
11959inline ::int32_t SatParameters::_internal_root_lp_iterations()
const {
11960 ::google::protobuf::internal::TSanRead(&
_impl_);
11961 return _impl_.root_lp_iterations_;
11963inline void SatParameters::_internal_set_root_lp_iterations(::int32_t value) {
11964 ::google::protobuf::internal::TSanWrite(&
_impl_);
11965 _impl_.root_lp_iterations_ = value;
11970 bool value = (
_impl_._has_bits_[5] & 0x00000001u) != 0;
11974 ::google::protobuf::internal::TSanWrite(&
_impl_);
11975 _impl_.min_orthogonality_for_lp_constraints_ = 0.05;
11976 _impl_._has_bits_[5] &= ~0x00000001u;
11980 return _internal_min_orthogonality_for_lp_constraints();
11983 _internal_set_min_orthogonality_for_lp_constraints(value);
11984 _impl_._has_bits_[5] |= 0x00000001u;
11987inline double SatParameters::_internal_min_orthogonality_for_lp_constraints()
const {
11988 ::google::protobuf::internal::TSanRead(&
_impl_);
11989 return _impl_.min_orthogonality_for_lp_constraints_;
11991inline void SatParameters::_internal_set_min_orthogonality_for_lp_constraints(
double value) {
11992 ::google::protobuf::internal::TSanWrite(&
_impl_);
11993 _impl_.min_orthogonality_for_lp_constraints_ = value;
11998 bool value = (
_impl_._has_bits_[5] & 0x02000000u) != 0;
12002 ::google::protobuf::internal::TSanWrite(&
_impl_);
12003 _impl_.max_cut_rounds_at_level_zero_ = 1;
12004 _impl_._has_bits_[5] &= ~0x02000000u;
12008 return _internal_max_cut_rounds_at_level_zero();
12011 _internal_set_max_cut_rounds_at_level_zero(value);
12012 _impl_._has_bits_[5] |= 0x02000000u;
12015inline ::int32_t SatParameters::_internal_max_cut_rounds_at_level_zero()
const {
12016 ::google::protobuf::internal::TSanRead(&
_impl_);
12017 return _impl_.max_cut_rounds_at_level_zero_;
12019inline void SatParameters::_internal_set_max_cut_rounds_at_level_zero(::int32_t value) {
12020 ::google::protobuf::internal::TSanWrite(&
_impl_);
12021 _impl_.max_cut_rounds_at_level_zero_ = value;
12026 bool value = (
_impl_._has_bits_[5] & 0x00000004u) != 0;
12030 ::google::protobuf::internal::TSanWrite(&
_impl_);
12031 _impl_.max_consecutive_inactive_count_ = 100;
12032 _impl_._has_bits_[5] &= ~0x00000004u;
12036 return _internal_max_consecutive_inactive_count();
12039 _internal_set_max_consecutive_inactive_count(value);
12040 _impl_._has_bits_[5] |= 0x00000004u;
12043inline ::int32_t SatParameters::_internal_max_consecutive_inactive_count()
const {
12044 ::google::protobuf::internal::TSanRead(&
_impl_);
12045 return _impl_.max_consecutive_inactive_count_;
12047inline void SatParameters::_internal_set_max_consecutive_inactive_count(::int32_t value) {
12048 ::google::protobuf::internal::TSanWrite(&
_impl_);
12049 _impl_.max_consecutive_inactive_count_ = value;
12054 bool value = (
_impl_._has_bits_[5] & 0x01000000u) != 0;
12058 ::google::protobuf::internal::TSanWrite(&
_impl_);
12059 _impl_.cut_max_active_count_value_ = 10000000000;
12060 _impl_._has_bits_[5] &= ~0x01000000u;
12064 return _internal_cut_max_active_count_value();
12067 _internal_set_cut_max_active_count_value(value);
12068 _impl_._has_bits_[5] |= 0x01000000u;
12071inline double SatParameters::_internal_cut_max_active_count_value()
const {
12072 ::google::protobuf::internal::TSanRead(&
_impl_);
12073 return _impl_.cut_max_active_count_value_;
12075inline void SatParameters::_internal_set_cut_max_active_count_value(
double value) {
12076 ::google::protobuf::internal::TSanWrite(&
_impl_);
12077 _impl_.cut_max_active_count_value_ = value;
12082 bool value = (
_impl_._has_bits_[5] & 0x08000000u) != 0;
12086 ::google::protobuf::internal::TSanWrite(&
_impl_);
12087 _impl_.cut_active_count_decay_ = 0.8;
12088 _impl_._has_bits_[5] &= ~0x08000000u;
12092 return _internal_cut_active_count_decay();
12095 _internal_set_cut_active_count_decay(value);
12096 _impl_._has_bits_[5] |= 0x08000000u;
12099inline double SatParameters::_internal_cut_active_count_decay()
const {
12100 ::google::protobuf::internal::TSanRead(&
_impl_);
12101 return _impl_.cut_active_count_decay_;
12103inline void SatParameters::_internal_set_cut_active_count_decay(
double value) {
12104 ::google::protobuf::internal::TSanWrite(&
_impl_);
12105 _impl_.cut_active_count_decay_ = value;
12110 bool value = (
_impl_._has_bits_[5] & 0x04000000u) != 0;
12114 ::google::protobuf::internal::TSanWrite(&
_impl_);
12115 _impl_.cut_cleanup_target_ = 1000;
12116 _impl_._has_bits_[5] &= ~0x04000000u;
12120 return _internal_cut_cleanup_target();
12123 _internal_set_cut_cleanup_target(value);
12124 _impl_._has_bits_[5] |= 0x04000000u;
12127inline ::int32_t SatParameters::_internal_cut_cleanup_target()
const {
12128 ::google::protobuf::internal::TSanRead(&
_impl_);
12129 return _impl_.cut_cleanup_target_;
12131inline void SatParameters::_internal_set_cut_cleanup_target(::int32_t value) {
12132 ::google::protobuf::internal::TSanWrite(&
_impl_);
12133 _impl_.cut_cleanup_target_ = value;
12138 bool value = (
_impl_._has_bits_[5] & 0x00000010u) != 0;
12142 ::google::protobuf::internal::TSanWrite(&
_impl_);
12143 _impl_.new_constraints_batch_size_ = 50;
12144 _impl_._has_bits_[5] &= ~0x00000010u;
12148 return _internal_new_constraints_batch_size();
12151 _internal_set_new_constraints_batch_size(value);
12152 _impl_._has_bits_[5] |= 0x00000010u;
12155inline ::int32_t SatParameters::_internal_new_constraints_batch_size()
const {
12156 ::google::protobuf::internal::TSanRead(&
_impl_);
12157 return _impl_.new_constraints_batch_size_;
12159inline void SatParameters::_internal_set_new_constraints_batch_size(::int32_t value) {
12160 ::google::protobuf::internal::TSanWrite(&
_impl_);
12161 _impl_.new_constraints_batch_size_ = value;
12166 bool value = (
_impl_._has_bits_[4] & 0x00400000u) != 0;
12170 ::google::protobuf::internal::TSanWrite(&
_impl_);
12171 _impl_.exploit_integer_lp_solution_ =
true;
12172 _impl_._has_bits_[4] &= ~0x00400000u;
12176 return _internal_exploit_integer_lp_solution();
12179 _internal_set_exploit_integer_lp_solution(value);
12180 _impl_._has_bits_[4] |= 0x00400000u;
12183inline bool SatParameters::_internal_exploit_integer_lp_solution()
const {
12184 ::google::protobuf::internal::TSanRead(&
_impl_);
12185 return _impl_.exploit_integer_lp_solution_;
12187inline void SatParameters::_internal_set_exploit_integer_lp_solution(
bool value) {
12188 ::google::protobuf::internal::TSanWrite(&
_impl_);
12189 _impl_.exploit_integer_lp_solution_ = value;
12194 bool value = (
_impl_._has_bits_[4] & 0x80000000u) != 0;
12198 ::google::protobuf::internal::TSanWrite(&
_impl_);
12199 _impl_.exploit_all_lp_solution_ =
true;
12200 _impl_._has_bits_[4] &= ~0x80000000u;
12204 return _internal_exploit_all_lp_solution();
12207 _internal_set_exploit_all_lp_solution(value);
12208 _impl_._has_bits_[4] |= 0x80000000u;
12211inline bool SatParameters::_internal_exploit_all_lp_solution()
const {
12212 ::google::protobuf::internal::TSanRead(&
_impl_);
12213 return _impl_.exploit_all_lp_solution_;
12215inline void SatParameters::_internal_set_exploit_all_lp_solution(
bool value) {
12216 ::google::protobuf::internal::TSanWrite(&
_impl_);
12217 _impl_.exploit_all_lp_solution_ = value;
12222 bool value = (
_impl_._has_bits_[1] & 0x00000002u) != 0;
12226 ::google::protobuf::internal::TSanWrite(&
_impl_);
12227 _impl_.exploit_best_solution_ =
false;
12228 _impl_._has_bits_[1] &= ~0x00000002u;
12232 return _internal_exploit_best_solution();
12235 _internal_set_exploit_best_solution(value);
12236 _impl_._has_bits_[1] |= 0x00000002u;
12239inline bool SatParameters::_internal_exploit_best_solution()
const {
12240 ::google::protobuf::internal::TSanRead(&
_impl_);
12241 return _impl_.exploit_best_solution_;
12243inline void SatParameters::_internal_set_exploit_best_solution(
bool value) {
12244 ::google::protobuf::internal::TSanWrite(&
_impl_);
12245 _impl_.exploit_best_solution_ = value;
12250 bool value = (
_impl_._has_bits_[1] & 0x00000100u) != 0;
12254 ::google::protobuf::internal::TSanWrite(&
_impl_);
12255 _impl_.exploit_relaxation_solution_ =
false;
12256 _impl_._has_bits_[1] &= ~0x00000100u;
12260 return _internal_exploit_relaxation_solution();
12263 _internal_set_exploit_relaxation_solution(value);
12264 _impl_._has_bits_[1] |= 0x00000100u;
12267inline bool SatParameters::_internal_exploit_relaxation_solution()
const {
12268 ::google::protobuf::internal::TSanRead(&
_impl_);
12269 return _impl_.exploit_relaxation_solution_;
12271inline void SatParameters::_internal_set_exploit_relaxation_solution(
bool value) {
12272 ::google::protobuf::internal::TSanWrite(&
_impl_);
12273 _impl_.exploit_relaxation_solution_ = value;
12278 bool value = (
_impl_._has_bits_[5] & 0x00000100u) != 0;
12282 ::google::protobuf::internal::TSanWrite(&
_impl_);
12283 _impl_.exploit_objective_ =
true;
12284 _impl_._has_bits_[5] &= ~0x00000100u;
12288 return _internal_exploit_objective();
12291 _internal_set_exploit_objective(value);
12292 _impl_._has_bits_[5] |= 0x00000100u;
12295inline bool SatParameters::_internal_exploit_objective()
const {
12296 ::google::protobuf::internal::TSanRead(&
_impl_);
12297 return _impl_.exploit_objective_;
12299inline void SatParameters::_internal_set_exploit_objective(
bool value) {
12300 ::google::protobuf::internal::TSanWrite(&
_impl_);
12301 _impl_.exploit_objective_ = value;
12306 bool value = (
_impl_._has_bits_[2] & 0x00100000u) != 0;
12310 ::google::protobuf::internal::TSanWrite(&
_impl_);
12311 _impl_.detect_linearized_product_ =
false;
12312 _impl_._has_bits_[2] &= ~0x00100000u;
12316 return _internal_detect_linearized_product();
12319 _internal_set_detect_linearized_product(value);
12320 _impl_._has_bits_[2] |= 0x00100000u;
12323inline bool SatParameters::_internal_detect_linearized_product()
const {
12324 ::google::protobuf::internal::TSanRead(&
_impl_);
12325 return _impl_.detect_linearized_product_;
12327inline void SatParameters::_internal_set_detect_linearized_product(
bool value) {
12328 ::google::protobuf::internal::TSanWrite(&
_impl_);
12329 _impl_.detect_linearized_product_ = value;
12334 bool value = (
_impl_._has_bits_[5] & 0x00000200u) != 0;
12338 ::google::protobuf::internal::TSanWrite(&
_impl_);
12339 _impl_.mip_max_bound_ = 10000000;
12340 _impl_._has_bits_[5] &= ~0x00000200u;
12344 return _internal_mip_max_bound();
12347 _internal_set_mip_max_bound(value);
12348 _impl_._has_bits_[5] |= 0x00000200u;
12351inline double SatParameters::_internal_mip_max_bound()
const {
12352 ::google::protobuf::internal::TSanRead(&
_impl_);
12353 return _impl_.mip_max_bound_;
12355inline void SatParameters::_internal_set_mip_max_bound(
double value) {
12356 ::google::protobuf::internal::TSanWrite(&
_impl_);
12357 _impl_.mip_max_bound_ = value;
12362 bool value = (
_impl_._has_bits_[5] & 0x00000400u) != 0;
12366 ::google::protobuf::internal::TSanWrite(&
_impl_);
12367 _impl_.mip_var_scaling_ = 1;
12368 _impl_._has_bits_[5] &= ~0x00000400u;
12372 return _internal_mip_var_scaling();
12375 _internal_set_mip_var_scaling(value);
12376 _impl_._has_bits_[5] |= 0x00000400u;
12379inline double SatParameters::_internal_mip_var_scaling()
const {
12380 ::google::protobuf::internal::TSanRead(&
_impl_);
12381 return _impl_.mip_var_scaling_;
12383inline void SatParameters::_internal_set_mip_var_scaling(
double value) {
12384 ::google::protobuf::internal::TSanWrite(&
_impl_);
12385 _impl_.mip_var_scaling_ = value;
12390 bool value = (
_impl_._has_bits_[2] & 0x00000020u) != 0;
12394 ::google::protobuf::internal::TSanWrite(&
_impl_);
12395 _impl_.mip_scale_large_domain_ =
false;
12396 _impl_._has_bits_[2] &= ~0x00000020u;
12400 return _internal_mip_scale_large_domain();
12403 _internal_set_mip_scale_large_domain(value);
12404 _impl_._has_bits_[2] |= 0x00000020u;
12407inline bool SatParameters::_internal_mip_scale_large_domain()
const {
12408 ::google::protobuf::internal::TSanRead(&
_impl_);
12409 return _impl_.mip_scale_large_domain_;
12411inline void SatParameters::_internal_set_mip_scale_large_domain(
bool value) {
12412 ::google::protobuf::internal::TSanWrite(&
_impl_);
12413 _impl_.mip_scale_large_domain_ = value;
12418 bool value = (
_impl_._has_bits_[5] & 0x80000000u) != 0;
12422 ::google::protobuf::internal::TSanWrite(&
_impl_);
12423 _impl_.mip_automatically_scale_variables_ =
true;
12424 _impl_._has_bits_[5] &= ~0x80000000u;
12428 return _internal_mip_automatically_scale_variables();
12431 _internal_set_mip_automatically_scale_variables(value);
12432 _impl_._has_bits_[5] |= 0x80000000u;
12435inline bool SatParameters::_internal_mip_automatically_scale_variables()
const {
12436 ::google::protobuf::internal::TSanRead(&
_impl_);
12437 return _impl_.mip_automatically_scale_variables_;
12439inline void SatParameters::_internal_set_mip_automatically_scale_variables(
bool value) {
12440 ::google::protobuf::internal::TSanWrite(&
_impl_);
12441 _impl_.mip_automatically_scale_variables_ = value;
12446 bool value = (
_impl_._has_bits_[2] & 0x00000008u) != 0;
12450 ::google::protobuf::internal::TSanWrite(&
_impl_);
12451 _impl_.only_solve_ip_ =
false;
12452 _impl_._has_bits_[2] &= ~0x00000008u;
12456 return _internal_only_solve_ip();
12459 _internal_set_only_solve_ip(value);
12460 _impl_._has_bits_[2] |= 0x00000008u;
12463inline bool SatParameters::_internal_only_solve_ip()
const {
12464 ::google::protobuf::internal::TSanRead(&
_impl_);
12465 return _impl_.only_solve_ip_;
12467inline void SatParameters::_internal_set_only_solve_ip(
bool value) {
12468 ::google::protobuf::internal::TSanWrite(&
_impl_);
12469 _impl_.only_solve_ip_ = value;
12474 bool value = (
_impl_._has_bits_[5] & 0x00000800u) != 0;
12478 ::google::protobuf::internal::TSanWrite(&
_impl_);
12479 _impl_.mip_wanted_precision_ = 1e-06;
12480 _impl_._has_bits_[5] &= ~0x00000800u;
12484 return _internal_mip_wanted_precision();
12487 _internal_set_mip_wanted_precision(value);
12488 _impl_._has_bits_[5] |= 0x00000800u;
12491inline double SatParameters::_internal_mip_wanted_precision()
const {
12492 ::google::protobuf::internal::TSanRead(&
_impl_);
12493 return _impl_.mip_wanted_precision_;
12495inline void SatParameters::_internal_set_mip_wanted_precision(
double value) {
12496 ::google::protobuf::internal::TSanWrite(&
_impl_);
12497 _impl_.mip_wanted_precision_ = value;
12502 bool value = (
_impl_._has_bits_[5] & 0x00002000u) != 0;
12506 ::google::protobuf::internal::TSanWrite(&
_impl_);
12507 _impl_.mip_max_activity_exponent_ = 53;
12508 _impl_._has_bits_[5] &= ~0x00002000u;
12512 return _internal_mip_max_activity_exponent();
12515 _internal_set_mip_max_activity_exponent(value);
12516 _impl_._has_bits_[5] |= 0x00002000u;
12519inline ::int32_t SatParameters::_internal_mip_max_activity_exponent()
const {
12520 ::google::protobuf::internal::TSanRead(&
_impl_);
12521 return _impl_.mip_max_activity_exponent_;
12523inline void SatParameters::_internal_set_mip_max_activity_exponent(::int32_t value) {
12524 ::google::protobuf::internal::TSanWrite(&
_impl_);
12525 _impl_.mip_max_activity_exponent_ = value;
12530 bool value = (
_impl_._has_bits_[5] & 0x00001000u) != 0;
12534 ::google::protobuf::internal::TSanWrite(&
_impl_);
12535 _impl_.mip_check_precision_ = 0.0001;
12536 _impl_._has_bits_[5] &= ~0x00001000u;
12540 return _internal_mip_check_precision();
12543 _internal_set_mip_check_precision(value);
12544 _impl_._has_bits_[5] |= 0x00001000u;
12547inline double SatParameters::_internal_mip_check_precision()
const {
12548 ::google::protobuf::internal::TSanRead(&
_impl_);
12549 return _impl_.mip_check_precision_;
12551inline void SatParameters::_internal_set_mip_check_precision(
double value) {
12552 ::google::protobuf::internal::TSanWrite(&
_impl_);
12553 _impl_.mip_check_precision_ = value;
12558 bool value = (
_impl_._has_bits_[6] & 0x00000080u) != 0;
12562 ::google::protobuf::internal::TSanWrite(&
_impl_);
12563 _impl_.mip_compute_true_objective_bound_ =
true;
12564 _impl_._has_bits_[6] &= ~0x00000080u;
12568 return _internal_mip_compute_true_objective_bound();
12571 _internal_set_mip_compute_true_objective_bound(value);
12572 _impl_._has_bits_[6] |= 0x00000080u;
12575inline bool SatParameters::_internal_mip_compute_true_objective_bound()
const {
12576 ::google::protobuf::internal::TSanRead(&
_impl_);
12577 return _impl_.mip_compute_true_objective_bound_;
12579inline void SatParameters::_internal_set_mip_compute_true_objective_bound(
bool value) {
12580 ::google::protobuf::internal::TSanWrite(&
_impl_);
12581 _impl_.mip_compute_true_objective_bound_ = value;
12586 bool value = (
_impl_._has_bits_[6] & 0x00001000u) != 0;
12590 ::google::protobuf::internal::TSanWrite(&
_impl_);
12591 _impl_.mip_max_valid_magnitude_ = 1e+20;
12592 _impl_._has_bits_[6] &= ~0x00001000u;
12596 return _internal_mip_max_valid_magnitude();
12599 _internal_set_mip_max_valid_magnitude(value);
12600 _impl_._has_bits_[6] |= 0x00001000u;
12603inline double SatParameters::_internal_mip_max_valid_magnitude()
const {
12604 ::google::protobuf::internal::TSanRead(&
_impl_);
12605 return _impl_.mip_max_valid_magnitude_;
12607inline void SatParameters::_internal_set_mip_max_valid_magnitude(
double value) {
12608 ::google::protobuf::internal::TSanWrite(&
_impl_);
12609 _impl_.mip_max_valid_magnitude_ = value;
12614 bool value = (
_impl_._has_bits_[2] & 0x00200000u) != 0;
12618 ::google::protobuf::internal::TSanWrite(&
_impl_);
12619 _impl_.mip_treat_high_magnitude_bounds_as_infinity_ =
false;
12620 _impl_._has_bits_[2] &= ~0x00200000u;
12624 return _internal_mip_treat_high_magnitude_bounds_as_infinity();
12627 _internal_set_mip_treat_high_magnitude_bounds_as_infinity(value);
12628 _impl_._has_bits_[2] |= 0x00200000u;
12631inline bool SatParameters::_internal_mip_treat_high_magnitude_bounds_as_infinity()
const {
12632 ::google::protobuf::internal::TSanRead(&
_impl_);
12633 return _impl_.mip_treat_high_magnitude_bounds_as_infinity_;
12635inline void SatParameters::_internal_set_mip_treat_high_magnitude_bounds_as_infinity(
bool value) {
12636 ::google::protobuf::internal::TSanWrite(&
_impl_);
12637 _impl_.mip_treat_high_magnitude_bounds_as_infinity_ = value;
12642 bool value = (
_impl_._has_bits_[6] & 0x02000000u) != 0;
12646 ::google::protobuf::internal::TSanWrite(&
_impl_);
12647 _impl_.mip_drop_tolerance_ = 1e-16;
12648 _impl_._has_bits_[6] &= ~0x02000000u;
12652 return _internal_mip_drop_tolerance();
12655 _internal_set_mip_drop_tolerance(value);
12656 _impl_._has_bits_[6] |= 0x02000000u;
12659inline double SatParameters::_internal_mip_drop_tolerance()
const {
12660 ::google::protobuf::internal::TSanRead(&
_impl_);
12661 return _impl_.mip_drop_tolerance_;
12663inline void SatParameters::_internal_set_mip_drop_tolerance(
double value) {
12664 ::google::protobuf::internal::TSanWrite(&
_impl_);
12665 _impl_.mip_drop_tolerance_ = value;
12670 bool value = (
_impl_._has_bits_[7] & 0x00000100u) != 0;
12674 ::google::protobuf::internal::TSanWrite(&
_impl_);
12675 _impl_.mip_presolve_level_ = 2;
12676 _impl_._has_bits_[7] &= ~0x00000100u;
12680 return _internal_mip_presolve_level();
12683 _internal_set_mip_presolve_level(value);
12684 _impl_._has_bits_[7] |= 0x00000100u;
12687inline ::int32_t SatParameters::_internal_mip_presolve_level()
const {
12688 ::google::protobuf::internal::TSanRead(&
_impl_);
12689 return _impl_.mip_presolve_level_;
12691inline void SatParameters::_internal_set_mip_presolve_level(::int32_t value) {
12692 ::google::protobuf::internal::TSanWrite(&
_impl_);
12693 _impl_.mip_presolve_level_ = value;
12697#pragma GCC diagnostic pop
12712 return ::operations_research::sat::SatParameters_VariableOrder_descriptor();
12718 return ::operations_research::sat::SatParameters_Polarity_descriptor();
12724 return ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm_descriptor();
12730 return ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm_descriptor();
12736 return ::operations_research::sat::SatParameters_ClauseProtection_descriptor();
12742 return ::operations_research::sat::SatParameters_ClauseOrdering_descriptor();
12748 return ::operations_research::sat::SatParameters_RestartAlgorithm_descriptor();
12754 return ::operations_research::sat::SatParameters_MaxSatAssumptionOrder_descriptor();
12760 return ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm_descriptor();
12766 return ::operations_research::sat::SatParameters_SearchBranching_descriptor();
12772 return ::operations_research::sat::SatParameters_SharedTreeSplitStrategy_descriptor();
12778 return ::operations_research::sat::SatParameters_FPRoundingMethod_descriptor();
12786#include "google/protobuf/port_undef.inc"
bool use_try_edge_reasoning_in_no_overlap_2d() const
void clear_use_all_different_for_circuit()
double blocking_restart_multiplier() const
void set_stop_after_root_propagation(bool value)
bool has_exploit_all_lp_solution() const
optional bool exploit_all_lp_solution = 116 [default = true];
bool has_propagation_loop_detection_factor() const
optional double propagation_loop_detection_factor = 221 [default = 10];
bool use_probing_search() const
void set_push_all_tasks_toward_start(bool value)
void set_mip_max_valid_magnitude(double value)
bool has_detect_linearized_product() const
optional bool detect_linearized_product = 277 [default = false];
SatParameters_RestartAlgorithm RestartAlgorithm
bool has_debug_max_num_presolve_operations() const
optional int32 debug_max_num_presolve_operations = 151 [default = 0];
bool has_log_subsolver_statistics() const
optional bool log_subsolver_statistics = 189 [default = false];
const ::std::string & ignore_subsolvers(int index) const
void set_inprocessing_dtime_ratio(double value)
double min_orthogonality_for_lp_constraints() const
bool has_new_linear_propagation() const
optional bool new_linear_propagation = 224 [default = true];
void set_num_search_workers(::int32_t value)
void clear_strategy_change_increase_ratio()
void clear_filter_sat_postsolve_clauses()
::int32_t shared_tree_balance_tolerance() const
void clear_filter_subsolvers()
void clear_use_timetable_edge_finding_in_cumulative()
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL MaxSatAssumptionOrder_descriptor()
bool has_presolve_probing_deterministic_time_limit() const
optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
void clear_max_memory_in_mb()
void clear_share_level_zero_bounds()
void set_lp_dual_tolerance(double value)
::int32_t max_size_to_create_precedence_literals_in_disjunctive() const
::int32_t max_num_intervals_for_timetable_edge_finding() const
bool use_overload_checker_in_cumulative() const
void clear_subsolver_params()
::int32_t lb_relax_num_workers_threshold() const
void clear_feasibility_jump_max_expanded_constraint_size()
::int64_t shaving_search_threshold() const
::int32_t feasibility_jump_linearization_level() const
bool has_use_extended_probing() const
optional bool use_extended_probing = 269 [default = true];
void set_shared_tree_open_leaves_per_worker(double value)
bool has_fill_additional_solutions_in_response() const
optional bool fill_additional_solutions_in_response = 194 [default = false];
void clear_lns_initial_difficulty()
void set_keep_symmetry_in_presolve(bool value)
bool has_glucose_decay_increment_period() const
optional int32 glucose_decay_increment_period = 24 [default = 5000];
bool exploit_best_solution() const
bool has_merge_no_overlap_work_limit() const
optional double merge_no_overlap_work_limit = 145 [default = 1000000000000];
bool has_presolve_substitution_level() const
optional int32 presolve_substitution_level = 147 [default = 1];
bool has_max_lin_max_size_for_expansion() const
optional int32 max_lin_max_size_for_expansion = 280 [default = 0];
double inprocessing_dtime_ratio() const
void clear_at_most_one_max_expansion_size()
void set_shared_tree_worker_enable_phase_sharing(bool value)
friend class ::google::protobuf::MessageLite
bool convert_intervals() const
void clear_max_alldiff_domain_size()
void set_max_num_deterministic_batches(::int32_t value)
static constexpr int FPRoundingMethod_ARRAYSIZE
bool use_all_different_for_circuit() const
void set_use_feasibility_jump(bool value)
void clear_pseudo_cost_reliability_threshold()
bool use_feasibility_pump() const
double max_time_in_seconds() const
bool has_polarity_rephase_increment() const
optional int32 polarity_rephase_increment = 168 [default = 1000];
bool has_merge_at_most_one_work_limit() const
optional double merge_at_most_one_work_limit = 146 [default = 100000000];
::std::string *PROTOBUF_NONNULL mutable_filter_subsolvers(int index)
bool has_use_combined_no_overlap() const
optional bool use_combined_no_overlap = 133 [default = false];
void clear_ignore_subsolvers()
void clear_max_sat_reverse_assumption_order()
void set_use_erwa_heuristic(bool value)
void set_shared_tree_split_strategy(::operations_research::sat::SatParameters_SharedTreeSplitStrategy value)
bool has_num_search_workers() const
optional int32 num_search_workers = 100 [default = 0];
bool keep_symmetry_in_presolve() const
static constexpr int RestartAlgorithm_ARRAYSIZE
void set_debug_crash_on_bad_hint(bool value)
static bool Polarity_IsValid(int value)
double shared_tree_open_leaves_per_worker() const
bool has_cp_model_use_sat_presolve() const
optional bool cp_model_use_sat_presolve = 93 [default = true];
void clear_log_subsolver_statistics()
void clear_log_to_stdout()
::int64_t max_memory_in_mb() const
bool use_lb_relax_lns() const
int subsolvers_size() const
repeated string subsolvers = 207;
bool expand_reservoir_constraints() const
static constexpr int ClauseProtection_ARRAYSIZE
void clear_preferred_variable_order()
bool count_assumption_levels_in_lbd() const
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL ClauseOrdering_descriptor()
void set_routing_cut_subset_size_for_exact_binary_relation_bound(::int32_t value)
bool has_random_polarity_ratio() const
optional double random_polarity_ratio = 45 [default = 0];
::int32_t routing_cut_subset_size_for_shortest_paths_bound() const
::int32_t linear_split_size() const
bool use_optimization_hints() const
bool share_glue_clauses() const
static constexpr BinaryMinizationAlgorithm EXPERIMENTAL_BINARY_MINIMIZATION
void clear_blocking_restart_window_size()
bool inprocessing_minimization_use_all_orderings() const
void set_catch_sigint_signal(bool value)
void clear_find_multiple_cores()
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL Polarity_descriptor()
::int32_t num_full_subsolvers() const
void set_minimization_algorithm(::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm value)
void clear_lp_primal_tolerance()
bool has_use_strong_propagation_in_disjunctive() const
optional bool use_strong_propagation_in_disjunctive = 230 [default = false];
void clear_routing_cut_max_infeasible_path_length()
void clear_restart_algorithms()
bool has_clause_cleanup_ratio() const
optional double clause_cleanup_ratio = 190 [default = 0.5];
void clear_search_random_variable_pool_size()
bool has_probing_deterministic_time_limit() const
optional double probing_deterministic_time_limit = 226 [default = 1];
bool has_mip_compute_true_objective_bound() const
optional bool mip_compute_true_objective_bound = 198 [default = true];
bool has_max_alldiff_domain_size() const
optional int32 max_alldiff_domain_size = 320 [default = 256];
bool has_use_symmetry_in_lp() const
optional bool use_symmetry_in_lp = 301 [default = false];
::std::string *PROTOBUF_NULLABLE release_log_prefix()
void set_clause_cleanup_protection(::operations_research::sat::SatParameters_ClauseProtection value)
void set_feasibility_jump_max_expanded_constraint_size(::int32_t value)
bool has_solution_pool_size() const
optional int32 solution_pool_size = 193 [default = 3];
::std::string *PROTOBUF_NONNULL mutable_ignore_subsolvers(int index)
double variable_activity_decay() const
bool fill_tightened_domains_in_response() const
void clear_optimize_with_max_hs()
bool has_debug_crash_on_bad_hint() const
optional bool debug_crash_on_bad_hint = 195 [default = false];
void Swap(SatParameters *PROTOBUF_NONNULL other)
bool has_mip_presolve_level() const
optional int32 mip_presolve_level = 261 [default = 2];
void clear_use_energetic_reasoning_in_no_overlap_2d()
void set_routing_cut_subset_size_for_shortest_paths_bound(::int32_t value)
void set_mip_drop_tolerance(double value)
bool has_max_num_cuts() const
optional int32 max_num_cuts = 91 [default = 10000];
bool has_count_assumption_levels_in_lbd() const
optional bool count_assumption_levels_in_lbd = 49 [default = true];
::std::string *PROTOBUF_NONNULL mutable_default_restart_algorithms()
bool has_routing_cut_dp_effort() const
optional double routing_cut_dp_effort = 314 [default = 10000000];
bool use_feasibility_jump() const
::int32_t linearization_level() const
void set_repair_hint(bool value)
bool find_big_linear_overlap() const
bool has_restart_running_window_size() const
optional int32 restart_running_window_size = 62 [default = 50];
void set_max_deterministic_time(double value)
void clear_routing_cut_dp_effort()
bool has_only_solve_ip() const
optional bool only_solve_ip = 222 [default = false];
const ::operations_research::sat::SatParameters & subsolver_params(int index) const
void clear_expand_reservoir_using_circuit()
void set_feasibility_jump_var_perburbation_range_ratio(double value)
double cut_max_active_count_value() const
bool has_filter_sat_postsolve_clauses() const
optional bool filter_sat_postsolve_clauses = 324 [default = false];
::int32_t num_search_workers() const
double cut_active_count_decay() const
void set_only_solve_ip(bool value)
void set_cp_model_use_sat_presolve(bool value)
void set_only_add_cuts_at_level_zero(bool value)
bool exploit_all_precedences() const
bool add_lp_constraints_lazily() const
bool has_shaving_search_deterministic_time() const
optional double shaving_search_deterministic_time = 205 [default = 0.1];
double mip_check_precision() const
bool use_blocking_restart() const
void set_symmetry_detection_deterministic_time_limit(double value)
static constexpr Polarity POLARITY_FALSE
bool has_permute_variable_randomly() const
optional bool permute_variable_randomly = 178 [default = false];
void set_use_optimization_hints(bool value)
void set_presolve_bve_threshold(::int32_t value)
double glucose_max_decay() const
void set_shared_tree_worker_enable_trail_sharing(bool value)
void set_max_time_in_seconds(double value)
static constexpr SharedTreeSplitStrategy SPLIT_STRATEGY_DISCREPANCY
const ::google::protobuf::RepeatedPtrField<::std::string > & subsolvers() const
::google::protobuf::RepeatedField< int > *PROTOBUF_NONNULL mutable_restart_algorithms()
void set_use_hard_precedences_in_cumulative(bool value)
void clear_initial_polarity()
bool has_mip_max_bound() const
optional double mip_max_bound = 124 [default = 10000000];
bool has_mip_drop_tolerance() const
optional double mip_drop_tolerance = 232 [default = 1e-16];
void set_use_probing_search(bool value)
void clear_max_consecutive_inactive_count()
static bool MaxSatStratificationAlgorithm_IsValid(int value)
static constexpr RestartAlgorithm FIXED_RESTART
void clear_relative_gap_limit()
void set_search_branching(::operations_research::sat::SatParameters_SearchBranching value)
bool has_cut_level() const
optional int32 cut_level = 196 [default = 1];
bool use_dynamic_precedence_in_cumulative() const
void clear_clause_cleanup_target()
bool detect_table_with_cost() const
void clear_mip_max_bound()
void clear_clause_cleanup_protection()
void clear_catch_sigint_signal()
void set_glucose_decay_increment_period(::int32_t value)
bool has_glucose_max_decay() const
optional double glucose_max_decay = 22 [default = 0.95];
bool has_shared_tree_worker_enable_phase_sharing() const
optional bool shared_tree_worker_enable_phase_sharing = 304 [default = true];
bool new_linear_propagation() const
static constexpr ClauseOrdering CLAUSE_LBD
void clear_use_blocking_restart()
void clear_shared_tree_balance_tolerance()
void set_max_presolve_iterations(::int32_t value)
void set_mip_automatically_scale_variables(bool value)
bool has_detect_table_with_cost() const
optional bool detect_table_with_cost = 216 [default = false];
void set_variable_activity_decay(double value)
static constexpr SearchBranching PARTIAL_FIXED_SEARCH
::int32_t num_violation_ls() const
bool use_precedences_in_disjunctive_constraint() const
void clear_disable_constraint_expansion()
void set_use_area_energetic_reasoning_in_no_overlap_2d(bool value)
static bool SharedTreeSplitStrategy_IsValid(int value)
void set_cover_optimization(bool value)
static bool MaxSatAssumptionOrder_IsValid(int value)
void set_exploit_best_solution(bool value)
void clear_use_overload_checker_in_cumulative()
void set_auto_detect_greater_than_at_least_one_of(bool value)
void set_new_constraints_batch_size(::int32_t value)
bool has_optimize_with_max_hs() const
optional bool optimize_with_max_hs = 85 [default = false];
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL RestartAlgorithm_descriptor()
::int32_t routing_cut_subset_size_for_exact_binary_relation_bound() const
void clear_log_search_progress()
SatParameters_ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm
void clear_cut_active_count_decay()
bool has_blocking_restart_multiplier() const
optional double blocking_restart_multiplier = 66 [default = 1.4];
void set_fix_variables_to_their_hinted_value(bool value)
void clear_max_integer_rounding_scaling()
void set_random_branches_ratio(double value)
void clear_auto_detect_greater_than_at_least_one_of()
void clear_max_lin_max_size_for_expansion()
void set_max_num_cuts(::int32_t value)
bool has_use_dual_scheduling_heuristics() const
optional bool use_dual_scheduling_heuristics = 214 [default = true];
void clear_feasibility_jump_linearization_level()
bool encode_cumulative_as_reservoir() const
void set_mip_max_activity_exponent(::int32_t value)
void set_mip_check_precision(double value)
void set_initial_variables_activity(double value)
void clear_mip_scale_large_domain()
bool has_use_objective_lb_search() const
optional bool use_objective_lb_search = 228 [default = false];
static constexpr ConflictMinimizationAlgorithm EXPERIMENTAL
bool has_use_area_energetic_reasoning_in_no_overlap_2d() const
optional bool use_area_energetic_reasoning_in_no_overlap_2d = 271 [default = false];
void set_mip_compute_true_objective_bound(bool value)
static bool FPRoundingMethod_IsValid(int value)
::int32_t num_conflicts_before_strategy_changes() const
double strategy_change_increase_ratio() const
bool has_max_domain_size_when_encoding_eq_neq_constraints() const
optional int32 max_domain_size_when_encoding_eq_neq_constraints = 191 [default = 16];
::std::string *PROTOBUF_NONNULL add_filter_subsolvers()
void set_add_clique_cuts(bool value)
void set_feasibility_jump_restart_factor(::int32_t value)
void clear_routing_cut_subset_size_for_binary_relation_bound()
bool has_enumerate_all_solutions() const
optional bool enumerate_all_solutions = 87 [default = false];
void set_disable_constraint_expansion(bool value)
void set_strategy_change_increase_ratio(double value)
bool has_interleave_batch_size() const
optional int32 interleave_batch_size = 134 [default = 0];
void clear_shaving_search_threshold()
void set_also_bump_variables_in_conflict_reasons(bool value)
void set_blocking_restart_multiplier(double value)
void set_remove_fixed_variables_early(bool value)
void set_binary_minimization_algorithm(::operations_research::sat::SatParameters_BinaryMinizationAlgorithm value)
void clear_hint_conflict_limit()
@ kDiversifyLnsParamsFieldNumber
@ kMipMaxBoundFieldNumber
@ kLogToResponseFieldNumber
@ kCoverOptimizationFieldNumber
@ kMaxMemoryInMbFieldNumber
@ kUseExtendedProbingFieldNumber
@ kNoOverlap2DBooleanRelationsLimitFieldNumber
@ kMaxSatStratificationFieldNumber
@ kNewLinearPropagationFieldNumber
@ kSharedTreeOpenLeavesPerWorkerFieldNumber
@ kInprocessingMinimizationDtimeFieldNumber
@ kLogToStdoutFieldNumber
@ kExploitObjectiveFieldNumber
@ kNumViolationLsFieldNumber
@ kMipMaxValidMagnitudeFieldNumber
@ kUseCombinedNoOverlapFieldNumber
@ kDetectTableWithCostFieldNumber
@ kUseExactLpReasonFieldNumber
@ kAtMostOneMaxExpansionSizeFieldNumber
@ kUseTimetablingInNoOverlap2DFieldNumber
@ kUseBlockingRestartFieldNumber
@ kFillAdditionalSolutionsInResponseFieldNumber
@ kDefaultRestartAlgorithmsFieldNumber
@ kUseOptionalVariablesFieldNumber
@ kMinOrthogonalityForLpConstraintsFieldNumber
@ kRoutingCutSubsetSizeForTightBinaryRelationBoundFieldNumber
@ kRoutingCutSubsetSizeForExactBinaryRelationBoundFieldNumber
@ kUseStrongPropagationInDisjunctiveFieldNumber
@ kUseFeasibilityPumpFieldNumber
@ kPresolveBveThresholdFieldNumber
@ kMaxAllDiffCutSizeFieldNumber
@ kExpandReservoirUsingCircuitFieldNumber
@ kInprocessingProbingDtimeFieldNumber
@ kFeasibilityJumpEnableRestartsFieldNumber
@ kUseEnergeticReasoningInNoOverlap2DFieldNumber
@ kStopAfterFirstSolutionFieldNumber
@ kStopAfterPresolveFieldNumber
@ kDetectLinearizedProductFieldNumber
@ kPermutePresolveConstraintOrderFieldNumber
@ kCoreMinimizationLevelFieldNumber
@ kBlockingRestartMultiplierFieldNumber
@ kUseHardPrecedencesInCumulativeFieldNumber
@ kPresolveSubstitutionLevelFieldNumber
@ kSaveLpBasisInLbTreeSearchFieldNumber
@ kFixVariablesToTheirHintedValueFieldNumber
@ kOnlyAddCutsAtLevelZeroFieldNumber
@ kMipDropToleranceFieldNumber
@ kViolationLsCompoundMoveProbabilityFieldNumber
@ kUsePbResolutionFieldNumber
@ kMergeNoOverlapWorkLimitFieldNumber
@ kMaxDeterministicTimeFieldNumber
@ kFeasibilityJumpRestartFactorFieldNumber
@ kExploitAllLpSolutionFieldNumber
@ kSharedTreeNumWorkersFieldNumber
@ kDebugMaxNumPresolveOperationsFieldNumber
@ kUseErwaHeuristicFieldNumber
@ kShareObjectiveBoundsFieldNumber
@ kMipScaleLargeDomainFieldNumber
@ kDisableConstraintExpansionFieldNumber
@ kKeepAllFeasibleSolutionsInPresolveFieldNumber
@ kOptimizeWithMaxHsFieldNumber
@ kMipMaxActivityExponentFieldNumber
@ kMaxSatAssumptionOrderFieldNumber
@ kOptimizeWithCoreFieldNumber
@ kVariableActivityDecayFieldNumber
@ kFeasibilityJumpVarPerburbationRangeRatioFieldNumber
@ kUseDynamicPrecedenceInCumulativeFieldNumber
@ kMaxPairsPairwiseReasoningInNoOverlap2DFieldNumber
@ kFindBigLinearOverlapFieldNumber
@ kMaxPresolveIterationsFieldNumber
@ kUseDualSchedulingHeuristicsFieldNumber
@ kPseudoCostReliabilityThresholdFieldNumber
@ kIgnoreNamesFieldNumber
@ kMaxConsecutiveInactiveCountFieldNumber
@ kShavingDeterministicTimeInProbingSearchFieldNumber
@ kBlockingRestartWindowSizeFieldNumber
@ kPresolveBvaThresholdFieldNumber
@ kClauseCleanupOrderingFieldNumber
@ kCutCleanupTargetFieldNumber
@ kAlsoBumpVariablesInConflictReasonsFieldNumber
@ kRandomizeSearchFieldNumber
@ kLbRelaxNumWorkersThresholdFieldNumber
@ kDebugCrashOnBadHintFieldNumber
@ kFeasibilityJumpBatchDtimeFieldNumber
@ kSubsolverParamsFieldNumber
@ kSolutionPoolSizeFieldNumber
@ kDebugCrashIfPresolveBreaksHintFieldNumber
@ kUseLbRelaxLnsFieldNumber
@ kInprocessingMinimizationUseAllOrderingsFieldNumber
@ kInprocessingDtimeRatioFieldNumber
@ kDebugPostsolveWithFullSolverFieldNumber
@ kShavingSearchDeterministicTimeFieldNumber
@ kProbingNumCombinationsLimitFieldNumber
@ kUseDynamicPrecedenceInDisjunctiveFieldNumber
@ kPermuteVariableRandomlyFieldNumber
@ kStopAfterRootPropagationFieldNumber
@ kMipPresolveLevelFieldNumber
@ kMipTreatHighMagnitudeBoundsAsInfinityFieldNumber
@ kCpModelPresolveFieldNumber
@ kLinearizationLevelFieldNumber
@ kInterleaveSearchFieldNumber
@ kAddZeroHalfCutsFieldNumber
@ kSharedTreeWorkerEnableTrailSharingFieldNumber
@ kClauseCleanupPeriodFieldNumber
@ kFeasibilityJumpMaxExpandedConstraintSizeFieldNumber
@ kInitialVariablesActivityFieldNumber
@ kAddObjectiveCutFieldNumber
@ kLogSearchProgressFieldNumber
@ kVariablesShavingLevelFieldNumber
@ kShareGlueClausesFieldNumber
@ kSearchRandomVariablePoolSizeFieldNumber
@ kMaxAlldiffDomainSizeFieldNumber
@ kShavingSearchThresholdFieldNumber
@ kSharedTreeSplitStrategyFieldNumber
@ kLogSubsolverStatisticsFieldNumber
@ kLpPrimalToleranceFieldNumber
@ kConvertIntervalsFieldNumber
@ kSymmetryDetectionDeterministicTimeLimitFieldNumber
@ kSharedTreeWorkerMinRestartsPerSubtreeFieldNumber
@ kFindMultipleCoresFieldNumber
@ kInterleaveBatchSizeFieldNumber
@ kInstantiateAllVariablesFieldNumber
@ kExpandReservoirConstraintsFieldNumber
@ kUseSharedTreeSearchFieldNumber
@ kProbingDeterministicTimeLimitFieldNumber
@ kSharedTreeBalanceToleranceFieldNumber
@ kNumSearchWorkersFieldNumber
@ kExploitRelaxationSolutionFieldNumber
@ kMaximumRegionsToSplitInDisconnectedNoOverlap2DFieldNumber
@ kMaxNumDeterministicBatchesFieldNumber
@ kRoutingCutMaxInfeasiblePathLengthFieldNumber
@ kUseDisjunctiveConstraintInCumulativeFieldNumber
@ kUseImpliedBoundsFieldNumber
@ kNumFullSubsolversFieldNumber
@ kPresolveBveClauseWeightFieldNumber
@ kEncodeComplexLinearConstraintWithIntegerFieldNumber
@ kUseConservativeScaleOverloadCheckerFieldNumber
@ kSubsumptionDuringConflictAnalysisFieldNumber
@ kCatchSigintSignalFieldNumber
@ kNumConflictsBeforeStrategyChangesFieldNumber
@ kUseOptimizationHintsFieldNumber
@ kExpandAlldiffConstraintsFieldNumber
@ kPropagationLoopDetectionFactorFieldNumber
@ kFilterSatPostsolveClausesFieldNumber
@ kClauseCleanupTargetFieldNumber
@ kCpModelUseSatPresolveFieldNumber
@ kPbCleanupRatioFieldNumber
@ kUseTimetableEdgeFindingInCumulativeFieldNumber
@ kAddLpConstraintsLazilyFieldNumber
@ kOptimizeWithLbTreeSearchFieldNumber
@ kAddLinMaxCutsFieldNumber
@ kSharedTreeMaxNodesPerWorkerFieldNumber
@ kViolationLsPerturbationPeriodFieldNumber
@ kPolarityRephaseIncrementFieldNumber
@ kRestartLbdAverageRatioFieldNumber
@ kRandomPolarityRatioFieldNumber
@ kUseProbingSearchFieldNumber
@ kUseLinear3ForNoOverlap2DPrecedencesFieldNumber
@ kKeepSymmetryInPresolveFieldNumber
@ kFeasibilityJumpVarRandomizationProbabilityFieldNumber
@ kSymmetryLevelFieldNumber
@ kUseFeasibilityJumpFieldNumber
@ kInferAllDiffsFieldNumber
@ kUseOverloadCheckerInCumulativeFieldNumber
@ kMaxClauseActivityValueFieldNumber
@ kUseAreaEnergeticReasoningInNoOverlap2DFieldNumber
@ kFillTightenedDomainsInResponseFieldNumber
@ kMaxSatReverseAssumptionOrderFieldNumber
@ kUseSymmetryInLpFieldNumber
@ kFeasibilityJumpDecayFieldNumber
@ kPresolveInclusionWorkLimitFieldNumber
@ kBinarySearchNumConflictsFieldNumber
@ kMipVarScalingFieldNumber
@ kPolishLpSolutionFieldNumber
@ kMipCheckPrecisionFieldNumber
@ kExploitAllPrecedencesFieldNumber
@ kStrategyChangeIncreaseRatioFieldNumber
@ kMaxSizeToCreatePrecedenceLiteralsInDisjunctiveFieldNumber
@ kMaxCutRoundsAtLevelZeroFieldNumber
@ kUsePrecedencesInDisjunctiveConstraintFieldNumber
@ kPresolveExtractIntegerEnforcementFieldNumber
@ kSearchBranchingFieldNumber
@ kTableCompressionLevelFieldNumber
@ kMaxDomainSizeWhenEncodingEqNeqConstraintsFieldNumber
@ kUseAbslRandomFieldNumber
@ kIgnoreSubsolversFieldNumber
@ kBinaryMinimizationAlgorithmFieldNumber
@ kUsePhaseSavingFieldNumber
@ kMipAutomaticallyScaleVariablesFieldNumber
@ kFilterSubsolversFieldNumber
@ kMaxNumberOfConflictsFieldNumber
@ kOnlySolveIpFieldNumber
@ kLpDualToleranceFieldNumber
@ kInitialPolarityFieldNumber
@ kClauseCleanupRatioFieldNumber
@ kLnsInitialDeterministicLimitFieldNumber
@ kAddCliqueCutsFieldNumber
@ kMaxIntegerRoundingScalingFieldNumber
@ kExtraSubsolversFieldNumber
@ kMipComputeTrueObjectiveBoundFieldNumber
@ kRootLpIterationsFieldNumber
@ kCutActiveCountDecayFieldNumber
@ kCutMaxActiveCountValueFieldNumber
@ kMergeAtMostOneWorkLimitFieldNumber
@ kMinimizeSharedClausesFieldNumber
@ kGlucoseDecayIncrementPeriodFieldNumber
@ kClauseCleanupLbdBoundFieldNumber
@ kPushAllTasksTowardStartFieldNumber
@ kRandomBranchesRatioFieldNumber
@ kPresolveUseBvaFieldNumber
@ kUseTryEdgeReasoningInNoOverlap2DFieldNumber
@ kInprocessingMinimizationUseConflictAnalysisFieldNumber
@ kRelativeGapLimitFieldNumber
@ kLinearSplitSizeFieldNumber
@ kExploitIntegerLpSolutionFieldNumber
@ kUseAllDifferentForCircuitFieldNumber
@ kSharedTreeWorkerEnablePhaseSharingFieldNumber
@ kNewConstraintsBatchSizeFieldNumber
@ kRestartPeriodFieldNumber
@ kShareBinaryClausesFieldNumber
@ kRestartRunningWindowSizeFieldNumber
@ kMaxLinMaxSizeForExpansionFieldNumber
@ kPresolveBlockedClauseFieldNumber
@ kLnsInitialDifficultyFieldNumber
@ kPbCleanupIncrementFieldNumber
@ kAbsoluteGapLimitFieldNumber
@ kMinimizationAlgorithmFieldNumber
@ kUseObjectiveLbSearchFieldNumber
@ kFeasibilityJumpLinearizationLevelFieldNumber
@ kCpModelProbingLevelFieldNumber
@ kShareLevelZeroBoundsFieldNumber
@ kGlucoseMaxDecayFieldNumber
@ kRoutingCutSubsetSizeForShortestPathsBoundFieldNumber
@ kClauseActivityDecayFieldNumber
@ kMinimizeReductionDuringPbResolutionFieldNumber
@ kEnumerateAllSolutionsFieldNumber
@ kRemoveFixedVariablesEarlyFieldNumber
@ kRoutingCutDpEffortFieldNumber
@ kGlucoseDecayIncrementFieldNumber
@ kMaxNumIntervalsForTimetableEdgeFindingFieldNumber
@ kMaxVariableActivityValueFieldNumber
@ kRestartDlAverageRatioFieldNumber
@ kMaxTimeInSecondsFieldNumber
@ kPreferredVariableOrderFieldNumber
@ kExploitBestSolutionFieldNumber
@ kUseObjectiveShavingSearchFieldNumber
@ kUseSatInprocessingFieldNumber
@ kPresolveProbingDeterministicTimeLimitFieldNumber
@ kShareGlueClausesDtimeFieldNumber
@ kHintConflictLimitFieldNumber
@ kBooleanEncodingLevelFieldNumber
@ kClauseCleanupProtectionFieldNumber
@ kRoutingCutSubsetSizeForBinaryRelationBoundFieldNumber
@ kCountAssumptionLevelsInLbdFieldNumber
@ kPolarityExploitLsHintsFieldNumber
@ kMipWantedPrecisionFieldNumber
@ kEncodeCumulativeAsReservoirFieldNumber
@ kAutoDetectGreaterThanAtLeastOneOfFieldNumber
void clear_max_num_cuts()
void set_variables_shaving_level(::int32_t value)
void set_pb_cleanup_ratio(double value)
bool has_use_lns() const
optional bool use_lns = 283 [default = true];
void clear_feasibility_jump_batch_dtime()
void clear_exploit_best_solution()
bool has_name() const
optional string name = 171 [default = ""];
PROTOBUF_CONSTEXPR SatParameters(::google::protobuf::internal::ConstantInitialized)
bool has_expand_reservoir_constraints() const
optional bool expand_reservoir_constraints = 182 [default = true];
bool has_fill_tightened_domains_in_response() const
optional bool fill_tightened_domains_in_response = 132 [default = false];
void set_solution_pool_size(::int32_t value)
bool has_at_most_one_max_expansion_size() const
optional int32 at_most_one_max_expansion_size = 270 [default = 3];
::int32_t violation_ls_perturbation_period() const
void clear_boolean_encoding_level()
static constexpr SearchBranching PORTFOLIO_SEARCH
::google::protobuf::RepeatedPtrField<::std::string > *PROTOBUF_NONNULL mutable_filter_subsolvers()
void set_find_multiple_cores(bool value)
void clear_debug_postsolve_with_full_solver()
bool has_use_precedences_in_disjunctive_constraint() const
optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
bool permute_variable_randomly() const
bool has_add_mir_cuts() const
optional bool add_mir_cuts = 120 [default = true];
void set_presolve_probing_deterministic_time_limit(double value)
bool add_zero_half_cuts() const
void set_extra_subsolvers(int index, Arg_ &&value, Args_... args)
::int32_t routing_cut_max_infeasible_path_length() const
bool has_add_cg_cuts() const
optional bool add_cg_cuts = 117 [default = true];
void set_lns_initial_deterministic_limit(double value)
bool has_find_big_linear_overlap() const
optional bool find_big_linear_overlap = 234 [default = true];
::int32_t presolve_bve_threshold() const
void set_inprocessing_minimization_use_conflict_analysis(bool value)
void clear_expand_alldiff_constraints()
void set_clause_cleanup_ordering(::operations_research::sat::SatParameters_ClauseOrdering value)
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL FPRoundingMethod_descriptor()
void clear_encode_complex_linear_constraint_with_integer()
SatParameters(::google::protobuf::Arena *PROTOBUF_NULLABLE arena, SatParameters &&from) noexcept
bool expand_reservoir_using_circuit() const
double lp_dual_tolerance() const
double feasibility_jump_batch_dtime() const
bool debug_postsolve_with_full_solver() const
static bool ConflictMinimizationAlgorithm_IsValid(int value)
::operations_research::sat::SatParameters_MaxSatAssumptionOrder max_sat_assumption_order() const
void clear_default_restart_algorithms()
bool debug_crash_on_bad_hint() const
::int32_t restart_period() const
::int32_t max_lin_max_size_for_expansion() const
bool has_shared_tree_max_nodes_per_worker() const
optional int32 shared_tree_max_nodes_per_worker = 238 [default = 10000];
void clear_log_to_response()
::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm max_sat_stratification() const
double max_clause_activity_value() const
::int32_t hint_conflict_limit() const
void clear_debug_crash_if_presolve_breaks_hint()
void set_routing_cut_subset_size_for_tight_binary_relation_bound(::int32_t value)
bool has_use_blocking_restart() const
optional bool use_blocking_restart = 64 [default = false];
static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_WEIGHT
void set_default_restart_algorithms(Arg_ &&arg, Args_... args)
int ignore_subsolvers_size() const
repeated string ignore_subsolvers = 209;
static constexpr SharedTreeSplitStrategy SPLIT_STRATEGY_BALANCED_TREE
bool use_absl_random() const
void clear_keep_symmetry_in_presolve()
bool has_linearization_level() const
optional int32 linearization_level = 90 [default = 1];
bool use_combined_no_overlap() const
bool has_subsumption_during_conflict_analysis() const
optional bool subsumption_during_conflict_analysis = 56 [default = true];
bool instantiate_all_variables() const
void set_save_lp_basis_in_lb_tree_search(bool value)
void set_clause_activity_decay(double value)
void clear_probing_deterministic_time_limit()
void clear_interleave_batch_size()
::int32_t clause_cleanup_period() const
bool use_dynamic_precedence_in_disjunctive() const
void set_absolute_gap_limit(double value)
bool exploit_all_lp_solution() const
bool has_inprocessing_minimization_use_all_orderings() const
optional bool inprocessing_minimization_use_all_orderings = 298 [default = false];
double probing_deterministic_time_limit() const
bool enumerate_all_solutions() const
void set_max_integer_rounding_scaling(::int32_t value)
void clear_use_probing_search()
bool has_feasibility_jump_linearization_level() const
optional int32 feasibility_jump_linearization_level = 257 [default = 2];
void set_max_memory_in_mb(::int64_t value)
void clear_use_conservative_scale_overload_checker()
static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_DEPTH
double feasibility_jump_decay() const
bool share_objective_bounds() const
void set_clause_cleanup_target(::int32_t value)
const ::std::string & extra_subsolvers(int index) const
bool has_use_pb_resolution() const
optional bool use_pb_resolution = 43 [default = false];
void set_ignore_subsolvers(int index, Arg_ &&value, Args_... args)
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_WITH_REACHABILITY
void set_restart_algorithms(int index, ::operations_research::sat::SatParameters_RestartAlgorithm value)
::int32_t max_cut_rounds_at_level_zero() const
void clear_use_symmetry_in_lp()
void set_restart_running_window_size(::int32_t value)
void clear_use_timetabling_in_no_overlap_2d()
bool has_routing_cut_subset_size_for_tight_binary_relation_bound() const
optional int32 routing_cut_subset_size_for_tight_binary_relation_bound = 313 [default = 0];
void set_preferred_variable_order(::operations_research::sat::SatParameters_VariableOrder value)
void set_use_ls_only(bool value)
void clear_max_time_in_seconds()
bool optimize_with_lb_tree_search() const
::int32_t presolve_bva_threshold() const
int subsolver_params_size() const
repeated .operations_research.sat.SatParameters subsolver_params = 210;
bool has_encode_cumulative_as_reservoir() const
optional bool encode_cumulative_as_reservoir = 287 [default = false];
SatParameters_ClauseProtection ClauseProtection
void clear_mip_compute_true_objective_bound()
void clear_lns_initial_deterministic_limit()
void set_boolean_encoding_level(::int32_t value)
::google::protobuf::RepeatedPtrField<::std::string > *PROTOBUF_NONNULL mutable_subsolvers()
void set_use_symmetry_in_lp(bool value)
bool max_sat_reverse_assumption_order() const
void set_restart_lbd_average_ratio(double value)
void set_restart_period(::int32_t value)
bool has_use_objective_shaving_search() const
optional bool use_objective_shaving_search = 253 [default = false];
bool has_use_shared_tree_search() const
optional bool use_shared_tree_search = 236 [default = false];
::int32_t new_constraints_batch_size() const
void set_stop_after_first_solution(bool value)
void set_log_to_response(bool value)
bool has_use_linear3_for_no_overlap_2d_precedences() const
optional bool use_linear3_for_no_overlap_2d_precedences = 323 [default = true];
void set_allocated_log_prefix(::std::string *PROTOBUF_NULLABLE value)
bool has_root_lp_iterations() const
optional int32 root_lp_iterations = 227 [default = 2000];
void set_max_size_to_create_precedence_literals_in_disjunctive(::int32_t value)
bool log_to_response() const
bool use_timetabling_in_no_overlap_2d() const
void set_mip_treat_high_magnitude_bounds_as_infinity(bool value)
void clear_presolve_probing_deterministic_time_limit()
const ::std::string & default_restart_algorithms() const
void clear_pb_cleanup_ratio()
bool fix_variables_to_their_hinted_value() const
bool has_routing_cut_subset_size_for_shortest_paths_bound() const
optional int32 routing_cut_subset_size_for_shortest_paths_bound = 318 [default = 8];
bool has_use_erwa_heuristic() const
optional bool use_erwa_heuristic = 75 [default = false];
void clear_initial_variables_activity()
void clear_use_disjunctive_constraint_in_cumulative()
bool minimize_reduction_during_pb_resolution() const
::operations_research::sat::SatParameters_ClauseOrdering clause_cleanup_ordering() const
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL BinaryMinizationAlgorithm_descriptor()
bool has_presolve_extract_integer_enforcement() const
optional bool presolve_extract_integer_enforcement = 174 [default = false];
void set_hint_conflict_limit(::int32_t value)
::std::string *PROTOBUF_NONNULL add_subsolvers()
void set_exploit_objective(bool value)
bool use_energetic_reasoning_in_no_overlap_2d() const
void set_add_mir_cuts(bool value)
bool catch_sigint_signal() const
double feasibility_jump_var_randomization_probability() const
double propagation_loop_detection_factor() const
bool has_default_restart_algorithms() const
optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,...
void set_exploit_relaxation_solution(bool value)
void set_initial_polarity(::operations_research::sat::SatParameters_Polarity value)
bool use_rins_lns() const
void set_use_lb_relax_lns(bool value)
void set_allocated_name(::std::string *PROTOBUF_NULLABLE value)
bool stop_after_presolve() const
void clear_debug_max_num_presolve_operations()
bool has_use_lb_relax_lns() const
optional bool use_lb_relax_lns = 255 [default = true];
bool feasibility_jump_enable_restarts() const
void clear_shared_tree_worker_min_restarts_per_subtree()
void set_num_conflicts_before_strategy_changes(::int32_t value)
void clear_mip_max_valid_magnitude()
void clear_random_branches_ratio()
void set_pseudo_cost_reliability_threshold(::int64_t value)
::int32_t solution_pool_size() const
bool has_feasibility_jump_decay() const
optional double feasibility_jump_decay = 242 [default = 0.95];
void clear_shaving_search_deterministic_time()
bool use_conservative_scale_overload_checker() const
void clear_inprocessing_minimization_dtime()
void set_detect_table_with_cost(bool value)
::int64_t pseudo_cost_reliability_threshold() const
void set_num_violation_ls(::int32_t value)
void set_allocated_default_restart_algorithms(::std::string *PROTOBUF_NULLABLE value)
bool has_initial_polarity() const
optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FAL...
void clear_keep_all_feasible_solutions_in_presolve()
bool has_use_disjunctive_constraint_in_cumulative() const
optional bool use_disjunctive_constraint_in_cumulative = 80 [default = true];
double merge_at_most_one_work_limit() const
void clear_clause_activity_decay()
bool has_initial_variables_activity() const
optional double initial_variables_activity = 76 [default = 0];
bool has_mip_scale_large_domain() const
optional bool mip_scale_large_domain = 225 [default = false];
::int32_t at_most_one_max_expansion_size() const
void set_glucose_decay_increment(double value)
void clear_num_search_workers()
void set_count_assumption_levels_in_lbd(bool value)
static constexpr int ConflictMinimizationAlgorithm_ARRAYSIZE
bool has_use_overload_checker_in_cumulative() const
optional bool use_overload_checker_in_cumulative = 78 [default = false];
::int32_t pb_cleanup_increment() const
void set_cut_active_count_decay(double value)
void set_cut_level(::int32_t value)
bool has_clause_cleanup_period() const
optional int32 clause_cleanup_period = 11 [default = 10000];
bool has_use_dynamic_precedence_in_cumulative() const
optional bool use_dynamic_precedence_in_cumulative = 268 [default = false];
bool has_feasibility_jump_var_perburbation_range_ratio() const
optional double feasibility_jump_var_perburbation_range_ratio = 248 [default = 0.2];
bool has_use_phase_saving() const
optional bool use_phase_saving = 44 [default = true];
::operations_research::sat::SatParameters_BinaryMinizationAlgorithm binary_minimization_algorithm() const
bool has_auto_detect_greater_than_at_least_one_of() const
optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
void clear_fix_variables_to_their_hinted_value()
::int32_t variables_shaving_level() const
void clear_max_variable_activity_value()
void set_share_level_zero_bounds(bool value)
bool has_clause_cleanup_ordering() const
optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default ...
bool has_polarity_exploit_ls_hints() const
optional bool polarity_exploit_ls_hints = 309 [default = false];
void clear_routing_cut_subset_size_for_exact_binary_relation_bound()
void set_use_blocking_restart(bool value)
void set_table_compression_level(::int32_t value)
bool has_keep_symmetry_in_presolve() const
optional bool keep_symmetry_in_presolve = 303 [default = false];
double merge_no_overlap_work_limit() const
void clear_glucose_decay_increment()
::int32_t max_pairs_pairwise_reasoning_in_no_overlap_2d() const
void set_add_zero_half_cuts(bool value)
void clear_glucose_decay_increment_period()
bool has_minimize_reduction_during_pb_resolution() const
optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
void CopyFrom(const SatParameters &from)
::int32_t max_domain_size_when_encoding_eq_neq_constraints() const
bool has_use_exact_lp_reason() const
optional bool use_exact_lp_reason = 109 [default = true];
bool has_feasibility_jump_batch_dtime() const
optional double feasibility_jump_batch_dtime = 292 [default = 0.1];
void set_diversify_lns_params(bool value)
bool has_add_clique_cuts() const
optional bool add_clique_cuts = 172 [default = true];
bool keep_all_feasible_solutions_in_presolve() const
void clear_polish_lp_solution()
void clear_min_orthogonality_for_lp_constraints()
bool diversify_lns_params() const
void clear_symmetry_level()
void clear_extra_subsolvers()
void set_use_phase_saving(bool value)
bool has_inprocessing_minimization_dtime() const
optional double inprocessing_minimization_dtime = 275 [default = 1];
bool use_objective_shaving_search() const
::int64_t search_random_variable_pool_size() const
::int32_t routing_cut_subset_size_for_binary_relation_bound() const
void clear_feasibility_jump_enable_restarts()
bool polish_lp_solution() const
bool has_cut_max_active_count_value() const
optional double cut_max_active_count_value = 155 [default = 10000000000];
void clear_encode_cumulative_as_reservoir()
bool use_exact_lp_reason() const
void set_core_minimization_level(::int32_t value)
void set_minimize_shared_clauses(bool value)
bool stop_after_root_propagation() const
bool has_remove_fixed_variables_early() const
optional bool remove_fixed_variables_early = 310 [default = true];
bool has_debug_postsolve_with_full_solver() const
optional bool debug_postsolve_with_full_solver = 162 [default = false];
void add_restart_algorithms(::operations_research::sat::SatParameters_RestartAlgorithm value)
void clear_feasibility_jump_var_perburbation_range_ratio()
void clear_add_rlt_cuts()
bool has_random_seed() const
optional int32 random_seed = 31 [default = 1];
static constexpr RestartAlgorithm DL_MOVING_AVERAGE_RESTART
bool has_num_conflicts_before_strategy_changes() const
optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
bool has_shared_tree_num_workers() const
optional int32 shared_tree_num_workers = 235 [default = 0];
bool only_add_cuts_at_level_zero() const
void clear_mip_check_precision()
double violation_ls_compound_move_probability() const
void set_violation_ls_compound_move_probability(double value)
void clear_use_absl_random()
const ::std::string & log_prefix() const
bool has_only_add_cuts_at_level_zero() const
optional bool only_add_cuts_at_level_zero = 92 [default = false];
void clear_max_sat_stratification()
void clear_lb_relax_num_workers_threshold()
bool add_objective_cut() const
bool has_mip_max_activity_exponent() const
optional int32 mip_max_activity_exponent = 127 [default = 53];
void clear_absolute_gap_limit()
void set_cp_model_presolve(bool value)
void clear_use_area_energetic_reasoning_in_no_overlap_2d()
::int32_t mip_presolve_level() const
void set_clause_cleanup_lbd_bound(::int32_t value)
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL ConflictMinimizationAlgorithm_descriptor()
double mip_max_valid_magnitude() const
void clear_exploit_all_lp_solution()
void set_presolve_extract_integer_enforcement(bool value)
bool has_random_branches_ratio() const
optional double random_branches_ratio = 32 [default = 0];
void clear_use_dynamic_precedence_in_disjunctive()
void clear_feasibility_jump_var_randomization_probability()
bool has_lp_primal_tolerance() const
optional double lp_primal_tolerance = 266 [default = 1e-07];
bool has_max_num_intervals_for_timetable_edge_finding() const
optional int32 max_num_intervals_for_timetable_edge_finding = 260 [default = 100];
double max_variable_activity_value() const
bool has_add_lin_max_cuts() const
optional bool add_lin_max_cuts = 152 [default = true];
void set_feasibility_jump_batch_dtime(double value)
static constexpr FPRoundingMethod LOCK_BASED
static bool RestartAlgorithm_IsValid(int value)
bool has_exploit_relaxation_solution() const
optional bool exploit_relaxation_solution = 161 [default = false];
::google::protobuf::RepeatedPtrField<::std::string > *PROTOBUF_NONNULL mutable_extra_subsolvers()
bool has_keep_all_feasible_solutions_in_presolve() const
optional bool keep_all_feasible_solutions_in_presolve = 173 [default = false];
void set_detect_linearized_product(bool value)
void clear_use_pb_resolution()
void set_subsumption_during_conflict_analysis(bool value)
void set_min_orthogonality_for_lp_constraints(double value)
void clear_use_feasibility_jump()
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST
bool save_lp_basis_in_lb_tree_search() const
void set_glucose_max_decay(double value)
void set_use_sat_inprocessing(bool value)
void clear_linearization_level()
double max_deterministic_time() const
void set_max_number_of_conflicts(::int64_t value)
bool has_use_hard_precedences_in_cumulative() const
optional bool use_hard_precedences_in_cumulative = 215 [default = false];
static constexpr FPRoundingMethod PROPAGATION_ASSISTED
bool use_extended_probing() const
double clause_cleanup_ratio() const
bool has_find_multiple_cores() const
optional bool find_multiple_cores = 84 [default = true];
::operations_research::sat::SatParameters_RestartAlgorithm restart_algorithms(int index) const
void set_routing_cut_subset_size_for_binary_relation_bound(::int32_t value)
void clear_use_strong_propagation_in_disjunctive()
void set_shared_tree_worker_min_restarts_per_subtree(::int32_t value)
void set_add_objective_cut(bool value)
bool has_shared_tree_worker_enable_trail_sharing() const
optional bool shared_tree_worker_enable_trail_sharing = 295 [default = true];
void set_routing_cut_max_infeasible_path_length(::int32_t value)
void clear_use_lns_only()
bool has_shared_tree_open_leaves_per_worker() const
optional double shared_tree_open_leaves_per_worker = 281 [default = 2];
bool has_binary_search_num_conflicts() const
optional int32 binary_search_num_conflicts = 99 [default = -1];
void clear_add_objective_cut()
bool has_use_feasibility_pump() const
optional bool use_feasibility_pump = 164 [default = true];
static constexpr SearchBranching RANDOMIZED_SEARCH
bool has_symmetry_detection_deterministic_time_limit() const
optional double symmetry_detection_deterministic_time_limit = 302 [default = 1];
void clear_optimize_with_lb_tree_search()
::int32_t shared_tree_worker_min_restarts_per_subtree() const
void clear_use_hard_precedences_in_cumulative()
double shaving_deterministic_time_in_probing_search() const
bool auto_detect_greater_than_at_least_one_of() const
void clear_minimization_algorithm()
void clear_only_add_cuts_at_level_zero()
double initial_variables_activity() const
const ::google::protobuf::RepeatedPtrField<::std::string > & filter_subsolvers() const
void set_lp_primal_tolerance(double value)
::int32_t table_compression_level() const
void clear_shared_tree_split_strategy()
bool has_share_binary_clauses() const
optional bool share_binary_clauses = 203 [default = true];
void clear_use_erwa_heuristic()
void set_optimize_with_max_hs(bool value)
void set_pb_cleanup_increment(::int32_t value)
bool has_lns_initial_deterministic_limit() const
optional double lns_initial_deterministic_limit = 308 [default = 0.1];
bool has_diversify_lns_params() const
optional bool diversify_lns_params = 137 [default = false];
const ::google::protobuf::RepeatedPtrField<::std::string > & ignore_subsolvers() const
bool fill_additional_solutions_in_response() const
SatParameters_MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm
bool has_boolean_encoding_level() const
optional int32 boolean_encoding_level = 107 [default = 1];
int restart_algorithms_size() const
repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
bool has_relative_gap_limit() const
optional double relative_gap_limit = 160 [default = 0];
static constexpr int SearchBranching_ARRAYSIZE
void set_use_shared_tree_search(bool value)
void set_keep_all_feasible_solutions_in_presolve(bool value)
bool exploit_integer_lp_solution() const
bool use_disjunctive_constraint_in_cumulative() const
bool has_max_all_diff_cut_size() const
optional int32 max_all_diff_cut_size = 148 [default = 64];
void clear_cut_max_active_count_value()
bool has_presolve_use_bva() const
optional bool presolve_use_bva = 72 [default = true];
bool expand_alldiff_constraints() const
void clear_routing_cut_subset_size_for_shortest_paths_bound()
void clear_share_binary_clauses()
void clear_shared_tree_open_leaves_per_worker()
::operations_research::sat::SatParameters_FPRoundingMethod fp_rounding() const
void set_feasibility_jump_linearization_level(::int32_t value)
bool stop_after_first_solution() const
bool subsumption_during_conflict_analysis() const
void clear_use_implied_bounds()
bool add_lin_max_cuts() const
void set_symmetry_level(::int32_t value)
void clear_presolve_bva_threshold()
void clear_max_pairs_pairwise_reasoning_in_no_overlap_2d()
void set_permute_presolve_constraint_order(bool value)
bool log_subsolver_statistics() const
SatParameters_SharedTreeSplitStrategy SharedTreeSplitStrategy
::int64_t max_number_of_conflicts() const
void clear_lp_dual_tolerance()
bool has_mip_treat_high_magnitude_bounds_as_infinity() const
optional bool mip_treat_high_magnitude_bounds_as_infinity = 278 [default = false];
bool use_optional_variables() const
void clear_find_big_linear_overlap()
void clear_randomize_search()
void set_exploit_all_lp_solution(bool value)
void set_use_implied_bounds(bool value)
void set_use_energetic_reasoning_in_no_overlap_2d(bool value)
::int32_t shared_tree_max_nodes_per_worker() const
bool has_max_integer_rounding_scaling() const
optional int32 max_integer_rounding_scaling = 119 [default = 600];
SatParameters_VariableOrder VariableOrder
nested types -------------------------------------------------—
bool has_instantiate_all_variables() const
optional bool instantiate_all_variables = 106 [default = true];
bool has_log_prefix() const
optional string log_prefix = 185 [default = ""];
bool has_fix_variables_to_their_hinted_value() const
optional bool fix_variables_to_their_hinted_value = 192 [default = false];
bool use_phase_saving() const
::google::protobuf::RepeatedPtrField<::std::string > *PROTOBUF_NONNULL mutable_ignore_subsolvers()
bool has_cut_active_count_decay() const
optional double cut_active_count_decay = 156 [default = 0.8];
void set_use_precedences_in_disjunctive_constraint(bool value)
void clear_stop_after_root_propagation()
void set_merge_at_most_one_work_limit(double value)
bool has_maximum_regions_to_split_in_disconnected_no_overlap_2d() const
optional int32 maximum_regions_to_split_in_disconnected_no_overlap_2d = 315 [default = 0];
bool use_pb_resolution() const
void clear_use_shared_tree_search()
bool ignore_names() const
void clear_binary_search_num_conflicts()
::int32_t routing_cut_subset_size_for_tight_binary_relation_bound() const
bool add_rlt_cuts() const
bool has_convert_intervals() const
optional bool convert_intervals = 177 [default = true];
void set_inprocessing_minimization_use_all_orderings(bool value)
bool has_violation_ls_compound_move_probability() const
optional double violation_ls_compound_move_probability = 259 [default = 0.5];
bool has_debug_crash_if_presolve_breaks_hint() const
optional bool debug_crash_if_presolve_breaks_hint = 306 [default = false];
double share_glue_clauses_dtime() const
bool has_max_consecutive_inactive_count() const
optional int32 max_consecutive_inactive_count = 121 [default = 100];
bool has_use_optional_variables() const
optional bool use_optional_variables = 108 [default = false];
void clear_ignore_names()
bool has_max_pairs_pairwise_reasoning_in_no_overlap_2d() const
optional int32 max_pairs_pairwise_reasoning_in_no_overlap_2d = 276 [default = 1250];
void clear_inprocessing_probing_dtime()
bool has_use_probing_search() const
optional bool use_probing_search = 176 [default = false];
static constexpr ClauseProtection PROTECTION_LBD
bool has_use_feasibility_jump() const
optional bool use_feasibility_jump = 265 [default = true];
void set_fp_rounding(::operations_research::sat::SatParameters_FPRoundingMethod value)
bool has_use_timetable_edge_finding_in_cumulative() const
optional bool use_timetable_edge_finding_in_cumulative = 79 [default = false];
void set_linear_split_size(::int32_t value)
void clear_restart_lbd_average_ratio()
void clear_cp_model_use_sat_presolve()
void set_random_polarity_ratio(double value)
void set_presolve_substitution_level(::int32_t value)
void set_linearization_level(::int32_t value)
bool use_objective_lb_search() const
void set_debug_max_num_presolve_operations(::int32_t value)
void clear_detect_linearized_product()
bool has_disable_constraint_expansion() const
optional bool disable_constraint_expansion = 181 [default = false];
void clear_new_constraints_batch_size()
static constexpr int Polarity_ARRAYSIZE
void set_add_rlt_cuts(bool value)
void clear_blocking_restart_multiplier()
bool use_sat_inprocessing() const
static constexpr int BinaryMinizationAlgorithm_ARRAYSIZE
void clear_routing_cut_subset_size_for_tight_binary_relation_bound()
double pb_cleanup_ratio() const
bool has_lb_relax_num_workers_threshold() const
optional int32 lb_relax_num_workers_threshold = 296 [default = 16];
void set_share_glue_clauses(bool value)
void clear_enumerate_all_solutions()
void set_use_strong_propagation_in_disjunctive(bool value)
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SearchBranching_descriptor()
static constexpr MaxSatStratificationAlgorithm STRATIFICATION_DESCENT
bool has_exploit_all_precedences() const
optional bool exploit_all_precedences = 220 [default = false];
double symmetry_detection_deterministic_time_limit() const
bool has_fp_rounding() const
optional .operations_research.sat.SatParameters.FPRoundingMethod fp_rounding = 165 [default = PROPAGA...
void clear_detect_table_with_cost()
void clear_mip_max_activity_exponent()
void clear_max_number_of_conflicts()
void clear_max_num_intervals_for_timetable_edge_finding()
void set_use_dual_scheduling_heuristics(bool value)
void set_optimize_with_lb_tree_search(bool value)
void set_use_optional_variables(bool value)
::int32_t mip_max_activity_exponent() const
void set_shaving_deterministic_time_in_probing_search(double value)
bool has_variables_shaving_level() const
optional int32 variables_shaving_level = 289 [default = -1];
void set_probing_num_combinations_limit(::int32_t value)
::operations_research::sat::SatParameters *PROTOBUF_NONNULL add_subsolver_params()
void clear_presolve_substitution_level()
void clear_add_clique_cuts()
bool use_lns_only() const
bool has_shared_tree_worker_min_restarts_per_subtree() const
optional int32 shared_tree_worker_min_restarts_per_subtree = 282 [default = 1];
void set_presolve_use_bva(bool value)
void clear_exploit_integer_lp_solution()
bool has_use_all_different_for_circuit() const
optional bool use_all_different_for_circuit = 311 [default = false];
void set_shared_tree_max_nodes_per_worker(::int32_t value)
void set_exploit_integer_lp_solution(bool value)
bool has_use_dynamic_precedence_in_disjunctive() const
optional bool use_dynamic_precedence_in_disjunctive = 263 [default = false];
void clear_inprocessing_minimization_use_all_orderings()
void set_root_lp_iterations(::int32_t value)
bool permute_presolve_constraint_order() const
void clear_permute_variable_randomly()
bool has_symmetry_level() const
optional int32 symmetry_level = 183 [default = 2];
void clear_minimize_reduction_during_pb_resolution()
::int32_t max_presolve_iterations() const
SatParameters_SearchBranching SearchBranching
::int32_t blocking_restart_window_size() const
::int32_t binary_search_num_conflicts() const
static constexpr SearchBranching FIXED_SEARCH
::int32_t polarity_rephase_increment() const
double inprocessing_probing_dtime() const
::operations_research::sat::SatParameters_VariableOrder preferred_variable_order() const
bool has_use_timetabling_in_no_overlap_2d() const
optional bool use_timetabling_in_no_overlap_2d = 200 [default = false];
bool optimize_with_core() const
void clear_add_lin_max_cuts()
bool use_erwa_heuristic() const
void set_max_pairs_pairwise_reasoning_in_no_overlap_2d(::int32_t value)
void clear_clause_cleanup_ordering()
bool has_absolute_gap_limit() const
optional double absolute_gap_limit = 159 [default = 0.0001];
void clear_debug_crash_on_bad_hint()
bool has_log_to_stdout() const
optional bool log_to_stdout = 186 [default = true];
::int32_t boolean_encoding_level() const
bool has_stop_after_presolve() const
optional bool stop_after_presolve = 149 [default = false];
void set_max_cut_rounds_at_level_zero(::int32_t value)
static constexpr FPRoundingMethod ACTIVE_LOCK_BASED
double lp_primal_tolerance() const
bool has_inprocessing_dtime_ratio() const
optional double inprocessing_dtime_ratio = 273 [default = 0.2];
bool has_inprocessing_minimization_use_conflict_analysis() const
optional bool inprocessing_minimization_use_conflict_analysis = 297 [default = true];
void clear_use_extended_probing()
::int32_t shared_tree_num_workers() const
void clear_cover_optimization()
static constexpr ConflictMinimizationAlgorithm SIMPLE
void clear_table_compression_level()
bool has_feasibility_jump_var_randomization_probability() const
optional double feasibility_jump_var_randomization_probability = 247 [default = 0....
void set_polarity_rephase_increment(::int32_t value)
::int32_t feasibility_jump_restart_factor() const
void set_use_overload_checker_in_cumulative(bool value)
void set_find_big_linear_overlap(bool value)
bool has_clause_cleanup_protection() const
optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [defa...
void set_log_to_stdout(bool value)
void set_use_extended_probing(bool value)
bool has_max_clause_activity_value() const
optional double max_clause_activity_value = 18 [default = 1e+20];
void set_presolve_blocked_clause(bool value)
void clear_clause_cleanup_lbd_bound()
void clear_presolve_inclusion_work_limit()
bool has_use_implied_bounds() const
optional bool use_implied_bounds = 144 [default = true];
bool has_push_all_tasks_toward_start() const
optional bool push_all_tasks_toward_start = 262 [default = false];
void set_use_exact_lp_reason(bool value)
void set_num_workers(::int32_t value)
void set_filter_subsolvers(int index, Arg_ &&value, Args_... args)
void set_use_feasibility_pump(bool value)
void clear_exploit_relaxation_solution()
double random_polarity_ratio() const
void clear_max_size_to_create_precedence_literals_in_disjunctive()
bool use_shared_tree_search() const
bool has_max_size_to_create_precedence_literals_in_disjunctive() const
optional int32 max_size_to_create_precedence_literals_in_disjunctive = 229 [default = 60];
static constexpr MaxSatStratificationAlgorithm STRATIFICATION_ASCENT
bool has_max_memory_in_mb() const
optional int64 max_memory_in_mb = 40 [default = 10000];
void set_mip_presolve_level(::int32_t value)
const ::std::string & subsolvers(int index) const
void set_encode_cumulative_as_reservoir(bool value)
static constexpr SearchBranching PSEUDO_COST_SEARCH
static bool BinaryMinizationAlgorithm_IsValid(int value)
::int32_t max_num_deterministic_batches() const
void set_use_linear3_for_no_overlap_2d_precedences(bool value)
void set_convert_intervals(bool value)
static bool VariableOrder_IsValid(int value)
void clear_use_objective_lb_search()
::int32_t max_num_cuts() const
void clear_use_optimization_hints()
bool has_presolve_bve_clause_weight() const
optional int32 presolve_bve_clause_weight = 55 [default = 3];
void set_use_timetabling_in_no_overlap_2d(bool value)
void clear_shared_tree_max_nodes_per_worker()
bool add_clique_cuts() const
bool push_all_tasks_toward_start() const
void set_interleave_search(bool value)
bool log_search_progress() const
bool has_table_compression_level() const
optional int32 table_compression_level = 217 [default = 2];
void set_inprocessing_minimization_dtime(double value)
bool has_share_level_zero_bounds() const
optional bool share_level_zero_bounds = 114 [default = true];
void set_max_clause_activity_value(double value)
void set_stop_after_presolve(bool value)
bool has_save_lp_basis_in_lb_tree_search() const
optional bool save_lp_basis_in_lb_tree_search = 284 [default = false];
void clear_expand_reservoir_constraints()
void clear_no_overlap_2d_boolean_relations_limit()
bool has_interleave_search() const
optional bool interleave_search = 136 [default = false];
void set_clause_cleanup_period(::int32_t value)
double feasibility_jump_var_perburbation_range_ratio() const
::std::string *PROTOBUF_NULLABLE release_default_restart_algorithms()
::int32_t core_minimization_level() const
void set_lns_initial_difficulty(double value)
bool has_exploit_best_solution() const
optional bool exploit_best_solution = 130 [default = false];
::int32_t max_all_diff_cut_size() const
bool has_presolve_blocked_clause() const
optional bool presolve_blocked_clause = 88 [default = true];
bool disable_constraint_expansion() const
void clear_fill_additional_solutions_in_response()
bool has_mip_check_precision() const
optional double mip_check_precision = 128 [default = 0.0001];
void clear_remove_fixed_variables_early()
bool has_lp_dual_tolerance() const
optional double lp_dual_tolerance = 267 [default = 1e-07];
void clear_cp_model_probing_level()
void set_use_lns(bool value)
bool use_dual_scheduling_heuristics() const
double mip_wanted_precision() const
void clear_minimize_shared_clauses()
bool presolve_extract_integer_enforcement() const
bool has_use_conservative_scale_overload_checker() const
optional bool use_conservative_scale_overload_checker = 286 [default = false];
::int32_t clause_cleanup_target() const
void clear_cp_model_presolve()
bool has_presolve_bva_threshold() const
optional int32 presolve_bva_threshold = 73 [default = 1];
void clear_presolve_bve_threshold()
static constexpr ClauseProtection PROTECTION_ALWAYS
void set_max_sat_assumption_order(::operations_research::sat::SatParameters_MaxSatAssumptionOrder value)
void clear_restart_dl_average_ratio()
void clear_inprocessing_dtime_ratio()
void clear_mip_presolve_level()
double lns_initial_deterministic_limit() const
void clear_clause_cleanup_ratio()
void set_merge_no_overlap_work_limit(double value)
void clear_random_polarity_ratio()
bool use_implied_bounds() const
bool has_feasibility_jump_restart_factor() const
optional int32 feasibility_jump_restart_factor = 258 [default = 1];
void set_optimize_with_core(bool value)
bool has_share_objective_bounds() const
optional bool share_objective_bounds = 113 [default = true];
SatParameters(const SatParameters &from)
bool has_infer_all_diffs() const
optional bool infer_all_diffs = 233 [default = true];
SatParameters_ClauseOrdering ClauseOrdering
bool has_use_absl_random() const
optional bool use_absl_random = 180 [default = false];
void clear_presolve_use_bva()
void clear_exploit_all_precedences()
bool cover_optimization() const
void clear_only_solve_ip()
double mip_max_bound() const
void set_subsolvers(int index, Arg_ &&value, Args_... args)
void set_presolve_bva_threshold(::int32_t value)
bool has_ignore_names() const
optional bool ignore_names = 202 [default = true];
bool has_routing_cut_max_infeasible_path_length() const
optional int32 routing_cut_max_infeasible_path_length = 317 [default = 6];
bool has_presolve_inclusion_work_limit() const
optional int64 presolve_inclusion_work_limit = 201 [default = 100000000];
void set_at_most_one_max_expansion_size(::int32_t value)
bool has_max_sat_assumption_order() const
optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [...
void clear_use_exact_lp_reason()
bool find_multiple_cores() const
void clear_use_objective_shaving_search()
void set_random_seed(::int32_t value)
void clear_shared_tree_worker_enable_phase_sharing()
void set_add_lin_max_cuts(bool value)
void set_max_variable_activity_value(double value)
void set_encode_complex_linear_constraint_with_integer(bool value)
bool IsInitialized() const
::int32_t presolve_substitution_level() const
bool has_share_glue_clauses() const
optional bool share_glue_clauses = 285 [default = false];
bool use_linear3_for_no_overlap_2d_precedences() const
void set_use_disjunctive_constraint_in_cumulative(bool value)
void set_feasibility_jump_var_randomization_probability(double value)
void set_presolve_bve_clause_weight(::int32_t value)
void clear_max_clause_activity_value()
bool has_mip_automatically_scale_variables() const
optional bool mip_automatically_scale_variables = 166 [default = true];
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION
bool has_pb_cleanup_increment() const
optional int32 pb_cleanup_increment = 46 [default = 200];
double mip_drop_tolerance() const
bool has_num_violation_ls() const
optional int32 num_violation_ls = 244 [default = 0];
double glucose_decay_increment() const
bool has_add_rlt_cuts() const
optional bool add_rlt_cuts = 279 [default = true];
bool has_probing_num_combinations_limit() const
optional int32 probing_num_combinations_limit = 272 [default = 20000];
void set_use_dynamic_precedence_in_cumulative(bool value)
bool has_presolve_bve_threshold() const
optional int32 presolve_bve_threshold = 54 [default = 500];
bool randomize_search() const
void clear_use_precedences_in_disjunctive_constraint()
void clear_interleave_search()
void set_use_dynamic_precedence_in_disjunctive(bool value)
void clear_max_sat_assumption_order()
void set_use_all_different_for_circuit(bool value)
bool has_feasibility_jump_max_expanded_constraint_size() const
optional int32 feasibility_jump_max_expanded_constraint_size = 264 [default = 500];
void set_use_objective_shaving_search(bool value)
bool has_max_cut_rounds_at_level_zero() const
optional int32 max_cut_rounds_at_level_zero = 154 [default = 1];
void clear_use_dual_scheduling_heuristics()
::int32_t clause_cleanup_lbd_bound() const
void set_routing_cut_dp_effort(double value)
void set_max_sat_reverse_assumption_order(bool value)
bool has_cover_optimization() const
optional bool cover_optimization = 89 [default = true];
void clear_search_branching()
static constexpr int MaxSatStratificationAlgorithm_ARRAYSIZE
void set_shared_tree_balance_tolerance(::int32_t value)
void set_ignore_names(bool value)
void clear_restart_running_window_size()
double shaving_search_deterministic_time() const
void set_mip_var_scaling(double value)
bool has_blocking_restart_window_size() const
optional int32 blocking_restart_window_size = 65 [default = 5000];
void set_infer_all_diffs(bool value)
void set_max_sat_stratification(::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm value)
void clear_permute_presolve_constraint_order()
bool use_hard_precedences_in_cumulative() const
bool use_timetable_edge_finding_in_cumulative() const
bool shared_tree_worker_enable_phase_sharing() const
void clear_new_linear_propagation()
::operations_research::sat::SatParameters *PROTOBUF_NONNULL mutable_subsolver_params(int index)
bool share_binary_clauses() const
void clear_maximum_regions_to_split_in_disconnected_no_overlap_2d()
bool has_restart_period() const
optional int32 restart_period = 30 [default = 50];
double restart_lbd_average_ratio() const
void clear_max_deterministic_time()
void set_feasibility_jump_enable_restarts(bool value)
bool mip_treat_high_magnitude_bounds_as_infinity() const
bool has_max_number_of_conflicts() const
optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
::operations_research::sat::SatParameters_ClauseProtection clause_cleanup_protection() const
void clear_use_feasibility_pump()
::operations_research::sat::SatParameters_SharedTreeSplitStrategy shared_tree_split_strategy() const
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL ClauseProtection_descriptor()
void clear_subsumption_during_conflict_analysis()
void clear_merge_at_most_one_work_limit()
void clear_use_lb_relax_lns()
bool cp_model_use_sat_presolve() const
void set_maximum_regions_to_split_in_disconnected_no_overlap_2d(::int32_t value)
void clear_also_bump_variables_in_conflict_reasons()
bool has_minimize_shared_clauses() const
optional bool minimize_shared_clauses = 300 [default = true];
void set_use_objective_lb_search(bool value)
::operations_research::sat::SatParameters_Polarity initial_polarity() const
bool add_mir_cuts() const
bool has_use_lns_only() const
optional bool use_lns_only = 101 [default = false];
SatParameters_BinaryMinizationAlgorithm BinaryMinizationAlgorithm
static bool ClauseOrdering_IsValid(int value)
void set_max_alldiff_domain_size(::int32_t value)
bool has_use_optimization_hints() const
optional bool use_optimization_hints = 35 [default = true];
::std::string *PROTOBUF_NULLABLE release_name()
const ::std::string & name() const
void set_violation_ls_perturbation_period(::int32_t value)
::int32_t cut_cleanup_target() const
bool has_search_branching() const
optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTO...
bool has_mip_var_scaling() const
optional double mip_var_scaling = 125 [default = 1];
void clear_mip_wanted_precision()
void set_cut_cleanup_target(::int32_t value)
void set_exploit_all_precedences(bool value)
::int32_t symmetry_level() const
void set_filter_sat_postsolve_clauses(bool value)
bool has_use_sat_inprocessing() const
optional bool use_sat_inprocessing = 163 [default = true];
void set_fill_additional_solutions_in_response(bool value)
void set_max_all_diff_cut_size(::int32_t value)
static constexpr SearchBranching HINT_SEARCH
void clear_restart_period()
void set_use_absl_random(bool value)
void set_debug_postsolve_with_full_solver(bool value)
bool has_clause_activity_decay() const
optional double clause_activity_decay = 17 [default = 0.999];
::int32_t cp_model_probing_level() const
bool mip_compute_true_objective_bound() const
void set_share_glue_clauses_dtime(double value)
void clear_add_zero_half_cuts()
bool debug_crash_if_presolve_breaks_hint() const
bool has_exploit_objective() const
optional bool exploit_objective = 131 [default = true];
bool has_encode_complex_linear_constraint_with_integer() const
optional bool encode_complex_linear_constraint_with_integer = 223 [default = false];
bool shared_tree_worker_enable_trail_sharing() const
bool has_randomize_search() const
optional bool randomize_search = 103 [default = false];
::int32_t debug_max_num_presolve_operations() const
void clear_linear_split_size()
void clear_use_sat_inprocessing()
bool has_also_bump_variables_in_conflict_reasons() const
optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
void set_log_search_progress(bool value)
void clear_diversify_lns_params()
::int32_t feasibility_jump_max_expanded_constraint_size() const
const ::std::string & filter_subsolvers(int index) const
SatParameters_Polarity Polarity
static constexpr RestartAlgorithm LBD_MOVING_AVERAGE_RESTART
void clear_shaving_deterministic_time_in_probing_search()
bool has_add_objective_cut() const
optional bool add_objective_cut = 197 [default = false];
void set_use_combined_no_overlap(bool value)
::operations_research::sat::SatParameters_SearchBranching search_branching() const
bool has_search_random_variable_pool_size() const
optional int64 search_random_variable_pool_size = 104 [default = 0];
bool has_max_deterministic_time() const
optional double max_deterministic_time = 67 [default = inf];
SatParameters_FPRoundingMethod FPRoundingMethod
double restart_dl_average_ratio() const
bool has_cp_model_presolve() const
optional bool cp_model_presolve = 86 [default = true];
void set_use_timetable_edge_finding_in_cumulative(bool value)
void set_share_objective_bounds(bool value)
SatParameters_MaxSatAssumptionOrder MaxSatAssumptionOrder
void clear_glucose_max_decay()
void clear_violation_ls_perturbation_period()
double random_branches_ratio() const
void clear_max_num_deterministic_batches()
void set_fill_tightened_domains_in_response(bool value)
void set_use_pb_resolution(bool value)
bool mip_scale_large_domain() const
double routing_cut_dp_effort() const
static constexpr SharedTreeSplitStrategy SPLIT_STRATEGY_OBJECTIVE_LB
void clear_shared_tree_worker_enable_trail_sharing()
void clear_use_phase_saving()
bool presolve_blocked_clause() const
void set_mip_max_bound(double value)
void set_relative_gap_limit(double value)
::std::string *PROTOBUF_NONNULL add_ignore_subsolvers()
bool has_num_workers() const
optional int32 num_workers = 206 [default = 0];
void clear_polarity_exploit_ls_hints()
static constexpr VariableOrder IN_RANDOM_ORDER
void set_minimize_reduction_during_pb_resolution(bool value)
bool has_num_full_subsolvers() const
optional int32 num_full_subsolvers = 294 [default = 0];
bool has_share_glue_clauses_dtime() const
optional double share_glue_clauses_dtime = 322 [default = 1];
bool infer_all_diffs() const
static constexpr int ClauseOrdering_ARRAYSIZE
::int64_t presolve_inclusion_work_limit() const
bool has_max_time_in_seconds() const
optional double max_time_in_seconds = 36 [default = inf];
void set_propagation_loop_detection_factor(double value)
void set_polish_lp_solution(bool value)
void set_instantiate_all_variables(bool value)
::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters > *PROTOBUF_NONNULL mutable_subsolver_params()
void set_max_lin_max_size_for_expansion(::int32_t value)
const ::google::protobuf::RepeatedPtrField<::std::string > & extra_subsolvers() const
const ::google::protobuf::RepeatedField< int > & restart_algorithms() const
bool has_max_variable_activity_value() const
optional double max_variable_activity_value = 16 [default = 1e+100];
bool exploit_objective() const
static constexpr SharedTreeSplitStrategy SPLIT_STRATEGY_FIRST_PROPOSAL
void clear_cut_cleanup_target()
void set_add_cg_cuts(bool value)
SatParameters & operator=(const SatParameters &from)
void clear_share_objective_bounds()
bool has_use_ls_only() const
optional bool use_ls_only = 240 [default = false];
void set_max_num_intervals_for_timetable_edge_finding(::int32_t value)
bool has_binary_minimization_algorithm() const
optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorit...
void clear_core_minimization_level()
::int32_t glucose_decay_increment_period() const
::int32_t cut_level() const
bool inprocessing_minimization_use_conflict_analysis() const
::int32_t max_alldiff_domain_size() const
bool filter_sat_postsolve_clauses() const
void set_binary_search_num_conflicts(::int32_t value)
bool has_expand_alldiff_constraints() const
optional bool expand_alldiff_constraints = 170 [default = false];
::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm minimization_algorithm() const
void set_expand_reservoir_constraints(bool value)
double mip_var_scaling() const
::int32_t random_seed() const
void clear_exploit_objective()
void set_add_lp_constraints_lazily(bool value)
bool has_restart_lbd_average_ratio() const
optional double restart_lbd_average_ratio = 71 [default = 1];
void clear_solution_pool_size()
static bool ClauseProtection_IsValid(int value)
bool remove_fixed_variables_early() const
void clear_mip_treat_high_magnitude_bounds_as_infinity()
::std::string *PROTOBUF_NONNULL mutable_extra_subsolvers(int index)
bool has_routing_cut_subset_size_for_exact_binary_relation_bound() const
optional int32 routing_cut_subset_size_for_exact_binary_relation_bound = 316 [default = 8];
::std::string *PROTOBUF_NONNULL mutable_name()
static constexpr VariableOrder IN_REVERSE_ORDER
bool polarity_exploit_ls_hints() const
const ::google::protobuf::RepeatedPtrField<::operations_research::sat::SatParameters > & subsolver_params() const
bool has_polish_lp_solution() const
optional bool polish_lp_solution = 175 [default = false];
void clear_use_linear3_for_no_overlap_2d_precedences()
void set_name(Arg_ &&arg, Args_... args)
void clear_add_lp_constraints_lazily()
double presolve_probing_deterministic_time_limit() const
void set_expand_reservoir_using_circuit(bool value)
void clear_num_full_subsolvers()
void set_probing_deterministic_time_limit(double value)
static constexpr SearchBranching PORTFOLIO_WITH_QUICK_RESTART_SEARCH
bool has_violation_ls_perturbation_period() const
optional int32 violation_ls_perturbation_period = 249 [default = 100];
void clear_feasibility_jump_decay()
bool has_min_orthogonality_for_lp_constraints() const
optional double min_orthogonality_for_lp_constraints = 115 [default = 0.05];
void clear_save_lp_basis_in_lb_tree_search()
int filter_subsolvers_size() const
repeated string filter_subsolvers = 293;
void clear_num_violation_ls()
bool share_level_zero_bounds() const
bool has_preferred_variable_order() const
optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default =...
bool has_exploit_integer_lp_solution() const
optional bool exploit_integer_lp_solution = 94 [default = true];
bool has_mip_wanted_precision() const
optional double mip_wanted_precision = 126 [default = 1e-06];
bool has_clause_cleanup_target() const
optional int32 clause_cleanup_target = 13 [default = 0];
void clear_variable_activity_decay()
int extra_subsolvers_size() const
repeated string extra_subsolvers = 219;
bool has_pseudo_cost_reliability_threshold() const
optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
void set_permute_variable_randomly(bool value)
void clear_add_mir_cuts()
void set_expand_alldiff_constraints(bool value)
bool has_stop_after_first_solution() const
optional bool stop_after_first_solution = 98 [default = false];
bool has_optimize_with_core() const
optional bool optimize_with_core = 83 [default = false];
void clear_share_glue_clauses()
void set_no_overlap_2d_boolean_relations_limit(::int32_t value)
void clear_use_combined_no_overlap()
bool minimize_shared_clauses() const
void set_clause_cleanup_ratio(double value)
void clear_use_try_edge_reasoning_in_no_overlap_2d()
bool has_restart_dl_average_ratio() const
optional double restart_dl_average_ratio = 63 [default = 1];
void clear_max_presolve_iterations()
bool has_feasibility_jump_enable_restarts() const
optional bool feasibility_jump_enable_restarts = 250 [default = true];
static constexpr Polarity POLARITY_RANDOM
bool only_solve_ip() const
void clear_symmetry_detection_deterministic_time_limit()
bool has_shared_tree_balance_tolerance() const
optional int32 shared_tree_balance_tolerance = 305 [default = 1];
bool has_cp_model_probing_level() const
optional int32 cp_model_probing_level = 110 [default = 2];
bool has_add_lp_constraints_lazily() const
optional bool add_lp_constraints_lazily = 112 [default = true];
void clear_instantiate_all_variables()
double inprocessing_minimization_dtime() const
void set_polarity_exploit_ls_hints(bool value)
bool has_variable_activity_decay() const
optional double variable_activity_decay = 15 [default = 0.8];
static constexpr int MaxSatAssumptionOrder_ARRAYSIZE
void clear_use_optional_variables()
bool has_routing_cut_subset_size_for_binary_relation_bound() const
optional int32 routing_cut_subset_size_for_binary_relation_bound = 312 [default = 0];
void set_shared_tree_num_workers(::int32_t value)
bool has_stop_after_root_propagation() const
optional bool stop_after_root_propagation = 252 [default = false];
void set_blocking_restart_window_size(::int32_t value)
void clear_stop_after_first_solution()
void clear_violation_ls_compound_move_probability()
static constexpr SearchBranching LP_SEARCH
void clear_max_cut_rounds_at_level_zero()
const ::google::protobuf::UnknownFieldSet & unknown_fields() const ABSL_ATTRIBUTE_LIFETIME_BOUND
bool has_log_search_progress() const
optional bool log_search_progress = 41 [default = false];
void clear_fill_tightened_domains_in_response()
void clear_probing_num_combinations_limit()
void clear_num_conflicts_before_strategy_changes()
void clear_pb_cleanup_increment()
void set_use_lns_only(bool value)
bool has_minimization_algorithm() const
optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm ...
::int32_t maximum_regions_to_split_in_disconnected_no_overlap_2d() const
double absolute_gap_limit() const
void set_enumerate_all_solutions(bool value)
static constexpr RestartAlgorithm LUBY_RESTART
::std::string *PROTOBUF_NONNULL add_extra_subsolvers()
static bool SearchBranching_IsValid(int value)
bool has_use_energetic_reasoning_in_no_overlap_2d() const
optional bool use_energetic_reasoning_in_no_overlap_2d = 213 [default = false];
void clear_clause_cleanup_period()
void set_debug_crash_if_presolve_breaks_hint(bool value)
bool use_area_energetic_reasoning_in_no_overlap_2d() const
bool has_add_zero_half_cuts() const
optional bool add_zero_half_cuts = 169 [default = true];
void clear_infer_all_diffs()
static constexpr int SharedTreeSplitStrategy_ARRAYSIZE
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SharedTreeSplitStrategy_descriptor()
void set_interleave_batch_size(::int32_t value)
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL MaxSatStratificationAlgorithm_descriptor()
::int32_t num_workers() const
bool has_catch_sigint_signal() const
optional bool catch_sigint_signal = 135 [default = true];
bool encode_complex_linear_constraint_with_integer() const
bool has_inprocessing_probing_dtime() const
optional double inprocessing_probing_dtime = 274 [default = 1];
bool has_new_constraints_batch_size() const
optional int32 new_constraints_batch_size = 122 [default = 50];
void clear_count_assumption_levels_in_lbd()
void clear_max_domain_size_when_encoding_eq_neq_constraints()
void clear_use_dynamic_precedence_in_cumulative()
void clear_presolve_extract_integer_enforcement()
bool has_repair_hint() const
optional bool repair_hint = 167 [default = false];
void set_use_try_edge_reasoning_in_no_overlap_2d(bool value)
void set_max_consecutive_inactive_count(::int32_t value)
double lns_initial_difficulty() const
bool has_use_try_edge_reasoning_in_no_overlap_2d() const
optional bool use_try_edge_reasoning_in_no_overlap_2d = 299 [default = false];
bool has_hint_conflict_limit() const
optional int32 hint_conflict_limit = 153 [default = 10];
void clear_propagation_loop_detection_factor()
void clear_root_lp_iterations()
void set_max_domain_size_when_encoding_eq_neq_constraints(::int32_t value)
bool has_max_num_deterministic_batches() const
optional int32 max_num_deterministic_batches = 291 [default = 0];
bool has_glucose_decay_increment() const
optional double glucose_decay_increment = 23 [default = 0.01];
void set_randomize_search(bool value)
void set_feasibility_jump_decay(double value)
::int32_t restart_running_window_size() const
bool exploit_relaxation_solution() const
void clear_inprocessing_minimization_use_conflict_analysis()
bool detect_linearized_product() const
bool has_expand_reservoir_using_circuit() const
optional bool expand_reservoir_using_circuit = 288 [default = false];
void clear_share_glue_clauses_dtime()
bool has_permute_presolve_constraint_order() const
optional bool permute_presolve_constraint_order = 179 [default = false];
::int32_t presolve_bve_clause_weight() const
void clear_use_rins_lns()
void clear_mip_drop_tolerance()
void set_cp_model_probing_level(::int32_t value)
::int32_t max_consecutive_inactive_count() const
void set_num_full_subsolvers(::int32_t value)
bool has_pb_cleanup_ratio() const
optional double pb_cleanup_ratio = 47 [default = 0.5];
double clause_activity_decay() const
double relative_gap_limit() const
bool use_symmetry_in_lp() const
void set_lb_relax_num_workers_threshold(::int32_t value)
static constexpr int VariableOrder_ARRAYSIZE
bool has_cut_cleanup_target() const
optional int32 cut_cleanup_target = 157 [default = 1000];
bool has_core_minimization_level() const
optional int32 core_minimization_level = 50 [default = 2];
void clear_optimize_with_core()
bool optimize_with_max_hs() const
void clear_variables_shaving_level()
void clear_presolve_blocked_clause()
::int32_t no_overlap_2d_boolean_relations_limit() const
bool presolve_use_bva() const
void set_new_linear_propagation(bool value)
bool has_lns_initial_difficulty() const
optional double lns_initial_difficulty = 307 [default = 0.5];
void set_use_rins_lns(bool value)
bool has_strategy_change_increase_ratio() const
optional double strategy_change_increase_ratio = 69 [default = 0];
void set_use_conservative_scale_overload_checker(bool value)
bool has_shaving_deterministic_time_in_probing_search() const
optional double shaving_deterministic_time_in_probing_search = 204 [default = 0.001];
bool has_clause_cleanup_lbd_bound() const
optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
::std::string *PROTOBUF_NONNULL mutable_log_prefix()
static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL VariableOrder_descriptor()
::std::string *PROTOBUF_NONNULL mutable_subsolvers(int index)
void set_search_random_variable_pool_size(::int64_t value)
void clear_convert_intervals()
::int32_t probing_num_combinations_limit() const
void set_cut_max_active_count_value(double value)
void clear_presolve_bve_clause_weight()
::int32_t max_integer_rounding_scaling() const
bool has_max_presolve_iterations() const
optional int32 max_presolve_iterations = 138 [default = 3];
bool has_max_sat_stratification() const
optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification ...
void set_mip_scale_large_domain(bool value)
bool has_optimize_with_lb_tree_search() const
optional bool optimize_with_lb_tree_search = 188 [default = false];
bool has_log_to_response() const
optional bool log_to_response = 187 [default = false];
void set_presolve_inclusion_work_limit(::int64_t value)
void set_shaving_search_threshold(::int64_t value)
::int32_t root_lp_iterations() const
void clear_mip_automatically_scale_variables()
void set_shaving_search_deterministic_time(double value)
void clear_binary_minimization_algorithm()
bool use_strong_propagation_in_disjunctive() const
void set_restart_dl_average_ratio(double value)
void set_inprocessing_probing_dtime(double value)
bool interleave_search() const
void clear_shared_tree_num_workers()
bool has_linear_split_size() const
optional int32 linear_split_size = 256 [default = 100];
bool has_shared_tree_split_strategy() const
optional .operations_research.sat.SatParameters.SharedTreeSplitStrategy shared_tree_split_strategy = ...
bool has_no_overlap_2d_boolean_relations_limit() const
optional int32 no_overlap_2d_boolean_relations_limit = 321 [default = 10];
static constexpr ConflictMinimizationAlgorithm RECURSIVE
void set_log_subsolver_statistics(bool value)
bool log_to_stdout() const
void set_share_binary_clauses(bool value)
bool has_shaving_search_threshold() const
optional int64 shaving_search_threshold = 290 [default = 64];
void clear_push_all_tasks_toward_start()
::int32_t interleave_batch_size() const
void clear_max_all_diff_cut_size()
bool has_max_sat_reverse_assumption_order() const
optional bool max_sat_reverse_assumption_order = 52 [default = false];
bool cp_model_presolve() const
void clear_stop_after_presolve()
bool has_use_rins_lns() const
optional bool use_rins_lns = 129 [default = true];
void clear_feasibility_jump_restart_factor()
void clear_merge_no_overlap_work_limit()
bool mip_automatically_scale_variables() const
bool has_mip_max_valid_magnitude() const
optional double mip_max_valid_magnitude = 199 [default = 1e+20];
bool also_bump_variables_in_conflict_reasons() const
void set_log_prefix(Arg_ &&arg, Args_... args)
void set_mip_wanted_precision(double value)
void clear_mip_var_scaling()
void clear_polarity_rephase_increment()
::absl::string_view GetAnyMessageName()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_FPRoundingMethod >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_MaxSatAssumptionOrder >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_SharedTreeSplitStrategy >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_ClauseOrdering >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_VariableOrder >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_Polarity >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_BinaryMinizationAlgorithm >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_SearchBranching >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_RestartAlgorithm >()
const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::sat::SatParameters_ClauseProtection >()
SatParameters_MaxSatStratificationAlgorithm
@ SatParameters_MaxSatStratificationAlgorithm_STRATIFICATION_DESCENT
@ SatParameters_MaxSatStratificationAlgorithm_STRATIFICATION_NONE
@ SatParameters_MaxSatStratificationAlgorithm_STRATIFICATION_ASCENT
constexpr SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MAX
bool SatParameters_SharedTreeSplitStrategy_IsValid(int value)
const ::std::string & SatParameters_Polarity_Name(T value)
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_FPRoundingMethod_descriptor()
PROTOBUF_CONSTINIT const uint32_t SatParameters_SearchBranching_internal_data_[]
bool SatParameters_SearchBranching_Parse(::absl::string_view name, SatParameters_SearchBranching *PROTOBUF_NONNULL value)
constexpr SatParameters_FPRoundingMethod SatParameters_FPRoundingMethod_FPRoundingMethod_MAX
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_SharedTreeSplitStrategy_descriptor()
bool SatParameters_RestartAlgorithm_Parse(::absl::string_view name, SatParameters_RestartAlgorithm *PROTOBUF_NONNULL value)
PROTOBUF_CONSTINIT const uint32_t SatParameters_ClauseOrdering_internal_data_[]
const ::std::string & SatParameters_VariableOrder_Name(T value)
bool SatParameters_ClauseProtection_Parse(::absl::string_view name, SatParameters_ClauseProtection *PROTOBUF_NONNULL value)
SatParameters_RestartAlgorithm
@ SatParameters_RestartAlgorithm_LUBY_RESTART
@ SatParameters_RestartAlgorithm_FIXED_RESTART
@ SatParameters_RestartAlgorithm_LBD_MOVING_AVERAGE_RESTART
@ SatParameters_RestartAlgorithm_NO_RESTART
@ SatParameters_RestartAlgorithm_DL_MOVING_AVERAGE_RESTART
SatParameters_VariableOrder
@ SatParameters_VariableOrder_IN_RANDOM_ORDER
@ SatParameters_VariableOrder_IN_ORDER
@ SatParameters_VariableOrder_IN_REVERSE_ORDER
constexpr int SatParameters_ClauseProtection_ClauseProtection_ARRAYSIZE
bool SatParameters_MaxSatStratificationAlgorithm_Parse(::absl::string_view name, SatParameters_MaxSatStratificationAlgorithm *PROTOBUF_NONNULL value)
constexpr SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MIN
constexpr SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MAX
constexpr SatParameters_SharedTreeSplitStrategy SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_MAX
bool SatParameters_FPRoundingMethod_IsValid(int value)
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_MaxSatStratificationAlgorithm_descriptor()
constexpr int SatParameters_VariableOrder_VariableOrder_ARRAYSIZE
PROTOBUF_CONSTINIT const uint32_t SatParameters_BinaryMinizationAlgorithm_internal_data_[]
constexpr int SatParameters_SearchBranching_SearchBranching_ARRAYSIZE
bool SatParameters_BinaryMinizationAlgorithm_IsValid(int value)
SatParameters_BinaryMinizationAlgorithm
@ SatParameters_BinaryMinizationAlgorithm_BINARY_MINIMIZATION_WITH_REACHABILITY
@ SatParameters_BinaryMinizationAlgorithm_NO_BINARY_MINIMIZATION
@ SatParameters_BinaryMinizationAlgorithm_BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION
@ SatParameters_BinaryMinizationAlgorithm_BINARY_MINIMIZATION_FIRST
@ SatParameters_BinaryMinizationAlgorithm_EXPERIMENTAL_BINARY_MINIMIZATION
bool SatParameters_MaxSatAssumptionOrder_IsValid(int value)
PROTOBUF_CONSTINIT const uint32_t SatParameters_MaxSatAssumptionOrder_internal_data_[]
bool SatParameters_Polarity_IsValid(int value)
constexpr int SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_ARRAYSIZE
PROTOBUF_CONSTINIT const uint32_t SatParameters_ClauseProtection_internal_data_[]
@ SatParameters_Polarity_POLARITY_FALSE
@ SatParameters_Polarity_POLARITY_TRUE
@ SatParameters_Polarity_POLARITY_RANDOM
PROTOBUF_CONSTINIT const uint32_t SatParameters_VariableOrder_internal_data_[]
constexpr SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MIN
bool SatParameters_MaxSatStratificationAlgorithm_IsValid(int value)
const ::std::string & SatParameters_ClauseOrdering_Name(T value)
constexpr int SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_ARRAYSIZE
bool SatParameters_ConflictMinimizationAlgorithm_Parse(::absl::string_view name, SatParameters_ConflictMinimizationAlgorithm *PROTOBUF_NONNULL value)
const ::std::string & SatParameters_SearchBranching_Name(T value)
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_RestartAlgorithm_descriptor()
bool SatParameters_MaxSatAssumptionOrder_Parse(::absl::string_view name, SatParameters_MaxSatAssumptionOrder *PROTOBUF_NONNULL value)
constexpr SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MIN
bool SatParameters_VariableOrder_IsValid(int value)
SatParameters_MaxSatAssumptionOrder
@ SatParameters_MaxSatAssumptionOrder_ORDER_ASSUMPTION_BY_WEIGHT
@ SatParameters_MaxSatAssumptionOrder_ORDER_ASSUMPTION_BY_DEPTH
@ SatParameters_MaxSatAssumptionOrder_DEFAULT_ASSUMPTION_ORDER
constexpr SatParameters_Polarity SatParameters_Polarity_Polarity_MAX
bool SatParameters_BinaryMinizationAlgorithm_Parse(::absl::string_view name, SatParameters_BinaryMinizationAlgorithm *PROTOBUF_NONNULL value)
constexpr int SatParameters_FPRoundingMethod_FPRoundingMethod_ARRAYSIZE
PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull SatParameters_class_data_
const ::std::string & SatParameters_RestartAlgorithm_Name(T value)
constexpr int SatParameters_Polarity_Polarity_ARRAYSIZE
constexpr SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MAX
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SatParametersDefaultTypeInternal _SatParameters_default_instance_
constexpr SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MIN
constexpr int SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_ARRAYSIZE
constexpr SatParameters_FPRoundingMethod SatParameters_FPRoundingMethod_FPRoundingMethod_MIN
bool SatParameters_SearchBranching_IsValid(int value)
bool SatParameters_ConflictMinimizationAlgorithm_IsValid(int value)
PROTOBUF_CONSTINIT const uint32_t SatParameters_FPRoundingMethod_internal_data_[]
constexpr SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MAX
SatParameters_FPRoundingMethod
@ SatParameters_FPRoundingMethod_ACTIVE_LOCK_BASED
@ SatParameters_FPRoundingMethod_LOCK_BASED
@ SatParameters_FPRoundingMethod_NEAREST_INTEGER
@ SatParameters_FPRoundingMethod_PROPAGATION_ASSISTED
constexpr SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MAX
constexpr int SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_ARRAYSIZE
bool SatParameters_ClauseOrdering_Parse(::absl::string_view name, SatParameters_ClauseOrdering *PROTOBUF_NONNULL value)
const ::std::string & SatParameters_ClauseProtection_Name(T value)
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_VariableOrder_descriptor()
const ::std::string & SatParameters_ConflictMinimizationAlgorithm_Name(T value)
bool SatParameters_ClauseOrdering_IsValid(int value)
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_ClauseOrdering_descriptor()
const ::std::string & SatParameters_BinaryMinizationAlgorithm_Name(T value)
constexpr int SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_ARRAYSIZE
bool SatParameters_VariableOrder_Parse(::absl::string_view name, SatParameters_VariableOrder *PROTOBUF_NONNULL value)
bool SatParameters_FPRoundingMethod_Parse(::absl::string_view name, SatParameters_FPRoundingMethod *PROTOBUF_NONNULL value)
SatParameters_SharedTreeSplitStrategy
@ SatParameters_SharedTreeSplitStrategy_SPLIT_STRATEGY_BALANCED_TREE
@ SatParameters_SharedTreeSplitStrategy_SPLIT_STRATEGY_DISCREPANCY
@ SatParameters_SharedTreeSplitStrategy_SPLIT_STRATEGY_OBJECTIVE_LB
@ SatParameters_SharedTreeSplitStrategy_SPLIT_STRATEGY_AUTO
@ SatParameters_SharedTreeSplitStrategy_SPLIT_STRATEGY_FIRST_PROPOSAL
const ::std::string & SatParameters_FPRoundingMethod_Name(T value)
bool SatParameters_RestartAlgorithm_IsValid(int value)
constexpr SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MIN
SatParameters_ClauseOrdering
@ SatParameters_ClauseOrdering_CLAUSE_LBD
@ SatParameters_ClauseOrdering_CLAUSE_ACTIVITY
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_ClauseProtection_descriptor()
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_BinaryMinizationAlgorithm_descriptor()
constexpr SatParameters_SharedTreeSplitStrategy SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_MIN
const ::std::string & SatParameters_MaxSatStratificationAlgorithm_Name(T value)
constexpr SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MIN
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_SearchBranching_descriptor()
const ::std::string & SatParameters_SharedTreeSplitStrategy_Name(T value)
constexpr SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MAX
bool SatParameters_ClauseProtection_IsValid(int value)
constexpr SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MAX
bool SatParameters_Polarity_Parse(::absl::string_view name, SatParameters_Polarity *PROTOBUF_NONNULL value)
constexpr SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MAX
SatParameters_ConflictMinimizationAlgorithm
@ SatParameters_ConflictMinimizationAlgorithm_EXPERIMENTAL
@ SatParameters_ConflictMinimizationAlgorithm_SIMPLE
@ SatParameters_ConflictMinimizationAlgorithm_RECURSIVE
@ SatParameters_ConflictMinimizationAlgorithm_NONE
PROTOBUF_CONSTINIT const uint32_t SatParameters_SharedTreeSplitStrategy_internal_data_[]
constexpr SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MAX
constexpr SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MIN
constexpr int SatParameters_RestartAlgorithm_RestartAlgorithm_ARRAYSIZE
PROTOBUF_CONSTINIT const uint32_t SatParameters_RestartAlgorithm_internal_data_[]
bool SatParameters_SharedTreeSplitStrategy_Parse(::absl::string_view name, SatParameters_SharedTreeSplitStrategy *PROTOBUF_NONNULL value)
PROTOBUF_CONSTINIT const uint32_t SatParameters_Polarity_internal_data_[]
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_MaxSatAssumptionOrder_descriptor()
constexpr SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MIN
constexpr int SatParameters_ClauseOrdering_ClauseOrdering_ARRAYSIZE
constexpr SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MIN
PROTOBUF_CONSTINIT const uint32_t SatParameters_MaxSatStratificationAlgorithm_internal_data_[]
SatParameters_ClauseProtection
@ SatParameters_ClauseProtection_PROTECTION_NONE
@ SatParameters_ClauseProtection_PROTECTION_LBD
@ SatParameters_ClauseProtection_PROTECTION_ALWAYS
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_Polarity_descriptor()
SatParameters_SearchBranching
@ SatParameters_SearchBranching_PSEUDO_COST_SEARCH
@ SatParameters_SearchBranching_PARTIAL_FIXED_SEARCH
@ SatParameters_SearchBranching_PORTFOLIO_WITH_QUICK_RESTART_SEARCH
@ SatParameters_SearchBranching_FIXED_SEARCH
@ SatParameters_SearchBranching_RANDOMIZED_SEARCH
@ SatParameters_SearchBranching_HINT_SEARCH
@ SatParameters_SearchBranching_PORTFOLIO_SEARCH
@ SatParameters_SearchBranching_LP_SEARCH
@ SatParameters_SearchBranching_AUTOMATIC_SEARCH
PROTOBUF_CONSTINIT const uint32_t SatParameters_ConflictMinimizationAlgorithm_internal_data_[]
const ::std::string & SatParameters_MaxSatAssumptionOrder_Name(T value)
constexpr SatParameters_Polarity SatParameters_Polarity_Polarity_MIN
const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL SatParameters_ConflictMinimizationAlgorithm_descriptor()
In SWIG mode, we don't want anything besides these top-level includes.
PROTOBUF_CONSTINITconst ::_pbi::DescriptorTable descriptor_table_ortools_2fsat_2fsat_5fparameters_2eproto