Google OR-Tools: build/ortools/constraint_solver/routing_heuristic_parameters.pb.h Source File

1

2

3

4

5

6#ifndef ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto_2epb_2eh

7#define ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto_2epb_2eh

8

9#include <limits>

10#include <string>

11#include <type_traits>

12#include <utility>

13

14#include "google/protobuf/runtime_version.h"

15#if PROTOBUF_VERSION != 6033001

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"

19#endif

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"

33

34

35

36#include "google/protobuf/port_def.inc"

37

38#define PROTOBUF_INTERNAL_EXPORT_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto OR_PROTO_DLL

39

41namespace protobuf {

43template <typename T>

45}

46}

47}

48

49

53extern "C" {

55}

73}

76template <>

77internal::EnumTraitsT<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_>

78 internal::EnumTraitsImpl::value<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty>;

79template <>

80internal::EnumTraitsT<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_>

81 internal::EnumTraitsImpl::value<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy>;

82}

83}

84

92 ::std::numeric_limits<::int32_t>::min(),

94 ::std::numeric_limits<::int32_t>::max(),

95};

96

103 return 0 <= value && value <= 3;

104}

107template <typename T>

109 static_assert(::std::is_same<T, LocalCheapestInsertionParameters_PairInsertionStrategy>::value ||

110 ::std::is_integral<T>::value,

111 "Incorrect type passed to PairInsertionStrategy_Name().");

113}

114template <>

116 return ::google::protobuf::internal::NameOfDenseEnum<LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor, 0, 3>(

117 static_cast<int>(value));

118}

135 ::std::numeric_limits<::int32_t>::min(),

137 ::std::numeric_limits<::int32_t>::max(),

138};

139

146 return 0 <= value && value <= 8;

147}

150template <typename T>

152 static_assert(::std::is_same<T, LocalCheapestInsertionParameters_InsertionSortingProperty>::value ||

153 ::std::is_integral<T>::value,

154 "Incorrect type passed to InsertionSortingProperty_Name().");

156}

157template <>

159 return ::google::protobuf::internal::NameOfDenseEnum<LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor, 0, 8>(

160 static_cast<int>(value));

161}

167

168

169

170

171

172

173class OR_PROTO_DLL SavingsParameters final : public ::google::protobuf::Message

174 {

179#if defined(PROTOBUF_CUSTOM_VTABLE)

180 void operator delete(SavingsParameters* PROTOBUF_NONNULL msg, ::std::destroying_delete_t) {

181 SharedDtor(*msg);

182 ::google::protobuf::internal::SizedDelete(msg, sizeof(SavingsParameters));

183 }

184#endif

185

186 template <typename = void>

187 explicit PROTOBUF_CONSTEXPR SavingsParameters(::google::protobuf::internal::ConstantInitialized);

188

194 return *this;

195 }

197 if (this == &from) return *this;

198 if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {

199 InternalSwap(&from);

200 } else {

201 CopyFrom(from);

202 }

203 return *this;

204 }

205

206 inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const

207 ABSL_ATTRIBUTE_LIFETIME_BOUND {

208 return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);

209 }

210 inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()

211 ABSL_ATTRIBUTE_LIFETIME_BOUND {

212 return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();

213 }

214

215 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {

216 return GetDescriptor();

218 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {

219 return default_instance().GetMetadata().descriptor;

221 static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {

222 return default_instance().GetMetadata().reflection;

227 }

228 static constexpr int kIndexInFileMessages = 1;

231 if (other == this) return;

232 if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {

233 InternalSwap(other);

234 } else {

235 ::google::protobuf::internal::GenericSwap(this, other);

236 }

237 }

238 void UnsafeArenaSwap(SavingsParameters* PROTOBUF_NONNULL other) {

239 if (other == this) return;

240 ABSL_DCHECK(GetArena() == other->GetArena());

241 InternalSwap(other);

242 }

243

244

245

246 SavingsParameters* PROTOBUF_NONNULL New(::google::protobuf::Arena* PROTOBUF_NULLABLE arena = nullptr) const {

247 return ::google::protobuf::Message::DefaultConstruct<SavingsParameters>(arena);

249 using ::google::protobuf::Message::CopyFrom;

251 using ::google::protobuf::Message::MergeFrom;

252 void MergeFrom(const SavingsParameters& from) { SavingsParameters::MergeImpl(*this, from); }

253

255 static void MergeImpl(::google::protobuf::MessageLite& to_msg,

256 const ::google::protobuf::MessageLite& from_msg);

257

258 public:

260 return true;

262 ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;

263 #if defined(PROTOBUF_CUSTOM_VTABLE)

264 private:

265 static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);

266 static ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

267 const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,

268 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);

269

270 public:

271 ::size_t ByteSizeLong() const { return ByteSizeLong(*this); }

272 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

273 ::uint8_t* PROTOBUF_NONNULL target,

274 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {

275 return _InternalSerialize(*this, target, stream);

276 }

277 #else

278 ::size_t ByteSizeLong() const final;

279 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

280 ::uint8_t* PROTOBUF_NONNULL target,

281 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;

282 #endif

283 int GetCachedSize() const { return _impl_._cached_size_.Get(); }

284

286 void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

287 static void SharedDtor(MessageLite& self);

289 private:

290 template <typename T>

292 static ::absl::string_view FullMessageName() { return "operations_research.SavingsParameters"; }

293

294 explicit SavingsParameters(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

297 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, SavingsParameters&& from) noexcept

299 *this = ::std::move(from);

300 }

301 const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;

302 static void* PROTOBUF_NONNULL PlacementNew_(

303 const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,

304 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

305 static constexpr auto InternalNewImpl_();

306

307 public:

308 static constexpr auto InternalGenerateClassData_();

309

310 ::google::protobuf::Metadata GetMetadata() const;

311

312

313

314 enum : int {

315 kNeighborsRatioFieldNumber = 1,

316 kMaxMemoryUsageBytesFieldNumber = 2,

320

324

325 private:

326 double _internal_neighbors_ratio() const;

327 void _internal_set_neighbors_ratio(double value);

328

329 public:

330

334

335 private:

336 double _internal_max_memory_usage_bytes() const;

337 void _internal_set_max_memory_usage_bytes(double value);

338

339 public:

340

344

345 private:

346 double _internal_arc_coefficient() const;

347 void _internal_set_arc_coefficient(double value);

348

349 public:

350

354

355 private:

356 bool _internal_add_reverse_arcs() const;

357 void _internal_set_add_reverse_arcs(bool value);

358

359 public:

360

361 private:

363 friend class ::google::protobuf::internal::TcParser;

364 static const ::google::protobuf::internal::TcParseTable<2, 4,

366 2>

367 _table_;

368

369 friend class ::google::protobuf::MessageLite;

370 friend class ::google::protobuf::Arena;

371 template <typename T>

372 friend class ::google::protobuf::Arena::InternalHelper;

373 using InternalArenaConstructable_ = void;

374 using DestructorSkippable_ = void;

375 struct Impl_ {

376 inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;

377 inline explicit Impl_(

378 ::google::protobuf::internal::InternalVisibility visibility,

379 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

380 inline explicit Impl_(

381 ::google::protobuf::internal::InternalVisibility visibility,

382 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,

384 ::google::protobuf::internal::HasBits<1> _has_bits_;

385 ::google::protobuf::internal::CachedSize _cached_size_;

386 double neighbors_ratio_;

387 double max_memory_usage_bytes_;

388 double arc_coefficient_;

389 bool add_reverse_arcs_;

390 PROTOBUF_TSAN_DECLARE_MEMBER

391 };

392 union { Impl_ _impl_; };

393 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;

397

398

400 {

401 public:

404

405#if defined(PROTOBUF_CUSTOM_VTABLE)

407 SharedDtor(*msg);

409 }

410#endif

411

412 template <typename = void>

414

423 if (this == &from) return *this;

424 if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {

425 InternalSwap(&from);

426 } else {

427 CopyFrom(from);

428 }

429 return *this;

430 }

431

432 inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const

433 ABSL_ATTRIBUTE_LIFETIME_BOUND {

434 return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);

436 inline ::google::protobuf::UnknownFieldSet* PROTOBUF_NONNULL mutable_unknown_fields()

437 ABSL_ATTRIBUTE_LIFETIME_BOUND {

438 return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();

440

441 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {

442 return GetDescriptor();

443 }

444 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {

446 }

447 static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {

449 }

454 static constexpr int kIndexInFileMessages = 0;

456 inline void Swap(LocalCheapestInsertionParameters* PROTOBUF_NONNULL other) {

457 if (other == this) return;

458 if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {

459 InternalSwap(other);

460 } else {

461 ::google::protobuf::internal::GenericSwap(this, other);

462 }

463 }

464 void UnsafeArenaSwap(LocalCheapestInsertionParameters* PROTOBUF_NONNULL other) {

465 if (other == this) return;

466 ABSL_DCHECK(GetArena() == other->GetArena());

467 InternalSwap(other);

468 }

469

470

471

473 return ::google::protobuf::Message::DefaultConstruct<LocalCheapestInsertionParameters>(arena);

474 }

475 using ::google::protobuf::Message::CopyFrom;

477 using ::google::protobuf::Message::MergeFrom;

479

480 private:

481 static void MergeImpl(::google::protobuf::MessageLite& to_msg,

482 const ::google::protobuf::MessageLite& from_msg);

483

484 public:

486 return true;

487 }

488 ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;

489 #if defined(PROTOBUF_CUSTOM_VTABLE)

490 private:

491 static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);

493 const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,

494 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);

495

496 public:

498 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

499 ::uint8_t* PROTOBUF_NONNULL target,

500 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {

501 return _InternalSerialize(*this, target, stream);

502 }

503 #else

504 ::size_t ByteSizeLong() const final;

505 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

506 ::uint8_t* PROTOBUF_NONNULL target,

507 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;

508 #endif

509 int GetCachedSize() const { return _impl_._cached_size_.Get(); }

510

511 private:

512 void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

513 static void SharedDtor(MessageLite& self);

515 private:

516 template <typename T>

518 static ::absl::string_view FullMessageName() { return "operations_research.LocalCheapestInsertionParameters"; }

519

525 *this = ::std::move(from);

526 }

527 const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;

528 static void* PROTOBUF_NONNULL PlacementNew_(

529 const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,

530 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

531 static constexpr auto InternalNewImpl_();

532

533 public:

534 static constexpr auto InternalGenerateClassData_();

535

536 ::google::protobuf::Metadata GetMetadata() const;

537

538 using PairInsertionStrategy = LocalCheapestInsertionParameters_PairInsertionStrategy;

539 static constexpr PairInsertionStrategy AUTOMATIC = LocalCheapestInsertionParameters_PairInsertionStrategy_AUTOMATIC;

540 static constexpr PairInsertionStrategy BEST_PICKUP_THEN_BEST_DELIVERY = LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_THEN_BEST_DELIVERY;

552 template <typename T>

555 }

579 template <typename T>

582 }

590 kInsertionSortingPropertiesFieldNumber = 2,

591 kPickupDeliveryStrategyFieldNumber = 1,

592 };

593

595 private:

596 int _internal_insertion_sorting_properties_size() const;

597

598 public:

600 public:

606

607 private:

608 const ::google::protobuf::RepeatedField<int>& _internal_insertion_sorting_properties() const;

609 ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL _internal_mutable_insertion_sorting_properties();

610

611 public:

612

616

617 private:

620

621 public:

622

623 private:

625 friend class ::google::protobuf::internal::TcParser;

626 static const ::google::protobuf::internal::TcParseTable<1, 2,

627 0, 0,

629 _table_;

630

631 friend class ::google::protobuf::MessageLite;

632 friend class ::google::protobuf::Arena;

633 template <typename T>

634 friend class ::google::protobuf::Arena::InternalHelper;

635 using InternalArenaConstructable_ = void;

636 using DestructorSkippable_ = void;

637 struct Impl_ {

638 inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;

639 inline explicit Impl_(

640 ::google::protobuf::internal::InternalVisibility visibility,

641 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

642 inline explicit Impl_(

643 ::google::protobuf::internal::InternalVisibility visibility,

644 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,

646 ::google::protobuf::internal::HasBits<1> _has_bits_;

647 ::google::protobuf::internal::CachedSize _cached_size_;

648 ::google::protobuf::RepeatedField<int> insertion_sorting_properties_;

649 ::google::protobuf::internal::CachedSize _insertion_sorting_properties_cached_byte_size_;

650 int pickup_delivery_strategy_;

651 PROTOBUF_TSAN_DECLARE_MEMBER

652 };

653 union { Impl_ _impl_; };

654 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;

655};

658

659

661 {

662 public:

665

666#if defined(PROTOBUF_CUSTOM_VTABLE)

668 SharedDtor(*msg);

670 }

671#endif

672

673 template <typename = void>

675

677 inline GlobalCheapestInsertionParameters(GlobalCheapestInsertionParameters&& from) noexcept

684 if (this == &from) return *this;

685 if (::google::protobuf::internal::CanMoveWithInternalSwap(GetArena(), from.GetArena())) {

686 InternalSwap(&from);

688 CopyFrom(from);

689 }

690 return *this;

691 }

692

693 inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const

694 ABSL_ATTRIBUTE_LIFETIME_BOUND {

695 return _internal_metadata_.unknown_fields<::google::protobuf::UnknownFieldSet>(::google::protobuf::UnknownFieldSet::default_instance);

696 }

698 ABSL_ATTRIBUTE_LIFETIME_BOUND {

699 return _internal_metadata_.mutable_unknown_fields<::google::protobuf::UnknownFieldSet>();

700 }

702 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL descriptor() {

704 }

705 static const ::google::protobuf::Descriptor* PROTOBUF_NONNULL GetDescriptor() {

707 }

708 static const ::google::protobuf::Reflection* PROTOBUF_NONNULL GetReflection() {

718 if (other == this) return;

719 if (::google::protobuf::internal::CanUseInternalSwap(GetArena(), other->GetArena())) {

720 InternalSwap(other);

722 ::google::protobuf::internal::GenericSwap(this, other);

723 }

724 }

725 void UnsafeArenaSwap(GlobalCheapestInsertionParameters* PROTOBUF_NONNULL other) {

726 if (other == this) return;

727 ABSL_DCHECK(GetArena() == other->GetArena());

728 InternalSwap(other);

734 return ::google::protobuf::Message::DefaultConstruct<GlobalCheapestInsertionParameters>(arena);

735 }

736 using ::google::protobuf::Message::CopyFrom;

738 using ::google::protobuf::Message::MergeFrom;

740

741 private:

742 static void MergeImpl(::google::protobuf::MessageLite& to_msg,

743 const ::google::protobuf::MessageLite& from_msg);

744

745 public:

747 return true;

748 }

749 ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL;

750 #if defined(PROTOBUF_CUSTOM_VTABLE)

751 private:

752 static ::size_t ByteSizeLong(const ::google::protobuf::MessageLite& msg);

754 const ::google::protobuf::MessageLite& msg, ::uint8_t* PROTOBUF_NONNULL target,

755 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream);

756

757 public:

759 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

760 ::uint8_t* PROTOBUF_NONNULL target,

761 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const {

762 return _InternalSerialize(*this, target, stream);

763 }

764 #else

765 ::size_t ByteSizeLong() const final;

766 ::uint8_t* PROTOBUF_NONNULL _InternalSerialize(

767 ::uint8_t* PROTOBUF_NONNULL target,

768 ::google::protobuf::io::EpsCopyOutputStream* PROTOBUF_NONNULL stream) const final;

769 #endif

770 int GetCachedSize() const { return _impl_._cached_size_.Get(); }

771

772 private:

773 void SharedCtor(::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

776 private:

777 template <typename T>

779 static ::absl::string_view FullMessageName() { return "operations_research.GlobalCheapestInsertionParameters"; }

780

786 *this = ::std::move(from);

787 }

788 const ::google::protobuf::internal::ClassData* PROTOBUF_NONNULL GetClassData() const PROTOBUF_FINAL;

789 static void* PROTOBUF_NONNULL PlacementNew_(

790 const void* PROTOBUF_NONNULL, void* PROTOBUF_NONNULL mem,

791 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

792 static constexpr auto InternalNewImpl_();

793

794 public:

795 static constexpr auto InternalGenerateClassData_();

796

797 ::google::protobuf::Metadata GetMetadata() const;

798

799

800

801 enum : int {

802 kFarthestSeedsRatioFieldNumber = 1,

803 kNeighborsRatioFieldNumber = 2,

804 kMinNeighborsFieldNumber = 3,

805 kUseNeighborsRatioForInitializationFieldNumber = 6,

808

812

813 private:

814 double _internal_farthest_seeds_ratio() const;

815 void _internal_set_farthest_seeds_ratio(double value);

816

817 public:

818

822

823 private:

824 double _internal_neighbors_ratio() const;

825 void _internal_set_neighbors_ratio(double value);

826

827 public:

828

832

833 private:

834 ::int32_t _internal_min_neighbors() const;

835 void _internal_set_min_neighbors(::int32_t value);

836

837 public:

838

842

843 private:

844 bool _internal_use_neighbors_ratio_for_initialization() const;

845 void _internal_set_use_neighbors_ratio_for_initialization(bool value);

846

847 public:

848

852

853 private:

854 bool _internal_add_unperformed_entries() const;

855 void _internal_set_add_unperformed_entries(bool value);

856

857 public:

858

859 private:

861 friend class ::google::protobuf::internal::TcParser;

862 static const ::google::protobuf::internal::TcParseTable<3, 5,

863 0, 0,

864 2>

866

867 friend class ::google::protobuf::MessageLite;

868 friend class ::google::protobuf::Arena;

869 template <typename T>

870 friend class ::google::protobuf::Arena::InternalHelper;

871 using InternalArenaConstructable_ = void;

872 using DestructorSkippable_ = void;

873 struct Impl_ {

874 inline explicit constexpr Impl_(::google::protobuf::internal::ConstantInitialized) noexcept;

875 inline explicit Impl_(

876 ::google::protobuf::internal::InternalVisibility visibility,

877 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena);

878 inline explicit Impl_(

879 ::google::protobuf::internal::InternalVisibility visibility,

880 ::google::protobuf::Arena* PROTOBUF_NULLABLE arena, const Impl_& from,

882 ::google::protobuf::internal::HasBits<1> _has_bits_;

883 ::google::protobuf::internal::CachedSize _cached_size_;

884 double farthest_seeds_ratio_;

885 double neighbors_ratio_;

886 ::int32_t min_neighbors_;

887 bool use_neighbors_ratio_for_initialization_;

888 bool add_unperformed_entries_;

889 PROTOBUF_TSAN_DECLARE_MEMBER

890 };

891 union { Impl_ _impl_; };

892 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto;

893};

894

897

898

899

900

901

902

903

904

905#ifdef __GNUC__

906#pragma GCC diagnostic push

907#pragma GCC diagnostic ignored "-Wstrict-aliasing"

908#endif

909

910

911

912

913

915 ::google::protobuf::internal::TSanWrite(&_impl_);

916 _impl_.pickup_delivery_strategy_ = 0;

917 ClearHasBit(_impl_._has_bits_[0],

918 0x00000002U);

919}

921

922 return _internal_pickup_delivery_strategy();

923}

925 _internal_set_pickup_delivery_strategy(value);

926 SetHasBit(_impl_._has_bits_[0], 0x00000002U);

927

928}

929inline ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters::_internal_pickup_delivery_strategy() const {

930 ::google::protobuf::internal::TSanRead(&_impl_);

932}

934 ::google::protobuf::internal::TSanWrite(&_impl_);

935 _impl_.pickup_delivery_strategy_ = value;

936}

937

938

939inline int LocalCheapestInsertionParameters::_internal_insertion_sorting_properties_size() const {

940 return _internal_insertion_sorting_properties().size();

941}

943 return _internal_insertion_sorting_properties_size();

944}

946 ::google::protobuf::internal::TSanWrite(&_impl_);

947 _impl_.insertion_sorting_properties_.Clear();

948 ClearHasBitForRepeated(_impl_._has_bits_[0],

952

954}

956 _internal_mutable_insertion_sorting_properties()->Set(index, value);

957

960 ::google::protobuf::internal::TSanWrite(&_impl_);

961 _internal_mutable_insertion_sorting_properties()->Add(value);

962 SetHasBitForRepeated(_impl_._has_bits_[0], 0x00000001U);

963

964}

966 ABSL_ATTRIBUTE_LIFETIME_BOUND {

967

968 return _internal_insertion_sorting_properties();

969}

971 ABSL_ATTRIBUTE_LIFETIME_BOUND {

972 SetHasBitForRepeated(_impl_._has_bits_[0], 0x00000001U);

973

974 ::google::protobuf::internal::TSanWrite(&_impl_);

975 return _internal_mutable_insertion_sorting_properties();

976}

977inline const ::google::protobuf::RepeatedField<int>& LocalCheapestInsertionParameters::_internal_insertion_sorting_properties()

978 const {

979 ::google::protobuf::internal::TSanRead(&_impl_);

980 return _impl_.insertion_sorting_properties_;

981}

982inline ::google::protobuf::RepeatedField<int>* PROTOBUF_NONNULL

983LocalCheapestInsertionParameters::_internal_mutable_insertion_sorting_properties() {

984 ::google::protobuf::internal::TSanRead(&_impl_);

985 return &_impl_.insertion_sorting_properties_;

986}

987

988

989

990

991

992

994 ::google::protobuf::internal::TSanWrite(&_impl_);

995 _impl_.neighbors_ratio_ = 0;

996 ClearHasBit(_impl_._has_bits_[0],

997 0x00000001U);

998}

1000

1001 return _internal_neighbors_ratio();

1002}

1004 _internal_set_neighbors_ratio(value);

1005 SetHasBit(_impl_._has_bits_[0], 0x00000001U);

1006

1008inline double SavingsParameters::_internal_neighbors_ratio() const {

1009 ::google::protobuf::internal::TSanRead(&_impl_);

1010 return _impl_.neighbors_ratio_;

1012inline void SavingsParameters::_internal_set_neighbors_ratio(double value) {

1013 ::google::protobuf::internal::TSanWrite(&_impl_);

1014 _impl_.neighbors_ratio_ = value;

1015}

1016

1017

1019 ::google::protobuf::internal::TSanWrite(&_impl_);

1020 _impl_.max_memory_usage_bytes_ = 0;

1021 ClearHasBit(_impl_._has_bits_[0],

1022 0x00000002U);

1023}

1025

1026 return _internal_max_memory_usage_bytes();

1027}

1029 _internal_set_max_memory_usage_bytes(value);

1030 SetHasBit(_impl_._has_bits_[0], 0x00000002U);

1031

1033inline double SavingsParameters::_internal_max_memory_usage_bytes() const {

1034 ::google::protobuf::internal::TSanRead(&_impl_);

1035 return _impl_.max_memory_usage_bytes_;

1037inline void SavingsParameters::_internal_set_max_memory_usage_bytes(double value) {

1038 ::google::protobuf::internal::TSanWrite(&_impl_);

1039 _impl_.max_memory_usage_bytes_ = value;

1040}

1041

1042

1044 ::google::protobuf::internal::TSanWrite(&_impl_);

1045 _impl_.add_reverse_arcs_ = false;

1046 ClearHasBit(_impl_._has_bits_[0],

1047 0x00000008U);

1048}

1050

1051 return _internal_add_reverse_arcs();

1052}

1054 _internal_set_add_reverse_arcs(value);

1055 SetHasBit(_impl_._has_bits_[0], 0x00000008U);

1056

1058inline bool SavingsParameters::_internal_add_reverse_arcs() const {

1059 ::google::protobuf::internal::TSanRead(&_impl_);

1060 return _impl_.add_reverse_arcs_;

1062inline void SavingsParameters::_internal_set_add_reverse_arcs(bool value) {

1063 ::google::protobuf::internal::TSanWrite(&_impl_);

1064 _impl_.add_reverse_arcs_ = value;

1065}

1066

1067

1069 ::google::protobuf::internal::TSanWrite(&_impl_);

1070 _impl_.arc_coefficient_ = 0;

1071 ClearHasBit(_impl_._has_bits_[0],

1072 0x00000004U);

1073}

1075

1076 return _internal_arc_coefficient();

1077}

1079 _internal_set_arc_coefficient(value);

1080 SetHasBit(_impl_._has_bits_[0], 0x00000004U);

1081

1083inline double SavingsParameters::_internal_arc_coefficient() const {

1084 ::google::protobuf::internal::TSanRead(&_impl_);

1085 return _impl_.arc_coefficient_;

1087inline void SavingsParameters::_internal_set_arc_coefficient(double value) {

1088 ::google::protobuf::internal::TSanWrite(&_impl_);

1089 _impl_.arc_coefficient_ = value;

1090}

1091

1092

1093

1094

1095

1096

1098 ::google::protobuf::internal::TSanWrite(&_impl_);

1099 _impl_.farthest_seeds_ratio_ = 0;

1100 ClearHasBit(_impl_._has_bits_[0],

1101 0x00000001U);

1102}

1104

1105 return _internal_farthest_seeds_ratio();

1108 _internal_set_farthest_seeds_ratio(value);

1109 SetHasBit(_impl_._has_bits_[0], 0x00000001U);

1110

1111}

1112inline double GlobalCheapestInsertionParameters::_internal_farthest_seeds_ratio() const {

1113 ::google::protobuf::internal::TSanRead(&_impl_);

1114 return _impl_.farthest_seeds_ratio_;

1115}

1116inline void GlobalCheapestInsertionParameters::_internal_set_farthest_seeds_ratio(double value) {

1117 ::google::protobuf::internal::TSanWrite(&_impl_);

1118 _impl_.farthest_seeds_ratio_ = value;

1119}

1120

1121

1123 ::google::protobuf::internal::TSanWrite(&_impl_);

1124 _impl_.neighbors_ratio_ = 0;

1125 ClearHasBit(_impl_._has_bits_[0],

1126 0x00000002U);

1127}

1129

1130 return _internal_neighbors_ratio();

1133 _internal_set_neighbors_ratio(value);

1134 SetHasBit(_impl_._has_bits_[0], 0x00000002U);

1135

1136}

1137inline double GlobalCheapestInsertionParameters::_internal_neighbors_ratio() const {

1138 ::google::protobuf::internal::TSanRead(&_impl_);

1139 return _impl_.neighbors_ratio_;

1140}

1141inline void GlobalCheapestInsertionParameters::_internal_set_neighbors_ratio(double value) {

1142 ::google::protobuf::internal::TSanWrite(&_impl_);

1143 _impl_.neighbors_ratio_ = value;

1144}

1145

1146

1148 ::google::protobuf::internal::TSanWrite(&_impl_);

1149 _impl_.min_neighbors_ = 0;

1150 ClearHasBit(_impl_._has_bits_[0],

1151 0x00000004U);

1152}

1154

1155 return _internal_min_neighbors();

1158 _internal_set_min_neighbors(value);

1159 SetHasBit(_impl_._has_bits_[0], 0x00000004U);

1160

1161}

1162inline ::int32_t GlobalCheapestInsertionParameters::_internal_min_neighbors() const {

1163 ::google::protobuf::internal::TSanRead(&_impl_);

1164 return _impl_.min_neighbors_;

1165}

1166inline void GlobalCheapestInsertionParameters::_internal_set_min_neighbors(::int32_t value) {

1167 ::google::protobuf::internal::TSanWrite(&_impl_);

1168 _impl_.min_neighbors_ = value;

1169}

1170

1171

1173 ::google::protobuf::internal::TSanWrite(&_impl_);

1174 _impl_.use_neighbors_ratio_for_initialization_ = false;

1175 ClearHasBit(_impl_._has_bits_[0],

1176 0x00000008U);

1177}

1179

1180 return _internal_use_neighbors_ratio_for_initialization();

1183 _internal_set_use_neighbors_ratio_for_initialization(value);

1184 SetHasBit(_impl_._has_bits_[0], 0x00000008U);

1185

1186}

1187inline bool GlobalCheapestInsertionParameters::_internal_use_neighbors_ratio_for_initialization() const {

1188 ::google::protobuf::internal::TSanRead(&_impl_);

1189 return _impl_.use_neighbors_ratio_for_initialization_;

1190}

1191inline void GlobalCheapestInsertionParameters::_internal_set_use_neighbors_ratio_for_initialization(bool value) {

1192 ::google::protobuf::internal::TSanWrite(&_impl_);

1193 _impl_.use_neighbors_ratio_for_initialization_ = value;

1194}

1195

1196

1198 ::google::protobuf::internal::TSanWrite(&_impl_);

1199 _impl_.add_unperformed_entries_ = false;

1200 ClearHasBit(_impl_._has_bits_[0],

1201 0x00000010U);

1202}

1204

1205 return _internal_add_unperformed_entries();

1208 _internal_set_add_unperformed_entries(value);

1209 SetHasBit(_impl_._has_bits_[0], 0x00000010U);

1210

1211}

1212inline bool GlobalCheapestInsertionParameters::_internal_add_unperformed_entries() const {

1213 ::google::protobuf::internal::TSanRead(&_impl_);

1214 return _impl_.add_unperformed_entries_;

1215}

1216inline void GlobalCheapestInsertionParameters::_internal_set_add_unperformed_entries(bool value) {

1217 ::google::protobuf::internal::TSanWrite(&_impl_);

1218 _impl_.add_unperformed_entries_ = value;

1219}

1220

1221#ifdef __GNUC__

1222#pragma GCC diagnostic pop

1223#endif

1224

1225

1226}

1227

1228

1230namespace protobuf {

1231

1232template <>

1234template <>

1236 return ::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor();

1237}

1238template <>

1240template <>

1242 return ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor();

1243}

1247

1248

1249

1250#include "google/protobuf/port_undef.inc"

1251

1252#endif

::size_t ByteSizeLong() const final

void clear_neighbors_ratio()

Definition routing_heuristic_parameters.pb.h:1131

static const GlobalCheapestInsertionParameters & default_instance()

Definition routing_heuristic_parameters.pb.h:715

friend class ::google::protobuf::MessageLite

Definition routing_heuristic_parameters.pb.h:871

void CopyFrom(const GlobalCheapestInsertionParameters &from)

void clear_farthest_seeds_ratio()

Definition routing_heuristic_parameters.pb.h:1106

void Swap(GlobalCheapestInsertionParameters *PROTOBUF_NONNULL other)

Definition routing_heuristic_parameters.pb.h:721

bool add_unperformed_entries() const

Definition routing_heuristic_parameters.pb.h:1212

void set_add_unperformed_entries(bool value)

Definition routing_heuristic_parameters.pb.h:1216

double neighbors_ratio() const

Definition routing_heuristic_parameters.pb.h:1137

PROTOBUF_CONSTEXPR GlobalCheapestInsertionParameters(::google::protobuf::internal::ConstantInitialized)

::int32_t min_neighbors() const

Definition routing_heuristic_parameters.pb.h:1162

void clear_use_neighbors_ratio_for_initialization()

Definition routing_heuristic_parameters.pb.h:1181

void set_farthest_seeds_ratio(double value)

Definition routing_heuristic_parameters.pb.h:1116

void set_neighbors_ratio(double value)

Definition routing_heuristic_parameters.pb.h:1141

@ kAddUnperformedEntriesFieldNumber

Definition routing_heuristic_parameters.pb.h:810

inline ::google::protobuf::UnknownFieldSet *PROTOBUF_NONNULL mutable_unknown_fields() ABSL_ATTRIBUTE_LIFETIME_BOUND

Definition routing_heuristic_parameters.pb.h:701

void MergeFrom(const GlobalCheapestInsertionParameters &from)

Definition routing_heuristic_parameters.pb.h:743

static const ::google::protobuf::Descriptor *PROTOBUF_NONNULL descriptor()

Definition routing_heuristic_parameters.pb.h:706

static const ::google::protobuf::Descriptor *PROTOBUF_NONNULL GetDescriptor()

Definition routing_heuristic_parameters.pb.h:709

void set_use_neighbors_ratio_for_initialization(bool value)

Definition routing_heuristic_parameters.pb.h:1191

const ::google::protobuf::UnknownFieldSet & unknown_fields() const ABSL_ATTRIBUTE_LIFETIME_BOUND

Definition routing_heuristic_parameters.pb.h:697

double farthest_seeds_ratio() const

Definition routing_heuristic_parameters.pb.h:1112

void clear_min_neighbors()

Definition routing_heuristic_parameters.pb.h:1156

static constexpr int kIndexInFileMessages

Definition routing_heuristic_parameters.pb.h:719

void set_min_neighbors(::int32_t value)

Definition routing_heuristic_parameters.pb.h:1166

bool use_neighbors_ratio_for_initialization() const

Definition routing_heuristic_parameters.pb.h:1187

::uint8_t *PROTOBUF_NONNULL _InternalSerialize(::uint8_t *PROTOBUF_NONNULL target, ::google::protobuf::io::EpsCopyOutputStream *PROTOBUF_NONNULL stream) const final

GlobalCheapestInsertionParameters()

Definition routing_heuristic_parameters.pb.h:667

bool IsInitialized() const

Definition routing_heuristic_parameters.pb.h:750

GlobalCheapestInsertionParameters & operator=(const GlobalCheapestInsertionParameters &from)

Definition routing_heuristic_parameters.pb.h:683

void clear_add_unperformed_entries()

Definition routing_heuristic_parameters.pb.h:1206

friend void swap(GlobalCheapestInsertionParameters &a, GlobalCheapestInsertionParameters &b)

Definition routing_heuristic_parameters.pb.h:720

friend class ::google::protobuf::MessageLite

Definition routing_heuristic_parameters.pb.h:634

::size_t ByteSizeLong() const final

bool IsInitialized() const

Definition routing_heuristic_parameters.pb.h:488

::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy pickup_delivery_strategy() const

Definition routing_heuristic_parameters.pb.h:927

static constexpr InsertionSortingProperty SORTING_PROPERTY_PENALTY

Definition routing_heuristic_parameters.pb.h:566

static constexpr InsertionSortingProperty SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:570

void clear_pickup_delivery_strategy()

Definition routing_heuristic_parameters.pb.h:921

static constexpr int PairInsertionStrategy_ARRAYSIZE

Definition routing_heuristic_parameters.pb.h:551

::google::protobuf::RepeatedField< int > *PROTOBUF_NONNULL mutable_insertion_sorting_properties()

Definition routing_heuristic_parameters.pb.h:977

void clear_insertion_sorting_properties()

Definition routing_heuristic_parameters.pb.h:952

const ::google::protobuf::RepeatedField< int > & insertion_sorting_properties() const

Definition routing_heuristic_parameters.pb.h:972

static const ::std::string & PairInsertionStrategy_Name(T value)

Definition routing_heuristic_parameters.pb.h:556

void add_insertion_sorting_properties(::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value)

Definition routing_heuristic_parameters.pb.h:966

static const ::google::protobuf::Reflection *PROTOBUF_NONNULL GetReflection()

Definition routing_heuristic_parameters.pb.h:450

static constexpr int InsertionSortingProperty_ARRAYSIZE

Definition routing_heuristic_parameters.pb.h:578

const ::google::protobuf::UnknownFieldSet & unknown_fields() const ABSL_ATTRIBUTE_LIFETIME_BOUND

Definition routing_heuristic_parameters.pb.h:435

static constexpr PairInsertionStrategy PairInsertionStrategy_MAX

Definition routing_heuristic_parameters.pb.h:550

::uint8_t *PROTOBUF_NONNULL _InternalSerialize(::uint8_t *PROTOBUF_NONNULL target, ::google::protobuf::io::EpsCopyOutputStream *PROTOBUF_NONNULL stream) const final

LocalCheapestInsertionParameters_PairInsertionStrategy PairInsertionStrategy

Definition routing_heuristic_parameters.pb.h:541

static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL PairInsertionStrategy_descriptor()

Definition routing_heuristic_parameters.pb.h:552

static const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL InsertionSortingProperty_descriptor()

Definition routing_heuristic_parameters.pb.h:579

static constexpr InsertionSortingProperty InsertionSortingProperty_MAX

Definition routing_heuristic_parameters.pb.h:577

static const ::google::protobuf::Descriptor *PROTOBUF_NONNULL GetDescriptor()

Definition routing_heuristic_parameters.pb.h:447

void set_pickup_delivery_strategy(::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy value)

Definition routing_heuristic_parameters.pb.h:931

static bool InsertionSortingProperty_Parse(::absl::string_view name, InsertionSortingProperty *PROTOBUF_NONNULL value)

Definition routing_heuristic_parameters.pb.h:586

static constexpr PairInsertionStrategy BEST_PICKUP_DELIVERY_PAIR

Definition routing_heuristic_parameters.pb.h:544

static constexpr InsertionSortingProperty InsertionSortingProperty_MIN

Definition routing_heuristic_parameters.pb.h:576

static constexpr InsertionSortingProperty SORTING_PROPERTY_RANDOM

Definition routing_heuristic_parameters.pb.h:572

LocalCheapestInsertionParameters_InsertionSortingProperty InsertionSortingProperty

Definition routing_heuristic_parameters.pb.h:563

void CopyFrom(const LocalCheapestInsertionParameters &from)

static constexpr PairInsertionStrategy PairInsertionStrategy_MIN

Definition routing_heuristic_parameters.pb.h:549

LocalCheapestInsertionParameters()

Definition routing_heuristic_parameters.pb.h:405

static const LocalCheapestInsertionParameters & default_instance()

Definition routing_heuristic_parameters.pb.h:453

static const ::std::string & InsertionSortingProperty_Name(T value)

Definition routing_heuristic_parameters.pb.h:583

void MergeFrom(const LocalCheapestInsertionParameters &from)

Definition routing_heuristic_parameters.pb.h:481

static constexpr PairInsertionStrategy BEST_PICKUP_DELIVERY_PAIR_MULTITOUR

Definition routing_heuristic_parameters.pb.h:545

static bool PairInsertionStrategy_Parse(::absl::string_view name, PairInsertionStrategy *PROTOBUF_NONNULL value)

Definition routing_heuristic_parameters.pb.h:559

static bool PairInsertionStrategy_IsValid(int value)

Definition routing_heuristic_parameters.pb.h:546

static constexpr InsertionSortingProperty SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:569

static constexpr InsertionSortingProperty SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO

Definition routing_heuristic_parameters.pb.h:567

::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty insertion_sorting_properties(int index) const

Definition routing_heuristic_parameters.pb.h:958

void set_insertion_sorting_properties(int index, ::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty value)

Definition routing_heuristic_parameters.pb.h:962

LocalCheapestInsertionParameters & operator=(const LocalCheapestInsertionParameters &from)

Definition routing_heuristic_parameters.pb.h:421

PROTOBUF_CONSTEXPR LocalCheapestInsertionParameters(::google::protobuf::internal::ConstantInitialized)

static bool InsertionSortingProperty_IsValid(int value)

Definition routing_heuristic_parameters.pb.h:573

static constexpr InsertionSortingProperty SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE

Definition routing_heuristic_parameters.pb.h:571

int insertion_sorting_properties_size() const

Definition routing_heuristic_parameters.pb.h:949

ABSL_ATTRIBUTE_REINITIALIZES void Clear() PROTOBUF_FINAL

void Swap(LocalCheapestInsertionParameters *PROTOBUF_NONNULL other)

Definition routing_heuristic_parameters.pb.h:459

static constexpr InsertionSortingProperty SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:568

friend class ::google::protobuf::MessageLite

Definition routing_heuristic_parameters.pb.h:371

void CopyFrom(const SavingsParameters &from)

void set_add_reverse_arcs(bool value)

Definition routing_heuristic_parameters.pb.h:1061

double arc_coefficient() const

Definition routing_heuristic_parameters.pb.h:1082

void set_neighbors_ratio(double value)

Definition routing_heuristic_parameters.pb.h:1011

SavingsParameters(const SavingsParameters &from)

Definition routing_heuristic_parameters.pb.h:191

void Swap(SavingsParameters *PROTOBUF_NONNULL other)

Definition routing_heuristic_parameters.pb.h:232

const ::google::protobuf::UnknownFieldSet & unknown_fields() const ABSL_ATTRIBUTE_LIFETIME_BOUND

Definition routing_heuristic_parameters.pb.h:208

void clear_arc_coefficient()

Definition routing_heuristic_parameters.pb.h:1076

@ kAddReverseArcsFieldNumber

Definition routing_heuristic_parameters.pb.h:320

@ kArcCoefficientFieldNumber

Definition routing_heuristic_parameters.pb.h:319

void clear_add_reverse_arcs()

Definition routing_heuristic_parameters.pb.h:1051

SavingsParameters & operator=(const SavingsParameters &from)

Definition routing_heuristic_parameters.pb.h:194

double max_memory_usage_bytes() const

Definition routing_heuristic_parameters.pb.h:1032

void set_max_memory_usage_bytes(double value)

Definition routing_heuristic_parameters.pb.h:1036

bool add_reverse_arcs() const

Definition routing_heuristic_parameters.pb.h:1057

SavingsParameters()

Definition routing_heuristic_parameters.pb.h:178

double neighbors_ratio() const

Definition routing_heuristic_parameters.pb.h:1007

bool IsInitialized() const

Definition routing_heuristic_parameters.pb.h:261

void set_arc_coefficient(double value)

Definition routing_heuristic_parameters.pb.h:1086

void clear_max_memory_usage_bytes()

Definition routing_heuristic_parameters.pb.h:1026

void clear_neighbors_ratio()

Definition routing_heuristic_parameters.pb.h:1001

PROTOBUF_CONSTEXPR SavingsParameters(::google::protobuf::internal::ConstantInitialized)

::absl::string_view GetAnyMessageName()

const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy >()

Definition routing_heuristic_parameters.pb.h:1244

const EnumDescriptor *PROTOBUF_NONNULL GetEnumDescriptor<::operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty >()

Definition routing_heuristic_parameters.pb.h:1250

constexpr LocalCheapestInsertionParameters_InsertionSortingProperty LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MIN

Definition routing_heuristic_parameters.pb.h:141

PROTOBUF_CONSTINIT const uint32_t LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_[]

PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull SavingsParameters_class_data_

const ::std::string & LocalCheapestInsertionParameters_PairInsertionStrategy_Name(T value)

Definition routing_heuristic_parameters.pb.h:108

PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull LocalCheapestInsertionParameters_class_data_

constexpr LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MAX

Definition routing_heuristic_parameters.pb.h:100

PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GlobalCheapestInsertionParametersDefaultTypeInternal _GlobalCheapestInsertionParameters_default_instance_

PROTOBUF_CONSTINIT const uint32_t LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_[]

const ::std::string & LocalCheapestInsertionParameters_InsertionSortingProperty_Name(T value)

Definition routing_heuristic_parameters.pb.h:151

LocalCheapestInsertionParameters_InsertionSortingProperty

Definition routing_heuristic_parameters.pb.h:124

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_MIN_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:131

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_UNSPECIFIED

Definition routing_heuristic_parameters.pb.h:125

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_DIMENSION_USAGE

Definition routing_heuristic_parameters.pb.h:132

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_ALLOWED_VEHICLES

Definition routing_heuristic_parameters.pb.h:126

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_HIGHEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:129

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY_OVER_ALLOWED_VEHICLES_RATIO

Definition routing_heuristic_parameters.pb.h:128

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_RANDOM

Definition routing_heuristic_parameters.pb.h:133

@ LocalCheapestInsertionParameters_InsertionSortingProperty_LocalCheapestInsertionParameters_InsertionSortingProperty_INT_MAX_SENTINEL_DO_NOT_USE_

Definition routing_heuristic_parameters.pb.h:136

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_LOWEST_AVG_ARC_COST_TO_VEHICLE_START_ENDS

Definition routing_heuristic_parameters.pb.h:130

@ LocalCheapestInsertionParameters_InsertionSortingProperty_SORTING_PROPERTY_PENALTY

Definition routing_heuristic_parameters.pb.h:127

@ LocalCheapestInsertionParameters_InsertionSortingProperty_LocalCheapestInsertionParameters_InsertionSortingProperty_INT_MIN_SENTINEL_DO_NOT_USE_

Definition routing_heuristic_parameters.pb.h:134

bool LocalCheapestInsertionParameters_InsertionSortingProperty_IsValid(int value)

Definition routing_heuristic_parameters.pb.h:145

const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor()

bool LocalCheapestInsertionParameters_InsertionSortingProperty_Parse(::absl::string_view name, LocalCheapestInsertionParameters_InsertionSortingProperty *PROTOBUF_NONNULL value)

Definition routing_heuristic_parameters.pb.h:162

constexpr LocalCheapestInsertionParameters_InsertionSortingProperty LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MAX

Definition routing_heuristic_parameters.pb.h:143

PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull GlobalCheapestInsertionParameters_class_data_

bool LocalCheapestInsertionParameters_PairInsertionStrategy_IsValid(int value)

Definition routing_heuristic_parameters.pb.h:102

constexpr int LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_ARRAYSIZE

Definition routing_heuristic_parameters.pb.h:105

constexpr LocalCheapestInsertionParameters_PairInsertionStrategy LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MIN

Definition routing_heuristic_parameters.pb.h:98

LocalCheapestInsertionParameters_PairInsertionStrategy

Definition routing_heuristic_parameters.pb.h:86

@ LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR

Definition routing_heuristic_parameters.pb.h:89

@ LocalCheapestInsertionParameters_PairInsertionStrategy_LocalCheapestInsertionParameters_PairInsertionStrategy_INT_MIN_SENTINEL_DO_NOT_USE_

Definition routing_heuristic_parameters.pb.h:91

@ LocalCheapestInsertionParameters_PairInsertionStrategy_LocalCheapestInsertionParameters_PairInsertionStrategy_INT_MAX_SENTINEL_DO_NOT_USE_

Definition routing_heuristic_parameters.pb.h:93

@ LocalCheapestInsertionParameters_PairInsertionStrategy_AUTOMATIC

Definition routing_heuristic_parameters.pb.h:87

@ LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_DELIVERY_PAIR_MULTITOUR

Definition routing_heuristic_parameters.pb.h:90

@ LocalCheapestInsertionParameters_PairInsertionStrategy_BEST_PICKUP_THEN_BEST_DELIVERY

Definition routing_heuristic_parameters.pb.h:88

constexpr int LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_ARRAYSIZE

Definition routing_heuristic_parameters.pb.h:148

PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SavingsParametersDefaultTypeInternal _SavingsParameters_default_instance_

bool LocalCheapestInsertionParameters_PairInsertionStrategy_Parse(::absl::string_view name, LocalCheapestInsertionParameters_PairInsertionStrategy *PROTOBUF_NONNULL value)

Definition routing_heuristic_parameters.pb.h:119

const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor()

PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalCheapestInsertionParametersDefaultTypeInternal _LocalCheapestInsertionParameters_default_instance_

PROTOBUF_CONSTINITconst ::_pbi::DescriptorTable descriptor_table_ortools_2fconstraint_5fsolver_2frouting_5fheuristic_5fparameters_2eproto