routing_heuristic_parameters.pb.h

Go to the documentation of this file.

// Generated by the protocol buffer compiler.  DO NOT EDIT!
// NO CHECKED-IN PROTOBUF GENCODE
// source: ortools/constraint_solver/routing_heuristic_parameters.proto
// Protobuf C++ Version: 6.33.1
 
#ifndef ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto_2epb_2eh
#define ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto_2epb_2eh
 
#include <limits>
#include <string>
#include <type_traits>
#include <utility>
 
#include "google/protobuf/runtime_version.h"
#if PROTOBUF_VERSION != 6033001
#error "Protobuf C++ gencode is built with an incompatible version of"
#error "Protobuf C++ headers/runtime. See"
#error "https://protobuf.dev/support/cross-version-runtime-guarantee/#cpp"
#endif
#include "google/protobuf/io/coded_stream.h"
#include "google/protobuf/arena.h"
#include "google/protobuf/arenastring.h"
#include "google/protobuf/generated_message_tctable_decl.h"
#include "google/protobuf/generated_message_util.h"
#include "google/protobuf/metadata_lite.h"
#include "google/protobuf/generated_message_reflection.h"
#include "google/protobuf/message.h"
#include "google/protobuf/message_lite.h"
#include "google/protobuf/repeated_field.h"  // IWYU pragma: export
#include "google/protobuf/extension_set.h"  // IWYU pragma: export
#include "google/protobuf/generated_enum_reflection.h"
#include "google/protobuf/unknown_field_set.h"
// @@protoc_insertion_point(includes)
 
// Must be included last.
#include "google/protobuf/port_def.inc"
 
#define PROTOBUF_INTERNAL_EXPORT_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto OR_PROTO_DLL
 
namespace google {
namespace protobuf {
namespace internal {
template <typename T>
::absl::string_view GetAnyMessageName();
}  // namespace internal
}  // namespace protobuf
}  // namespace google
 
// Internal implementation detail -- do not use these members.
struct OR_PROTO_DLL TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto {
  static const ::uint32_t offsets[];
};
extern "C" {
OR_PROTO_DLL extern const ::google::protobuf::internal::DescriptorTable descriptor_table_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;
}  // extern "C"
namespace operations_research {
enum LocalCheapestInsertionParameters_InsertionSortingProperty : int;
OR_PROTO_DLL extern const uint32_t LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_[];
enum LocalCheapestInsertionParameters_PairInsertionStrategy : int;
OR_PROTO_DLL extern const uint32_t LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_[];
class GlobalCheapestInsertionParameters;
struct GlobalCheapestInsertionParametersDefaultTypeInternal;
OR_PROTO_DLL extern GlobalCheapestInsertionParametersDefaultTypeInternal _GlobalCheapestInsertionParameters_default_instance_;
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull GlobalCheapestInsertionParameters_class_data_;
class LocalCheapestInsertionParameters;
struct LocalCheapestInsertionParametersDefaultTypeInternal;
OR_PROTO_DLL extern LocalCheapestInsertionParametersDefaultTypeInternal _LocalCheapestInsertionParameters_default_instance_;
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull LocalCheapestInsertionParameters_class_data_;
class SavingsParameters;
struct SavingsParametersDefaultTypeInternal;
OR_PROTO_DLL extern SavingsParametersDefaultTypeInternal _SavingsParameters_default_instance_;
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull SavingsParameters_class_data_;
}  // namespace operations_research
namespace google {
namespace protobuf {
template <>
internal::EnumTraitsT<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_>
    internal::EnumTraitsImpl::value<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty>;
template <>
internal::EnumTraitsT<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_>
    internal::EnumTraitsImpl::value<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy>;
}  // namespace protobuf
}  // namespace google
 
namespace operations_research {
enum LocalCheapestInsertionParameters_PairInsertionStrategy : int {
  LocalCheapestInsertionParameters_PairInsertionStrategy_AUTOMATIC = 0,
  LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_THEN_BEST_DELIVERY = 1,
  LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR = 2,
  LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR_MULTITOUR = 3,
  LocalCheapestInsertionParameters_PairInsertionStrategy_LocalCheapestInsertionParameters_PairInsertionStrategy_INT_MIN_SENTINEL_DO_NOT_USE_ =
      ::std::numeric_limits<::int32_t>::min(),
  LocalCheapestInsertionParameters_PairInsertionStrategy_LocalCheapestInsertionParameters_PairInsertionStrategy_INT_MAX_SENTINEL_DO_NOT_USE_ =
      ::std::numeric_limits<::int32_t>::max(),
};
 
OR_PROTO_DLL extern const uint32_t LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_[];
inline constexpr LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MIN =
    static_cast<LocalCheapestInsertionParameters_PairInsertionStrategy>(0);
inline constexpr LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MAX =
    static_cast<LocalCheapestInsertionParameters_PairInsertionStrategy>(3);
inline bool LocalCheapestInsertionParameters_PairInsertionStrategy_IsValid(int value) {
  return 0 <= value && value <= 3;
}
inline constexpr int LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_ARRAYSIZE = 3 + 1;
OR_PROTO_DLL const ::google::protobuf::EnumDescriptor* PROTOBUF_NONNULL LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor();
template <typename T>
const ::std::string& LocalCheapestInsertionParameters_PairInsertionStrategy_Name(T value) {
  static_assert(::std::is_same<T, LocalCheapestInsertionParameters_PairInsertionStrategy>::value ||
                    ::std::is_integral<T>::value,
                "Incorrect type passed to PairInsertionStrategy_Name().");
  return LocalCheapestInsertionParameters_PairInsertionStrategy_Name(static_cast<LocalCheapestInsertionParameters_PairInsertionStrategy>(value));
}
template <>
inline const ::std::string& LocalCheapestInsertionParameters_PairInsertionStrategy_Name(LocalCheapestInsertionParameters_PairInsertionStrategy value) {
  return ::google::protobuf::internal::NameOfDenseEnum<LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor, 0, 3>(
      static_cast<int>(value));
}
inline bool LocalCheapestInsertionParameters_PairInsertionStrategy_Parse(
    ::absl::string_view name, LocalCheapestInsertionParameters_PairInsertionStrategy* PROTOBUF_NONNULL value) {
  return ::google::protobuf::internal::ParseNamedEnum<LocalCheapestInsertionParameters_PairInsertionStrategy>(LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor(), name,
                                           value);
}
enum LocalCheapestInsertionParameters_InsertionSortingProperty : int {
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_UNSPECIFIED = 0,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_ALLOWED_VEHICLES = 1,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY = 2,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO = 3,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = 4,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = 5,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS = 6,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE = 7,
  LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_RANDOM = 8,
  LocalCheapestInsertionParameters_InsertionSortingProperty_LocalCheapestInsertionParameters_InsertionSortingProperty_INT_MIN_SENTINEL_DO_NOT_USE_ =
      ::std::numeric_limits<::int32_t>::min(),
  LocalCheapestInsertionParameters_InsertionSortingProperty_LocalCheapestInsertionParameters_InsertionSortingProperty_INT_MAX_SENTINEL_DO_NOT_USE_ =
      ::std::numeric_limits<::int32_t>::max(),
};
 
OR_PROTO_DLL extern const uint32_t LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_[];
inline constexpr LocalCheapestInsertionParameters_InsertionSortingProperty LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MIN =
    static_cast<LocalCheapestInsertionParameters_InsertionSortingProperty>(0);
inline constexpr LocalCheapestInsertionParameters_InsertionSortingProperty LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MAX =
    static_cast<LocalCheapestInsertionParameters_InsertionSortingProperty>(8);
inline bool LocalCheapestInsertionParameters_InsertionSortingProperty_IsValid(int value) {
  return 0 <= value && value <= 8;
}
inline constexpr int LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_ARRAYSIZE = 8 + 1;
OR_PROTO_DLL const ::google::protobuf::EnumDescriptor* PROTOBUF_NONNULL LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor();
template <typename T>
const ::std::string& LocalCheapestInsertionParameters_InsertionSortingProperty_Name(T value) {
  static_assert(::std::is_same<T, LocalCheapestInsertionParameters_InsertionSortingProperty>::value ||
                    ::std::is_integral<T>::value,
                "Incorrect type passed to InsertionSortingProperty_Name().");
  return LocalCheapestInsertionParameters_InsertionSortingProperty_Name(static_cast<LocalCheapestInsertionParameters_InsertionSortingProperty>(value));
}
template <>
inline const ::std::string& LocalCheapestInsertionParameters_InsertionSortingProperty_Name(LocalCheapestInsertionParameters_InsertionSortingProperty value) {
  return ::google::protobuf::internal::NameOfDenseEnum<LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor, 0, 8>(
      static_cast<int>(value));
}
inline bool LocalCheapestInsertionParameters_InsertionSortingProperty_Parse(
    ::absl::string_view name, LocalCheapestInsertionParameters_InsertionSortingProperty* PROTOBUF_NONNULL value) {
  return ::google::protobuf::internal::ParseNamedEnum<LocalCheapestInsertionParameters_InsertionSortingProperty>(LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor(), name,
                                           value);
}
 
// ===================================================================
 
 
// -------------------------------------------------------------------
 
class OR_PROTO_DLL SavingsParameters final : public ::google::protobuf::Message
/* @@protoc_insertion_point(class_definition:operations_research.SavingsParameters) */ {
 public:
  inline SavingsParameters() : SavingsParameters(nullptr) {}
  ~SavingsParameters() PROTOBUF_FINAL;
 
#if defined(PROTOBUF_CUSTOM_VTABLE)
  void operator delete(SavingsParameters* PROTOBUF_NONNULL msg, ::std::destroying_delete_t) {
    SharedDtor(*msg);
    ::google::protobuf::internal::SizedDelete(msg, sizeof(SavingsParameters));
  }
#endif
 
  template <typename = void>
  explicit PROTOBUF_CONSTEXPR SavingsParameters(::google::protobuf::internal::ConstantInitialized);
 
  inline SavingsParameters(const SavingsParameters& from) : SavingsParameters(nullptr, from) {}
  inline SavingsParameters(SavingsParameters&& from) noexcept
      : SavingsParameters(nullptr, ::std::move(from)) {}
  inline SavingsParameters& operator=(const SavingsParameters& from) {
    CopyFrom(from);
    return *this;
  }
  inline SavingsParameters& operator=(SavingsParameters&& from) noexcept {
    if (this == &from) return *this;
    if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {
      InternalSwap(&from);
    } else {
      CopyFrom(from);
    }
    return *this;
  }
 
  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);
  }
  inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();
  }
 
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {
    return GetDescriptor();
  }
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {
    return default_instance().GetMetadata().descriptor;
  }
  static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {
    return default_instance().GetMetadata().reflection;
  }
  static const SavingsParameters& default_instance() {
    return *reinterpret_cast<const SavingsParameters*>(
        &_SavingsParameters_default_instance_);
  }
  static constexpr int kIndexInFileMessages = 1;
  friend void swap(SavingsParameters& a, SavingsParameters& b) { a.Swap(&b); }
  inline void Swap(SavingsParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {
      InternalSwap(other);
    } else {
      ::google::protobuf::internal::GenericSwap(this, other);
    }
  }
  void UnsafeArenaSwap(SavingsParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    ABSL_DCHECK(GetArena() == other->GetArena());
    InternalSwap(other);
  }
 
  // implements Message ----------------------------------------------
 
  SavingsParameters* PROTOBUF_NONNULL New(::google::protobuf::Arena* PROTOBUF_NULLABLE arena = nullptr) const {
    return ::google::protobuf::Message::DefaultConstruct<SavingsParameters>(arena);
  }
  using ::google::protobuf::Message::CopyFrom;
  void CopyFrom(const SavingsParameters& from);
  using ::google::protobuf::Message::MergeFrom;
  void MergeFrom(const SavingsParameters& from) { SavingsParameters::MergeImpl(*this, from); }
 
  private:
  static void MergeImpl(::google::protobuf::MessageLite& to_msg,
                        const ::google::protobuf::MessageLite& from_msg);
 
  public:
  bool IsInitialized() const {
    return true;
  }
  ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;
  #if defined(PROTOBUF_CUSTOM_VTABLE)
  private:
  static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);
  static ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);
 
  public:
  ::size_t ByteSizeLong() const { return ByteSizeLong(*this); }
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {
    return _InternalSerialize(*this, target, stream);
  }
  #else   // PROTOBUF_CUSTOM_VTABLE
  ::size_t ByteSizeLong() const final;
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;
  #endif  // PROTOBUF_CUSTOM_VTABLE
  int GetCachedSize() const { return _impl_._cached_size_.Get(); }
 
  private:
  void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static void SharedDtor(MessageLite& self);
  void InternalSwap(SavingsParameters* PROTOBUF_NONNULL other);
 private:
  template <typename T>
  friend ::absl::string_view(::google::protobuf::internal::GetAnyMessageName)();
  static ::absl::string_view FullMessageName() { return "operations_research.SavingsParameters"; }
 
  explicit SavingsParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  SavingsParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const SavingsParameters& from);
  SavingsParameters(
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, SavingsParameters&& from) noexcept
      : SavingsParameters(arena) {
    *this = ::std::move(from);
  }
  const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;
  static void* PROTOBUF_NONNULL PlacementNew_(
      const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static constexpr auto InternalNewImpl_();
 
 public:
  static constexpr auto InternalGenerateClassData_();
 
  ::google::protobuf::Metadata GetMetadata() const;
  // nested types ----------------------------------------------------
 
  // accessors -------------------------------------------------------
  enum : int {
    kNeighborsRatioFieldNumber = 1,
    kMaxMemoryUsageBytesFieldNumber = 2,
    kArcCoefficientFieldNumber = 4,
    kAddReverseArcsFieldNumber = 3,
  };
  // double neighbors_ratio = 1;
  void clear_neighbors_ratio() ;
  double neighbors_ratio() const;
  void set_neighbors_ratio(double value);
 
  private:
  double _internal_neighbors_ratio() const;
  void _internal_set_neighbors_ratio(double value);
 
  public:
  // double max_memory_usage_bytes = 2;
  void clear_max_memory_usage_bytes() ;
  double max_memory_usage_bytes() const;
  void set_max_memory_usage_bytes(double value);
 
  private:
  double _internal_max_memory_usage_bytes() const;
  void _internal_set_max_memory_usage_bytes(double value);
 
  public:
  // double arc_coefficient = 4;
  void clear_arc_coefficient() ;
  double arc_coefficient() const;
  void set_arc_coefficient(double value);
 
  private:
  double _internal_arc_coefficient() const;
  void _internal_set_arc_coefficient(double value);
 
  public:
  // bool add_reverse_arcs = 3;
  void clear_add_reverse_arcs() ;
  bool add_reverse_arcs() const;
  void set_add_reverse_arcs(bool value);
 
  private:
  bool _internal_add_reverse_arcs() const;
  void _internal_set_add_reverse_arcs(bool value);
 
  public:
  // @@protoc_insertion_point(class_scope:operations_research.SavingsParameters)
 private:
  class _Internal;
  friend class ::google::protobuf::internal::TcParser;
  static const ::google::protobuf::internal::TcParseTable<2, 4,
                                   0, 0,
                                   2>
      _table_;
 
  friend class ::google::protobuf::MessageLite;
  friend class ::google::protobuf::Arena;
  template <typename T>
  friend class ::google::protobuf::Arena::InternalHelper;
  using InternalArenaConstructable_ = void;
  using DestructorSkippable_ = void;
  struct Impl_ {
    inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,
        const SavingsParameters& from_msg);
    ::google::protobuf::internal::HasBits<1> _has_bits_;
    ::google::protobuf::internal::CachedSize _cached_size_;
    double neighbors_ratio_;
    double max_memory_usage_bytes_;
    double arc_coefficient_;
    bool add_reverse_arcs_;
    PROTOBUF_TSAN_DECLARE_MEMBER
  };
  union { Impl_ _impl_; };
  friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;
};
 
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull SavingsParameters_class_data_;
// -------------------------------------------------------------------
 
class OR_PROTO_DLL LocalCheapestInsertionParameters final : public ::google::protobuf::Message
/* @@protoc_insertion_point(class_definition:operations_research.LocalCheapestInsertionParameters) */ {
 public:
  inline LocalCheapestInsertionParameters() : LocalCheapestInsertionParameters(nullptr) {}
  ~LocalCheapestInsertionParameters() PROTOBUF_FINAL;
 
#if defined(PROTOBUF_CUSTOM_VTABLE)
  void operator delete(LocalCheapestInsertionParameters* PROTOBUF_NONNULL msg, ::std::destroying_delete_t) {
    SharedDtor(*msg);
    ::google::protobuf::internal::SizedDelete(msg, sizeof(LocalCheapestInsertionParameters));
  }
#endif
 
  template <typename = void>
  explicit PROTOBUF_CONSTEXPR LocalCheapestInsertionParameters(::google::protobuf::internal::ConstantInitialized);
 
  inline LocalCheapestInsertionParameters(const LocalCheapestInsertionParameters& from) : LocalCheapestInsertionParameters(nullptr, from) {}
  inline LocalCheapestInsertionParameters(LocalCheapestInsertionParameters&& from) noexcept
      : LocalCheapestInsertionParameters(nullptr, ::std::move(from)) {}
  inline LocalCheapestInsertionParameters& operator=(const LocalCheapestInsertionParameters& from) {
    CopyFrom(from);
    return *this;
  }
  inline LocalCheapestInsertionParameters& operator=(LocalCheapestInsertionParameters&& from) noexcept {
    if (this == &from) return *this;
    if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {
      InternalSwap(&from);
    } else {
      CopyFrom(from);
    }
    return *this;
  }
 
  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);
  }
  inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();
  }
 
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {
    return GetDescriptor();
  }
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {
    return default_instance().GetMetadata().descriptor;
  }
  static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {
    return default_instance().GetMetadata().reflection;
  }
  static const LocalCheapestInsertionParameters& default_instance() {
    return *reinterpret_cast<const LocalCheapestInsertionParameters*>(
        &_LocalCheapestInsertionParameters_default_instance_);
  }
  static constexpr int kIndexInFileMessages = 0;
  friend void swap(LocalCheapestInsertionParameters& a, LocalCheapestInsertionParameters& b) { a.Swap(&b); }
  inline void Swap(LocalCheapestInsertionParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {
      InternalSwap(other);
    } else {
      ::google::protobuf::internal::GenericSwap(this, other);
    }
  }
  void UnsafeArenaSwap(LocalCheapestInsertionParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    ABSL_DCHECK(GetArena() == other->GetArena());
    InternalSwap(other);
  }
 
  // implements Message ----------------------------------------------
 
  LocalCheapestInsertionParameters* PROTOBUF_NONNULL New(::google::protobuf::Arena* PROTOBUF_NULLABLE arena = nullptr) const {
    return ::google::protobuf::Message::DefaultConstruct<LocalCheapestInsertionParameters>(arena);
  }
  using ::google::protobuf::Message::CopyFrom;
  void CopyFrom(const LocalCheapestInsertionParameters& from);
  using ::google::protobuf::Message::MergeFrom;
  void MergeFrom(const LocalCheapestInsertionParameters& from) { LocalCheapestInsertionParameters::MergeImpl(*this, from); }
 
  private:
  static void MergeImpl(::google::protobuf::MessageLite& to_msg,
                        const ::google::protobuf::MessageLite& from_msg);
 
  public:
  bool IsInitialized() const {
    return true;
  }
  ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;
  #if defined(PROTOBUF_CUSTOM_VTABLE)
  private:
  static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);
  static ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);
 
  public:
  ::size_t ByteSizeLong() const { return ByteSizeLong(*this); }
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {
    return _InternalSerialize(*this, target, stream);
  }
  #else   // PROTOBUF_CUSTOM_VTABLE
  ::size_t ByteSizeLong() const final;
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;
  #endif  // PROTOBUF_CUSTOM_VTABLE
  int GetCachedSize() const { return _impl_._cached_size_.Get(); }
 
  private:
  void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static void SharedDtor(MessageLite& self);
  void InternalSwap(LocalCheapestInsertionParameters* PROTOBUF_NONNULL other);
 private:
  template <typename T>
  friend ::absl::string_view(::google::protobuf::internal::GetAnyMessageName)();
  static ::absl::string_view FullMessageName() { return "operations_research.LocalCheapestInsertionParameters"; }
 
  explicit LocalCheapestInsertionParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  LocalCheapestInsertionParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const LocalCheapestInsertionParameters& from);
  LocalCheapestInsertionParameters(
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, LocalCheapestInsertionParameters&& from) noexcept
      : LocalCheapestInsertionParameters(arena) {
    *this = ::std::move(from);
  }
  const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;
  static void* PROTOBUF_NONNULL PlacementNew_(
      const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static constexpr auto InternalNewImpl_();
 
 public:
  static constexpr auto InternalGenerateClassData_();
 
  ::google::protobuf::Metadata GetMetadata() const;
  // nested types ----------------------------------------------------
  using PairInsertionStrategy = LocalCheapestInsertionParameters_PairInsertionStrategy;
  static constexpr PairInsertionStrategy AUTOMATIC = LocalCheapestInsertionParameters_PairInsertionStrategy_AUTOMATIC;
  static constexpr PairInsertionStrategy BEST_PICKUP_THEN_BEST_DELIVERY = LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_THEN_BEST_DELIVERY;
  static constexpr PairInsertionStrategy BEST_PICKUP_DELIVERY_PAIR = LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR;
  static constexpr PairInsertionStrategy BEST_PICKUP_DELIVERY_PAIR_MULTITOUR = LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR_MULTITOUR;
  static inline bool PairInsertionStrategy_IsValid(int value) {
    return LocalCheapestInsertionParameters_PairInsertionStrategy_IsValid(value);
  }
  static constexpr PairInsertionStrategy PairInsertionStrategy_MIN = LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MIN;
  static constexpr PairInsertionStrategy PairInsertionStrategy_MAX = LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MAX;
  static constexpr int PairInsertionStrategy_ARRAYSIZE = LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_ARRAYSIZE;
  static inline const ::google::protobuf::EnumDescriptor* PROTOBUF_NONNULL PairInsertionStrategy_descriptor() {
    return LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor();
  }
  template <typename T>
  static inline const ::std::string& PairInsertionStrategy_Name(T value) {
    return LocalCheapestInsertionParameters_PairInsertionStrategy_Name(value);
  }
  static inline bool PairInsertionStrategy_Parse(
      ::absl::string_view name, PairInsertionStrategy* PROTOBUF_NONNULL value) {
    return LocalCheapestInsertionParameters_PairInsertionStrategy_Parse(name, value);
  }
  using InsertionSortingProperty = LocalCheapestInsertionParameters_InsertionSortingProperty;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_UNSPECIFIED = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_UNSPECIFIED;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_ALLOWED_VEHICLES = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_ALLOWED_VEHICLES;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_PENALTY = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE;
  static constexpr InsertionSortingProperty SORTING_PROPERTY_RANDOM = LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_RANDOM;
  static inline bool InsertionSortingProperty_IsValid(int value) {
    return LocalCheapestInsertionParameters_InsertionSortingProperty_IsValid(value);
  }
  static constexpr InsertionSortingProperty InsertionSortingProperty_MIN = LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MIN;
  static constexpr InsertionSortingProperty InsertionSortingProperty_MAX = LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MAX;
  static constexpr int InsertionSortingProperty_ARRAYSIZE = LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_ARRAYSIZE;
  static inline const ::google::protobuf::EnumDescriptor* PROTOBUF_NONNULL InsertionSortingProperty_descriptor() {
    return LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor();
  }
  template <typename T>
  static inline const ::std::string& InsertionSortingProperty_Name(T value) {
    return LocalCheapestInsertionParameters_InsertionSortingProperty_Name(value);
  }
  static inline bool InsertionSortingProperty_Parse(
      ::absl::string_view name, InsertionSortingProperty* PROTOBUF_NONNULL value) {
    return LocalCheapestInsertionParameters_InsertionSortingProperty_Parse(name, value);
  }
 
  // accessors -------------------------------------------------------
  enum : int {
    kInsertionSortingPropertiesFieldNumber = 2,
    kPickupDeliveryStrategyFieldNumber = 1,
  };
  // repeated .operations_research.LocalCheapestInsertionParameters.InsertionSortingProperty insertion_sorting_properties = 2;
  int insertion_sorting_properties_size() const;
  private:
  int _internal_insertion_sorting_properties_size() const;
 
  public:
  void clear_insertion_sorting_properties() ;
  public:
  ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty insertion_sorting_properties(int index) const;
  void set_insertion_sorting_properties(int index, ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value);
  void add_insertion_sorting_properties(::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value);
  const ::google::protobuf::RepeatedField<int>& insertion_sorting_properties() const;
  ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL mutable_insertion_sorting_properties();
 
  private:
  const ::google::protobuf::RepeatedField<int>& _internal_insertion_sorting_properties() const;
  ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL _internal_mutable_insertion_sorting_properties();
 
  public:
  // .operations_research.LocalCheapestInsertionParameters.PairInsertionStrategy pickup_delivery_strategy = 1;
  void clear_pickup_delivery_strategy() ;
  ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy pickup_delivery_strategy() const;
  void set_pickup_delivery_strategy(::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy value);
 
  private:
  ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy _internal_pickup_delivery_strategy() const;
  void _internal_set_pickup_delivery_strategy(::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy value);
 
  public:
  // @@protoc_insertion_point(class_scope:operations_research.LocalCheapestInsertionParameters)
 private:
  class _Internal;
  friend class ::google::protobuf::internal::TcParser;
  static const ::google::protobuf::internal::TcParseTable<1, 2,
                                   0, 0,
                                   2>
      _table_;
 
  friend class ::google::protobuf::MessageLite;
  friend class ::google::protobuf::Arena;
  template <typename T>
  friend class ::google::protobuf::Arena::InternalHelper;
  using InternalArenaConstructable_ = void;
  using DestructorSkippable_ = void;
  struct Impl_ {
    inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,
        const LocalCheapestInsertionParameters& from_msg);
    ::google::protobuf::internal::HasBits<1> _has_bits_;
    ::google::protobuf::internal::CachedSize _cached_size_;
    ::google::protobuf::RepeatedField<int> insertion_sorting_properties_;
    ::google::protobuf::internal::CachedSize _insertion_sorting_properties_cached_byte_size_;
    int pickup_delivery_strategy_;
    PROTOBUF_TSAN_DECLARE_MEMBER
  };
  union { Impl_ _impl_; };
  friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;
};
 
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull LocalCheapestInsertionParameters_class_data_;
// -------------------------------------------------------------------
 
class OR_PROTO_DLL GlobalCheapestInsertionParameters final : public ::google::protobuf::Message
/* @@protoc_insertion_point(class_definition:operations_research.GlobalCheapestInsertionParameters) */ {
 public:
  inline GlobalCheapestInsertionParameters() : GlobalCheapestInsertionParameters(nullptr) {}
  ~GlobalCheapestInsertionParameters() PROTOBUF_FINAL;
 
#if defined(PROTOBUF_CUSTOM_VTABLE)
  void operator delete(GlobalCheapestInsertionParameters* PROTOBUF_NONNULL msg, ::std::destroying_delete_t) {
    SharedDtor(*msg);
    ::google::protobuf::internal::SizedDelete(msg, sizeof(GlobalCheapestInsertionParameters));
  }
#endif
 
  template <typename = void>
  explicit PROTOBUF_CONSTEXPR GlobalCheapestInsertionParameters(::google::protobuf::internal::ConstantInitialized);
 
  inline GlobalCheapestInsertionParameters(const GlobalCheapestInsertionParameters& from) : GlobalCheapestInsertionParameters(nullptr, from) {}
  inline GlobalCheapestInsertionParameters(GlobalCheapestInsertionParameters&& from) noexcept
      : GlobalCheapestInsertionParameters(nullptr, ::std::move(from)) {}
  inline GlobalCheapestInsertionParameters& operator=(const GlobalCheapestInsertionParameters& from) {
    CopyFrom(from);
    return *this;
  }
  inline GlobalCheapestInsertionParameters& operator=(GlobalCheapestInsertionParameters&& from) noexcept {
    if (this == &from) return *this;
    if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {
      InternalSwap(&from);
    } else {
      CopyFrom(from);
    }
    return *this;
  }
 
  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);
  }
  inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()
      ABSL_ATTRIBUTE_LIFETIME_BOUND {
    return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();
  }
 
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {
    return GetDescriptor();
  }
  static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {
    return default_instance().GetMetadata().descriptor;
  }
  static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {
    return default_instance().GetMetadata().reflection;
  }
  static const GlobalCheapestInsertionParameters& default_instance() {
    return *reinterpret_cast<const GlobalCheapestInsertionParameters*>(
        &_GlobalCheapestInsertionParameters_default_instance_);
  }
  static constexpr int kIndexInFileMessages = 2;
  friend void swap(GlobalCheapestInsertionParameters& a, GlobalCheapestInsertionParameters& b) { a.Swap(&b); }
  inline void Swap(GlobalCheapestInsertionParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {
      InternalSwap(other);
    } else {
      ::google::protobuf::internal::GenericSwap(this, other);
    }
  }
  void UnsafeArenaSwap(GlobalCheapestInsertionParameters* PROTOBUF_NONNULL other) {
    if (other == this) return;
    ABSL_DCHECK(GetArena() == other->GetArena());
    InternalSwap(other);
  }
 
  // implements Message ----------------------------------------------
 
  GlobalCheapestInsertionParameters* PROTOBUF_NONNULL New(::google::protobuf::Arena* PROTOBUF_NULLABLE arena = nullptr) const {
    return ::google::protobuf::Message::DefaultConstruct<GlobalCheapestInsertionParameters>(arena);
  }
  using ::google::protobuf::Message::CopyFrom;
  void CopyFrom(const GlobalCheapestInsertionParameters& from);
  using ::google::protobuf::Message::MergeFrom;
  void MergeFrom(const GlobalCheapestInsertionParameters& from) { GlobalCheapestInsertionParameters::MergeImpl(*this, from); }
 
  private:
  static void MergeImpl(::google::protobuf::MessageLite& to_msg,
                        const ::google::protobuf::MessageLite& from_msg);
 
  public:
  bool IsInitialized() const {
    return true;
  }
  ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;
  #if defined(PROTOBUF_CUSTOM_VTABLE)
  private:
  static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);
  static ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);
 
  public:
  ::size_t ByteSizeLong() const { return ByteSizeLong(*this); }
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {
    return _InternalSerialize(*this, target, stream);
  }
  #else   // PROTOBUF_CUSTOM_VTABLE
  ::size_t ByteSizeLong() const final;
  ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(
      ::uint8_t* PROTOBUF_NONNULL target,
      ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;
  #endif  // PROTOBUF_CUSTOM_VTABLE
  int GetCachedSize() const { return _impl_._cached_size_.Get(); }
 
  private:
  void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static void SharedDtor(MessageLite& self);
  void InternalSwap(GlobalCheapestInsertionParameters* PROTOBUF_NONNULL other);
 private:
  template <typename T>
  friend ::absl::string_view(::google::protobuf::internal::GetAnyMessageName)();
  static ::absl::string_view FullMessageName() { return "operations_research.GlobalCheapestInsertionParameters"; }
 
  explicit GlobalCheapestInsertionParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  GlobalCheapestInsertionParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const GlobalCheapestInsertionParameters& from);
  GlobalCheapestInsertionParameters(
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, GlobalCheapestInsertionParameters&& from) noexcept
      : GlobalCheapestInsertionParameters(arena) {
    *this = ::std::move(from);
  }
  const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;
  static void* PROTOBUF_NONNULL PlacementNew_(
      const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,
      ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
  static constexpr auto InternalNewImpl_();
 
 public:
  static constexpr auto InternalGenerateClassData_();
 
  ::google::protobuf::Metadata GetMetadata() const;
  // nested types ----------------------------------------------------
 
  // accessors -------------------------------------------------------
  enum : int {
    kFarthestSeedsRatioFieldNumber = 1,
    kNeighborsRatioFieldNumber = 2,
    kMinNeighborsFieldNumber = 3,
    kUseNeighborsRatioForInitializationFieldNumber = 6,
    kAddUnperformedEntriesFieldNumber = 7,
  };
  // double farthest_seeds_ratio = 1;
  void clear_farthest_seeds_ratio() ;
  double farthest_seeds_ratio() const;
  void set_farthest_seeds_ratio(double value);
 
  private:
  double _internal_farthest_seeds_ratio() const;
  void _internal_set_farthest_seeds_ratio(double value);
 
  public:
  // double neighbors_ratio = 2;
  void clear_neighbors_ratio() ;
  double neighbors_ratio() const;
  void set_neighbors_ratio(double value);
 
  private:
  double _internal_neighbors_ratio() const;
  void _internal_set_neighbors_ratio(double value);
 
  public:
  // int32 min_neighbors = 3;
  void clear_min_neighbors() ;
  ::int32_t min_neighbors() const;
  void set_min_neighbors(::int32_t value);
 
  private:
  ::int32_t _internal_min_neighbors() const;
  void _internal_set_min_neighbors(::int32_t value);
 
  public:
  // bool use_neighbors_ratio_for_initialization = 6;
  void clear_use_neighbors_ratio_for_initialization() ;
  bool use_neighbors_ratio_for_initialization() const;
  void set_use_neighbors_ratio_for_initialization(bool value);
 
  private:
  bool _internal_use_neighbors_ratio_for_initialization() const;
  void _internal_set_use_neighbors_ratio_for_initialization(bool value);
 
  public:
  // bool add_unperformed_entries = 7;
  void clear_add_unperformed_entries() ;
  bool add_unperformed_entries() const;
  void set_add_unperformed_entries(bool value);
 
  private:
  bool _internal_add_unperformed_entries() const;
  void _internal_set_add_unperformed_entries(bool value);
 
  public:
  // @@protoc_insertion_point(class_scope:operations_research.GlobalCheapestInsertionParameters)
 private:
  class _Internal;
  friend class ::google::protobuf::internal::TcParser;
  static const ::google::protobuf::internal::TcParseTable<3, 5,
                                   0, 0,
                                   2>
      _table_;
 
  friend class ::google::protobuf::MessageLite;
  friend class ::google::protobuf::Arena;
  template <typename T>
  friend class ::google::protobuf::Arena::InternalHelper;
  using InternalArenaConstructable_ = void;
  using DestructorSkippable_ = void;
  struct Impl_ {
    inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);
    inline explicit Impl_(
        ::google::protobuf::internal::InternalVisibility visibility,
        ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,
        const GlobalCheapestInsertionParameters& from_msg);
    ::google::protobuf::internal::HasBits<1> _has_bits_;
    ::google::protobuf::internal::CachedSize _cached_size_;
    double farthest_seeds_ratio_;
    double neighbors_ratio_;
    ::int32_t min_neighbors_;
    bool use_neighbors_ratio_for_initialization_;
    bool add_unperformed_entries_;
    PROTOBUF_TSAN_DECLARE_MEMBER
  };
  union { Impl_ _impl_; };
  friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;
};
 
OR_PROTO_DLL extern const ::google::protobuf::internal::ClassDataFull GlobalCheapestInsertionParameters_class_data_;
 
// ===================================================================
 
 
 
 
// ===================================================================
 
 
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wstrict-aliasing"
#endif  // __GNUC__
// -------------------------------------------------------------------
 
// LocalCheapestInsertionParameters
 
// .operations_research.LocalCheapestInsertionParameters.PairInsertionStrategy pickup_delivery_strategy = 1;
inline void LocalCheapestInsertionParameters::clear_pickup_delivery_strategy() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.pickup_delivery_strategy_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000002U);
}
inline ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters::pickup_delivery_strategy() const {
  // @@protoc_insertion_point(field_get:operations_research.LocalCheapestInsertionParameters.pickup_delivery_strategy)
  return _internal_pickup_delivery_strategy();
}
inline void LocalCheapestInsertionParameters::set_pickup_delivery_strategy(::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy value) {
  _internal_set_pickup_delivery_strategy(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000002U);
  // @@protoc_insertion_point(field_set:operations_research.LocalCheapestInsertionParameters.pickup_delivery_strategy)
}
inline ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters::_internal_pickup_delivery_strategy() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return static_cast<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy>(_impl_.pickup_delivery_strategy_);
}
inline void LocalCheapestInsertionParameters::_internal_set_pickup_delivery_strategy(::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.pickup_delivery_strategy_ = value;
}
 
// repeated .operations_research.LocalCheapestInsertionParameters.InsertionSortingProperty insertion_sorting_properties = 2;
inline int LocalCheapestInsertionParameters::_internal_insertion_sorting_properties_size() const {
  return _internal_insertion_sorting_properties().size();
}
inline int LocalCheapestInsertionParameters::insertion_sorting_properties_size() const {
  return _internal_insertion_sorting_properties_size();
}
inline void LocalCheapestInsertionParameters::clear_insertion_sorting_properties() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.insertion_sorting_properties_.Clear();
  ClearHasBitForRepeated(_impl_._has_bits_[0],
                  0x00000001U);
}
inline ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty LocalCheapestInsertionParameters::insertion_sorting_properties(int index) const {
  // @@protoc_insertion_point(field_get:operations_research.LocalCheapestInsertionParameters.insertion_sorting_properties)
  return static_cast<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty>(_internal_insertion_sorting_properties().Get(index));
}
inline void LocalCheapestInsertionParameters::set_insertion_sorting_properties(int index, ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value) {
  _internal_mutable_insertion_sorting_properties()->Set(index, value);
  // @@protoc_insertion_point(field_set:operations_research.LocalCheapestInsertionParameters.insertion_sorting_properties)
}
inline void LocalCheapestInsertionParameters::add_insertion_sorting_properties(::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _internal_mutable_insertion_sorting_properties()->Add(value);
  SetHasBitForRepeated(_impl_._has_bits_[0], 0x00000001U);
  // @@protoc_insertion_point(field_add:operations_research.LocalCheapestInsertionParameters.insertion_sorting_properties)
}
inline const ::google::protobuf::RepeatedField<int>& LocalCheapestInsertionParameters::insertion_sorting_properties() const
    ABSL_ATTRIBUTE_LIFETIME_BOUND {
  // @@protoc_insertion_point(field_list:operations_research.LocalCheapestInsertionParameters.insertion_sorting_properties)
  return _internal_insertion_sorting_properties();
}
inline ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL LocalCheapestInsertionParameters::mutable_insertion_sorting_properties()
    ABSL_ATTRIBUTE_LIFETIME_BOUND {
  SetHasBitForRepeated(_impl_._has_bits_[0], 0x00000001U);
  // @@protoc_insertion_point(field_mutable_list:operations_research.LocalCheapestInsertionParameters.insertion_sorting_properties)
  ::google::protobuf::internal::TSanWrite(&_impl_);
  return _internal_mutable_insertion_sorting_properties();
}
inline const ::google::protobuf::RepeatedField<int>& LocalCheapestInsertionParameters::_internal_insertion_sorting_properties()
    const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.insertion_sorting_properties_;
}
inline ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL
LocalCheapestInsertionParameters::_internal_mutable_insertion_sorting_properties() {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return &_impl_.insertion_sorting_properties_;
}
 
// -------------------------------------------------------------------
 
// SavingsParameters
 
// double neighbors_ratio = 1;
inline void SavingsParameters::clear_neighbors_ratio() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.neighbors_ratio_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000001U);
}
inline double SavingsParameters::neighbors_ratio() const {
  // @@protoc_insertion_point(field_get:operations_research.SavingsParameters.neighbors_ratio)
  return _internal_neighbors_ratio();
}
inline void SavingsParameters::set_neighbors_ratio(double value) {
  _internal_set_neighbors_ratio(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
  // @@protoc_insertion_point(field_set:operations_research.SavingsParameters.neighbors_ratio)
}
inline double SavingsParameters::_internal_neighbors_ratio() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.neighbors_ratio_;
}
inline void SavingsParameters::_internal_set_neighbors_ratio(double value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.neighbors_ratio_ = value;
}
 
// double max_memory_usage_bytes = 2;
inline void SavingsParameters::clear_max_memory_usage_bytes() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.max_memory_usage_bytes_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000002U);
}
inline double SavingsParameters::max_memory_usage_bytes() const {
  // @@protoc_insertion_point(field_get:operations_research.SavingsParameters.max_memory_usage_bytes)
  return _internal_max_memory_usage_bytes();
}
inline void SavingsParameters::set_max_memory_usage_bytes(double value) {
  _internal_set_max_memory_usage_bytes(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000002U);
  // @@protoc_insertion_point(field_set:operations_research.SavingsParameters.max_memory_usage_bytes)
}
inline double SavingsParameters::_internal_max_memory_usage_bytes() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.max_memory_usage_bytes_;
}
inline void SavingsParameters::_internal_set_max_memory_usage_bytes(double value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.max_memory_usage_bytes_ = value;
}
 
// bool add_reverse_arcs = 3;
inline void SavingsParameters::clear_add_reverse_arcs() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.add_reverse_arcs_ = false;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000008U);
}
inline bool SavingsParameters::add_reverse_arcs() const {
  // @@protoc_insertion_point(field_get:operations_research.SavingsParameters.add_reverse_arcs)
  return _internal_add_reverse_arcs();
}
inline void SavingsParameters::set_add_reverse_arcs(bool value) {
  _internal_set_add_reverse_arcs(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000008U);
  // @@protoc_insertion_point(field_set:operations_research.SavingsParameters.add_reverse_arcs)
}
inline bool SavingsParameters::_internal_add_reverse_arcs() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.add_reverse_arcs_;
}
inline void SavingsParameters::_internal_set_add_reverse_arcs(bool value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.add_reverse_arcs_ = value;
}
 
// double arc_coefficient = 4;
inline void SavingsParameters::clear_arc_coefficient() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.arc_coefficient_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000004U);
}
inline double SavingsParameters::arc_coefficient() const {
  // @@protoc_insertion_point(field_get:operations_research.SavingsParameters.arc_coefficient)
  return _internal_arc_coefficient();
}
inline void SavingsParameters::set_arc_coefficient(double value) {
  _internal_set_arc_coefficient(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000004U);
  // @@protoc_insertion_point(field_set:operations_research.SavingsParameters.arc_coefficient)
}
inline double SavingsParameters::_internal_arc_coefficient() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.arc_coefficient_;
}
inline void SavingsParameters::_internal_set_arc_coefficient(double value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.arc_coefficient_ = value;
}
 
// -------------------------------------------------------------------
 
// GlobalCheapestInsertionParameters
 
// double farthest_seeds_ratio = 1;
inline void GlobalCheapestInsertionParameters::clear_farthest_seeds_ratio() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.farthest_seeds_ratio_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000001U);
}
inline double GlobalCheapestInsertionParameters::farthest_seeds_ratio() const {
  // @@protoc_insertion_point(field_get:operations_research.GlobalCheapestInsertionParameters.farthest_seeds_ratio)
  return _internal_farthest_seeds_ratio();
}
inline void GlobalCheapestInsertionParameters::set_farthest_seeds_ratio(double value) {
  _internal_set_farthest_seeds_ratio(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
  // @@protoc_insertion_point(field_set:operations_research.GlobalCheapestInsertionParameters.farthest_seeds_ratio)
}
inline double GlobalCheapestInsertionParameters::_internal_farthest_seeds_ratio() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.farthest_seeds_ratio_;
}
inline void GlobalCheapestInsertionParameters::_internal_set_farthest_seeds_ratio(double value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.farthest_seeds_ratio_ = value;
}
 
// double neighbors_ratio = 2;
inline void GlobalCheapestInsertionParameters::clear_neighbors_ratio() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.neighbors_ratio_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000002U);
}
inline double GlobalCheapestInsertionParameters::neighbors_ratio() const {
  // @@protoc_insertion_point(field_get:operations_research.GlobalCheapestInsertionParameters.neighbors_ratio)
  return _internal_neighbors_ratio();
}
inline void GlobalCheapestInsertionParameters::set_neighbors_ratio(double value) {
  _internal_set_neighbors_ratio(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000002U);
  // @@protoc_insertion_point(field_set:operations_research.GlobalCheapestInsertionParameters.neighbors_ratio)
}
inline double GlobalCheapestInsertionParameters::_internal_neighbors_ratio() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.neighbors_ratio_;
}
inline void GlobalCheapestInsertionParameters::_internal_set_neighbors_ratio(double value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.neighbors_ratio_ = value;
}
 
// int32 min_neighbors = 3;
inline void GlobalCheapestInsertionParameters::clear_min_neighbors() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.min_neighbors_ = 0;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000004U);
}
inline ::int32_t GlobalCheapestInsertionParameters::min_neighbors() const {
  // @@protoc_insertion_point(field_get:operations_research.GlobalCheapestInsertionParameters.min_neighbors)
  return _internal_min_neighbors();
}
inline void GlobalCheapestInsertionParameters::set_min_neighbors(::int32_t value) {
  _internal_set_min_neighbors(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000004U);
  // @@protoc_insertion_point(field_set:operations_research.GlobalCheapestInsertionParameters.min_neighbors)
}
inline ::int32_t GlobalCheapestInsertionParameters::_internal_min_neighbors() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.min_neighbors_;
}
inline void GlobalCheapestInsertionParameters::_internal_set_min_neighbors(::int32_t value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.min_neighbors_ = value;
}
 
// bool use_neighbors_ratio_for_initialization = 6;
inline void GlobalCheapestInsertionParameters::clear_use_neighbors_ratio_for_initialization() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.use_neighbors_ratio_for_initialization_ = false;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000008U);
}
inline bool GlobalCheapestInsertionParameters::use_neighbors_ratio_for_initialization() const {
  // @@protoc_insertion_point(field_get:operations_research.GlobalCheapestInsertionParameters.use_neighbors_ratio_for_initialization)
  return _internal_use_neighbors_ratio_for_initialization();
}
inline void GlobalCheapestInsertionParameters::set_use_neighbors_ratio_for_initialization(bool value) {
  _internal_set_use_neighbors_ratio_for_initialization(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000008U);
  // @@protoc_insertion_point(field_set:operations_research.GlobalCheapestInsertionParameters.use_neighbors_ratio_for_initialization)
}
inline bool GlobalCheapestInsertionParameters::_internal_use_neighbors_ratio_for_initialization() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.use_neighbors_ratio_for_initialization_;
}
inline void GlobalCheapestInsertionParameters::_internal_set_use_neighbors_ratio_for_initialization(bool value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.use_neighbors_ratio_for_initialization_ = value;
}
 
// bool add_unperformed_entries = 7;
inline void GlobalCheapestInsertionParameters::clear_add_unperformed_entries() {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.add_unperformed_entries_ = false;
  ClearHasBit(_impl_._has_bits_[0],
                  0x00000010U);
}
inline bool GlobalCheapestInsertionParameters::add_unperformed_entries() const {
  // @@protoc_insertion_point(field_get:operations_research.GlobalCheapestInsertionParameters.add_unperformed_entries)
  return _internal_add_unperformed_entries();
}
inline void GlobalCheapestInsertionParameters::set_add_unperformed_entries(bool value) {
  _internal_set_add_unperformed_entries(value);
  SetHasBit(_impl_._has_bits_[0], 0x00000010U);
  // @@protoc_insertion_point(field_set:operations_research.GlobalCheapestInsertionParameters.add_unperformed_entries)
}
inline bool GlobalCheapestInsertionParameters::_internal_add_unperformed_entries() const {
  ::google::protobuf::internal::TSanRead(&_impl_);
  return _impl_.add_unperformed_entries_;
}
inline void GlobalCheapestInsertionParameters::_internal_set_add_unperformed_entries(bool value) {
  ::google::protobuf::internal::TSanWrite(&_impl_);
  _impl_.add_unperformed_entries_ = value;
}
 
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif  // __GNUC__
 
// @@protoc_insertion_point(namespace_scope)
}  // namespace operations_research
 
 
namespace google {
namespace protobuf {
 
template <>
struct is_proto_enum<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy> : std::true_type {};
template <>
inline const EnumDescriptor* PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy>() {
  return ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor();
}
template <>
struct is_proto_enum<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty> : std::true_type {};
template <>
inline const EnumDescriptor* PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty>() {
  return ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor();
}
 
}  // namespace protobuf
}  // namespace google
 
// @@protoc_insertion_point(global_scope)
 
#include "google/protobuf/port_undef.inc"
 
#endif  // ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto_2epb_2eh