 |
OR-Tools
8.1
|
Go to the documentation of this file.
16 #define SWIG_DIRECTORS
21 template<
typename T>
class SwigValueWrapper {
22 struct SwigMovePointer {
24 SwigMovePointer(T *p) : ptr(p) { }
25 ~SwigMovePointer() {
delete ptr; }
26 SwigMovePointer& operator=(SwigMovePointer& rhs) { T* oldptr = ptr; ptr = 0;
delete oldptr; ptr = rhs.ptr; rhs.ptr = 0;
return *
this; }
28 SwigValueWrapper& operator=(
const SwigValueWrapper<T>& rhs);
29 SwigValueWrapper(
const SwigValueWrapper<T>& rhs);
31 SwigValueWrapper() : pointer(0) { }
32 SwigValueWrapper& operator=(
const T& t) { SwigMovePointer tmp(
new T(t)); pointer = tmp;
return *
this; }
33 operator T&()
const {
return *pointer.ptr; }
34 T *operator&() {
return pointer.ptr; }
37 template <
typename T> T SwigValueInit() {
48 #ifndef SWIGTEMPLATEDISAMBIGUATOR
49 # if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
50 # define SWIGTEMPLATEDISAMBIGUATOR template
51 # elif defined(__HP_aCC)
54 # define SWIGTEMPLATEDISAMBIGUATOR template
56 # define SWIGTEMPLATEDISAMBIGUATOR
62 # if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
63 # define SWIGINLINE inline
71 # if defined(__GNUC__)
72 # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
73 # define SWIGUNUSED __attribute__ ((__unused__))
78 # define SWIGUNUSED __attribute__ ((__unused__))
84 #ifndef SWIG_MSC_UNSUPPRESS_4505
85 # if defined(_MSC_VER)
86 # pragma warning(disable : 4505)
90 #ifndef SWIGUNUSEDPARM
92 # define SWIGUNUSEDPARM(p)
94 # define SWIGUNUSEDPARM(p) p SWIGUNUSED
100 # define SWIGINTERN static SWIGUNUSED
104 #ifndef SWIGINTERNINLINE
105 # define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
109 #if defined(__GNUC__)
110 # if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
111 # ifndef GCC_HASCLASSVISIBILITY
112 # define GCC_HASCLASSVISIBILITY
118 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
119 # if defined(STATIC_LINKED)
122 # define SWIGEXPORT __declspec(dllexport)
125 # if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
126 # define SWIGEXPORT __attribute__ ((visibility("default")))
135 # if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
136 # define SWIGSTDCALL __stdcall
143 #if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
144 # define _CRT_SECURE_NO_DEPRECATE
148 #if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
149 # define _SCL_SECURE_NO_DEPRECATE
153 #if defined(__APPLE__) && !defined(__ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES)
154 # define __ASSERT_MACROS_DEFINE_VERSIONS_WITHOUT_UNDERSCORES 0
162 #ifdef __INTEL_COMPILER
163 # pragma warning disable 592
300 #define SWIG_contract_assert(nullreturn, expr, msg) if (!(expr)) {SWIG_CSharpSetPendingExceptionArgument(SWIG_CSharpArgumentOutOfRangeException, msg, ""); return nullreturn; } else
303 #define SWIG_UnknownError -1
304 #define SWIG_IOError -2
305 #define SWIG_RuntimeError -3
306 #define SWIG_IndexError -4
307 #define SWIG_TypeError -5
308 #define SWIG_DivisionByZero -6
309 #define SWIG_OverflowError -7
310 #define SWIG_SyntaxError -8
311 #define SWIG_ValueError -9
312 #define SWIG_SystemError -10
313 #define SWIG_AttributeError -11
314 #define SWIG_MemoryError -12
315 #define SWIG_NullReferenceError -13
330 #ifdef SWIG_DIRECTOR_STATIC
341 #if defined(DEBUG_DIRECTOR_OWNED)
367 const char *
what()
const throw() {
378 static void raise(
const char *msg) {
447 #define SWIGWORDSIZE64
451 #if (__WORDSIZE == 32) || (LONG_MAX == INT_MAX)
452 # error "SWIG wrapped code invalid in 32 bit architecture, regenerate code using -DSWIGWORDSIZE32"
460 std::vector< int >* pv = 0;
462 pv =
new std::vector< int >();
465 throw std::out_of_range(
"capacity");
471 return (*
self)[
index];
473 throw std::out_of_range(
"index");
477 return (*
self)[
index];
479 throw std::out_of_range(
"index");
483 (*self)[
index] = val;
485 throw std::out_of_range(
"index");
488 self->insert(self->end(), values.begin(), values.end());
492 throw std::out_of_range(
"index");
494 throw std::out_of_range(
"count");
495 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
496 throw std::invalid_argument(
"invalid range");
497 return new std::vector< int >(self->begin()+
index, self->begin()+
index+count);
501 self->insert(self->begin()+
index, x);
503 throw std::out_of_range(
"index");
507 self->insert(self->begin()+
index, values.begin(), values.end());
509 throw std::out_of_range(
"index");
513 self->erase(self->begin() +
index);
515 throw std::out_of_range(
"index");
519 throw std::out_of_range(
"index");
521 throw std::out_of_range(
"count");
522 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
523 throw std::invalid_argument(
"invalid range");
524 self->erase(self->begin()+
index, self->begin()+
index+count);
528 throw std::out_of_range(
"count");
529 return new std::vector< int >(count,
value);
532 std::reverse(self->begin(), self->end());
536 throw std::out_of_range(
"index");
538 throw std::out_of_range(
"count");
539 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
540 throw std::invalid_argument(
"invalid range");
541 std::reverse(self->begin()+
index, self->begin()+
index+count);
545 throw std::out_of_range(
"index");
546 if (
index+values.size() > self->size())
547 throw std::out_of_range(
"index");
548 std::copy(values.begin(), values.end(), self->begin()+
index);
551 return std::find(self->begin(), self->end(),
value) !=
self->end();
555 std::vector< int >::iterator it = std::find(self->begin(), self->end(),
value);
556 if (it != self->end())
557 index = (int)(it - self->begin());
562 std::vector< int >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
563 if (rit != self->rend())
564 index = (int)(self->rend() - 1 - rit);
568 std::vector< int >::iterator it = std::find(self->begin(), self->end(),
value);
569 if (it != self->end()) {
576 std::vector< std::vector< int > >* pv = 0;
578 pv =
new std::vector< std::vector< int > >();
581 throw std::out_of_range(
"capacity");
587 return (*
self)[
index];
589 throw std::out_of_range(
"index");
593 return (*
self)[
index];
595 throw std::out_of_range(
"index");
599 (*self)[
index] = val;
601 throw std::out_of_range(
"index");
604 self->insert(self->end(), values.begin(), values.end());
608 throw std::out_of_range(
"index");
610 throw std::out_of_range(
"count");
611 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
612 throw std::invalid_argument(
"invalid range");
613 return new std::vector< std::vector< int > >(
self->begin()+
index,
self->begin()+
index+count);
617 self->insert(self->begin()+
index, x);
619 throw std::out_of_range(
"index");
623 self->insert(self->begin()+
index, values.begin(), values.end());
625 throw std::out_of_range(
"index");
629 self->erase(self->begin() +
index);
631 throw std::out_of_range(
"index");
635 throw std::out_of_range(
"index");
637 throw std::out_of_range(
"count");
638 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
639 throw std::invalid_argument(
"invalid range");
640 self->erase(self->begin()+
index, self->begin()+
index+count);
644 throw std::out_of_range(
"count");
645 return new std::vector< std::vector< int > >(count,
value);
648 std::reverse(self->begin(), self->end());
652 throw std::out_of_range(
"index");
654 throw std::out_of_range(
"count");
655 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
656 throw std::invalid_argument(
"invalid range");
657 std::reverse(self->begin()+
index, self->begin()+
index+count);
661 throw std::out_of_range(
"index");
662 if (
index+values.size() > self->size())
663 throw std::out_of_range(
"index");
664 std::copy(values.begin(), values.end(), self->begin()+
index);
667 std::vector< long >* pv = 0;
669 pv =
new std::vector< long >();
672 throw std::out_of_range(
"capacity");
678 return (*
self)[
index];
680 throw std::out_of_range(
"index");
684 return (*
self)[
index];
686 throw std::out_of_range(
"index");
690 (*self)[
index] = val;
692 throw std::out_of_range(
"index");
695 self->insert(self->end(), values.begin(), values.end());
699 throw std::out_of_range(
"index");
701 throw std::out_of_range(
"count");
702 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
703 throw std::invalid_argument(
"invalid range");
704 return new std::vector< long >(self->begin()+
index, self->begin()+
index+count);
708 self->insert(self->begin()+
index, x);
710 throw std::out_of_range(
"index");
714 self->insert(self->begin()+
index, values.begin(), values.end());
716 throw std::out_of_range(
"index");
720 self->erase(self->begin() +
index);
722 throw std::out_of_range(
"index");
726 throw std::out_of_range(
"index");
728 throw std::out_of_range(
"count");
729 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
730 throw std::invalid_argument(
"invalid range");
731 self->erase(self->begin()+
index, self->begin()+
index+count);
735 throw std::out_of_range(
"count");
736 return new std::vector< long >(count,
value);
739 std::reverse(self->begin(), self->end());
743 throw std::out_of_range(
"index");
745 throw std::out_of_range(
"count");
746 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
747 throw std::invalid_argument(
"invalid range");
748 std::reverse(self->begin()+
index, self->begin()+
index+count);
752 throw std::out_of_range(
"index");
753 if (
index+values.size() > self->size())
754 throw std::out_of_range(
"index");
755 std::copy(values.begin(), values.end(), self->begin()+
index);
758 return std::find(self->begin(), self->end(),
value) !=
self->end();
762 std::vector< long >::iterator it = std::find(self->begin(), self->end(),
value);
763 if (it != self->end())
764 index = (int)(it - self->begin());
769 std::vector< long >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
770 if (rit != self->rend())
771 index = (int)(self->rend() - 1 - rit);
775 std::vector< long >::iterator it = std::find(self->begin(), self->end(),
value);
776 if (it != self->end()) {
783 std::vector< std::vector< int64 > >* pv = 0;
785 pv =
new std::vector< std::vector< int64 > >();
788 throw std::out_of_range(
"capacity");
794 return (*
self)[
index];
796 throw std::out_of_range(
"index");
800 return (*
self)[
index];
802 throw std::out_of_range(
"index");
806 (*self)[
index] = val;
808 throw std::out_of_range(
"index");
811 self->insert(self->end(), values.begin(), values.end());
815 throw std::out_of_range(
"index");
817 throw std::out_of_range(
"count");
818 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
819 throw std::invalid_argument(
"invalid range");
820 return new std::vector< std::vector< int64 > >(
self->begin()+
index,
self->begin()+
index+count);
824 self->insert(self->begin()+
index, x);
826 throw std::out_of_range(
"index");
830 self->insert(self->begin()+
index, values.begin(), values.end());
832 throw std::out_of_range(
"index");
836 self->erase(self->begin() +
index);
838 throw std::out_of_range(
"index");
842 throw std::out_of_range(
"index");
844 throw std::out_of_range(
"count");
845 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
846 throw std::invalid_argument(
"invalid range");
847 self->erase(self->begin()+
index, self->begin()+
index+count);
851 throw std::out_of_range(
"count");
852 return new std::vector< std::vector< int64 > >(count,
value);
855 std::reverse(self->begin(), self->end());
859 throw std::out_of_range(
"index");
861 throw std::out_of_range(
"count");
862 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
863 throw std::invalid_argument(
"invalid range");
864 std::reverse(self->begin()+
index, self->begin()+
index+count);
868 throw std::out_of_range(
"index");
869 if (
index+values.size() > self->size())
870 throw std::out_of_range(
"index");
871 std::copy(values.begin(), values.end(), self->begin()+
index);
882 #include <functional>
891 class LocalSearchPhaseParameters {
909 std::vector< operations_research::IntVar* >* pv = 0;
911 pv =
new std::vector< operations_research::IntVar* >();
914 throw std::out_of_range(
"capacity");
920 return (*
self)[
index];
922 throw std::out_of_range(
"index");
926 return (*
self)[
index];
928 throw std::out_of_range(
"index");
932 (*self)[
index] = val;
934 throw std::out_of_range(
"index");
937 self->insert(self->end(), values.begin(), values.end());
941 throw std::out_of_range(
"index");
943 throw std::out_of_range(
"count");
944 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
945 throw std::invalid_argument(
"invalid range");
946 return new std::vector< operations_research::IntVar* >(self->begin()+
index, self->begin()+
index+count);
950 self->insert(self->begin()+
index, x);
952 throw std::out_of_range(
"index");
956 self->insert(self->begin()+
index, values.begin(), values.end());
958 throw std::out_of_range(
"index");
962 self->erase(self->begin() +
index);
964 throw std::out_of_range(
"index");
968 throw std::out_of_range(
"index");
970 throw std::out_of_range(
"count");
971 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
972 throw std::invalid_argument(
"invalid range");
973 self->erase(self->begin()+
index, self->begin()+
index+count);
977 throw std::out_of_range(
"count");
978 return new std::vector< operations_research::IntVar* >(count,
value);
981 std::reverse(self->begin(), self->end());
985 throw std::out_of_range(
"index");
987 throw std::out_of_range(
"count");
988 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
989 throw std::invalid_argument(
"invalid range");
990 std::reverse(self->begin()+
index, self->begin()+
index+count);
994 throw std::out_of_range(
"index");
995 if (
index+values.size() > self->size())
996 throw std::out_of_range(
"index");
997 std::copy(values.begin(), values.end(), self->begin()+
index);
1000 return std::find(self->begin(), self->end(),
value) !=
self->end();
1004 std::vector< operations_research::IntVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1005 if (it != self->end())
1006 index = (int)(it - self->begin());
1011 std::vector< operations_research::IntVar* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1012 if (rit != self->rend())
1013 index = (int)(self->rend() - 1 - rit);
1017 std::vector< operations_research::IntVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1018 if (it != self->end()) {
1025 std::vector< operations_research::SearchMonitor* >* pv = 0;
1027 pv =
new std::vector< operations_research::SearchMonitor* >();
1030 throw std::out_of_range(
"capacity");
1036 return (*
self)[
index];
1038 throw std::out_of_range(
"index");
1042 return (*
self)[
index];
1044 throw std::out_of_range(
"index");
1048 (*self)[
index] = val;
1050 throw std::out_of_range(
"index");
1053 self->insert(self->end(), values.begin(), values.end());
1057 throw std::out_of_range(
"index");
1059 throw std::out_of_range(
"count");
1060 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1061 throw std::invalid_argument(
"invalid range");
1062 return new std::vector< operations_research::SearchMonitor* >(self->begin()+
index, self->begin()+
index+count);
1066 self->insert(self->begin()+
index, x);
1068 throw std::out_of_range(
"index");
1072 self->insert(self->begin()+
index, values.begin(), values.end());
1074 throw std::out_of_range(
"index");
1078 self->erase(self->begin() +
index);
1080 throw std::out_of_range(
"index");
1084 throw std::out_of_range(
"index");
1086 throw std::out_of_range(
"count");
1087 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1088 throw std::invalid_argument(
"invalid range");
1089 self->erase(self->begin()+
index, self->begin()+
index+count);
1093 throw std::out_of_range(
"count");
1094 return new std::vector< operations_research::SearchMonitor* >(count,
value);
1097 std::reverse(self->begin(), self->end());
1101 throw std::out_of_range(
"index");
1103 throw std::out_of_range(
"count");
1104 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1105 throw std::invalid_argument(
"invalid range");
1106 std::reverse(self->begin()+
index, self->begin()+
index+count);
1110 throw std::out_of_range(
"index");
1111 if (
index+values.size() > self->size())
1112 throw std::out_of_range(
"index");
1113 std::copy(values.begin(), values.end(), self->begin()+
index);
1116 return std::find(self->begin(), self->end(),
value) !=
self->end();
1120 std::vector< operations_research::SearchMonitor* >::iterator it = std::find(self->begin(), self->end(),
value);
1121 if (it != self->end())
1122 index = (int)(it - self->begin());
1127 std::vector< operations_research::SearchMonitor* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1128 if (rit != self->rend())
1129 index = (int)(self->rend() - 1 - rit);
1133 std::vector< operations_research::SearchMonitor* >::iterator it = std::find(self->begin(), self->end(),
value);
1134 if (it != self->end()) {
1141 std::vector< operations_research::DecisionBuilder* >* pv = 0;
1143 pv =
new std::vector< operations_research::DecisionBuilder* >();
1146 throw std::out_of_range(
"capacity");
1152 return (*
self)[
index];
1154 throw std::out_of_range(
"index");
1158 return (*
self)[
index];
1160 throw std::out_of_range(
"index");
1164 (*self)[
index] = val;
1166 throw std::out_of_range(
"index");
1169 self->insert(self->end(), values.begin(), values.end());
1173 throw std::out_of_range(
"index");
1175 throw std::out_of_range(
"count");
1176 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1177 throw std::invalid_argument(
"invalid range");
1178 return new std::vector< operations_research::DecisionBuilder* >(self->begin()+
index, self->begin()+
index+count);
1182 self->insert(self->begin()+
index, x);
1184 throw std::out_of_range(
"index");
1188 self->insert(self->begin()+
index, values.begin(), values.end());
1190 throw std::out_of_range(
"index");
1194 self->erase(self->begin() +
index);
1196 throw std::out_of_range(
"index");
1200 throw std::out_of_range(
"index");
1202 throw std::out_of_range(
"count");
1203 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1204 throw std::invalid_argument(
"invalid range");
1205 self->erase(self->begin()+
index, self->begin()+
index+count);
1209 throw std::out_of_range(
"count");
1210 return new std::vector< operations_research::DecisionBuilder* >(count,
value);
1213 std::reverse(self->begin(), self->end());
1217 throw std::out_of_range(
"index");
1219 throw std::out_of_range(
"count");
1220 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1221 throw std::invalid_argument(
"invalid range");
1222 std::reverse(self->begin()+
index, self->begin()+
index+count);
1226 throw std::out_of_range(
"index");
1227 if (
index+values.size() > self->size())
1228 throw std::out_of_range(
"index");
1229 std::copy(values.begin(), values.end(), self->begin()+
index);
1232 return std::find(self->begin(), self->end(),
value) !=
self->end();
1236 std::vector< operations_research::DecisionBuilder* >::iterator it = std::find(self->begin(), self->end(),
value);
1237 if (it != self->end())
1238 index = (int)(it - self->begin());
1243 std::vector< operations_research::DecisionBuilder* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1244 if (rit != self->rend())
1245 index = (int)(self->rend() - 1 - rit);
1249 std::vector< operations_research::DecisionBuilder* >::iterator it = std::find(self->begin(), self->end(),
value);
1250 if (it != self->end()) {
1257 std::vector< operations_research::IntervalVar* >* pv = 0;
1259 pv =
new std::vector< operations_research::IntervalVar* >();
1262 throw std::out_of_range(
"capacity");
1268 return (*
self)[
index];
1270 throw std::out_of_range(
"index");
1274 return (*
self)[
index];
1276 throw std::out_of_range(
"index");
1280 (*self)[
index] = val;
1282 throw std::out_of_range(
"index");
1285 self->insert(self->end(), values.begin(), values.end());
1289 throw std::out_of_range(
"index");
1291 throw std::out_of_range(
"count");
1292 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1293 throw std::invalid_argument(
"invalid range");
1294 return new std::vector< operations_research::IntervalVar* >(self->begin()+
index, self->begin()+
index+count);
1298 self->insert(self->begin()+
index, x);
1300 throw std::out_of_range(
"index");
1304 self->insert(self->begin()+
index, values.begin(), values.end());
1306 throw std::out_of_range(
"index");
1310 self->erase(self->begin() +
index);
1312 throw std::out_of_range(
"index");
1316 throw std::out_of_range(
"index");
1318 throw std::out_of_range(
"count");
1319 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1320 throw std::invalid_argument(
"invalid range");
1321 self->erase(self->begin()+
index, self->begin()+
index+count);
1325 throw std::out_of_range(
"count");
1326 return new std::vector< operations_research::IntervalVar* >(count,
value);
1329 std::reverse(self->begin(), self->end());
1333 throw std::out_of_range(
"index");
1335 throw std::out_of_range(
"count");
1336 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1337 throw std::invalid_argument(
"invalid range");
1338 std::reverse(self->begin()+
index, self->begin()+
index+count);
1342 throw std::out_of_range(
"index");
1343 if (
index+values.size() > self->size())
1344 throw std::out_of_range(
"index");
1345 std::copy(values.begin(), values.end(), self->begin()+
index);
1348 return std::find(self->begin(), self->end(),
value) !=
self->end();
1352 std::vector< operations_research::IntervalVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1353 if (it != self->end())
1354 index = (int)(it - self->begin());
1359 std::vector< operations_research::IntervalVar* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1360 if (rit != self->rend())
1361 index = (int)(self->rend() - 1 - rit);
1365 std::vector< operations_research::IntervalVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1366 if (it != self->end()) {
1373 std::vector< operations_research::SequenceVar* >* pv = 0;
1375 pv =
new std::vector< operations_research::SequenceVar* >();
1378 throw std::out_of_range(
"capacity");
1384 return (*
self)[
index];
1386 throw std::out_of_range(
"index");
1390 return (*
self)[
index];
1392 throw std::out_of_range(
"index");
1396 (*self)[
index] = val;
1398 throw std::out_of_range(
"index");
1401 self->insert(self->end(), values.begin(), values.end());
1405 throw std::out_of_range(
"index");
1407 throw std::out_of_range(
"count");
1408 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1409 throw std::invalid_argument(
"invalid range");
1410 return new std::vector< operations_research::SequenceVar* >(self->begin()+
index, self->begin()+
index+count);
1414 self->insert(self->begin()+
index, x);
1416 throw std::out_of_range(
"index");
1420 self->insert(self->begin()+
index, values.begin(), values.end());
1422 throw std::out_of_range(
"index");
1426 self->erase(self->begin() +
index);
1428 throw std::out_of_range(
"index");
1432 throw std::out_of_range(
"index");
1434 throw std::out_of_range(
"count");
1435 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1436 throw std::invalid_argument(
"invalid range");
1437 self->erase(self->begin()+
index, self->begin()+
index+count);
1441 throw std::out_of_range(
"count");
1442 return new std::vector< operations_research::SequenceVar* >(count,
value);
1445 std::reverse(self->begin(), self->end());
1449 throw std::out_of_range(
"index");
1451 throw std::out_of_range(
"count");
1452 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1453 throw std::invalid_argument(
"invalid range");
1454 std::reverse(self->begin()+
index, self->begin()+
index+count);
1458 throw std::out_of_range(
"index");
1459 if (
index+values.size() > self->size())
1460 throw std::out_of_range(
"index");
1461 std::copy(values.begin(), values.end(), self->begin()+
index);
1464 return std::find(self->begin(), self->end(),
value) !=
self->end();
1468 std::vector< operations_research::SequenceVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1469 if (it != self->end())
1470 index = (int)(it - self->begin());
1475 std::vector< operations_research::SequenceVar* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1476 if (rit != self->rend())
1477 index = (int)(self->rend() - 1 - rit);
1481 std::vector< operations_research::SequenceVar* >::iterator it = std::find(self->begin(), self->end(),
value);
1482 if (it != self->end()) {
1489 std::vector< operations_research::LocalSearchOperator* >* pv = 0;
1491 pv =
new std::vector< operations_research::LocalSearchOperator* >();
1494 throw std::out_of_range(
"capacity");
1500 return (*
self)[
index];
1502 throw std::out_of_range(
"index");
1506 return (*
self)[
index];
1508 throw std::out_of_range(
"index");
1512 (*self)[
index] = val;
1514 throw std::out_of_range(
"index");
1517 self->insert(self->end(), values.begin(), values.end());
1521 throw std::out_of_range(
"index");
1523 throw std::out_of_range(
"count");
1524 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1525 throw std::invalid_argument(
"invalid range");
1526 return new std::vector< operations_research::LocalSearchOperator* >(self->begin()+
index, self->begin()+
index+count);
1530 self->insert(self->begin()+
index, x);
1532 throw std::out_of_range(
"index");
1536 self->insert(self->begin()+
index, values.begin(), values.end());
1538 throw std::out_of_range(
"index");
1542 self->erase(self->begin() +
index);
1544 throw std::out_of_range(
"index");
1548 throw std::out_of_range(
"index");
1550 throw std::out_of_range(
"count");
1551 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1552 throw std::invalid_argument(
"invalid range");
1553 self->erase(self->begin()+
index, self->begin()+
index+count);
1557 throw std::out_of_range(
"count");
1558 return new std::vector< operations_research::LocalSearchOperator* >(count,
value);
1561 std::reverse(self->begin(), self->end());
1565 throw std::out_of_range(
"index");
1567 throw std::out_of_range(
"count");
1568 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1569 throw std::invalid_argument(
"invalid range");
1570 std::reverse(self->begin()+
index, self->begin()+
index+count);
1574 throw std::out_of_range(
"index");
1575 if (
index+values.size() > self->size())
1576 throw std::out_of_range(
"index");
1577 std::copy(values.begin(), values.end(), self->begin()+
index);
1580 return std::find(self->begin(), self->end(),
value) !=
self->end();
1584 std::vector< operations_research::LocalSearchOperator* >::iterator it = std::find(self->begin(), self->end(),
value);
1585 if (it != self->end())
1586 index = (int)(it - self->begin());
1591 std::vector< operations_research::LocalSearchOperator* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1592 if (rit != self->rend())
1593 index = (int)(self->rend() - 1 - rit);
1597 std::vector< operations_research::LocalSearchOperator* >::iterator it = std::find(self->begin(), self->end(),
value);
1598 if (it != self->end()) {
1605 std::vector< operations_research::LocalSearchFilter* >* pv = 0;
1607 pv =
new std::vector< operations_research::LocalSearchFilter* >();
1610 throw std::out_of_range(
"capacity");
1616 return (*
self)[
index];
1618 throw std::out_of_range(
"index");
1622 return (*
self)[
index];
1624 throw std::out_of_range(
"index");
1628 (*self)[
index] = val;
1630 throw std::out_of_range(
"index");
1633 self->insert(self->end(), values.begin(), values.end());
1637 throw std::out_of_range(
"index");
1639 throw std::out_of_range(
"count");
1640 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1641 throw std::invalid_argument(
"invalid range");
1642 return new std::vector< operations_research::LocalSearchFilter* >(self->begin()+
index, self->begin()+
index+count);
1646 self->insert(self->begin()+
index, x);
1648 throw std::out_of_range(
"index");
1652 self->insert(self->begin()+
index, values.begin(), values.end());
1654 throw std::out_of_range(
"index");
1658 self->erase(self->begin() +
index);
1660 throw std::out_of_range(
"index");
1664 throw std::out_of_range(
"index");
1666 throw std::out_of_range(
"count");
1667 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1668 throw std::invalid_argument(
"invalid range");
1669 self->erase(self->begin()+
index, self->begin()+
index+count);
1673 throw std::out_of_range(
"count");
1674 return new std::vector< operations_research::LocalSearchFilter* >(count,
value);
1677 std::reverse(self->begin(), self->end());
1681 throw std::out_of_range(
"index");
1683 throw std::out_of_range(
"count");
1684 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1685 throw std::invalid_argument(
"invalid range");
1686 std::reverse(self->begin()+
index, self->begin()+
index+count);
1690 throw std::out_of_range(
"index");
1691 if (
index+values.size() > self->size())
1692 throw std::out_of_range(
"index");
1693 std::copy(values.begin(), values.end(), self->begin()+
index);
1696 return std::find(self->begin(), self->end(),
value) !=
self->end();
1700 std::vector< operations_research::LocalSearchFilter* >::iterator it = std::find(self->begin(), self->end(),
value);
1701 if (it != self->end())
1702 index = (int)(it - self->begin());
1707 std::vector< operations_research::LocalSearchFilter* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1708 if (rit != self->rend())
1709 index = (int)(self->rend() - 1 - rit);
1713 std::vector< operations_research::LocalSearchFilter* >::iterator it = std::find(self->begin(), self->end(),
value);
1714 if (it != self->end()) {
1721 std::vector< operations_research::SymmetryBreaker* >* pv = 0;
1723 pv =
new std::vector< operations_research::SymmetryBreaker* >();
1726 throw std::out_of_range(
"capacity");
1732 return (*
self)[
index];
1734 throw std::out_of_range(
"index");
1738 return (*
self)[
index];
1740 throw std::out_of_range(
"index");
1744 (*self)[
index] = val;
1746 throw std::out_of_range(
"index");
1749 self->insert(self->end(), values.begin(), values.end());
1753 throw std::out_of_range(
"index");
1755 throw std::out_of_range(
"count");
1756 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1757 throw std::invalid_argument(
"invalid range");
1758 return new std::vector< operations_research::SymmetryBreaker* >(self->begin()+
index, self->begin()+
index+count);
1762 self->insert(self->begin()+
index, x);
1764 throw std::out_of_range(
"index");
1768 self->insert(self->begin()+
index, values.begin(), values.end());
1770 throw std::out_of_range(
"index");
1774 self->erase(self->begin() +
index);
1776 throw std::out_of_range(
"index");
1780 throw std::out_of_range(
"index");
1782 throw std::out_of_range(
"count");
1783 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1784 throw std::invalid_argument(
"invalid range");
1785 self->erase(self->begin()+
index, self->begin()+
index+count);
1789 throw std::out_of_range(
"count");
1790 return new std::vector< operations_research::SymmetryBreaker* >(count,
value);
1793 std::reverse(self->begin(), self->end());
1797 throw std::out_of_range(
"index");
1799 throw std::out_of_range(
"count");
1800 if (
index >= (
int)self->size()+1 ||
index+count > (
int)self->size())
1801 throw std::invalid_argument(
"invalid range");
1802 std::reverse(self->begin()+
index, self->begin()+
index+count);
1806 throw std::out_of_range(
"index");
1807 if (
index+values.size() > self->size())
1808 throw std::out_of_range(
"index");
1809 std::copy(values.begin(), values.end(), self->begin()+
index);
1812 return std::find(self->begin(), self->end(),
value) !=
self->end();
1816 std::vector< operations_research::SymmetryBreaker* >::iterator it = std::find(self->begin(), self->end(),
value);
1817 if (it != self->end())
1818 index = (int)(it - self->begin());
1823 std::vector< operations_research::SymmetryBreaker* >::reverse_iterator rit = std::find(self->rbegin(), self->rend(),
value);
1824 if (rit != self->rend())
1825 index = (int)(self->rend() - 1 - rit);
1829 std::vector< operations_research::SymmetryBreaker* >::iterator it = std::find(self->begin(), self->end(),
value);
1830 if (it != self->end()) {
1900 return self->MakeDomainIterator(
false);
1903 return self->MakeHoleIterator(
false);
2010 swig_init_callbacks();
2019 std::string c_result ;
2020 char * jresult = 0 ;
2022 if (!swig_callbackToString) {
2025 jresult = (
char *) swig_callbackToString();
2030 c_result.assign(jresult);
2038 if (!swig_callbackApplyWrapper) {
2043 swig_callbackApplyWrapper(js);
2050 if (!swig_callbackRefuteWrapper) {
2055 swig_callbackRefuteWrapper(js);
2060 void * jvisitor = 0 ;
2062 if (!swig_callbackAccept) {
2066 jvisitor = (
void *) visitor;
2067 swig_callbackAccept(jvisitor);
2072 swig_callbackToString = callbackToString;
2073 swig_callbackApplyWrapper = callbackApplyWrapper;
2074 swig_callbackRefuteWrapper = callbackRefuteWrapper;
2075 swig_callbackAccept = callbackAccept;
2078 void SwigDirector_Decision::swig_init_callbacks() {
2079 swig_callbackToString = 0;
2080 swig_callbackApplyWrapper = 0;
2081 swig_callbackRefuteWrapper = 0;
2082 swig_callbackAccept = 0;
2086 swig_init_callbacks();
2095 std::string c_result ;
2096 char * jresult = 0 ;
2098 if (!swig_callbackToString) {
2101 jresult = (
char *) swig_callbackToString();
2106 c_result.assign(jresult);
2113 void * jresult = 0 ;
2116 if (!swig_callbackNextWrapper) {
2121 jresult = (
void *) swig_callbackNextWrapper(js);
2128 swig_callbackToString = callbackToString;
2129 swig_callbackNextWrapper = callbackNextWrapper;
2132 void SwigDirector_DecisionBuilder::swig_init_callbacks() {
2133 swig_callbackToString = 0;
2134 swig_callbackNextWrapper = 0;
2138 swig_init_callbacks();
2147 std::string c_result ;
2148 char * jresult = 0 ;
2150 if (!swig_callbackToString) {
2153 jresult = (
char *) swig_callbackToString();
2158 c_result.assign(jresult);
2166 if (!swig_callbackRunWrapper) {
2171 swig_callbackRunWrapper(js);
2179 if (!swig_callbackPriority) {
2182 jresult = (int) swig_callbackPriority();
2189 swig_callbackToString = callbackToString;
2190 swig_callbackRunWrapper = callbackRunWrapper;
2191 swig_callbackPriority = callbackPriority;
2194 void SwigDirector_Demon::swig_init_callbacks() {
2195 swig_callbackToString = 0;
2196 swig_callbackRunWrapper = 0;
2197 swig_callbackPriority = 0;
2201 swig_init_callbacks();
2210 std::string c_result ;
2211 char * jresult = 0 ;
2213 if (!swig_callbackToString) {
2216 jresult = (
char *) swig_callbackToString();
2221 c_result.assign(jresult);
2227 std::string c_result ;
2228 char * jresult = 0 ;
2230 if (!swig_callbackName) {
2233 jresult = (
char *) swig_callbackName();
2238 c_result.assign(jresult);
2244 std::string c_result ;
2245 char * jresult = 0 ;
2247 if (!swig_callbackBaseName) {
2250 jresult = (
char *) swig_callbackBaseName();
2255 c_result.assign(jresult);
2261 if (!swig_callbackPost) {
2265 swig_callbackPost();
2270 if (!swig_callbackInitialPropagateWrapper) {
2274 swig_callbackInitialPropagateWrapper();
2279 swig_callbackToString = callbackToString;
2280 swig_callbackName = callbackName;
2281 swig_callbackBaseName = callbackBaseName;
2282 swig_callbackPost = callbackPost;
2283 swig_callbackInitialPropagateWrapper = callbackInitialPropagateWrapper;
2286 void SwigDirector_Constraint::swig_init_callbacks() {
2287 swig_callbackToString = 0;
2288 swig_callbackName = 0;
2289 swig_callbackBaseName = 0;
2290 swig_callbackPost = 0;
2291 swig_callbackInitialPropagateWrapper = 0;
2295 swig_init_callbacks();
2304 std::string c_result ;
2305 char * jresult = 0 ;
2307 if (!swig_callbackToString) {
2310 jresult = (
char *) swig_callbackToString();
2315 c_result.assign(jresult);
2321 if (!swig_callbackEnterSearch) {
2325 swig_callbackEnterSearch();
2330 if (!swig_callbackRestartSearch) {
2334 swig_callbackRestartSearch();
2339 if (!swig_callbackExitSearch) {
2343 swig_callbackExitSearch();
2350 if (!swig_callbackBeginNextDecision) {
2355 swig_callbackBeginNextDecision(jb);
2363 if (!swig_callbackEndNextDecision) {
2369 swig_callbackEndNextDecision(jb, jd);
2376 if (!swig_callbackApplyDecision) {
2381 swig_callbackApplyDecision(jd);
2388 if (!swig_callbackRefuteDecision) {
2393 swig_callbackRefuteDecision(jd);
2399 unsigned int japply ;
2401 if (!swig_callbackAfterDecision) {
2407 swig_callbackAfterDecision(jd, japply);
2412 if (!swig_callbackBeginFail) {
2416 swig_callbackBeginFail();
2421 if (!swig_callbackEndFail) {
2425 swig_callbackEndFail();
2430 if (!swig_callbackBeginInitialPropagation) {
2434 swig_callbackBeginInitialPropagation();
2439 if (!swig_callbackEndInitialPropagation) {
2443 swig_callbackEndInitialPropagation();
2448 bool c_result = SwigValueInit< bool >() ;
2449 unsigned int jresult = 0 ;
2451 if (!swig_callbackAcceptSolution) {
2454 jresult = (
unsigned int) swig_callbackAcceptSolution();
2455 c_result = jresult ? true :
false;
2461 bool c_result = SwigValueInit< bool >() ;
2462 unsigned int jresult = 0 ;
2464 if (!swig_callbackAtSolution) {
2467 jresult = (
unsigned int) swig_callbackAtSolution();
2468 c_result = jresult ? true :
false;
2474 if (!swig_callbackNoMoreSolutions) {
2478 swig_callbackNoMoreSolutions();
2483 bool c_result = SwigValueInit< bool >() ;
2484 unsigned int jresult = 0 ;
2486 if (!swig_callbackLocalOptimum) {
2489 jresult = (
unsigned int) swig_callbackLocalOptimum();
2490 c_result = jresult ? true :
false;
2496 bool c_result = SwigValueInit< bool >() ;
2497 unsigned int jresult = 0 ;
2499 void * jdeltadelta = 0 ;
2501 if (!swig_callbackAcceptDelta) {
2504 jdelta = (
void *)
delta;
2505 jdeltadelta = (
void *) deltadelta;
2506 jresult = (
unsigned int) swig_callbackAcceptDelta(jdelta, jdeltadelta);
2507 c_result = jresult ? true :
false;
2513 if (!swig_callbackAcceptNeighbor) {
2517 swig_callbackAcceptNeighbor();
2522 if (!swig_callbackAcceptUncheckedNeighbor) {
2526 swig_callbackAcceptUncheckedNeighbor();
2531 bool c_result = SwigValueInit< bool >() ;
2532 unsigned int jresult = 0 ;
2534 if (!swig_callbackIsUncheckedSolutionLimitReached) {
2537 jresult = (
unsigned int) swig_callbackIsUncheckedSolutionLimitReached();
2538 c_result = jresult ? true :
false;
2544 if (!swig_callbackPeriodicCheck) {
2548 swig_callbackPeriodicCheck();
2553 int c_result = SwigValueInit< int >() ;
2556 if (!swig_callbackProgressPercent) {
2559 jresult = (int) swig_callbackProgressPercent();
2560 c_result = (int)jresult;
2566 void * jvisitor = 0 ;
2568 if (!swig_callbackAccept) {
2572 jvisitor = (
void *) visitor;
2573 swig_callbackAccept(jvisitor);
2578 if (!swig_callbackInstall) {
2582 swig_callbackInstall();
2586 void SwigDirector_SearchMonitor::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall) {
2587 swig_callbackToString = callbackToString;
2588 swig_callbackEnterSearch = callbackEnterSearch;
2589 swig_callbackRestartSearch = callbackRestartSearch;
2590 swig_callbackExitSearch = callbackExitSearch;
2591 swig_callbackBeginNextDecision = callbackBeginNextDecision;
2592 swig_callbackEndNextDecision = callbackEndNextDecision;
2593 swig_callbackApplyDecision = callbackApplyDecision;
2594 swig_callbackRefuteDecision = callbackRefuteDecision;
2595 swig_callbackAfterDecision = callbackAfterDecision;
2596 swig_callbackBeginFail = callbackBeginFail;
2597 swig_callbackEndFail = callbackEndFail;
2598 swig_callbackBeginInitialPropagation = callbackBeginInitialPropagation;
2599 swig_callbackEndInitialPropagation = callbackEndInitialPropagation;
2600 swig_callbackAcceptSolution = callbackAcceptSolution;
2601 swig_callbackAtSolution = callbackAtSolution;
2602 swig_callbackNoMoreSolutions = callbackNoMoreSolutions;
2603 swig_callbackLocalOptimum = callbackLocalOptimum;
2604 swig_callbackAcceptDelta = callbackAcceptDelta;
2605 swig_callbackAcceptNeighbor = callbackAcceptNeighbor;
2606 swig_callbackAcceptUncheckedNeighbor = callbackAcceptUncheckedNeighbor;
2607 swig_callbackIsUncheckedSolutionLimitReached = callbackIsUncheckedSolutionLimitReached;
2608 swig_callbackPeriodicCheck = callbackPeriodicCheck;
2609 swig_callbackProgressPercent = callbackProgressPercent;
2610 swig_callbackAccept = callbackAccept;
2611 swig_callbackInstall = callbackInstall;
2614 void SwigDirector_SearchMonitor::swig_init_callbacks() {
2615 swig_callbackToString = 0;
2616 swig_callbackEnterSearch = 0;
2617 swig_callbackRestartSearch = 0;
2618 swig_callbackExitSearch = 0;
2619 swig_callbackBeginNextDecision = 0;
2620 swig_callbackEndNextDecision = 0;
2621 swig_callbackApplyDecision = 0;
2622 swig_callbackRefuteDecision = 0;
2623 swig_callbackAfterDecision = 0;
2624 swig_callbackBeginFail = 0;
2625 swig_callbackEndFail = 0;
2626 swig_callbackBeginInitialPropagation = 0;
2627 swig_callbackEndInitialPropagation = 0;
2628 swig_callbackAcceptSolution = 0;
2629 swig_callbackAtSolution = 0;
2630 swig_callbackNoMoreSolutions = 0;
2631 swig_callbackLocalOptimum = 0;
2632 swig_callbackAcceptDelta = 0;
2633 swig_callbackAcceptNeighbor = 0;
2634 swig_callbackAcceptUncheckedNeighbor = 0;
2635 swig_callbackIsUncheckedSolutionLimitReached = 0;
2636 swig_callbackPeriodicCheck = 0;
2637 swig_callbackProgressPercent = 0;
2638 swig_callbackAccept = 0;
2639 swig_callbackInstall = 0;
2643 swig_init_callbacks();
2647 swig_init_callbacks();
2656 std::string c_result ;
2657 char * jresult = 0 ;
2659 if (!swig_callbackToString) {
2662 jresult = (
char *) swig_callbackToString();
2667 c_result.assign(jresult);
2673 if (!swig_callbackEnterSearch) {
2677 swig_callbackEnterSearch();
2682 if (!swig_callbackRestartSearch) {
2686 swig_callbackRestartSearch();
2691 if (!swig_callbackExitSearch) {
2695 swig_callbackExitSearch();
2702 if (!swig_callbackBeginNextDecision) {
2707 swig_callbackBeginNextDecision(jb);
2715 if (!swig_callbackEndNextDecision) {
2721 swig_callbackEndNextDecision(jb, jd);
2728 if (!swig_callbackApplyDecision) {
2733 swig_callbackApplyDecision(jd);
2740 if (!swig_callbackRefuteDecision) {
2745 swig_callbackRefuteDecision(jd);
2751 unsigned int japply ;
2753 if (!swig_callbackAfterDecision) {
2759 swig_callbackAfterDecision(jd, japply);
2764 if (!swig_callbackBeginFail) {
2768 swig_callbackBeginFail();
2773 if (!swig_callbackEndFail) {
2777 swig_callbackEndFail();
2782 if (!swig_callbackBeginInitialPropagation) {
2786 swig_callbackBeginInitialPropagation();
2791 if (!swig_callbackEndInitialPropagation) {
2795 swig_callbackEndInitialPropagation();
2800 bool c_result = SwigValueInit< bool >() ;
2801 unsigned int jresult = 0 ;
2803 if (!swig_callbackAcceptSolution) {
2806 jresult = (
unsigned int) swig_callbackAcceptSolution();
2807 c_result = jresult ? true :
false;
2813 bool c_result = SwigValueInit< bool >() ;
2814 unsigned int jresult = 0 ;
2816 if (!swig_callbackAtSolution) {
2819 jresult = (
unsigned int) swig_callbackAtSolution();
2820 c_result = jresult ? true :
false;
2826 if (!swig_callbackNoMoreSolutions) {
2830 swig_callbackNoMoreSolutions();
2835 bool c_result = SwigValueInit< bool >() ;
2836 unsigned int jresult = 0 ;
2838 if (!swig_callbackLocalOptimum) {
2841 jresult = (
unsigned int) swig_callbackLocalOptimum();
2842 c_result = jresult ? true :
false;
2848 bool c_result = SwigValueInit< bool >() ;
2849 unsigned int jresult = 0 ;
2851 void * jdeltadelta = 0 ;
2853 if (!swig_callbackAcceptDelta) {
2856 jdelta = (
void *)
delta;
2857 jdeltadelta = (
void *) deltadelta;
2858 jresult = (
unsigned int) swig_callbackAcceptDelta(jdelta, jdeltadelta);
2859 c_result = jresult ? true :
false;
2865 if (!swig_callbackAcceptNeighbor) {
2869 swig_callbackAcceptNeighbor();
2874 if (!swig_callbackAcceptUncheckedNeighbor) {
2878 swig_callbackAcceptUncheckedNeighbor();
2883 bool c_result = SwigValueInit< bool >() ;
2884 unsigned int jresult = 0 ;
2886 if (!swig_callbackIsUncheckedSolutionLimitReached) {
2889 jresult = (
unsigned int) swig_callbackIsUncheckedSolutionLimitReached();
2890 c_result = jresult ? true :
false;
2896 if (!swig_callbackPeriodicCheck) {
2900 swig_callbackPeriodicCheck();
2905 int c_result = SwigValueInit< int >() ;
2908 if (!swig_callbackProgressPercent) {
2911 jresult = (int) swig_callbackProgressPercent();
2912 c_result = (int)jresult;
2918 void * jvisitor = 0 ;
2920 if (!swig_callbackAccept) {
2924 jvisitor = (
void *) visitor;
2925 swig_callbackAccept(jvisitor);
2930 if (!swig_callbackInstall) {
2934 swig_callbackInstall();
2938 void SwigDirector_SolutionCollector::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall) {
2939 swig_callbackToString = callbackToString;
2940 swig_callbackEnterSearch = callbackEnterSearch;
2941 swig_callbackRestartSearch = callbackRestartSearch;
2942 swig_callbackExitSearch = callbackExitSearch;
2943 swig_callbackBeginNextDecision = callbackBeginNextDecision;
2944 swig_callbackEndNextDecision = callbackEndNextDecision;
2945 swig_callbackApplyDecision = callbackApplyDecision;
2946 swig_callbackRefuteDecision = callbackRefuteDecision;
2947 swig_callbackAfterDecision = callbackAfterDecision;
2948 swig_callbackBeginFail = callbackBeginFail;
2949 swig_callbackEndFail = callbackEndFail;
2950 swig_callbackBeginInitialPropagation = callbackBeginInitialPropagation;
2951 swig_callbackEndInitialPropagation = callbackEndInitialPropagation;
2952 swig_callbackAcceptSolution = callbackAcceptSolution;
2953 swig_callbackAtSolution = callbackAtSolution;
2954 swig_callbackNoMoreSolutions = callbackNoMoreSolutions;
2955 swig_callbackLocalOptimum = callbackLocalOptimum;
2956 swig_callbackAcceptDelta = callbackAcceptDelta;
2957 swig_callbackAcceptNeighbor = callbackAcceptNeighbor;
2958 swig_callbackAcceptUncheckedNeighbor = callbackAcceptUncheckedNeighbor;
2959 swig_callbackIsUncheckedSolutionLimitReached = callbackIsUncheckedSolutionLimitReached;
2960 swig_callbackPeriodicCheck = callbackPeriodicCheck;
2961 swig_callbackProgressPercent = callbackProgressPercent;
2962 swig_callbackAccept = callbackAccept;
2963 swig_callbackInstall = callbackInstall;
2966 void SwigDirector_SolutionCollector::swig_init_callbacks() {
2967 swig_callbackToString = 0;
2968 swig_callbackEnterSearch = 0;
2969 swig_callbackRestartSearch = 0;
2970 swig_callbackExitSearch = 0;
2971 swig_callbackBeginNextDecision = 0;
2972 swig_callbackEndNextDecision = 0;
2973 swig_callbackApplyDecision = 0;
2974 swig_callbackRefuteDecision = 0;
2975 swig_callbackAfterDecision = 0;
2976 swig_callbackBeginFail = 0;
2977 swig_callbackEndFail = 0;
2978 swig_callbackBeginInitialPropagation = 0;
2979 swig_callbackEndInitialPropagation = 0;
2980 swig_callbackAcceptSolution = 0;
2981 swig_callbackAtSolution = 0;
2982 swig_callbackNoMoreSolutions = 0;
2983 swig_callbackLocalOptimum = 0;
2984 swig_callbackAcceptDelta = 0;
2985 swig_callbackAcceptNeighbor = 0;
2986 swig_callbackAcceptUncheckedNeighbor = 0;
2987 swig_callbackIsUncheckedSolutionLimitReached = 0;
2988 swig_callbackPeriodicCheck = 0;
2989 swig_callbackProgressPercent = 0;
2990 swig_callbackAccept = 0;
2991 swig_callbackInstall = 0;
2995 swig_init_callbacks();
3004 std::string c_result ;
3005 char * jresult = 0 ;
3007 if (!swig_callbackToString) {
3010 jresult = (
char *) swig_callbackToString();
3015 c_result.assign(jresult);
3021 if (!swig_callbackEnterSearch) {
3025 swig_callbackEnterSearch();
3030 if (!swig_callbackRestartSearch) {
3034 swig_callbackRestartSearch();
3039 if (!swig_callbackExitSearch) {
3043 swig_callbackExitSearch();
3050 if (!swig_callbackBeginNextDecision) {
3055 swig_callbackBeginNextDecision(jdb);
3063 if (!swig_callbackEndNextDecision) {
3069 swig_callbackEndNextDecision(jb, jd);
3076 if (!swig_callbackApplyDecision) {
3081 swig_callbackApplyDecision(jd);
3088 if (!swig_callbackRefuteDecision) {
3093 swig_callbackRefuteDecision(jd);
3099 unsigned int japply ;
3101 if (!swig_callbackAfterDecision) {
3107 swig_callbackAfterDecision(jd, japply);
3112 if (!swig_callbackBeginFail) {
3116 swig_callbackBeginFail();
3121 if (!swig_callbackEndFail) {
3125 swig_callbackEndFail();
3130 if (!swig_callbackBeginInitialPropagation) {
3134 swig_callbackBeginInitialPropagation();
3139 if (!swig_callbackEndInitialPropagation) {
3143 swig_callbackEndInitialPropagation();
3148 bool c_result = SwigValueInit< bool >() ;
3149 unsigned int jresult = 0 ;
3151 if (!swig_callbackAcceptSolution) {
3154 jresult = (
unsigned int) swig_callbackAcceptSolution();
3155 c_result = jresult ? true :
false;
3161 bool c_result = SwigValueInit< bool >() ;
3162 unsigned int jresult = 0 ;
3164 if (!swig_callbackAtSolution) {
3167 jresult = (
unsigned int) swig_callbackAtSolution();
3168 c_result = jresult ? true :
false;
3174 if (!swig_callbackNoMoreSolutions) {
3178 swig_callbackNoMoreSolutions();
3183 bool c_result = SwigValueInit< bool >() ;
3184 unsigned int jresult = 0 ;
3186 if (!swig_callbackLocalOptimum) {
3189 jresult = (
unsigned int) swig_callbackLocalOptimum();
3190 c_result = jresult ? true :
false;
3196 bool c_result = SwigValueInit< bool >() ;
3197 unsigned int jresult = 0 ;
3199 void * jdeltadelta = 0 ;
3201 if (!swig_callbackAcceptDelta) {
3204 jdelta = (
void *)
delta;
3205 jdeltadelta = (
void *) deltadelta;
3206 jresult = (
unsigned int) swig_callbackAcceptDelta(jdelta, jdeltadelta);
3207 c_result = jresult ? true :
false;
3213 if (!swig_callbackAcceptNeighbor) {
3217 swig_callbackAcceptNeighbor();
3222 if (!swig_callbackAcceptUncheckedNeighbor) {
3226 swig_callbackAcceptUncheckedNeighbor();
3231 bool c_result = SwigValueInit< bool >() ;
3232 unsigned int jresult = 0 ;
3234 if (!swig_callbackIsUncheckedSolutionLimitReached) {
3237 jresult = (
unsigned int) swig_callbackIsUncheckedSolutionLimitReached();
3238 c_result = jresult ? true :
false;
3244 if (!swig_callbackPeriodicCheck) {
3248 swig_callbackPeriodicCheck();
3253 int c_result = SwigValueInit< int >() ;
3256 if (!swig_callbackProgressPercent) {
3259 jresult = (int) swig_callbackProgressPercent();
3260 c_result = (int)jresult;
3266 void * jvisitor = 0 ;
3268 if (!swig_callbackAccept) {
3272 jvisitor = (
void *) visitor;
3273 swig_callbackAccept(jvisitor);
3278 if (!swig_callbackInstall) {
3282 swig_callbackInstall();
3287 std::string c_result ;
3288 char * jresult = 0 ;
3290 if (!swig_callbackPrint) {
3293 jresult = (
char *) swig_callbackPrint();
3298 c_result.assign(jresult);
3303 void SwigDirector_OptimizeVar::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackPrint) {
3304 swig_callbackToString = callbackToString;
3305 swig_callbackEnterSearch = callbackEnterSearch;
3306 swig_callbackRestartSearch = callbackRestartSearch;
3307 swig_callbackExitSearch = callbackExitSearch;
3308 swig_callbackBeginNextDecision = callbackBeginNextDecision;
3309 swig_callbackEndNextDecision = callbackEndNextDecision;
3310 swig_callbackApplyDecision = callbackApplyDecision;
3311 swig_callbackRefuteDecision = callbackRefuteDecision;
3312 swig_callbackAfterDecision = callbackAfterDecision;
3313 swig_callbackBeginFail = callbackBeginFail;
3314 swig_callbackEndFail = callbackEndFail;
3315 swig_callbackBeginInitialPropagation = callbackBeginInitialPropagation;
3316 swig_callbackEndInitialPropagation = callbackEndInitialPropagation;
3317 swig_callbackAcceptSolution = callbackAcceptSolution;
3318 swig_callbackAtSolution = callbackAtSolution;
3319 swig_callbackNoMoreSolutions = callbackNoMoreSolutions;
3320 swig_callbackLocalOptimum = callbackLocalOptimum;
3321 swig_callbackAcceptDelta = callbackAcceptDelta;
3322 swig_callbackAcceptNeighbor = callbackAcceptNeighbor;
3323 swig_callbackAcceptUncheckedNeighbor = callbackAcceptUncheckedNeighbor;
3324 swig_callbackIsUncheckedSolutionLimitReached = callbackIsUncheckedSolutionLimitReached;
3325 swig_callbackPeriodicCheck = callbackPeriodicCheck;
3326 swig_callbackProgressPercent = callbackProgressPercent;
3327 swig_callbackAccept = callbackAccept;
3328 swig_callbackInstall = callbackInstall;
3329 swig_callbackPrint = callbackPrint;
3332 void SwigDirector_OptimizeVar::swig_init_callbacks() {
3333 swig_callbackToString = 0;
3334 swig_callbackEnterSearch = 0;
3335 swig_callbackRestartSearch = 0;
3336 swig_callbackExitSearch = 0;
3337 swig_callbackBeginNextDecision = 0;
3338 swig_callbackEndNextDecision = 0;
3339 swig_callbackApplyDecision = 0;
3340 swig_callbackRefuteDecision = 0;
3341 swig_callbackAfterDecision = 0;
3342 swig_callbackBeginFail = 0;
3343 swig_callbackEndFail = 0;
3344 swig_callbackBeginInitialPropagation = 0;
3345 swig_callbackEndInitialPropagation = 0;
3346 swig_callbackAcceptSolution = 0;
3347 swig_callbackAtSolution = 0;
3348 swig_callbackNoMoreSolutions = 0;
3349 swig_callbackLocalOptimum = 0;
3350 swig_callbackAcceptDelta = 0;
3351 swig_callbackAcceptNeighbor = 0;
3352 swig_callbackAcceptUncheckedNeighbor = 0;
3353 swig_callbackIsUncheckedSolutionLimitReached = 0;
3354 swig_callbackPeriodicCheck = 0;
3355 swig_callbackProgressPercent = 0;
3356 swig_callbackAccept = 0;
3357 swig_callbackInstall = 0;
3358 swig_callbackPrint = 0;
3362 swig_init_callbacks();
3371 std::string c_result ;
3372 char * jresult = 0 ;
3374 if (!swig_callbackToString) {
3377 jresult = (
char *) swig_callbackToString();
3382 c_result.assign(jresult);
3388 if (!swig_callbackEnterSearch) {
3392 swig_callbackEnterSearch();
3397 if (!swig_callbackRestartSearch) {
3401 swig_callbackRestartSearch();
3406 if (!swig_callbackExitSearch) {
3410 swig_callbackExitSearch();
3417 if (!swig_callbackBeginNextDecision) {
3422 swig_callbackBeginNextDecision(jb);
3430 if (!swig_callbackEndNextDecision) {
3436 swig_callbackEndNextDecision(jb, jd);
3443 if (!swig_callbackApplyDecision) {
3448 swig_callbackApplyDecision(jd);
3455 if (!swig_callbackRefuteDecision) {
3460 swig_callbackRefuteDecision(jd);
3466 unsigned int japply ;
3468 if (!swig_callbackAfterDecision) {
3474 swig_callbackAfterDecision(jd, japply);
3479 if (!swig_callbackBeginFail) {
3483 swig_callbackBeginFail();
3488 if (!swig_callbackEndFail) {
3492 swig_callbackEndFail();
3497 if (!swig_callbackBeginInitialPropagation) {
3501 swig_callbackBeginInitialPropagation();
3506 if (!swig_callbackEndInitialPropagation) {
3510 swig_callbackEndInitialPropagation();
3515 bool c_result = SwigValueInit< bool >() ;
3516 unsigned int jresult = 0 ;
3518 if (!swig_callbackAcceptSolution) {
3521 jresult = (
unsigned int) swig_callbackAcceptSolution();
3522 c_result = jresult ? true :
false;
3528 bool c_result = SwigValueInit< bool >() ;
3529 unsigned int jresult = 0 ;
3531 if (!swig_callbackAtSolution) {
3534 jresult = (
unsigned int) swig_callbackAtSolution();
3535 c_result = jresult ? true :
false;
3541 if (!swig_callbackNoMoreSolutions) {
3545 swig_callbackNoMoreSolutions();
3550 bool c_result = SwigValueInit< bool >() ;
3551 unsigned int jresult = 0 ;
3553 if (!swig_callbackLocalOptimum) {
3556 jresult = (
unsigned int) swig_callbackLocalOptimum();
3557 c_result = jresult ? true :
false;
3563 bool c_result = SwigValueInit< bool >() ;
3564 unsigned int jresult = 0 ;
3566 void * jdeltadelta = 0 ;
3568 if (!swig_callbackAcceptDelta) {
3571 jdelta = (
void *)
delta;
3572 jdeltadelta = (
void *) deltadelta;
3573 jresult = (
unsigned int) swig_callbackAcceptDelta(jdelta, jdeltadelta);
3574 c_result = jresult ? true :
false;
3580 if (!swig_callbackAcceptNeighbor) {
3584 swig_callbackAcceptNeighbor();
3589 if (!swig_callbackAcceptUncheckedNeighbor) {
3593 swig_callbackAcceptUncheckedNeighbor();
3598 bool c_result = SwigValueInit< bool >() ;
3599 unsigned int jresult = 0 ;
3601 if (!swig_callbackIsUncheckedSolutionLimitReached) {
3604 jresult = (
unsigned int) swig_callbackIsUncheckedSolutionLimitReached();
3605 c_result = jresult ? true :
false;
3611 if (!swig_callbackPeriodicCheck) {
3615 swig_callbackPeriodicCheck();
3620 int c_result = SwigValueInit< int >() ;
3623 if (!swig_callbackProgressPercent) {
3626 jresult = (int) swig_callbackProgressPercent();
3627 c_result = (int)jresult;
3633 void * jvisitor = 0 ;
3635 if (!swig_callbackAccept) {
3639 jvisitor = (
void *) visitor;
3640 swig_callbackAccept(jvisitor);
3645 if (!swig_callbackInstall) {
3649 swig_callbackInstall();
3654 bool c_result = SwigValueInit< bool >() ;
3655 unsigned int jresult = 0 ;
3657 if (!swig_callbackCheck) {
3661 jresult = (
unsigned int) swig_callbackCheck();
3662 c_result = jresult ? true :
false;
3668 if (!swig_callbackInit) {
3672 swig_callbackInit();
3679 if (!swig_callbackCopy) {
3683 jlimit = (
void *) limit;
3684 swig_callbackCopy(jlimit);
3690 void * jresult = 0 ;
3692 if (!swig_callbackMakeClone) {
3696 jresult = (
void *) swig_callbackMakeClone();
3702 void SwigDirector_SearchLimit::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone) {
3703 swig_callbackToString = callbackToString;
3704 swig_callbackEnterSearch = callbackEnterSearch;
3705 swig_callbackRestartSearch = callbackRestartSearch;
3706 swig_callbackExitSearch = callbackExitSearch;
3707 swig_callbackBeginNextDecision = callbackBeginNextDecision;
3708 swig_callbackEndNextDecision = callbackEndNextDecision;
3709 swig_callbackApplyDecision = callbackApplyDecision;
3710 swig_callbackRefuteDecision = callbackRefuteDecision;
3711 swig_callbackAfterDecision = callbackAfterDecision;
3712 swig_callbackBeginFail = callbackBeginFail;
3713 swig_callbackEndFail = callbackEndFail;
3714 swig_callbackBeginInitialPropagation = callbackBeginInitialPropagation;
3715 swig_callbackEndInitialPropagation = callbackEndInitialPropagation;
3716 swig_callbackAcceptSolution = callbackAcceptSolution;
3717 swig_callbackAtSolution = callbackAtSolution;
3718 swig_callbackNoMoreSolutions = callbackNoMoreSolutions;
3719 swig_callbackLocalOptimum = callbackLocalOptimum;
3720 swig_callbackAcceptDelta = callbackAcceptDelta;
3721 swig_callbackAcceptNeighbor = callbackAcceptNeighbor;
3722 swig_callbackAcceptUncheckedNeighbor = callbackAcceptUncheckedNeighbor;
3723 swig_callbackIsUncheckedSolutionLimitReached = callbackIsUncheckedSolutionLimitReached;
3724 swig_callbackPeriodicCheck = callbackPeriodicCheck;
3725 swig_callbackProgressPercent = callbackProgressPercent;
3726 swig_callbackAccept = callbackAccept;
3727 swig_callbackInstall = callbackInstall;
3728 swig_callbackCheck = callbackCheck;
3729 swig_callbackInit = callbackInit;
3730 swig_callbackCopy = callbackCopy;
3731 swig_callbackMakeClone = callbackMakeClone;
3734 void SwigDirector_SearchLimit::swig_init_callbacks() {
3735 swig_callbackToString = 0;
3736 swig_callbackEnterSearch = 0;
3737 swig_callbackRestartSearch = 0;
3738 swig_callbackExitSearch = 0;
3739 swig_callbackBeginNextDecision = 0;
3740 swig_callbackEndNextDecision = 0;
3741 swig_callbackApplyDecision = 0;
3742 swig_callbackRefuteDecision = 0;
3743 swig_callbackAfterDecision = 0;
3744 swig_callbackBeginFail = 0;
3745 swig_callbackEndFail = 0;
3746 swig_callbackBeginInitialPropagation = 0;
3747 swig_callbackEndInitialPropagation = 0;
3748 swig_callbackAcceptSolution = 0;
3749 swig_callbackAtSolution = 0;
3750 swig_callbackNoMoreSolutions = 0;
3751 swig_callbackLocalOptimum = 0;
3752 swig_callbackAcceptDelta = 0;
3753 swig_callbackAcceptNeighbor = 0;
3754 swig_callbackAcceptUncheckedNeighbor = 0;
3755 swig_callbackIsUncheckedSolutionLimitReached = 0;
3756 swig_callbackPeriodicCheck = 0;
3757 swig_callbackProgressPercent = 0;
3758 swig_callbackAccept = 0;
3759 swig_callbackInstall = 0;
3760 swig_callbackCheck = 0;
3761 swig_callbackInit = 0;
3762 swig_callbackCopy = 0;
3763 swig_callbackMakeClone = 0;
3766 SwigDirector_RegularLimit::SwigDirector_RegularLimit(
operations_research::Solver *
const s, absl::Duration
time,
int64 branches,
int64 failures,
int64 solutions,
bool smart_time_check,
bool cumulative) :
operations_research::RegularLimit(s,
time, branches, failures, solutions, smart_time_check, cumulative),
Swig::Director() {
3767 swig_init_callbacks();
3776 std::string c_result ;
3777 char * jresult = 0 ;
3779 if (!swig_callbackToString) {
3782 jresult = (
char *) swig_callbackToString();
3787 c_result.assign(jresult);
3793 if (!swig_callbackEnterSearch) {
3797 swig_callbackEnterSearch();
3802 if (!swig_callbackRestartSearch) {
3806 swig_callbackRestartSearch();
3811 if (!swig_callbackExitSearch) {
3815 swig_callbackExitSearch();
3822 if (!swig_callbackBeginNextDecision) {
3827 swig_callbackBeginNextDecision(jb);
3835 if (!swig_callbackEndNextDecision) {
3841 swig_callbackEndNextDecision(jb, jd);
3848 if (!swig_callbackApplyDecision) {
3853 swig_callbackApplyDecision(jd);
3860 if (!swig_callbackRefuteDecision) {
3865 swig_callbackRefuteDecision(jd);
3871 unsigned int japply ;
3873 if (!swig_callbackAfterDecision) {
3879 swig_callbackAfterDecision(jd, japply);
3884 if (!swig_callbackBeginFail) {
3888 swig_callbackBeginFail();
3893 if (!swig_callbackEndFail) {
3897 swig_callbackEndFail();
3902 if (!swig_callbackBeginInitialPropagation) {
3906 swig_callbackBeginInitialPropagation();
3911 if (!swig_callbackEndInitialPropagation) {
3915 swig_callbackEndInitialPropagation();
3920 bool c_result = SwigValueInit< bool >() ;
3921 unsigned int jresult = 0 ;
3923 if (!swig_callbackAcceptSolution) {
3926 jresult = (
unsigned int) swig_callbackAcceptSolution();
3927 c_result = jresult ? true :
false;
3933 bool c_result = SwigValueInit< bool >() ;
3934 unsigned int jresult = 0 ;
3936 if (!swig_callbackAtSolution) {
3939 jresult = (
unsigned int) swig_callbackAtSolution();
3940 c_result = jresult ? true :
false;
3946 if (!swig_callbackNoMoreSolutions) {
3950 swig_callbackNoMoreSolutions();
3955 bool c_result = SwigValueInit< bool >() ;
3956 unsigned int jresult = 0 ;
3958 if (!swig_callbackLocalOptimum) {
3961 jresult = (
unsigned int) swig_callbackLocalOptimum();
3962 c_result = jresult ? true :
false;
3968 bool c_result = SwigValueInit< bool >() ;
3969 unsigned int jresult = 0 ;
3971 void * jdeltadelta = 0 ;
3973 if (!swig_callbackAcceptDelta) {
3976 jdelta = (
void *)
delta;
3977 jdeltadelta = (
void *) deltadelta;
3978 jresult = (
unsigned int) swig_callbackAcceptDelta(jdelta, jdeltadelta);
3979 c_result = jresult ? true :
false;
3985 if (!swig_callbackAcceptNeighbor) {
3989 swig_callbackAcceptNeighbor();
3994 if (!swig_callbackAcceptUncheckedNeighbor) {
3998 swig_callbackAcceptUncheckedNeighbor();
4003 bool c_result = SwigValueInit< bool >() ;
4004 unsigned int jresult = 0 ;
4006 if (!swig_callbackIsUncheckedSolutionLimitReached) {
4009 jresult = (
unsigned int) swig_callbackIsUncheckedSolutionLimitReached();
4010 c_result = jresult ? true :
false;
4016 if (!swig_callbackPeriodicCheck) {
4020 swig_callbackPeriodicCheck();
4025 int c_result = SwigValueInit< int >() ;
4028 if (!swig_callbackProgressPercent) {
4031 jresult = (int) swig_callbackProgressPercent();
4032 c_result = (int)jresult;
4038 void * jvisitor = 0 ;
4040 if (!swig_callbackAccept) {
4044 jvisitor = (
void *) visitor;
4045 swig_callbackAccept(jvisitor);
4050 if (!swig_callbackInstall) {
4054 swig_callbackInstall();
4059 bool c_result = SwigValueInit< bool >() ;
4060 unsigned int jresult = 0 ;
4062 if (!swig_callbackCheck) {
4065 jresult = (
unsigned int) swig_callbackCheck();
4066 c_result = jresult ? true :
false;
4072 if (!swig_callbackInit) {
4076 swig_callbackInit();
4083 if (!swig_callbackCopy) {
4087 jlimit = (
void *) limit;
4088 swig_callbackCopy(jlimit);
4094 void * jresult = 0 ;
4096 if (!swig_callbackMakeClone) {
4099 jresult = (
void *) swig_callbackMakeClone();
4105 void SwigDirector_RegularLimit::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone) {
4106 swig_callbackToString = callbackToString;
4107 swig_callbackEnterSearch = callbackEnterSearch;
4108 swig_callbackRestartSearch = callbackRestartSearch;
4109 swig_callbackExitSearch = callbackExitSearch;
4110 swig_callbackBeginNextDecision = callbackBeginNextDecision;
4111 swig_callbackEndNextDecision = callbackEndNextDecision;
4112 swig_callbackApplyDecision = callbackApplyDecision;
4113 swig_callbackRefuteDecision = callbackRefuteDecision;
4114 swig_callbackAfterDecision = callbackAfterDecision;
4115 swig_callbackBeginFail = callbackBeginFail;
4116 swig_callbackEndFail = callbackEndFail;
4117 swig_callbackBeginInitialPropagation = callbackBeginInitialPropagation;
4118 swig_callbackEndInitialPropagation = callbackEndInitialPropagation;
4119 swig_callbackAcceptSolution = callbackAcceptSolution;
4120 swig_callbackAtSolution = callbackAtSolution;
4121 swig_callbackNoMoreSolutions = callbackNoMoreSolutions;
4122 swig_callbackLocalOptimum = callbackLocalOptimum;
4123 swig_callbackAcceptDelta = callbackAcceptDelta;
4124 swig_callbackAcceptNeighbor = callbackAcceptNeighbor;
4125 swig_callbackAcceptUncheckedNeighbor = callbackAcceptUncheckedNeighbor;
4126 swig_callbackIsUncheckedSolutionLimitReached = callbackIsUncheckedSolutionLimitReached;
4127 swig_callbackPeriodicCheck = callbackPeriodicCheck;
4128 swig_callbackProgressPercent = callbackProgressPercent;
4129 swig_callbackAccept = callbackAccept;
4130 swig_callbackInstall = callbackInstall;
4131 swig_callbackCheck = callbackCheck;
4132 swig_callbackInit = callbackInit;
4133 swig_callbackCopy = callbackCopy;
4134 swig_callbackMakeClone = callbackMakeClone;
4137 void SwigDirector_RegularLimit::swig_init_callbacks() {
4138 swig_callbackToString = 0;
4139 swig_callbackEnterSearch = 0;
4140 swig_callbackRestartSearch = 0;
4141 swig_callbackExitSearch = 0;
4142 swig_callbackBeginNextDecision = 0;
4143 swig_callbackEndNextDecision = 0;
4144 swig_callbackApplyDecision = 0;
4145 swig_callbackRefuteDecision = 0;
4146 swig_callbackAfterDecision = 0;
4147 swig_callbackBeginFail = 0;
4148 swig_callbackEndFail = 0;
4149 swig_callbackBeginInitialPropagation = 0;
4150 swig_callbackEndInitialPropagation = 0;
4151 swig_callbackAcceptSolution = 0;
4152 swig_callbackAtSolution = 0;
4153 swig_callbackNoMoreSolutions = 0;
4154 swig_callbackLocalOptimum = 0;
4155 swig_callbackAcceptDelta = 0;
4156 swig_callbackAcceptNeighbor = 0;
4157 swig_callbackAcceptUncheckedNeighbor = 0;
4158 swig_callbackIsUncheckedSolutionLimitReached = 0;
4159 swig_callbackPeriodicCheck = 0;
4160 swig_callbackProgressPercent = 0;
4161 swig_callbackAccept = 0;
4162 swig_callbackInstall = 0;
4163 swig_callbackCheck = 0;
4164 swig_callbackInit = 0;
4165 swig_callbackCopy = 0;
4166 swig_callbackMakeClone = 0;
4170 swig_init_callbacks();
4179 std::string c_result ;
4180 char * jresult = 0 ;
4182 if (!swig_callbackToString) {
4185 jresult = (
char *) swig_callbackToString();
4190 c_result.assign(jresult);
4196 bool c_result = SwigValueInit< bool >() ;
4197 unsigned int jresult = 0 ;
4199 void * jdeltadelta = 0 ;
4201 if (!swig_callbackMakeNextNeighbor) {
4205 jdelta = (
void *)
delta;
4206 jdeltadelta = (
void *) deltadelta;
4207 jresult = (
unsigned int) swig_callbackMakeNextNeighbor(jdelta, jdeltadelta);
4208 c_result = jresult ? true :
false;
4214 void * jassignment = 0 ;
4216 if (!swig_callbackStart) {
4220 jassignment = (
void *) assignment;
4221 swig_callbackStart(jassignment);
4226 if (!swig_callbackReset) {
4230 swig_callbackReset();
4235 bool c_result = SwigValueInit< bool >() ;
4236 unsigned int jresult = 0 ;
4238 if (!swig_callbackHasFragments) {
4241 jresult = (
unsigned int) swig_callbackHasFragments();
4242 c_result = jresult ? true :
false;
4248 bool c_result = SwigValueInit< bool >() ;
4249 unsigned int jresult = 0 ;
4251 if (!swig_callbackHoldsDelta) {
4254 jresult = (
unsigned int) swig_callbackHoldsDelta();
4255 c_result = jresult ? true :
false;
4261 swig_callbackToString = callbackToString;
4262 swig_callbackMakeNextNeighbor = callbackMakeNextNeighbor;
4263 swig_callbackStart = callbackStart;
4264 swig_callbackReset = callbackReset;
4265 swig_callbackHasFragments = callbackHasFragments;
4266 swig_callbackHoldsDelta = callbackHoldsDelta;
4269 void SwigDirector_LocalSearchOperator::swig_init_callbacks() {
4270 swig_callbackToString = 0;
4271 swig_callbackMakeNextNeighbor = 0;
4272 swig_callbackStart = 0;
4273 swig_callbackReset = 0;
4274 swig_callbackHasFragments = 0;
4275 swig_callbackHoldsDelta = 0;
4279 swig_init_callbacks();
4283 swig_init_callbacks();
4292 std::string c_result ;
4293 char * jresult = 0 ;
4295 if (!swig_callbackToString) {
4298 jresult = (
char *) swig_callbackToString();
4303 c_result.assign(jresult);
4317 if (!swig_callbackReset) {
4321 swig_callbackReset();
4326 bool c_result = SwigValueInit< bool >() ;
4327 unsigned int jresult = 0 ;
4329 if (!swig_callbackHasFragments) {
4332 jresult = (
unsigned int) swig_callbackHasFragments();
4333 c_result = jresult ? true :
false;
4339 bool c_result = SwigValueInit< bool >() ;
4340 unsigned int jresult = 0 ;
4342 if (!swig_callbackHoldsDelta) {
4345 jresult = (
unsigned int) swig_callbackHoldsDelta();
4346 c_result = jresult ? true :
false;
4352 bool c_result = SwigValueInit< bool >() ;
4353 unsigned int jresult = 0 ;
4355 if (!swig_callbackIsIncremental) {
4358 jresult = (
unsigned int) swig_callbackIsIncremental();
4359 c_result = jresult ? true :
false;
4369 if (!swig_callbackOnStart) {
4373 swig_callbackOnStart();
4378 bool c_result = SwigValueInit< bool >() ;
4379 unsigned int jresult = 0 ;
4381 if (!swig_callbackMakeOneNeighbor) {
4384 jresult = (
unsigned int) swig_callbackMakeOneNeighbor();
4385 c_result = jresult ? true :
false;
4390 void SwigDirector_IntVarLocalSearchOperator::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor) {
4391 swig_callbackToString = callbackToString;
4392 swig_callbackReset = callbackReset;
4393 swig_callbackHasFragments = callbackHasFragments;
4394 swig_callbackHoldsDelta = callbackHoldsDelta;
4395 swig_callbackIsIncremental = callbackIsIncremental;
4396 swig_callbackOnStart = callbackOnStart;
4397 swig_callbackMakeOneNeighbor = callbackMakeOneNeighbor;
4400 void SwigDirector_IntVarLocalSearchOperator::swig_init_callbacks() {
4401 swig_callbackToString = 0;
4402 swig_callbackReset = 0;
4403 swig_callbackHasFragments = 0;
4404 swig_callbackHoldsDelta = 0;
4405 swig_callbackIsIncremental = 0;
4406 swig_callbackOnStart = 0;
4407 swig_callbackMakeOneNeighbor = 0;
4411 swig_init_callbacks();
4415 swig_init_callbacks();
4424 std::string c_result ;
4425 char * jresult = 0 ;
4427 if (!swig_callbackToString) {
4430 jresult = (
char *) swig_callbackToString();
4435 c_result.assign(jresult);
4441 bool c_result = SwigValueInit< bool >() ;
4442 unsigned int jresult = 0 ;
4444 void * jdeltadelta = 0 ;
4446 if (!swig_callbackMakeNextNeighbor) {
4450 jdelta = (
void *)
delta;
4451 jdeltadelta = (
void *) deltadelta;
4452 jresult = (
unsigned int) swig_callbackMakeNextNeighbor(jdelta, jdeltadelta);
4453 c_result = jresult ? true :
false;
4463 if (!swig_callbackReset) {
4467 swig_callbackReset();
4472 bool c_result = SwigValueInit< bool >() ;
4473 unsigned int jresult = 0 ;
4475 if (!swig_callbackHasFragments) {
4478 jresult = (
unsigned int) swig_callbackHasFragments();
4479 c_result = jresult ? true :
false;
4485 bool c_result = SwigValueInit< bool >() ;
4486 unsigned int jresult = 0 ;
4488 if (!swig_callbackHoldsDelta) {
4491 jresult = (
unsigned int) swig_callbackHoldsDelta();
4492 c_result = jresult ? true :
false;
4498 bool c_result = SwigValueInit< bool >() ;
4499 unsigned int jresult = 0 ;
4501 if (!swig_callbackIsIncremental) {
4504 jresult = (
unsigned int) swig_callbackIsIncremental();
4505 c_result = jresult ? true :
false;
4515 if (!swig_callbackOnStart) {
4519 swig_callbackOnStart();
4524 swig_callbackToString = callbackToString;
4525 swig_callbackMakeNextNeighbor = callbackMakeNextNeighbor;
4526 swig_callbackReset = callbackReset;
4527 swig_callbackHasFragments = callbackHasFragments;
4528 swig_callbackHoldsDelta = callbackHoldsDelta;
4529 swig_callbackIsIncremental = callbackIsIncremental;
4530 swig_callbackOnStart = callbackOnStart;
4533 void SwigDirector_SequenceVarLocalSearchOperator::swig_init_callbacks() {
4534 swig_callbackToString = 0;
4535 swig_callbackMakeNextNeighbor = 0;
4536 swig_callbackReset = 0;
4537 swig_callbackHasFragments = 0;
4538 swig_callbackHoldsDelta = 0;
4539 swig_callbackIsIncremental = 0;
4540 swig_callbackOnStart = 0;
4544 swig_init_callbacks();
4553 std::string c_result ;
4554 char * jresult = 0 ;
4556 if (!swig_callbackToString) {
4559 jresult = (
char *) swig_callbackToString();
4564 c_result.assign(jresult);
4578 if (!swig_callbackReset) {
4582 swig_callbackReset();
4587 bool c_result = SwigValueInit< bool >() ;
4588 unsigned int jresult = 0 ;
4590 if (!swig_callbackHasFragments) {
4593 jresult = (
unsigned int) swig_callbackHasFragments();
4594 c_result = jresult ? true :
false;
4600 bool c_result = SwigValueInit< bool >() ;
4601 unsigned int jresult = 0 ;
4603 if (!swig_callbackHoldsDelta) {
4606 jresult = (
unsigned int) swig_callbackHoldsDelta();
4607 c_result = jresult ? true :
false;
4613 bool c_result = SwigValueInit< bool >() ;
4614 unsigned int jresult = 0 ;
4616 if (!swig_callbackIsIncremental) {
4619 jresult = (
unsigned int) swig_callbackIsIncremental();
4620 c_result = jresult ? true :
false;
4626 if (!swig_callbackInitFragments) {
4630 swig_callbackInitFragments();
4635 bool c_result = SwigValueInit< bool >() ;
4636 unsigned int jresult = 0 ;
4638 if (!swig_callbackNextFragment) {
4642 jresult = (
unsigned int) swig_callbackNextFragment();
4643 c_result = jresult ? true :
false;
4648 void SwigDirector_BaseLns::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackInitFragments, SWIG_Callback6_t callbackNextFragment) {
4649 swig_callbackToString = callbackToString;
4650 swig_callbackReset = callbackReset;
4651 swig_callbackHasFragments = callbackHasFragments;
4652 swig_callbackHoldsDelta = callbackHoldsDelta;
4653 swig_callbackIsIncremental = callbackIsIncremental;
4654 swig_callbackInitFragments = callbackInitFragments;
4655 swig_callbackNextFragment = callbackNextFragment;
4658 void SwigDirector_BaseLns::swig_init_callbacks() {
4659 swig_callbackToString = 0;
4660 swig_callbackReset = 0;
4661 swig_callbackHasFragments = 0;
4662 swig_callbackHoldsDelta = 0;
4663 swig_callbackIsIncremental = 0;
4664 swig_callbackInitFragments = 0;
4665 swig_callbackNextFragment = 0;
4669 swig_init_callbacks();
4678 std::string c_result ;
4679 char * jresult = 0 ;
4681 if (!swig_callbackToString) {
4684 jresult = (
char *) swig_callbackToString();
4689 c_result.assign(jresult);
4703 if (!swig_callbackReset) {
4707 swig_callbackReset();
4712 bool c_result = SwigValueInit< bool >() ;
4713 unsigned int jresult = 0 ;
4715 if (!swig_callbackHasFragments) {
4718 jresult = (
unsigned int) swig_callbackHasFragments();
4719 c_result = jresult ? true :
false;
4725 bool c_result = SwigValueInit< bool >() ;
4726 unsigned int jresult = 0 ;
4728 if (!swig_callbackHoldsDelta) {
4731 jresult = (
unsigned int) swig_callbackHoldsDelta();
4732 c_result = jresult ? true :
false;
4738 bool c_result = SwigValueInit< bool >() ;
4739 unsigned int jresult = 0 ;
4741 if (!swig_callbackIsIncremental) {
4744 jresult = (
unsigned int) swig_callbackIsIncremental();
4745 c_result = jresult ? true :
false;
4755 if (!swig_callbackOnStart) {
4759 swig_callbackOnStart();
4764 bool c_result = SwigValueInit< bool >() ;
4765 unsigned int jresult = 0 ;
4767 if (!swig_callbackMakeOneNeighbor) {
4770 jresult = (
unsigned int) swig_callbackMakeOneNeighbor();
4771 c_result = jresult ? true :
false;
4777 int64 c_result = SwigValueInit< int64 >() ;
4778 long long jresult = 0 ;
4782 if (!swig_callbackModifyValue) {
4788 jresult = (
long long) swig_callbackModifyValue(jindex, jvalue);
4789 c_result = (
int64)jresult;
4794 void SwigDirector_ChangeValue::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackModifyValue) {
4795 swig_callbackToString = callbackToString;
4796 swig_callbackReset = callbackReset;
4797 swig_callbackHasFragments = callbackHasFragments;
4798 swig_callbackHoldsDelta = callbackHoldsDelta;
4799 swig_callbackIsIncremental = callbackIsIncremental;
4800 swig_callbackOnStart = callbackOnStart;
4801 swig_callbackMakeOneNeighbor = callbackMakeOneNeighbor;
4802 swig_callbackModifyValue = callbackModifyValue;
4805 void SwigDirector_ChangeValue::swig_init_callbacks() {
4806 swig_callbackToString = 0;
4807 swig_callbackReset = 0;
4808 swig_callbackHasFragments = 0;
4809 swig_callbackHoldsDelta = 0;
4810 swig_callbackIsIncremental = 0;
4811 swig_callbackOnStart = 0;
4812 swig_callbackMakeOneNeighbor = 0;
4813 swig_callbackModifyValue = 0;
4822 std::string c_result ;
4823 char * jresult = 0 ;
4825 if (!swig_callbackToString) {
4828 jresult = (
char *) swig_callbackToString();
4833 c_result.assign(jresult);
4847 if (!swig_callbackReset) {
4851 swig_callbackReset();
4856 bool c_result = SwigValueInit< bool >() ;
4857 unsigned int jresult = 0 ;
4859 if (!swig_callbackHasFragments) {
4862 jresult = (
unsigned int) swig_callbackHasFragments();
4863 c_result = jresult ? true :
false;
4869 bool c_result = SwigValueInit< bool >() ;
4870 unsigned int jresult = 0 ;
4872 if (!swig_callbackHoldsDelta) {
4875 jresult = (
unsigned int) swig_callbackHoldsDelta();
4876 c_result = jresult ? true :
false;
4882 bool c_result = SwigValueInit< bool >() ;
4883 unsigned int jresult = 0 ;
4885 if (!swig_callbackIsIncremental) {
4888 jresult = (
unsigned int) swig_callbackIsIncremental();
4889 c_result = jresult ? true :
false;
4899 if (!swig_callbackOnStart) {
4903 swig_callbackOnStart();
4908 bool c_result = SwigValueInit< bool >() ;
4909 unsigned int jresult = 0 ;
4911 if (!swig_callbackMakeOneNeighbor) {
4914 jresult = (
unsigned int) swig_callbackMakeOneNeighbor();
4915 c_result = jresult ? true :
false;
4921 bool c_result = SwigValueInit< bool >() ;
4922 unsigned int jresult = 0 ;
4924 if (!swig_callbackMakeNeighbor) {
4928 jresult = (
unsigned int) swig_callbackMakeNeighbor();
4929 c_result = jresult ? true :
false;
4935 if (!swig_callbackOnNodeInitialization) {
4939 swig_callbackOnNodeInitialization();
4944 bool c_result = SwigValueInit< bool >() ;
4945 unsigned int jresult = 0 ;
4947 if (!swig_callbackRestartAtPathStartOnSynchronize) {
4950 jresult = (
unsigned int) swig_callbackRestartAtPathStartOnSynchronize();
4951 c_result = jresult ? true :
false;
4957 bool c_result = SwigValueInit< bool >() ;
4958 unsigned int jresult = 0 ;
4959 long long jbase_index ;
4961 if (!swig_callbackOnSamePathAsPreviousBase) {
4964 jbase_index = base_index;
4965 jresult = (
unsigned int) swig_callbackOnSamePathAsPreviousBase(jbase_index);
4966 c_result = jresult ? true :
false;
4972 int64 c_result = SwigValueInit< int64 >() ;
4973 long long jresult = 0 ;
4976 if (!swig_callbackGetBaseNodeRestartPosition) {
4979 jbase_index = base_index;
4980 jresult = (
long long) swig_callbackGetBaseNodeRestartPosition(jbase_index);
4981 c_result = (
int64)jresult;
4987 long long jbase_index ;
4989 if (!swig_callbackSetNextBaseToIncrement) {
4993 jbase_index = base_index;
4994 swig_callbackSetNextBaseToIncrement(jbase_index);
4999 bool c_result = SwigValueInit< bool >() ;
5000 unsigned int jresult = 0 ;
5001 long long jbase_index ;
5003 if (!swig_callbackConsiderAlternatives) {
5006 jbase_index = base_index;
5007 jresult = (
unsigned int) swig_callbackConsiderAlternatives(jbase_index);
5008 c_result = jresult ? true :
false;
5014 bool c_result = SwigValueInit< bool >() ;
5015 unsigned int jresult = 0 ;
5017 if (!swig_callbackInitPosition) {
5020 jresult = (
unsigned int) swig_callbackInitPosition();
5021 c_result = jresult ? true :
false;
5026 void SwigDirector_PathOperator::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackMakeNeighbor, SWIG_Callback8_t callbackOnNodeInitialization, SWIG_Callback9_t callbackRestartAtPathStartOnSynchronize, SWIG_Callback10_t callbackOnSamePathAsPreviousBase, SWIG_Callback11_t callbackGetBaseNodeRestartPosition, SWIG_Callback12_t callbackSetNextBaseToIncrement, SWIG_Callback13_t callbackConsiderAlternatives, SWIG_Callback14_t callbackInitPosition) {
5027 swig_callbackToString = callbackToString;
5028 swig_callbackReset = callbackReset;
5029 swig_callbackHasFragments = callbackHasFragments;
5030 swig_callbackHoldsDelta = callbackHoldsDelta;
5031 swig_callbackIsIncremental = callbackIsIncremental;
5032 swig_callbackOnStart = callbackOnStart;
5033 swig_callbackMakeOneNeighbor = callbackMakeOneNeighbor;
5034 swig_callbackMakeNeighbor = callbackMakeNeighbor;
5035 swig_callbackOnNodeInitialization = callbackOnNodeInitialization;
5036 swig_callbackRestartAtPathStartOnSynchronize = callbackRestartAtPathStartOnSynchronize;
5037 swig_callbackOnSamePathAsPreviousBase = callbackOnSamePathAsPreviousBase;
5038 swig_callbackGetBaseNodeRestartPosition = callbackGetBaseNodeRestartPosition;
5039 swig_callbackSetNextBaseToIncrement = callbackSetNextBaseToIncrement;
5040 swig_callbackConsiderAlternatives = callbackConsiderAlternatives;
5041 swig_callbackInitPosition = callbackInitPosition;
5044 void SwigDirector_PathOperator::swig_init_callbacks() {
5045 swig_callbackToString = 0;
5046 swig_callbackReset = 0;
5047 swig_callbackHasFragments = 0;
5048 swig_callbackHoldsDelta = 0;
5049 swig_callbackIsIncremental = 0;
5050 swig_callbackOnStart = 0;
5051 swig_callbackMakeOneNeighbor = 0;
5052 swig_callbackMakeNeighbor = 0;
5053 swig_callbackOnNodeInitialization = 0;
5054 swig_callbackRestartAtPathStartOnSynchronize = 0;
5055 swig_callbackOnSamePathAsPreviousBase = 0;
5056 swig_callbackGetBaseNodeRestartPosition = 0;
5057 swig_callbackSetNextBaseToIncrement = 0;
5058 swig_callbackConsiderAlternatives = 0;
5059 swig_callbackInitPosition = 0;
5063 swig_init_callbacks();
5072 std::string c_result ;
5073 char * jresult = 0 ;
5075 if (!swig_callbackToString) {
5078 jresult = (
char *) swig_callbackToString();
5083 c_result.assign(jresult);
5090 void * jdeltadelta = 0 ;
5092 if (!swig_callbackRelax) {
5096 jdelta = (
void *)
delta;
5097 jdeltadelta = (
void *) deltadelta;
5098 swig_callbackRelax(jdelta, jdeltadelta);
5104 void * jdeltadelta = 0 ;
5106 if (!swig_callbackCommit) {
5110 jdelta = (
void *)
delta;
5111 jdeltadelta = (
void *) deltadelta;
5112 swig_callbackCommit(jdelta, jdeltadelta);
5117 bool c_result = SwigValueInit< bool >() ;
5118 unsigned int jresult = 0 ;
5120 void * jdeltadelta = 0 ;
5121 long long jobjective_min ;
5122 long long jobjective_max ;
5124 if (!swig_callbackAccept) {
5128 jdelta = (
void *)
delta;
5129 jdeltadelta = (
void *) deltadelta;
5130 jobjective_min = objective_min;
5131 jobjective_max = objective_max;
5132 jresult = (
unsigned int) swig_callbackAccept(jdelta, jdeltadelta, jobjective_min, jobjective_max);
5133 c_result = jresult ? true :
false;
5139 bool c_result = SwigValueInit< bool >() ;
5140 unsigned int jresult = 0 ;
5142 if (!swig_callbackIsIncremental) {
5145 jresult = (
unsigned int) swig_callbackIsIncremental();
5146 c_result = jresult ? true :
false;
5152 void * jassignment = 0 ;
5155 if (!swig_callbackSynchronize) {
5159 jassignment = (
void *) assignment;
5160 jdelta = (
void *)
delta;
5161 swig_callbackSynchronize(jassignment, jdelta);
5166 if (!swig_callbackRevert) {
5170 swig_callbackRevert();
5175 if (!swig_callbackReset) {
5179 swig_callbackReset();
5184 int64 c_result = SwigValueInit< int64 >() ;
5185 long long jresult = 0 ;
5187 if (!swig_callbackGetSynchronizedObjectiveValue) {
5190 jresult = (
long long) swig_callbackGetSynchronizedObjectiveValue();
5191 c_result = (
int64)jresult;
5197 int64 c_result = SwigValueInit< int64 >() ;
5198 long long jresult = 0 ;
5200 if (!swig_callbackGetAcceptedObjectiveValue) {
5203 jresult = (
long long) swig_callbackGetAcceptedObjectiveValue();
5204 c_result = (
int64)jresult;
5209 void SwigDirector_LocalSearchFilter::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackSynchronize, SWIG_Callback6_t callbackRevert, SWIG_Callback7_t callbackReset, SWIG_Callback8_t callbackGetSynchronizedObjectiveValue, SWIG_Callback9_t callbackGetAcceptedObjectiveValue) {
5210 swig_callbackToString = callbackToString;
5211 swig_callbackRelax = callbackRelax;
5212 swig_callbackCommit = callbackCommit;
5213 swig_callbackAccept = callbackAccept;
5214 swig_callbackIsIncremental = callbackIsIncremental;
5215 swig_callbackSynchronize = callbackSynchronize;
5216 swig_callbackRevert = callbackRevert;
5217 swig_callbackReset = callbackReset;
5218 swig_callbackGetSynchronizedObjectiveValue = callbackGetSynchronizedObjectiveValue;
5219 swig_callbackGetAcceptedObjectiveValue = callbackGetAcceptedObjectiveValue;
5222 void SwigDirector_LocalSearchFilter::swig_init_callbacks() {
5223 swig_callbackToString = 0;
5224 swig_callbackRelax = 0;
5225 swig_callbackCommit = 0;
5226 swig_callbackAccept = 0;
5227 swig_callbackIsIncremental = 0;
5228 swig_callbackSynchronize = 0;
5229 swig_callbackRevert = 0;
5230 swig_callbackReset = 0;
5231 swig_callbackGetSynchronizedObjectiveValue = 0;
5232 swig_callbackGetAcceptedObjectiveValue = 0;
5236 swig_init_callbacks();
5240 swig_init_callbacks();
5249 std::string c_result ;
5250 char * jresult = 0 ;
5252 if (!swig_callbackToString) {
5255 jresult = (
char *) swig_callbackToString();
5260 c_result.assign(jresult);
5266 swig_callbackToString = callbackToString;
5269 void SwigDirector_LocalSearchFilterManager::swig_init_callbacks() {
5270 swig_callbackToString = 0;
5274 swig_init_callbacks();
5283 std::string c_result ;
5284 char * jresult = 0 ;
5286 if (!swig_callbackToString) {
5289 jresult = (
char *) swig_callbackToString();
5294 c_result.assign(jresult);
5301 void * jdeltadelta = 0 ;
5303 if (!swig_callbackRelax) {
5307 jdelta = (
void *)
delta;
5308 jdeltadelta = (
void *) deltadelta;
5309 swig_callbackRelax(jdelta, jdeltadelta);
5315 void * jdeltadelta = 0 ;
5317 if (!swig_callbackCommit) {
5321 jdelta = (
void *)
delta;
5322 jdeltadelta = (
void *) deltadelta;
5323 swig_callbackCommit(jdelta, jdeltadelta);
5328 bool c_result = SwigValueInit< bool >() ;
5329 unsigned int jresult = 0 ;
5331 void * jdeltadelta = 0 ;
5332 long long jobjective_min ;
5333 long long jobjective_max ;
5335 if (!swig_callbackAccept) {
5339 jdelta = (
void *)
delta;
5340 jdeltadelta = (
void *) deltadelta;
5341 jobjective_min = objective_min;
5342 jobjective_max = objective_max;
5343 jresult = (
unsigned int) swig_callbackAccept(jdelta, jdeltadelta, jobjective_min, jobjective_max);
5344 c_result = jresult ? true :
false;
5350 bool c_result = SwigValueInit< bool >() ;
5351 unsigned int jresult = 0 ;
5353 if (!swig_callbackIsIncremental) {
5356 jresult = (
unsigned int) swig_callbackIsIncremental();
5357 c_result = jresult ? true :
false;
5363 if (!swig_callbackRevert) {
5367 swig_callbackRevert();
5372 if (!swig_callbackReset) {
5376 swig_callbackReset();
5381 int64 c_result = SwigValueInit< int64 >() ;
5382 long long jresult = 0 ;
5384 if (!swig_callbackGetSynchronizedObjectiveValue) {
5387 jresult = (
long long) swig_callbackGetSynchronizedObjectiveValue();
5388 c_result = (
int64)jresult;
5394 int64 c_result = SwigValueInit< int64 >() ;
5395 long long jresult = 0 ;
5397 if (!swig_callbackGetAcceptedObjectiveValue) {
5400 jresult = (
long long) swig_callbackGetAcceptedObjectiveValue();
5401 c_result = (
int64)jresult;
5409 if (!swig_callbackOnSynchronize) {
5413 jdelta = (
void *)
delta;
5414 swig_callbackOnSynchronize(jdelta);
5418 void SwigDirector_IntVarLocalSearchFilter::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackRevert, SWIG_Callback6_t callbackReset, SWIG_Callback7_t callbackGetSynchronizedObjectiveValue, SWIG_Callback8_t callbackGetAcceptedObjectiveValue, SWIG_Callback9_t callbackOnSynchronize) {
5419 swig_callbackToString = callbackToString;
5420 swig_callbackRelax = callbackRelax;
5421 swig_callbackCommit = callbackCommit;
5422 swig_callbackAccept = callbackAccept;
5423 swig_callbackIsIncremental = callbackIsIncremental;
5424 swig_callbackRevert = callbackRevert;
5425 swig_callbackReset = callbackReset;
5426 swig_callbackGetSynchronizedObjectiveValue = callbackGetSynchronizedObjectiveValue;
5427 swig_callbackGetAcceptedObjectiveValue = callbackGetAcceptedObjectiveValue;
5428 swig_callbackOnSynchronize = callbackOnSynchronize;
5431 void SwigDirector_IntVarLocalSearchFilter::swig_init_callbacks() {
5432 swig_callbackToString = 0;
5433 swig_callbackRelax = 0;
5434 swig_callbackCommit = 0;
5435 swig_callbackAccept = 0;
5436 swig_callbackIsIncremental = 0;
5437 swig_callbackRevert = 0;
5438 swig_callbackReset = 0;
5439 swig_callbackGetSynchronizedObjectiveValue = 0;
5440 swig_callbackGetAcceptedObjectiveValue = 0;
5441 swig_callbackOnSynchronize = 0;
5445 swig_init_callbacks();
5454 std::string c_result ;
5455 char * jresult = 0 ;
5457 if (!swig_callbackToString) {
5460 jresult = (
char *) swig_callbackToString();
5465 c_result.assign(jresult);
5474 if (!swig_callbackVisitSetVariableValue) {
5478 jvar = (
void *)
var;
5480 swig_callbackVisitSetVariableValue(jvar, jvalue);
5487 unsigned int jstart_with_lower_half ;
5489 if (!swig_callbackVisitSplitVariableDomain) {
5493 jvar = (
void *)
var;
5495 jstart_with_lower_half = start_with_lower_half;
5496 swig_callbackVisitSplitVariableDomain(jvar, jvalue, jstart_with_lower_half);
5504 if (!swig_callbackVisitScheduleOrPostpone) {
5508 jvar = (
void *)
var;
5510 swig_callbackVisitScheduleOrPostpone(jvar, jest);
5518 if (!swig_callbackVisitScheduleOrExpedite) {
5522 jvar = (
void *)
var;
5524 swig_callbackVisitScheduleOrExpedite(jvar, jest);
5529 void * jsequence = 0 ;
5532 if (!swig_callbackVisitRankFirstInterval) {
5536 jsequence = (
void *) sequence;
5538 swig_callbackVisitRankFirstInterval(jsequence, jindex);
5543 void * jsequence = 0 ;
5546 if (!swig_callbackVisitRankLastInterval) {
5550 jsequence = (
void *) sequence;
5552 swig_callbackVisitRankLastInterval(jsequence, jindex);
5557 if (!swig_callbackVisitUnknownDecision) {
5561 swig_callbackVisitUnknownDecision();
5565 void SwigDirector_SymmetryBreaker::swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackVisitSetVariableValue, SWIG_Callback2_t callbackVisitSplitVariableDomain, SWIG_Callback3_t callbackVisitScheduleOrPostpone, SWIG_Callback4_t callbackVisitScheduleOrExpedite, SWIG_Callback5_t callbackVisitRankFirstInterval, SWIG_Callback6_t callbackVisitRankLastInterval, SWIG_Callback7_t callbackVisitUnknownDecision) {
5566 swig_callbackToString = callbackToString;
5567 swig_callbackVisitSetVariableValue = callbackVisitSetVariableValue;
5568 swig_callbackVisitSplitVariableDomain = callbackVisitSplitVariableDomain;
5569 swig_callbackVisitScheduleOrPostpone = callbackVisitScheduleOrPostpone;
5570 swig_callbackVisitScheduleOrExpedite = callbackVisitScheduleOrExpedite;
5571 swig_callbackVisitRankFirstInterval = callbackVisitRankFirstInterval;
5572 swig_callbackVisitRankLastInterval = callbackVisitRankLastInterval;
5573 swig_callbackVisitUnknownDecision = callbackVisitUnknownDecision;
5576 void SwigDirector_SymmetryBreaker::swig_init_callbacks() {
5577 swig_callbackToString = 0;
5578 swig_callbackVisitSetVariableValue = 0;
5579 swig_callbackVisitSplitVariableDomain = 0;
5580 swig_callbackVisitScheduleOrPostpone = 0;
5581 swig_callbackVisitScheduleOrExpedite = 0;
5582 swig_callbackVisitRankFirstInterval = 0;
5583 swig_callbackVisitRankLastInterval = 0;
5584 swig_callbackVisitUnknownDecision = 0;
5593 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5595 arg1 = (std::vector< int > *)jarg1;
5601 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5605 arg1 = (std::vector< int > *)jarg1;
5608 (arg1)->push_back((
int const &)*arg2);
5613 unsigned long jresult ;
5614 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5615 std::vector< int >::size_type result;
5617 arg1 = (std::vector< int > *)jarg1;
5618 result = ((std::vector< int >
const *)arg1)->size();
5619 jresult = (
unsigned long)result;
5625 unsigned long jresult ;
5626 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5627 std::vector< int >::size_type result;
5629 arg1 = (std::vector< int > *)jarg1;
5630 result = ((std::vector< int >
const *)arg1)->capacity();
5631 jresult = (
unsigned long)result;
5637 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5638 std::vector< int >::size_type arg2 ;
5640 arg1 = (std::vector< int > *)jarg1;
5641 arg2 = (std::vector< int >::size_type)jarg2;
5642 (arg1)->reserve(arg2);
5648 std::vector< int > *result = 0 ;
5650 result = (std::vector< int > *)
new std::vector< int >();
5651 jresult = (
void *)result;
5658 std::vector< int > *arg1 = 0 ;
5659 std::vector< int > *result = 0 ;
5661 arg1 = (std::vector< int > *)jarg1;
5666 result = (std::vector< int > *)
new std::vector< int >((std::vector< int >
const &)*arg1);
5667 jresult = (
void *)result;
5675 std::vector< int > *result = 0 ;
5680 }
catch(std::out_of_range &_e) {
5684 jresult = (
void *)result;
5691 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5695 arg1 = (std::vector< int > *)jarg1;
5699 }
catch(std::out_of_range &_e) {
5710 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5712 std::vector< int >::value_type *result = 0 ;
5714 arg1 = (std::vector< int > *)jarg1;
5718 }
catch(std::out_of_range &_e) {
5728 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5733 arg1 = (std::vector< int > *)jarg1;
5739 }
catch(std::out_of_range &_e) {
5747 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5748 std::vector< int > *arg2 = 0 ;
5750 arg1 = (std::vector< int > *)jarg1;
5751 arg2 = (std::vector< int > *)jarg2;
5762 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5765 std::vector< int > *result = 0 ;
5767 arg1 = (std::vector< int > *)jarg1;
5772 }
catch(std::out_of_range &_e) {
5775 }
catch(std::invalid_argument &_e) {
5779 jresult = (
void *)result;
5785 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5790 arg1 = (std::vector< int > *)jarg1;
5796 }
catch(std::out_of_range &_e) {
5804 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5806 std::vector< int > *arg3 = 0 ;
5808 arg1 = (std::vector< int > *)jarg1;
5810 arg3 = (std::vector< int > *)jarg3;
5817 }
catch(std::out_of_range &_e) {
5825 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5828 arg1 = (std::vector< int > *)jarg1;
5832 }
catch(std::out_of_range &_e) {
5840 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5844 arg1 = (std::vector< int > *)jarg1;
5849 }
catch(std::out_of_range &_e) {
5852 }
catch(std::invalid_argument &_e) {
5864 std::vector< int > *result = 0 ;
5871 }
catch(std::out_of_range &_e) {
5875 jresult = (
void *)result;
5881 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5883 arg1 = (std::vector< int > *)jarg1;
5889 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5893 arg1 = (std::vector< int > *)jarg1;
5898 }
catch(std::out_of_range &_e) {
5901 }
catch(std::invalid_argument &_e) {
5909 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5911 std::vector< int > *arg3 = 0 ;
5913 arg1 = (std::vector< int > *)jarg1;
5915 arg3 = (std::vector< int > *)jarg3;
5922 }
catch(std::out_of_range &_e) {
5930 unsigned int jresult ;
5931 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5936 arg1 = (std::vector< int > *)jarg1;
5947 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5952 arg1 = (std::vector< int > *)jarg1;
5963 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5968 arg1 = (std::vector< int > *)jarg1;
5978 unsigned int jresult ;
5979 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5984 arg1 = (std::vector< int > *)jarg1;
5994 std::vector< int > *arg1 = (std::vector< int > *) 0 ;
5996 arg1 = (std::vector< int > *)jarg1;
6002 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6004 arg1 = (std::vector< std::vector< int > > *)jarg1;
6010 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6011 std::vector< int > *arg2 = 0 ;
6013 arg1 = (std::vector< std::vector< int > > *)jarg1;
6014 arg2 = (std::vector< int > *)jarg2;
6019 (arg1)->push_back((std::vector< int >
const &)*arg2);
6024 unsigned long jresult ;
6025 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6026 std::vector< std::vector< int > >::size_type result;
6028 arg1 = (std::vector< std::vector< int > > *)jarg1;
6029 result = ((std::vector< std::vector< int > >
const *)arg1)->size();
6030 jresult = (
unsigned long)result;
6036 unsigned long jresult ;
6037 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6038 std::vector< std::vector< int > >::size_type result;
6040 arg1 = (std::vector< std::vector< int > > *)jarg1;
6041 result = ((std::vector< std::vector< int > >
const *)arg1)->capacity();
6042 jresult = (
unsigned long)result;
6048 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6049 std::vector< std::vector< int > >::size_type arg2 ;
6051 arg1 = (std::vector< std::vector< int > > *)jarg1;
6052 arg2 = (std::vector< std::vector< int > >::size_type)jarg2;
6053 (arg1)->reserve(arg2);
6059 std::vector< std::vector< int > > *result = 0 ;
6061 result = (std::vector< std::vector< int > > *)
new std::vector< std::vector< int > >();
6062 jresult = (
void *)result;
6069 std::vector< std::vector< int > > *arg1 = 0 ;
6070 std::vector< std::vector< int > > *result = 0 ;
6072 arg1 = (std::vector< std::vector< int > > *)jarg1;
6077 result = (std::vector< std::vector< int > > *)
new std::vector< std::vector< int > >((std::vector< std::vector< int > >
const &)*arg1);
6078 jresult = (
void *)result;
6086 std::vector< std::vector< int > > *result = 0 ;
6091 }
catch(std::out_of_range &_e) {
6095 jresult = (
void *)result;
6102 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6104 std::vector< int > result;
6106 arg1 = (std::vector< std::vector< int > > *)jarg1;
6110 }
catch(std::out_of_range &_e) {
6114 jresult =
new std::vector< int >((
const std::vector< int > &)result);
6121 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6123 std::vector< std::vector< int > >::value_type *result = 0 ;
6125 arg1 = (std::vector< std::vector< int > > *)jarg1;
6129 }
catch(std::out_of_range &_e) {
6133 jresult = (
void *)result;
6139 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6141 std::vector< int > *arg3 = 0 ;
6143 arg1 = (std::vector< std::vector< int > > *)jarg1;
6145 arg3 = (std::vector< int > *)jarg3;
6152 }
catch(std::out_of_range &_e) {
6160 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6161 std::vector< std::vector< int > > *arg2 = 0 ;
6163 arg1 = (std::vector< std::vector< int > > *)jarg1;
6164 arg2 = (std::vector< std::vector< int > > *)jarg2;
6175 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6178 std::vector< std::vector< int > > *result = 0 ;
6180 arg1 = (std::vector< std::vector< int > > *)jarg1;
6185 }
catch(std::out_of_range &_e) {
6188 }
catch(std::invalid_argument &_e) {
6192 jresult = (
void *)result;
6198 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6200 std::vector< int > *arg3 = 0 ;
6202 arg1 = (std::vector< std::vector< int > > *)jarg1;
6204 arg3 = (std::vector< int > *)jarg3;
6211 }
catch(std::out_of_range &_e) {
6219 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6221 std::vector< std::vector< int > > *arg3 = 0 ;
6223 arg1 = (std::vector< std::vector< int > > *)jarg1;
6225 arg3 = (std::vector< std::vector< int > > *)jarg3;
6232 }
catch(std::out_of_range &_e) {
6240 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6243 arg1 = (std::vector< std::vector< int > > *)jarg1;
6247 }
catch(std::out_of_range &_e) {
6255 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6259 arg1 = (std::vector< std::vector< int > > *)jarg1;
6264 }
catch(std::out_of_range &_e) {
6267 }
catch(std::invalid_argument &_e) {
6276 std::vector< int > *arg1 = 0 ;
6278 std::vector< std::vector< int > > *result = 0 ;
6280 arg1 = (std::vector< int > *)jarg1;
6288 }
catch(std::out_of_range &_e) {
6292 jresult = (
void *)result;
6298 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6300 arg1 = (std::vector< std::vector< int > > *)jarg1;
6306 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6310 arg1 = (std::vector< std::vector< int > > *)jarg1;
6315 }
catch(std::out_of_range &_e) {
6318 }
catch(std::invalid_argument &_e) {
6326 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6328 std::vector< std::vector< int > > *arg3 = 0 ;
6330 arg1 = (std::vector< std::vector< int > > *)jarg1;
6332 arg3 = (std::vector< std::vector< int > > *)jarg3;
6339 }
catch(std::out_of_range &_e) {
6347 std::vector< std::vector< int > > *arg1 = (std::vector< std::vector< int > > *) 0 ;
6349 arg1 = (std::vector< std::vector< int > > *)jarg1;
6355 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6357 arg1 = (std::vector< int64 > *)jarg1;
6363 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6367 arg1 = (std::vector< int64 > *)jarg1;
6368 temp2 = (long)jarg2;
6370 (arg1)->push_back((
long const &)*arg2);
6375 unsigned long jresult ;
6376 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6377 std::vector< long >::size_type result;
6379 arg1 = (std::vector< int64 > *)jarg1;
6380 result = ((std::vector< int64 >
const *)arg1)->size();
6381 jresult = (
unsigned long)result;
6387 unsigned long jresult ;
6388 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6389 std::vector< long >::size_type result;
6391 arg1 = (std::vector< int64 > *)jarg1;
6392 result = ((std::vector< int64 >
const *)arg1)->capacity();
6393 jresult = (
unsigned long)result;
6399 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6400 std::vector< long >::size_type arg2 ;
6402 arg1 = (std::vector< int64 > *)jarg1;
6403 arg2 = (std::vector< long >::size_type)jarg2;
6404 (arg1)->reserve(arg2);
6410 std::vector< int64 > *result = 0 ;
6412 result = (std::vector< int64 > *)
new std::vector< int64 >();
6413 jresult = (
void *)result;
6420 std::vector< int64 > *arg1 = 0 ;
6421 std::vector< int64 > *result = 0 ;
6423 arg1 = (std::vector< int64 > *)jarg1;
6428 result = (std::vector< int64 > *)
new std::vector< int64 >((std::vector< int64 >
const &)*arg1);
6429 jresult = (
void *)result;
6437 std::vector< int64 > *result = 0 ;
6442 }
catch(std::out_of_range &_e) {
6446 jresult = (
void *)result;
6453 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6457 arg1 = (std::vector< int64 > *)jarg1;
6461 }
catch(std::out_of_range &_e) {
6472 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6474 std::vector< long >::value_type *result = 0 ;
6476 arg1 = (std::vector< int64 > *)jarg1;
6480 }
catch(std::out_of_range &_e) {
6490 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6495 arg1 = (std::vector< int64 > *)jarg1;
6497 temp3 = (long)jarg3;
6501 }
catch(std::out_of_range &_e) {
6509 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6510 std::vector< long > *arg2 = 0 ;
6512 arg1 = (std::vector< int64 > *)jarg1;
6513 arg2 = (std::vector< long > *)jarg2;
6524 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6527 std::vector< long > *result = 0 ;
6529 arg1 = (std::vector< int64 > *)jarg1;
6534 }
catch(std::out_of_range &_e) {
6537 }
catch(std::invalid_argument &_e) {
6541 jresult = (
void *)result;
6547 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6552 arg1 = (std::vector< int64 > *)jarg1;
6554 temp3 = (long)jarg3;
6558 }
catch(std::out_of_range &_e) {
6566 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6568 std::vector< long > *arg3 = 0 ;
6570 arg1 = (std::vector< int64 > *)jarg1;
6572 arg3 = (std::vector< long > *)jarg3;
6579 }
catch(std::out_of_range &_e) {
6587 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6590 arg1 = (std::vector< int64 > *)jarg1;
6594 }
catch(std::out_of_range &_e) {
6602 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6606 arg1 = (std::vector< int64 > *)jarg1;
6611 }
catch(std::out_of_range &_e) {
6614 }
catch(std::invalid_argument &_e) {
6626 std::vector< long > *result = 0 ;
6628 temp1 = (long)jarg1;
6633 }
catch(std::out_of_range &_e) {
6637 jresult = (
void *)result;
6643 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6645 arg1 = (std::vector< int64 > *)jarg1;
6651 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6655 arg1 = (std::vector< int64 > *)jarg1;
6660 }
catch(std::out_of_range &_e) {
6663 }
catch(std::invalid_argument &_e) {
6671 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6673 std::vector< long > *arg3 = 0 ;
6675 arg1 = (std::vector< int64 > *)jarg1;
6677 arg3 = (std::vector< long > *)jarg3;
6684 }
catch(std::out_of_range &_e) {
6692 unsigned int jresult ;
6693 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6698 arg1 = (std::vector< int64 > *)jarg1;
6699 temp2 = (long)jarg2;
6709 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6714 arg1 = (std::vector< int64 > *)jarg1;
6715 temp2 = (long)jarg2;
6725 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6730 arg1 = (std::vector< int64 > *)jarg1;
6731 temp2 = (long)jarg2;
6740 unsigned int jresult ;
6741 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6746 arg1 = (std::vector< int64 > *)jarg1;
6747 temp2 = (long)jarg2;
6756 std::vector< int64 > *arg1 = (std::vector< int64 > *) 0 ;
6758 arg1 = (std::vector< int64 > *)jarg1;
6764 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6766 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6772 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6773 std::vector< int64 > *arg2 = 0 ;
6775 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6776 arg2 = (std::vector< int64 > *)jarg2;
6781 (arg1)->push_back((std::vector< int64 >
const &)*arg2);
6786 unsigned long jresult ;
6787 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6788 std::vector< std::vector< long > >::size_type result;
6790 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6791 result = ((std::vector< std::vector< int64 > >
const *)arg1)->size();
6792 jresult = (
unsigned long)result;
6798 unsigned long jresult ;
6799 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6800 std::vector< std::vector< long > >::size_type result;
6802 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6803 result = ((std::vector< std::vector< int64 > >
const *)arg1)->capacity();
6804 jresult = (
unsigned long)result;
6810 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6811 std::vector< std::vector< long > >::size_type arg2 ;
6813 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6814 arg2 = (std::vector< std::vector< long > >::size_type)jarg2;
6815 (arg1)->reserve(arg2);
6821 std::vector< std::vector< int64 > > *result = 0 ;
6823 result = (std::vector< std::vector< int64 > > *)
new std::vector< std::vector< int64 > >();
6824 jresult = (
void *)result;
6831 std::vector< std::vector< int64 > > *arg1 = 0 ;
6832 std::vector< std::vector< int64 > > *result = 0 ;
6834 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6839 result = (std::vector< std::vector< int64 > > *)
new std::vector< std::vector< int64 > >((std::vector< std::vector< int64 > >
const &)*arg1);
6840 jresult = (
void *)result;
6848 std::vector< std::vector< int64 > > *result = 0 ;
6853 }
catch(std::out_of_range &_e) {
6857 jresult = (
void *)result;
6864 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6866 std::vector< int64 > result;
6868 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6872 }
catch(std::out_of_range &_e) {
6876 jresult =
new std::vector< int64 >((
const std::vector< int64 > &)result);
6883 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6885 std::vector< std::vector< long > >::value_type *result = 0 ;
6887 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6891 }
catch(std::out_of_range &_e) {
6895 jresult = (
void *)result;
6901 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6903 std::vector< int64 > *arg3 = 0 ;
6905 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6907 arg3 = (std::vector< int64 > *)jarg3;
6914 }
catch(std::out_of_range &_e) {
6922 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6923 std::vector< std::vector< int64 > > *arg2 = 0 ;
6925 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6926 arg2 = (std::vector< std::vector< int64 > > *)jarg2;
6937 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6940 std::vector< std::vector< int64 > > *result = 0 ;
6942 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6947 }
catch(std::out_of_range &_e) {
6950 }
catch(std::invalid_argument &_e) {
6954 jresult = (
void *)result;
6960 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6962 std::vector< int64 > *arg3 = 0 ;
6964 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6966 arg3 = (std::vector< int64 > *)jarg3;
6973 }
catch(std::out_of_range &_e) {
6981 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
6983 std::vector< std::vector< int64 > > *arg3 = 0 ;
6985 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
6987 arg3 = (std::vector< std::vector< int64 > > *)jarg3;
6994 }
catch(std::out_of_range &_e) {
7002 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7005 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7009 }
catch(std::out_of_range &_e) {
7017 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7021 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7026 }
catch(std::out_of_range &_e) {
7029 }
catch(std::invalid_argument &_e) {
7038 std::vector< int64 > *arg1 = 0 ;
7040 std::vector< std::vector< int64 > > *result = 0 ;
7042 arg1 = (std::vector< int64 > *)jarg1;
7050 }
catch(std::out_of_range &_e) {
7054 jresult = (
void *)result;
7060 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7062 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7068 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7072 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7077 }
catch(std::out_of_range &_e) {
7080 }
catch(std::invalid_argument &_e) {
7088 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7090 std::vector< std::vector< int64 > > *arg3 = 0 ;
7092 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7094 arg3 = (std::vector< std::vector< int64 > > *)jarg3;
7101 }
catch(std::out_of_range &_e) {
7109 std::vector< std::vector< int64 > > *arg1 = (std::vector< std::vector< int64 > > *) 0 ;
7111 arg1 = (std::vector< std::vector< int64 > > *)jarg1;
7123 jresult = (
void *)result;
7139 jresult = (
void *)result;
7163 std::vector< int > *arg2 = 0 ;
7168 arg2 =
new std::vector<int>;
7169 arg2->reserve(length2);
7170 for(
int i = 0; i < length2; ++i) {
7171 arg2->emplace_back(jarg2[i]);
7174 result = (int)(arg1)->Insert((std::vector< int >
const &)*arg2);
7186 std::vector< int64 > *arg2 = 0 ;
7191 arg2 =
new std::vector<int64>;
7192 arg2->reserve(length2);
7193 for(
int i = 0; i < length2; ++i) {
7194 arg2->emplace_back(jarg2[i]);
7197 result = (int)(arg1)->Insert((std::vector< int64 >
const &)*arg2);
7214 arg2 = (
int64)jarg2;
7215 arg3 = (
int64)jarg3;
7216 result = (int)(arg1)->
Insert2(arg2,arg3);
7231 arg2 = (
int64)jarg2;
7232 arg3 = (
int64)jarg3;
7233 arg4 = (
int64)jarg4;
7234 result = (int)(arg1)->
Insert3(arg2,arg3,arg4);
7250 arg2 = (
int64)jarg2;
7251 arg3 = (
int64)jarg3;
7252 arg4 = (
int64)jarg4;
7253 arg5 = (
int64)jarg5;
7254 result = (int)(arg1)->
Insert4(arg2,arg3,arg4,arg5);
7261 int len2_1,
int len2_2[],
int64*
7264 std::vector< std::vector< int64 > > *arg2 = 0 ;
7265 std::vector< std::vector< int64 > > result2 ;
7270 result2.resize(len2_1);
7272 int64* inner_array =
reinterpret_cast<int64*
>(jarg2);
7273 int actualIndex = 0;
7274 for (
int index1 = 0; index1 < len2_1; ++index1) {
7275 result2[index1].reserve(len2_2[index1]);
7276 for (
int index2 = 0; index2 < len2_2[index1]; ++index2) {
7277 const int64 value = inner_array[actualIndex];
7278 result2[index1].emplace_back(
value);
7285 (arg1)->InsertAll((std::vector< std::vector< int64 > >
const &)*arg2);
7290 int len2_1,
int len2_2[],
int*
7293 std::vector< std::vector< int > > *arg2 = 0 ;
7294 std::vector< std::vector< int > > result2 ;
7299 result2.resize(len2_1);
7301 int* inner_array =
reinterpret_cast<int*
>(jarg2);
7302 int actualIndex = 0;
7303 for (
int index1 = 0; index1 < len2_1; ++index1) {
7304 result2[index1].reserve(len2_2[index1]);
7305 for (
int index2 = 0; index2 < len2_2[index1]; ++index2) {
7306 const int value = inner_array[actualIndex];
7307 result2[index1].emplace_back(
value);
7314 (arg1)->InsertAll((std::vector< std::vector< int > >
const &)*arg2);
7319 unsigned int jresult ;
7321 std::vector< int > *arg2 = 0 ;
7326 arg2 =
new std::vector<int>;
7327 arg2->reserve(length2);
7328 for(
int i = 0; i < length2; ++i) {
7329 arg2->emplace_back(jarg2[i]);
7342 unsigned int jresult ;
7344 std::vector< int64 > *arg2 = 0 ;
7349 arg2 =
new std::vector<int64>;
7350 arg2->reserve(length2);
7351 for(
int i = 0; i < length2; ++i) {
7352 arg2->emplace_back(jarg2[i]);
7422 SwigValueWrapper< operations_research::IntTupleSet > result;
7435 SwigValueWrapper< operations_research::IntTupleSet > result;
7449 jresult = (
void *)result;
7463 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7465 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7471 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7475 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7483 unsigned long jresult ;
7484 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7485 std::vector< operations_research::IntVar * >::size_type result;
7487 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7488 result = ((std::vector< operations_research::IntVar * >
const *)arg1)->size();
7489 jresult = (
unsigned long)result;
7495 unsigned long jresult ;
7496 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7497 std::vector< operations_research::IntVar * >::size_type result;
7499 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7500 result = ((std::vector< operations_research::IntVar * >
const *)arg1)->capacity();
7501 jresult = (
unsigned long)result;
7507 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7508 std::vector< operations_research::IntVar * >::size_type arg2 ;
7510 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7511 arg2 = (std::vector< operations_research::IntVar * >::size_type)jarg2;
7512 (arg1)->reserve(arg2);
7518 std::vector< operations_research::IntVar * > *result = 0 ;
7520 result = (std::vector< operations_research::IntVar * > *)
new std::vector< operations_research::IntVar * >();
7521 jresult = (
void *)result;
7528 std::vector< operations_research::IntVar * > *arg1 = 0 ;
7529 std::vector< operations_research::IntVar * > *result = 0 ;
7531 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7536 result = (std::vector< operations_research::IntVar * > *)
new std::vector< operations_research::IntVar * >((std::vector< operations_research::IntVar * >
const &)*arg1);
7537 jresult = (
void *)result;
7545 std::vector< operations_research::IntVar * > *result = 0 ;
7550 }
catch(std::out_of_range &_e) {
7554 jresult = (
void *)result;
7561 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7565 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7569 }
catch(std::out_of_range &_e) {
7573 jresult = (
void *)result;
7580 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7582 std::vector< operations_research::IntVar * >::value_type *result = 0 ;
7584 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7588 }
catch(std::out_of_range &_e) {
7592 jresult = (
void *)*result;
7598 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7603 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7609 }
catch(std::out_of_range &_e) {
7617 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7618 std::vector< operations_research::IntVar * > *arg2 = 0 ;
7620 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7621 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
7632 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7635 std::vector< operations_research::IntVar * > *result = 0 ;
7637 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7642 }
catch(std::out_of_range &_e) {
7645 }
catch(std::invalid_argument &_e) {
7649 jresult = (
void *)result;
7655 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7660 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7666 }
catch(std::out_of_range &_e) {
7674 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7676 std::vector< operations_research::IntVar * > *arg3 = 0 ;
7678 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7680 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
7687 }
catch(std::out_of_range &_e) {
7695 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7698 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7702 }
catch(std::out_of_range &_e) {
7710 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7714 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7719 }
catch(std::out_of_range &_e) {
7722 }
catch(std::invalid_argument &_e) {
7734 std::vector< operations_research::IntVar * > *result = 0 ;
7741 }
catch(std::out_of_range &_e) {
7745 jresult = (
void *)result;
7751 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7753 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7759 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7763 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7768 }
catch(std::out_of_range &_e) {
7771 }
catch(std::invalid_argument &_e) {
7779 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7781 std::vector< operations_research::IntVar * > *arg3 = 0 ;
7783 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7785 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
7792 }
catch(std::out_of_range &_e) {
7800 unsigned int jresult ;
7801 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7806 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7817 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7822 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7833 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7838 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7848 unsigned int jresult ;
7849 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7854 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7864 std::vector< operations_research::IntVar * > *arg1 = (std::vector< operations_research::IntVar * > *) 0 ;
7866 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
7872 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7874 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7880 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7884 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7892 unsigned long jresult ;
7893 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7894 std::vector< operations_research::SearchMonitor * >::size_type result;
7896 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7897 result = ((std::vector< operations_research::SearchMonitor * >
const *)arg1)->size();
7898 jresult = (
unsigned long)result;
7904 unsigned long jresult ;
7905 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7906 std::vector< operations_research::SearchMonitor * >::size_type result;
7908 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7909 result = ((std::vector< operations_research::SearchMonitor * >
const *)arg1)->capacity();
7910 jresult = (
unsigned long)result;
7916 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7917 std::vector< operations_research::SearchMonitor * >::size_type arg2 ;
7919 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7920 arg2 = (std::vector< operations_research::SearchMonitor * >::size_type)jarg2;
7921 (arg1)->reserve(arg2);
7927 std::vector< operations_research::SearchMonitor * > *result = 0 ;
7929 result = (std::vector< operations_research::SearchMonitor * > *)
new std::vector< operations_research::SearchMonitor * >();
7930 jresult = (
void *)result;
7937 std::vector< operations_research::SearchMonitor * > *arg1 = 0 ;
7938 std::vector< operations_research::SearchMonitor * > *result = 0 ;
7940 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7945 result = (std::vector< operations_research::SearchMonitor * > *)
new std::vector< operations_research::SearchMonitor * >((std::vector< operations_research::SearchMonitor * >
const &)*arg1);
7946 jresult = (
void *)result;
7954 std::vector< operations_research::SearchMonitor * > *result = 0 ;
7959 }
catch(std::out_of_range &_e) {
7963 jresult = (
void *)result;
7970 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7974 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7978 }
catch(std::out_of_range &_e) {
7982 jresult = (
void *)result;
7989 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
7991 std::vector< operations_research::SearchMonitor * >::value_type *result = 0 ;
7993 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
7997 }
catch(std::out_of_range &_e) {
8001 jresult = (
void *)*result;
8007 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8012 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8018 }
catch(std::out_of_range &_e) {
8026 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8027 std::vector< operations_research::SearchMonitor * > *arg2 = 0 ;
8029 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8030 arg2 = (std::vector< operations_research::SearchMonitor * > *)jarg2;
8041 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8044 std::vector< operations_research::SearchMonitor * > *result = 0 ;
8046 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8051 }
catch(std::out_of_range &_e) {
8054 }
catch(std::invalid_argument &_e) {
8058 jresult = (
void *)result;
8064 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8069 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8075 }
catch(std::out_of_range &_e) {
8083 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8085 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
8087 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8089 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
8096 }
catch(std::out_of_range &_e) {
8104 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8107 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8111 }
catch(std::out_of_range &_e) {
8119 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8123 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8128 }
catch(std::out_of_range &_e) {
8131 }
catch(std::invalid_argument &_e) {
8143 std::vector< operations_research::SearchMonitor * > *result = 0 ;
8150 }
catch(std::out_of_range &_e) {
8154 jresult = (
void *)result;
8160 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8162 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8168 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8172 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8177 }
catch(std::out_of_range &_e) {
8180 }
catch(std::invalid_argument &_e) {
8188 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8190 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
8192 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8194 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
8201 }
catch(std::out_of_range &_e) {
8209 unsigned int jresult ;
8210 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8215 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8226 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8231 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8242 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8247 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8257 unsigned int jresult ;
8258 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8263 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8273 std::vector< operations_research::SearchMonitor * > *arg1 = (std::vector< operations_research::SearchMonitor * > *) 0 ;
8275 arg1 = (std::vector< operations_research::SearchMonitor * > *)jarg1;
8281 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8283 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8289 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8293 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8301 unsigned long jresult ;
8302 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8303 std::vector< operations_research::DecisionBuilder * >::size_type result;
8305 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8306 result = ((std::vector< operations_research::DecisionBuilder * >
const *)arg1)->size();
8307 jresult = (
unsigned long)result;
8313 unsigned long jresult ;
8314 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8315 std::vector< operations_research::DecisionBuilder * >::size_type result;
8317 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8318 result = ((std::vector< operations_research::DecisionBuilder * >
const *)arg1)->capacity();
8319 jresult = (
unsigned long)result;
8325 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8326 std::vector< operations_research::DecisionBuilder * >::size_type arg2 ;
8328 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8329 arg2 = (std::vector< operations_research::DecisionBuilder * >::size_type)jarg2;
8330 (arg1)->reserve(arg2);
8336 std::vector< operations_research::DecisionBuilder * > *result = 0 ;
8338 result = (std::vector< operations_research::DecisionBuilder * > *)
new std::vector< operations_research::DecisionBuilder * >();
8339 jresult = (
void *)result;
8346 std::vector< operations_research::DecisionBuilder * > *arg1 = 0 ;
8347 std::vector< operations_research::DecisionBuilder * > *result = 0 ;
8349 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8354 result = (std::vector< operations_research::DecisionBuilder * > *)
new std::vector< operations_research::DecisionBuilder * >((std::vector< operations_research::DecisionBuilder * >
const &)*arg1);
8355 jresult = (
void *)result;
8363 std::vector< operations_research::DecisionBuilder * > *result = 0 ;
8368 }
catch(std::out_of_range &_e) {
8372 jresult = (
void *)result;
8379 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8383 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8387 }
catch(std::out_of_range &_e) {
8391 jresult = (
void *)result;
8398 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8400 std::vector< operations_research::DecisionBuilder * >::value_type *result = 0 ;
8402 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8406 }
catch(std::out_of_range &_e) {
8410 jresult = (
void *)*result;
8416 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8421 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8427 }
catch(std::out_of_range &_e) {
8435 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8436 std::vector< operations_research::DecisionBuilder * > *arg2 = 0 ;
8438 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8439 arg2 = (std::vector< operations_research::DecisionBuilder * > *)jarg2;
8450 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8453 std::vector< operations_research::DecisionBuilder * > *result = 0 ;
8455 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8460 }
catch(std::out_of_range &_e) {
8463 }
catch(std::invalid_argument &_e) {
8467 jresult = (
void *)result;
8473 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8478 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8484 }
catch(std::out_of_range &_e) {
8492 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8494 std::vector< operations_research::DecisionBuilder * > *arg3 = 0 ;
8496 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8498 arg3 = (std::vector< operations_research::DecisionBuilder * > *)jarg3;
8505 }
catch(std::out_of_range &_e) {
8513 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8516 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8520 }
catch(std::out_of_range &_e) {
8528 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8532 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8537 }
catch(std::out_of_range &_e) {
8540 }
catch(std::invalid_argument &_e) {
8552 std::vector< operations_research::DecisionBuilder * > *result = 0 ;
8559 }
catch(std::out_of_range &_e) {
8563 jresult = (
void *)result;
8569 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8571 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8577 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8581 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8586 }
catch(std::out_of_range &_e) {
8589 }
catch(std::invalid_argument &_e) {
8597 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8599 std::vector< operations_research::DecisionBuilder * > *arg3 = 0 ;
8601 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8603 arg3 = (std::vector< operations_research::DecisionBuilder * > *)jarg3;
8610 }
catch(std::out_of_range &_e) {
8618 unsigned int jresult ;
8619 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8624 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8635 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8640 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8651 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8656 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8666 unsigned int jresult ;
8667 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8672 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8682 std::vector< operations_research::DecisionBuilder * > *arg1 = (std::vector< operations_research::DecisionBuilder * > *) 0 ;
8684 arg1 = (std::vector< operations_research::DecisionBuilder * > *)jarg1;
8690 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8692 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8698 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8702 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8710 unsigned long jresult ;
8711 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8712 std::vector< operations_research::IntervalVar * >::size_type result;
8714 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8715 result = ((std::vector< operations_research::IntervalVar * >
const *)arg1)->size();
8716 jresult = (
unsigned long)result;
8722 unsigned long jresult ;
8723 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8724 std::vector< operations_research::IntervalVar * >::size_type result;
8726 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8727 result = ((std::vector< operations_research::IntervalVar * >
const *)arg1)->capacity();
8728 jresult = (
unsigned long)result;
8734 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8735 std::vector< operations_research::IntervalVar * >::size_type arg2 ;
8737 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8738 arg2 = (std::vector< operations_research::IntervalVar * >::size_type)jarg2;
8739 (arg1)->reserve(arg2);
8745 std::vector< operations_research::IntervalVar * > *result = 0 ;
8747 result = (std::vector< operations_research::IntervalVar * > *)
new std::vector< operations_research::IntervalVar * >();
8748 jresult = (
void *)result;
8755 std::vector< operations_research::IntervalVar * > *arg1 = 0 ;
8756 std::vector< operations_research::IntervalVar * > *result = 0 ;
8758 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8763 result = (std::vector< operations_research::IntervalVar * > *)
new std::vector< operations_research::IntervalVar * >((std::vector< operations_research::IntervalVar * >
const &)*arg1);
8764 jresult = (
void *)result;
8772 std::vector< operations_research::IntervalVar * > *result = 0 ;
8777 }
catch(std::out_of_range &_e) {
8781 jresult = (
void *)result;
8788 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8792 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8796 }
catch(std::out_of_range &_e) {
8800 jresult = (
void *)result;
8807 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8809 std::vector< operations_research::IntervalVar * >::value_type *result = 0 ;
8811 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8815 }
catch(std::out_of_range &_e) {
8819 jresult = (
void *)*result;
8825 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8830 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8836 }
catch(std::out_of_range &_e) {
8844 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8845 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
8847 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8848 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
8859 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8862 std::vector< operations_research::IntervalVar * > *result = 0 ;
8864 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8869 }
catch(std::out_of_range &_e) {
8872 }
catch(std::invalid_argument &_e) {
8876 jresult = (
void *)result;
8882 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8887 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8893 }
catch(std::out_of_range &_e) {
8901 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8903 std::vector< operations_research::IntervalVar * > *arg3 = 0 ;
8905 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8907 arg3 = (std::vector< operations_research::IntervalVar * > *)jarg3;
8914 }
catch(std::out_of_range &_e) {
8922 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8925 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8929 }
catch(std::out_of_range &_e) {
8937 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8941 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8946 }
catch(std::out_of_range &_e) {
8949 }
catch(std::invalid_argument &_e) {
8961 std::vector< operations_research::IntervalVar * > *result = 0 ;
8968 }
catch(std::out_of_range &_e) {
8972 jresult = (
void *)result;
8978 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8980 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8986 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
8990 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
8995 }
catch(std::out_of_range &_e) {
8998 }
catch(std::invalid_argument &_e) {
9006 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9008 std::vector< operations_research::IntervalVar * > *arg3 = 0 ;
9010 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9012 arg3 = (std::vector< operations_research::IntervalVar * > *)jarg3;
9019 }
catch(std::out_of_range &_e) {
9027 unsigned int jresult ;
9028 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9033 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9044 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9049 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9060 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9065 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9075 unsigned int jresult ;
9076 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9081 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9091 std::vector< operations_research::IntervalVar * > *arg1 = (std::vector< operations_research::IntervalVar * > *) 0 ;
9093 arg1 = (std::vector< operations_research::IntervalVar * > *)jarg1;
9099 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9101 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9107 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9111 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9119 unsigned long jresult ;
9120 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9121 std::vector< operations_research::SequenceVar * >::size_type result;
9123 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9124 result = ((std::vector< operations_research::SequenceVar * >
const *)arg1)->size();
9125 jresult = (
unsigned long)result;
9131 unsigned long jresult ;
9132 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9133 std::vector< operations_research::SequenceVar * >::size_type result;
9135 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9136 result = ((std::vector< operations_research::SequenceVar * >
const *)arg1)->capacity();
9137 jresult = (
unsigned long)result;
9143 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9144 std::vector< operations_research::SequenceVar * >::size_type arg2 ;
9146 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9147 arg2 = (std::vector< operations_research::SequenceVar * >::size_type)jarg2;
9148 (arg1)->reserve(arg2);
9154 std::vector< operations_research::SequenceVar * > *result = 0 ;
9156 result = (std::vector< operations_research::SequenceVar * > *)
new std::vector< operations_research::SequenceVar * >();
9157 jresult = (
void *)result;
9164 std::vector< operations_research::SequenceVar * > *arg1 = 0 ;
9165 std::vector< operations_research::SequenceVar * > *result = 0 ;
9167 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9172 result = (std::vector< operations_research::SequenceVar * > *)
new std::vector< operations_research::SequenceVar * >((std::vector< operations_research::SequenceVar * >
const &)*arg1);
9173 jresult = (
void *)result;
9181 std::vector< operations_research::SequenceVar * > *result = 0 ;
9186 }
catch(std::out_of_range &_e) {
9190 jresult = (
void *)result;
9197 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9201 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9205 }
catch(std::out_of_range &_e) {
9209 jresult = (
void *)result;
9216 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9218 std::vector< operations_research::SequenceVar * >::value_type *result = 0 ;
9220 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9224 }
catch(std::out_of_range &_e) {
9228 jresult = (
void *)*result;
9234 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9239 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9245 }
catch(std::out_of_range &_e) {
9253 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9254 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
9256 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9257 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
9268 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9271 std::vector< operations_research::SequenceVar * > *result = 0 ;
9273 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9278 }
catch(std::out_of_range &_e) {
9281 }
catch(std::invalid_argument &_e) {
9285 jresult = (
void *)result;
9291 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9296 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9302 }
catch(std::out_of_range &_e) {
9310 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9312 std::vector< operations_research::SequenceVar * > *arg3 = 0 ;
9314 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9316 arg3 = (std::vector< operations_research::SequenceVar * > *)jarg3;
9323 }
catch(std::out_of_range &_e) {
9331 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9334 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9338 }
catch(std::out_of_range &_e) {
9346 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9350 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9355 }
catch(std::out_of_range &_e) {
9358 }
catch(std::invalid_argument &_e) {
9370 std::vector< operations_research::SequenceVar * > *result = 0 ;
9377 }
catch(std::out_of_range &_e) {
9381 jresult = (
void *)result;
9387 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9389 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9395 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9399 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9404 }
catch(std::out_of_range &_e) {
9407 }
catch(std::invalid_argument &_e) {
9415 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9417 std::vector< operations_research::SequenceVar * > *arg3 = 0 ;
9419 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9421 arg3 = (std::vector< operations_research::SequenceVar * > *)jarg3;
9428 }
catch(std::out_of_range &_e) {
9436 unsigned int jresult ;
9437 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9442 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9453 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9458 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9469 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9474 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9484 unsigned int jresult ;
9485 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9490 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9500 std::vector< operations_research::SequenceVar * > *arg1 = (std::vector< operations_research::SequenceVar * > *) 0 ;
9502 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
9508 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9510 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9516 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9520 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9528 unsigned long jresult ;
9529 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9530 std::vector< operations_research::LocalSearchOperator * >::size_type result;
9532 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9533 result = ((std::vector< operations_research::LocalSearchOperator * >
const *)arg1)->size();
9534 jresult = (
unsigned long)result;
9540 unsigned long jresult ;
9541 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9542 std::vector< operations_research::LocalSearchOperator * >::size_type result;
9544 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9545 result = ((std::vector< operations_research::LocalSearchOperator * >
const *)arg1)->capacity();
9546 jresult = (
unsigned long)result;
9552 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9553 std::vector< operations_research::LocalSearchOperator * >::size_type arg2 ;
9555 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9556 arg2 = (std::vector< operations_research::LocalSearchOperator * >::size_type)jarg2;
9557 (arg1)->reserve(arg2);
9563 std::vector< operations_research::LocalSearchOperator * > *result = 0 ;
9565 result = (std::vector< operations_research::LocalSearchOperator * > *)
new std::vector< operations_research::LocalSearchOperator * >();
9566 jresult = (
void *)result;
9573 std::vector< operations_research::LocalSearchOperator * > *arg1 = 0 ;
9574 std::vector< operations_research::LocalSearchOperator * > *result = 0 ;
9576 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9581 result = (std::vector< operations_research::LocalSearchOperator * > *)
new std::vector< operations_research::LocalSearchOperator * >((std::vector< operations_research::LocalSearchOperator * >
const &)*arg1);
9582 jresult = (
void *)result;
9590 std::vector< operations_research::LocalSearchOperator * > *result = 0 ;
9595 }
catch(std::out_of_range &_e) {
9599 jresult = (
void *)result;
9606 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9610 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9614 }
catch(std::out_of_range &_e) {
9618 jresult = (
void *)result;
9625 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9627 std::vector< operations_research::LocalSearchOperator * >::value_type *result = 0 ;
9629 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9633 }
catch(std::out_of_range &_e) {
9637 jresult = (
void *)*result;
9643 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9648 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9654 }
catch(std::out_of_range &_e) {
9662 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9663 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
9665 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9666 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
9677 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9680 std::vector< operations_research::LocalSearchOperator * > *result = 0 ;
9682 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9687 }
catch(std::out_of_range &_e) {
9690 }
catch(std::invalid_argument &_e) {
9694 jresult = (
void *)result;
9700 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9705 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9711 }
catch(std::out_of_range &_e) {
9719 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9721 std::vector< operations_research::LocalSearchOperator * > *arg3 = 0 ;
9723 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9725 arg3 = (std::vector< operations_research::LocalSearchOperator * > *)jarg3;
9732 }
catch(std::out_of_range &_e) {
9740 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9743 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9747 }
catch(std::out_of_range &_e) {
9755 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9759 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9764 }
catch(std::out_of_range &_e) {
9767 }
catch(std::invalid_argument &_e) {
9779 std::vector< operations_research::LocalSearchOperator * > *result = 0 ;
9786 }
catch(std::out_of_range &_e) {
9790 jresult = (
void *)result;
9796 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9798 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9804 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9808 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9813 }
catch(std::out_of_range &_e) {
9816 }
catch(std::invalid_argument &_e) {
9824 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9826 std::vector< operations_research::LocalSearchOperator * > *arg3 = 0 ;
9828 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9830 arg3 = (std::vector< operations_research::LocalSearchOperator * > *)jarg3;
9837 }
catch(std::out_of_range &_e) {
9845 unsigned int jresult ;
9846 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9851 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9862 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9867 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9878 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9883 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9893 unsigned int jresult ;
9894 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9899 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9909 std::vector< operations_research::LocalSearchOperator * > *arg1 = (std::vector< operations_research::LocalSearchOperator * > *) 0 ;
9911 arg1 = (std::vector< operations_research::LocalSearchOperator * > *)jarg1;
9917 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
9919 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9925 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
9929 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9937 unsigned long jresult ;
9938 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
9939 std::vector< operations_research::LocalSearchFilter * >::size_type result;
9941 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9942 result = ((std::vector< operations_research::LocalSearchFilter * >
const *)arg1)->size();
9943 jresult = (
unsigned long)result;
9949 unsigned long jresult ;
9950 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
9951 std::vector< operations_research::LocalSearchFilter * >::size_type result;
9953 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9954 result = ((std::vector< operations_research::LocalSearchFilter * >
const *)arg1)->capacity();
9955 jresult = (
unsigned long)result;
9961 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
9962 std::vector< operations_research::LocalSearchFilter * >::size_type arg2 ;
9964 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9965 arg2 = (std::vector< operations_research::LocalSearchFilter * >::size_type)jarg2;
9966 (arg1)->reserve(arg2);
9972 std::vector< operations_research::LocalSearchFilter * > *result = 0 ;
9974 result = (std::vector< operations_research::LocalSearchFilter * > *)
new std::vector< operations_research::LocalSearchFilter * >();
9975 jresult = (
void *)result;
9982 std::vector< operations_research::LocalSearchFilter * > *arg1 = 0 ;
9983 std::vector< operations_research::LocalSearchFilter * > *result = 0 ;
9985 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
9990 result = (std::vector< operations_research::LocalSearchFilter * > *)
new std::vector< operations_research::LocalSearchFilter * >((std::vector< operations_research::LocalSearchFilter * >
const &)*arg1);
9991 jresult = (
void *)result;
9999 std::vector< operations_research::LocalSearchFilter * > *result = 0 ;
10004 }
catch(std::out_of_range &_e) {
10008 jresult = (
void *)result;
10015 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10019 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10023 }
catch(std::out_of_range &_e) {
10027 jresult = (
void *)result;
10034 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10036 std::vector< operations_research::LocalSearchFilter * >::value_type *result = 0 ;
10038 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10042 }
catch(std::out_of_range &_e) {
10046 jresult = (
void *)*result;
10052 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10057 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10063 }
catch(std::out_of_range &_e) {
10071 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10072 std::vector< operations_research::LocalSearchFilter * > *arg2 = 0 ;
10074 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10075 arg2 = (std::vector< operations_research::LocalSearchFilter * > *)jarg2;
10086 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10089 std::vector< operations_research::LocalSearchFilter * > *result = 0 ;
10091 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10096 }
catch(std::out_of_range &_e) {
10099 }
catch(std::invalid_argument &_e) {
10103 jresult = (
void *)result;
10109 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10114 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10120 }
catch(std::out_of_range &_e) {
10128 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10130 std::vector< operations_research::LocalSearchFilter * > *arg3 = 0 ;
10132 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10134 arg3 = (std::vector< operations_research::LocalSearchFilter * > *)jarg3;
10141 }
catch(std::out_of_range &_e) {
10149 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10152 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10156 }
catch(std::out_of_range &_e) {
10164 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10168 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10173 }
catch(std::out_of_range &_e) {
10176 }
catch(std::invalid_argument &_e) {
10188 std::vector< operations_research::LocalSearchFilter * > *result = 0 ;
10195 }
catch(std::out_of_range &_e) {
10199 jresult = (
void *)result;
10205 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10207 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10213 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10217 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10222 }
catch(std::out_of_range &_e) {
10225 }
catch(std::invalid_argument &_e) {
10233 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10235 std::vector< operations_research::LocalSearchFilter * > *arg3 = 0 ;
10237 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10239 arg3 = (std::vector< operations_research::LocalSearchFilter * > *)jarg3;
10246 }
catch(std::out_of_range &_e) {
10254 unsigned int jresult ;
10255 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10260 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10271 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10276 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10287 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10292 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10302 unsigned int jresult ;
10303 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10308 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10318 std::vector< operations_research::LocalSearchFilter * > *arg1 = (std::vector< operations_research::LocalSearchFilter * > *) 0 ;
10320 arg1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
10326 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10328 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10334 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10338 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10346 unsigned long jresult ;
10347 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10348 std::vector< operations_research::SymmetryBreaker * >::size_type result;
10350 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10351 result = ((std::vector< operations_research::SymmetryBreaker * >
const *)arg1)->size();
10352 jresult = (
unsigned long)result;
10358 unsigned long jresult ;
10359 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10360 std::vector< operations_research::SymmetryBreaker * >::size_type result;
10362 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10363 result = ((std::vector< operations_research::SymmetryBreaker * >
const *)arg1)->capacity();
10364 jresult = (
unsigned long)result;
10370 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10371 std::vector< operations_research::SymmetryBreaker * >::size_type arg2 ;
10373 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10374 arg2 = (std::vector< operations_research::SymmetryBreaker * >::size_type)jarg2;
10375 (arg1)->reserve(arg2);
10381 std::vector< operations_research::SymmetryBreaker * > *result = 0 ;
10383 result = (std::vector< operations_research::SymmetryBreaker * > *)
new std::vector< operations_research::SymmetryBreaker * >();
10384 jresult = (
void *)result;
10391 std::vector< operations_research::SymmetryBreaker * > *arg1 = 0 ;
10392 std::vector< operations_research::SymmetryBreaker * > *result = 0 ;
10394 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10399 result = (std::vector< operations_research::SymmetryBreaker * > *)
new std::vector< operations_research::SymmetryBreaker * >((std::vector< operations_research::SymmetryBreaker * >
const &)*arg1);
10400 jresult = (
void *)result;
10408 std::vector< operations_research::SymmetryBreaker * > *result = 0 ;
10413 }
catch(std::out_of_range &_e) {
10417 jresult = (
void *)result;
10424 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10428 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10432 }
catch(std::out_of_range &_e) {
10436 jresult = (
void *)result;
10443 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10445 std::vector< operations_research::SymmetryBreaker * >::value_type *result = 0 ;
10447 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10451 }
catch(std::out_of_range &_e) {
10455 jresult = (
void *)*result;
10461 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10466 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10472 }
catch(std::out_of_range &_e) {
10480 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10481 std::vector< operations_research::SymmetryBreaker * > *arg2 = 0 ;
10483 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10484 arg2 = (std::vector< operations_research::SymmetryBreaker * > *)jarg2;
10495 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10498 std::vector< operations_research::SymmetryBreaker * > *result = 0 ;
10500 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10505 }
catch(std::out_of_range &_e) {
10508 }
catch(std::invalid_argument &_e) {
10512 jresult = (
void *)result;
10518 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10523 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10529 }
catch(std::out_of_range &_e) {
10537 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10539 std::vector< operations_research::SymmetryBreaker * > *arg3 = 0 ;
10541 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10543 arg3 = (std::vector< operations_research::SymmetryBreaker * > *)jarg3;
10550 }
catch(std::out_of_range &_e) {
10558 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10561 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10565 }
catch(std::out_of_range &_e) {
10573 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10577 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10582 }
catch(std::out_of_range &_e) {
10585 }
catch(std::invalid_argument &_e) {
10597 std::vector< operations_research::SymmetryBreaker * > *result = 0 ;
10604 }
catch(std::out_of_range &_e) {
10608 jresult = (
void *)result;
10614 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10616 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10622 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10626 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10631 }
catch(std::out_of_range &_e) {
10634 }
catch(std::invalid_argument &_e) {
10642 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10644 std::vector< operations_research::SymmetryBreaker * > *arg3 = 0 ;
10646 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10648 arg3 = (std::vector< operations_research::SymmetryBreaker * > *)jarg3;
10655 }
catch(std::out_of_range &_e) {
10663 unsigned int jresult ;
10664 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10669 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10680 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10685 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10696 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10701 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10711 unsigned int jresult ;
10712 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10717 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10727 std::vector< operations_research::SymmetryBreaker * > *arg1 = (std::vector< operations_research::SymmetryBreaker * > *) 0 ;
10729 arg1 = (std::vector< operations_research::SymmetryBreaker * > *)jarg1;
10735 long long jresult ;
10749 jresult = (int)result;
10759 jresult = (int)result;
10769 jresult = (int)result;
10779 jresult = (int)result;
10789 jresult = (int)result;
10799 jresult = (int)result;
10809 jresult = (int)result;
10819 jresult = (int)result;
10830 if (arg1) (arg1)->var_selection_schema = arg2;
10841 jresult = (int)result;
10852 if (arg1) (arg1)->value_selection_schema = arg2;
10863 jresult = (int)result;
10874 if (arg1) (arg1)->initialization_splits = arg2;
10884 result = (int) ((arg1)->initialization_splits);
10895 arg2 = jarg2 ? true :
false;
10896 if (arg1) (arg1)->run_all_heuristics = arg2;
10901 unsigned int jresult ;
10906 result = (bool) ((arg1)->run_all_heuristics);
10918 if (arg1) (arg1)->heuristic_period = arg2;
10928 result = (int) ((arg1)->heuristic_period);
10940 if (arg1) (arg1)->heuristic_num_failures_limit = arg2;
10950 result = (int) ((arg1)->heuristic_num_failures_limit);
10961 arg2 = jarg2 ? true :
false;
10962 if (arg1) (arg1)->persistent_impact = arg2;
10967 unsigned int jresult ;
10972 result = (bool) ((arg1)->persistent_impact);
10984 if (arg1) (arg1)->random_seed = arg2;
10994 result = (int) ((arg1)->random_seed);
11006 if (arg1) (arg1)->display_level = arg2;
11017 jresult = (int)result;
11027 arg2 = jarg2 ? true :
false;
11028 if (arg1) (arg1)->use_last_conflict = arg2;
11033 unsigned int jresult ;
11038 result = (bool) ((arg1)->use_last_conflict);
11050 if (arg1) (arg1)->decision_builder = arg2;
11061 jresult = (
void *)result;
11071 jresult = (
void *)result;
11089 jresult = (
void *)result;
11105 jresult = (
void *)result;
11116 if (arg1) (arg1)->variable = arg2;
11127 jresult = (
void *)result;
11138 if (arg1) (arg1)->expression = arg2;
11149 jresult = (
void *)result;
11160 if (arg1) (arg1)->maintainer = arg2;
11171 jresult = (
void *)result;
11199 jresult = (int)result;
11209 jresult = (int)result;
11219 jresult = (int)result;
11229 jresult = (int)result;
11239 jresult = (int)result;
11249 jresult = (int)result;
11259 jresult = (int)result;
11269 jresult = (int)result;
11279 jresult = (int)result;
11289 jresult = (int)result;
11299 jresult = (int)result;
11309 jresult = (int)result;
11319 jresult = (int)result;
11329 jresult = (int)result;
11339 jresult = (int)result;
11349 jresult = (int)result;
11359 jresult = (int)result;
11369 jresult = (int)result;
11379 jresult = (int)result;
11389 jresult = (int)result;
11399 jresult = (int)result;
11409 jresult = (int)result;
11419 jresult = (int)result;
11429 jresult = (int)result;
11439 jresult = (int)result;
11449 jresult = (int)result;
11459 jresult = (int)result;
11469 jresult = (int)result;
11479 jresult = (int)result;
11489 jresult = (int)result;
11499 jresult = (int)result;
11509 jresult = (int)result;
11519 jresult = (int)result;
11529 jresult = (int)result;
11539 jresult = (int)result;
11549 jresult = (int)result;
11559 jresult = (int)result;
11569 jresult = (int)result;
11579 jresult = (int)result;
11589 jresult = (int)result;
11599 jresult = (int)result;
11609 jresult = (int)result;
11619 jresult = (int)result;
11629 jresult = (int)result;
11639 jresult = (int)result;
11649 jresult = (int)result;
11659 jresult = (int)result;
11669 jresult = (int)result;
11679 jresult = (int)result;
11689 jresult = (int)result;
11699 jresult = (int)result;
11709 jresult = (int)result;
11719 jresult = (int)result;
11729 jresult = (int)result;
11739 jresult = (int)result;
11749 jresult = (int)result;
11759 jresult = (int)result;
11769 jresult = (int)result;
11779 jresult = (int)result;
11789 jresult = (int)result;
11799 jresult = (int)result;
11809 jresult = (int)result;
11819 jresult = (int)result;
11829 jresult = (int)result;
11839 jresult = (int)result;
11849 jresult = (int)result;
11859 jresult = (int)result;
11869 jresult = (int)result;
11879 jresult = (int)result;
11889 jresult = (int)result;
11899 jresult = (int)result;
11909 jresult = (int)result;
11919 jresult = (int)result;
11929 jresult = (int)result;
11939 jresult = (int)result;
11949 jresult = (int)result;
11959 jresult = (int)result;
11969 jresult = (int)result;
11979 jresult = (int)result;
11989 jresult = (int)result;
11999 jresult = (int)result;
12009 jresult = (int)result;
12019 jresult = (int)result;
12029 jresult = (int)result;
12039 jresult = (int)result;
12049 jresult = (int)result;
12059 jresult = (int)result;
12069 jresult = (int)result;
12079 jresult = (int)result;
12089 jresult = (int)result;
12099 jresult = (int)result;
12109 jresult = (int)result;
12116 std::string *arg1 = 0 ;
12123 std::string arg1_str(jarg1);
12126 jresult = (
void *)result;
12133 std::string *arg1 = 0 ;
12141 std::string arg1_str(jarg1);
12145 bool parsed_ok = arg2->ParseFromArray(jarg2, parameters_size);
12149 "Unable to parse operations_research::ConstraintSolverParameters protocol message.");
12153 jresult = (
void *)result;
12177 const long size = (&result)->ByteSizeLong();
12178 jresult =
new uint8[size + 4];
12179 (&result)->SerializeWithCachedSizesToArray(jresult + 4);
12180 jresult[0] = size & 0xFF;
12181 jresult[1] = (size >> 8) & 0xFF;
12182 jresult[2] = (size >> 16) & 0xFF;
12183 jresult[3] = (size >> 24) & 0xFF;
12195 const long size = (&result)->ByteSizeLong();
12196 jresult =
new uint8[size + 4];
12197 (&result)->SerializeWithCachedSizesToArray(jresult + 4);
12198 jresult[0] = size & 0xFF;
12199 jresult[1] = (size >> 8) & 0xFF;
12200 jresult[2] = (size >> 16) & 0xFF;
12201 jresult[3] = (size >> 24) & 0xFF;
12220 (arg1)->AddConstraint(arg2);
12241 (arg1)->AddCastConstraint(arg2,arg3,arg4);
12246 unsigned int jresult ;
12249 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
12254 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
12259 result = (bool)(arg1)->Solve(arg2,(std::vector< operations_research::SearchMonitor * >
const &)*arg3);
12266 unsigned int jresult ;
12273 result = (bool)(arg1)->Solve(arg2);
12280 unsigned int jresult ;
12289 result = (bool)(arg1)->Solve(arg2,arg3);
12296 unsigned int jresult ;
12307 result = (bool)(arg1)->Solve(arg2,arg3,arg4);
12314 unsigned int jresult ;
12327 result = (bool)(arg1)->Solve(arg2,arg3,arg4,arg5);
12334 unsigned int jresult ;
12349 result = (bool)(arg1)->Solve(arg2,arg3,arg4,arg5,arg6);
12358 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
12362 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
12367 (arg1)->NewSearch(arg2,(std::vector< operations_research::SearchMonitor * >
const &)*arg3);
12377 (arg1)->NewSearch(arg2);
12389 (arg1)->NewSearch(arg2,arg3);
12403 (arg1)->NewSearch(arg2,arg3,arg4);
12419 (arg1)->NewSearch(arg2,arg3,arg4,arg5);
12437 (arg1)->NewSearch(arg2,arg3,arg4,arg5,arg6);
12442 unsigned int jresult ;
12457 (arg1)->RestartSearch();
12465 (arg1)->EndSearch();
12470 unsigned int jresult ;
12473 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
12478 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
12483 result = (bool)(arg1)->SolveAndCommit(arg2,(std::vector< operations_research::SearchMonitor * >
const &)*arg3);
12490 unsigned int jresult ;
12497 result = (bool)(arg1)->SolveAndCommit(arg2);
12504 unsigned int jresult ;
12513 result = (bool)(arg1)->SolveAndCommit(arg2,arg3);
12520 unsigned int jresult ;
12531 result = (bool)(arg1)->SolveAndCommit(arg2,arg3,arg4);
12538 unsigned int jresult ;
12551 result = (bool)(arg1)->SolveAndCommit(arg2,arg3,arg4,arg5);
12558 unsigned int jresult ;
12565 result = (bool)(arg1)->CheckAssignment(arg2);
12572 unsigned int jresult ;
12579 result = (bool)(arg1)->CheckConstraint(arg2);
12592 jresult = (int)result;
12622 std::string result;
12632 long long jresult ;
12642 long long jresult ;
12654 long long jresult ;
12666 long long jresult ;
12678 long long jresult ;
12690 long long jresult ;
12704 long long jresult ;
12716 long long jresult ;
12728 long long jresult ;
12740 long long jresult ;
12752 unsigned long long jresult ;
12764 unsigned long long jresult ;
12781 (arg1)->set_optimization_direction(arg2);
12790 std::string *arg4 = 0 ;
12794 arg2 = (
int64)jarg2;
12795 arg3 = (
int64)jarg3;
12800 std::string arg4_str(jarg4);
12803 jresult = (
void *)result;
12811 std::vector< int64 > *arg2 = 0 ;
12812 std::string *arg3 = 0 ;
12817 arg2 =
new std::vector<int64>;
12818 arg2->reserve(length2);
12819 for(
int i = 0; i < length2; ++i) {
12820 arg2->emplace_back(jarg2[i]);
12827 std::string arg3_str(jarg3);
12830 jresult = (
void *)result;
12841 std::vector< int > *arg2 = 0 ;
12842 std::string *arg3 = 0 ;
12847 arg2 =
new std::vector<int>;
12848 arg2->reserve(length2);
12849 for(
int i = 0; i < length2; ++i) {
12850 arg2->emplace_back(jarg2[i]);
12857 std::string arg3_str(jarg3);
12860 jresult = (
void *)result;
12876 arg2 = (
int64)jarg2;
12877 arg3 = (
int64)jarg3;
12879 jresult = (
void *)result;
12887 std::vector< int64 > *arg2 = 0 ;
12892 arg2 =
new std::vector<int64>;
12893 arg2->reserve(length2);
12894 for(
int i = 0; i < length2; ++i) {
12895 arg2->emplace_back(jarg2[i]);
12899 jresult = (
void *)result;
12910 std::vector< int > *arg2 = 0 ;
12915 arg2 =
new std::vector<int>;
12916 arg2->reserve(length2);
12917 for(
int i = 0; i < length2; ++i) {
12918 arg2->emplace_back(jarg2[i]);
12922 jresult = (
void *)result;
12933 std::string *arg2 = 0 ;
12941 std::string arg2_str(jarg2);
12944 jresult = (
void *)result;
12956 jresult = (
void *)result;
12965 std::string *arg3 = 0 ;
12969 arg2 = (
int64)jarg2;
12974 std::string arg3_str(jarg3);
12977 jresult = (
void *)result;
12989 arg2 = (
int64)jarg2;
12991 jresult = (
void *)result;
13007 jresult = (
void *)result;
13021 arg3 = (
int64)jarg3;
13023 jresult = (
void *)result;
13031 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13035 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13041 jresult = (
void *)result;
13049 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13050 std::vector< int64 > *arg3 = 0 ;
13054 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13060 arg3 =
new std::vector<int64>;
13061 arg3->reserve(length3);
13062 for(
int i = 0; i < length3; ++i) {
13063 arg3->emplace_back(jarg3[i]);
13066 result = (
operations_research::IntExpr *)(arg1)->MakeScalProd((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3);
13067 jresult = (
void *)result;
13078 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13079 std::vector< int > *arg3 = 0 ;
13083 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13089 arg3 =
new std::vector<int>;
13090 arg3->reserve(length3);
13091 for(
int i = 0; i < length3; ++i) {
13092 arg3->emplace_back(jarg3[i]);
13095 result = (
operations_research::IntExpr *)(arg1)->MakeScalProd((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3);
13096 jresult = (
void *)result;
13115 jresult = (
void *)result;
13128 arg2 = (
int64)jarg2;
13131 jresult = (
void *)result;
13145 jresult = (
void *)result;
13161 jresult = (
void *)result;
13175 arg3 = (
int64)jarg3;
13177 jresult = (
void *)result;
13191 arg3 = (
int64)jarg3;
13193 jresult = (
void *)result;
13209 jresult = (
void *)result;
13223 jresult = (
void *)result;
13237 jresult = (
void *)result;
13251 arg3 = (
int64)jarg3;
13253 jresult = (
void *)result;
13261 std::vector< int64 > *arg2 = 0 ;
13267 arg2 =
new std::vector<int64>;
13268 arg2->reserve(length2);
13269 for(
int i = 0; i < length2; ++i) {
13270 arg2->emplace_back(jarg2[i]);
13275 jresult = (
void *)result;
13286 std::vector< int > *arg2 = 0 ;
13292 arg2 =
new std::vector<int>;
13293 arg2->reserve(length2);
13294 for(
int i = 0; i < length2; ++i) {
13295 arg2->emplace_back(jarg2[i]);
13300 jresult = (
void *)result;
13323 jresult = (
void *)result;
13342 arg3 = jarg3 ? true :
false;
13345 jresult = (
void *)result;
13367 jresult = (
void *)result;
13375 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13380 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13387 jresult = (
void *)result;
13395 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13400 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13405 arg3 = (
int64)jarg3;
13406 result = (
operations_research::IntExpr *)(arg1)->MakeIndexExpression((std::vector< operations_research::IntVar * >
const &)*arg2,arg3);
13407 jresult = (
void *)result;
13427 jresult = (
void *)result;
13435 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13439 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13445 jresult = (
void *)result;
13461 jresult = (
void *)result;
13475 arg3 = (
int64)jarg3;
13477 jresult = (
void *)result;
13493 jresult = (
void *)result;
13501 std::vector< operations_research::IntVar * > *arg2 = 0 ;
13505 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
13511 jresult = (
void *)result;
13527 jresult = (
void *)result;
13541 arg3 = (
int64)jarg3;
13543 jresult = (
void *)result;
13559 jresult = (
void *)result;
13576 arg3 = (
int64)jarg3;
13577 arg4 = (
int64)jarg4;
13578 arg5 = (
int64)jarg5;
13579 arg6 = (
int64)jarg6;
13581 jresult = (
void *)result;
13596 arg3 = (
int64)jarg3;
13597 arg4 = (
int64)jarg4;
13599 jresult = (
void *)result;
13613 arg3 = (
int64)jarg3;
13615 jresult = (
void *)result;
13631 jresult = (
void *)result;
13647 arg4 = (
int64)jarg4;
13649 jresult = (
void *)result;
13661 jresult = (
void *)result;
13673 jresult = (
void *)result;
13681 std::string *arg2 = 0 ;
13689 std::string arg2_str(jarg2);
13692 jresult = (
void *)result;
13707 arg3 = (
int64)jarg3;
13710 jresult = (
void *)result;
13724 arg3 = (
int64)jarg3;
13726 jresult = (
void *)result;
13744 jresult = (
void *)result;
13760 jresult = (
void *)result;
13776 jresult = (
void *)result;
13790 arg3 = (
int64)jarg3;
13792 jresult = (
void *)result;
13808 jresult = (
void *)result;
13823 arg3 = (
int64)jarg3;
13826 jresult = (
void *)result;
13840 arg3 = (
int64)jarg3;
13842 jresult = (
void *)result;
13858 jresult = (
void *)result;
13876 jresult = (
void *)result;
13892 jresult = (
void *)result;
13906 arg3 = (
int64)jarg3;
13908 jresult = (
void *)result;
13924 jresult = (
void *)result;
13939 arg3 = (
int64)jarg3;
13942 jresult = (
void *)result;
13956 arg3 = (
int64)jarg3;
13958 jresult = (
void *)result;
13974 jresult = (
void *)result;
13992 jresult = (
void *)result;
14008 jresult = (
void *)result;
14022 arg3 = (
int64)jarg3;
14024 jresult = (
void *)result;
14040 jresult = (
void *)result;
14055 arg3 = (
int64)jarg3;
14058 jresult = (
void *)result;
14072 arg3 = (
int64)jarg3;
14074 jresult = (
void *)result;
14090 jresult = (
void *)result;
14108 jresult = (
void *)result;
14124 jresult = (
void *)result;
14138 arg3 = (
int64)jarg3;
14140 jresult = (
void *)result;
14156 jresult = (
void *)result;
14171 arg3 = (
int64)jarg3;
14174 jresult = (
void *)result;
14188 arg3 = (
int64)jarg3;
14190 jresult = (
void *)result;
14206 jresult = (
void *)result;
14224 jresult = (
void *)result;
14240 jresult = (
void *)result;
14254 arg3 = (
int64)jarg3;
14256 jresult = (
void *)result;
14272 jresult = (
void *)result;
14287 arg3 = (
int64)jarg3;
14290 jresult = (
void *)result;
14304 arg3 = (
int64)jarg3;
14306 jresult = (
void *)result;
14322 jresult = (
void *)result;
14340 jresult = (
void *)result;
14356 jresult = (
void *)result;
14370 arg3 = (
int64)jarg3;
14372 jresult = (
void *)result;
14388 jresult = (
void *)result;
14396 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14401 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14406 arg3 = (
int64)jarg3;
14408 jresult = (
void *)result;
14416 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14421 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14426 arg3 = (
int64)jarg3;
14428 jresult = (
void *)result;
14436 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14441 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14446 arg3 = (
int64)jarg3;
14448 jresult = (
void *)result;
14456 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14461 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14468 jresult = (
void *)result;
14476 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14477 std::vector< int64 > *arg3 = 0 ;
14482 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14488 arg3 =
new std::vector<int64>;
14489 arg3->reserve(length3);
14490 for(
int i = 0; i < length3; ++i) {
14491 arg3->emplace_back(jarg3[i]);
14494 arg4 = (
int64)jarg4;
14495 result = (
operations_research::Constraint *)(arg1)->MakeScalProdEquality((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
14496 jresult = (
void *)result;
14507 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14508 std::vector< int > *arg3 = 0 ;
14513 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14519 arg3 =
new std::vector<int>;
14520 arg3->reserve(length3);
14521 for(
int i = 0; i < length3; ++i) {
14522 arg3->emplace_back(jarg3[i]);
14525 arg4 = (
int64)jarg4;
14526 result = (
operations_research::Constraint *)(arg1)->MakeScalProdEquality((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
14527 jresult = (
void *)result;
14538 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14539 std::vector< int64 > *arg3 = 0 ;
14544 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14550 arg3 =
new std::vector<int64>;
14551 arg3->reserve(length3);
14552 for(
int i = 0; i < length3; ++i) {
14553 arg3->emplace_back(jarg3[i]);
14557 result = (
operations_research::Constraint *)(arg1)->MakeScalProdEquality((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
14558 jresult = (
void *)result;
14569 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14570 std::vector< int > *arg3 = 0 ;
14575 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14581 arg3 =
new std::vector<int>;
14582 arg3->reserve(length3);
14583 for(
int i = 0; i < length3; ++i) {
14584 arg3->emplace_back(jarg3[i]);
14588 result = (
operations_research::Constraint *)(arg1)->MakeScalProdEquality((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
14589 jresult = (
void *)result;
14600 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14601 std::vector< int64 > *arg3 = 0 ;
14606 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14612 arg3 =
new std::vector<int64>;
14613 arg3->reserve(length3);
14614 for(
int i = 0; i < length3; ++i) {
14615 arg3->emplace_back(jarg3[i]);
14618 arg4 = (
int64)jarg4;
14619 result = (
operations_research::Constraint *)(arg1)->MakeScalProdGreaterOrEqual((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
14620 jresult = (
void *)result;
14631 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14632 std::vector< int > *arg3 = 0 ;
14637 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14643 arg3 =
new std::vector<int>;
14644 arg3->reserve(length3);
14645 for(
int i = 0; i < length3; ++i) {
14646 arg3->emplace_back(jarg3[i]);
14649 arg4 = (
int64)jarg4;
14650 result = (
operations_research::Constraint *)(arg1)->MakeScalProdGreaterOrEqual((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
14651 jresult = (
void *)result;
14662 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14663 std::vector< int64 > *arg3 = 0 ;
14668 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14674 arg3 =
new std::vector<int64>;
14675 arg3->reserve(length3);
14676 for(
int i = 0; i < length3; ++i) {
14677 arg3->emplace_back(jarg3[i]);
14680 arg4 = (
int64)jarg4;
14681 result = (
operations_research::Constraint *)(arg1)->MakeScalProdLessOrEqual((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
14682 jresult = (
void *)result;
14693 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14694 std::vector< int > *arg3 = 0 ;
14699 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14705 arg3 =
new std::vector<int>;
14706 arg3->reserve(length3);
14707 for(
int i = 0; i < length3; ++i) {
14708 arg3->emplace_back(jarg3[i]);
14711 arg4 = (
int64)jarg4;
14712 result = (
operations_research::Constraint *)(arg1)->MakeScalProdLessOrEqual((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
14713 jresult = (
void *)result;
14724 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14729 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14736 jresult = (
void *)result;
14744 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14749 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14756 jresult = (
void *)result;
14764 std::vector< int64 > *arg2 = 0 ;
14771 arg2 =
new std::vector<int64>;
14772 arg2->reserve(length2);
14773 for(
int i = 0; i < length2; ++i) {
14774 arg2->emplace_back(jarg2[i]);
14780 jresult = (
void *)result;
14791 std::vector< int > *arg2 = 0 ;
14798 arg2 =
new std::vector<int>;
14799 arg2->reserve(length2);
14800 for(
int i = 0; i < length2; ++i) {
14801 arg2->emplace_back(jarg2[i]);
14807 jresult = (
void *)result;
14818 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14824 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14832 jresult = (
void *)result;
14840 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14846 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14852 arg4 = (
int64)jarg4;
14854 jresult = (
void *)result;
14870 jresult = (
void *)result;
14878 std::vector< operations_research::IntVar * > *arg2 = 0 ;
14884 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
14890 arg4 = (
int64)jarg4;
14892 jresult = (
void *)result;
14906 jresult = (
void *)result;
14920 jresult = (
void *)result;
14933 arg2 = [jarg2]() ->
void {
14934 return (*(
void(*)())jarg2)();
14938 jresult = (
void *)result;
14953 arg3 = (
int64)jarg3;
14954 arg4 = (
int64)jarg4;
14956 jresult = (
void *)result;
14971 arg3 = (
int64)jarg3;
14972 arg4 = (
int64)jarg4;
14974 jresult = (
void *)result;
14990 arg3 = (
int64)jarg3;
14991 arg4 = (
int64)jarg4;
14994 jresult = (
void *)result;
15009 arg3 = (
int64)jarg3;
15010 arg4 = (
int64)jarg4;
15012 jresult = (
void *)result;
15021 std::vector< int64 > *arg3 = 0 ;
15027 arg3 =
new std::vector<int64>;
15028 arg3->reserve(length3);
15029 for(
int i = 0; i < length3; ++i) {
15030 arg3->emplace_back(jarg3[i]);
15034 jresult = (
void *)result;
15046 std::vector< int > *arg3 = 0 ;
15052 arg3 =
new std::vector<int>;
15053 arg3->reserve(length3);
15054 for(
int i = 0; i < length3; ++i) {
15055 arg3->emplace_back(jarg3[i]);
15059 jresult = (
void *)result;
15071 std::vector< int64 > *arg3 = 0 ;
15077 arg3 =
new std::vector<int64>;
15078 arg3->reserve(length3);
15079 for(
int i = 0; i < length3; ++i) {
15080 arg3->emplace_back(jarg3[i]);
15084 jresult = (
void *)result;
15096 std::vector< int > *arg3 = 0 ;
15102 arg3 =
new std::vector<int>;
15103 arg3->reserve(length3);
15104 for(
int i = 0; i < length3; ++i) {
15105 arg3->emplace_back(jarg3[i]);
15109 jresult = (
void *)result;
15121 std::vector< int64 > arg3 ;
15122 std::vector< int64 > arg4 ;
15129 (&arg3)->reserve(length3);
15130 for(
int i = 0; i < length3; ++i) {
15131 (&arg3)->emplace_back(jarg3[i]);
15136 (&arg4)->reserve(length4);
15137 for(
int i = 0; i < length4; ++i) {
15138 (&arg4)->emplace_back(jarg4[i]);
15142 jresult = (
void *)result;
15151 std::vector< int > arg3 ;
15152 std::vector< int > arg4 ;
15159 (&arg3)->reserve(length3);
15160 for(
int i = 0; i < length3; ++i) {
15161 (&arg3)->emplace_back(jarg3[i]);
15166 (&arg4)->reserve(length4);
15167 for(
int i = 0; i < length4; ++i) {
15168 (&arg4)->emplace_back(jarg4[i]);
15172 jresult = (
void *)result;
15181 std::vector< int64 > *arg3 = 0 ;
15188 arg3 =
new std::vector<int64>;
15189 arg3->reserve(length3);
15190 for(
int i = 0; i < length3; ++i) {
15191 arg3->emplace_back(jarg3[i]);
15196 jresult = (
void *)result;
15208 std::vector< int > *arg3 = 0 ;
15215 arg3 =
new std::vector<int>;
15216 arg3->reserve(length3);
15217 for(
int i = 0; i < length3; ++i) {
15218 arg3->emplace_back(jarg3[i]);
15223 jresult = (
void *)result;
15235 std::vector< int64 > *arg3 = 0 ;
15241 arg3 =
new std::vector<int64>;
15242 arg3->reserve(length3);
15243 for(
int i = 0; i < length3; ++i) {
15244 arg3->emplace_back(jarg3[i]);
15248 jresult = (
void *)result;
15260 std::vector< int > *arg3 = 0 ;
15266 arg3 =
new std::vector<int>;
15267 arg3->reserve(length3);
15268 for(
int i = 0; i < length3; ++i) {
15269 arg3->emplace_back(jarg3[i]);
15273 jresult = (
void *)result;
15284 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15290 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15295 arg3 = (
int64)jarg3;
15296 arg4 = (
int64)jarg4;
15298 jresult = (
void *)result;
15306 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15312 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15317 arg3 = (
int64)jarg3;
15320 jresult = (
void *)result;
15328 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15329 std::vector< int64 > *arg3 = 0 ;
15330 std::vector< operations_research::IntVar * > *arg4 = 0 ;
15334 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15340 arg3 =
new std::vector<int64>;
15341 arg3->reserve(length3);
15342 for(
int i = 0; i < length3; ++i) {
15343 arg3->emplace_back(jarg3[i]);
15346 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
15351 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4);
15352 jresult = (
void *)result;
15363 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15364 std::vector< int > *arg3 = 0 ;
15365 std::vector< operations_research::IntVar * > *arg4 = 0 ;
15369 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15375 arg3 =
new std::vector<int>;
15376 arg3->reserve(length3);
15377 for(
int i = 0; i < length3; ++i) {
15378 arg3->emplace_back(jarg3[i]);
15381 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
15386 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4);
15387 jresult = (
void *)result;
15398 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15399 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15403 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15408 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15413 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15414 jresult = (
void *)result;
15422 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15429 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15434 arg3 = (
int64)jarg3;
15435 arg4 = (
int64)jarg4;
15436 arg5 = (
int64)jarg5;
15438 jresult = (
void *)result;
15446 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15447 std::vector< int64 > *arg3 = 0 ;
15448 std::vector< int64 > *arg4 = 0 ;
15452 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15458 arg3 =
new std::vector<int64>;
15459 arg3->reserve(length3);
15460 for(
int i = 0; i < length3; ++i) {
15461 arg3->emplace_back(jarg3[i]);
15465 arg4 =
new std::vector<int64>;
15466 arg4->reserve(length4);
15467 for(
int i = 0; i < length4; ++i) {
15468 arg4->emplace_back(jarg4[i]);
15471 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,(std::vector< int64 >
const &)*arg4);
15472 jresult = (
void *)result;
15486 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15487 std::vector< int > *arg3 = 0 ;
15488 std::vector< int > *arg4 = 0 ;
15492 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15498 arg3 =
new std::vector<int>;
15499 arg3->reserve(length3);
15500 for(
int i = 0; i < length3; ++i) {
15501 arg3->emplace_back(jarg3[i]);
15505 arg4 =
new std::vector<int>;
15506 arg4->reserve(length4);
15507 for(
int i = 0; i < length4; ++i) {
15508 arg4->emplace_back(jarg4[i]);
15511 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4);
15512 jresult = (
void *)result;
15526 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15527 std::vector< int64 > *arg3 = 0 ;
15528 std::vector< int64 > *arg4 = 0 ;
15529 std::vector< int64 > *arg5 = 0 ;
15533 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15539 arg3 =
new std::vector<int64>;
15540 arg3->reserve(length3);
15541 for(
int i = 0; i < length3; ++i) {
15542 arg3->emplace_back(jarg3[i]);
15546 arg4 =
new std::vector<int64>;
15547 arg4->reserve(length4);
15548 for(
int i = 0; i < length4; ++i) {
15549 arg4->emplace_back(jarg4[i]);
15553 arg5 =
new std::vector<int64>;
15554 arg5->reserve(length5);
15555 for(
int i = 0; i < length5; ++i) {
15556 arg5->emplace_back(jarg5[i]);
15559 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,(std::vector< int64 >
const &)*arg4,(std::vector< int64 >
const &)*arg5);
15560 jresult = (
void *)result;
15577 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15578 std::vector< int > *arg3 = 0 ;
15579 std::vector< int > *arg4 = 0 ;
15580 std::vector< int > *arg5 = 0 ;
15584 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15590 arg3 =
new std::vector<int>;
15591 arg3->reserve(length3);
15592 for(
int i = 0; i < length3; ++i) {
15593 arg3->emplace_back(jarg3[i]);
15597 arg4 =
new std::vector<int>;
15598 arg4->reserve(length4);
15599 for(
int i = 0; i < length4; ++i) {
15600 arg4->emplace_back(jarg4[i]);
15604 arg5 =
new std::vector<int>;
15605 arg5->reserve(length5);
15606 for(
int i = 0; i < length5; ++i) {
15607 arg5->emplace_back(jarg5[i]);
15610 result = (
operations_research::Constraint *)(arg1)->MakeDistribute((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4,(std::vector< int >
const &)*arg5);
15611 jresult = (
void *)result;
15628 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15634 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15640 arg4 = (
int64)jarg4;
15642 jresult = (
void *)result;
15650 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15654 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15660 jresult = (
void *)result;
15668 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15673 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15678 arg3 = jarg3 ? true :
false;
15680 jresult = (
void *)result;
15688 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15693 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15698 arg3 = (
int64)jarg3;
15700 jresult = (
void *)result;
15708 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15709 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15713 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15718 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15723 result = (
operations_research::Constraint *)(arg1)->MakeSortingConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15724 jresult = (
void *)result;
15732 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15733 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15737 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15742 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15747 result = (
operations_research::Constraint *)(arg1)->MakeLexicalLess((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15748 jresult = (
void *)result;
15756 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15757 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15761 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15766 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15771 result = (
operations_research::Constraint *)(arg1)->MakeLexicalLessOrEqual((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15772 jresult = (
void *)result;
15780 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15781 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15785 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15790 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15795 result = (
operations_research::Constraint *)(arg1)->MakeInversePermutationConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15796 jresult = (
void *)result;
15805 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15810 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15815 result = (
operations_research::Constraint *)(arg1)->MakeIndexOfFirstMaxValueConstraint(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15816 jresult = (
void *)result;
15825 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15830 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15835 result = (
operations_research::Constraint *)(arg1)->MakeIndexOfFirstMinValueConstraint(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15836 jresult = (
void *)result;
15844 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15845 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15849 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15854 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15859 result = (
operations_research::Constraint *)(arg1)->MakeNullIntersect((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15860 jresult = (
void *)result;
15868 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15869 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15874 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15879 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15884 arg4 = (
int64)jarg4;
15885 result = (
operations_research::Constraint *)(arg1)->MakeNullIntersectExcept((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4);
15886 jresult = (
void *)result;
15894 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15895 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15900 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15905 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15911 arg4 = [jarg4](
int64 t) ->
bool {
15912 return (*(
bool(*)(
int64))jarg4)(t);
15915 result = (
operations_research::Constraint *)(arg1)->MakeNoCycle((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4);
15916 jresult = (
void *)result;
15924 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15925 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15929 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15934 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15939 result = (
operations_research::Constraint *)(arg1)->MakeNoCycle((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
15940 jresult = (
void *)result;
15948 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15949 std::vector< operations_research::IntVar * > *arg3 = 0 ;
15955 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15960 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
15966 arg4 = [jarg4](
int64 t) ->
bool {
15967 return (*(
bool(*)(
int64))jarg4)(t);
15970 arg5 = jarg5 ? true :
false;
15971 result = (
operations_research::Constraint *)(arg1)->MakeNoCycle((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,arg5);
15972 jresult = (
void *)result;
15980 std::vector< operations_research::IntVar * > *arg2 = 0 ;
15984 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
15990 jresult = (
void *)result;
15998 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16002 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16008 jresult = (
void *)result;
16016 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16017 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16018 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16019 std::vector< operations_research::IntVar * > *arg5 = 0 ;
16023 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16028 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16033 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16038 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
16043 result = (
operations_research::Constraint *)(arg1)->MakePathCumul((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,(std::vector< operations_research::IntVar * >
const &)*arg5);
16044 jresult = (
void *)result;
16052 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16053 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16054 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16055 std::vector< operations_research::IntVar * > *arg5 = 0 ;
16059 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16064 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16069 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16074 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
16079 result = (
operations_research::Constraint *)(arg1)->MakeDelayedPathCumul((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,(std::vector< operations_research::IntVar * >
const &)*arg5);
16080 jresult = (
void *)result;
16088 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16089 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16090 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16095 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16100 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16105 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16115 result = (
operations_research::Constraint *)(arg1)->MakePathCumul((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,arg5);
16116 jresult = (
void *)result;
16124 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16125 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16126 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16127 std::vector< operations_research::IntVar * > *arg5 = 0 ;
16132 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16137 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16142 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16147 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
16157 result = (
operations_research::Constraint *)(arg1)->MakePathCumul((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,(std::vector< operations_research::IntVar * >
const &)*arg5,arg6);
16158 jresult = (
void *)result;
16166 std::vector< operations_research::IntVar * > arg2 ;
16167 std::vector< int64 > arg3 ;
16168 std::vector< int64 > arg4 ;
16169 std::vector< operations_research::IntVar * > arg5 ;
16170 std::vector< operations_research::IntVar * > *argp2 ;
16171 std::vector< operations_research::IntVar * > *argp5 ;
16175 argp2 = (std::vector< operations_research::IntVar * > *)jarg2;
16183 (&arg3)->reserve(length3);
16184 for(
int i = 0; i < length3; ++i) {
16185 (&arg3)->emplace_back(jarg3[i]);
16190 (&arg4)->reserve(length4);
16191 for(
int i = 0; i < length4; ++i) {
16192 (&arg4)->emplace_back(jarg4[i]);
16195 argp5 = (std::vector< operations_research::IntVar * > *)jarg5;
16202 jresult = (
void *)result;
16211 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16216 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16222 jresult = (
void *)result;
16230 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16235 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16246 jresult = (
void *)result;
16254 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16257 std::vector< int64 > *arg5 = 0 ;
16261 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16271 arg4 = (
int64)jarg4;
16273 arg5 =
new std::vector<int64>;
16274 arg5->reserve(length5);
16275 for(
int i = 0; i < length5; ++i) {
16276 arg5->emplace_back(jarg5[i]);
16280 jresult = (
void *)result;
16291 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16294 std::vector< int > *arg5 = 0 ;
16298 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16308 arg4 = (
int64)jarg4;
16310 arg5 =
new std::vector<int>;
16311 arg5->reserve(length5);
16312 for(
int i = 0; i < length5; ++i) {
16313 arg5->emplace_back(jarg5[i]);
16317 jresult = (
void *)result;
16328 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16329 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16330 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16331 std::vector< operations_research::IntVar * > *arg5 = 0 ;
16335 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16340 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16345 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16350 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
16355 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,(std::vector< operations_research::IntVar * >
const &)*arg5);
16356 jresult = (
void *)result;
16364 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16365 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16366 std::vector< int64 > *arg4 = 0 ;
16367 std::vector< int64 > *arg5 = 0 ;
16371 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16376 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16382 arg4 =
new std::vector<int64>;
16383 arg4->reserve(length4);
16384 for(
int i = 0; i < length4; ++i) {
16385 arg4->emplace_back(jarg4[i]);
16389 arg5 =
new std::vector<int64>;
16390 arg5->reserve(length5);
16391 for(
int i = 0; i < length5; ++i) {
16392 arg5->emplace_back(jarg5[i]);
16395 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int64 >
const &)*arg4,(std::vector< int64 >
const &)*arg5);
16396 jresult = (
void *)result;
16410 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16411 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16412 std::vector< int > *arg4 = 0 ;
16413 std::vector< int > *arg5 = 0 ;
16417 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16422 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16428 arg4 =
new std::vector<int>;
16429 arg4->reserve(length4);
16430 for(
int i = 0; i < length4; ++i) {
16431 arg4->emplace_back(jarg4[i]);
16435 arg5 =
new std::vector<int>;
16436 arg5->reserve(length5);
16437 for(
int i = 0; i < length5; ++i) {
16438 arg5->emplace_back(jarg5[i]);
16441 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int >
const &)*arg4,(std::vector< int >
const &)*arg5);
16442 jresult = (
void *)result;
16456 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16457 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16458 std::vector< operations_research::IntVar * > *arg4 = 0 ;
16459 std::vector< operations_research::IntVar * > *arg5 = 0 ;
16463 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16468 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16473 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
16478 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
16483 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingNonStrictBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< operations_research::IntVar * >
const &)*arg4,(std::vector< operations_research::IntVar * >
const &)*arg5);
16484 jresult = (
void *)result;
16492 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16493 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16494 std::vector< int64 > *arg4 = 0 ;
16495 std::vector< int64 > *arg5 = 0 ;
16499 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16504 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16510 arg4 =
new std::vector<int64>;
16511 arg4->reserve(length4);
16512 for(
int i = 0; i < length4; ++i) {
16513 arg4->emplace_back(jarg4[i]);
16517 arg5 =
new std::vector<int64>;
16518 arg5->reserve(length5);
16519 for(
int i = 0; i < length5; ++i) {
16520 arg5->emplace_back(jarg5[i]);
16523 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingNonStrictBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int64 >
const &)*arg4,(std::vector< int64 >
const &)*arg5);
16524 jresult = (
void *)result;
16538 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16539 std::vector< operations_research::IntVar * > *arg3 = 0 ;
16540 std::vector< int > *arg4 = 0 ;
16541 std::vector< int > *arg5 = 0 ;
16545 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16550 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
16556 arg4 =
new std::vector<int>;
16557 arg4->reserve(length4);
16558 for(
int i = 0; i < length4; ++i) {
16559 arg4->emplace_back(jarg4[i]);
16563 arg5 =
new std::vector<int>;
16564 arg5->reserve(length5);
16565 for(
int i = 0; i < length5; ++i) {
16566 arg5->emplace_back(jarg5[i]);
16569 result = (
operations_research::Constraint *)(arg1)->MakeNonOverlappingNonStrictBoxesConstraint((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int >
const &)*arg4,(std::vector< int >
const &)*arg5);
16570 jresult = (
void *)result;
16584 std::vector< operations_research::IntVar * > *arg2 = 0 ;
16589 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
16595 result = (
operations_research::Pack *)(arg1)->MakePack((std::vector< operations_research::IntVar * >
const &)*arg2,arg3);
16596 jresult = (
void *)result;
16608 std::string *arg6 = 0 ;
16612 arg2 = (
int64)jarg2;
16613 arg3 = (
int64)jarg3;
16614 arg4 = (
int64)jarg4;
16615 arg5 = jarg5 ? true :
false;
16620 std::string arg6_str(jarg6);
16623 jresult = (
void *)result;
16633 std::string *arg4 = 0 ;
16638 arg3 = (
int64)jarg3;
16643 std::string arg4_str(jarg4);
16646 jresult = (
void *)result;
16657 std::string *arg5 = 0 ;
16662 arg3 = (
int64)jarg3;
16668 std::string arg5_str(jarg5);
16671 jresult = (
void *)result;
16681 std::string *arg4 = 0 ;
16685 arg2 = (
int64)jarg2;
16686 arg3 = (
int64)jarg3;
16691 std::string arg4_str(jarg4);
16694 jresult = (
void *)result;
16709 std::string *arg9 = 0 ;
16713 arg2 = (
int64)jarg2;
16714 arg3 = (
int64)jarg3;
16715 arg4 = (
int64)jarg4;
16716 arg5 = (
int64)jarg5;
16717 arg6 = (
int64)jarg6;
16718 arg7 = (
int64)jarg7;
16719 arg8 = jarg8 ? true :
false;
16724 std::string arg9_str(jarg9);
16727 jresult = (
void *)result;
16732 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVarArray___(
void * jarg1,
int jarg2,
long long jarg3,
long long jarg4,
long long jarg5,
long long jarg6,
long long jarg7,
long long jarg8,
unsigned int jarg9,
char * jarg10,
void * jarg11) {
16742 std::string *arg10 = 0 ;
16743 std::vector< operations_research::IntervalVar * > *arg11 = (std::vector< operations_research::IntervalVar * > *) (std::vector< operations_research::IntervalVar * > *)0 ;
16747 arg3 = (
int64)jarg3;
16748 arg4 = (
int64)jarg4;
16749 arg5 = (
int64)jarg5;
16750 arg6 = (
int64)jarg6;
16751 arg7 = (
int64)jarg7;
16752 arg8 = (
int64)jarg8;
16753 arg9 = jarg9 ? true :
false;
16758 std::string arg10_str(jarg10);
16759 arg10 = &arg10_str;
16760 arg11 = (std::vector< operations_research::IntervalVar * > *)jarg11;
16761 (arg1)->MakeIntervalVarArray(arg2,arg3,arg4,arg5,arg6,arg7,arg8,arg9,(std::string
const &)*arg10,arg11);
16774 jresult = (
void *)result;
16789 arg3 = (
int64)jarg3;
16790 arg4 = (
int64)jarg4;
16792 jresult = (
void *)result;
16807 arg3 = (
int64)jarg3;
16808 arg4 = (
int64)jarg4;
16810 jresult = (
void *)result;
16825 arg3 = (
int64)jarg3;
16826 arg4 = (
int64)jarg4;
16828 jresult = (
void *)result;
16843 arg3 = (
int64)jarg3;
16844 arg4 = (
int64)jarg4;
16846 jresult = (
void *)result;
16860 jresult = (
void *)result;
16874 jresult = (
void *)result;
16890 arg4 = (
int64)jarg4;
16892 jresult = (
void *)result;
16910 jresult = (
void *)result;
16928 arg5 = (
int64)jarg5;
16930 jresult = (
void *)result;
16948 jresult = (
void *)result;
16964 jresult = (
void *)result;
16972 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
16973 std::string *arg3 = 0 ;
16977 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
16986 std::string arg3_str(jarg3);
16989 jresult = (
void *)result;
16997 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
16998 std::string *arg3 = 0 ;
17002 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17011 std::string arg3_str(jarg3);
17014 jresult = (
void *)result;
17022 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17023 std::vector< int64 > *arg3 = 0 ;
17025 std::string *arg5 = 0 ;
17029 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17035 arg3 =
new std::vector<int64>;
17036 arg3->reserve(length3);
17037 for(
int i = 0; i < length3; ++i) {
17038 arg3->emplace_back(jarg3[i]);
17041 arg4 = (
int64)jarg4;
17046 std::string arg5_str(jarg5);
17048 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4,(std::string
const &)*arg5);
17049 jresult = (
void *)result;
17060 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17061 std::vector< int > *arg3 = 0 ;
17063 std::string *arg5 = 0 ;
17067 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17073 arg3 =
new std::vector<int>;
17074 arg3->reserve(length3);
17075 for(
int i = 0; i < length3; ++i) {
17076 arg3->emplace_back(jarg3[i]);
17079 arg4 = (
int64)jarg4;
17084 std::string arg5_str(jarg5);
17086 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4,(std::string
const &)*arg5);
17087 jresult = (
void *)result;
17098 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17099 std::vector< int64 > *arg3 = 0 ;
17101 std::string *arg5 = 0 ;
17105 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17111 arg3 =
new std::vector<int64>;
17112 arg3->reserve(length3);
17113 for(
int i = 0; i < length3; ++i) {
17114 arg3->emplace_back(jarg3[i]);
17122 std::string arg5_str(jarg5);
17124 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4,(std::string
const &)*arg5);
17125 jresult = (
void *)result;
17136 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17137 std::vector< int > *arg3 = 0 ;
17139 std::string *arg5 = 0 ;
17143 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17149 arg3 =
new std::vector<int>;
17150 arg3->reserve(length3);
17151 for(
int i = 0; i < length3; ++i) {
17152 arg3->emplace_back(jarg3[i]);
17160 std::string arg5_str(jarg5);
17162 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4,(std::string
const &)*arg5);
17163 jresult = (
void *)result;
17174 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17175 std::vector< operations_research::IntVar * > *arg3 = 0 ;
17177 std::string *arg5 = 0 ;
17181 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17186 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
17191 arg4 = (
int64)jarg4;
17196 std::string arg5_str(jarg5);
17198 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,(std::string
const &)*arg5);
17199 jresult = (
void *)result;
17207 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17208 std::vector< operations_research::IntVar * > *arg3 = 0 ;
17210 std::string *arg5 = 0 ;
17214 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17219 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
17229 std::string arg5_str(jarg5);
17231 result = (
operations_research::Constraint *)(arg1)->MakeCumulative((std::vector< operations_research::IntervalVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,(std::string
const &)*arg5);
17232 jresult = (
void *)result;
17240 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
17245 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
17252 jresult = (
void *)result;
17268 jresult = (
void *)result;
17280 jresult = (
void *)result;
17294 jresult = (
void *)result;
17308 jresult = (
void *)result;
17320 jresult = (
void *)result;
17334 jresult = (
void *)result;
17346 jresult = (
void *)result;
17360 arg3 = jarg3 ? true :
false;
17362 jresult = (
void *)result;
17374 arg2 = jarg2 ? true :
false;
17376 jresult = (
void *)result;
17392 arg4 = jarg4 ? true :
false;
17394 jresult = (
void *)result;
17408 arg3 = jarg3 ? true :
false;
17410 jresult = (
void *)result;
17424 jresult = (
void *)result;
17436 jresult = (
void *)result;
17450 arg3 = (
int64)jarg3;
17452 jresult = (
void *)result;
17466 arg3 = (
int64)jarg3;
17468 jresult = (
void *)result;
17482 arg2 = jarg2 ? true :
false;
17484 arg4 = (
int64)jarg4;
17486 jresult = (
void *)result;
17494 std::vector< operations_research::IntVar * > *arg2 = 0 ;
17495 std::vector< int64 > *arg3 = 0 ;
17500 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
17506 arg3 =
new std::vector<int64>;
17507 arg3->reserve(length3);
17508 for(
int i = 0; i < length3; ++i) {
17509 arg3->emplace_back(jarg3[i]);
17512 arg4 = (
int64)jarg4;
17513 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedMinimize((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
17514 jresult = (
void *)result;
17525 std::vector< operations_research::IntVar * > *arg2 = 0 ;
17526 std::vector< int > *arg3 = 0 ;
17531 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
17537 arg3 =
new std::vector<int>;
17538 arg3->reserve(length3);
17539 for(
int i = 0; i < length3; ++i) {
17540 arg3->emplace_back(jarg3[i]);
17543 arg4 = (
int64)jarg4;
17544 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedMinimize((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
17545 jresult = (
void *)result;
17556 std::vector< operations_research::IntVar * > *arg2 = 0 ;
17557 std::vector< int64 > *arg3 = 0 ;
17562 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
17568 arg3 =
new std::vector<int64>;
17569 arg3->reserve(length3);
17570 for(
int i = 0; i < length3; ++i) {
17571 arg3->emplace_back(jarg3[i]);
17574 arg4 = (
int64)jarg4;
17575 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedMaximize((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3,arg4);
17576 jresult = (
void *)result;
17587 std::vector< operations_research::IntVar * > *arg2 = 0 ;
17588 std::vector< int > *arg3 = 0 ;
17593 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
17599 arg3 =
new std::vector<int>;
17600 arg3->reserve(length3);
17601 for(
int i = 0; i < length3; ++i) {
17602 arg3->emplace_back(jarg3[i]);
17605 arg4 = (
int64)jarg4;
17606 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedMaximize((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int >
const &)*arg3,arg4);
17607 jresult = (
void *)result;
17619 std::vector< operations_research::IntVar * > *arg3 = 0 ;
17620 std::vector< int64 > *arg4 = 0 ;
17625 arg2 = jarg2 ? true :
false;
17626 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
17632 arg4 =
new std::vector<int64>;
17633 arg4->reserve(length4);
17634 for(
int i = 0; i < length4; ++i) {
17635 arg4->emplace_back(jarg4[i]);
17638 arg5 = (
int64)jarg5;
17639 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedOptimize(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int64 >
const &)*arg4,arg5);
17640 jresult = (
void *)result;
17652 std::vector< operations_research::IntVar * > *arg3 = 0 ;
17653 std::vector< int > *arg4 = 0 ;
17658 arg2 = jarg2 ? true :
false;
17659 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
17665 arg4 =
new std::vector<int>;
17666 arg4->reserve(length4);
17667 for(
int i = 0; i < length4; ++i) {
17668 arg4->emplace_back(jarg4[i]);
17671 arg5 = (
int64)jarg5;
17672 result = (
operations_research::OptimizeVar *)(arg1)->MakeWeightedOptimize(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int >
const &)*arg4,arg5);
17673 jresult = (
void *)result;
17687 std::vector< operations_research::IntVar * > *arg5 = 0 ;
17694 arg2 = jarg2 ? true :
false;
17696 arg4 = (
int64)jarg4;
17697 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
17702 arg6 = (
int64)jarg6;
17703 arg7 = (
int64)jarg7;
17704 arg8 = (double)jarg8;
17706 jresult = (
void *)result;
17717 std::vector< operations_research::IntVar * > *arg5 = 0 ;
17722 arg2 = jarg2 ? true :
false;
17724 arg4 = (
int64)jarg4;
17725 arg5 = (std::vector< operations_research::IntVar * > *)jarg5;
17730 arg6 = (
int64)jarg6;
17732 jresult = (
void *)result;
17747 arg2 = jarg2 ? true :
false;
17749 arg4 = (
int64)jarg4;
17750 arg5 = (
int64)jarg5;
17752 jresult = (
void *)result;
17764 std::vector< operations_research::IntVar * > *arg6 = 0 ;
17769 arg2 = jarg2 ? true :
false;
17776 arg5 = (
int64)jarg5;
17777 arg6 = (std::vector< operations_research::IntVar * > *)jarg6;
17782 arg7 = (double)jarg7;
17784 jresult = (
void *)result;
17796 std::vector< operations_research::IntVar * > *arg6 = 0 ;
17797 std::vector< operations_research::IntVar * > *arg7 = 0 ;
17802 arg2 = jarg2 ? true :
false;
17809 arg5 = (
int64)jarg5;
17810 arg6 = (std::vector< operations_research::IntVar * > *)jarg6;
17815 arg7 = (std::vector< operations_research::IntVar * > *)jarg7;
17820 arg8 = (double)jarg8;
17821 result = (
operations_research::SearchMonitor *)(arg1)->MakeGuidedLocalSearch(arg2,arg3,arg4,arg5,(std::vector< operations_research::IntVar * >
const &)*arg6,(std::vector< operations_research::IntVar * >
const &)*arg7,arg8);
17822 jresult = (
void *)result;
17836 jresult = (
void *)result;
17850 jresult = (
void *)result;
17858 absl::Duration arg2 ;
17859 absl::Duration *argp2 ;
17863 argp2 = (absl::Duration *)jarg2;
17870 jresult = (
void *)result;
17882 arg2 = (
int64)jarg2;
17884 jresult = (
void *)result;
17896 arg2 = (
int64)jarg2;
17898 jresult = (
void *)result;
17910 arg2 = (
int64)jarg2;
17912 jresult = (
void *)result;
17924 arg2 = (
int64)jarg2;
17926 jresult = (
void *)result;
17934 absl::Duration arg2 ;
17940 absl::Duration *argp2 ;
17944 argp2 = (absl::Duration *)jarg2;
17950 arg3 = (
int64)jarg3;
17951 arg4 = (
int64)jarg4;
17952 arg5 = (
int64)jarg5;
17953 arg6 = jarg6 ? true :
false;
17954 arg7 = jarg7 ? true :
false;
17956 jresult = (
void *)result;
17964 absl::Duration arg2 ;
17969 absl::Duration *argp2 ;
17973 argp2 = (absl::Duration *)jarg2;
17979 arg3 = (
int64)jarg3;
17980 arg4 = (
int64)jarg4;
17981 arg5 = (
int64)jarg5;
17982 arg6 = jarg6 ? true :
false;
17984 jresult = (
void *)result;
17992 absl::Duration arg2 ;
17996 absl::Duration *argp2 ;
18000 argp2 = (absl::Duration *)jarg2;
18006 arg3 = (
int64)jarg3;
18007 arg4 = (
int64)jarg4;
18008 arg5 = (
int64)jarg5;
18010 jresult = (
void *)result;
18024 bool parsed_ok = arg2->ParseFromArray(jarg2, proto_size);
18028 "Unable to parse operations_research::RegularLimitParameters protocol message.");
18032 jresult = (
void *)result;
18052 arg2 = (
int64)jarg2;
18053 arg3 = (
int64)jarg3;
18054 arg4 = (
int64)jarg4;
18055 arg5 = (
int64)jarg5;
18056 arg6 = jarg6 ? true :
false;
18057 arg7 = jarg7 ? true :
false;
18059 jresult = (
void *)result;
18075 arg2 = (
int64)jarg2;
18076 arg3 = (
int64)jarg3;
18077 arg4 = (
int64)jarg4;
18078 arg5 = (
int64)jarg5;
18079 arg6 = jarg6 ? true :
false;
18081 jresult = (
void *)result;
18096 arg2 = (
int64)jarg2;
18097 arg3 = (
int64)jarg3;
18098 arg4 = (
int64)jarg4;
18099 arg5 = (
int64)jarg5;
18101 jresult = (
void *)result;
18114 const long size = (&result)->ByteSizeLong();
18115 jresult =
new uint8[size + 4];
18116 (&result)->SerializeWithCachedSizesToArray(jresult + 4);
18117 jresult[0] = size & 0xFF;
18118 jresult[1] = (size >> 8) & 0xFF;
18119 jresult[2] = (size >> 16) & 0xFF;
18120 jresult[3] = (size >> 24) & 0xFF;
18137 jresult = (
void *)result;
18155 arg3 = jarg3 ? true :
false;
18156 arg4 = (double)jarg4;
18157 arg5 = (double)jarg5;
18158 arg6 = (double)jarg6;
18161 jresult = (
void *)result;
18169 std::function< bool () > arg2 ;
18174 arg2 = [jarg2]() ->
bool {
18175 return (*(
bool(*)())jarg2)();
18179 jresult = (
void *)result;
18193 jresult = (
void *)result;
18209 jresult = (
void *)result;
18218 SwigValueWrapper< std::function< std::string () > > arg3 ;
18224 arg3 = [jarg3]() -> std::string {
18225 std::string result;
18226 return result.assign((*(
char* (*)()) jarg3)());
18230 jresult = (
void *)result;
18240 SwigValueWrapper< std::function< std::string () > > arg4 ;
18247 arg4 = [jarg4]() -> std::string {
18248 std::string result;
18249 return result.assign((*(
char* (*)()) jarg4)());
18253 jresult = (
void *)result;
18269 jresult = (
void *)result;
18279 SwigValueWrapper< std::function< std::string () > > arg4 ;
18286 arg4 = [jarg4]() -> std::string {
18287 std::string result;
18288 return result.assign((*(
char* (*)()) jarg4)());
18292 jresult = (
void *)result;
18300 std::string *arg2 = 0 ;
18308 std::string arg2_str(jarg2);
18311 jresult = (
void *)result;
18319 std::function< void () > arg2 ;
18324 arg2 = [jarg2]() ->
void {
18325 return (*(
void(*)())jarg2)();
18329 jresult = (
void *)result;
18337 std::function< void () > arg2 ;
18342 arg2 = [jarg2]() ->
void {
18343 return (*(
void(*)())jarg2)();
18347 jresult = (
void *)result;
18355 std::function< void () > arg2 ;
18360 arg2 = [jarg2]() ->
void {
18361 return (*(
void(*)())jarg2)();
18365 jresult = (
void *)result;
18377 jresult = (
void *)result;
18389 jresult = (
void *)result;
18397 std::vector< operations_research::SymmetryBreaker * > *arg2 = 0 ;
18401 arg2 = (std::vector< operations_research::SymmetryBreaker * > *)jarg2;
18407 jresult = (
void *)result;
18421 jresult = (
void *)result;
18437 jresult = (
void *)result;
18455 jresult = (
void *)result;
18475 jresult = (
void *)result;
18489 arg3 = (
int64)jarg3;
18491 jresult = (
void *)result;
18505 arg3 = (
int64)jarg3;
18507 jresult = (
void *)result;
18521 arg3 = (
int64)jarg3;
18523 jresult = (
void *)result;
18538 arg3 = (
int64)jarg3;
18539 arg4 = jarg4 ? true :
false;
18541 jresult = (
void *)result;
18555 arg3 = (
int64)jarg3;
18557 jresult = (
void *)result;
18571 arg3 = (
int64)jarg3;
18573 jresult = (
void *)result;
18581 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18582 std::vector< int64 > *arg3 = 0 ;
18586 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18592 arg3 =
new std::vector<int64>;
18593 arg3->reserve(length3);
18594 for(
int i = 0; i < length3; ++i) {
18595 arg3->emplace_back(jarg3[i]);
18598 result = (
operations_research::Decision *)(arg1)->MakeAssignVariablesValues((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3);
18599 jresult = (
void *)result;
18614 jresult = (
void *)result;
18638 jresult = (
void *)result;
18654 jresult = (
void *)result;
18672 jresult = (
void *)result;
18692 jresult = (
void *)result;
18700 std::vector< operations_research::DecisionBuilder * > *arg2 = 0 ;
18704 arg2 = (std::vector< operations_research::DecisionBuilder * > *)jarg2;
18710 jresult = (
void *)result;
18726 jresult = (
void *)result;
18744 jresult = (
void *)result;
18764 jresult = (
void *)result;
18772 std::vector< operations_research::DecisionBuilder * > *arg2 = 0 ;
18776 arg2 = (std::vector< operations_research::DecisionBuilder * > *)jarg2;
18782 jresult = (
void *)result;
18790 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18796 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18804 jresult = (
void *)result;
18812 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18818 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18830 jresult = (
void *)result;
18838 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18844 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18856 jresult = (
void *)result;
18864 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18870 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18882 jresult = (
void *)result;
18890 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18896 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18912 jresult = (
void *)result;
18920 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18927 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18944 jresult = (
void *)result;
18952 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18959 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18980 jresult = (
void *)result;
18988 std::vector< operations_research::IntVar * > *arg2 = 0 ;
18992 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
18998 jresult = (
void *)result;
19006 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19011 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19022 jresult = (
void *)result;
19040 jresult = (
void *)result;
19060 jresult = (
void *)result;
19082 jresult = (
void *)result;
19106 jresult = (
void *)result;
19121 arg3 = (
int64)jarg3;
19122 arg4 = (
int64 *)jarg4;
19124 jresult = (
void *)result;
19139 arg3 = (
int64)jarg3;
19140 arg4 = (
int64 *)jarg4;
19142 jresult = (
void *)result;
19158 jresult = (
void *)result;
19174 jresult = (
void *)result;
19182 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19188 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19200 jresult = (
void *)result;
19208 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19215 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19232 jresult = (
void *)result;
19240 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
19245 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
19252 jresult = (
void *)result;
19260 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
19265 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
19272 jresult = (
void *)result;
19282 std::vector< operations_research::IntVar * > *arg4 = 0 ;
19288 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
19294 jresult = (
void *)result;
19308 jresult = (
void *)result;
19322 jresult = (
void *)result;
19338 jresult = (
void *)result;
19356 jresult = (
void *)result;
19376 jresult = (
void *)result;
19398 jresult = (
void *)result;
19407 std::vector< operations_research::SearchMonitor * > *arg3 = 0 ;
19412 arg3 = (std::vector< operations_research::SearchMonitor * > *)jarg3;
19418 jresult = (
void *)result;
19435 arg4 = jarg4 ? true :
false;
19436 arg5 = (
int64)jarg5;
19438 jresult = (
void *)result;
19456 arg4 = jarg4 ? true :
false;
19457 arg5 = (
int64)jarg5;
19460 jresult = (
void *)result;
19479 arg4 = jarg4 ? true :
false;
19480 arg5 = (
int64)jarg5;
19484 jresult = (
void *)result;
19504 arg4 = jarg4 ? true :
false;
19505 arg5 = (
int64)jarg5;
19510 jresult = (
void *)result;
19531 arg4 = jarg4 ? true :
false;
19532 arg5 = (
int64)jarg5;
19538 jresult = (
void *)result;
19550 std::vector< operations_research::SearchMonitor * > *arg6 = 0 ;
19556 arg4 = jarg4 ? true :
false;
19557 arg5 = (
int64)jarg5;
19558 arg6 = (std::vector< operations_research::SearchMonitor * > *)jarg6;
19564 jresult = (
void *)result;
19578 jresult = (
void *)result;
19592 jresult = (
void *)result;
19600 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19605 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19612 jresult = (
void *)result;
19620 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19621 std::vector< operations_research::IntVar * > *arg3 = 0 ;
19626 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19631 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
19637 result = (
operations_research::LocalSearchOperator *)(arg1)->MakeOperator((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4);
19638 jresult = (
void *)result;
19646 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19652 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19664 jresult = (
void *)result;
19672 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19673 std::vector< operations_research::IntVar * > *arg3 = 0 ;
19679 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19684 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
19695 result = (
operations_research::LocalSearchOperator *)(arg1)->MakeOperator((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,arg5);
19696 jresult = (
void *)result;
19704 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19709 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19716 jresult = (
void *)result;
19724 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19730 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19736 arg4 = (
int32)jarg4;
19738 jresult = (
void *)result;
19756 jresult = (
void *)result;
19764 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19765 std::vector< int64 > *arg3 = 0 ;
19769 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19775 arg3 =
new std::vector<int64>;
19776 arg3->reserve(length3);
19777 for(
int i = 0; i < length3; ++i) {
19778 arg3->emplace_back(jarg3[i]);
19782 jresult = (
void *)result;
19793 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19797 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19803 jresult = (
void *)result;
19811 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19816 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19821 arg3 = jarg3 ? true :
false;
19823 jresult = (
void *)result;
19831 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19832 std::function<
int64 (
int,
int) > arg3 ;
19836 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19842 arg3 = [jarg3](
int t,
int u) ->
int64 {
19843 return (*(
int64(*)(
int,
int))jarg3)(t, u);
19847 jresult = (
void *)result;
19855 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19859 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19865 jresult = (
void *)result;
19873 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19878 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19883 arg3 = (
int32)jarg3;
19885 jresult = (
void *)result;
19893 std::vector< operations_research::LocalSearchOperator * > *arg2 = 0 ;
19900 arg2 = (std::vector< operations_research::LocalSearchOperator * > *)jarg2;
19905 arg3 = (double)jarg3;
19906 arg4 = (double)jarg4;
19907 arg5 = jarg5 ? true :
false;
19909 jresult = (
void *)result;
19923 arg3 = (
int64)jarg3;
19925 jresult = (
void *)result;
19941 jresult = (
void *)result;
19949 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19955 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19963 jresult = (
void *)result;
19971 std::vector< operations_research::IntVar * > *arg2 = 0 ;
19978 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
19987 jresult = (
void *)result;
19995 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
20001 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
20009 jresult = (
void *)result;
20021 jresult = (
void *)result;
20039 jresult = (
void *)result;
20059 jresult = (
void *)result;
20081 jresult = (
void *)result;
20101 jresult = (
void *)result;
20123 jresult = (
void *)result;
20147 jresult = (
void *)result;
20159 jresult = (
void *)result;
20171 jresult = (
void *)result;
20183 jresult = (
void *)result;
20191 std::vector< operations_research::IntVar * > *arg2 = 0 ;
20197 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
20209 jresult = (
void *)result;
20217 std::vector< operations_research::IntVar * > *arg2 = 0 ;
20218 std::vector< operations_research::IntVar * > *arg3 = 0 ;
20224 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
20229 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
20240 result = (
operations_research::IntVarLocalSearchFilter *)(arg1)->MakeSumObjectiveFilter((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,arg5);
20241 jresult = (
void *)result;
20250 (arg1)->TopPeriodicCheck();
20270 (arg1)->PushState();
20278 (arg1)->PopState();
20319 long long jresult ;
20325 arg2 = (
int64)jarg2;
20339 arg2 = (
int32)jarg2;
20351 arg2 = (
int32)jarg2;
20352 (arg1)->ReSeed(arg2);
20358 std::string *arg2 = 0 ;
20365 std::string arg2_str(jarg2);
20367 (arg1)->ExportProfilingOverview((std::string
const &)*arg2);
20374 std::string result;
20384 unsigned int jresult ;
20424 jresult = (
void *)result;
20433 (arg1)->clear_fail_intercept();
20442 arg2 = jarg2 ? true :
false;
20443 (arg1)->SetUseFastLocalSearch(arg2);
20448 unsigned int jresult ;
20460 unsigned int jresult ;
20482 jresult = (
void *)result;
20496 jresult = (
void *)result;
20510 jresult = (
void *)result;
20524 jresult = (
void *)result;
20536 jresult = (
void *)result;
20542 unsigned int jresult ;
20554 unsigned int jresult ;
20566 unsigned int jresult ;
20578 unsigned int jresult ;
20590 unsigned int jresult ;
20604 std::string result;
20620 jresult = (
void *)result;
20631 (arg1)->AddPropagationMonitor(arg2);
20642 jresult = (
void *)result;
20653 (arg1)->AddLocalSearchMonitor(arg2);
20664 jresult = (
void *)result;
20673 (arg1)->ClearLocalSearchState();
20686 jresult = (
void *)result;
20695 (arg1)->FinishCurrentSearch();
20703 (arg1)->RestartCurrentSearch();
20711 (arg1)->ShouldFail();
20719 (arg1)->CheckFail();
20724 long long jresult ;
20734 long long jresult ;
20748 jresult = (
void *)result;
20764 std::string result;
20780 jresult = (
void *)result;
20796 std::string result;
20812 jresult = (
void *)result;
20821 (arg1)->FreezeQueue();
20829 (arg1)->UnfreezeQueue();
20839 (arg1)->EnqueueDelayedDemon(arg2);
20849 (arg1)->EnqueueVar(arg2);
20857 (arg1)->reset_action_on_fail();
20867 (arg1)->set_variable_to_clean_on_fail(arg2);
20874 std::string result;
20885 std::string *arg2 = 0 ;
20892 std::string arg2_str(jarg2);
20894 (arg1)->set_name((std::string
const &)*arg2);
20899 unsigned int jresult ;
20913 std::string result;
20927 jresult = (
void *)result;
20946 (arg1)->Apply(arg2);
20956 (arg1)->Refute(arg2);
20963 std::string result;
20975 std::string result;
21016 jresult = (
void *)result;
21036 arg3 = (
int64)jarg3;
21037 (arg1)->VisitSetVariableValue(arg2,arg3);
21049 arg3 = (
int64)jarg3;
21050 arg4 = jarg4 ? true :
false;
21051 (arg1)->VisitSplitVariableDomain(arg2,arg3,arg4);
21062 arg3 = (
int64)jarg3;
21063 (arg1)->VisitScheduleOrPostpone(arg2,arg3);
21074 arg3 = (
int64)jarg3;
21075 (arg1)->VisitScheduleOrExpedite(arg2,arg3);
21087 (arg1)->VisitRankFirstInterval(arg2,arg3);
21099 (arg1)->VisitRankLastInterval(arg2,arg3);
21107 (arg1)->VisitUnknownDecision();
21116 jresult = (
void *)result;
21138 jresult = (
void *)result;
21146 std::string result;
21158 std::string result;
21179 jresult = (
void *)result;
21209 jresult = (int)result;
21221 jresult = (int)result;
21229 std::string result;
21241 std::string result;
21256 (arg1)->inhibit(arg2);
21266 (arg1)->desinhibit(arg2);
22917 std::string *arg2 = 0 ;
22924 std::string arg2_str(jarg2);
22926 (arg1)->BeginVisitModel((std::string
const &)*arg2);
22932 std::string *arg2 = 0 ;
22939 std::string arg2_str(jarg2);
22941 (arg1)->EndVisitModel((std::string
const &)*arg2);
22947 std::string *arg2 = 0 ;
22955 std::string arg2_str(jarg2);
22964 std::string *arg2 = 0 ;
22972 std::string arg2_str(jarg2);
22981 std::string *arg2 = 0 ;
22988 std::string arg2_str(jarg2);
22990 (arg1)->BeginVisitExtension((std::string
const &)*arg2);
22996 std::string *arg2 = 0 ;
23003 std::string arg2_str(jarg2);
23005 (arg1)->EndVisitExtension((std::string
const &)*arg2);
23011 std::string *arg2 = 0 ;
23019 std::string arg2_str(jarg2);
23028 std::string *arg2 = 0 ;
23036 std::string arg2_str(jarg2);
23058 std::string *arg3 = 0 ;
23068 std::string arg3_str(jarg3);
23070 arg4 = (
int64)jarg4;
23079 std::string *arg3 = 0 ;
23089 std::string arg3_str(jarg3);
23091 arg4 = (
int64)jarg4;
23109 std::string *arg2 = 0 ;
23117 std::string arg2_str(jarg2);
23119 arg3 = (
int64)jarg3;
23120 (arg1)->VisitIntegerArgument((std::string
const &)*arg2,arg3);
23126 std::string *arg2 = 0 ;
23127 std::vector< int64 > *arg3 = 0 ;
23134 std::string arg2_str(jarg2);
23137 arg3 =
new std::vector<int64>;
23138 arg3->reserve(length3);
23139 for(
int i = 0; i < length3; ++i) {
23140 arg3->emplace_back(jarg3[i]);
23143 (arg1)->VisitIntegerArrayArgument((std::string
const &)*arg2,(std::vector< int64 >
const &)*arg3);
23152 std::string *arg2 = 0 ;
23160 std::string arg2_str(jarg2);
23173 std::string *arg2 = 0 ;
23181 std::string arg2_str(jarg2);
23184 (arg1)->VisitIntegerExpressionArgument((std::string
const &)*arg2,arg3);
23190 std::string *arg2 = 0 ;
23191 std::vector< operations_research::IntVar * > *arg3 = 0 ;
23198 std::string arg2_str(jarg2);
23200 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
23205 (arg1)->VisitIntegerVariableArrayArgument((std::string
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
23211 std::string *arg2 = 0 ;
23219 std::string arg2_str(jarg2);
23222 (arg1)->VisitIntervalArgument((std::string
const &)*arg2,arg3);
23228 std::string *arg2 = 0 ;
23229 std::vector< operations_research::IntervalVar * > *arg3 = 0 ;
23236 std::string arg2_str(jarg2);
23238 arg3 = (std::vector< operations_research::IntervalVar * > *)jarg3;
23243 (arg1)->VisitIntervalArrayArgument((std::string
const &)*arg2,(std::vector< operations_research::IntervalVar * >
const &)*arg3);
23249 std::string *arg2 = 0 ;
23257 std::string arg2_str(jarg2);
23260 (arg1)->VisitSequenceArgument((std::string
const &)*arg2,arg3);
23266 std::string *arg2 = 0 ;
23267 std::vector< operations_research::SequenceVar * > *arg3 = 0 ;
23274 std::string arg2_str(jarg2);
23276 arg3 = (std::vector< operations_research::SequenceVar * > *)jarg3;
23281 (arg1)->VisitSequenceArrayArgument((std::string
const &)*arg2,(std::vector< operations_research::SequenceVar * >
const &)*arg3);
23290 jresult = (
void *)result;
23302 jresult = (
void *)result;
23327 (arg1)->InitialPropagate();
23334 std::string result;
23346 std::string result;
23366 unsigned int jresult ;
23384 jresult = (
void *)result;
23411 jresult = (
void *)result;
23433 jresult = (
void *)result;
23450 (arg1)->EnterSearch();
23466 (arg1)->RestartSearch();
23482 (arg1)->ExitSearch();
23500 (arg1)->BeginNextDecision(arg2);
23522 (arg1)->EndNextDecision(arg2,arg3);
23544 (arg1)->ApplyDecision(arg2);
23564 (arg1)->RefuteDecision(arg2);
23585 arg3 = jarg3 ? true :
false;
23586 (arg1)->AfterDecision(arg2,arg3);
23597 arg3 = jarg3 ? true :
false;
23606 (arg1)->BeginFail();
23638 (arg1)->BeginInitialPropagation();
23654 (arg1)->EndInitialPropagation();
23667 unsigned int jresult ;
23679 unsigned int jresult ;
23684 result = (bool)(arg1)->operations_research::SearchMonitor::AcceptSolution();
23691 unsigned int jresult ;
23703 unsigned int jresult ;
23708 result = (bool)(arg1)->operations_research::SearchMonitor::AtSolution();
23718 (arg1)->NoMoreSolutions();
23731 unsigned int jresult ;
23743 unsigned int jresult ;
23748 result = (bool)(arg1)->operations_research::SearchMonitor::LocalOptimum();
23755 unsigned int jresult ;
23764 result = (bool)(arg1)->AcceptDelta(arg2,arg3);
23771 unsigned int jresult ;
23780 result = (bool)(arg1)->operations_research::SearchMonitor::AcceptDelta(arg2,arg3);
23819 unsigned int jresult ;
23831 unsigned int jresult ;
23836 result = (bool)(arg1)->operations_research::SearchMonitor::IsUncheckedSolutionLimitReached();
23849 jresult = (
void *)result;
23858 (arg1)->PeriodicCheck();
23888 result = (int)(arg1)->operations_research::SearchMonitor::ProgressPercent();
23930 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_director_connect___(
void *objarg,
SwigDirector_SearchMonitor::SWIG_Callback0_t callback0,
SwigDirector_SearchMonitor::SWIG_Callback1_t callback1,
SwigDirector_SearchMonitor::SWIG_Callback2_t callback2,
SwigDirector_SearchMonitor::SWIG_Callback3_t callback3,
SwigDirector_SearchMonitor::SWIG_Callback4_t callback4,
SwigDirector_SearchMonitor::SWIG_Callback5_t callback5,
SwigDirector_SearchMonitor::SWIG_Callback6_t callback6,
SwigDirector_SearchMonitor::SWIG_Callback7_t callback7,
SwigDirector_SearchMonitor::SWIG_Callback8_t callback8,
SwigDirector_SearchMonitor::SWIG_Callback9_t callback9,
SwigDirector_SearchMonitor::SWIG_Callback10_t callback10,
SwigDirector_SearchMonitor::SWIG_Callback11_t callback11,
SwigDirector_SearchMonitor::SWIG_Callback12_t callback12,
SwigDirector_SearchMonitor::SWIG_Callback13_t callback13,
SwigDirector_SearchMonitor::SWIG_Callback14_t callback14,
SwigDirector_SearchMonitor::SWIG_Callback15_t callback15,
SwigDirector_SearchMonitor::SWIG_Callback16_t callback16,
SwigDirector_SearchMonitor::SWIG_Callback17_t callback17,
SwigDirector_SearchMonitor::SWIG_Callback18_t callback18,
SwigDirector_SearchMonitor::SWIG_Callback19_t callback19,
SwigDirector_SearchMonitor::SWIG_Callback20_t callback20,
SwigDirector_SearchMonitor::SWIG_Callback21_t callback21,
SwigDirector_SearchMonitor::SWIG_Callback22_t callback22,
SwigDirector_SearchMonitor::SWIG_Callback23_t callback23,
SwigDirector_SearchMonitor::SWIG_Callback24_t callback24) {
23933 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14, callback15, callback16, callback17, callback18, callback19, callback20, callback21, callback22, callback23, callback24);
23946 long long jresult ;
23962 arg2 = (
int64)jarg2;
23970 (arg1)->SetMin(arg2);
23982 long long jresult ;
23998 arg2 = (
int64)jarg2;
24006 (arg1)->SetMax(arg2);
24023 arg2 = (
int64 *)jarg2;
24024 arg3 = (
int64 *)jarg3;
24025 (arg1)->Range(arg2,arg3);
24035 arg2 = (
int64)jarg2;
24036 arg3 = (
int64)jarg3;
24044 (arg1)->SetRange(arg2,arg3);
24060 arg2 = (
int64)jarg2;
24068 (arg1)->SetValue(arg2);
24080 unsigned int jresult ;
24092 unsigned int jresult ;
24110 jresult = (
void *)result;
24118 std::string *arg2 = 0 ;
24126 std::string arg2_str(jarg2);
24129 jresult = (
void *)result;
24140 (arg1)->WhenRange(arg2);
24150 arg2 = [jarg2]() ->
void {
24151 return (*(
void(*)())jarg2)();
24154 (arg1)->WhenRange(arg2);
24171 std::vector< operations_research::IntVar * > *arg2 = 0 ;
24175 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
24181 jresult = (
void *)result;
24189 std::vector< int64 > *arg2 = 0 ;
24194 arg2 =
new std::vector<int64>;
24195 arg2->reserve(length2);
24196 for(
int i = 0; i < length2; ++i) {
24197 arg2->emplace_back(jarg2[i]);
24201 jresult = (
void *)result;
24212 std::vector< operations_research::IntVar * > *arg2 = 0 ;
24216 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
24222 jresult = (
void *)result;
24234 arg2 = (
int64)jarg2;
24236 jresult = (
void *)result;
24248 arg2 = (
int64)jarg2;
24250 jresult = (
void *)result;
24262 arg2 = (
int64)jarg2;
24264 jresult = (
void *)result;
24276 arg2 = (
int64)jarg2;
24278 jresult = (
void *)result;
24290 arg2 = (
int64)jarg2;
24292 jresult = (
void *)result;
24304 arg2 = (
int64)jarg2;
24306 jresult = (
void *)result;
24314 std::vector< int64 > *arg2 = 0 ;
24319 arg2 =
new std::vector<int64>;
24320 arg2->reserve(length2);
24321 for(
int i = 0; i < length2; ++i) {
24322 arg2->emplace_back(jarg2[i]);
24326 jresult = (
void *)result;
24337 std::vector< int > *arg2 = 0 ;
24342 arg2 =
new std::vector<int>;
24343 arg2->reserve(length2);
24344 for(
int i = 0; i < length2; ++i) {
24345 arg2->emplace_back(jarg2[i]);
24349 jresult = (
void *)result;
24360 std::vector< int64 > *arg2 = 0 ;
24365 arg2 =
new std::vector<int64>;
24366 arg2->reserve(length2);
24367 for(
int i = 0; i < length2; ++i) {
24368 arg2->emplace_back(jarg2[i]);
24372 jresult = (
void *)result;
24383 std::vector< int > *arg2 = 0 ;
24388 arg2 =
new std::vector<int>;
24389 arg2->reserve(length2);
24390 for(
int i = 0; i < length2; ++i) {
24391 arg2->emplace_back(jarg2[i]);
24395 jresult = (
void *)result;
24412 jresult = (
void *)result;
24426 jresult = (
void *)result;
24440 jresult = (
void *)result;
24454 jresult = (
void *)result;
24468 jresult = (
void *)result;
24482 jresult = (
void *)result;
24494 arg2 = (
int64)jarg2;
24496 jresult = (
void *)result;
24508 arg2 = (
int64)jarg2;
24510 jresult = (
void *)result;
24532 unsigned int jresult ;
24544 long long jresult ;
24566 std::string result;
24584 unsigned int jresult ;
24602 jresult = (
void *)result;
24608 long long jresult ;
24624 arg2 = (
int64)jarg2;
24632 (arg1)->RemoveValue(arg2);
24649 arg2 = (
int64)jarg2;
24650 arg3 = (
int64)jarg3;
24651 (arg1)->RemoveInterval(arg2,arg3);
24657 std::vector< int64 > *arg2 = 0 ;
24661 arg2 =
new std::vector<int64>;
24662 arg2->reserve(length2);
24663 for(
int i = 0; i < length2; ++i) {
24664 arg2->emplace_back(jarg2[i]);
24674 (arg1)->RemoveValues((std::vector< int64 >
const &)*arg2);
24690 std::vector< int64 > *arg2 = 0 ;
24694 arg2 =
new std::vector<int64>;
24695 arg2->reserve(length2);
24696 for(
int i = 0; i < length2; ++i) {
24697 arg2->emplace_back(jarg2[i]);
24700 (arg1)->SetValues((std::vector< int64 >
const &)*arg2);
24713 (arg1)->WhenBound(arg2);
24723 arg2 = [jarg2]() ->
void {
24724 return (*(
void(*)())jarg2)();
24727 (arg1)->WhenBound(arg2);
24737 (arg1)->WhenDomain(arg2);
24747 arg2 = [jarg2]() ->
void {
24748 return (*(
void(*)())jarg2)();
24751 (arg1)->WhenDomain(arg2);
24756 unsigned long long jresult ;
24768 unsigned int jresult ;
24774 arg2 = (
int64)jarg2;
24782 long long jresult ;
24794 long long jresult ;
24834 arg2 = (
int64)jarg2;
24836 jresult = (
void *)result;
24848 arg2 = (
int64)jarg2;
24850 jresult = (
void *)result;
24862 arg2 = (
int64)jarg2;
24864 jresult = (
void *)result;
24876 arg2 = (
int64)jarg2;
24878 jresult = (
void *)result;
24902 jresult = (
void *)result;
24914 jresult = (
void *)result;
24928 jresult = (
void *)result;
24940 jresult = (
void *)result;
24956 std::string result;
24968 std::string result;
24989 std::vector< operations_research::IntVar * > *arg2 = 0 ;
24992 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
24997 (arg1)->Add((std::vector< operations_research::IntVar * >
const &)*arg2);
25013 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
25016 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
25021 (arg1)->Add((std::vector< operations_research::IntervalVar * >
const &)*arg2);
25037 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
25040 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
25045 (arg1)->Add((std::vector< operations_research::SequenceVar * >
const &)*arg2);
25055 (arg1)->AddObjective(arg2);
25063 (arg1)->EnterSearch();
25096 jresult = (
void *)result;
25102 long long jresult ;
25116 long long jresult ;
25130 long long jresult ;
25144 long long jresult ;
25158 long long jresult ;
25174 long long jresult ;
25190 long long jresult ;
25206 long long jresult ;
25222 long long jresult ;
25242 std::vector< int > *result = 0 ;
25249 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
25260 std::vector< int > *result = 0 ;
25267 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
25278 std::vector< int > *result = 0 ;
25285 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
25291 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_director_connect___(
void *objarg,
SwigDirector_SolutionCollector::SWIG_Callback0_t callback0,
SwigDirector_SolutionCollector::SWIG_Callback1_t callback1,
SwigDirector_SolutionCollector::SWIG_Callback2_t callback2,
SwigDirector_SolutionCollector::SWIG_Callback3_t callback3,
SwigDirector_SolutionCollector::SWIG_Callback4_t callback4,
SwigDirector_SolutionCollector::SWIG_Callback5_t callback5,
SwigDirector_SolutionCollector::SWIG_Callback6_t callback6,
SwigDirector_SolutionCollector::SWIG_Callback7_t callback7,
SwigDirector_SolutionCollector::SWIG_Callback8_t callback8,
SwigDirector_SolutionCollector::SWIG_Callback9_t callback9,
SwigDirector_SolutionCollector::SWIG_Callback10_t callback10,
SwigDirector_SolutionCollector::SWIG_Callback11_t callback11,
SwigDirector_SolutionCollector::SWIG_Callback12_t callback12,
SwigDirector_SolutionCollector::SWIG_Callback13_t callback13,
SwigDirector_SolutionCollector::SWIG_Callback14_t callback14,
SwigDirector_SolutionCollector::SWIG_Callback15_t callback15,
SwigDirector_SolutionCollector::SWIG_Callback16_t callback16,
SwigDirector_SolutionCollector::SWIG_Callback17_t callback17,
SwigDirector_SolutionCollector::SWIG_Callback18_t callback18,
SwigDirector_SolutionCollector::SWIG_Callback19_t callback19,
SwigDirector_SolutionCollector::SWIG_Callback20_t callback20,
SwigDirector_SolutionCollector::SWIG_Callback21_t callback21,
SwigDirector_SolutionCollector::SWIG_Callback22_t callback22,
SwigDirector_SolutionCollector::SWIG_Callback23_t callback23,
SwigDirector_SolutionCollector::SWIG_Callback24_t callback24) {
25294 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14, callback15, callback16, callback17, callback18, callback19, callback20, callback21, callback22, callback23, callback24);
25307 arg2 = jarg2 ? true :
false;
25309 arg4 = (
int64)jarg4;
25311 jresult = (
void *)result;
25325 long long jresult ;
25343 jresult = (
void *)result;
25349 unsigned int jresult ;
25358 result = (bool)(arg1)->AcceptDelta(arg2,arg3);
25365 unsigned int jresult ;
25374 result = (bool)(arg1)->operations_research::OptimizeVar::AcceptDelta(arg2,arg3);
25384 (arg1)->EnterSearch();
25402 (arg1)->BeginNextDecision(arg2);
25422 (arg1)->RefuteDecision(arg2);
25437 unsigned int jresult ;
25449 unsigned int jresult ;
25454 result = (bool)(arg1)->operations_research::OptimizeVar::AtSolution();
25461 unsigned int jresult ;
25473 unsigned int jresult ;
25478 result = (bool)(arg1)->operations_research::OptimizeVar::AcceptSolution();
25487 std::string result;
25499 std::string result;
25511 std::string result;
25523 std::string result;
25556 (arg1)->ApplyBound();
25560 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_director_connect___(
void *objarg,
SwigDirector_OptimizeVar::SWIG_Callback0_t callback0,
SwigDirector_OptimizeVar::SWIG_Callback1_t callback1,
SwigDirector_OptimizeVar::SWIG_Callback2_t callback2,
SwigDirector_OptimizeVar::SWIG_Callback3_t callback3,
SwigDirector_OptimizeVar::SWIG_Callback4_t callback4,
SwigDirector_OptimizeVar::SWIG_Callback5_t callback5,
SwigDirector_OptimizeVar::SWIG_Callback6_t callback6,
SwigDirector_OptimizeVar::SWIG_Callback7_t callback7,
SwigDirector_OptimizeVar::SWIG_Callback8_t callback8,
SwigDirector_OptimizeVar::SWIG_Callback9_t callback9,
SwigDirector_OptimizeVar::SWIG_Callback10_t callback10,
SwigDirector_OptimizeVar::SWIG_Callback11_t callback11,
SwigDirector_OptimizeVar::SWIG_Callback12_t callback12,
SwigDirector_OptimizeVar::SWIG_Callback13_t callback13,
SwigDirector_OptimizeVar::SWIG_Callback14_t callback14,
SwigDirector_OptimizeVar::SWIG_Callback15_t callback15,
SwigDirector_OptimizeVar::SWIG_Callback16_t callback16,
SwigDirector_OptimizeVar::SWIG_Callback17_t callback17,
SwigDirector_OptimizeVar::SWIG_Callback18_t callback18,
SwigDirector_OptimizeVar::SWIG_Callback19_t callback19,
SwigDirector_OptimizeVar::SWIG_Callback20_t callback20,
SwigDirector_OptimizeVar::SWIG_Callback21_t callback21,
SwigDirector_OptimizeVar::SWIG_Callback22_t callback22,
SwigDirector_OptimizeVar::SWIG_Callback23_t callback23,
SwigDirector_OptimizeVar::SWIG_Callback24_t callback24,
SwigDirector_OptimizeVar::SWIG_Callback25_t callback25) {
25563 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14, callback15, callback16, callback17, callback18, callback19, callback20, callback21, callback22, callback23, callback24, callback25);
25574 jresult = (
void *)result;
25588 unsigned int jresult ;
25600 unsigned int jresult ;
25605 result = (bool)(arg1)->
Check();
25636 jresult = (
void *)result;
25645 (arg1)->EnterSearch();
25663 (arg1)->BeginNextDecision(arg2);
25681 (arg1)->PeriodicCheck();
25699 (arg1)->RefuteDecision(arg2);
25716 std::string result;
25728 std::string result;
25737 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_director_connect___(
void *objarg,
SwigDirector_SearchLimit::SWIG_Callback0_t callback0,
SwigDirector_SearchLimit::SWIG_Callback1_t callback1,
SwigDirector_SearchLimit::SWIG_Callback2_t callback2,
SwigDirector_SearchLimit::SWIG_Callback3_t callback3,
SwigDirector_SearchLimit::SWIG_Callback4_t callback4,
SwigDirector_SearchLimit::SWIG_Callback5_t callback5,
SwigDirector_SearchLimit::SWIG_Callback6_t callback6,
SwigDirector_SearchLimit::SWIG_Callback7_t callback7,
SwigDirector_SearchLimit::SWIG_Callback8_t callback8,
SwigDirector_SearchLimit::SWIG_Callback9_t callback9,
SwigDirector_SearchLimit::SWIG_Callback10_t callback10,
SwigDirector_SearchLimit::SWIG_Callback11_t callback11,
SwigDirector_SearchLimit::SWIG_Callback12_t callback12,
SwigDirector_SearchLimit::SWIG_Callback13_t callback13,
SwigDirector_SearchLimit::SWIG_Callback14_t callback14,
SwigDirector_SearchLimit::SWIG_Callback15_t callback15,
SwigDirector_SearchLimit::SWIG_Callback16_t callback16,
SwigDirector_SearchLimit::SWIG_Callback17_t callback17,
SwigDirector_SearchLimit::SWIG_Callback18_t callback18,
SwigDirector_SearchLimit::SWIG_Callback19_t callback19,
SwigDirector_SearchLimit::SWIG_Callback20_t callback20,
SwigDirector_SearchLimit::SWIG_Callback21_t callback21,
SwigDirector_SearchLimit::SWIG_Callback22_t callback22,
SwigDirector_SearchLimit::SWIG_Callback23_t callback23,
SwigDirector_SearchLimit::SWIG_Callback24_t callback24,
SwigDirector_SearchLimit::SWIG_Callback25_t callback25,
SwigDirector_SearchLimit::SWIG_Callback26_t callback26,
SwigDirector_SearchLimit::SWIG_Callback27_t callback27,
SwigDirector_SearchLimit::SWIG_Callback28_t callback28) {
25740 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14, callback15, callback16, callback17, callback18, callback19, callback20, callback21, callback22, callback23, callback24, callback25, callback26, callback27, callback28);
25747 absl::Duration arg2 ;
25753 absl::Duration *argp2 ;
25757 argp2 = (absl::Duration *)jarg2;
25763 arg3 = (
int64)jarg3;
25764 arg4 = (
int64)jarg4;
25765 arg5 = (
int64)jarg5;
25766 arg6 = jarg6 ? true :
false;
25767 arg7 = jarg7 ? true :
false;
25769 jresult = (
void *)result;
25809 jresult = (
void *)result;
25821 jresult = (
void *)result;
25833 jresult = (
void *)result;
25839 unsigned int jresult ;
25844 result = (bool)(arg1)->
Check();
25851 unsigned int jresult ;
25856 result = (bool)(arg1)->operations_research::RegularLimit::Check();
25882 (arg1)->ExitSearch();
25896 absl::Duration arg2 ;
25900 absl::Duration *argp2 ;
25903 argp2 = (absl::Duration *)jarg2;
25909 arg3 = (
int64)jarg3;
25910 arg4 = (
int64)jarg4;
25911 arg5 = (
int64)jarg5;
25912 (arg1)->UpdateLimits(arg2,arg3,arg4,arg5);
25917 long long jresult ;
25929 long long jresult ;
25941 long long jresult ;
25953 long long jresult ;
25965 unsigned int jresult ;
25977 unsigned int jresult ;
25982 result = (bool)(arg1)->operations_research::RegularLimit::IsUncheckedSolutionLimitReached();
26006 result = (int)(arg1)->operations_research::RegularLimit::ProgressPercent();
26015 std::string result;
26027 std::string result;
26056 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_director_connect___(
void *objarg,
SwigDirector_RegularLimit::SWIG_Callback0_t callback0,
SwigDirector_RegularLimit::SWIG_Callback1_t callback1,
SwigDirector_RegularLimit::SWIG_Callback2_t callback2,
SwigDirector_RegularLimit::SWIG_Callback3_t callback3,
SwigDirector_RegularLimit::SWIG_Callback4_t callback4,
SwigDirector_RegularLimit::SWIG_Callback5_t callback5,
SwigDirector_RegularLimit::SWIG_Callback6_t callback6,
SwigDirector_RegularLimit::SWIG_Callback7_t callback7,
SwigDirector_RegularLimit::SWIG_Callback8_t callback8,
SwigDirector_RegularLimit::SWIG_Callback9_t callback9,
SwigDirector_RegularLimit::SWIG_Callback10_t callback10,
SwigDirector_RegularLimit::SWIG_Callback11_t callback11,
SwigDirector_RegularLimit::SWIG_Callback12_t callback12,
SwigDirector_RegularLimit::SWIG_Callback13_t callback13,
SwigDirector_RegularLimit::SWIG_Callback14_t callback14,
SwigDirector_RegularLimit::SWIG_Callback15_t callback15,
SwigDirector_RegularLimit::SWIG_Callback16_t callback16,
SwigDirector_RegularLimit::SWIG_Callback17_t callback17,
SwigDirector_RegularLimit::SWIG_Callback18_t callback18,
SwigDirector_RegularLimit::SWIG_Callback19_t callback19,
SwigDirector_RegularLimit::SWIG_Callback20_t callback20,
SwigDirector_RegularLimit::SWIG_Callback21_t callback21,
SwigDirector_RegularLimit::SWIG_Callback22_t callback22,
SwigDirector_RegularLimit::SWIG_Callback23_t callback23,
SwigDirector_RegularLimit::SWIG_Callback24_t callback24,
SwigDirector_RegularLimit::SWIG_Callback25_t callback25,
SwigDirector_RegularLimit::SWIG_Callback26_t callback26,
SwigDirector_RegularLimit::SWIG_Callback27_t callback27,
SwigDirector_RegularLimit::SWIG_Callback28_t callback28) {
26059 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14, callback15, callback16, callback17, callback18, callback19, callback20, callback21, callback22, callback23, callback24, callback25, callback26, callback27, callback28);
26076 arg3 = jarg3 ? true :
false;
26077 arg4 = (double)jarg4;
26078 arg5 = (double)jarg5;
26079 arg6 = (double)jarg6;
26082 jresult = (
void *)result;
26112 jresult = (
void *)result;
26118 unsigned int jresult ;
26123 result = (bool)(arg1)->
Check();
26130 unsigned int jresult ;
26150 long long jresult ;
26160 long long jresult ;
26178 long long jresult ;
26190 long long jresult ;
26206 arg2 = (
int64)jarg2;
26214 (arg1)->SetStartMin(arg2);
26230 arg2 = (
int64)jarg2;
26238 (arg1)->SetStartMax(arg2);
26255 arg2 = (
int64)jarg2;
26256 arg3 = (
int64)jarg3;
26264 (arg1)->SetStartRange(arg2,arg3);
26276 long long jresult ;
26288 long long jresult ;
26305 (arg1)->WhenStartRange(arg2);
26315 arg2 = [jarg2]() ->
void {
26316 return (*(
void(*)())jarg2)();
26319 (arg1)->WhenStartRange(arg2);
26329 (arg1)->WhenStartBound(arg2);
26339 arg2 = [jarg2]() ->
void {
26340 return (*(
void(*)())jarg2)();
26343 (arg1)->WhenStartBound(arg2);
26348 long long jresult ;
26360 long long jresult ;
26376 arg2 = (
int64)jarg2;
26384 (arg1)->SetDurationMin(arg2);
26400 arg2 = (
int64)jarg2;
26408 (arg1)->SetDurationMax(arg2);
26425 arg2 = (
int64)jarg2;
26426 arg3 = (
int64)jarg3;
26434 (arg1)->SetDurationRange(arg2,arg3);
26446 long long jresult ;
26458 long long jresult ;
26475 (arg1)->WhenDurationRange(arg2);
26485 arg2 = [jarg2]() ->
void {
26486 return (*(
void(*)())jarg2)();
26489 (arg1)->WhenDurationRange(arg2);
26499 (arg1)->WhenDurationBound(arg2);
26509 arg2 = [jarg2]() ->
void {
26510 return (*(
void(*)())jarg2)();
26513 (arg1)->WhenDurationBound(arg2);
26518 long long jresult ;
26530 long long jresult ;
26546 arg2 = (
int64)jarg2;
26554 (arg1)->SetEndMin(arg2);
26570 arg2 = (
int64)jarg2;
26578 (arg1)->SetEndMax(arg2);
26595 arg2 = (
int64)jarg2;
26596 arg3 = (
int64)jarg3;
26604 (arg1)->SetEndRange(arg2,arg3);
26616 long long jresult ;
26628 long long jresult ;
26645 (arg1)->WhenEndRange(arg2);
26655 arg2 = [jarg2]() ->
void {
26656 return (*(
void(*)())jarg2)();
26659 (arg1)->WhenEndRange(arg2);
26669 (arg1)->WhenEndBound(arg2);
26679 arg2 = [jarg2]() ->
void {
26680 return (*(
void(*)())jarg2)();
26683 (arg1)->WhenEndBound(arg2);
26688 unsigned int jresult ;
26700 unsigned int jresult ;
26712 unsigned int jresult ;
26724 unsigned int jresult ;
26740 arg2 = jarg2 ? true :
false;
26748 (arg1)->SetPerformed(arg2);
26760 unsigned int jresult ;
26777 (arg1)->WhenPerformedBound(arg2);
26787 arg2 = [jarg2]() ->
void {
26788 return (*(
void(*)())jarg2)();
26791 (arg1)->WhenPerformedBound(arg2);
26801 (arg1)->WhenAnything(arg2);
26811 arg2 = [jarg2]() ->
void {
26812 return (*(
void(*)())jarg2)();
26815 (arg1)->WhenAnything(arg2);
26826 jresult = (
void *)result;
26838 jresult = (
void *)result;
26850 jresult = (
void *)result;
26862 jresult = (
void *)result;
26874 arg2 = (
int64)jarg2;
26876 jresult = (
void *)result;
26888 arg2 = (
int64)jarg2;
26890 jresult = (
void *)result;
26902 arg2 = (
int64)jarg2;
26904 jresult = (
void *)result;
26928 jresult = (
void *)result;
26942 jresult = (
void *)result;
26956 jresult = (
void *)result;
26970 jresult = (
void *)result;
26984 jresult = (
void *)result;
26998 jresult = (
void *)result;
27012 jresult = (
void *)result;
27026 jresult = (
void *)result;
27040 arg3 = (
int64)jarg3;
27042 jresult = (
void *)result;
27056 arg3 = (
int64)jarg3;
27058 jresult = (
void *)result;
27072 arg3 = (
int64)jarg3;
27074 jresult = (
void *)result;
27088 arg3 = (
int64)jarg3;
27090 jresult = (
void *)result;
27104 arg3 = (
int64)jarg3;
27106 jresult = (
void *)result;
27120 arg3 = (
int64)jarg3;
27122 jresult = (
void *)result;
27136 arg3 = (
int64)jarg3;
27138 jresult = (
void *)result;
27152 arg3 = (
int64)jarg3;
27154 jresult = (
void *)result;
27166 arg2 = (
int64)jarg2;
27168 jresult = (
void *)result;
27180 arg2 = (
int64)jarg2;
27182 jresult = (
void *)result;
27194 arg2 = (
int64)jarg2;
27196 jresult = (
void *)result;
27208 arg2 = (
int64)jarg2;
27210 jresult = (
void *)result;
27222 arg2 = (
int64)jarg2;
27224 jresult = (
void *)result;
27236 arg2 = (
int64)jarg2;
27238 jresult = (
void *)result;
27250 arg2 = (
int64)jarg2;
27252 jresult = (
void *)result;
27264 arg2 = (
int64)jarg2;
27266 jresult = (
void *)result;
27278 jresult = (
void *)result;
27290 jresult = (
void *)result;
27298 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
27299 std::vector< operations_research::IntVar * > *arg3 = 0 ;
27300 std::string *arg4 = 0 ;
27304 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
27309 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
27318 std::string arg4_str(jarg4);
27321 jresult = (
void *)result;
27337 std::string result;
27352 (arg1)->RankFirst(arg2);
27362 (arg1)->RankNotFirst(arg2);
27372 (arg1)->RankLast(arg2);
27382 (arg1)->RankNotLast(arg2);
27388 std::vector< int > *arg2 = 0 ;
27389 std::vector< int > *arg3 = 0 ;
27390 std::vector< int > *arg4 = 0 ;
27394 arg2 =
new std::vector<int>;
27395 arg2->reserve(length2);
27396 for(
int i = 0; i < length2; ++i) {
27397 arg2->emplace_back(jarg2[i]);
27401 arg3 =
new std::vector<int>;
27402 arg3->reserve(length3);
27403 for(
int i = 0; i < length3; ++i) {
27404 arg3->emplace_back(jarg3[i]);
27408 arg4 =
new std::vector<int>;
27409 arg4->reserve(length4);
27410 for(
int i = 0; i < length4; ++i) {
27411 arg4->emplace_back(jarg4[i]);
27414 (arg1)->RankSequence((std::vector< int >
const &)*arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4);
27436 jresult = (
void *)result;
27450 jresult = (
void *)result;
27456 long long jresult ;
27482 jresult = (
void *)result;
27491 (arg1)->Activate();
27499 (arg1)->Deactivate();
27504 unsigned int jresult ;
27528 jresult = (
void *)result;
27540 jresult = (
void *)result;
27551 (arg1)->Reset(arg2);
27562 jresult = (
void *)result;
27588 jresult = (
void *)result;
27610 long long jresult ;
27626 arg2 = (
int64)jarg2;
27627 (arg1)->SetMin(arg2);
27632 long long jresult ;
27648 arg2 = (
int64)jarg2;
27649 (arg1)->SetMax(arg2);
27654 long long jresult ;
27666 unsigned int jresult ;
27683 arg2 = (
int64)jarg2;
27684 arg3 = (
int64)jarg3;
27685 (arg1)->SetRange(arg2,arg3);
27694 arg2 = (
int64)jarg2;
27695 (arg1)->SetValue(arg2);
27702 std::string result;
27724 jresult = (
void *)result;
27736 jresult = (
void *)result;
27747 (arg1)->Reset(arg2);
27758 jresult = (
void *)result;
27784 jresult = (
void *)result;
27806 long long jresult ;
27818 long long jresult ;
27830 long long jresult ;
27842 long long jresult ;
27854 long long jresult ;
27866 long long jresult ;
27878 long long jresult ;
27890 long long jresult ;
27902 long long jresult ;
27914 long long jresult ;
27926 long long jresult ;
27938 long long jresult ;
27954 arg2 = (
int64)jarg2;
27955 (arg1)->SetStartMin(arg2);
27964 arg2 = (
int64)jarg2;
27965 (arg1)->SetStartMax(arg2);
27975 arg2 = (
int64)jarg2;
27976 arg3 = (
int64)jarg3;
27977 (arg1)->SetStartRange(arg2,arg3);
27986 arg2 = (
int64)jarg2;
27987 (arg1)->SetStartValue(arg2);
27996 arg2 = (
int64)jarg2;
27997 (arg1)->SetDurationMin(arg2);
28006 arg2 = (
int64)jarg2;
28007 (arg1)->SetDurationMax(arg2);
28017 arg2 = (
int64)jarg2;
28018 arg3 = (
int64)jarg3;
28019 (arg1)->SetDurationRange(arg2,arg3);
28028 arg2 = (
int64)jarg2;
28029 (arg1)->SetDurationValue(arg2);
28038 arg2 = (
int64)jarg2;
28039 (arg1)->SetEndMin(arg2);
28048 arg2 = (
int64)jarg2;
28049 (arg1)->SetEndMax(arg2);
28059 arg2 = (
int64)jarg2;
28060 arg3 = (
int64)jarg3;
28061 (arg1)->SetEndRange(arg2,arg3);
28070 arg2 = (
int64)jarg2;
28071 (arg1)->SetEndValue(arg2);
28080 arg2 = (
int64)jarg2;
28081 (arg1)->SetPerformedMin(arg2);
28090 arg2 = (
int64)jarg2;
28091 (arg1)->SetPerformedMax(arg2);
28101 arg2 = (
int64)jarg2;
28102 arg3 = (
int64)jarg3;
28103 (arg1)->SetPerformedRange(arg2,arg3);
28112 arg2 = (
int64)jarg2;
28113 (arg1)->SetPerformedValue(arg2);
28118 unsigned int jresult ;
28132 std::string result;
28154 jresult = (
void *)result;
28166 jresult = (
void *)result;
28177 (arg1)->Reset(arg2);
28188 jresult = (
void *)result;
28214 jresult = (
void *)result;
28238 std::vector< int > *result = 0 ;
28243 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
28252 std::vector< int > *result = 0 ;
28257 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
28266 std::vector< int > *result = 0 ;
28271 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
28279 std::vector< int > *arg2 = 0 ;
28280 std::vector< int > *arg3 = 0 ;
28281 std::vector< int > *arg4 = 0 ;
28285 arg2 =
new std::vector<int>;
28286 arg2->reserve(length2);
28287 for(
int i = 0; i < length2; ++i) {
28288 arg2->emplace_back(jarg2[i]);
28292 arg3 =
new std::vector<int>;
28293 arg3->reserve(length3);
28294 for(
int i = 0; i < length3; ++i) {
28295 arg3->emplace_back(jarg3[i]);
28299 arg4 =
new std::vector<int>;
28300 arg4->reserve(length4);
28301 for(
int i = 0; i < length4; ++i) {
28302 arg4->emplace_back(jarg4[i]);
28305 (arg1)->SetSequence((std::vector< int >
const &)*arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4);
28320 std::vector< int > *arg2 = 0 ;
28324 arg2 =
new std::vector<int>;
28325 arg2->reserve(length2);
28326 for(
int i = 0; i < length2; ++i) {
28327 arg2->emplace_back(jarg2[i]);
28330 (arg1)->SetForwardSequence((std::vector< int >
const &)*arg2);
28339 std::vector< int > *arg2 = 0 ;
28343 arg2 =
new std::vector<int>;
28344 arg2->reserve(length2);
28345 for(
int i = 0; i < length2; ++i) {
28346 arg2->emplace_back(jarg2[i]);
28349 (arg1)->SetBackwardSequence((std::vector< int >
const &)*arg2);
28358 std::vector< int > *arg2 = 0 ;
28362 arg2 =
new std::vector<int>;
28363 arg2->reserve(length2);
28364 for(
int i = 0; i < length2; ++i) {
28365 arg2->emplace_back(jarg2[i]);
28368 (arg1)->SetUnperformed((std::vector< int >
const &)*arg2);
28376 unsigned int jresult ;
28390 std::string result;
28414 jresult = (
void *)result;
28426 jresult = (
void *)result;
28448 unsigned int jresult ;
28529 (arg1)->AddObjective(arg2);
28537 (arg1)->ClearObjective();
28548 jresult = (
void *)result;
28554 unsigned int jresult ;
28566 long long jresult ;
28578 long long jresult ;
28590 long long jresult ;
28602 unsigned int jresult ;
28618 arg2 = (
int64)jarg2;
28619 (arg1)->SetObjectiveMin(arg2);
28628 arg2 = (
int64)jarg2;
28629 (arg1)->SetObjectiveMax(arg2);
28638 arg2 = (
int64)jarg2;
28639 (arg1)->SetObjectiveValue(arg2);
28649 arg2 = (
int64)jarg2;
28650 arg3 = (
int64)jarg3;
28651 (arg1)->SetObjectiveRange(arg2,arg3);
28664 jresult = (
void *)result;
28671 std::vector< operations_research::IntVar * > *arg2 = 0 ;
28674 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
28679 (arg1)->Add((std::vector< operations_research::IntVar * >
const &)*arg2);
28692 jresult = (
void *)result;
28698 long long jresult ;
28712 long long jresult ;
28726 long long jresult ;
28740 unsigned int jresult ;
28760 arg3 = (
int64)jarg3;
28772 arg3 = (
int64)jarg3;
28785 arg3 = (
int64)jarg3;
28786 arg4 = (
int64)jarg4;
28798 arg3 = (
int64)jarg3;
28812 jresult = (
void *)result;
28819 std::vector< operations_research::IntervalVar * > *arg2 = 0 ;
28822 arg2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
28827 (arg1)->Add((std::vector< operations_research::IntervalVar * >
const &)*arg2);
28840 jresult = (
void *)result;
28846 long long jresult ;
28860 long long jresult ;
28874 long long jresult ;
28888 long long jresult ;
28902 long long jresult ;
28916 long long jresult ;
28930 long long jresult ;
28944 long long jresult ;
28958 long long jresult ;
28972 long long jresult ;
28986 long long jresult ;
29000 long long jresult ;
29020 arg3 = (
int64)jarg3;
29032 arg3 = (
int64)jarg3;
29045 arg3 = (
int64)jarg3;
29046 arg4 = (
int64)jarg4;
29058 arg3 = (
int64)jarg3;
29070 arg3 = (
int64)jarg3;
29082 arg3 = (
int64)jarg3;
29095 arg3 = (
int64)jarg3;
29096 arg4 = (
int64)jarg4;
29108 arg3 = (
int64)jarg3;
29120 arg3 = (
int64)jarg3;
29132 arg3 = (
int64)jarg3;
29145 arg3 = (
int64)jarg3;
29146 arg4 = (
int64)jarg4;
29158 arg3 = (
int64)jarg3;
29170 arg3 = (
int64)jarg3;
29182 arg3 = (
int64)jarg3;
29195 arg3 = (
int64)jarg3;
29196 arg4 = (
int64)jarg4;
29208 arg3 = (
int64)jarg3;
29222 jresult = (
void *)result;
29229 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
29232 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
29237 (arg1)->Add((std::vector< operations_research::SequenceVar * >
const &)*arg2);
29250 jresult = (
void *)result;
29259 std::vector< int > *result = 0 ;
29265 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
29275 std::vector< int > *result = 0 ;
29281 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
29291 std::vector< int > *result = 0 ;
29297 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
29306 std::vector< int > *arg3 = 0 ;
29307 std::vector< int > *arg4 = 0 ;
29308 std::vector< int > *arg5 = 0 ;
29313 arg3 =
new std::vector<int>;
29314 arg3->reserve(length3);
29315 for(
int i = 0; i < length3; ++i) {
29316 arg3->emplace_back(jarg3[i]);
29320 arg4 =
new std::vector<int>;
29321 arg4->reserve(length4);
29322 for(
int i = 0; i < length4; ++i) {
29323 arg4->emplace_back(jarg4[i]);
29327 arg5 =
new std::vector<int>;
29328 arg5->reserve(length5);
29329 for(
int i = 0; i < length5; ++i) {
29330 arg5->emplace_back(jarg5[i]);
29333 (arg1)->SetSequence((
operations_research::SequenceVar const *)arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4,(std::vector< int >
const &)*arg5);
29349 std::vector< int > *arg3 = 0 ;
29354 arg3 =
new std::vector<int>;
29355 arg3->reserve(length3);
29356 for(
int i = 0; i < length3; ++i) {
29357 arg3->emplace_back(jarg3[i]);
29370 std::vector< int > *arg3 = 0 ;
29375 arg3 =
new std::vector<int>;
29376 arg3->reserve(length3);
29377 for(
int i = 0; i < length3; ++i) {
29378 arg3->emplace_back(jarg3[i]);
29391 std::vector< int > *arg3 = 0 ;
29396 arg3 =
new std::vector<int>;
29397 arg3->reserve(length3);
29398 for(
int i = 0; i < length3; ++i) {
29399 arg3->emplace_back(jarg3[i]);
29430 unsigned int jresult ;
29464 unsigned int jresult ;
29498 unsigned int jresult ;
29515 (arg1)->ActivateObjective();
29523 (arg1)->DeactivateObjective();
29528 unsigned int jresult ;
29542 std::string result;
29552 unsigned int jresult ;
29564 unsigned int jresult ;
29578 unsigned int jresult ;
29592 unsigned int jresult ;
29632 jresult = (
void *)result;
29644 jresult = (
void *)result;
29656 jresult = (
void *)result;
29668 jresult = (
void *)result;
29680 jresult = (
void *)result;
29692 jresult = (
void *)result;
29699 std::vector< operations_research::IntVar * > *arg2 = 0 ;
29701 std::vector< operations_research::IntVar * > *arg4 = 0 ;
29704 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
29710 arg4 = (std::vector< operations_research::IntVar * > *)jarg4;
29722 std::vector< operations_research::IntVar * > *arg2 = 0 ;
29727 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
29734 jresult = (
void *)result;
29749 std::vector< int64 > *arg2 = 0 ;
29750 std::vector< int64 > *arg3 = 0 ;
29754 arg2 =
new std::vector<int64>;
29755 arg2->reserve(length2);
29756 for(
int i = 0; i < length2; ++i) {
29757 arg2->emplace_back(jarg2[i]);
29761 arg3 =
new std::vector<int64>;
29762 arg3->reserve(length3);
29763 for(
int i = 0; i < length3; ++i) {
29764 arg3->emplace_back(jarg3[i]);
29767 (arg1)->AddWeightedSumLessOrEqualConstantDimension((std::vector< int64 >
const &)*arg2,(std::vector< int64 >
const &)*arg3);
29780 std::vector< int64 > *arg3 = 0 ;
29789 arg3 =
new std::vector<int64>;
29790 arg3->reserve(length3);
29791 for(
int i = 0; i < length3; ++i) {
29792 arg3->emplace_back(jarg3[i]);
29795 (arg1)->AddWeightedSumLessOrEqualConstantDimension(arg2,(std::vector< int64 >
const &)*arg3);
29805 std::vector< int64 > *arg3 = 0 ;
29814 arg3 =
new std::vector<int64>;
29815 arg3->reserve(length3);
29816 for(
int i = 0; i < length3; ++i) {
29817 arg3->emplace_back(jarg3[i]);
29820 (arg1)->AddWeightedSumLessOrEqualConstantDimension(arg2,(std::vector< int64 >
const &)*arg3);
29829 std::vector< int64 > *arg2 = 0 ;
29830 std::vector< operations_research::IntVar * > *arg3 = 0 ;
29834 arg2 =
new std::vector<int64>;
29835 arg2->reserve(length2);
29836 for(
int i = 0; i < length2; ++i) {
29837 arg2->emplace_back(jarg2[i]);
29840 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
29845 (arg1)->AddWeightedSumEqualVarDimension((std::vector< int64 >
const &)*arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
29855 std::vector< operations_research::IntVar * > *arg3 = 0 ;
29863 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
29868 (arg1)->AddWeightedSumEqualVarDimension(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3);
29874 std::vector< operations_research::IntVar * > *arg2 = 0 ;
29875 std::vector< int64 > *arg3 = 0 ;
29878 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
29884 arg3 =
new std::vector<int64>;
29885 arg3->reserve(length3);
29886 for(
int i = 0; i < length3; ++i) {
29887 arg3->emplace_back(jarg3[i]);
29890 (arg1)->AddSumVariableWeightsLessOrEqualConstantDimension((std::vector< operations_research::IntVar * >
const &)*arg2,(std::vector< int64 >
const &)*arg3);
29899 std::vector< int64 > *arg2 = 0 ;
29904 arg2 =
new std::vector<int64>;
29905 arg2->reserve(length2);
29906 for(
int i = 0; i < length2; ++i) {
29907 arg2->emplace_back(jarg2[i]);
29911 (arg1)->AddWeightedSumOfAssignedDimension((std::vector< int64 >
const &)*arg2,arg3);
29924 (arg1)->AddCountUsedBinDimension(arg2);
29934 (arg1)->AddCountAssignedItemsDimension(arg2);
29950 (arg1)->ClearAll();
29958 (arg1)->PropagateDelayed();
29966 (arg1)->InitialPropagate();
29974 (arg1)->Propagate();
29984 (arg1)->OneDomain(arg2);
29991 std::string result;
30001 unsigned int jresult ;
30024 (arg1)->SetImpossible(arg2,arg3);
30036 (arg1)->Assign(arg2,arg3);
30041 unsigned int jresult ;
30055 unsigned int jresult ;
30081 jresult = (
void *)result;
30092 (arg1)->SetAssigned(arg2);
30102 (arg1)->SetUnassigned(arg2);
30112 (arg1)->RemoveAllPossibleFromBin(arg2);
30122 (arg1)->AssignAllPossibleToBin(arg2);
30132 (arg1)->AssignFirstPossibleToBin(arg2);
30140 (arg1)->AssignAllRemainingItems();
30148 (arg1)->UnassignAllRemainingItems();
30177 jresult = (
void *)result;
30192 (arg1)->SetTransitionTime(arg2);
30197 long long jresult ;
30226 (arg1)->Initialize(arg2);
30236 (arg1)->RegisterNewSolution(arg2);
30246 (arg1)->GetNextSolution(arg2);
30251 unsigned int jresult ;
30258 result = (bool)(arg1)->SyncNeeded(arg2);
30279 jresult = (
void *)result;
30291 jresult = (
void *)result;
30301 jresult = (int)result;
30311 jresult = (int)result;
30321 jresult = (int)result;
30331 jresult = (int)result;
30341 jresult = (int)result;
30351 jresult = (int)result;
30361 jresult = (int)result;
30371 jresult = (int)result;
30381 jresult = (int)result;
30391 jresult = (
void *)result;
30405 unsigned int jresult ;
30414 result = (bool)(arg1)->MakeNextNeighbor(arg2,arg3);
30447 unsigned int jresult ;
30459 unsigned int jresult ;
30471 unsigned int jresult ;
30483 unsigned int jresult ;
30510 unsigned int jresult ;
30522 unsigned int jresult ;
30546 long long jresult ;
30552 arg2 = (
int64)jarg2;
30566 arg2 = (
int64)jarg2;
30568 jresult = (
void *)result;
30574 long long jresult ;
30580 arg2 = (
int64)jarg2;
30594 arg2 = (
int64)jarg2;
30595 temp3 = (long)jarg3;
30597 (arg1)->SetValue(arg2,(
long const &)*arg3);
30602 unsigned int jresult ;
30608 arg2 = (
int64)jarg2;
30620 arg2 = (
int64)jarg2;
30621 (arg1)->Activate(arg2);
30630 arg2 = (
int64)jarg2;
30631 (arg1)->Deactivate(arg2);
30637 std::vector< operations_research::IntVar * > *arg2 = 0 ;
30640 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
30645 (arg1)->AddVars((std::vector< operations_research::IntVar * >
const &)*arg2);
30662 jresult = (
void *)result;
30669 std::vector< operations_research::IntVar * > *arg1 = 0 ;
30673 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
30678 arg2 = jarg2 ? true :
false;
30680 jresult = (
void *)result;
30687 std::vector< operations_research::IntVar * > *arg1 = 0 ;
30690 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
30696 jresult = (
void *)result;
30710 unsigned int jresult ;
30724 unsigned int jresult ;
30740 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6);
30753 unsigned int jresult ;
30765 unsigned int jresult ;
30792 std::vector< int > *result = 0 ;
30795 arg2 = (
int64)jarg2;
30798 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
30811 arg2 = (
int64)jarg2;
30813 jresult = (
void *)result;
30822 std::vector< int > *result = 0 ;
30825 arg2 = (
int64)jarg2;
30828 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
30837 std::vector< int > *arg3 = 0 ;
30840 arg2 = (
int64)jarg2;
30842 arg3 =
new std::vector<int>;
30843 arg3->reserve(length3);
30844 for(
int i = 0; i < length3; ++i) {
30845 arg3->emplace_back(jarg3[i]);
30848 (arg1)->SetValue(arg2,(std::vector< int >
const &)*arg3);
30856 unsigned int jresult ;
30862 arg2 = (
int64)jarg2;
30874 arg2 = (
int64)jarg2;
30875 (arg1)->Activate(arg2);
30884 arg2 = (
int64)jarg2;
30885 (arg1)->Deactivate(arg2);
30891 std::vector< operations_research::SequenceVar * > *arg2 = 0 ;
30894 arg2 = (std::vector< operations_research::SequenceVar * > *)jarg2;
30899 (arg1)->AddVars((std::vector< operations_research::SequenceVar * >
const &)*arg2);
30916 jresult = (
void *)result;
30923 std::vector< operations_research::SequenceVar * > *arg1 = 0 ;
30926 arg1 = (std::vector< operations_research::SequenceVar * > *)jarg1;
30932 jresult = (
void *)result;
30949 std::vector< int > *result = 0 ;
30952 arg2 = (
int64)jarg2;
30955 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
30965 std::vector< int > *result = 0 ;
30968 arg2 = (
int64)jarg2;
30971 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
30980 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6);
30986 std::vector< operations_research::IntVar * > *arg1 = 0 ;
30989 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
30995 jresult = (
void *)result;
31012 (arg1)->InitFragments();
31025 unsigned int jresult ;
31042 (arg1)->AppendToFragment(arg2);
31059 unsigned int jresult ;
31071 unsigned int jresult ;
31085 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6);
31091 std::vector< operations_research::IntVar * > *arg1 = 0 ;
31094 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
31100 jresult = (
void *)result;
31114 long long jresult ;
31121 arg2 = (
int64)jarg2;
31122 arg3 = (
int64)jarg3;
31130 unsigned int jresult ;
31144 unsigned int jresult ;
31160 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7);
31173 unsigned int jresult ;
31201 long long jresult ;
31207 arg2 = (
int64)jarg2;
31215 unsigned int jresult ;
31229 unsigned int jresult ;
31248 (darg)->OnNodeInitialization();
31258 (darg)->OnNodeInitializationSwigPublic();
31263 unsigned int jresult ;
31277 unsigned int jresult ;
31291 unsigned int jresult ;
31298 arg2 = (
int64)jarg2;
31307 unsigned int jresult ;
31314 arg2 = (
int64)jarg2;
31323 long long jresult ;
31339 long long jresult ;
31360 arg2 = (
int64)jarg2;
31362 (darg)->SetNextBaseToIncrement(arg2);
31372 arg2 = (
int64)jarg2;
31374 (darg)->SetNextBaseToIncrementSwigPublic(arg2);
31379 unsigned int jresult ;
31386 arg2 = (
int64)jarg2;
31395 unsigned int jresult ;
31402 arg2 = (
int64)jarg2;
31411 unsigned int jresult ;
31425 unsigned int jresult ;
31438 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_director_connect___(
void *objarg,
SwigDirector_PathOperator::SWIG_Callback0_t callback0,
SwigDirector_PathOperator::SWIG_Callback1_t callback1,
SwigDirector_PathOperator::SWIG_Callback2_t callback2,
SwigDirector_PathOperator::SWIG_Callback3_t callback3,
SwigDirector_PathOperator::SWIG_Callback4_t callback4,
SwigDirector_PathOperator::SWIG_Callback5_t callback5,
SwigDirector_PathOperator::SWIG_Callback6_t callback6,
SwigDirector_PathOperator::SWIG_Callback7_t callback7,
SwigDirector_PathOperator::SWIG_Callback8_t callback8,
SwigDirector_PathOperator::SWIG_Callback9_t callback9,
SwigDirector_PathOperator::SWIG_Callback10_t callback10,
SwigDirector_PathOperator::SWIG_Callback11_t callback11,
SwigDirector_PathOperator::SWIG_Callback12_t callback12,
SwigDirector_PathOperator::SWIG_Callback13_t callback13,
SwigDirector_PathOperator::SWIG_Callback14_t callback14) {
31441 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9, callback10, callback11, callback12, callback13, callback14);
31494 unsigned int jresult ;
31505 arg4 = (
int64)jarg4;
31506 arg5 = (
int64)jarg5;
31514 unsigned int jresult ;
31526 unsigned int jresult ;
31582 long long jresult ;
31594 long long jresult ;
31606 long long jresult ;
31618 long long jresult ;
31634 jresult = (
void *)result;
31647 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_director_connect___(
void *objarg,
SwigDirector_LocalSearchFilter::SWIG_Callback0_t callback0,
SwigDirector_LocalSearchFilter::SWIG_Callback1_t callback1,
SwigDirector_LocalSearchFilter::SWIG_Callback2_t callback2,
SwigDirector_LocalSearchFilter::SWIG_Callback3_t callback3,
SwigDirector_LocalSearchFilter::SWIG_Callback4_t callback4,
SwigDirector_LocalSearchFilter::SWIG_Callback5_t callback5,
SwigDirector_LocalSearchFilter::SWIG_Callback6_t callback6,
SwigDirector_LocalSearchFilter::SWIG_Callback7_t callback7,
SwigDirector_LocalSearchFilter::SWIG_Callback8_t callback8,
SwigDirector_LocalSearchFilter::SWIG_Callback9_t callback9) {
31650 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9);
31659 jresult = (int)result;
31669 jresult = (int)result;
31680 if (arg1) (arg1)->filter = arg2;
31691 jresult = (
void *)result;
31702 if (arg1) (arg1)->event_type = arg2;
31713 jresult = (int)result;
31723 jresult = (
void *)result;
31739 std::string result;
31751 std::string result;
31762 SwigValueWrapper< std::vector< operations_research::LocalSearchFilterManager::FilterEvent > > arg1 ;
31763 std::vector< operations_research::LocalSearchFilterManager::FilterEvent > *argp1 ;
31766 argp1 = (std::vector< operations_research::LocalSearchFilterManager::FilterEvent > *)jarg1;
31773 jresult = (
void *)result;
31780 std::vector< operations_research::LocalSearchFilter * > arg1 ;
31781 std::vector< operations_research::LocalSearchFilter * > *argp1 ;
31784 argp1 = (std::vector< operations_research::LocalSearchFilter * > *)jarg1;
31791 jresult = (
void *)result;
31805 unsigned int jresult ;
31818 arg5 = (
int64)jarg5;
31819 arg6 = (
int64)jarg6;
31839 long long jresult ;
31851 long long jresult ;
31879 std::vector< operations_research::IntVar * > *arg1 = 0 ;
31882 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
31888 jresult = (
void *)result;
31915 std::vector< operations_research::IntVar * > *arg2 = 0 ;
31918 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
31923 (arg1)->AddVars((std::vector< operations_research::IntVar * >
const &)*arg2);
31948 jresult = (
void *)result;
31954 long long jresult ;
32005 SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_director_connect___(
void *objarg,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback0_t callback0,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback1_t callback1,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback2_t callback2,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback3_t callback3,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback4_t callback4,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback5_t callback5,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback6_t callback6,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback7_t callback7,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback8_t callback8,
SwigDirector_IntVarLocalSearchFilter::SWIG_Callback9_t callback9) {
32008 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7, callback8, callback9);
32023 std::string result;
32038 (arg1)->BeginConstraintInitialPropagation(arg2);
32048 (arg1)->EndConstraintInitialPropagation(arg2);
32060 (arg1)->BeginNestedConstraintInitialPropagation(arg2,arg3);
32072 (arg1)->EndNestedConstraintInitialPropagation(arg2,arg3);
32092 (arg1)->BeginDemonRun(arg2);
32102 (arg1)->EndDemonRun(arg2);
32112 (arg1)->StartProcessingIntegerVariable(arg2);
32122 (arg1)->EndProcessingIntegerVariable(arg2);
32128 std::string *arg2 = 0 ;
32135 std::string arg2_str(jarg2);
32137 (arg1)->PushContext((std::string
const &)*arg2);
32145 (arg1)->PopContext();
32156 arg3 = (
int64)jarg3;
32157 (arg1)->SetMin(arg2,arg3);
32168 arg3 = (
int64)jarg3;
32169 (arg1)->SetMax(arg2,arg3);
32181 arg3 = (
int64)jarg3;
32182 arg4 = (
int64)jarg4;
32183 (arg1)->SetRange(arg2,arg3,arg4);
32194 arg3 = (
int64)jarg3;
32195 (arg1)->SetMin(arg2,arg3);
32206 arg3 = (
int64)jarg3;
32207 (arg1)->SetMax(arg2,arg3);
32219 arg3 = (
int64)jarg3;
32220 arg4 = (
int64)jarg4;
32221 (arg1)->SetRange(arg2,arg3,arg4);
32232 arg3 = (
int64)jarg3;
32233 (arg1)->RemoveValue(arg2,arg3);
32244 arg3 = (
int64)jarg3;
32245 (arg1)->SetValue(arg2,arg3);
32257 arg3 = (
int64)jarg3;
32258 arg4 = (
int64)jarg4;
32259 (arg1)->RemoveInterval(arg2,arg3,arg4);
32266 std::vector< int64 > *arg3 = 0 ;
32271 arg3 =
new std::vector<int64>;
32272 arg3->reserve(length3);
32273 for(
int i = 0; i < length3; ++i) {
32274 arg3->emplace_back(jarg3[i]);
32277 (arg1)->SetValues(arg2,(std::vector< int64 >
const &)*arg3);
32287 std::vector< int64 > *arg3 = 0 ;
32292 arg3 =
new std::vector<int64>;
32293 arg3->reserve(length3);
32294 for(
int i = 0; i < length3; ++i) {
32295 arg3->emplace_back(jarg3[i]);
32298 (arg1)->RemoveValues(arg2,(std::vector< int64 >
const &)*arg3);
32312 arg3 = (
int64)jarg3;
32313 (arg1)->SetStartMin(arg2,arg3);
32324 arg3 = (
int64)jarg3;
32325 (arg1)->SetStartMax(arg2,arg3);
32337 arg3 = (
int64)jarg3;
32338 arg4 = (
int64)jarg4;
32339 (arg1)->SetStartRange(arg2,arg3,arg4);
32350 arg3 = (
int64)jarg3;
32351 (arg1)->SetEndMin(arg2,arg3);
32362 arg3 = (
int64)jarg3;
32363 (arg1)->SetEndMax(arg2,arg3);
32375 arg3 = (
int64)jarg3;
32376 arg4 = (
int64)jarg4;
32377 (arg1)->SetEndRange(arg2,arg3,arg4);
32388 arg3 = (
int64)jarg3;
32389 (arg1)->SetDurationMin(arg2,arg3);
32400 arg3 = (
int64)jarg3;
32401 (arg1)->SetDurationMax(arg2,arg3);
32413 arg3 = (
int64)jarg3;
32414 arg4 = (
int64)jarg4;
32415 (arg1)->SetDurationRange(arg2,arg3,arg4);
32426 arg3 = jarg3 ? true :
false;
32427 (arg1)->SetPerformed(arg2,arg3);
32439 (arg1)->RankFirst(arg2,arg3);
32451 (arg1)->RankNotFirst(arg2,arg3);
32463 (arg1)->RankLast(arg2,arg3);
32475 (arg1)->RankNotLast(arg2,arg3);
32482 std::vector< int > *arg3 = 0 ;
32483 std::vector< int > *arg4 = 0 ;
32484 std::vector< int > *arg5 = 0 ;
32489 arg3 =
new std::vector<int>;
32490 arg3->reserve(length3);
32491 for(
int i = 0; i < length3; ++i) {
32492 arg3->emplace_back(jarg3[i]);
32496 arg4 =
new std::vector<int>;
32497 arg4->reserve(length4);
32498 for(
int i = 0; i < length4; ++i) {
32499 arg4->emplace_back(jarg4[i]);
32503 arg5 =
new std::vector<int>;
32504 arg5->reserve(length5);
32505 for(
int i = 0; i < length5; ++i) {
32506 arg5->emplace_back(jarg5[i]);
32509 (arg1)->RankSequence(arg2,(std::vector< int >
const &)*arg3,(std::vector< int >
const &)*arg4,(std::vector< int >
const &)*arg5);
32541 std::string result;
32554 (arg1)->BeginOperatorStart();
32562 (arg1)->EndOperatorStart();
32585 arg3 = jarg3 ? true :
false;
32609 arg3 = jarg3 ? true :
false;
32631 arg3 = jarg3 ? true :
false;
32653 arg3 = jarg3 ? true :
false;
32685 long long jresult ;
32701 arg2 = (
int64)jarg2;
32709 (arg1)->SetMin(arg2);
32721 long long jresult ;
32737 arg2 = (
int64)jarg2;
32745 (arg1)->SetMax(arg2);
32762 arg2 = (
int64)jarg2;
32763 arg3 = (
int64)jarg3;
32771 (arg1)->SetRange(arg2,arg3);
32783 unsigned int jresult ;
32795 long long jresult ;
32811 arg2 = (
int64)jarg2;
32819 (arg1)->RemoveValue(arg2);
32836 arg2 = (
int64)jarg2;
32837 arg3 = (
int64)jarg3;
32838 (arg1)->RemoveInterval(arg2,arg3);
32848 (arg1)->WhenBound(arg2);
32858 (arg1)->WhenRange(arg2);
32868 (arg1)->WhenDomain(arg2);
32873 unsigned long long jresult ;
32885 unsigned int jresult ;
32891 arg2 = (
int64)jarg2;
32901 std::string result;
32929 arg2 = (
int64)jarg2;
32931 jresult = (
void *)result;
32943 arg2 = (
int64)jarg2;
32945 jresult = (
void *)result;
32957 arg2 = (
int64)jarg2;
32959 jresult = (
void *)result;
32971 arg2 = (
int64)jarg2;
32973 jresult = (
void *)result;
32982 (arg1)->RestoreValue();
32989 std::string result;
33015 jresult = (
void *)result;
33035 arg3 = (
int64)jarg3;
33036 (arg1)->AddIntegerVariableEqualValueClause(arg2,arg3);
33047 arg3 = (
int64)jarg3;
33048 (arg1)->AddIntegerVariableGreaterOrEqualValueClause(arg2,arg3);
33059 arg3 = (
int64)jarg3;
33060 (arg1)->AddIntegerVariableLessOrEqualValueClause(arg2,arg3);
33067 director->
swig_connect_director(callback0, callback1, callback2, callback3, callback4, callback5, callback6, callback7);
33083 (arg1)->EnterSearch();
33091 (arg1)->ExitSearch();
33096 unsigned int jresult ;
33111 (arg1)->BeginFail();
33119 (arg1)->NoMoreSolutions();
33137 (arg1)->ApplyDecision(arg2);
33147 (arg1)->RefuteDecision(arg2);
33155 (arg1)->OutputDecision();
33163 (arg1)->Maintain();
33171 (arg1)->BeginInitialPropagation();
33179 (arg1)->EndInitialPropagation();
33186 std::string result;
33200 jresult = (int)result;
33210 jresult = (int)result;
33220 jresult = (int)result;
33230 jresult = (int)result;
33240 jresult = (int)result;
33250 jresult = (int)result;
33260 jresult = (int)result;
33270 jresult = (int)result;
33280 jresult = (int)result;
33290 jresult = (int)result;
33300 jresult = (int)result;
33310 jresult = (int)result;
33320 jresult = (int)result;
33330 jresult = (int)result;
33340 jresult = (int)result;
33350 jresult = (int)result;
33360 jresult = (int)result;
33370 jresult = (int)result;
33380 jresult = (int)result;
33390 jresult = (int)result;
33400 jresult = (int)result;
33410 jresult = (int)result;
33420 jresult = (int)result;
33430 jresult = (int)result;
33440 jresult = (int)result;
33450 jresult = (int)result;
33460 jresult = (int)result;
33470 jresult = (int)result;
33480 jresult = (int)result;
33490 jresult = (int)result;
33500 jresult = (int)result;
33510 jresult = (int)result;
33520 jresult = (int)result;
33530 jresult = (int)result;
33540 jresult = (int)result;
33550 jresult = (int)result;
33560 jresult = (int)result;
33570 jresult = (int)result;
33580 jresult = (int)result;
33590 jresult = (int)result;
33600 jresult = (int)result;
33610 jresult = (int)result;
33620 jresult = (int)result;
33630 jresult = (int)result;
33640 jresult = (int)result;
33650 jresult = (int)result;
33660 jresult = (int)result;
33670 jresult = (int)result;
33680 jresult = (int)result;
33690 jresult = (int)result;
33700 jresult = (int)result;
33710 jresult = (int)result;
33720 jresult = (int)result;
33730 jresult = (int)result;
33740 jresult = (int)result;
33750 jresult = (int)result;
33760 jresult = (int)result;
33790 jresult = (
void *)result;
33803 (arg1)->InsertVoidConstraint(arg2,arg3);
33817 arg3 = (
int64)jarg3;
33820 jresult = (
void *)result;
33835 arg4 = (
int64)jarg4;
33837 (arg1)->InsertVarConstantConstraint(arg2,arg3,arg4,arg5);
33852 arg3 = (
int64)jarg3;
33853 arg4 = (
int64)jarg4;
33856 jresult = (
void *)result;
33872 arg4 = (
int64)jarg4;
33873 arg5 = (
int64)jarg5;
33875 (arg1)->InsertVarConstantConstantConstraint(arg2,arg3,arg4,arg5,arg6);
33892 jresult = (
void *)result;
33909 (arg1)->InsertExprExprConstraint(arg2,arg3,arg4,arg5);
33924 jresult = (
void *)result;
33939 (arg1)->InsertExprExpression(arg2,arg3,arg4);
33953 arg3 = (
int64)jarg3;
33956 jresult = (
void *)result;
33971 arg4 = (
int64)jarg4;
33973 (arg1)->InsertExprConstantExpression(arg2,arg3,arg4,arg5);
33990 jresult = (
void *)result;
34007 (arg1)->InsertExprExprExpression(arg2,arg3,arg4,arg5);
34023 arg4 = (
int64)jarg4;
34026 jresult = (
void *)result;
34043 arg5 = (
int64)jarg5;
34045 (arg1)->InsertExprExprConstantExpression(arg2,arg3,arg4,arg5,arg6);
34060 arg3 = (
int64)jarg3;
34061 arg4 = (
int64)jarg4;
34064 jresult = (
void *)result;
34080 arg4 = (
int64)jarg4;
34081 arg5 = (
int64)jarg5;
34083 (arg1)->InsertVarConstantConstantExpression(arg2,arg3,arg4,arg5,arg6);
34091 std::vector< int64 > *arg3 = 0 ;
34098 arg3 =
new std::vector<int64>;
34099 arg3->reserve(length3);
34100 for(
int i = 0; i < length3; ++i) {
34101 arg3->emplace_back(jarg3[i]);
34106 jresult = (
void *)result;
34118 std::vector< int64 > *arg4 = 0 ;
34125 arg4 =
new std::vector<int64>;
34126 arg4->reserve(length4);
34127 for(
int i = 0; i < length4; ++i) {
34128 arg4->emplace_back(jarg4[i]);
34132 (arg1)->InsertVarConstantArrayExpression(arg2,arg3,(std::vector< int64 >
const &)*arg4,arg5);
34142 std::vector< operations_research::IntVar * > *arg2 = 0 ;
34147 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
34154 jresult = (
void *)result;
34162 std::vector< operations_research::IntVar * > *arg3 = 0 ;
34167 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
34173 (arg1)->InsertVarArrayExpression(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4);
34180 std::vector< operations_research::IntVar * > *arg2 = 0 ;
34181 std::vector< int64 > *arg3 = 0 ;
34186 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
34192 arg3 =
new std::vector<int64>;
34193 arg3->reserve(length3);
34194 for(
int i = 0; i < length3; ++i) {
34195 arg3->emplace_back(jarg3[i]);
34200 jresult = (
void *)result;
34211 std::vector< operations_research::IntVar * > *arg3 = 0 ;
34212 std::vector< int64 > *arg4 = 0 ;
34217 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
34223 arg4 =
new std::vector<int64>;
34224 arg4->reserve(length4);
34225 for(
int i = 0; i < length4; ++i) {
34226 arg4->emplace_back(jarg4[i]);
34230 (arg1)->InsertVarArrayConstantArrayExpression(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,(std::vector< int64 >
const &)*arg4,arg5);
34240 std::vector< operations_research::IntVar * > *arg2 = 0 ;
34246 arg2 = (std::vector< operations_research::IntVar * > *)jarg2;
34251 arg3 = (
int64)jarg3;
34254 jresult = (
void *)result;
34262 std::vector< operations_research::IntVar * > *arg3 = 0 ;
34268 arg3 = (std::vector< operations_research::IntVar * > *)jarg3;
34273 arg4 = (
int64)jarg4;
34275 (arg1)->InsertVarArrayConstantExpression(arg2,(std::vector< operations_research::IntVar * >
const &)*arg3,arg4,arg5);
34286 jresult = (
void *)result;
34293 std::vector< int > *arg1 = 0 ;
34297 arg1 =
new std::vector<int>;
34298 arg1->reserve(length1);
34299 for(
int i = 0; i < length1; ++i) {
34300 arg1->emplace_back(jarg1[i]);
34304 jresult = (
void *)result;
34319 jresult = (
void *)result;
34376 (arg1)->RankFirst(arg2,arg3);
34388 (arg1)->RankLast(arg2,arg3);
34393 unsigned int jresult ;
34409 std::string result;
34419 unsigned int jresult ;
34420 std::vector< operations_research::IntVar * > *arg1 = 0 ;
34423 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
34435 unsigned int jresult ;
34436 std::vector< operations_research::IntVar * > *arg1 = 0 ;
34439 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
34451 unsigned int jresult ;
34452 std::vector< operations_research::IntVar * > *arg1 = 0 ;
34456 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
34461 arg2 = (
int64)jarg2;
34469 long long jresult ;
34470 std::vector< operations_research::IntVar * > *arg1 = 0 ;
34473 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
34485 long long jresult ;
34486 std::vector< operations_research::IntVar * > *arg1 = 0 ;
34489 arg1 = (std::vector< operations_research::IntVar * > *)jarg1;
34501 long long jresult ;
34506 arg1 = (
int64)jarg1;
34507 arg2 = (
int64)jarg2;
34515 long long jresult ;
34520 arg1 = (
int64)jarg1;
34521 arg2 = (
int64)jarg2;
34530 std::vector< int > *arg1 = 0 ;
34531 std::vector< int64 > result;
34534 arg1 =
new std::vector<int>;
34535 arg1->reserve(length1);
34536 for(
int i = 0; i < length1; ++i) {
34537 arg1->emplace_back(jarg1[i]);
34542 jresult =
new std::vector< int64 >((
const std::vector< int64> &)result);
34557 temp1 = (long)jarg1;
34560 jresult = (
void *)result;
34566 long long jresult ;
34585 temp3 = (long)jarg3;
34587 (arg1)->SetValue(arg2,(
long const &)*arg3);
34605 temp1 = jarg1 ? true :
false;
34608 jresult = (
void *)result;
34614 unsigned int jresult ;
34633 temp3 = jarg3 ? true :
false;
34635 (arg1)->SetValue(arg2,(
bool const &)*arg3);
34652 jresult = (
void *)result;
34666 jresult = (
void *)result;
34680 jresult = (
void *)result;
34696 jresult = (
void *)result;
34714 arg2 = (size_t)jarg2;
34715 (arg1)->Resize(arg2);
34720 unsigned int jresult ;
34760 unsigned int jresult ;
34782 jresult = (
void *)result;
34796 jresult = (
void *)result;
34830 unsigned int jresult ;
34854 jresult = (
void *)result;
34868 jresult = (
void *)result;
34882 jresult = (
void *)result;
34898 jresult = (
void *)result;
34916 arg2 = (size_t)jarg2;
34917 (arg1)->Resize(arg2);
34922 unsigned int jresult ;
34962 unsigned int jresult ;
34984 jresult = (
void *)result;
34998 jresult = (
void *)result;
35032 unsigned int jresult ;
35056 jresult = (
void *)result;
35070 jresult = (
void *)result;
35084 jresult = (
void *)result;
35100 jresult = (
void *)result;
35118 arg2 = (size_t)jarg2;
35119 (arg1)->Resize(arg2);
35124 unsigned int jresult ;
35164 unsigned int jresult ;
35186 jresult = (
void *)result;
35200 jresult = (
void *)result;
35234 unsigned int jresult ;
35263 arg3 = operations_research::RoutingNodeIndex(jarg3);
35266 jresult = (
void *)result;
35275 std::vector< operations_research::RoutingIndexManager::NodeIndex > *arg3 = 0 ;
35276 std::vector< operations_research::RoutingIndexManager::NodeIndex > *arg4 = 0 ;
35282 arg3 =
new std::vector<operations_research::RoutingNodeIndex>;
35283 arg3->reserve(length3);
35284 for(
int i = 0; i < length3; ++i) {
35285 arg3->emplace_back(jarg3[i]);
35289 arg4 =
new std::vector<operations_research::RoutingNodeIndex>;
35290 arg4->reserve(length4);
35291 for(
int i = 0; i < length4; ++i) {
35292 arg4->emplace_back(jarg4[i]);
35296 jresult = (
void *)result;
35352 long long jresult ;
35359 arg2 = operations_research::RoutingNodeIndex(jarg2);
35370 std::vector< operations_research::RoutingIndexManager::NodeIndex > *arg2 = 0 ;
35371 std::vector< int64 > result;
35375 arg2 =
new std::vector<operations_research::RoutingNodeIndex>;
35376 arg2->reserve(length2);
35377 for(
int i = 0; i < length2; ++i) {
35378 arg2->emplace_back(jarg2[i]);
35383 jresult =
new std::vector< int64 >((
const std::vector< int64> &)result);
35399 arg2 = (
int64)jarg2;
35402 jresult = (&result)->
value();
35414 const long size = (&result)->ByteSizeLong();
35415 jresult =
new uint8[size + 4];
35416 (&result)->SerializeWithCachedSizesToArray(jresult + 4);
35417 jresult[0] = size & 0xFF;
35418 jresult[1] = (size >> 8) & 0xFF;
35419 jresult[2] = (size >> 16) & 0xFF;
35420 jresult[3] = (size >> 24) & 0xFF;
35432 const long size = (&result)->ByteSizeLong();
35433 jresult =
new uint8[size + 4];
35434 (&result)->SerializeWithCachedSizesToArray(jresult + 4);
35435 jresult[0] = size & 0xFF;
35436 jresult[1] = (size >> 8) & 0xFF;
35437 jresult[2] = (size >> 16) & 0xFF;
35438 jresult[3] = (size >> 24) & 0xFF;
35447 std::string result;
35451 bool parsed_ok = arg1->ParseFromArray(jarg1, search_parameters_size);
35455 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
35472 jresult = (int)result;
35482 jresult = (int)result;
35492 jresult = (int)result;
35502 jresult = (int)result;
35512 jresult = (int)result;
35522 jresult = (int)result;
35532 jresult = (int)result;
35542 jresult = (int)result;
35553 if (arg1) (arg1)->vehicle_class = arg2;
35563 result = (int) ((arg1)->vehicle_class);
35574 arg2 = (
int64)jarg2;
35575 if (arg1) (arg1)->fixed_cost = arg2;
35580 long long jresult ;
35585 result = (
int64) ((arg1)->fixed_cost);
35596 jresult = (
void *)result;
35637 std::vector< int > *arg2 = (std::vector< int > *) 0 ;
35640 arg2 = (std::vector< int > *)jarg2;
35641 if (arg1) (arg1)->type_index_of_vehicle = *arg2;
35648 std::vector< int > *result = 0 ;
35651 result = (std::vector< int > *)& ((arg1)->type_index_of_vehicle);
35652 jresult = (
void *)result;
35659 std::vector< std::set< operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry > > *arg2 = (std::vector< std::set< operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry > > *) 0 ;
35662 arg2 = (std::vector< std::set< operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry > > *)jarg2;
35663 if (arg1) (arg1)->sorted_vehicle_classes_per_type = *arg2;
35670 std::vector< std::set< operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry > > *result = 0 ;
35673 result = (std::vector< std::set< operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry > > *)& ((arg1)->sorted_vehicle_classes_per_type);
35674 jresult = (
void *)result;
35681 std::vector< std::deque< int > > *arg2 = (std::vector< std::deque< int > > *) 0 ;
35684 arg2 = (std::vector< std::deque< int > > *)jarg2;
35685 if (arg1) (arg1)->vehicles_per_vehicle_class = *arg2;
35692 std::vector< std::deque< int > > *result = 0 ;
35695 result = (std::vector< std::deque< int > > *)& ((arg1)->vehicles_per_vehicle_class);
35696 jresult = (
void *)result;
35706 jresult = (
void *)result;
35720 long long jresult ;
35735 jresult = (&result)->
value();
35747 jresult = (&result)->
value();
35764 jresult = (
void *)result;
35782 bool parsed_ok = arg2->ParseFromArray(jarg2, parameters_size);
35786 "Unable to parse operations_research::RoutingModelParameters protocol message.");
35790 jresult = (
void *)result;
35879 unsigned int jresult ;
35885 std::string *arg6 = 0 ;
35890 arg3 = (
int64)jarg3;
35891 arg4 = (
int64)jarg4;
35892 arg5 = jarg5 ? true :
false;
35897 std::string arg6_str(jarg6);
35899 result = (bool)(arg1)->AddDimension(arg2,arg3,arg4,arg5,(std::string
const &)*arg6);
35906 unsigned int jresult ;
35908 std::vector< int > *arg2 = 0 ;
35912 std::string *arg6 = 0 ;
35917 arg2 =
new std::vector<int>;
35918 arg2->reserve(length2);
35919 for(
int i = 0; i < length2; ++i) {
35920 arg2->emplace_back(jarg2[i]);
35923 arg3 = (
int64)jarg3;
35924 arg4 = (
int64)jarg4;
35925 arg5 = jarg5 ? true :
false;
35930 std::string arg6_str(jarg6);
35932 result = (bool)(arg1)->AddDimensionWithVehicleTransits((std::vector< int >
const &)*arg2,arg3,arg4,arg5,(std::string
const &)*arg6);
35942 unsigned int jresult ;
35946 std::vector< int64 > arg4 ;
35948 std::string *arg6 = 0 ;
35953 arg3 = (
int64)jarg3;
35956 (&arg4)->reserve(length4);
35957 for(
int i = 0; i < length4; ++i) {
35958 (&arg4)->emplace_back(jarg4[i]);
35961 arg5 = jarg5 ? true :
false;
35966 std::string arg6_str(jarg6);
35968 result = (bool)(arg1)->AddDimensionWithVehicleCapacity(arg2,arg3,arg4,arg5,(std::string
const &)*arg6);
35975 unsigned int jresult ;
35977 std::vector< int > *arg2 = 0 ;
35979 std::vector< int64 > arg4 ;
35981 std::string *arg6 = 0 ;
35986 arg2 =
new std::vector<int>;
35987 arg2->reserve(length2);
35988 for(
int i = 0; i < length2; ++i) {
35989 arg2->emplace_back(jarg2[i]);
35992 arg3 = (
int64)jarg3;
35995 (&arg4)->reserve(length4);
35996 for(
int i = 0; i < length4; ++i) {
35997 (&arg4)->emplace_back(jarg4[i]);
36000 arg5 = jarg5 ? true :
false;
36005 std::string arg6_str(jarg6);
36007 result = (bool)(arg1)->AddDimensionWithVehicleTransitAndCapacity((std::vector< int >
const &)*arg2,arg3,arg4,arg5,(std::string
const &)*arg6);
36017 unsigned int jresult ;
36023 std::string *arg6 = 0 ;
36027 arg2 = (
int64)jarg2;
36028 arg3 = (
int64)jarg3;
36029 arg4 = (
int64)jarg4;
36030 arg5 = jarg5 ? true :
false;
36035 std::string arg6_str(jarg6);
36037 result = (bool)(arg1)->AddConstantDimensionWithSlack(arg2,arg3,arg4,arg5,(std::string
const &)*arg6);
36044 unsigned int jresult ;
36049 std::string *arg5 = 0 ;
36053 arg2 = (
int64)jarg2;
36054 arg3 = (
int64)jarg3;
36055 arg4 = jarg4 ? true :
false;
36060 std::string arg5_str(jarg5);
36062 result = (bool)(arg1)->AddConstantDimension(arg2,arg3,arg4,(std::string
const &)*arg5);
36069 unsigned int jresult ;
36071 std::vector< int64 > arg2 ;
36074 std::string *arg5 = 0 ;
36080 (&arg2)->reserve(length2);
36081 for(
int i = 0; i < length2; ++i) {
36082 (&arg2)->emplace_back(jarg2[i]);
36085 arg3 = (
int64)jarg3;
36086 arg4 = jarg4 ? true :
false;
36091 std::string arg5_str(jarg5);
36093 result = (bool)(arg1)->AddVectorDimension(arg2,arg3,arg4,(std::string
const &)*arg5);
36103 std::vector< operations_research::IntVar * > arg3 ;
36104 std::vector< operations_research::IntVar * > arg4 ;
36105 std::vector< operations_research::IntVar * > *argp3 ;
36106 std::vector< operations_research::IntVar * > *argp4 ;
36111 argp3 = (std::vector< operations_research::IntVar * > *)jarg3;
36117 argp4 = (std::vector< operations_research::IntVar * > *)jarg4;
36124 jresult = (
void *)result;
36130 unsigned int jresult ;
36132 std::string *arg2 = 0 ;
36140 std::string arg2_str(jarg2);
36151 std::string *arg2 = 0 ;
36159 std::string arg2_str(jarg2);
36162 jresult = (
void *)result;
36170 std::string *arg2 = 0 ;
36178 std::string arg2_str(jarg2);
36181 jresult = (
void *)result;
36188 std::string *arg2 = 0 ;
36195 std::string arg2_str(jarg2);
36197 (arg1)->SetPrimaryConstrainedDimension((std::string
const &)*arg2);
36204 std::string *result = 0 ;
36216 std::vector< int64 > *arg2 = 0 ;
36223 arg2 =
new std::vector<int64>;
36224 arg2->reserve(length2);
36225 for(
int i = 0; i < length2; ++i) {
36226 arg2->emplace_back(jarg2[i]);
36229 arg3 = (
int64)jarg3;
36230 arg4 = (
int64)jarg4;
36231 result = (arg1)->AddDisjunction((std::vector< int64 >
const &)*arg2,arg3,arg4);
36233 jresult = (&result)->
value();
36245 std::vector< int64 > *arg2 = 0 ;
36251 arg2 =
new std::vector<int64>;
36252 arg2->reserve(length2);
36253 for(
int i = 0; i < length2; ++i) {
36254 arg2->emplace_back(jarg2[i]);
36257 arg3 = (
int64)jarg3;
36258 result = (arg1)->AddDisjunction((std::vector< int64 >
const &)*arg2,arg3);
36260 jresult = (&result)->
value();
36272 std::vector< int64 > *arg2 = 0 ;
36277 arg2 =
new std::vector<int64>;
36278 arg2->reserve(length2);
36279 for(
int i = 0; i < length2; ++i) {
36280 arg2->emplace_back(jarg2[i]);
36283 result = (arg1)->AddDisjunction((std::vector< int64 >
const &)*arg2);
36285 jresult = (&result)->
value();
36298 std::vector< operations_research::RoutingModel::DisjunctionIndex > *result = 0 ;
36301 arg2 = (
int64)jarg2;
36302 result = (std::vector< operations_research::RoutingModel::DisjunctionIndex > *) &((
operations_research::RoutingModel const *)arg1)->GetDisjunctionIndices(arg2);
36304 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
36314 std::vector< int64 > *result = 0 ;
36318 arg2 = operations_research::RoutingDisjunctionIndex(jarg2);
36322 jresult =
new std::vector< int64 >((
const std::vector< int64> &)*result);
36329 long long jresult ;
36336 arg2 = operations_research::RoutingDisjunctionIndex(jarg2);
36345 long long jresult ;
36352 arg2 = operations_research::RoutingDisjunctionIndex(jarg2);
36376 (arg1)->IgnoreDisjunctionsAlreadyForcedToZero();
36382 std::vector< int64 > *arg2 = 0 ;
36387 arg2 =
new std::vector<int64>;
36388 arg2->reserve(length2);
36389 for(
int i = 0; i < length2; ++i) {
36390 arg2->emplace_back(jarg2[i]);
36393 arg3 = (
int64)jarg3;
36394 (arg1)->AddSoftSameVehicleConstraint((std::vector< int64 >
const &)*arg2,arg3);
36403 std::vector< int > *arg2 = 0 ;
36408 arg2 =
new std::vector<int>;
36409 arg2->reserve(length2);
36410 for(
int i = 0; i < length2; ++i) {
36411 arg2->emplace_back(jarg2[i]);
36414 arg3 = (
int64)jarg3;
36415 (arg1)->SetAllowedVehiclesForIndex((std::vector< int >
const &)*arg2,arg3);
36423 unsigned int jresult ;
36431 arg3 = (
int64)jarg3;
36444 arg2 = (
int64)jarg2;
36445 arg3 = (
int64)jarg3;
36446 (arg1)->AddPickupAndDelivery(arg2,arg3);
36457 arg2 = operations_research::RoutingDisjunctionIndex(jarg2);
36460 arg3 = operations_research::RoutingDisjunctionIndex(jarg3);
36462 (arg1)->AddPickupAndDeliverySets(arg2,arg3);
36472 (arg1)->SetPickupAndDeliveryPolicyOfAllVehicles(arg2);
36484 (arg1)->SetPickupAndDeliveryPolicyOfVehicle(arg2,arg3);
36497 jresult = (int)result;
36519 jresult = (int)result;
36529 jresult = (int)result;
36539 jresult = (int)result;
36549 jresult = (int)result;
36561 arg2 = (
int64)jarg2;
36564 (arg1)->SetVisitType(arg2,arg3,arg4);
36575 arg2 = (
int64)jarg2;
36586 std::vector< int > *result = 0 ;
36592 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
36602 std::vector< int > *result = 0 ;
36608 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
36621 arg2 = (
int64)jarg2;
36623 jresult = (int)result;
36632 (arg1)->CloseVisitTypes();
36656 (arg1)->AddHardTypeIncompatibility(arg2,arg3);
36668 (arg1)->AddTemporalTypeIncompatibility(arg2,arg3);
36676 absl::flat_hash_set< int > *result = 0 ;
36681 jresult = (
void *)result;
36687 unsigned int jresult ;
36699 unsigned int jresult ;
36713 absl::flat_hash_set< int > arg3 ;
36714 absl::flat_hash_set< int > *argp3 ;
36718 argp3 = (absl::flat_hash_set< int > *)jarg3;
36724 (arg1)->AddRequiredTypeAlternativesWhenAddingType(arg2,arg3);
36731 absl::flat_hash_set< int > arg3 ;
36732 absl::flat_hash_set< int > *argp3 ;
36736 argp3 = (absl::flat_hash_set< int > *)jarg3;
36742 (arg1)->AddRequiredTypeAlternativesWhenRemovingType(arg2,arg3);
36750 std::vector< absl::flat_hash_set< int > > *result = 0 ;
36755 jresult = (
void *)result;
36764 std::vector< absl::flat_hash_set< int > > *result = 0 ;
36769 jresult = (
void *)result;
36778 std::vector< absl::flat_hash_set< int > > *result = 0 ;
36783 jresult = (
void *)result;
36789 unsigned int jresult ;
36801 unsigned int jresult ;
36813 long long jresult ;
36819 arg2 = (
int64)jarg2;
36827 long long jresult ;
36834 arg2 = (
int64)jarg2;
36835 arg3 = (
int64)jarg3;
36843 long long jresult ;
36860 (arg1)->SetMaximumNumberOfActiveVehicles(arg2);
36882 (arg1)->SetArcCostEvaluatorOfAllVehicles(arg2);
36894 (arg1)->SetArcCostEvaluatorOfVehicle(arg2,arg3);
36903 arg2 = (
int64)jarg2;
36904 (arg1)->SetFixedCostOfAllVehicles(arg2);
36914 arg2 = (
int64)jarg2;
36916 (arg1)->SetFixedCostOfVehicle(arg2,arg3);
36921 long long jresult ;
36940 arg2 = (
int64)jarg2;
36941 arg3 = (
int64)jarg3;
36942 (arg1)->SetAmortizedCostFactorsOfAllVehicles(arg2,arg3);
36953 arg2 = (
int64)jarg2;
36954 arg3 = (
int64)jarg3;
36956 (arg1)->SetAmortizedCostFactorsOfVehicle(arg2,arg3,arg4);
36963 std::vector< int64 > *result = 0 ;
36968 jresult =
new std::vector< int64 >((
const std::vector< int64> &)*result);
36977 std::vector< int64 > *result = 0 ;
36982 jresult =
new std::vector< int64 >((
const std::vector< int64> &)*result);
36994 arg2 = jarg2 ? true :
false;
36996 (arg1)->ConsiderEmptyRouteCostsForVehicle(arg2,arg3);
37001 unsigned int jresult ;
37024 (arg1)->SetFirstSolutionEvaluator(arg2);
37034 (arg1)->AddLocalSearchOperator(arg2);
37044 (arg1)->AddSearchMonitor(arg2);
37050 std::function< void () > arg2 ;
37054 arg2 = [jarg2]() ->
void {
37055 return (*(
void(*)())jarg2)();
37058 (arg1)->AddAtSolutionCallback(arg2);
37068 (arg1)->AddVariableMinimizedByFinalizer(arg2);
37078 (arg1)->AddVariableMaximizedByFinalizer(arg2);
37089 arg3 = (
int64)jarg3;
37090 (arg1)->AddWeightedVariableMinimizedByFinalizer(arg2,arg3);
37101 arg3 = (
int64)jarg3;
37102 (arg1)->AddVariableTargetToFinalizer(arg2,arg3);
37110 (arg1)->CloseModel();
37121 bool parsed_ok = arg2->ParseFromArray(jarg2, search_parameters_size);
37125 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
37144 jresult = (
void *)result;
37156 jresult = (
void *)result;
37170 bool parsed_ok = arg2->ParseFromArray(jarg2, search_parameters_size);
37174 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
37178 jresult = (
void *)result;
37197 bool parsed_ok = arg3->ParseFromArray(jarg3, search_parameters_size);
37201 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
37205 jresult = (
void *)result;
37228 long long jresult ;
37246 jresult = (int)result;
37254 std::vector< int64 > *arg2 = 0 ;
37259 arg2 =
new std::vector<int64>;
37260 arg2->reserve(length2);
37261 for(
int i = 0; i < length2; ++i) {
37262 arg2->emplace_back(jarg2[i]);
37266 jresult = (
void *)result;
37275 int len2_1,
int len2_2[],
int64*
37276 jarg2,
unsigned int jarg3) {
37277 unsigned int jresult ;
37279 std::vector< std::vector< int64 > > *arg2 = 0 ;
37281 std::vector< std::vector< int64 > > result2 ;
37287 result2.resize(len2_1);
37289 int64* inner_array =
reinterpret_cast<int64*
>(jarg2);
37290 int actualIndex = 0;
37291 for (
int index1 = 0; index1 < len2_1; ++index1) {
37292 result2[index1].reserve(len2_2[index1]);
37293 for (
int index2 = 0; index2 < len2_2[index1]; ++index2) {
37294 const int64 value = inner_array[actualIndex];
37295 result2[index1].emplace_back(
value);
37302 arg3 = jarg3 ? true :
false;
37303 result = (bool)(arg1)->ApplyLocksToAllVehicles((std::vector< std::vector< int64 > >
const &)*arg2,arg3);
37316 jresult = (
void *)result;
37328 jresult = (
void *)result;
37334 unsigned int jresult ;
37336 std::string *arg2 = 0 ;
37344 std::string arg2_str(jarg2);
37355 std::string *arg2 = 0 ;
37363 std::string arg2_str(jarg2);
37366 jresult = (
void *)result;
37384 jresult = (
void *)result;
37390 int len2_1,
int len2_2[],
int64*
37391 jarg2,
unsigned int jarg3) {
37394 std::vector< std::vector< int64 > > *arg2 = 0 ;
37396 std::vector< std::vector< int64 > > result2 ;
37402 result2.resize(len2_1);
37404 int64* inner_array =
reinterpret_cast<int64*
>(jarg2);
37405 int actualIndex = 0;
37406 for (
int index1 = 0; index1 < len2_1; ++index1) {
37407 result2[index1].reserve(len2_2[index1]);
37408 for (
int index2 = 0; index2 < len2_2[index1]; ++index2) {
37409 const int64 value = inner_array[actualIndex];
37410 result2[index1].emplace_back(
value);
37417 arg3 = jarg3 ? true :
false;
37419 jresult = (
void *)result;
37425 int len2_1,
int len2_2[],
int64*
37426 jarg2,
unsigned int jarg3,
unsigned int jarg4,
void * jarg5) {
37427 unsigned int jresult ;
37429 std::vector< std::vector< int64 > > *arg2 = 0 ;
37433 std::vector< std::vector< int64 > > result2 ;
37439 result2.resize(len2_1);
37441 int64* inner_array =
reinterpret_cast<int64*
>(jarg2);
37442 int actualIndex = 0;
37443 for (
int index1 = 0; index1 < len2_1; ++index1) {
37444 result2[index1].reserve(len2_2[index1]);
37445 for (
int index2 = 0; index2 < len2_2[index1]; ++index2) {
37446 const int64 value = inner_array[actualIndex];
37447 result2[index1].emplace_back(
value);
37454 arg3 = jarg3 ? true :
false;
37455 arg4 = jarg4 ? true :
false;
37464 int len3_1,
int len3_2[],
int64*
37468 std::vector< std::vector< int64 > > *arg3 = (std::vector< std::vector< int64 > > *) (std::vector< std::vector< int64 > > *)0 ;
37469 std::vector< std::vector< int64 > > result3 ;
37479 result3.resize(len3_1);
37481 int64* flat_array =
reinterpret_cast<int64*
>(jarg3);
37482 int actualIndex = 0;
37483 for (
int index1 = 0; index1 < len3_1; ++index1) {
37484 result3[index1].reserve(len3_2[index1]);
37485 for (
int index2 = 0; index2 < len3_2[index1]; ++index2) {
37486 const int64 value = flat_array[actualIndex];
37487 result3[index1].emplace_back(
value);
37510 jresult = (
void *)result;
37528 jresult = (
void *)result;
37539 (arg1)->AddToAssignment(arg2);
37549 (arg1)->AddIntervalToAssignment(arg2);
37559 (arg1)->AddLocalSearchFilter(arg2);
37564 long long jresult ;
37578 long long jresult ;
37592 unsigned int jresult ;
37598 arg2 = (
int64)jarg2;
37606 unsigned int jresult ;
37612 arg2 = (
int64)jarg2;
37634 long long jresult ;
37646 arg3 = (
int64)jarg3;
37654 unsigned int jresult ;
37676 std::vector< operations_research::IntVar * > *result = 0 ;
37680 jresult = (
void *)result;
37688 std::vector< operations_research::IntVar * > *result = 0 ;
37692 jresult = (
void *)result;
37704 arg2 = (
int64)jarg2;
37706 jresult = (
void *)result;
37718 arg2 = (
int64)jarg2;
37720 jresult = (
void *)result;
37734 jresult = (
void *)result;
37748 jresult = (
void *)result;
37760 arg2 = (
int64)jarg2;
37762 jresult = (
void *)result;
37774 jresult = (
void *)result;
37780 long long jresult ;
37788 arg2 = (
int64)jarg2;
37789 arg3 = (
int64)jarg3;
37790 arg4 = (
int64)jarg4;
37798 unsigned int jresult ;
37810 long long jresult ;
37817 arg2 = (
int64)jarg2;
37818 arg3 = (
int64)jarg3;
37826 long long jresult ;
37833 arg2 = (
int64)jarg2;
37834 arg3 = (
int64)jarg3;
37842 long long jresult ;
37850 arg2 = (
int64)jarg2;
37851 arg3 = (
int64)jarg3;
37852 arg4 = (
int64)jarg4;
37866 arg2 = (
int64)jarg2;
37869 jresult = (&result)->
value();
37876 unsigned int jresult ;
37883 arg2 = operations_research::RoutingCostClassIndex(jarg2);
37922 arg2 = (
int64)jarg2;
37925 jresult = (&result)->
value();
37947 std::vector< int > *result = 0 ;
37953 jresult =
new std::vector< int >((
const std::vector< int> &)*result);
37966 jresult = (
void *)result;
37972 unsigned int jresult ;
37980 arg2 = (
int64)jarg2;
37981 arg3 = (
int64)jarg3;
37982 arg4 = (
int64)jarg4;
37993 std::string *arg3 = 0 ;
37994 std::string result;
38006 std::string arg3_str(jarg3);
38021 jresult = (
void *)result;
38027 unsigned int jresult ;
38063 long long jresult ;
38075 long long jresult ;
38083 bool parsed_ok = arg2->ParseFromArray(jarg2, search_parameters_size);
38087 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
38100 long long jresult ;
38108 bool parsed_ok = arg2->ParseFromArray(jarg2, search_parameters_size);
38112 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
38125 unsigned int jresult ;
38151 jresult = (
void *)result;
38165 jresult = (
void *)result;
38205 jresult = (
void *)result;
38225 jresult = (
void *)result;
38233 std::string result;
38254 (arg1)->InitialPropagate();
38285 arg2 = jarg2 ? true :
false;
38287 jresult = (
void *)result;
38311 jresult = (
void *)result;
38335 jresult = (
void *)result;
38352 (arg1)->InitialPropagate();
38379 jresult = (
void *)result;
38385 long long jresult ;
38393 arg2 = (
int64)jarg2;
38394 arg3 = (
int64)jarg3;
38395 arg4 = (
int64)jarg4;
38403 long long jresult ;
38411 arg2 = (
int64)jarg2;
38412 arg3 = (
int64)jarg3;
38413 arg4 = (
int64)jarg4;
38427 arg2 = (
int64)jarg2;
38429 jresult = (
void *)result;
38441 arg2 = (
int64)jarg2;
38443 jresult = (
void *)result;
38455 arg2 = (
int64)jarg2;
38457 jresult = (
void *)result;
38469 arg2 = (
int64)jarg2;
38471 jresult = (
void *)result;
38479 std::vector< operations_research::IntVar * > *result = 0 ;
38483 jresult = (
void *)result;
38491 std::vector< operations_research::IntVar * > *result = 0 ;
38495 jresult = (
void *)result;
38503 std::vector< operations_research::IntVar * > *result = 0 ;
38507 jresult = (
void *)result;
38515 std::vector< operations_research::IntVar * > *result = 0 ;
38519 jresult = (
void *)result;
38530 arg2 = (
int64)jarg2;
38532 (arg1)->SetSpanUpperBoundForVehicle(arg2,arg3);
38542 arg2 = (
int64)jarg2;
38544 (arg1)->SetSpanCostCoefficientForVehicle(arg2,arg3);
38553 arg2 = (
int64)jarg2;
38554 (arg1)->SetSpanCostCoefficientForAllVehicles(arg2);
38563 arg2 = (
int64)jarg2;
38564 (arg1)->SetGlobalSpanCostCoefficient(arg2);
38575 arg2 = (
int64)jarg2;
38576 arg3 = (
int64)jarg3;
38577 arg4 = (
int64)jarg4;
38578 (arg1)->SetCumulVarSoftUpperBound(arg2,arg3,arg4);
38583 unsigned int jresult ;
38589 arg2 = (
int64)jarg2;
38597 long long jresult ;
38603 arg2 = (
int64)jarg2;
38611 long long jresult ;
38617 arg2 = (
int64)jarg2;
38631 arg2 = (
int64)jarg2;
38632 arg3 = (
int64)jarg3;
38633 arg4 = (
int64)jarg4;
38634 (arg1)->SetCumulVarSoftLowerBound(arg2,arg3,arg4);
38639 unsigned int jresult ;
38645 arg2 = (
int64)jarg2;
38653 long long jresult ;
38659 arg2 = (
int64)jarg2;
38667 long long jresult ;
38673 arg2 = (
int64)jarg2;
38682 std::vector< operations_research::IntervalVar * > arg2 ;
38686 std::vector< operations_research::IntervalVar * > *argp2 ;
38689 argp2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
38698 (arg1)->SetBreakIntervalsOfVehicle(arg2,arg3,arg4,arg5);
38704 std::vector< operations_research::IntervalVar * > arg2 ;
38706 std::vector< int64 > arg4 ;
38707 std::vector< operations_research::IntervalVar * > *argp2 ;
38710 argp2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
38719 (&arg4)->reserve(length4);
38720 for(
int i = 0; i < length4; ++i) {
38721 (&arg4)->emplace_back(jarg4[i]);
38724 (arg1)->SetBreakIntervalsOfVehicle(arg2,arg3,arg4);
38735 arg2 = (
int64)jarg2;
38736 arg3 = (
int64)jarg3;
38738 (arg1)->SetBreakDistanceDurationOfVehicle(arg2,arg3,arg4);
38746 (arg1)->InitializeBreaks();
38751 unsigned int jresult ;
38764 std::vector< operations_research::IntervalVar * > arg2 ;
38766 std::vector< int64 > arg4 ;
38768 std::vector< operations_research::IntervalVar * > *argp2 ;
38771 argp2 = (std::vector< operations_research::IntervalVar * > *)jarg2;
38780 (&arg4)->reserve(length4);
38781 for(
int i = 0; i < length4; ++i) {
38782 (&arg4)->emplace_back(jarg4[i]);
38790 (arg1)->SetBreakIntervalsOfVehicle(arg2,arg3,arg4,arg5);
38798 std::vector< operations_research::IntervalVar * > *result = 0 ;
38803 jresult = (
void *)result;
38843 jresult = (
void *)result;
38849 long long jresult ;
38855 arg2 = (
int64)jarg2;
38865 std::string *result = 0 ;
38881 arg2 = [jarg2](
int t,
int u) ->
int64 {
38882 return (*(
int64(*)(int, int))jarg2)(t, u);
38886 (arg1)->SetPickupToDeliveryLimitFunctionForPair(arg2,arg3);
38891 unsigned int jresult ;
38909 arg2 = (
int64)jarg2;
38910 arg3 = (
int64)jarg3;
38911 arg4 = (
int64)jarg4;
38912 (arg1)->AddNodePrecedence(arg2,arg3,arg4);
38917 long long jresult ;
38931 long long jresult ;
38945 long long jresult ;
38957 long long jresult ;
38969 long long jresult ;
38985 std::vector< operations_research::IntVar * > arg2 ;
38986 std::vector< int64 > arg3 ;
38987 std::vector< operations_research::IntVar * > *argp2 ;
38991 argp2 = (std::vector< operations_research::IntVar * > *)jarg2;
38999 (&arg3)->reserve(length3);
39000 for(
int i = 0; i < length3; ++i) {
39001 (&arg3)->emplace_back(jarg3[i]);
39005 jresult = (
void *)result;
39011 unsigned int jresult ;
39025 bool parsed_ok = arg2->ParseFromArray(jarg2, search_parameters_size);
39029 "Unable to parse operations_research::RoutingSearchParameters protocol message.");
39052 unsigned int jresult ;
39063 arg4 = (
int64)jarg4;
39064 arg5 = (
int64)jarg5;
39088 jresult = (
void *)result;
39104 std::string result;
39114 unsigned int jresult ;
39125 arg4 = (
int64)jarg4;
39126 arg5 = (
int64)jarg5;
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_5___(void *jarg1, int jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetStartMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN bool std_vector_Sl_operations_research_IntVar_Sm__Sg__Remove(std::vector< operations_research::IntVar * > *self, operations_research::IntVar *const &value)
@ KILL_BOTH
Backtracks to the previous decisions, i.e.
virtual void Synchronize(operations_research::Assignment const *assignment, operations_research::Assignment const *delta)
Synchronizes the filter with the current solution, delta being the difference with the solution passe...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_SetVariableToCleanOnFail___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterOrEqualVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRankLastInterval___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_sorted_vehicle_classes_per_type_set___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Reset___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGINTERN std::vector< operations_research::IntervalVar * > * std_vector_Sl_operations_research_IntervalVar_Sm__Sg__GetRange(std::vector< operations_research::IntervalVar * > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGINTERN int std_vector_Sl_operations_research_IntVar_Sm__Sg__LastIndexOf(std::vector< operations_research::IntVar * > *self, operations_research::IntVar *const &value)
The class IntVar is a subset of IntExpr.
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__RemoveAt(std::vector< operations_research::SearchMonitor * > *self, int index)
static const char kEquality[]
SWIGINTERN operations_research::DecisionBuilder * std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__getitemcopy(std::vector< operations_research::DecisionBuilder * > *self, int index)
static const DisjunctionIndex kNoDisjunction
Constant used to express the "no disjunction" index, returned when a node does not appear in any disj...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INT_VALUE_SIMPLE_get___()
virtual void ExitSearch()
End of the search.
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_IsDifferent___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Copy___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignVariableValueOrFail___(void *jarg1, void *jarg2, long long jarg3)
The class Iterator has two direct subclasses.
@ EXPR_EXPR_EXPRESSION_MAX
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMapDomain_get___()
virtual bool MakeOneNeighborSwigPublic()
int(SWIGSTDCALL * SWIG_Callback22_t)()
static const char kIsGreater[]
SWIG_CSharpExceptionArgumentCodes
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_persistent_impact_get___(void *jarg1)
RoutingVehicleClassIndex VehicleClassIndex
bool Check() override
This method is called to check the status of the limit.
IntVar * MakeIsDifferentCstVar(IntExpr *const var, int64 value)
status var of (var != value)
int64 MinVarArray(const std::vector< IntVar * > &vars)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Add___(void *jarg1, void *jarg2)
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__AddRange(std::vector< operations_research::SequenceVar * > *self, std::vector< operations_research::SequenceVar * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGuidedLocalSearch__SWIG_1___(void *jarg1, unsigned int jarg2, void *jarg3, void *jarg4, long long jarg5, void *jarg6, void *jarg7, double jarg8)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingNonStrictBoxesConstraint__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, int length4, int *jarg4, int length5, int *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVector__SWIG_1___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_DurationValue___(void *jarg1, void *jarg2)
IntVar * MakeIsEqualVar(IntExpr *const v1, IntExpr *v2)
status var of (v1 == v2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_setitem___(void *jarg1, int jarg2, long long jarg3)
int(SWIGSTDCALL * SWIG_Callback22_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_3___(void *jarg1, void *jarg2)
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_SWIGUpcast___(operations_research::OptimizeVar *jarg1)
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_SWIGUpcast___(operations_research::SearchLog *jarg1)
static const char kLinkExprVar[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetBreakIntervalsOfVehicle__SWIG_1___(void *jarg1, void *jarg2, int jarg3, int length4, int64 *jarg4)
@ CHOOSE_HIGHEST_MAX
Among unbound variables, select the variable with the highest maximal value.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Contains___(void *jarg1, long long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddIntervalToAssignment___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__SetRange(std::vector< operations_research::LocalSearchFilter * > *self, int index, std::vector< operations_research::LocalSearchFilter * > const &values)
virtual bool IsIncremental() const
@ STARTS_AT_START
t1 starts at t2 start, i.e. Start(t1) == Start(t2) + delay.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_RankLast___(void *jarg1, void *jarg2, int jarg3)
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__InsertRange(std::vector< operations_research::SymmetryBreaker * > *self, int index, std::vector< operations_research::SymmetryBreaker * > const &values)
RoutingTransitCallback1 TransitCallback1
virtual bool LocalOptimum()
When a local optimum is reached.
virtual ~SwigDirector_SearchLimit()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDeviation_get___()
SWIGINTERN std::vector< operations_research::SymmetryBreaker * > * std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__GetRange(std::vector< operations_research::SymmetryBreaker * > *self, int index, int count)
The following constraint ensures that incompatibilities and requirements between types are respected.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Reverse__SWIG_0___(void *jarg1)
ConstraintSolverParameters parameters() const
Stored Parameters.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAtStart___(void *jarg1, void *jarg2)
virtual void EndInitialPropagation()
After the initial propagation.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_SetValues___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_Init___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VOID_TRUE_CONSTRAINT_get___()
std::function< int64(int64, int64)> IndexEvaluator2
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_RemoveAt___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_MakePathSpansAndTotalSlacks___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RegisterIntVar___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_CSharpExceptionArgumentCallback_t)(const char *, const char *)
static const char kIntervalDisjunction[]
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Branches___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback10_t)()
virtual ~SwigDirector_DecisionBuilder()
SWIGINTERN void std_vector_Sl_int64_Sg__RemoveAt(std::vector< int64 > *self, int index)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackRevert, SWIG_Callback6_t callbackReset, SWIG_Callback7_t callbackGetSynchronizedObjectiveValue, SWIG_Callback8_t callbackGetAcceptedObjectiveValue, SWIG_Callback9_t callbackOnSynchronize)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Accept___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, long long jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SIZE_get___()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void RestartSearch()
Restart the search.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartMinArgument_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__Insert(std::vector< operations_research::IntVar * > *self, int index, operations_research::IntVar *const &x)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_RemoveAt___(void *jarg1, int jarg2)
IntVar * MakeIsEqualCstVar(IntExpr *const var, int64 value)
status var of (var == value)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_ToString___(void *jarg1)
SWIGINTERN operations_research::IntVar * std_vector_Sl_operations_research_IntVar_Sm__Sg__getitemcopy(std::vector< operations_research::IntVar * > *self, int index)
void(SWIGSTDCALL * SWIG_Callback19_t)()
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAfterEnd(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGEXPORT void SWIGSTDCALL SWIGRegisterExceptionArgumentCallbacks_operations_research_constraint_solver(SWIG_CSharpExceptionArgumentCallback_t argumentCallback, SWIG_CSharpExceptionArgumentCallback_t argumentNullCallback, SWIG_CSharpExceptionArgumentCallback_t argumentOutOfRangeCallback)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_WhenDomain__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Rand32___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_RestartSearchSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetSameVehicleIndicesOfIndex___(void *jarg1, int jarg2)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__RemoveAt(std::vector< operations_research::DecisionBuilder * > *self, int index)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__AddRange(std::vector< operations_research::LocalSearchOperator * > *self, std::vector< operations_research::LocalSearchOperator * > const &values)
virtual void EndFail()
After completing the backtrack.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Insert___(void *jarg1, int jarg2, void *jarg3)
virtual bool HoldsDelta() const
@ PICKUP_AND_DELIVERY_NO_ORDER
Any precedence is accepted.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsEqualCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::DecisionBuilder * > *self)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetAmortizedLinearCostFactorOfVehicles___(void *jarg1)
SWIGINTERN std::vector< operations_research::LocalSearchOperator * > * std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__GetRange(std::vector< operations_research::LocalSearchOperator * > *self, int index, int count)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModelVisitor_kLightElement2_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBetweenCt___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
static const char kDivide[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_CONSTANT_CONSTRAINT_MAX_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonEquality__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SetOptimizationDirection___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVarRelation__SWIG_1___(void *jarg1, void *jarg2, int jarg3, void *jarg4)
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_BeginVisitConstraint___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDisjunctiveConstraint___(void *jarg1, void *jarg2, char *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddVariableMaximizedByFinalizer___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeProd__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
@ ENDS_AT
t ends at d, i.e. End(t) == d.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_0___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5, unsigned int jarg6, unsigned int jarg7)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_AvoidsDate(operations_research::IntervalVar *self, int64 date)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SearchMonitorVector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_director_connect___(void *objarg, SwigDirector_PathOperator::SWIG_Callback0_t callback0, SwigDirector_PathOperator::SWIG_Callback1_t callback1, SwigDirector_PathOperator::SWIG_Callback2_t callback2, SwigDirector_PathOperator::SWIG_Callback3_t callback3, SwigDirector_PathOperator::SWIG_Callback4_t callback4, SwigDirector_PathOperator::SWIG_Callback5_t callback5, SwigDirector_PathOperator::SWIG_Callback6_t callback6, SwigDirector_PathOperator::SWIG_Callback7_t callback7, SwigDirector_PathOperator::SWIG_Callback8_t callback8, SwigDirector_PathOperator::SWIG_Callback9_t callback9, SwigDirector_PathOperator::SWIG_Callback10_t callback10, SwigDirector_PathOperator::SWIG_Callback11_t callback11, SwigDirector_PathOperator::SWIG_Callback12_t callback12, SwigDirector_PathOperator::SWIG_Callback13_t callback13, SwigDirector_PathOperator::SWIG_Callback14_t callback14)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SearchMonitor___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_getitemcopy___(void *jarg1, int jarg2)
@ GE
Move is accepted when the current objective value >= objective.Min.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_IS_NOT_EQUAL_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTargetArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationStartSyncedOnStartIntervalVar___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
std::vector< int64 > ToInt64Vector(const std::vector< int > &input)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarElement__SWIG_0___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_SolutionCount___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_Best___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitSetVariableValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetSequence___(void *jarg1, void *jarg2, int length3, int *jarg3, int length4, int *jarg4, int length5, int *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumLessOrEqual___(void *jarg1, void *jarg2, long long jarg3)
void(SWIGSTDCALL * SWIG_Callback7_t)()
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDifference_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_setitem___(void *jarg1, int jarg2, void *jarg3)
bool AreAllBooleans(const std::vector< IntVar * > &vars)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDifferenceOperation_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElement__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ROUTING_FAIL_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_Revert___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_HasFragmentsSwigExplicitBaseLns___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_MAX_get___()
virtual void BeginInitialPropagation()
Before the initial propagation.
virtual void VisitRankLastInterval(operations_research::SequenceVar *const sequence, int index)
int RegisterUnaryTransitCallback(TransitCallback1 callback)
Registers 'callback' and returns its index.
virtual bool Accept(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta, int64 objective_min, int64 objective_max)
Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_CrossesDate(operations_research::IntervalVar *self, int64 date)
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
static const char kSequenceArgument[]
static const char kNotBetween[]
bool SolveModelWithSat(const RoutingModel &model, const RoutingSearchParameters &search_parameters, const Assignment *initial_solution, Assignment *solution)
Attempts to solve the model using the cp-sat solver.
void(SWIGSTDCALL * SWIG_Callback4_t)(void *, long long)
virtual bool HoldsDelta() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Deactivate__SWIG_2___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_reserve___(void *jarg1, unsigned long jarg2)
static const char kSumLessOrEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Clear___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCapacityArgument_get___()
static const char kIntegerVariable[]
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_ToStringSwigExplicitOptimizeVar___(void *jarg1)
SwigDirector_RegularLimit(operations_research::Solver *const s, absl::Duration time, int64 branches, int64 failures, int64 solutions, bool smart_time_check, bool cumulative)
SWIGINTERN void std_vector_Sl_int64_Sg__InsertRange(std::vector< int64 > *self, int index, std::vector< long > const &values)
virtual ~DirectorException()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_EndMakeNextNeighbor___(void *jarg1, void *jarg2, unsigned int jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeVariableDomainFilter___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__RemoveRange(std::vector< operations_research::LocalSearchFilter * > *self, int index, int count)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_EndMin___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitUnknownDecision___(void *jarg1)
int ProgressPercent() override
Returns a percentage representing the propress of the search before reaching limits.
virtual void VisitRankLastInterval(SequenceVar *const sequence, int index)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__setitem(std::vector< operations_research::LocalSearchOperator * > *self, int index, operations_research::LocalSearchOperator *const &val)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__InsertRange(std::vector< std::vector< int > > *self, int index, std::vector< std::vector< int > > const &values)
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__RemoveAt(std::vector< operations_research::SymmetryBreaker * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitSplitVariableDomain___(void *jarg1, void *jarg2, long long jarg3, unsigned int jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_Size___(void *jarg1)
@ TYPE_SIMULTANEOUSLY_ADDED_AND_REMOVED
The visit doesn't have an impact on the number of types 'T' on the route, as it's (virtually) added a...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetStartMin___(void *jarg1, long long jarg2)
SWIGINTERN std::vector< operations_research::IntervalVar * > * std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Repeat(operations_research::IntervalVar *const &value, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetPerformedMin___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalBinaryRelation_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Accept___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetCumulVarSoftLowerBoundCoefficient___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_RemoveAt___(void *jarg1, int jarg2)
static const char kAllDifferent[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_14___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Deactivate___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTimeLimitArgument_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSearchLimitExtension_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_GetBaseNodeRestartPositionSwigExplicitPathOperator___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_EnterSearch___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMin__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVar___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, long long jarg5, long long jarg6, long long jarg7, unsigned int jarg8, char *jarg9)
SWIGEXPORT operations_research::AssignmentElement *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_SWIGUpcast___(operations_research::SequenceVarElement *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeStrictDisjunctiveConstraint___(void *jarg1, void *jarg2, char *jarg3)
virtual operations_research::Solver::DemonPriority priority() const
This method returns the priority of the demon.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetPerformedValue___(void *jarg1, long long jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_StartMin___(void *jarg1)
@ SWIG_CSharpOverflowException
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_EndNestedConstraintInitialPropagation___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kInversePermutation_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_RankFirst___(void *jarg1, int jarg2)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
static const char kSemiContinuous[]
@ IN_SEARCH
Executing the search code.
virtual std::string name() const
Object naming.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Max___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_PushContext___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_RemoveAt___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AT_START_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Solver_IntegerCastInfo__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVarBoundWatcher_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_EndDemonRun___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignment__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionPool_Initialize___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeImprovementLimit___(void *jarg1, void *jarg2, unsigned int jarg3, double jarg4, double jarg5, double jarg6, int jarg7)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CheckConstraint___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetSameVehicleRequiredTypeAlternativesOfType___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_VarType___(void *jarg1)
SWIG_CSharpExceptionCallback_t callback
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumEqualVarDimension__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackInitFragments, SWIG_Callback6_t callbackNextFragment)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_AddAtPosition___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_ToString___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_LastIndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SequenceVarLocalSearchOperatorTemplate___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllDifferent__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ArcIsMoreConstrainedThanArc___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_LocalOptimumSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EnterSearchSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_SetMin___(void *jarg1, long long jarg2)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNumberOfRejectsInFirstSolution___(void *jarg1, int search_parameters_size, uint8 *jarg2)
SWIGINTERN std::vector< long > * std_vector_Sl_int64_Sg__Repeat(long const &value, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntervalVarElement__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_MakeGuidedSlackFinalizer___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN void std_vector_Sl_int64_Sg__RemoveRange(std::vector< int64 > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchOperator___()
void PeriodicCheck() override
Periodic call to check limits in long running methods.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_SortedByColumn___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RegisterPositiveUnaryTransitCallback___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_CopyIntersection___(void *jarg1, void *jarg2)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackMakeNeighbor, SWIG_Callback8_t callbackOnNodeInitialization, SWIG_Callback9_t callbackRestartAtPathStartOnSynchronize, SWIG_Callback10_t callbackOnSamePathAsPreviousBase, SWIG_Callback11_t callbackGetBaseNodeRestartPosition, SWIG_Callback12_t callbackSetNextBaseToIncrement, SWIG_Callback13_t callbackConsiderAlternatives, SWIG_Callback14_t callbackInitPosition)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SPLIT_LOWER_HALF_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_use_last_conflict_get___(void *jarg1)
VarConstantConstraintType
SWIGINTERN void std_vector_Sl_int_Sg__RemoveAt(std::vector< int > *self, int index)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartMin___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_director_connect___(void *objarg, SwigDirector_OptimizeVar::SWIG_Callback0_t callback0, SwigDirector_OptimizeVar::SWIG_Callback1_t callback1, SwigDirector_OptimizeVar::SWIG_Callback2_t callback2, SwigDirector_OptimizeVar::SWIG_Callback3_t callback3, SwigDirector_OptimizeVar::SWIG_Callback4_t callback4, SwigDirector_OptimizeVar::SWIG_Callback5_t callback5, SwigDirector_OptimizeVar::SWIG_Callback6_t callback6, SwigDirector_OptimizeVar::SWIG_Callback7_t callback7, SwigDirector_OptimizeVar::SWIG_Callback8_t callback8, SwigDirector_OptimizeVar::SWIG_Callback9_t callback9, SwigDirector_OptimizeVar::SWIG_Callback10_t callback10, SwigDirector_OptimizeVar::SWIG_Callback11_t callback11, SwigDirector_OptimizeVar::SWIG_Callback12_t callback12, SwigDirector_OptimizeVar::SWIG_Callback13_t callback13, SwigDirector_OptimizeVar::SWIG_Callback14_t callback14, SwigDirector_OptimizeVar::SWIG_Callback15_t callback15, SwigDirector_OptimizeVar::SWIG_Callback16_t callback16, SwigDirector_OptimizeVar::SWIG_Callback17_t callback17, SwigDirector_OptimizeVar::SWIG_Callback18_t callback18, SwigDirector_OptimizeVar::SWIG_Callback19_t callback19, SwigDirector_OptimizeVar::SWIG_Callback20_t callback20, SwigDirector_OptimizeVar::SWIG_Callback21_t callback21, SwigDirector_OptimizeVar::SWIG_Callback22_t callback22, SwigDirector_OptimizeVar::SWIG_Callback23_t callback23, SwigDirector_OptimizeVar::SWIG_Callback24_t callback24, SwigDirector_OptimizeVar::SWIG_Callback25_t callback25)
virtual void InitFragments()
virtual void Relax(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Lets the filter know what delta and deltadelta will be passed in the next Accept().
virtual ~SwigDirector_RegularLimit()
virtual void Copy(operations_research::SearchLimit const *const limit)
Copy a limit.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
IntVar * MakeIsLessOrEqualVar(IntExpr *const left, IntExpr *const right)
status var of (left <= right)
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SolutionCollector__SWIG_1___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback12_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Max___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_PROD_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_getitem___(void *jarg1, int jarg2)
SWIGINTERN std::vector< std::vector< long > >::value_type const & std_vector_Sl_std_vector_Sl_int64_Sg__Sg__getitem(std::vector< std::vector< int64 > > *self, int index)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kInt64ToInt64Extension_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAfterEndWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_OldMin___(void *jarg1)
SWIGINTERN std::vector< operations_research::DecisionBuilder * > * std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Repeat(operations_research::DecisionBuilder *const &value, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarConstantConstantConstraint___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, int jarg5)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CPFeasibilityFilter_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLastSolutionCollector__SWIG_0___(void *jarg1, void *jarg2)
virtual void Init()
This method is called when the search limit is initialized.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_BaseLns___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_Cumuls___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLess_get___()
std::string DebugString() const override
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_ToStringSwigExplicitSolutionCollector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_VehicleClassEntry_fixed_cost_set___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_IsEqual___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndNextDecision___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__AddRange(std::vector< operations_research::SymmetryBreaker * > *self, std::vector< operations_research::SymmetryBreaker * > const &values)
virtual void EndInitialPropagation()
After the initial propagation.
void EnterSearch() override
Beginning of the search.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_LastIndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AcceptDeltaSwigExplicitOptimizeVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Remove___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_Desinhibit___(void *jarg1, void *jarg2)
RoutingTransitCallback2 TransitCallback2
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_Start___(void *jarg1, void *jarg2)
static const char kDemandsArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SWAPACTIVE_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_FastAdd___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback21_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_Index___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAtEnd___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_MinVarArray___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAssumePathsArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_InsertAll__SWIG_1___(void *jarg1, int len2_1, int len2_2[], int *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Store___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ASSIGN_CENTER_VALUE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_director_connect___(void *objarg, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback0_t callback0, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback1_t callback1, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback2_t callback2, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback3_t callback3, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback4_t callback4, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback5_t callback5, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback6_t callback6, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback7_t callback7, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback8_t callback8, SwigDirector_IntVarLocalSearchFilter::SWIG_Callback9_t callback9)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_ResetSwigExplicitLocalSearchFilter___(void *jarg1)
static const char kCountUsedBinsExtension[]
static const char kAtMost[]
@ SWIG_CSharpIndexOutOfRangeException
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__setitem(std::vector< std::vector< int64 > > *self, int index, std::vector< int64 > const &val)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilter___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsBefore___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RevBool___(void *jarg1)
SWIGEXPORT uint8 *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDefaultRegularLimitParameters___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)(long long)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalDisjunction_get___()
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_OptimizeVar___(void *jarg1)
static const int64 kMaxValidValue
The largest acceptable value to be returned by EndMax()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_BeginVisitExtension___(void *jarg1, char *jarg2)
virtual std::string DebugString() const
void(SWIGSTDCALL * SWIG_Callback6_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IsEnd___(void *jarg1, long long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptSolutionSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTraceOperation_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kModulo_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Activate___(void *jarg1, long long jarg2)
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_IsUndecided___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ASSIGN_RANDOM_VALUE_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLessOrEqual_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolutionsLimit___(void *jarg1, long long jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_Accept___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback27_t)(void *)
SWIGINTERN std::vector< std::vector< int > >::value_type const & std_vector_Sl_std_vector_Sl_int_Sg__Sg__getitem(std::vector< std::vector< int > > *self, int index)
static const char kStartExpr[]
void Copy(const SearchLimit *const limit) override
Copy a limit.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_director_connect___(void *objarg, SwigDirector_LocalSearchOperator::SWIG_Callback0_t callback0, SwigDirector_LocalSearchOperator::SWIG_Callback1_t callback1, SwigDirector_LocalSearchOperator::SWIG_Callback2_t callback2, SwigDirector_LocalSearchOperator::SWIG_Callback3_t callback3, SwigDirector_LocalSearchOperator::SWIG_Callback4_t callback4, SwigDirector_LocalSearchOperator::SWIG_Callback5_t callback5)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Bound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOpposite___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ConcatenateOperators__SWIG_1___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AssignAllRemainingItems___(void *jarg1)
This is the base class for building an Lns operator.
static const char kStartsArgument[]
RoutingModelParameters DefaultRoutingModelParameters()
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__AddRange(std::vector< operations_research::DecisionBuilder * > *self, std::vector< operations_research::DecisionBuilder * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSubCircuit___(void *jarg1, void *jarg2)
@ ENDS_BEFORE
t ends before d, i.e. End(t) <= d.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Clear___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarLocalSearchOperator___(void *jarg1)
virtual int64 GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetCumulVarSoftUpperBound___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_value_selection_schema_get___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_solver___(void *jarg1)
@ CROSS
Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
@ TWOOPT
Operator which reverses a sub-chain of a path.
Constraint * MakeMapDomain(IntVar *const var, const std::vector< IntVar * > &actives)
This constraint maps the domain of 'var' onto the array of variables 'actives'.
SWIGINTERN void std_vector_Sl_int_Sg__InsertRange(std::vector< int > *self, int index, std::vector< int > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterManager__SWIG_1___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_5___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_initialization_splits_get___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_IsDifferent___(void *jarg1, long long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_MayBePerformed___(void *jarg1)
virtual std::string DebugString() const
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Contains__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevBool_Value___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptNeighborSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddTemporalTypeIncompatibility___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_MAX_get___()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__Reverse__SWIG_1(std::vector< std::vector< int > > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarLocalSearchOperator__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_AddObjective___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_VehicleClassEntry_vehicle_class_get___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Clear___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_IndexOf___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback5_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AcceptedNeighbors___(void *jarg1)
The base class of all search logs that periodically outputs information when the search is running.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSequenceVariable_get___()
virtual std::string DebugString() const
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
virtual bool AtSolution()
This method is called when a valid solution is found.
#define SWIG_RuntimeError
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_TSPLNS_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_MutablePreAssignment___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAbsEqual_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetEndMin___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Compose__SWIG_3___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_GetAcceptedObjectiveValue___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchTrace___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetArcCostEvaluatorOfAllVehicles___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_ToString___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Contains__SWIG_0___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_AddRange___(void *jarg1, void *jarg2)
int Insert2(int64 v0, int64 v1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_EndVisitModel___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_SetRange___(void *jarg1, int jarg2, void *jarg3)
@ VAR_ARRAY_CONSTANT_ARRAY_EXPRESSION_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarElement__SWIG_0___()
@ SWIG_CSharpArgumentNullException
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_InitialPropagateWrapper___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Bound___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Restore___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Clear___(void *jarg1)
static const char kVariableUsageLessConstantExtension[]
virtual bool IsIncremental() const
SWIGINTERN void std_vector_Sl_int64_Sg__Reverse__SWIG_0(std::vector< int64 > *self)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchFilterManager___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarIterator___(void *jarg1)
@ CHOOSE_MAX_VALUE_IMPACT
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ActiveVehicleVar___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_MutableIntervalVarContainer___(void *jarg1)
@ DELAYED_PRIORITY
DELAYED_PRIORITY is the lowest priority: Demons will be processed after VAR_PRIORITY and NORMAL_PRIOR...
static const char kCumulsArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ProgressPercent___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNotMemberCt__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGINTERN std::vector< operations_research::SearchMonitor * > * new_std_vector_Sl_operations_research_SearchMonitor_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPathCumul_get___()
SWIGINTERN std::vector< operations_research::LocalSearchOperator * >::value_type const & std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__getitem(std::vector< operations_research::LocalSearchOperator * > *self, int index)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_SWIGUpcast___(operations_research::LocalSearchFilterManager *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_IsIncremental___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeEquality__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
SwigDirector_ChangeValue(std::vector< operations_research::IntVar * > const &vars)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetPrimaryConstrainedDimension___(void *jarg1)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__Reverse__SWIG_1(std::vector< std::vector< int64 > > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Cache___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetEndMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNotMemberCt__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptDelta___(void *jarg1, void *jarg2, void *jarg3)
virtual void EndInitialPropagation()
After the initial propagation.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSequencesArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenEndBound__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Insert__SWIG_1___(void *jarg1, int length2, int64 *jarg2)
SWIGINTERN std::vector< int > * std_vector_Sl_int_Sg__GetRange(std::vector< int > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Deactivate__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartSyncOnStartOperation_get___()
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_InitialPropagateWrapper___(void *jarg1)
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_3___(void *jarg1, void *jarg2, int jarg3, void *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Size___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_DIVIDE_get___()
static void SWIGUNUSED SWIG_CSharpSetPendingException(SWIG_CSharpExceptionCodes code, const char *msg)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_BooleanVar___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCoefficientsArgument_get___()
virtual bool InitPosition() const
Returns true if the operator needs to restart its initial position at each call to Start()
DirectorPureVirtualException(const char *msg)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarVector__SWIG_2___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptSwigExplicitSearchMonitor___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_AssignmentSequenceContainer___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Contains__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_UnassignAllRemainingItems___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_RankSequence___(void *jarg1, int length2, int *jarg2, int length3, int *jarg3, int length4, int *jarg4)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsEqual__SWIG_0(operations_research::IntExpr *self, int64 value)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone)
int RegisterPositiveTransitCallback(TransitCallback2 callback)
void(SWIGSTDCALL * SWIG_Callback18_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumLessOrEqualConstantDimension__SWIG_1___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
virtual void BeginFail()
Just when the failure occurs.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Solver__SWIG_0___(char *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Assignment__SWIG_0___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL SWIGRegisterStringCallback_operations_research_constraint_solver(SWIG_CSharpStringHelperCallback callback)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerArrayArgument___(void *jarg1, char *jarg2, int length3, int64 *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetVehicleTypeContainer___(void *jarg1)
std::string DebugString() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdEquality__SWIG_2___(void *jarg1, void *jarg2, int length3, int64 *jarg3, void *jarg4)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDepot___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_IndexOf___(void *jarg1, int jarg2)
SearchLimit * MakeClone() const override
Allocates a clone of the limit.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_1___(void *jarg1, void *jarg2)
SwigDirector_DecisionBuilder()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLexicalLess___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevBool_SetValue___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedOptimize__SWIG_0___(void *jarg1, unsigned int jarg2, void *jarg3, int length4, int64 *jarg4, long long jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_STATIC_GLOBAL_BEST_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_Name___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNeighborhoodLimit___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_RestoreValue___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RegisterTransitCallback___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_MakeOneNeighborSwigExplicitPathOperator___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarConstantConstantExpression___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, int jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_2___(void *jarg1, int length2, int *jarg2, char *jarg3)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_size___(void *jarg1)
@ STARTS_AFTER
t starts after d, i.e. Start(t) >= d.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SetUseFastLocalSearch___(void *jarg1, unsigned int jarg2)
virtual std::string DebugString() const
@ SPLIT_LOWER_HALF
Split the domain in two around the center, and choose the lower part first.
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackCheck, SWIG_Callback26_t callbackInit, SWIG_Callback27_t callbackCopy, SWIG_Callback28_t callbackMakeClone)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::LocalSearchFilter * > *self)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Contains__SWIG_2___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kUsageLessConstantExtension_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT uint8 *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultRoutingSearchParameters___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AtSolution___(void *jarg1)
virtual std::string DebugString() const
SWIGEXPORT operations_research::IntVarLocalSearchOperator *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_SWIGUpcast___(operations_research::BaseLns *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
long long(SWIGSTDCALL * SWIG_Callback7_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLeftArgument_get___()
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsMember__SWIG_0(operations_research::IntExpr *self, std::vector< int64 > const &values)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_use_last_conflict_set___(void *jarg1, unsigned int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_EndFilterNeighbor___(void *jarg1, void *jarg2, unsigned int jarg3)
void(SWIGSTDCALL * SWIG_Callback5_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AtSolutionSwigExplicitOptimizeVar___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Copy___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPositionXArgument_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModelVisitor_kLightElement_get___()
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMinimize___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__setitem(std::vector< operations_research::SearchMonitor * > *self, int index, operations_research::SearchMonitor *const &val)
void Accept(ModelVisitor *const visitor) const override
Accepts the given model visitor.
VarConstantConstantExpressionType
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_FragmentSize___(void *jarg1)
@ STARTS_BEFORE
t starts before d, i.e. Start(t) <= d.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsGreaterOrEqual__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RevBool___(unsigned int jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_FilterEvent_event_type_get___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_MakeOneNeighbor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Constraint___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SequenceVar___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_OldMax___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCountArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Clear___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptUncheckedNeighborSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Assignment__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVarRelationWithDelay___(void *jarg1, void *jarg2, int jarg3, void *jarg4, long long jarg5)
static const char kCardsArgument[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_HasFragmentsSwigExplicitLocalSearchOperator___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_SUM_get___()
virtual IntVar * IsDifferent(int64 constant)=0
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_9___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5, int jarg6)
virtual void RestartSearch()
Restart the search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Solve__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreaterOrEqual__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAcceptFilter___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_solver___(void *jarg1)
SWIGEXPORT operations_research::Constraint *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_GlobalVehicleBreaksConstraint_SWIGUpcast___(operations_research::GlobalVehicleBreaksConstraint *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_NumDifferentValuesInColumn___(void *jarg1, int jarg2)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsGreater__SWIG_0(operations_research::IntExpr *self, int64 value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Commit___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIndexArgument_get___()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_PROD_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_AtSolution___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_VehicleClassEntry_fixed_cost_get___(void *jarg1)
SWIGINTERN std::vector< operations_research::LocalSearchFilter * > * new_std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kFalseConstraint_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetDurationValue___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedMaximize__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INTERVAL_SET_TIMES_FORWARD_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_End___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kGlobalCardinality_get___()
SwigDirector_SymmetryBreaker()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_UpdateLimits___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5)
static const char kVarsArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_DeactivateObjective___(void *jarg1)
static const char kRemoveValues[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Add___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ModelName___(void *jarg1)
virtual bool MakeOneNeighbor()
Creates a new neighbor.
@ OUTSIDE_SEARCH
Before search, after search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasTemporalTypeIncompatibilities___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartMaxArgument_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMirrorOperation_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSizeXArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_Install___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_variable_get___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::SequenceVar * > *self, int index, int count)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDisjunction__SWIG_2___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ASSIGN_MIN_VALUE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_random_seed_set___(void *jarg1, int jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_StartValue___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64Vector__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAt___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RegisterIntExpr___(void *jarg1, void *jarg2)
static const char kScalProdLessOrEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_EnterSearchSwigExplicitOptimizeVar___(void *jarg1)
bool Check() override
This method is called to check the status of the limit.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetStartValue___(void *jarg1, long long jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT uint8 *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_DefaultSolverParameters___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Value___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SIZE_LOWEST_MAX_get___()
@ MAKEACTIVE
Operator which inserts an inactive node into a path.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_VarWithName___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_display_level_set___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_TypeRegulationsChecker___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterManager_FilterEvent___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_BeginInitialPropagation___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Element__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_11___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBranchesLimit___(void *jarg1, long long jarg2)
virtual bool ConsiderAlternatives(int64 base_index) const
Indicates if alternatives should be considered when iterating over base nodes.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AcceptSolution___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_RemoveInterval___(void *jarg1, long long jarg2, long long jarg3)
static const char kDifferenceOperation[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_3___(void *jarg1, int jarg2, void *jarg3, void *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_DYNAMIC_GLOBAL_BEST_get___()
SWIGEXPORT operations_research::LocalSearchFilter *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_SWIGUpcast___(operations_research::IntVarLocalSearchFilter *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INTERVAL_DEFAULT_get___()
std::string DebugString() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_ClearAll___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetMaximumNumberOfActiveVehicles___(void *jarg1)
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElementEquality__SWIG_1___(void *jarg1, int length2, int *jarg2, void *jarg3, void *jarg4)
SWIGINTERN operations_research::IntervalVar * operations_research_IntervalVar_RelaxedMin(operations_research::IntervalVar *self)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DisjunctiveConstraint_TransitionTime___(void *jarg1, int jarg2, int jarg3)
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetStartValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN bool std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Contains(std::vector< operations_research::LocalSearchOperator * > *self, operations_research::LocalSearchOperator *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationEndSyncedOnStartIntervalVar___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_5___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6, void *jarg7)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_size___(void *jarg1)
virtual int64 ModifyValue(int64 index, int64 value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_SetMax___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DefaultPhaseParameters___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TypeRegulationsConstraint_Post___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::SearchMonitor * > *self)
This class adds reversibility to a POD type.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_director_connect___(void *objarg, SwigDirector_RegularLimit::SWIG_Callback0_t callback0, SwigDirector_RegularLimit::SWIG_Callback1_t callback1, SwigDirector_RegularLimit::SWIG_Callback2_t callback2, SwigDirector_RegularLimit::SWIG_Callback3_t callback3, SwigDirector_RegularLimit::SWIG_Callback4_t callback4, SwigDirector_RegularLimit::SWIG_Callback5_t callback5, SwigDirector_RegularLimit::SWIG_Callback6_t callback6, SwigDirector_RegularLimit::SWIG_Callback7_t callback7, SwigDirector_RegularLimit::SWIG_Callback8_t callback8, SwigDirector_RegularLimit::SWIG_Callback9_t callback9, SwigDirector_RegularLimit::SWIG_Callback10_t callback10, SwigDirector_RegularLimit::SWIG_Callback11_t callback11, SwigDirector_RegularLimit::SWIG_Callback12_t callback12, SwigDirector_RegularLimit::SWIG_Callback13_t callback13, SwigDirector_RegularLimit::SWIG_Callback14_t callback14, SwigDirector_RegularLimit::SWIG_Callback15_t callback15, SwigDirector_RegularLimit::SWIG_Callback16_t callback16, SwigDirector_RegularLimit::SWIG_Callback17_t callback17, SwigDirector_RegularLimit::SWIG_Callback18_t callback18, SwigDirector_RegularLimit::SWIG_Callback19_t callback19, SwigDirector_RegularLimit::SWIG_Callback20_t callback20, SwigDirector_RegularLimit::SWIG_Callback21_t callback21, SwigDirector_RegularLimit::SWIG_Callback22_t callback22, SwigDirector_RegularLimit::SWIG_Callback23_t callback23, SwigDirector_RegularLimit::SWIG_Callback24_t callback24, SwigDirector_RegularLimit::SWIG_Callback25_t callback25, SwigDirector_RegularLimit::SWIG_Callback26_t callback26, SwigDirector_RegularLimit::SWIG_Callback27_t callback27, SwigDirector_RegularLimit::SWIG_Callback28_t callback28)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_OnSamePathAsPreviousBaseSwigExplicitPathOperator___(void *jarg1, long long jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_DurationMin___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_DELAYED_PRIORITY_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_MakeIdenticalClone___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeModulo__SWIG_0___(void *jarg1, void *jarg2, long long jarg3)
void(SWIGSTDCALL * SWIG_Callback11_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_PerformedValue___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGINTERN int std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__LastIndexOf(std::vector< operations_research::DecisionBuilder * > *self, operations_research::DecisionBuilder *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_SetMin___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeConstraintInitialPropagateCallback___(void *jarg1, void *jarg2)
SWIGINTERN bool std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Remove(std::vector< operations_research::IntervalVar * > *self, operations_research::IntervalVar *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindExprExprConstraint___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindExprConstantExpression___(void *jarg1, void *jarg2, long long jarg3, int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Add___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Insert(std::vector< operations_research::DecisionBuilder * > *self, int index, operations_research::DecisionBuilder *const &x)
#define SWIG_OverflowError
std::function< int64(int, int)> PickupToDeliveryLimitFunction
Limits, in terms of maximum difference between the cumul variables, between the pickup and delivery a...
virtual void Relax(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Lets the filter know what delta and deltadelta will be passed in the next Accept().
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_EQUALITY_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTuplesArgument_get___()
static const char kAllowedAssignments[]
@ PICKUP_AND_DELIVERY_LIFO
Deliveries must be performed in reverse order of pickups.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INCREMENT_get___()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64Vector__SWIG_0___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CastConstraint_TargetVar___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_AssignmentElement___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_TSPOPT_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_AddObjective___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_FilteredNeighbors___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAfterStart(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetPickupAndDeliveryPolicyOfAllVehicles___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kConditionalExpr_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_ToString___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Reverse__SWIG_0___(void *jarg1)
static const char kConvexPiecewise[]
IntVar * MakeIsLessVar(IntExpr *const left, IntExpr *const right)
status var of (left < right)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5, void *jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SolutionCollector__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumEquality__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingModel__SWIG_1___(void *jarg1, int parameters_size, uint8 *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdEquality__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVectorVector___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetVisitType___(void *jarg1, long long jarg2)
void RefuteDecision(Decision *const d) override
Before refuting the decision.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDimensionWithVehicleCapacity___(void *jarg1, int jarg2, long long jarg3, int length4, int64 *jarg4, unsigned int jarg5, char *jarg6)
static const char kTimeLimitArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetPairIndicesOfType___(void *jarg1, int jarg2)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_size___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_LESS_OR_EQUAL_get___()
OptimizeVar * MakeMinimize(IntVar *const v, int64 step)
Creates a minimization objective.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchFilterManager_FilterEvent___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_Transits___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_2___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Repeat___(void *jarg1, int jarg2)
static const char kUsageLessConstantExtension[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddPickupAndDelivery___(void *jarg1, long long jarg2, long long jarg3)
SWIGINTERN int std_vector_Sl_int_Sg__getitemcopy(std::vector< int > *self, int index)
void(SWIGSTDCALL * SWIG_Callback11_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetPickupToDeliveryLimitFunctionForPair___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PosIntDivUp___(long long jarg1, long long jarg2)
void(SWIGSTDCALL * SWIG_Callback10_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_LastIndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsEqualCstVar___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Min___(void *jarg1)
virtual bool AtSolution()
This method is called when a valid solution is found.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, char *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MINIMIZATION_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SolutionCollector___(void *jarg1)
--— RevPartialSequence --—
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Contains___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAtEnd(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ClearLocalSearchState___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDelayedPathCumul_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_SetAssigned___(void *jarg1, int jarg2)
virtual IntVar * IsGreaterOrEqual(int64 constant)=0
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_CONSTANT_EXPRESSION_MAX_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_GetSynchronizedObjectiveValue___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldStartMax___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_NumSequenceVars___(void *jarg1)
@ VAR_CONSTANT_CONSTANT_CONSTRAINT_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ConcatenateOperators__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_RemoveAt___(void *jarg1, int jarg2)
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilder_NextWrapper___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePathCumul__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_EXPRESSION_MAX_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_BeginNextDecisionSwigExplicitOptimizeVar___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback5_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionPool_GetNextSolution___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_NON_EQUALITY_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_decision_builder_get___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_IS_LESS_OR_EQUAL_get___()
@ SWIG_CSharpOutOfMemoryException
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CurrentlyInSolve___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4, char *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SetAssignmentFromAssignment___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_MakeClone___(void *jarg1)
static const char kOptionalArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_BEFORE_get___()
virtual operations_research::Decision * Next(operations_research::Solver *const s)
This is the main method of the decision builder class.
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__RemoveRange(std::vector< operations_research::SymmetryBreaker * > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_OnNodeInitializationSwigExplicitPathOperator___(void *jarg1)
virtual void ApplyDecision(Decision *const d)
Before applying the decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntervalVariable___(void *jarg1, void *jarg2, char *jarg3, long long jarg4, void *jarg5)
static const char kStartSyncOnEndOperation[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kBetween_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_IS_GREATER_OR_EQUAL_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetTemporalTypeIncompatibilitiesOfType___(void *jarg1, int jarg2)
std::function< int64(int64, int64, int64)> IndexEvaluator3
virtual std::string Print() const
SWIGINTERN std::vector< operations_research::SearchMonitor * >::value_type const & std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__getitem(std::vector< operations_research::SearchMonitor * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RegisterDemon___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNoCycle__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_IsVar___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_EndInitialPropagation___(void *jarg1)
int64 TransitionTime(int before_index, int after_index)
bool AreAllBoundTo(const std::vector< IntVar * > &vars, int64 value)
Returns true if all variables are assigned to 'value'.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_MakeNeighbor___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_LESS_OR_EQUAL_get___()
static const char kInversePermutation[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Synchronize___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTemporalDisjunction__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingModel_VehicleTypeContainer___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNoCycle__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_kRelax_get___()
SWIGINTERN operations_research::SymmetryBreaker * std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__getitemcopy(std::vector< operations_research::SymmetryBreaker * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_director_connect___(void *objarg, SwigDirector_SearchLimit::SWIG_Callback0_t callback0, SwigDirector_SearchLimit::SWIG_Callback1_t callback1, SwigDirector_SearchLimit::SWIG_Callback2_t callback2, SwigDirector_SearchLimit::SWIG_Callback3_t callback3, SwigDirector_SearchLimit::SWIG_Callback4_t callback4, SwigDirector_SearchLimit::SWIG_Callback5_t callback5, SwigDirector_SearchLimit::SWIG_Callback6_t callback6, SwigDirector_SearchLimit::SWIG_Callback7_t callback7, SwigDirector_SearchLimit::SWIG_Callback8_t callback8, SwigDirector_SearchLimit::SWIG_Callback9_t callback9, SwigDirector_SearchLimit::SWIG_Callback10_t callback10, SwigDirector_SearchLimit::SWIG_Callback11_t callback11, SwigDirector_SearchLimit::SWIG_Callback12_t callback12, SwigDirector_SearchLimit::SWIG_Callback13_t callback13, SwigDirector_SearchLimit::SWIG_Callback14_t callback14, SwigDirector_SearchLimit::SWIG_Callback15_t callback15, SwigDirector_SearchLimit::SWIG_Callback16_t callback16, SwigDirector_SearchLimit::SWIG_Callback17_t callback17, SwigDirector_SearchLimit::SWIG_Callback18_t callback18, SwigDirector_SearchLimit::SWIG_Callback19_t callback19, SwigDirector_SearchLimit::SWIG_Callback20_t callback20, SwigDirector_SearchLimit::SWIG_Callback21_t callback21, SwigDirector_SearchLimit::SWIG_Callback22_t callback22, SwigDirector_SearchLimit::SWIG_Callback23_t callback23, SwigDirector_SearchLimit::SWIG_Callback24_t callback24, SwigDirector_SearchLimit::SWIG_Callback25_t callback25, SwigDirector_SearchLimit::SWIG_Callback26_t callback26, SwigDirector_SearchLimit::SWIG_Callback27_t callback27, SwigDirector_SearchLimit::SWIG_Callback28_t callback28)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElementEquality__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginNextDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_RemoveAt___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Reverse__SWIG_0___(void *jarg1)
static const char kNonEqual[]
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor, SWIG_Callback7_t callbackModifyValue)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsDifferentCstVar___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_1___(void *jarg1, int length2, int64 *jarg2, char *jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Min___(void *jarg1)
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNBestValueSolutionCollector__SWIG_0___(void *jarg1, void *jarg2, int jarg3, unsigned int jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_SELECT_MIN_IMPACT_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Remove___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsEqualCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_AddRange___(void *jarg1, void *jarg2)
VarTypes
This enum is used internally to do dynamic typing on subclasses of integer variables.
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_size___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDisjunction__SWIG_1___(void *jarg1, int length2, int64 *jarg2, long long jarg3)
void(SWIGSTDCALL * SWIG_Callback12_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMax__SWIG_3___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_DurationMin___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SolveWithParameters___(void *jarg1, int search_parameters_size, uint8 *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_FixedTransitVar___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SWIGUpcast___(operations_research::PropagationMonitor *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptSolution___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsBetweenVar___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartExpr___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
@ SPLIT_UPPER_HALF
Split the domain in two around the center, and choose the lower part first.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStepArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Contains___(void *jarg1, int jarg2)
virtual int64 GetBaseNodeRestartPositionSwigPublic(int base_index)
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarConstantArrayExpression___(void *jarg1, void *jarg2, void *jarg3, int length4, int64 *jarg4, int jarg5)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BasePathFilter_Accept___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, long long jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetDurationMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAtStartWithDelay___(void *jarg1, void *jarg2, long long jarg3)
static const char kSmartTimeCheckArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_4___(void *jarg1, int length2, int64 *jarg2)
void *(SWIGSTDCALL * SWIG_Callback1_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MultiArmedBanditConcatenateOperators___(void *jarg1, void *jarg2, double jarg3, double jarg4, unsigned int jarg5)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingBoxesConstraint__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, int length4, int *jarg4, int length5, int *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetDurationMax___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSmartTimeCheckArgument_get___()
std::function< bool(int64, int64, int64)> VariableValueComparator
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeClosureDemon___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Element__SWIG_1___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *, int)
void(SWIGSTDCALL * SWIG_Callback26_t)()
MarkerType
This enum is used internally in private methods Solver::PushState and Solver::PopState to tag states ...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_NumTuples___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAtEnd(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_NONE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Add___(void *jarg1, long long jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::LocalSearchOperator * > *self)
void(SWIGSTDCALL * SWIG_Callback2_t)()
virtual bool HasFragments() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElementEquality__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__RemoveRange(std::vector< operations_research::DecisionBuilder * > *self, int index, int count)
virtual bool IsIncremental() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetEndRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
A symmetry breaker is an object that will visit a decision and create the 'symmetrical' decision in r...
void AcceptNeighbor(Search *const search)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_AtSolution___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_ExitSearch___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeStatisticsModelVisitor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterVector__SWIG_0___()
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentElement_Activated___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDelayedPathCumul___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_MutableIntVarContainer___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__SetRange(std::vector< operations_research::SequenceVar * > *self, int index, std::vector< operations_research::SequenceVar * > const &values)
static const char kTransition[]
virtual ~SwigDirector_SearchMonitor()
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SequenceVarLocalSearchOperator___(void *jarg1)
NodeIndex IndexToNode(int64 index) const
static const char kCountAssignedItemsExtension[]
Extension names:
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NOT_SET_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_UnperformedPenaltyOrValue___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_NoMoreSolutionsSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_DurationMin___(void *jarg1)
std::string DebugString() const
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetArcCostForVehicle___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
std::string DebugString() const override
Pretty Print.
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
A sequence variable is a variable whose domain is a set of possible orderings of the interval variabl...
A search monitor is a simple set of callbacks to monitor all search events.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Compose__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AT_SOLUTION_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetPrimaryConstrainedDimension___(void *jarg1, char *jarg2)
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, int)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_Post___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_value_selection_schema_set___(void *jarg1, int jarg2)
@ TSPOPT
Sliding TSP operator.
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IsVehicleAllowedForIndex___(void *jarg1, int jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSymmetryManager__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
virtual void OnNodeInitialization()
Called by OnStart() after initializing node information.
@ ROUTING_FAIL
No solution found to the problem after calling RoutingModel::Solve().
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationIntervalVar__SWIG_0___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, unsigned int jarg5, char *jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_Interval___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterVector__SWIG_1___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, long long, unsigned int)
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ToString___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetEndMax___(void *jarg1, void *jarg2, long long jarg3)
IntVar * MakeIsMemberVar(IntExpr *const expr, const std::vector< int64 > &values)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RemoveValue___(void *jarg1, void *jarg2, long long jarg3)
virtual bool AcceptSolution()
This method is called when a solution is found.
static const char kLateDateArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumObjectiveFilter__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNullIntersect___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_var_selection_schema_set___(void *jarg1, int jarg2)
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionPool_RegisterNewSolution___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_ABS_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RegisterIntervalVar___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveDepth___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MemoryUsage___()
virtual std::string DebugString() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SearchLimit___(void *jarg1)
static const char kSortingConstraint[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_6___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, long long jarg5)
@ CHOOSE_PATH
Selects the next unbound variable on a path, the path being defined by the variables: var[i] correspo...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SequenceVarVector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarConstantConstraint___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_OnStart___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSemiContinuousExpr___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetBreakDistanceDurationOfVehicle___(void *jarg1, long long jarg2, long long jarg3, int jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Empty___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_RemoveAt___(void *jarg1, int jarg2)
void(SWIGSTDCALL * SWIG_Callback18_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DisjunctiveConstraint_SequenceVar___(void *jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsLessOrEqual__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DOMAIN_INT_VAR_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchPhaseParameters___()
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Value___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT operations_research::IntVarLocalSearchOperator *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_SWIGUpcast___(operations_research::PathOperator *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_MaxVarArray___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_capacity___(void *jarg1)
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...
bool IsUncheckedSolutionLimitReached() override
Returns true if the limit of solutions has been reached including unchecked solutions.
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetMax__SWIG_0___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchOperatorVector__SWIG_0___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_PerformedMin___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_SetMax___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetCumulVarSoftLowerBound___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__SetRange(std::vector< operations_research::SymmetryBreaker * > *self, int index, std::vector< operations_research::SymmetryBreaker * > const &values)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_Print___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_Prev___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_CHOOSE_MAX_VALUE_IMPACT_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_4___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback6_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Member__SWIG_1___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFalseConstraint__SWIG_1___(void *jarg1, char *jarg2)
static const char kIsEqual[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_DIFFERENCE_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_IsGreaterOrEqual___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_OUTSIDE_SEARCH_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolveModelWithSat___(void *jarg1, int search_parameters_size, uint8 *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CostVar___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Solver__SWIG_1___(char *jarg1, int parameters_size, uint8 *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_DIV_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessCstVar___(void *jarg1, void *jarg2, long long jarg3)
Usual limit based on wall_time, number of explored branches and number of failures in the search tree...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kElement_get___()
std::string DebugString() const override
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
virtual bool SkipUnchanged(int index) const
void(SWIGSTDCALL * SWIG_Callback12_t)(long long)
static const char kWeightedSumOfAssignedEqualVariableExtension[]
static const char kSizeXArgument[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonEquality__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
int64 PosIntDivUp(int64 e, int64 v)
static const char kEndExpr[]
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_GetNumberOfNodes___(void *jarg1)
static const char kOpposite[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_OnSynchronize___(void *jarg1, void *jarg2)
virtual ~SwigDirector_Demon()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_PopContext___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Contains___(void *jarg1, void *jarg2)
virtual std::string DebugString() const
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_ToString___(void *jarg1)
static const char kMinArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Value___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeVariableLessOrEqualValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_CONSTANT_INDEX_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Contains___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_5___(void *jarg1, void *jarg2, int length3, int *jarg3, int length4, int *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_AcceptUncheckedNeighbor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_PerformedExpr___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLexicalLessOrEqual___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN operations_research::IntVarIterator * operations_research_IntVar_GetDomain(operations_research::IntVar *self)
virtual bool OnSamePathAsPreviousBaseSwigPublic(int64 base_index)
SWIGINTERN int std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__LastIndexOf(std::vector< operations_research::SymmetryBreaker * > *self, operations_research::SymmetryBreaker *const &value)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kRangeArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhase__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNoCycle_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_Next___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_InstrumentsVariables___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRejectFilter___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_MakeNextNeighbor___(void *jarg1, void *jarg2, void *jarg3)
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Size___(void *jarg1)
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
@ CHOOSE_MIN_SLACK_RANK_FORWARD
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_SWIGUpcast___(operations_research::LocalSearchOperator *jarg1)
@ VAR_CONSTANT_CONSTANT_EXPRESSION_MAX
bool IsVehicleAllowedForIndex(int vehicle, int64 index)
Returns true if a vehicle is allowed to visit a given node.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_IsUncheckedSolutionLimitReached___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_ToStringSwigExplicitDemon___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
@ EXPR_EXPR_CONSTRAINT_MAX
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Store___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Zero___()
static const char kBranchesLimitArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_BEFORE_get___()
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_OldValue___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_Init___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDiv__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackMakeNextNeighbor, SWIG_Callback2_t callbackReset, SWIG_Callback3_t callbackHasFragments, SWIG_Callback4_t callbackHoldsDelta, SWIG_Callback5_t callbackIsIncremental, SWIG_Callback6_t callbackOnStart)
Holds semantic information stating that the 'expression' has been cast into 'variable' using the Var(...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsBetween_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_RawValue___(void *jarg1)
@ PICKUP_AND_DELIVERY_FIFO
Deliveries must be performed in the same order as pickups.
unsigned int(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetStartRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
virtual std::string DebugString() const
static const char kAbs[]
Constraint and Expression types.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchOperator___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_size___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ActivateObjective___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_IsUncheckedSolutionLimitReachedSwigExplicitSearchMonitor___(void *jarg1)
long long(SWIGSTDCALL * SWIG_Callback7_t)(long long, long long)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_Reset___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Clear___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPerformedExpr_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_State___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Insert___(void *jarg1, int jarg2, int jarg3)
SwigDirector_SearchLimit(operations_research::Solver *const s)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptNeighbor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetFirstSolutionEvaluator___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Clone___(void *jarg1)
virtual int64 GetAcceptedObjectiveValue() const
Objective value from the last time Accept() was called and returned true.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_TypeIncompatibilityChecker___(void *jarg1, unsigned int jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_kMinValidValue_get___()
virtual void RestartSearch()
Restart the search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_Model___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetRequiredTypeAlternativesWhenAddingType___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_IndexOf___(void *jarg1, long long jarg2)
static const char kNotMember[]
SWIGEXPORT unsigned long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_FailStamp___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_IsPossible___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ToStringSwigExplicitRegularLimit___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RemoveInterval___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NORMAL_PRIORITY_get___()
SWIGEXPORT operations_research::Constraint *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TypeRegulationsConstraint_SWIGUpcast___(operations_research::TypeRegulationsConstraint *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_vehicles_per_vehicle_class_set___(void *jarg1, void *jarg2)
@ STARTS_AFTER_START
t1 starts after t2 start, i.e. Start(t1) >= Start(t2) + delay.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBestValueSolutionCollector__SWIG_0___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperator_MakeOneNeighborSwigExplicitIntVarLocalSearchOperator___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertExprConstantExpression___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int jarg5)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAtEndWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_maintainer_get___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePrintModelVisitor___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_size___(void *jarg1)
virtual std::string DebugString() const
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAt(operations_research::IntervalVar *self, int64 date)
void(SWIGSTDCALL * SWIG_Callback5_t)()
virtual void EnterSearch()
Internal methods.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SIZE_HIGHEST_MAX_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CheckLimit___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDefaultPhase__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_kNumPriorities_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilder_ToStringSwigExplicitDecisionBuilder___(void *jarg1)
static const char kTargetArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Store___(void *jarg1)
This class is used to manage a pool of solutions.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_SetBackwardSequence___(void *jarg1, int length2, int *jarg2)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAt___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_IsLessOrEqual___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_FixedTransits___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarLocalSearchOperator__SWIG_2___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SWIGEXPORT operations_research::LocalSearchOperator *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_SWIGUpcast___(operations_research::VarLocalSearchOperator< operations_research::IntVar, int64, operations_research::IntVarLocalSearchHandler > *jarg1)
@ ENDS_AFTER_START
t1 ends after t2 start, i.e. End(t1) >= Start(t2) + delay.
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__InsertRange(std::vector< operations_research::LocalSearchFilter * > *self, int index, std::vector< operations_research::LocalSearchFilter * > const &values)
virtual void BeginInitialPropagation()
Before the initial propagation.
@ SWIG_CSharpDivideByZeroException
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__RemoveAt(std::vector< operations_research::SequenceVar * > *self, int index)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_kUnboundBooleanVarValue_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_RemoveValue___(void *jarg1, long long jarg2)
static const char kCover[]
std::string DebugString() const
!defined(SWIG)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Value___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_VERBOSE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_DecisionBuilder___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_PropagateDelayed___(void *jarg1)
SWIGEXPORT operations_research::IntExpr *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseIntExpr_SWIGUpcast___(operations_research::BaseIntExpr *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_size___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_CheckSwigExplicitRegularLimit___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_SetValue___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingIndexManager__SWIG_0___(int jarg1, int jarg2, int jarg3)
virtual void BeginFail()
Just when the failure occurs.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kGreater_get___()
virtual int64 GetBaseNodeRestartPosition(int base_index)
Returns the index of the node to which the base node of index base_index must be set to when it reach...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_AddNodePrecedence___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
void(SWIGSTDCALL * SWIG_Callback21_t)()
void ExitSearch() override
End of the search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGenericTabuSearch___(void *jarg1, unsigned int jarg2, void *jarg3, long long jarg4, void *jarg5, long long jarg6)
SWIGINTERN std::vector< operations_research::IntervalVar * > * new_std_vector_Sl_operations_research_IntervalVar_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_ToStringSwigExplicitConstraint___(void *jarg1)
static const char kCountArgument[]
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDisjunctionPenalty___(void *jarg1, int jarg2)
SWIGEXPORT operations_research::Constraint *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CastConstraint_SWIGUpcast___(operations_research::CastConstraint *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RevPartialSequence___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_Accept___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Compose__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN bool std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Remove(std::vector< operations_research::SymmetryBreaker * > *self, operations_research::SymmetryBreaker *const &value)
virtual bool MakeOneNeighbor()
This method should not be overridden. Override ModifyValue() instead.
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
@ ENDS_AFTER
t ends after d, i.e. End(t) >= d.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_SortedLexicographically___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdEquality__SWIG_3___(void *jarg1, void *jarg2, int length3, int *jarg3, void *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_LastIndexOf___(void *jarg1, void *jarg2)
virtual void InitialPropagate()
This method performs the initial propagation of the constraint.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedInterval___(void *jarg1, long long jarg2, long long jarg3, char *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
static const char kSumGreaterOrEqual[]
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_persistent_impact_set___(void *jarg1, unsigned int jarg2)
@ EXPR_CONSTANT_EXPRESSION_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeStoreAssignment___(void *jarg1, void *jarg2)
virtual bool IsIncremental() const
This class encapsulates an objective.
@ STARTS_AT_END
t1 starts at t2 end, i.e. Start(t1) == End(t2) + delay.
static const int kUnboundBooleanVarValue
std::string DebugString() const override
SWIGINTERN std::vector< operations_research::SequenceVar * >::value_type const & std_vector_Sl_operations_research_SequenceVar_Sm__Sg__getitem(std::vector< operations_research::SequenceVar * > *self, int index)
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_PeriodicCheckSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndMax___(void *jarg1)
virtual ~SwigDirector_Decision()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetPreTravelEvaluatorOfVehicle___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_SetMax___(void *jarg1, long long jarg2)
void(SWIGSTDCALL * SWIG_Callback15_t)()
static const char kFalseConstraint[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Element__SWIG_0___(void *jarg1, void *jarg2)
static const char kCumulativeArgument[]
This is the base class for all expressions that are not variables.
@ CHOOSE_STATIC_GLOBAL_BEST
Pairs are compared at the first call of the selector, and results are cached.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddWeightedVariableMinimizedByFinalizer___(void *jarg1, void *jarg2, long long jarg3)
static const char kMapDomain[]
virtual void BeginFail()
Just when the failure occurs.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
void BeginNextDecision(DecisionBuilder *const db) override
Before calling DecisionBuilder::Next.
SwigDirector_OptimizeVar(operations_research::Solver *const s, bool maximize, operations_research::IntVar *const a, int64 step)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_run_all_heuristics_set___(void *jarg1, unsigned int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_BeginVisitModel___(void *jarg1, char *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_GREATER_OR_EQUAL_get___()
Status
Status of the search.
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SolverState
This enum represents the state of the solver w.r.t. the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_InitializeBreaks___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_LK_get___()
@ PROBLEM_INFEASIBLE
After search, the model is infeasible.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kConvexPiecewise_get___()
bool MakeOneNeighbor() override
This method should not be overridden. Override MakeNeighbor() instead.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_SetRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__RemoveAt(std::vector< operations_research::LocalSearchFilter * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_PopState___(void *jarg1)
virtual bool Check()=0
This method is called to check the status of the limit.
@ EXTENDEDSWAPACTIVE
Operator which makes an inactive node active and an active one inactive.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_UNSPECIFIED_get___()
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_WallTime___(void *jarg1)
SWIGINTERN operations_research::IntExpr * operations_research_IntExpr_IndexOf__SWIG_0(operations_research::IntExpr *self, std::vector< int64 > const &vars)
virtual void Revert()
Cancels the changes made by the last Relax()/Accept() calls.
void(SWIGSTDCALL * SWIG_Callback10_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsGreater__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RevPartialSequence__SWIG_1___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ExitSearch___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_ToString___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Store___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_OnStart___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_Propagate___(void *jarg1)
virtual std::string DebugString() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_CONSTANT_EXPRESSION_MAX_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_MakeClone___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_One___()
virtual operations_research::SearchLimit * MakeClone() const
Allocates a clone of the limit.
SWIGEXPORT void SWIGSTDCALL SWIGRegisterExceptionCallbacks_operations_research_constraint_solver(SWIG_CSharpExceptionCallback_t applicationCallback, SWIG_CSharpExceptionCallback_t arithmeticCallback, SWIG_CSharpExceptionCallback_t divideByZeroCallback, SWIG_CSharpExceptionCallback_t indexOutOfRangeCallback, SWIG_CSharpExceptionCallback_t invalidCastCallback, SWIG_CSharpExceptionCallback_t invalidOperationCallback, SWIG_CSharpExceptionCallback_t ioCallback, SWIG_CSharpExceptionCallback_t nullReferenceCallback, SWIG_CSharpExceptionCallback_t outOfMemoryCallback, SWIG_CSharpExceptionCallback_t overflowCallback, SWIG_CSharpExceptionCallback_t systemCallback)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AddCastConstraint___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Demon___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Insert2___(void *jarg1, long long jarg2, long long jarg3)
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
SWIGEXPORT operations_research::PropagationBaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SWIGUpcast___(operations_research::Assignment *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAllDifferent_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetStartMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeModulo__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_SetForwardSequence___(void *jarg1, int length2, int *jarg2)
static const char kSumOperation[]
static const char kScalProd[]
static const char kElementEqual[]
virtual void Reset()
Sets the filter to empty solution.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetDurationMin___(void *jarg1, long long jarg2)
static const char kTraceOperation[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TypeRegulationsConstraint_InitialPropagateWrapper___(void *jarg1)
RoutingSearchParameters DefaultRoutingSearchParameters()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_LastIndexOf___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback19_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_GetSynchronizedObjectiveValueSwigExplicitLocalSearchFilter___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_RemoveValues___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RegularLimit___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5, unsigned int jarg6, unsigned int jarg7)
static const char kCapacityArgument[]
virtual void ExitSearch()
End of the search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Objective___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevInteger_Value___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleIndex___(void *jarg1, int jarg2)
@ CHOOSE_MAX_AVERAGE_IMPACT
virtual void Start(operations_research::Assignment const *assignment)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptDeltaSwigExplicitSearchMonitor___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMax__SWIG_2___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_int_Sg__setitem(std::vector< int > *self, int index, int const &val)
VehicleClassIndex GetVehicleClassIndexOfVehicle(int64 vehicle) const
The SequenceVarElement stores a partial representation of ranked interval variables in the underlying...
@ ASSIGN_CENTER_VALUE
Selects the first possible value which is the closest to the center of the domain of the selected var...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetVehicleClassIndexOfVehicle___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_ToString___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Reverse__SWIG_0___(void *jarg1)
std::string FindErrorInRoutingSearchParameters(const RoutingSearchParameters &search_parameters)
Returns an empty std::string if the routing search parameters are valid, and a non-empty,...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SearchLog___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AddLocalSearchMonitor___(void *jarg1, void *jarg2)
SWIGINTERN std::vector< operations_research::IntervalVar * >::value_type const & std_vector_Sl_operations_research_IntervalVar_Sm__Sg__getitem(std::vector< operations_research::IntervalVar * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_5___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Branches___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_FilterEvent_event_type_set___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_GetRange___(void *jarg1, int jarg2, int jarg3)
std::string DebugString() const override
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterManager__SWIG_0___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddSumVariableWeightsLessOrEqualConstantDimension___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_ModelVisitor___()
virtual void NoMoreSolutions()
When the search tree is finished.
SwigDirector_BaseLns(std::vector< operations_research::IntVar * > const &vars)
virtual void EndInitialPropagation()
After the initial propagation.
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__SetRange(std::vector< std::vector< int > > *self, int index, std::vector< std::vector< int > > const &values)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEndMaxArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_director_connect___(void *objarg, SwigDirector_BaseLns::SWIG_Callback0_t callback0, SwigDirector_BaseLns::SWIG_Callback1_t callback1, SwigDirector_BaseLns::SWIG_Callback2_t callback2, SwigDirector_BaseLns::SWIG_Callback3_t callback3, SwigDirector_BaseLns::SWIG_Callback4_t callback4, SwigDirector_BaseLns::SWIG_Callback5_t callback5, SwigDirector_BaseLns::SWIG_Callback6_t callback6)
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
SWIGINTERN bool std_vector_Sl_int64_Sg__Remove(std::vector< int64 > *self, long const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_ImprovementSearchLimit___(void *jarg1, void *jarg2, unsigned int jarg3, double jarg4, double jarg5, double jarg6, int jarg7)
virtual bool SkipUnchanged(int index) const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetSingleNodesOfType___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetCostClassIndexOfVehicle___(void *jarg1, long long jarg2)
@ TYPE_ON_VEHICLE_UP_TO_VISIT
With the following policy, the visit enforces that type 'T' is considered on the route from its start...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_RevertSwigExplicitLocalSearchFilter___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElement__SWIG_4___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RevInteger___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Assignment___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__InsertRange(std::vector< operations_research::SequenceVar * > *self, int index, std::vector< operations_research::SequenceVar * > const &values)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_KEEP_RIGHT_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Remove___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback21_t)()
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__RemoveRange(std::vector< std::vector< int64 > > *self, int index, int count)
void RegisterDemon(Solver *const solver, Demon *const demon, DemonProfiler *const monitor)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ReadAssignment___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Clear___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ComputeLowerBound___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_MIN_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::IntVar * > *self, int index, int count)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_PerformedMax___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_ToString___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAfterEndWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SPLIT_UPPER_HALF_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonEquality__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenDurationBound__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_HasCumulVarSoftLowerBound___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CloseModelWithParameters___(void *jarg1, int search_parameters_size, uint8 *jarg2)
A BaseObject is the root of all reversibly allocated objects.
virtual bool NextFragment()
IntVar * MakeIsLessCstVar(IntExpr *const var, int64 value)
status var of (var < value)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_OldValue___(void *jarg1, long long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_HasName___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_size___(void *jarg1)
virtual IntVar * IsLessOrEqual(int64 constant)=0
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_Synchronize___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Add___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::IntVarIterator * operations_research_IntVar_GetHoles(operations_research::IntVar *self)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_RestartSearch___(void *jarg1)
virtual void Start(operations_research::Assignment const *assignment)
SWIGINTERN operations_research::Constraint * operations_research_IntExpr_MapTo(operations_research::IntExpr *self, std::vector< operations_research::IntVar * > const &vars)
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIndexOfFirstMaxValueConstraint___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLinkExprVar_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_StartValue___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_NodesToIndices___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SequenceVarElement___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNotBetween_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Unperformed___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ObjectiveValue___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kValuesArgument_get___()
virtual std::string DebugString() const
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNotMember_get___()
static const char kSquare[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetEndMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeEquality__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_RANDOM_RANK_FORWARD_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_PrintSwigExplicitOptimizeVar___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumOfAssignedDimension___(void *jarg1, int length2, int64 *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_5___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, char *jarg5)
SWIGINTERN std::vector< operations_research::LocalSearchOperator * > * new_std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_Copy___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Member__SWIG_0___(void *jarg1, int length2, int64 *jarg2)
static const char kBetween[]
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__SetRange(std::vector< operations_research::IntVar * > *self, int index, std::vector< operations_research::IntVar * > const &values)
@ CHOOSE_MAX_SIZE
Among unbound variables, select the variable with the highest size.
void(SWIGSTDCALL * SWIG_Callback9_t)()
std::string DebugString() const override
static const char kInitialState[]
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterOrEqualCstVar___(void *jarg1, void *jarg2, long long jarg3)
virtual int64 GetAcceptedObjectiveValue() const
Objective value from the last time Accept() was called and returned true.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IsProfilingEnabled___(void *jarg1)
SWIGINTERN int std_vector_Sl_int_Sg__LastIndexOf(std::vector< int > *self, int const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePathConnected___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int length4, int64 *jarg4, void *jarg5)
IntVarStrategy
This enum describes the strategy used to select the next branching variable at each node during the s...
virtual void VisitSetVariableValue(operations_research::IntVar *const var, int64 value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLessOrEqual__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Unperformed___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__InsertRange(std::vector< std::vector< int64 > > *self, int index, std::vector< std::vector< int64 > > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_PreAssignment___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeConstraintAdder___(void *jarg1, void *jarg2)
static const char kVarValueWatcher[]
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAtStartWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
static const char kModuloArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleVar___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntervalVarVector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsEqual__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_Post___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntExpr_Member__SWIG_0(operations_research::IntExpr *self, std::vector< int64 > const &values)
static int64 MemoryUsage()
Current memory usage in bytes.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDemandsArgument_get___()
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
@ NO_CHANGE
Keeps the default behavior, i.e.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Element__SWIG_1___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_SQUARE_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTransitsArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ProgressPercent___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetPerformedMax___(void *jarg1, long long jarg2)
virtual ~SwigDirector_IntVarLocalSearchOperator()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRunWrapper, SWIG_Callback2_t callbackPriority)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_7___(void *jarg1, void *jarg2, int jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarVector__SWIG_2___(int jarg1)
virtual std::string DebugString() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Clear___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarVector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
@ SWITCH_BRANCHES
Applies right branch first.
static const char kDurationMaxArgument[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NameAllVariables___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEndMinArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_Check___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreater__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMember_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_IS_EQUAL_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveAndCommit__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDefaultPhase__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_EnterSearch___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_EndValue___(void *jarg1, int jarg2, void *jarg3)
void(SWIGSTDCALL * SWIG_Callback10_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ProgressPercentSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetValues___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLateCostArgument_get___()
bool HasFragments() const override
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Activate___(void *jarg1, long long jarg2)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall)
SWIGEXPORT operations_research::PropagationBaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_SWIGUpcast___(operations_research::IntExpr *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CastExpression___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, void *jarg4)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetLocalOptimizerOffsetForVehicle___(void *jarg1, int jarg2)
SWIGEXPORT operations_research::AssignmentElement *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SWIGUpcast___(operations_research::IntervalVarElement *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginFailSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeEquality__SWIG_3___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperator_OldSequence___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntegerVariable_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Nodes___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AFTER_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_LastIndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_IS_LESS_get___()
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__setitem(std::vector< std::vector< int > > *self, int index, std::vector< int > const &val)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTabuSearch___(void *jarg1, unsigned int jarg2, void *jarg3, long long jarg4, void *jarg5, long long jarg6, long long jarg7, double jarg8)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddSoftSameVehicleConstraint___(void *jarg1, int length2, int64 *jarg2, long long jarg3)
@ INT_VAR_SIMPLE
The simple selection is CHOOSE_FIRST_UNBOUND.
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RevInteger___(long long jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DecisionBuilderVector__SWIG_0___()
@ NO_MORE_SOLUTIONS
After failed NextSolution and before EndSearch.
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Insert(std::vector< operations_research::SymmetryBreaker * > *self, int index, operations_research::SymmetryBreaker *const &x)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AFTER_START_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Decision___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDurationMaxArgument_get___()
virtual void BeginFail()
Just when the failure occurs.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Insert4___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, long long jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNullIntersectExcept___(void *jarg1, void *jarg2, void *jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MAX_REGRET_ON_MIN_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_TopProgressPercent___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RankFirst___(void *jarg1, void *jarg2, int jarg3)
void(SWIGSTDCALL * SWIG_Callback9_t)(void *)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_VAR_PRIORITY_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_BeginVisitIntegerExpression___(void *jarg1, char *jarg2, void *jarg3)
Manager for any NodeIndex <-> variable index conversion.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_EnterSearch___(void *jarg1)
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIndexOf_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitSequenceArgument___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVariableUsageLessConstantExtension_get___()
SWIGINTERN std::vector< long > * std_vector_Sl_int64_Sg__GetRange(std::vector< int64 > *self, int index, int count)
static const char kPerformedExpr[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IsStart___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_RemoveAt___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_EnterSearchSwigExplicitSearchLimit___(void *jarg1)
virtual void Accept(DecisionVisitor *const visitor) const
Accepts the given visitor.
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAt(operations_research::IntervalVar *self, int64 date)
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_5___(void *jarg1, void *jarg2, int jarg3, void *jarg4, void *jarg5)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeEquality__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
@ INTERVAL_SET_TIMES_BACKWARD
Selects the variable with the highest ending time of all variables, and fixes the ending time to this...
@ VAR_ARRAY_CONSTANT_EXPRESSION_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_Var___(void *jarg1)
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsDifferentVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetSpanCostCoefficientForAllVehicles___(void *jarg1, long long jarg2)
ExprConstantExpressionType
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_IsUncheckedSolutionLimitReached___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
static const char kNoCycle[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_ToString___(void *jarg1)
Local Search Filters are used for fast neighbor pruning.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_5___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, long long jarg5, unsigned int jarg6)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_kNoDimension_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOperator__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntConst__SWIG_1___(void *jarg1, long long jarg2)
virtual void Reset()
Sets the filter to empty solution.
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__setitem(std::vector< operations_research::DecisionBuilder * > *self, int index, operations_research::DecisionBuilder *const &val)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_DurationValue___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_SetMin___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Reset___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Check___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_RemoveInterval___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Clear___(void *jarg1)
virtual void Start(operations_research::Assignment const *assignment)
This method should not be overridden.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsDifferent__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetRequiredTypeAlternativesWhenRemovingType___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Insert3___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Index___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDimensionWithVehicleTransits___(void *jarg1, int length2, int *jarg2, long long jarg3, long long jarg4, unsigned int jarg5, char *jarg6)
SWIGINTERN bool std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Contains(std::vector< operations_research::LocalSearchFilter * > *self, operations_research::LocalSearchFilter *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerVariable__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
std::string BaseName() const override
Returns a base name for automatic naming.
virtual ~SwigDirector_SolutionCollector()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_LastIndexOf___(void *jarg1, void *jarg2)
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_WhenDomain___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RandomConcatenateOperators__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ROUTING_FAIL_TIMEOUT_get___()
void(SWIGSTDCALL * SWIG_Callback19_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ExitSearch___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_capacity___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ClearObjective___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarArrayExpression___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerVariableArrayArgument___(void *jarg1, char *jarg2, void *jarg3)
static const char kEarlyDateArgument[]
virtual bool LocalOptimum()
When a local optimum is reached.
static const char kTrueConstraint[]
VarArrayConstantArrayExpressionType
void(SWIGSTDCALL * SWIG_Callback12_t)()
int Insert4(int64 v0, int64 v1, int64 v2, int64 v3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMin__SWIG_3___(void *jarg1, void *jarg2, int jarg3)
void(SWIGSTDCALL * SWIG_Callback11_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperator_director_connect___(void *objarg, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback0_t callback0, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback1_t callback1, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback2_t callback2, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback3_t callback3, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback4_t callback4, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback5_t callback5, SwigDirector_SequenceVarLocalSearchOperator::SWIG_Callback6_t callback6)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ReSeed___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_GREATER_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMinEqual_get___()
static const char kSolutionLimitArgument[]
static const char kActiveArgument[]
argument names:
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_PrioritySwigExplicitDemon___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetDurationMin___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddToAssignment___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingIndexManager___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Reverse__SWIG_0___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ObjectiveBound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingBoxesConstraint__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, int length4, int64 *jarg4, int length5, int64 *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_CONSTANT_ARRAY_SCAL_PROD_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_IsIncremental___(void *jarg1)
SWIGINTERN int std_vector_Sl_int_Sg__IndexOf(std::vector< int > *self, int const &value)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INT_VAR_SIMPLE_get___()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackNextWrapper)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_initialization_splits_set___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePack___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_WhenDomain__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64VectorVector__SWIG_1___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback1_t)(void *, long long)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_AddAtPosition___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_OutputDecision___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_InstallSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AFTER_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__RemoveRange(std::vector< operations_research::IntervalVar * > *self, int index, int count)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kFixedChargeArgument_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_ObjectiveValue___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Activated___(void *jarg1, long long jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntConst__SWIG_0___(void *jarg1, long long jarg2, char *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenStartBound__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_BaseObject___()
bool MakeOneNeighbor() override
This method should not be overridden. Override ModifyValue() instead.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_OROPT_get___()
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
virtual bool MakeOneNeighborSwigPublic()
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsMember__SWIG_1(operations_research::IntExpr *self, std::vector< int > const &values)
static void raise(const char *msg)
SWIGINTERN bool std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Remove(std::vector< operations_research::SequenceVar * > *self, operations_research::SequenceVar *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Store___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ActivatedObjective___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ROUTING_NOT_SOLVED_get___()
virtual bool SkipUnchanged(int index) const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetDurationMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhase__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_WhenBound___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_BaseName___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDiv__SWIG_0___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__Insert(std::vector< std::vector< int64 > > *self, int index, std::vector< int64 > const &x)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedOptimize__SWIG_1___(void *jarg1, unsigned int jarg2, void *jarg3, int length4, int *jarg4, long long jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_NumLastRanked___(void *jarg1)
virtual bool RestartAtPathStartOnSynchronizeSwigPublic()
#define SWIG_DivisionByZero
static const char kSizeArgument[]
static const char kEarlyCostArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
virtual std::string BaseName() const
Returns a base name for automatic naming.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_TopPeriodicCheck___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_PerformedValue___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLateDateArgument_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SLACK_RANK_FORWARD_get___()
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__setitem(std::vector< operations_research::SymmetryBreaker * > *self, int index, operations_research::SymmetryBreaker *const &val)
static void SWIGUNUSED SWIG_CSharpSetPendingExceptionArgument(SWIG_CSharpExceptionArgumentCodes code, const char *msg, const char *param_name)
static const char kEndsArgument[]
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
unsigned int(SWIGSTDCALL * SWIG_Callback1_t)(void *, void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeConstantRestart___(void *jarg1, int jarg2)
SWIGINTERN int std_vector_Sl_int64_Sg__IndexOf(std::vector< int64 > *self, long const &value)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetGlobalOptimizerOffset___(void *jarg1)
virtual void OnStart()
Called by Start() after synchronizing the operator with the current assignment.
virtual ~SwigDirector_SequenceVarLocalSearchOperator()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVar___(void *jarg1, void *jarg2, void *jarg3, char *jarg4)
SWIGINTERN std::vector< int > * new_std_vector_Sl_int_Sg___SWIG_2(int capacity)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeVariableGreaterOrEqualValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ConsiderEmptyRouteCostsForVehicle___(void *jarg1, unsigned int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_NoMoreSolutions___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetPostTravelEvaluatorOfVehicle___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetAssignmentFromOtherModelAssignment___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
void(SWIGSTDCALL * SWIG_Callback5_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kInitialState_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProd__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Clear___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_PeriodicCheckSwigExplicitSearchLimit___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_MIN_get___()
@ CROSS_DATE
STARTS_BEFORE and ENDS_AFTER at the same time, i.e.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_InitPositionSwigExplicitPathOperator___(void *jarg1)
static const char kElement[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTransitionConstraint__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int length5, int *jarg5)
void BeginNextDecision(DecisionBuilder *const b) override
Before calling DecisionBuilder::Next.
Constraint * MakeIntervalVarRelation(IntervalVar *const t, UnaryIntervalRelation r, int64 d)
This method creates a relation between an interval var and a date.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCover___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__RemoveRange(std::vector< operations_research::IntVar * > *self, int index, int count)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_NumTypes___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartSyncOnEndOperation_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CPFeasibilityFilter_Accept___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, long long jarg5)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_DebugOutputAssignment___(void *jarg1, void *jarg2, char *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MAKEINACTIVE_get___()
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_capacity___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetDurationRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
virtual void Commit(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Dual of Relax(), lets the filter know that the delta was accepted.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchMonitor___(void *jarg1)
SWIGINTERN void std_vector_Sl_int64_Sg__SetRange(std::vector< int64 > *self, int index, std::vector< long > const &values)
std::function< bool(int64)> IndexFilter1
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_director_connect___(void *objarg, SwigDirector_LocalSearchFilter::SWIG_Callback0_t callback0, SwigDirector_LocalSearchFilter::SWIG_Callback1_t callback1, SwigDirector_LocalSearchFilter::SWIG_Callback2_t callback2, SwigDirector_LocalSearchFilter::SWIG_Callback3_t callback3, SwigDirector_LocalSearchFilter::SWIG_Callback4_t callback4, SwigDirector_LocalSearchFilter::SWIG_Callback5_t callback5, SwigDirector_LocalSearchFilter::SWIG_Callback6_t callback6, SwigDirector_LocalSearchFilter::SWIG_Callback7_t callback7, SwigDirector_LocalSearchFilter::SWIG_Callback8_t callback8, SwigDirector_LocalSearchFilter::SWIG_Callback9_t callback9)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Reset___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTrueConstraint___(void *jarg1)
static const char kIndexArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Var___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_FastAdd__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_GetHoles___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumGreaterOrEqual___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Resize___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RestartSearch___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMax__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CheckAssignment___(void *jarg1, void *jarg2)
bool CheckLimit()
Returns true if the search limit has been crossed.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_BaseIntExpr___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
Constraint * MakeIntervalVarRelationWithDelay(IntervalVar *const t1, BinaryIntervalRelation r, IntervalVar *const t2, int64 delay)
This method creates a relation between two interval vars.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetFixedCostOfVehicle___(void *jarg1, int jarg2)
static const char kFinalStatesArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Clear___(void *jarg1)
@ STARTS_AT
t starts at d, i.e. Start(t) == d.
virtual void Commit(const Assignment *delta, const Assignment *deltadelta)
Dual of Relax(), lets the filter know that the delta was accepted.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_SetRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_IsAssignedStatusKnown___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarVector__SWIG_0___()
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_capacity___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ActiveVar___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Maximize___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLess__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
virtual void EndFail()
After completing the backtrack.
void(SWIGSTDCALL * SWIG_Callback5_t)()
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::SymmetryBreaker * > *self)
virtual std::string DebugString() const
@ EXPR_CONSTANT_IS_NOT_EQUAL
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginFail___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAbs_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CPFeasibilityFilter_OnSynchronize___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_AssignmentIntContainer___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_GetDomain___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetBreakIntervalsOfVehicle__SWIG_0___(void *jarg1, void *jarg2, int jarg3, int jarg4, int jarg5)
SWIGINTERN std::vector< operations_research::SymmetryBreaker * > * new_std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_decision_builder_set___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_TYPE_SIMULTANEOUSLY_ADDED_AND_REMOVED_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_RankFirst___(void *jarg1, void *jarg2, int jarg3)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *, void *)
virtual void VisitScheduleOrPostpone(operations_research::IntervalVar *const var, int64 est)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsBefore(operations_research::IntervalVar *self, int64 date)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SEQUENCE_SIMPLE_get___()
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
SWIGINTERN int std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__IndexOf(std::vector< operations_research::SymmetryBreaker * > *self, operations_research::SymmetryBreaker *const &value)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_UncheckedSolutions___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Contains___(void *jarg1, long long jarg2)
static const char kProductOperation[]
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__SetRange(std::vector< operations_research::SearchMonitor * > *self, int index, std::vector< operations_research::SearchMonitor * > const &values)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_NON_EQUALITY_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSumEqual_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetForwardSequence___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_setitem___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_VarType___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OPP_VAR_get___()
SWIGINTERN std::vector< operations_research::DecisionBuilder * >::value_type const & std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__getitem(std::vector< operations_research::DecisionBuilder * > *self, int index)
SwigDirector_SolutionCollector(operations_research::Solver *const solver, operations_research::Assignment const *assignment)
An Assignment is a variable -> domains mapping, used to report solutions to the user.
SWIGINTERN bool std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Remove(std::vector< operations_research::LocalSearchFilter * > *self, operations_research::LocalSearchFilter *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_2___(void *jarg1, void *jarg2, int jarg3, void *jarg4)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSumLessOrEqual_get___()
ExprExprConstantExpressionType
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ConcatenateOperators__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT operations_research::TypeRegulationsChecker *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TypeIncompatibilityChecker_SWIGUpcast___(operations_research::TypeIncompatibilityChecker *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_EXTENDEDSWAPACTIVE_get___()
IntervalVarElement * Clone()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_HoldsDelta___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_2___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5)
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::IntervalVar * > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, void *jarg4)
Struct used to sort and store vehicles by their type.
virtual bool HasFragments() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElement__SWIG_1___(void *jarg1, int length2, int *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalsArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasSameVehicleTypeRequirements___(void *jarg1)
SWIGINTERN void SWIG_CSharpException(int code, const char *msg)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SearchMonitor___(void *jarg1)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_GetSynchronizedObjectiveValue___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ChangeValue_MakeOneNeighborSwigExplicitChangeValue___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumObjectiveFilter__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_DefaultPhaseParameters___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_CONSTANT_ARRAY_EXPRESSION_MAX_get___()
IntervalStrategy
This enum describes the straregy used to select the next interval variable and its value to be fixed.
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackEnterSearch, SWIG_Callback2_t callbackRestartSearch, SWIG_Callback3_t callbackExitSearch, SWIG_Callback4_t callbackBeginNextDecision, SWIG_Callback5_t callbackEndNextDecision, SWIG_Callback6_t callbackApplyDecision, SWIG_Callback7_t callbackRefuteDecision, SWIG_Callback8_t callbackAfterDecision, SWIG_Callback9_t callbackBeginFail, SWIG_Callback10_t callbackEndFail, SWIG_Callback11_t callbackBeginInitialPropagation, SWIG_Callback12_t callbackEndInitialPropagation, SWIG_Callback13_t callbackAcceptSolution, SWIG_Callback14_t callbackAtSolution, SWIG_Callback15_t callbackNoMoreSolutions, SWIG_Callback16_t callbackLocalOptimum, SWIG_Callback17_t callbackAcceptDelta, SWIG_Callback18_t callbackAcceptNeighbor, SWIG_Callback19_t callbackAcceptUncheckedNeighbor, SWIG_Callback20_t callbackIsUncheckedSolutionLimitReached, SWIG_Callback21_t callbackPeriodicCheck, SWIG_Callback22_t callbackProgressPercent, SWIG_Callback23_t callbackAccept, SWIG_Callback24_t callbackInstall, SWIG_Callback25_t callbackPrint)
PickupAndDeliveryPolicy
Types of precedence policy applied to pickup and delivery pairs.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSizeYArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenStartBound__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_WhenBound__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AfterDecisionSwigExplicitSearchMonitor___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_PATHLNS_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_HasPickupToDeliveryLimits___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_BaseDimension___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_ToString___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_director_connect___(void *objarg, SwigDirector_SolutionCollector::SWIG_Callback0_t callback0, SwigDirector_SolutionCollector::SWIG_Callback1_t callback1, SwigDirector_SolutionCollector::SWIG_Callback2_t callback2, SwigDirector_SolutionCollector::SWIG_Callback3_t callback3, SwigDirector_SolutionCollector::SWIG_Callback4_t callback4, SwigDirector_SolutionCollector::SWIG_Callback5_t callback5, SwigDirector_SolutionCollector::SWIG_Callback6_t callback6, SwigDirector_SolutionCollector::SWIG_Callback7_t callback7, SwigDirector_SolutionCollector::SWIG_Callback8_t callback8, SwigDirector_SolutionCollector::SWIG_Callback9_t callback9, SwigDirector_SolutionCollector::SWIG_Callback10_t callback10, SwigDirector_SolutionCollector::SWIG_Callback11_t callback11, SwigDirector_SolutionCollector::SWIG_Callback12_t callback12, SwigDirector_SolutionCollector::SWIG_Callback13_t callback13, SwigDirector_SolutionCollector::SWIG_Callback14_t callback14, SwigDirector_SolutionCollector::SWIG_Callback15_t callback15, SwigDirector_SolutionCollector::SWIG_Callback16_t callback16, SwigDirector_SolutionCollector::SWIG_Callback17_t callback17, SwigDirector_SolutionCollector::SWIG_Callback18_t callback18, SwigDirector_SolutionCollector::SWIG_Callback19_t callback19, SwigDirector_SolutionCollector::SWIG_Callback20_t callback20, SwigDirector_SolutionCollector::SWIG_Callback21_t callback21, SwigDirector_SolutionCollector::SWIG_Callback22_t callback22, SwigDirector_SolutionCollector::SWIG_Callback23_t callback23, SwigDirector_SolutionCollector::SWIG_Callback24_t callback24)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_PushState___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__RemoveRange(std::vector< operations_research::SearchMonitor * > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Var___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ADDED_TYPE_REMOVED_FROM_VEHICLE_get___()
RoutingDisjunctionIndex DisjunctionIndex
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetEndMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedMinimize__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4)
void(SWIGSTDCALL * SWIG_Callback8_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AVOID_DATE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingDimension___(void *jarg1)
@ EXPR_CONSTANT_DIFFERENCE
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationIntervalVar__SWIG_2___(void *jarg1, void *jarg2, long long jarg3, void *jarg4, char *jarg5)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ObjectiveMin___(void *jarg1)
This filter accepts deltas for which the assignment satisfies the constraints of the Solver.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumEqualVarDimension__SWIG_0___(void *jarg1, int length2, int64 *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_SetNextBaseToIncrement___(void *jarg1, long long jarg2)
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_VAR_ADD_CST_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kValueArgument_get___()
void(SWIGSTDCALL * SWIG_Callback1_t)(void *)
@ SWIG_CSharpArgumentOutOfRangeException
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SearchMonitorVector__SWIG_2___(int jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDisjunctionIndices__SWIG_0___(void *jarg1, long long jarg2)
SequenceStrategy
Used for scheduling. Not yet implemented.
static const char kCircuit[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Clear___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenDurationRange__SWIG_0___(void *jarg1, void *jarg2)
bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta) override
Redefines MakeNextNeighbor to export a simpler interface.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Clear___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetAmortizedQuadraticCostFactorOfVehicles___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_3___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenDurationBound__SWIG_0___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback10_t)(long long)
SWIGEXPORT operations_research::TypeRegulationsChecker *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TypeRequirementChecker_SWIGUpcast___(operations_research::TypeRequirementChecker *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVar___(void *jarg1)
Constraint * MakeMemberCt(IntExpr *const expr, const std::vector< int64 > &values)
expr in set.
SWIGINTERN bool std_vector_Sl_operations_research_IntVar_Sm__Sg__Contains(std::vector< operations_research::IntVar * > *self, operations_research::IntVar *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_sorted_vehicle_classes_per_type_get___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_EQ_get___()
virtual void VisitUnknownDecision()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kExpressionArgument_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AT_START_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_InitFragments___(void *jarg1)
SWIGEXPORT operations_research::PropagationBaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_SWIGUpcast___(operations_research::Constraint *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddAtSolutionCallback___(void *jarg1, void *jarg2)
SWIGINTERN int std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__LastIndexOf(std::vector< operations_research::LocalSearchOperator * > *self, operations_research::LocalSearchOperator *const &value)
Checker for type requirements.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenEndRange__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignment__SWIG_0___(void *jarg1)
SwigDirector_IntVarLocalSearchOperator()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMaxEquality___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAbs___(void *jarg1, void *jarg2)
virtual int64 GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Demon___(void *jarg1)
@ CHOOSE_MIN_SIZE
Among unbound variables, select the variable with the smallest size.
static const char kVariableGroupExtension[]
@ ENDS_AT_END
t1 ends at t2 end, i.e. End(t1) == End(t2) + delay.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_AreAllElementsBound___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_AcceptSwigExplicitDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_EnterSearch___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_BaseObject___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__RemoveRange(std::vector< operations_research::SequenceVar * > *self, int index, int count)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Next___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_ModelCache___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_Copy___(void *jarg1, void *jarg2)
SWIGINTERN bool std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Contains(std::vector< operations_research::DecisionBuilder * > *self, operations_research::DecisionBuilder *const &value)
virtual ~SwigDirector_OptimizeVar()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntervalVarElement___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SymmetryBreaker___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_capacity___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_IsPerformedBound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_expression_get___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCumulativeArgument_get___()
@ INT_VAR_DEFAULT
The default behavior is CHOOSE_FIRST_UNBOUND.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IndexOf__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CloseModel___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetDurationRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_RefuteDecisionSwigExplicitSearchMonitor___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_MIN_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarConstantArrayExpression___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int jarg4)
static const char kScalProdEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_GlobalVehicleBreaksConstraint___(void *jarg1)
static const DimensionIndex kNoDimension
Constant used to express the "no dimension" index, returned when a dimension name does not correspond...
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__RemoveAt(std::vector< operations_research::IntVar * > *self, int index)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__InsertRange(std::vector< operations_research::SearchMonitor * > *self, int index, std::vector< operations_research::SearchMonitor * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMemberCt__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
@ ENDS_AT_START
t1 ends at t2 start, i.e. End(t1) == Start(t2) + delay.
virtual operations_research::SearchLimit * MakeClone() const
Allocates a clone of the limit.
static const char kInt64ToBoolExtension[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAfterStartWithDelay___(void *jarg1, void *jarg2, long long jarg3)
Base operator class for operators manipulating variables.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Copy___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Element__SWIG_1___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Empty___(void *jarg1)
SwigDirector_SearchMonitor(operations_research::Solver *const s)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetAmortizedCostFactorsOfVehicle___(void *jarg1, long long jarg2, long long jarg3, int jarg4)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsEqual__SWIG_1___(void *jarg1, void *jarg2)
@ EXPR_EXPR_IS_LESS_OR_EQUAL
SWIGEXPORT uint8 *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Parameters___(void *jarg1)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AcceptSolutionSwigExplicitOptimizeVar___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_capacity___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllowedAssignments___(void *jarg1, void *jarg2, void *jarg3)
@ AVOID_DATE
STARTS_AFTER or ENDS_BEFORE, i.e.
void(SWIGSTDCALL * SWIG_Callback1_t)(void *)
SWIGEXPORT unsigned long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Size___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_InitPosition___(void *jarg1)
SWIGINTERN std::vector< operations_research::LocalSearchFilter * >::value_type const & std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__getitem(std::vector< operations_research::LocalSearchFilter * > *self, int index)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePower___(void *jarg1, void *jarg2, long long jarg3)
SWIG_CSharpExceptionArgumentCodes
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarElement___(void *jarg1)
SWIGINTERN int std_vector_Sl_operations_research_IntervalVar_Sm__Sg__LastIndexOf(std::vector< operations_research::IntervalVar * > *self, operations_research::IntervalVar *const &value)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Neighbors___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Min___(void *jarg1)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__Reverse__SWIG_0(std::vector< std::vector< int > > *self)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_heuristic_num_failures_limit_set___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDimensionOrDie___(void *jarg1, char *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFailDecision___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNotMemberCt__SWIG_3___(void *jarg1, void *jarg2, int length3, int *jarg3, int length4, int *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFirstSolutionCollector__SWIG_0___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
Cast constraints are special channeling constraints designed to keep a variable in sync with an expre...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetDurationValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN std::vector< operations_research::IntVar * > * std_vector_Sl_operations_research_IntVar_Sm__Sg__Repeat(operations_research::IntVar *const &value, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAfterEnd___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDurationExpr_get___()
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ReadAssignmentFromRoutes___(void *jarg1, int len2_1, int len2_2[], int64 *jarg2, unsigned int jarg3)
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SWIGEXPORT operations_research::PropagationBaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_SWIGUpcast___(operations_research::SequenceVar *jarg1)
virtual void VisitSetVariableValue(IntVar *const var, int64 value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAfterStart___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Remove___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_GetAcceptedObjectiveValueSwigExplicitLocalSearchFilter___(void *jarg1)
virtual std::string name() const
Object naming.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindExprExpression___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalVariable_get___()
int32 Rand32(int32 size)
Returns a random value between 0 and 'size' - 1;.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_EndVisitIntegerExpression___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RankSequence___(void *jarg1, void *jarg2, int length3, int *jarg3, int length4, int *jarg4, int length5, int *jarg5)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Min___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::LocalSearchFilter * > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_5___(void *jarg1, void *jarg2, void *jarg3)
static const char kVariableArgument[]
bool ArcIsMoreConstrainedThanArc(int64 from, int64 to1, int64 to2)
Returns whether the arc from->to1 is more constrained than from->to2, taking into account,...
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AtSolution___(void *jarg1)
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevInteger_SetValue___(void *jarg1, void *jarg2, long long jarg3)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_HasObjective___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignVariablesValues___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_NextFragment___(void *jarg1)
SWIGINTERN void std_vector_Sl_int_Sg__Reverse__SWIG_1(std::vector< int > *self, int index, int count)
SWIGINTERN void std_vector_Sl_int_Sg__SetRange(std::vector< int > *self, int index, std::vector< int > const &values)
void(SWIGSTDCALL * SWIG_Callback26_t)()
void(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_ToString___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_DurationMax___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarVector__SWIG_1___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_PeriodicCheck___(void *jarg1)
virtual void EnterSearch()
Beginning of the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetBreakIntervalsOfVehicle__SWIG_2___(void *jarg1, void *jarg2, int jarg3, int length4, int64 *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntervalVarVector__SWIG_1___(void *jarg1)
static const char kValueArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElement__SWIG_0___(void *jarg1, int length2, int64 *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_NoMoreSolutions___(void *jarg1)
static const char kPositionXArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INTERVAL_SET_TIMES_BACKWARD_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_CommitSwigExplicitLocalSearchFilter___(void *jarg1, void *jarg2, void *jarg3)
std::string DebugString() const override
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsGreater_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ObjectiveMax___(void *jarg1)
LocalSearchPhaseParameters()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNotMemberCt__SWIG_2___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int length4, int64 *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ShouldFail___(void *jarg1)
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetCumulVarSoftUpperBound___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRandomLnsOperator__SWIG_0___(void *jarg1, void *jarg2, int jarg3)
GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on all vehicles in the dimensio...
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackName, SWIG_Callback2_t callbackBaseName, SWIG_Callback3_t callbackPost, SWIG_Callback4_t callbackInitialPropagateWrapper)
SWIGEXPORT operations_research::DecisionVisitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreaker_SWIGUpcast___(operations_research::SymmetryBreaker *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_1___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitScheduleOrPostpone___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterOrEqualCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_MAX_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchPhaseParameters___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarArrayConstantExpression___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePathCumul__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_VehicleClassEntry_vehicle_class_set___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetPerformedMin___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_RefuteDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AssignVar___(void *jarg1, int jarg2, int jarg3)
static const char kIntervalArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessOrEqualCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetEndRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NO_CHANGE_get___()
virtual bool AtSolution()
This method is called when a valid solution is found.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_TypeRegulationsConstraint___(void *jarg1)
virtual bool AcceptSolution()
This method is called when a solution is found.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activated__SWIG_0___(void *jarg1, void *jarg2)
LocalSearchFilterBound
This enum is used in Solver::MakeLocalSearchObjectiveFilter.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsDifferentCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddHardTypeIncompatibility___(void *jarg1, int jarg2, int jarg3)
SWIGINTERN operations_research::OptimizeVar * operations_research_IntExpr_Maximize(operations_research::IntExpr *self, int64 step)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kScalProdEqual_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::IntVar * > *self)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetArcCostForClass___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntExpr___(void *jarg1)
virtual int64 GetBaseNodeRestartPosition(int base_index)
Returns the index of the node to which the base node of index base_index must be set to when it reach...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kProductOperation_get___()
virtual void EnterSearch()
Beginning of the search.
int64 ComputeLowerBound()
Computes a lower bound to the routing problem solving a linear assignment problem.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_EndMin___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AssignmentToRoutes___(void *jarg1, void *jarg2, int len3_1, int len3_2[], int64 *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ToString___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_DIFFERENCE_get___()
bool AcceptSolution() override
This method is called when a solution is found.
SWIGINTERN void std_vector_Sl_int64_Sg__Reverse__SWIG_1(std::vector< int64 > *self, int index, int count)
void(SWIGSTDCALL * SWIG_Callback3_t)(void *)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTrueConstraint_get___()
std::string DebugString() const override
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddRequiredTypeAlternativesWhenAddingType___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Copy___(void *jarg1, void *jarg2)
virtual bool LocalOptimum()
When a local optimum is reached.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddCountUsedBinDimension___(void *jarg1, void *jarg2)
RoutingCostClassIndex CostClassIndex
int(SWIGSTDCALL * SWIG_Callback22_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerExpressionArgument___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPack_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdLessOrEqual__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4)
void(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGINTERN std::vector< operations_research::SymmetryBreaker * > * std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Repeat(operations_research::SymmetryBreaker *const &value, int count)
virtual bool MakeOneNeighborSwigPublic()
static const char kEndMaxArgument[]
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_PropagationBaseObject___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_BeginNextDecision___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback7_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEndExpr_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_DurationMax___(void *jarg1, void *jarg2)
virtual ~SwigDirector_Constraint()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchFilter___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPartialArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_Inhibit___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationStartSyncedOnEndIntervalVar___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MAKEACTIVE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndNextDecisionSwigExplicitSearchMonitor___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddLocalSearchFilter___(void *jarg1, void *jarg2)
SWIGINTERN std::vector< int > std_vector_Sl_std_vector_Sl_int_Sg__Sg__getitemcopy(std::vector< std::vector< int > > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetPerformed___(void *jarg1, unsigned int jarg2)
virtual int64 ModifyValue(int64 index, int64 value)=0
char *(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Activated___(void *jarg1, long long jarg2)
SWIGINTERN std::vector< operations_research::SearchMonitor * > * std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Repeat(operations_research::SearchMonitor *const &value, int count)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldDurationMax___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_BaseLns___(void *jarg1)
virtual void EnterSearch()
Beginning of the search.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCumulsArgument_get___()
virtual void Post()
This method is called when the constraint is processed by the solver.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldDurationMin___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__setitem(std::vector< operations_research::IntervalVar * > *self, int index, operations_research::IntervalVar *const &val)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIndexOfFirstMinValueConstraint___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveAndCommit__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterOrEqualCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Int64Vector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_GlobalVehicleBreaksConstraint_InitialPropagateWrapper___(void *jarg1)
virtual bool IsIncremental() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Add__SWIG_5___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_ForwardSequence___(void *jarg1, int jarg2, void *jarg3)
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Solver_IntegerCastInfo___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SymmetryBreakerVector__SWIG_1___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VOID_CONSTRAINT_MAX_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarVector__SWIG_0___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Empty___(void *jarg1)
@ INTERVAL_DEFAULT
The default is INTERVAL_SET_TIMES_FORWARD.
static const char kIsMember[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAfter___(void *jarg1, long long jarg2)
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_SWIGUpcast___(operations_research::SolutionCollector *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__setitem(std::vector< operations_research::SequenceVar * > *self, int index, operations_research::SequenceVar *const &val)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedMaximize__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_director_connect___(void *objarg, SwigDirector_LocalSearchFilterManager::SWIG_Callback0_t callback0)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Empty___(void *jarg1)
@ SWIG_CSharpArithmeticException
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_WhenRange__SWIG_0___(void *jarg1, void *jarg2)
SWIGINTERN bool std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Remove(std::vector< operations_research::SearchMonitor * > *self, operations_research::SearchMonitor *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetObjectiveMin___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Add___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__SetRange(std::vector< operations_research::IntervalVar * > *self, int index, std::vector< operations_research::IntervalVar * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_RelaxedMin___(void *jarg1)
IntVar * MakeIsGreaterVar(IntExpr *const left, IntExpr *const right)
status var of (left > right)
SWIGINTERN std::vector< std::vector< int > > * std_vector_Sl_std_vector_Sl_int_Sg__Sg__GetRange(std::vector< std::vector< int > > *self, int index, int count)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_ToString___(void *jarg1)
void *(SWIGSTDCALL * SWIG_Callback28_t)()
virtual bool Check()
This method is called to check the status of the limit.
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_SWIGUpcast___(operations_research::LocalSearchMonitor *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDifference__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Clear___(void *jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsDifferent__SWIG_0(operations_research::IntExpr *self, int64 value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsBefore___(void *jarg1, long long jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__InsertRange(std::vector< operations_research::LocalSearchOperator * > *self, int index, std::vector< operations_research::LocalSearchOperator * > const &values)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNumberOfVisitTypes___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSum__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEarlyDateArgument_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_HIGHEST_MAX_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_FastAdd___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SearchLeftDepth___(void *jarg1)
SWIGINTERN std::vector< operations_research::DecisionBuilder * > * new_std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg___SWIG_2(int capacity)
static const char kIntervalVariable[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilder_director_connect___(void *objarg, SwigDirector_DecisionBuilder::SWIG_Callback0_t callback0, SwigDirector_DecisionBuilder::SWIG_Callback1_t callback1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Reverse__SWIG_0___(void *jarg1)
SWIGINTERN int std_vector_Sl_operations_research_IntVar_Sm__Sg__IndexOf(std::vector< operations_research::IntVar * > *self, operations_research::IntVar *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_getitemcopy___(void *jarg1, int jarg2)
@ FULLPATHLNS
Operator which relaxes one entire path and all inactive nodes, thus defining num_paths neighbors.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_1___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5, unsigned int jarg6)
VarConstantConstantConstraintType
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsGreaterOrEqual__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAtEndWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMaximizeArgument_get___()
void(SWIGSTDCALL * SWIG_Callback3_t)(void *, long long)
static const char kNullIntersect[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationEndSyncedOnEndIntervalVar___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSolveOnce__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
@ TYPE_ADDED_TO_VEHICLE
When visited, the number of types 'T' on the vehicle increases by one.
virtual void VisitScheduleOrExpedite(operations_research::IntervalVar *const var, int64 est)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_ForwardSequence___(void *jarg1)
SWIGINTERN std::vector< operations_research::SequenceVar * > * std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Repeat(operations_research::SequenceVar *const &value, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_IsEqual___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Repeat___(void *jarg1, int jarg2)
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
static const char kAssumePathsArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_HasName___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_ARRAY_ELEMENT_get___()
virtual void RestartSearch()
Restart the search.
static const char kInt64ToInt64Extension[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SolveFromAssignmentWithParameters___(void *jarg1, void *jarg2, int search_parameters_size, uint8 *jarg3)
static const char kTuplesArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMapDomain___(void *jarg1, void *jarg2, void *jarg3)
@ MAKEINACTIVE
Operator which makes path nodes inactive.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kBranchesLimitArgument_get___()
int Insert3(int64 v0, int64 v1, int64 v2)
void(SWIGSTDCALL * SWIG_Callback12_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Reverse__SWIG_0___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntTupleSet__SWIG_0___(int jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_GetNumberOfIndices___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAfterStart(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::SequenceVar * > *self)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_VAR_TIMES_CST_get___()
SWIGINTERN void std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::SymmetryBreaker * > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_solver___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMirrorInterval___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kGreaterOrEqual_get___()
A DecisionBuilder is responsible for creating the search tree.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreater__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_SetRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_SWIGUpcast___(operations_research::LocalSearchFilter *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldStartMin___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddVariableMinimizedByFinalizer___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback24_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveAndCommit__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScheduleOrExpedite___(void *jarg1, void *jarg2, long long jarg3, long *jarg4)
virtual void VisitSplitVariableDomain(IntVar *const var, int64 value, bool start_with_lower_half)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_3___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_GetAcceptedObjectiveValue___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Var___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVariableArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CloseVisitTypes___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SearchMonitorVector__SWIG_1___(void *jarg1)
virtual bool RestartAtPathStartOnSynchronize()
When the operator is being synchronized with a new solution (when Start() is called),...
static const char kPartialArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_reserve___(void *jarg1, unsigned long jarg2)
static const char kScalProdGreaterOrEqual[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBoolVar__SWIG_0___(void *jarg1, char *jarg2)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_capacity___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__InsertRange(std::vector< operations_research::DecisionBuilder * > *self, int index, std::vector< operations_research::DecisionBuilder * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingModel__SWIG_0___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddPickupAndDeliverySets___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_PerformedMin___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AssignFirstPossibleToBin___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMin__SWIG_2___(void *jarg1, void *jarg2, long long jarg3)
static const char kRelaxedMinOperation[]
virtual bool ConsiderAlternatives(int64 base_index) const
Indicates if alternatives should be considered when iterating over base nodes.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Minimize___(void *jarg1, long long jarg2)
@ ENDS_AFTER_END
t1 ends after t2 end, i.e. End(t1) >= End(t2) + delay.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ApplyDecisionSwigExplicitSearchMonitor___(void *jarg1, void *jarg2)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void BeginInitialPropagation()
Before the initial propagation.
void(SWIGSTDCALL * SWIG_Callback15_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Clone___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingModel_VehicleTypeContainer___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreater__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ChangeValue_director_connect___(void *objarg, SwigDirector_ChangeValue::SWIG_Callback0_t callback0, SwigDirector_ChangeValue::SWIG_Callback1_t callback1, SwigDirector_ChangeValue::SWIG_Callback2_t callback2, SwigDirector_ChangeValue::SWIG_Callback3_t callback3, SwigDirector_ChangeValue::SWIG_Callback4_t callback4, SwigDirector_ChangeValue::SWIG_Callback5_t callback5, SwigDirector_ChangeValue::SWIG_Callback6_t callback6, SwigDirector_ChangeValue::SWIG_Callback7_t callback7)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Insert___(void *jarg1, int jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__setitem(std::vector< operations_research::LocalSearchFilter * > *self, int index, operations_research::LocalSearchFilter *const &val)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddConstantDimension___(void *jarg1, long long jarg2, long long jarg3, unsigned int jarg4, char *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeConditionalExpression___(void *jarg1, void *jarg2, void *jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElementEquality__SWIG_0___(void *jarg1, int length2, int64 *jarg2, void *jarg3, void *jarg4)
long long(SWIGSTDCALL * SWIG_Callback8_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SymmetryBreakerVector___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNextsArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_HasCumulVarSoftUpperBound___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_vehicles_per_vehicle_class_get___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAtMost_get___()
SWIGINTERN bool std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Contains(std::vector< operations_research::IntervalVar * > *self, operations_research::IntervalVar *const &value)
int(SWIGSTDCALL * SWIG_Callback22_t)()
void(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Accept___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddRequiredTypeAlternativesWhenRemovingType___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAfterStart___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseObject_ToString___(void *jarg1)
virtual void BeginNextDecision(DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
static const char kValuesArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_kNoProgress_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_AddPropagationMonitor___(void *jarg1, void *jarg2)
virtual std::string DebugString() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_CONSTRAINT_MAX_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ApplyDecision___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Remove___(void *jarg1, void *jarg2)
SWIGINTERN int std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__IndexOf(std::vector< operations_research::LocalSearchFilter * > *self, operations_research::LocalSearchFilter *const &value)
SWIGINTERN int std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__LastIndexOf(std::vector< operations_research::SearchMonitor * > *self, operations_research::SearchMonitor *const &value)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_ToString___(void *jarg1)
IntVar * VarWithName(const std::string &name)
Creates a variable from the expression and set the name of the resulting var.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RegisterUnaryTransitCallback___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AreAllBound___(void *jarg1)
DecisionBuilder * MakeSetValuesFromTargets(Solver *solver, std::vector< IntVar * > variables, std::vector< int64 > targets)
A decision builder which tries to assign values to variables as close as possible to target values fi...
virtual bool HoldsDelta() const
static const char kLess[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_1___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback24_t)()
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAtStartWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
void(SWIGSTDCALL * SWIG_Callback3_t)()
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DecisionBuilderVector__SWIG_2___(int jarg1)
virtual bool LocalOptimum()
When a local optimum is reached.
static const char kIndex2Argument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Pack___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndInitialPropagation___(void *jarg1)
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PosIntDivDown___(long long jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_director_connect___(void *objarg, SwigDirector_SearchMonitor::SWIG_Callback0_t callback0, SwigDirector_SearchMonitor::SWIG_Callback1_t callback1, SwigDirector_SearchMonitor::SWIG_Callback2_t callback2, SwigDirector_SearchMonitor::SWIG_Callback3_t callback3, SwigDirector_SearchMonitor::SWIG_Callback4_t callback4, SwigDirector_SearchMonitor::SWIG_Callback5_t callback5, SwigDirector_SearchMonitor::SWIG_Callback6_t callback6, SwigDirector_SearchMonitor::SWIG_Callback7_t callback7, SwigDirector_SearchMonitor::SWIG_Callback8_t callback8, SwigDirector_SearchMonitor::SWIG_Callback9_t callback9, SwigDirector_SearchMonitor::SWIG_Callback10_t callback10, SwigDirector_SearchMonitor::SWIG_Callback11_t callback11, SwigDirector_SearchMonitor::SWIG_Callback12_t callback12, SwigDirector_SearchMonitor::SWIG_Callback13_t callback13, SwigDirector_SearchMonitor::SWIG_Callback14_t callback14, SwigDirector_SearchMonitor::SWIG_Callback15_t callback15, SwigDirector_SearchMonitor::SWIG_Callback16_t callback16, SwigDirector_SearchMonitor::SWIG_Callback17_t callback17, SwigDirector_SearchMonitor::SWIG_Callback18_t callback18, SwigDirector_SearchMonitor::SWIG_Callback19_t callback19, SwigDirector_SearchMonitor::SWIG_Callback20_t callback20, SwigDirector_SearchMonitor::SWIG_Callback21_t callback21, SwigDirector_SearchMonitor::SWIG_Callback22_t callback22, SwigDirector_SearchMonitor::SWIG_Callback23_t callback23, SwigDirector_SearchMonitor::SWIG_Callback24_t callback24)
unsigned int(SWIGSTDCALL * SWIG_Callback25_t)()
virtual bool SkipUnchanged(int index) const
static constexpr int kNoProgress
@ ROUTING_NOT_SOLVED
Problem not solved yet (before calling RoutingModel::Solve()).
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingModel_VehicleTypeContainer_VehicleClassEntry___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AFTER_END_get___()
void(SWIGSTDCALL * SWIG_Callback18_t)()
virtual void Commit(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta)
Dual of Relax(), lets the filter know that the delta was accepted.
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhase__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_IsLessOrEqual___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_Install___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_EndVisitExtension___(void *jarg1, char *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetObjectiveMax___(void *jarg1, long long jarg2)
static const char kIsBetween[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CpRandomSeed___()
SWIGINTERN operations_research::SequenceVar * std_vector_Sl_operations_research_SequenceVar_Sm__Sg__getitemcopy(std::vector< operations_research::SequenceVar * > *self, int index)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAtStart___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCustomLimit___(void *jarg1, void *jarg2)
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_UnfreezeQueue___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_2___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback27_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SequenceVarContainer___(void *jarg1)
SWIGINTERN int std_vector_Sl_int64_Sg__LastIndexOf(std::vector< int64 > *self, long const &value)
virtual void Init()
This method is called when the search limit is initialized.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ChangeValue_MakeOneNeighbor___(void *jarg1)
@ UNACTIVELNS
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CST_SUB_VAR_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_EQUALITY_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_GE_get___()
SWIGINTERN std::vector< int > * std_vector_Sl_int_Sg__Repeat(int const &value, int count)
std::function< void()> Closure
@ CHOOSE_LOWEST_MIN
Among unbound variables, select the variable with the smallest minimal value.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_WhenBound__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_NumIntervalVars___(void *jarg1)
SWIGEXPORT unsigned long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Stamp___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsLess_get___()
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGINTERN std::vector< operations_research::SequenceVar * > * new_std_vector_Sl_operations_research_SequenceVar_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_DecisionBuilderVector___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kRelaxedMinOperation_get___()
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsLess__SWIG_0(operations_research::IntExpr *self, int64 value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingNonStrictBoxesConstraint__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MAX_SIZE_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarVector__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVoidConstraint___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLastSolutionCollector__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarConstantConstraint___(void *jarg1, void *jarg2, long long jarg3, int jarg4)
static const char kIndexOf[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CompactAssignment___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOptimize___(void *jarg1, unsigned int jarg2, void *jarg3, long long jarg4)
static const char kDisjunctive[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_FastAdd__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_FinishCurrentSearch___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_Accept___(void *jarg1, void *jarg2)
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScheduleOrPostpone___(void *jarg1, void *jarg2, long long jarg3, long *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_InitFragmentsSwigExplicitBaseLns___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Solver_IntegerCastInfo__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_AssignmentSequenceContainer___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_6___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
static SWIG_CSharpStringHelperCallback SWIG_csharp_string_callback
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingIndexManager__SWIG_1___(int jarg1, int jarg2, int length3, int *jarg3, int length4, int *jarg4)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
@ VAR_CONSTANT_GREATER_OR_EQUAL
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhase__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Redefines MakeNextNeighbor to export a simpler interface.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
std::function< int64(const Model &)> Value(IntegerVariable v)
SWIGINTERN std::vector< operations_research::IntVar * > * std_vector_Sl_operations_research_IntVar_Sm__Sg__GetRange(std::vector< operations_research::IntVar * > *self, int index, int count)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_heuristic_period_get___(void *jarg1)
SWIGEXPORT operations_research::SearchLimit *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_SWIGUpcast___(operations_research::RegularLimit *jarg1)
SWIGINTERN std::vector< operations_research::LocalSearchFilter * > * std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__GetRange(std::vector< operations_research::LocalSearchFilter * > *self, int index, int count)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_LocalSearchProfile___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_CopyIntersection___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_IndexOf___(void *jarg1, void *jarg2)
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAtStartWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitScheduleOrExpedite___(void *jarg1, void *jarg2, long long jarg3)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVector___(void *jarg1)
SWIGINTERN std::vector< operations_research::SequenceVar * > * std_vector_Sl_operations_research_SequenceVar_Sm__Sg__GetRange(std::vector< operations_research::SequenceVar * > *self, int index, int count)
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasTemporalTypeRequirements___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback6_t)(void *)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::DecisionBuilder * > *self, int index, int count)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_PROBLEM_INFEASIBLE_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_GetBaseNodeRestartPosition___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetMax__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
char *(SWIGSTDCALL * SWIG_CSharpStringHelperCallback)(const char *)
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
@ CHOOSE_MIN_SIZE_LOWEST_MIN
Among unbound variables, select the variable with the smallest size, i.e., the smallest number of pos...
virtual void Run(operations_research::Solver *const s)
This is the main callback of the demon.
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_SWIGUpcast___(operations_research::PropagationBaseObject *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_RefuteDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAfterEnd___(void *jarg1, void *jarg2)
virtual bool MakeNeighbor()=0
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_TypeIncompatibilityChecker___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMaxEqual_get___()
SWIGINTERN void std_vector_Sl_int_Sg__Reverse__SWIG_0(std::vector< int > *self)
virtual std::string Print() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePathCumul__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
virtual bool Check()
This method is called to check the status of the limit.
virtual void AfterDecision(operations_research::Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSquare___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreaker_AddIntegerVariableEqualValueClause___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarElement__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntervalVarVector__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Fail___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllDifferent__SWIG_1___(void *jarg1, void *jarg2, unsigned int jarg3)
static const char kCumulative[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeInversePermutationConstraint___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SIMPLELNS_get___()
void(SWIGSTDCALL * SWIG_Callback6_t)()
VisitTypePolicy
Set the node visit types and incompatibilities/requirements between the types (see below).
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGINTERN bool std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Contains(std::vector< operations_research::SequenceVar * > *self, operations_research::SequenceVar *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSumEquality__SWIG_0___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseIntExpr_CastToVar___(void *jarg1)
@ ROUTING_SUCCESS
Problem solved successfully after calling RoutingModel::Solve().
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Insert(std::vector< operations_research::LocalSearchFilter * > *self, int index, operations_research::LocalSearchFilter *const &x)
virtual ~SwigDirector_LocalSearchOperator()
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activate__SWIG_2___(void *jarg1, void *jarg2)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsMemberCt__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, void *jarg4)
static const char kPower[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_SetSequence___(void *jarg1, int length2, int *jarg2, int length3, int *jarg3, int length4, int *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_CHOOSE_MAX_SUM_IMPACT_get___()
virtual ~SwigDirector_BaseLns()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_BeginFail___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetSpanCostCoefficientForVehicle___(void *jarg1, long long jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_SetName___(void *jarg1, char *jarg2)
static const char kLightElement[]
Constraint types.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_RefuteDecisionSwigExplicitSearchLimit___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_LE_get___()
void(SWIGSTDCALL * SWIG_Callback19_t)()
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
virtual void Start(operations_research::Assignment const *assignment)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddSearchMonitor___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Value___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVector__SWIG_2___(int jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Vehicles___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_MakeSetValuesFromTargets___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
static const char kIntervalsArgument[]
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__RemoveAt(std::vector< operations_research::IntervalVar * > *self, int index)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetTransitValueFromClass___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_SetNextBaseToIncrementSwigExplicitPathOperator___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CONST_VAR_get___()
@ VAR_CONSTANT_CONSTANT_BETWEEN
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIfThenElseCt___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Insert(std::vector< operations_research::IntervalVar * > *self, int index, operations_research::IntervalVar *const &x)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperator_director_connect___(void *objarg, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback0_t callback0, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback1_t callback1, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback2_t callback2, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback3_t callback3, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback4_t callback4, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback5_t callback5, SwigDirector_IntVarLocalSearchOperator::SWIG_Callback6_t callback6)
std::string model_name() const
Returns the name of the model.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsVar___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Contains___(void *jarg1, void *jarg2)
static const char kIntervalBinaryRelation[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
Interval variables are often used in scheduling.
@ ASSIGN_RANDOM_VALUE
Selects randomly one of the possible values of the selected variable.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSplitVariableDomain___(void *jarg1, void *jarg2, long long jarg3, unsigned int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_AssignmentIntContainer___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::SearchMonitor * > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_Maintain___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetRange__SWIG_1___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarArrayConstantArrayExpression___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenAnything__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_WallTime___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessOrEqualVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_Var___(void *jarg1)
#define SWIG_UnknownError
VarConstantArrayExpressionType
@ VAR_CONSTANT_CONSTRAINT_MAX
A DecisionVisitor is used to inspect a decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RemoveValues___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
@ SIMPLELNS
Operator which defines one neighbor per variable.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Contains__SWIG_1___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_PerformedValue___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndMin___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetStatus___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAfterStartWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_WhenRange__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SENTINEL_get___()
virtual void AfterDecision(Decision *const d, bool apply)
Just after refuting or applying the decision, apply is true after Apply.
void swig_connect_director(SWIG_Callback0_t callbackToString)
void(SWIGSTDCALL * SWIG_Callback21_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_LESS_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Restore___(void *jarg1)
virtual ~SwigDirector_SymmetryBreaker()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetArcCostEvaluatorOfVehicle___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_ResetSwigExplicitLocalSearchOperator___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SolutionPool___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Relax___(void *jarg1, void *jarg2, void *jarg3)
int(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessOrEqualCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Bound___(void *jarg1, void *jarg2)
@ DECREMENT
Operator which defines a neighborhood to decrement values.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Remove___(void *jarg1, long long jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__SetRange(std::vector< operations_research::LocalSearchOperator * > *self, int index, std::vector< operations_research::LocalSearchOperator * > const &values)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_PathOperator___(void *jarg1)
int RegisterTransitCallback(TransitCallback2 callback)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_IS_LESS_OR_EQUAL_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetFixedCostOfAllVehicles___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Store___(void *jarg1)
int RegisterPositiveUnaryTransitCallback(TransitCallback1 callback)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_AreAllElementsBound___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartMax___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetAmortizedCostFactorsOfAllVehicles___(void *jarg1, long long jarg2, long long jarg3)
@ STARTS_AFTER_END
t1 starts after t2 end, i.e. Start(t1) >= End(t2) + delay.
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRankFirstInterval___(void *jarg1, void *jarg2, int jarg3)
@ SWIG_CSharpApplicationException
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDimension___(void *jarg1, int jarg2, long long jarg3, long long jarg4, unsigned int jarg5, char *jarg6)
static const char kSearchLimitExtension[]
virtual void VisitRankFirstInterval(SequenceVar *const sequence, int index)
@ SWIG_CSharpArgumentException
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Failures___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAtEndWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDurationMinArgument_get___()
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAfterEndWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_type_index_of_vehicle_set___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_StartMin___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__InsertRange(std::vector< operations_research::IntervalVar * > *self, int index, std::vector< operations_research::IntervalVar * > const &values)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_HoldsDelta___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsDifferentCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_expression_set___(void *jarg1, void *jarg2)
static const char kObjectiveExtension[]
SWIGINTERN std::vector< std::vector< int > > * std_vector_Sl_std_vector_Sl_int_Sg__Sg__Repeat(std::vector< int > const &value, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerMatrixArgument___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertExprExprExpression___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Copy___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_SequenceVar_Sm__Sg__Insert(std::vector< operations_research::SequenceVar * > *self, int index, operations_research::SequenceVar *const &x)
@ PATHLNS
Operator which relaxes two sub-chains of three consecutive arcs each.
static const char kSizeYArgument[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartExpr_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kRelationArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_LocalOptimum___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsMemberVar__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_BasePathFilter___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenDurationRange__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kActiveArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetGlobalSpanCostCoefficient___(void *jarg1, long long jarg2)
SWIGINTERN int operations_research_IntVarLocalSearchFilter_Index(operations_research::IntVarLocalSearchFilter *self, operations_research::IntVar *const var)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreaterOrEqual__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
void EnterSearch() override
Internal methods.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_InsertAll__SWIG_0___(void *jarg1, int len2_1, int len2_2[], int64 *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSum__SWIG_2___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetSpanUpperBoundForVehicle___(void *jarg1, int jarg2)
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetUnperformed___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_HasBreakConstraints___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_AddVars___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasVehicleWithCostClassIndex___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_getitemcopy___(void *jarg1, int jarg2)
void(SWIGSTDCALL * SWIG_Callback24_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_StartMax___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarLocalSearchFilter___(void *jarg1)
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackReset, SWIG_Callback2_t callbackHasFragments, SWIG_Callback3_t callbackHoldsDelta, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackOnStart, SWIG_Callback6_t callbackMakeOneNeighbor)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_PICKUP_AND_DELIVERY_LIFO_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMinArgument_get___()
virtual void BeginInitialPropagation()
Before the initial propagation.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPower_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_Accept___(void *jarg1, void *jarg2)
static const char kRelationArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenAnything__SWIG_0___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_int64_Sg__AddRange(std::vector< int64 > *self, std::vector< long > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_IntervalVarContainer___(void *jarg1)
void AcceptUncheckedNeighbor(Search *const search)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GlobalSpanCostCoefficient___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOICE_POINT_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Reverse__SWIG_0___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RegisterPositiveTransitCallback___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLubyRestart___(void *jarg1, int jarg2)
void(SWIGSTDCALL * SWIG_Callback23_t)(void *)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAbsEquality___(void *jarg1, void *jarg2, void *jarg3)
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
virtual std::string BaseName() const
Returns a base name for automatic naming.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFailuresLimit___(void *jarg1, long long jarg2)
int(SWIGSTDCALL * SWIG_Callback22_t)()
static const int64 kMinValidValue
The smallest acceptable value to be returned by StartMin()
virtual bool LocalOptimum()
When a local optimum is reached.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CheckFail___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_capacity___(void *jarg1)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BasePathFilter_OnSynchronize___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_ResetSwigExplicitPathOperator___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ExitSearchSwigExplicitRegularLimit___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingModel_VehicleTypeContainer_VehicleClassEntry___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdEquality__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSemiContinuous_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IN_SEARCH_get___()
SWIGINTERN std::vector< int64 > * new_std_vector_Sl_int64_Sg___SWIG_2(int capacity)
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_IsIncrementalSwigExplicitLocalSearchFilter___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetStartMax___(void *jarg1, long long jarg2)
SWIGINTERN bool std_vector_Sl_int_Sg__Remove(std::vector< int > *self, int const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RoutingModelVisitor___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_ResetActionOnFail___(void *jarg1)
IntervalVar * MakeIntervalRelaxedMin(IntervalVar *const interval_var)
Creates and returns an interval variable that wraps around the given one, relaxing the min start and ...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_REVERSIBLE_ACTION_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RestartCurrentSearch___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kRightArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeElement__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
virtual bool OnSamePathAsPreviousBase(int64 base_index)
Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...
virtual void ExitSearch()
End of the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_BeginFiltering___(void *jarg1, void *jarg2)
@ SWIG_CSharpInvalidCastException
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveAndCommit__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AtSolutionSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionPool_SyncNeeded___(void *jarg1, void *jarg2)
virtual bool HasFragments() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndExpr___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_CannotBePerformed___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AcceptUncheckedNeighbor___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetBreakIntervalsOfVehicle___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenStartRange__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Bound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntervalVarElement__SWIG_0___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_LastIndexOf___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_DurationExpr___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback13_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Failures___(void *jarg1)
virtual bool MakeNeighbor()
virtual bool HoldsDelta() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VOID_FALSE_CONSTRAINT_get___()
@ INTERVAL_SIMPLE
The simple is INTERVAL_SET_TIMES_FORWARD.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBestValueSolutionCollector__SWIG_1___(void *jarg1, unsigned int jarg2)
IntVar * MakeIsLessOrEqualCstVar(IntExpr *const var, int64 value)
status var of (var <= value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetObjectiveValue___(void *jarg1, long long jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
virtual void EnterSearch()
Internal methods.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ApplyLocks___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsLess__SWIG_1___(void *jarg1, void *jarg2)
@ CHOOSE_MIN_SIZE_HIGHEST_MAX
Among unbound variables, select the variable with the smallest size, i.e., the smallest number of pos...
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_0___(void *jarg1, void *jarg2, int jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeExitSearchCallback___(void *jarg1, void *jarg2)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IsMatchingModel___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenEndRange__SWIG_1___(void *jarg1, void *jarg2)
virtual bool LocalOptimum()
When a local optimum is reached.
A constraint is the main modeling object.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Value___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_maintainer_set___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllSolutionCollector__SWIG_1___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_run_all_heuristics_get___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INT_VALUE_DEFAULT_get___()
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_EndMax___(void *jarg1, void *jarg2)
static const char kLeftArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRestoreAssignment___(void *jarg1, void *jarg2)
static const char kStartMaxArgument[]
SWIGINTERN int std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__IndexOf(std::vector< operations_research::SearchMonitor * > *self, operations_research::SearchMonitor *const &value)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSumGreaterOrEqual_get___()
RoutingNodeIndex NodeIndex
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetEndMax___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetPerformedValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_GetOrCreateLocalSearchState___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_Var___(void *jarg1, int jarg2)
SWIGINTERN int std_vector_Sl_operations_research_IntervalVar_Sm__Sg__IndexOf(std::vector< operations_research::IntervalVar * > *self, operations_research::IntervalVar *const &value)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDistribute_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_FIRST_UNBOUND_get___()
static const char kConditionalExpr[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_solver___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_ModelVisitor___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCountAssignedItemsExtension_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_AvoidsDate___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SetSpanUpperBoundForVehicle___(void *jarg1, long long jarg2, int jarg3)
char *(SWIGSTDCALL * SWIG_Callback25_t)()
static const char kAbsEqual[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsMemberVar__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3)
virtual bool MakeOneNeighbor()
This method should not be overridden. Override MakeNeighbor() instead.
@ KEEP_LEFT
Right branches are ignored.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreaker_AddIntegerVariableLessOrEqualValueClause___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Insert(std::vector< operations_research::SearchMonitor * > *self, int index, operations_research::SearchMonitor *const &x)
@ EQ
Move is accepted when the current objective value is in the interval objective.Min .
SWIGINTERN long std_vector_Sl_int64_Sg__getitemcopy(std::vector< int64 > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetObjectiveRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDimensionWithVehicleTransitAndCapacity___(void *jarg1, int length2, int *jarg2, long long jarg3, int length4, int64 *jarg4, unsigned int jarg5, char *jarg6)
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_CopyIntersection___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTransitionConstraint__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int length5, int64 *jarg5)
SWIGINTERN int std_vector_Sl_operations_research_SequenceVar_Sm__Sg__IndexOf(std::vector< operations_research::SequenceVar * > *self, operations_research::SequenceVar *const &value)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_EXCHANGE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_director_connect___(void *objarg, SwigDirector_Constraint::SWIG_Callback0_t callback0, SwigDirector_Constraint::SWIG_Callback1_t callback1, SwigDirector_Constraint::SWIG_Callback2_t callback2, SwigDirector_Constraint::SWIG_Callback3_t callback3, SwigDirector_Constraint::SWIG_Callback4_t callback4)
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
virtual void Reset()
Sets the filter to empty solution.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMax_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Remove___(void *jarg1, int jarg2)
SWIGEXPORT operations_research::SearchMonitor *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_SWIGUpcast___(operations_research::SearchLimit *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_RankNotFirst___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EnterSearch___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Restore___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AFTER_END_get___()
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_TypeRequirementChecker___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignVariableValueOrDoNothing___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSimulatedAnnealing___(void *jarg1, unsigned int jarg2, void *jarg3, long long jarg4, long long jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetMin__SWIG_0___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_OneDomain___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_Revert___(void *jarg1)
SWIGINTERN void std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__SetRange(std::vector< operations_research::DecisionBuilder * > *self, int index, std::vector< operations_research::DecisionBuilder * > const &values)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAtStart(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_heuristic_period_set___(void *jarg1, int jarg2)
virtual void VisitRankFirstInterval(operations_research::SequenceVar *const sequence, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddCountAssignedItemsDimension___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activated__SWIG_2___(void *jarg1, void *jarg2)
virtual bool AcceptSolution()
This method is called when a solution is found.
SequenceVarElement * Clone()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchOperatorVector__SWIG_2___(int jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVectorVector__SWIG_0___()
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kUsageEqualVariableExtension_get___()
IntVar * MakeIsDifferentVar(IntExpr *const v1, IntExpr *const v2)
status var of (v1 != v2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_Var___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsGreaterOrEqual_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessVar___(void *jarg1, void *jarg2, void *jarg3)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetStartRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_CrossesDate___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIndex2Argument_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_kNoPenalty_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_BaseName___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Deactivate__SWIG_1___(void *jarg1, void *jarg2)
virtual bool AtSolution()
This method is called when a valid solution is found.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Insert___(void *jarg1, int jarg2, void *jarg3)
bool AreAllBound(const std::vector< IntVar * > &vars)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_MapTo___(void *jarg1, void *jarg2)
@ LE
Move is accepted when the current objective value <= objective.Max.
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
static const char kDurationMinArgument[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_Init___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Rand64___(void *jarg1, long long jarg2)
static const char kPathCumul[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSortingConstraint_get___()
static const char kExpressionArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DecisionBuilderVector__SWIG_1___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerArgument___(void *jarg1, char *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDelayedConstraintInitialPropagateCallback___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Reverse__SWIG_0___(void *jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsGreaterOrEqual__SWIG_0(operations_research::IntExpr *self, int64 value)
virtual ~SwigDirector_PathOperator()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetCostClassesCount___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_Remove___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_FULLPATHLNS_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSymmetryManager__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSolutionLimitArgument_get___()
IntVar * MakeIsGreaterOrEqualCstVar(IntExpr *const var, int64 value)
status var of (var >= value)
SWIGINTERN operations_research::IntervalVar * std_vector_Sl_operations_research_IntervalVar_Sm__Sg__getitemcopy(std::vector< operations_research::IntervalVar * > *self, int index)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_capacity___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AFTER_START_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetEndMax___(void *jarg1, long long jarg2)
Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ...
virtual void NoMoreSolutions()
When the search tree is finished.
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackVisitSetVariableValue, SWIG_Callback2_t callbackVisitSplitVariableDomain, SWIG_Callback3_t callbackVisitScheduleOrPostpone, SWIG_Callback4_t callbackVisitScheduleOrExpedite, SWIG_Callback5_t callbackVisitRankFirstInterval, SWIG_Callback6_t callbackVisitRankLastInterval, SWIG_Callback7_t callbackVisitUnknownDecision)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Constraint_IsCastConstraint___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreaker_AddIntegerVariableGreaterOrEqualValueClause___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AT_END_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback25_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsDifferent_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_IntVarContainer___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSquare_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_FreezeQueue___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_RemoveAt___(void *jarg1, int jarg2)
virtual void EndFail()
After completing the backtrack.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SolveAndCommit__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
IntervalVar * MakeIntervalRelaxedMax(IntervalVar *const interval_var)
Creates and returns an interval variable that wraps around the given one, relaxing the max start and ...
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIndexOfConstraint___(void *jarg1, void *jarg2, void *jarg3, long long jarg4)
virtual bool AcceptDelta(Assignment *delta, Assignment *deltadelta)
int64 Rand64(int64 size)
Returns a random value between 0 and 'size' - 1;.
@ ASSIGN_MIN_VALUE
Selects the min value of the selected variable.
virtual std::string DebugString() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCircuit___(void *jarg1, void *jarg2)
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCumulative_get___()
long long(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterCstCt___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetCumulVarSoftLowerBound___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAssignVariableValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_UNACTIVELNS_get___()
SWIGINTERN int std_vector_Sl_operations_research_SequenceVar_Sm__Sg__LastIndexOf(std::vector< operations_research::SequenceVar * > *self, operations_research::SequenceVar *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activate__SWIG_1___(void *jarg1, void *jarg2)
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Pack___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentElement_Deactivate___(void *jarg1)
static const char kCountEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetMaximumNumberOfActiveVehicles___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AcceptDelta___(void *jarg1, void *jarg2, void *jarg3)
DirectorException(const char *msg)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_StartProcessingIntegerVariable___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CostsAreHomogeneousAcrossVehicles___(void *jarg1)
static const char kEndMinArgument[]
SWIGINTERN void std_vector_Sl_int64_Sg__setitem(std::vector< int64 > *self, int index, long const &val)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_reserve___(void *jarg1, unsigned long jarg2)
A Demon is the base element of a propagation queue.
IntVar * MakeIsGreaterOrEqualVar(IntExpr *const left, IntExpr *const right)
status var of (left >= right)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activate__SWIG_0___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::LocalSearchOperator * std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__getitemcopy(std::vector< operations_research::LocalSearchOperator * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IntegerCastInfo_variable_set___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_CompactAndCheckAssignment___(void *jarg1, void *jarg2)
std::string DebugString() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarConstantConstantConstraint___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, long long jarg5, int jarg6)
static const char kFailuresLimitArgument[]
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Clear___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilder_ToString___(void *jarg1)
virtual void RestartSearch()
Restart the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetDurationRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_BeginFilterNeighbor___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WasPerformedBound___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_SetUnassigned___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_RANDOM_get___()
Checker for type incompatibilities.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingModelVisitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_EndAcceptNeighbor___(void *jarg1, void *jarg2, unsigned int jarg3)
unsigned int(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_StartsAfterEndWithDelay___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INT_VAR_DEFAULT_get___()
SWIGINTERN void std_vector_Sl_int64_Sg__Insert(std::vector< int64 > *self, int index, long const &x)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_director_connect___(void *objarg, SwigDirector_Decision::SWIG_Callback0_t callback0, SwigDirector_Decision::SWIG_Callback1_t callback1, SwigDirector_Decision::SWIG_Callback2_t callback2, SwigDirector_Decision::SWIG_Callback3_t callback3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_random_seed_get___(void *jarg1)
std::function< int64(int64)> IndexEvaluator1
Callback typedefs.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_Clear___(void *jarg1)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilder_SWIGUpcast___(operations_research::DecisionBuilder *jarg1)
SWIGINTERN void std_vector_Sl_int_Sg__RemoveRange(std::vector< int > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Solution___(void *jarg1, int jarg2)
static const char kUsageEqualVariableExtension[]
static const char kModulo[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_heuristic_num_failures_limit_get___(void *jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsGreaterOrEqual__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_Install___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_EnqueueVar___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_display_level_get___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginNextDecisionSwigExplicitSearchMonitor___(void *jarg1, void *jarg2)
static const char kRightArgument[]
virtual void Copy(operations_research::SearchLimit const *const limit)
Copy a limit.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_8___(void *jarg1, void *jarg2, void *jarg3, int jarg4, int jarg5)
void(SWIGSTDCALL * SWIG_Callback18_t)()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_HasFragments___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertExprExprConstantExpression___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, long long jarg5, int jarg6)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_SWIGUpcast___(operations_research::Demon *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_CPFeasibilityFilter___(void *jarg1)
SWIGINTERN operations_research::SearchMonitor * std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__getitemcopy(std::vector< operations_research::SearchMonitor * > *self, int index)
SWIG_CSharpExceptionCodes
bool AtSolution() override
This method is called when a valid solution is found.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVarValueWatcher_get___()
@ CHOOSE_RANDOM_RANK_FORWARD
void(SWIGSTDCALL * SWIG_Callback2_t)(void *)
SwigDirector_LocalSearchOperator()
static const char kDistribute[]
void(SWIGSTDCALL * SWIG_Callback12_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeBoolVar__SWIG_1___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_CONSTANT_EXPRESSION_MAX_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kOptionalArgument_get___()
SWIGEXPORT uint8 *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultRoutingModelParameters___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindExprExprExpression___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_RestartAtPathStartOnSynchronize___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetPerformedRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_Assign___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Restore___(void *jarg1)
SWIGEXPORT operations_research::PropagationBaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SWIGUpcast___(operations_research::IntervalVar *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDecision___(void *jarg1, void *jarg2, void *jarg3)
virtual ~SwigDirector_ChangeValue()
void(SWIGSTDCALL * SWIG_Callback11_t)()
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_RefuteDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Add___(void *jarg1, void *jarg2)
virtual void VisitSplitVariableDomain(operations_research::IntVar *const var, int64 value, bool start_with_lower_half)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetSpanCostCoefficientForVehicle___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitRankFirstInterval___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AreAllBooleans___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_EnterSearchSwigExplicitSolutionCollector___(void *jarg1)
virtual bool HasFragments() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_Accept___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SearchMonitorVector__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
virtual void EndNextDecision(operations_research::DecisionBuilder *const b, operations_research::Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ToString___(void *jarg1)
Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_TRACE_VAR_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntervalArrayArgument___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Deactivate___(void *jarg1, long long jarg2)
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_Value___(void *jarg1)
virtual void Accept(operations_research::ModelVisitor *const visitor) const
Accepts the given model visitor.
virtual void RefuteDecision(Decision *const d)
Before refuting the decision.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSum_get___()
virtual std::string DebugString() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_KEEP_LEFT_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_Size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsLess__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_10___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, int jarg6, int jarg7)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SafeEndExpr___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModelVisitor_kRemoveValues_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BOOLEAN_VAR_get___()
virtual bool Accept(operations_research::Assignment const *delta, operations_research::Assignment const *deltadelta, int64 objective_min, int64 objective_max)
Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMonotonicElement___(void *jarg1, void *jarg2, unsigned int jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SymmetryBreaker___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_HoldsDelta___(void *jarg1)
static const char kIsGreaterOrEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetStartMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_RankNotLast___(void *jarg1, int jarg2)
virtual bool IsIncremental() const
std::string DebugString() const override
Generic path-based filter class.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RELOCATE_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Max___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kScalProdLessOrEqual_get___()
virtual void Start(operations_research::Assignment const *assignment)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNullIntersect_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEvaluatorArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarElement__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFixedDurationIntervalVar__SWIG_1___(void *jarg1, void *jarg2, long long jarg3, char *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_SetValue___(void *jarg1, long long jarg2, int length3, int *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_SetUnperformed___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Reverse__SWIG_0___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAfterStartWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetPerformedMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IgnoreDisjunctionsAlreadyForcedToZero___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetStartMax___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Init___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback2_t)()
virtual bool AtSolution()
This method is called when a valid solution is found.
void(SWIGSTDCALL * SWIG_Callback10_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_FastAdd__SWIG_2___(void *jarg1, void *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_ShortestTransitionSlack___(void *jarg1, long long jarg2)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsLessOrEqual__SWIG_0(operations_research::IntExpr *self, int64 value)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_StartValue___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFirstSolutionCollector__SWIG_1___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kModuloArgument_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_CPFeasibilityFilter___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_2___(void *jarg1, int jarg2, void *jarg3)
CostClassIndex GetCostClassIndexOfVehicle(int64 vehicle) const
Get the cost class index of the given vehicle.
virtual bool HoldsDelta() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_GetRange___(void *jarg1, int jarg2, int jarg3)
virtual bool AcceptSolution()
This method is called when a solution is found.
void(SWIGSTDCALL * SWIG_CSharpExceptionCallback_t)(const char *)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_Reset___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_TypeRegulationsConstraint___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_ChangeValue___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_HoldsDeltaSwigExplicitLocalSearchOperator___(void *jarg1)
SWIGINTERN void std_vector_Sl_int_Sg__Insert(std::vector< int > *self, int index, int const &x)
@ VAR_CONSTANT_NON_EQUALITY
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdLessOrEqual__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMax__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_RemoveAt___(void *jarg1, int jarg2)
virtual void VisitScheduleOrExpedite(IntervalVar *const var, int64 est)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_Synchronize___(void *jarg1, void *jarg2, void *jarg3)
static const char kIsLess[]
char *(SWIGSTDCALL * SWIG_Callback0_t)()
virtual void SetNextBaseToIncrement(int64 base_index)
Set the next base to increment on next iteration.
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__RemoveAt(std::vector< std::vector< int > > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_RemoveAt___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntTupleSet__SWIG_1___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Failures___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_EndValue___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarConstantConstantExpression___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, long long jarg5, int jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_NextVar___(void *jarg1, long long jarg2)
virtual void InitFragments()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_ConsiderAlternativesSwigExplicitPathOperator___(void *jarg1, long long jarg2)
virtual void NoMoreSolutions()
When the search tree is finished.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_Priority___(void *jarg1)
SWIGINTERN bool std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__Remove(std::vector< operations_research::DecisionBuilder * > *self, operations_research::DecisionBuilder *const &value)
SWIGINTERN bool std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__Contains(std::vector< operations_research::SymmetryBreaker * > *self, operations_research::SymmetryBreaker *const &value)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_SetValue___(void *jarg1, long long jarg2, long long jarg3)
SWIGINTERN bool std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Remove(std::vector< operations_research::LocalSearchOperator * > *self, operations_research::LocalSearchOperator *const &value)
void set_fail_intercept(std::function< void()> fail_intercept)
Internal.
@ SWIG_CSharpInvalidOperationException
static const char kDeviation[]
@ SWIG_CSharpSystemException
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsMember__SWIG_1___(void *jarg1, int length2, int *jarg2)
static const char kSequenceVariable[]
static const char kPack[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsEqualVar___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MAKECHAININACTIVE_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_AreAllElementsBound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_6___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int length4, int64 *jarg4, int length5, int64 *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalRelaxedMax___(void *jarg1, void *jarg2)
std::string DebugString() const override
@ ADDED_TYPE_REMOVED_FROM_VEHICLE
When visited, one instance of type 'T' previously added to the route (TYPE_ADDED_TO_VEHICLE),...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_Name___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_AddVars___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
virtual void BeginFail()
Just when the failure occurs.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPRESSION_MAX_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntTupleSet___(void *jarg1)
virtual void AcceptNeighbor()
After accepting a neighbor during local search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_BackwardSequence___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetStartRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_BackwardSequence___(void *jarg1, int jarg2, void *jarg3)
@ VAR_PRIORITY
VAR_PRIORITY is between DELAYED_PRIORITY and NORMAL_PRIORITY.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_NORMAL_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kProduct_get___()
virtual void EnterSearch()
Beginning of the search.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_OnSamePathAsPreviousBase___(void *jarg1, long long jarg2)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModelVisitor_SWIGUpcast___(operations_research::RoutingModelVisitor *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIntervalUnaryRelation_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_13___(void *jarg1, void *jarg2, int jarg3)
@ IN_ROOT_NODE
Executing the root node.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kRelaxedMaxOperation_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Activated__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVarArrayConstantArrayExpression___(void *jarg1, void *jarg2, void *jarg3, int length4, int64 *jarg4, int jarg5)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsGreater__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDeviation___(void *jarg1, void *jarg2, void *jarg3, long long jarg4)
void(SWIGSTDCALL * SWIG_Callback9_t)()
SWIGINTERN void std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__AddRange(std::vector< operations_research::SearchMonitor * > *self, std::vector< operations_research::SearchMonitor * > const &values)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertExprExprConstraint___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DisjunctiveConstraint_SetTransitionTime___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_SetImpossible___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertExprExpression___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
DirectorException(const std::string &msg)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_PICKUP_AND_DELIVERY_FIFO_get___()
bool AtSolution() override
This method is called when a valid solution is found.
void(SWIGSTDCALL * SWIG_Callback15_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RankNotLast___(void *jarg1, void *jarg2, int jarg3)
@ CHOOSE_MIN_SIZE_LOWEST_MAX
Among unbound variables, select the variable with the smallest size, i.e., the smallest number of pos...
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Try__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SymmetryBreakerVector__SWIG_2___(int jarg1)
@ VAR_CONSTANT_CONSTANT_SEMI_CONTINUOUS
SWIGEXPORT operations_research::AssignmentElement *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_SWIGUpcast___(operations_research::IntVarElement *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_IS_NOT_EQUAL_get___()
@ MAKECHAININACTIVE
Operator which makes a "chain" of path nodes inactive.
static const char kIsLessOrEqual[]
int64 One()
This method returns 1.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAtSolutionCallback___(void *jarg1, void *jarg2)
static const char kSequencesArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_ChangeValue___(void *jarg1)
SWIGEXPORT operations_research::SearchLimit *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_SWIGUpcast___(operations_research::ImprovementSearchLimit *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVarsArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_reserve___(void *jarg1, unsigned long jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)(void *, void *, long long, long long)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetMin__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetRange__SWIG_0___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
This class is the root class of all solution collectors.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_CopySwigExplicitRegularLimit___(void *jarg1, void *jarg2)
@ STAYS_IN_SYNC
STARTS_AT_START and ENDS_AT_END at the same time.
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_4___(void *jarg1, void *jarg2)
virtual bool AcceptSolution()
This method is called when a solution is found.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGuidedLocalSearch__SWIG_0___(void *jarg1, unsigned int jarg2, void *jarg3, void *jarg4, long long jarg5, void *jarg6, double jarg7)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_DemonRuns___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_BeginNestedConstraintInitialPropagation___(void *jarg1, void *jarg2, void *jarg3)
SWIGINTERN std::vector< std::vector< int64 > > * std_vector_Sl_std_vector_Sl_int64_Sg__Sg__Repeat(std::vector< int64 > const &value, int count)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_0___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationBaseObject_EnqueueDelayedDemon___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginInitialPropagation___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAtEndWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_size___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCardsArgument_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ApplyLocksToAllVehicles___(void *jarg1, int len2_1, int len2_2[], int64 *jarg2, unsigned int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_5___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5, void *jarg6)
virtual bool MakeOneNeighbor()
Creates a new neighbor.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SymmetryBreakerVector__SWIG_0___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_GREATER_OR_EQUAL_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Bound___(void *jarg1)
SWIGINTERN std::vector< operations_research::SymmetryBreaker * >::value_type const & std_vector_Sl_operations_research_SymmetryBreaker_Sm__Sg__getitem(std::vector< operations_research::SymmetryBreaker * > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ExportProfilingOverview___(void *jarg1, char *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_IsCrossed___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RandomConcatenateOperators__SWIG_1___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMoveTowardTargetOperator__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_SWIGUpcast___(operations_research::DecisionVisitor *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddVariableTargetToFinalizer___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchFilterVector__SWIG_2___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetDurationMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_Next___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeEnterSearchCallback___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kStartsArgument_get___()
void clear_fail_intercept()
void(SWIGSTDCALL * SWIG_Callback18_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_EndFiltering___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIG_CSharpExceptionCodes
EvaluatorStrategy
This enum is used by Solver::MakePhase to specify how to select variables and values during the searc...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCircuit_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IndexOf__SWIG_0___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetStartMin___(void *jarg1, void *jarg2, long long jarg3)
static const char kGlobalCardinality[]
static const char kMaxArgument[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddVectorDimension___(void *jarg1, int length2, int64 *jarg2, long long jarg3, unsigned int jarg4, char *jarg5)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDisjunctionMaxCardinality___(void *jarg1, int jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AT_END_get___()
SWIGINTERN std::vector< operations_research::DecisionBuilder * > * std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__GetRange(std::vector< operations_research::DecisionBuilder * > *self, int index, int count)
virtual void BeginNextDecision(operations_research::DecisionBuilder *const b)
Before calling DecisionBuilder::Next.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_LastIndexOf___(void *jarg1, long long jarg2)
static const char kSumEqual[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STARTS_AT_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_SequenceVarLocalSearchOperator__SWIG_1___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_FastAdd___(void *jarg1, void *jarg2)
static constexpr int kNumPriorities
Number of priorities for demons.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarLocalSearchOperator__SWIG_0___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_StartMax___(void *jarg1, void *jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_IsRanked___(void *jarg1, int jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
static const char kDelayedPathCumul[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Nexts___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeWeightedMinimize__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64VectorVector__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_EndVisitConstraint___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RoutesToAssignment___(void *jarg1, int len2_1, int len2_2[], int64 *jarg2, unsigned int jarg3, unsigned int jarg4, void *jarg5)
SWIGEXPORT operations_research::VarLocalSearchOperator< operations_research::IntVar, int64, operations_research::IntVarLocalSearchHandler > *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperator_SWIGUpcast___(operations_research::IntVarLocalSearchOperator *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetVisitType___(void *jarg1, long long jarg2, int jarg3, int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenPerformedBound__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CROSS_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_LOWEST_MIN_get___()
virtual void Accept(operations_research::DecisionVisitor *const visitor) const
Accepts the given visitor.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_getitemcopy___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_AddVars___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSum__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
virtual void BeginFail()
Just when the failure occurs.
void(SWIGSTDCALL * SWIG_Callback7_t)(void *)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_INTERVAL_SIMPLE_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_PeriodicCheck___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Resize___(void *jarg1, unsigned long jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_MustBePerformed___(void *jarg1)
virtual void EndNextDecision(DecisionBuilder *const b, Decision *const d)
After calling DecisionBuilder::Next, along with the returned decision.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_ApplyWrapper___(void *jarg1, void *jarg2)
virtual bool AcceptSolution()
This method is called when a solution is found.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetEndValue___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetBackwardSequence___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_BeginOperatorStart___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDecisionBuilderFromAssignment___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
virtual int64 GetSynchronizedObjectiveValue() const
Objective value from last time Synchronize() was called.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kOpposite_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndInitialPropagationSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetEndMin___(void *jarg1, long long jarg2)
SWIGINTERN std::vector< operations_research::LocalSearchOperator * > * std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Repeat(operations_research::LocalSearchOperator *const &value, int count)
virtual void Relax(const Assignment *delta, const Assignment *deltadelta)
Lets the filter know what delta and deltadelta will be passed in the next Accept().
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__RemoveRange(std::vector< operations_research::LocalSearchOperator * > *self, int index, int count)
@ EXPR_EXPR_LESS_OR_EQUAL
@ NORMAL_PRIORITY
NORMAL_PRIORITY is the highest priority: Demons will be processed first.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_FilterEvent_filter_set___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SIZE_LOWEST_MIN_get___()
SWIGINTERN std::vector< operations_research::IntVar * >::value_type const & std_vector_Sl_operations_research_IntVar_Sm__Sg__getitem(std::vector< operations_research::IntVar * > *self, int index)
SWIGINTERN std::vector< std::vector< int64 > > * new_std_vector_Sl_std_vector_Sl_int64_Sg__Sg___SWIG_2(int capacity)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Var___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperator_MakeOneNeighbor___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kLexLess_get___()
std::string DebugString() const override
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__InsertRange(std::vector< operations_research::IntVar * > *self, int index, std::vector< operations_research::IntVar * > const &values)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_DurationValue___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_RefuteWrapper___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_RefuteDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetAllowedVehiclesForIndex___(void *jarg1, int length2, int *jarg2, long long jarg3)
std::string DebugString() const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_GetLocalSearchMonitor___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilter_RelaxSwigExplicitLocalSearchFilter___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVector__SWIG_0___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetDurationRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT operations_research::Constraint *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_SWIGUpcast___(operations_research::Pack *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kFinalStatesArgument_get___()
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_NodeToIndex___(void *jarg1, int jarg2)
RegularLimitParameters MakeDefaultRegularLimitParameters() const
Creates a regular limit proto containing default values.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAfter(operations_research::IntervalVar *self, int64 date)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_PICKUP_AND_DELIVERY_NO_ORDER_get___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_EndMax___(void *jarg1)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
bool AtSolution() override
This method is called when a valid solution is found.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDefaultSolutionPool___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetPickupAndDeliveryPolicyOfVehicle___(void *jarg1, int jarg2)
virtual std::string DebugString() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_RemoveAt___(void *jarg1, int jarg2)
@ ROUTING_INVALID
Model, model parameters or flags are not valid.
The class IntExpr is the base of all integer expressions in constraint programming.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_BeginInitialPropagationSwigExplicitSearchMonitor___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAfterEnd(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
static const char kGreater[]
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetCumulVarSoftUpperBoundCoefficient___(void *jarg1, long long jarg2)
@ CHOOSE_MAX_REGRET_ON_MIN
Among unbound variables, select the variable with the largest gap between the first and the second va...
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kElementEqual_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SIMPLE_MARKER_get___()
DecisionModification
The Solver is responsible for creating the search tree.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchOperatorVector___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_AddRange___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_ARRAY_EXPRESSION_MAX_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_ToStringSwigExplicitSearchLimit___(void *jarg1)
char *(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_Value___(void *jarg1, void *jarg2)
Defines operators which change the value of variables; each neighbor corresponds to one modified vari...
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetEndRange___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Decision___()
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ChangeValue_ModifyValue___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Max___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_UnperformedPenalty___(void *jarg1, long long jarg2)
virtual void SetNextBaseToIncrement(int64 base_index)
Set the next base to increment on next iteration.
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
Internal methods.
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_Size___(void *jarg1)
SwigDirector_LocalSearchFilterManager(std::vector< operations_research::LocalSearchFilterManager::FilterEvent > filter_events)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Clear___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback2_t)(void *)
virtual void EndFail()
After completing the backtrack.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SearchDepth___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_CastConstraint___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Int64VectorVector___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_BackwardSequence___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5, void *jarg6, void *jarg7)
Dimensions represent quantities accumulated at nodes along the routes.
virtual void Install()
Registers itself on the solver such that it gets notified of the search and propagation events.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_3___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_BeginDemonRun___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ROUTING_SUCCESS_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kFailuresLimitArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_RemoveValue___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_KILL_BOTH_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_SetValue___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Arity___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback1_t)()
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__AddRange(std::vector< operations_research::IntervalVar * > *self, std::vector< operations_research::IntervalVar * > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_GetPropagationMonitor___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Size___(void *jarg1)
VarArrayConstantExpressionType
SWIGINTERN bool std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__Contains(std::vector< operations_research::SearchMonitor * > *self, operations_research::SearchMonitor *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsMemberCt__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, void *jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_RemoveAllPossibleFromBin___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_GetRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_RestartAtPathStartOnSynchronizeSwigExplicitPathOperator___(void *jarg1)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionPool_SWIGUpcast___(operations_research::SolutionPool *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_BalancingDecision___(void *jarg1)
The base class for all local search operators.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_BeginNextDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsMember__SWIG_0___(void *jarg1, int length2, int64 *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsDifferent__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionVisitor_VisitRankLastInterval___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLessOrEqual__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NO_MORE_SOLUTIONS_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_CONSTANT_SEMI_CONTINUOUS_get___()
static const char kRangeArgument[]
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_size___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetPerformed___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSumOperation_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_4___(void *jarg1, void *jarg2, int length3, int64 *jarg3, int length4, int64 *jarg4)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ASSIGN_MAX_VALUE_get___()
static const char kFixedChargeArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_CONSTANT_CONDITIONAL_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetVisitTypePolicy___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsGreater__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEquality_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_LastIndexOf___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_EndsAfterStartWithDelay(operations_research::IntervalVar *self, operations_research::IntervalVar *other, int64 delay)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetDurationMax___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Solver___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOperator__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5)
SWIGEXPORT operations_research::IntVarLocalSearchFilter *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BasePathFilter_SWIGUpcast___(operations_research::BasePathFilter *jarg1)
virtual void OnNodeInitialization()
Called by OnStart() after initializing node information.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_Slacks___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_GlobalVehicleBreaksConstraint_Post___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SafeDurationExpr___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntervalArgument___(void *jarg1, char *jarg2, void *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_Size___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64Vector__SWIG_2___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Store___(void *jarg1)
long long(SWIGSTDCALL * SWIG_Callback11_t)(int)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMinEquality___(void *jarg1, void *jarg2, void *jarg3)
virtual bool HoldsDelta() const
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Contains___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_GetRange___(void *jarg1, int jarg2, int jarg3)
@ EXPR_EXPR_CONSTANT_EXPRESSION_MAX
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Restore___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCountEqual_get___()
int64 PosIntDivDown(int64 e, int64 v)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_EndConstraintInitialPropagation___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Clone___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetPickupAndDeliveryPolicyOfVehicle___(void *jarg1, int jarg2, int jarg3)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kWeightedSumOfAssignedEqualVariableExtension_get___()
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
std::string DebugString() const override
static const char kLexLess[]
SwigDirector_LocalSearchFilter()
@ VAR_ARRAY_EXPRESSION_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_ForwardSequence___(void *jarg1, void *jarg2)
static ConstraintSolverParameters DefaultSolverParameters()
Create a ConstraintSolverParameters proto with all the default values.
virtual bool RestartAtPathStartOnSynchronize()
When the operator is being synchronized with a new solution (when Start() is called),...
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_MakeCloneSwigExplicitRegularLimit___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback11_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_SUM_get___()
SWIGINTERN std::vector< operations_research::IntVar * > * new_std_vector_Sl_operations_research_IntVar_Sm__Sg___SWIG_2(int capacity)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_Value___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Element__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_MakeSelfDependentDimensionFinalizer___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNoCycle__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, unsigned int jarg5)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_ToString___(void *jarg1)
@ AT_SOLUTION
After successful NextSolution and before EndSearch.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_RefuteDecisionSwigExplicitOptimizeVar___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
static const char kMaxEqual[]
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__AddRange(std::vector< std::vector< int > > *self, std::vector< std::vector< int > > const &values)
unsigned int(SWIGSTDCALL * SWIG_Callback14_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsLessOrEqual__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalRelaxedMin___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__AddRange(std::vector< operations_research::IntVar * > *self, std::vector< operations_research::IntVar * > const &values)
SWIGINTERN std::vector< operations_research::SearchMonitor * > * std_vector_Sl_operations_research_SearchMonitor_Sm__Sg__GetRange(std::vector< operations_research::SearchMonitor * > *self, int index, int count)
virtual void RefuteDecision(operations_research::Decision *const d)
Before refuting the decision.
static const char kProduct[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperator_HasFragments___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_EndProcessingIntegerVariable___(void *jarg1, void *jarg2)
IntValueStrategy
This enum describes the strategy used to select the next variable value to set.
void(SWIGSTDCALL * SWIG_Callback15_t)()
virtual void NoMoreSolutions()
When the search tree is finished.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_RemoveRange___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_SWIGUpcast___(operations_research::ModelVisitor *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSequenceArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_3___(void *jarg1, int proto_size, uint8 *jarg2)
@ INT_VALUE_SIMPLE
The simple selection is ASSIGN_MIN_VALUE.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_IndexOf___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kAllowedAssignments_get___()
virtual std::string DebugString() const
Implements a complete cache for model elements: expressions and constraints.
OptimizationDirection
Optimization directions.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_IS_EQUAL_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Reset___(void *jarg1, void *jarg2)
@ EXPR_CONSTANT_IS_GREATER_OR_EQUAL
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_kMaxValidValue_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
virtual std::string DebugString() const
virtual bool IsIncremental() const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetValue___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN bool std_vector_Sl_int64_Sg__Contains(std::vector< int64 > *self, long const &value)
virtual void ExitSearch()
End of the search.
virtual void AcceptUncheckedNeighbor()
After accepting an unchecked neighbor during local search.
BinaryIntervalRelation
This enum is used in Solver::MakeIntervalVarRelation to specify the temporal relation between the two...
SWIGEXPORT operations_research::LocalSearchOperator *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_SWIGUpcast___(operations_research::VarLocalSearchOperator< operations_research::SequenceVar, std::vector< int >, operations_research::SequenceVarLocalSearchHandler > *jarg1)
std::string LocalSearchProfile() const
Returns local search profiling information in a human readable format.
SWIGEXPORT unsigned long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Size___(void *jarg1)
void(SWIGSTDCALL * SWIG_Callback5_t)(void *, void *)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCover_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseLns_AppendToFragment___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakePhase__SWIG_12___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, int jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Reverse__SWIG_0___(void *jarg1)
static const char kDurationExpr[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitIntegerVariable__SWIG_1___(void *jarg1, void *jarg2, char *jarg3, long long jarg4, void *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ENDS_AT_get___()
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_SWIGUpcast___(operations_research::Decision *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleCostsConsideredVar___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kPositionYArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_SetStartMin___(void *jarg1, long long jarg2)
virtual ~SwigDirector_LocalSearchFilter()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_4___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, long long jarg5, unsigned int jarg6, unsigned int jarg7)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_director_connect___(void *objarg, SwigDirector_Demon::SWIG_Callback0_t callback0, SwigDirector_Demon::SWIG_Callback1_t callback1, SwigDirector_Demon::SWIG_Callback2_t callback2)
static const char kDifference[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_Accept___(void *jarg1, void *jarg2)
SwigDirector_Constraint(operations_research::Solver *const solver)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_IsVehicleUsed___(void *jarg1, void *jarg2, int jarg3)
bool AcceptDelta(Assignment *delta, Assignment *deltadelta) override
Internal methods.
IntVar * MakeIsGreaterCstVar(IntExpr *const var, int64 value)
status var of (var > value)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldEndMin___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AreAllBoundTo___(void *jarg1, long long jarg2)
virtual void EndFail()
After completing the backtrack.
SWIGEXPORT operations_research::VarLocalSearchOperator< operations_research::SequenceVar, std::vector< int >, operations_research::SequenceVarLocalSearchHandler > *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperator_SWIGUpcast___(operations_research::SequenceVarLocalSearchOperator *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEarlyCostArgument_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitSequenceVariable___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ToInt64Vector___(int length1, int *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_3___(void *jarg1, void *jarg2, int length3, int *jarg3, void *jarg4, char *jarg5)
virtual void BeginNextDecision(operations_research::DecisionBuilder *const db)
Before calling DecisionBuilder::Next.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_Add__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Var___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTemporalDisjunction__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetMin___(void *jarg1, void *jarg2, long long jarg3)
virtual bool HasFragments() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeGreaterOrEqual__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
virtual bool MakeNextNeighbor(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__AddRange(std::vector< std::vector< int64 > > *self, std::vector< std::vector< int64 > > const &values)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kScalProdGreaterOrEqual_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_PropagationMonitor___(void *jarg1)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_capacity___(void *jarg1)
virtual bool SkipUnchanged(int index) const
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_EndOperatorStart___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_AddRange___(void *jarg1, void *jarg2)
virtual void VisitScheduleOrPostpone(IntervalVar *const var, int64 est)
SWIGINTERN operations_research::OptimizeVar * operations_research_IntExpr_Minimize(operations_research::IntExpr *self, int64 step)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Restore___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kCountUsedBinsExtension_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_SlackVar___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_LocalSearchOperatorVector__SWIG_1___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddDisjunction__SWIG_0___(void *jarg1, int length2, int64 *jarg2, long long jarg3, long long jarg4)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Insert(std::vector< operations_research::LocalSearchOperator * > *self, int index, operations_research::LocalSearchOperator *const &x)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SEQUENCE_DEFAULT_get___()
virtual bool OnSamePathAsPreviousBase(int64 base_index)
Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_Value___(void *jarg1)
@ CHOOSE_FIRST_UNBOUND
Select the first unbound variable.
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumLessOrEqualConstantDimension__SWIG_2___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMin__SWIG_1___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVectorVector__SWIG_2___(int jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsDifferent__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
virtual void EndFail()
After completing the backtrack.
@ SWAPACTIVE
Operator which replaces an active node by an inactive one.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SolutionCollector_WallTime___(void *jarg1, int jarg2)
void Init() override
This method is called when the search limit is initialized.
unsigned int(SWIGSTDCALL * SWIG_Callback16_t)()
virtual void Refute(operations_research::Solver *const s)
Refute will be called after a backtrack.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_WriteAssignment___(void *jarg1, char *jarg2)
SWIGINTERN int std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__IndexOf(std::vector< operations_research::LocalSearchOperator * > *self, operations_research::LocalSearchOperator *const &value)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_CONSTANT_EXPRESSION_MAX_get___()
virtual Solver::DemonPriority priority() const
This method returns the priority of the demon.
SwigDirector_IntVarLocalSearchFilter(std::vector< operations_research::IntVar * > const &vars)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kObjectiveExtension_get___()
static const char kMinEqual[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_setitem___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_InstrumentsDemons___(void *jarg1)
SWIGEXPORT operations_research::IntVarLocalSearchFilter *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_CPFeasibilityFilter_SWIGUpcast___(operations_research::CPFeasibilityFilter *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_AreAllElementsBound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVector_Repeat___(int jarg1, int jarg2)
virtual bool NextFragment()=0
std::string DebugString() const override
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackRelax, SWIG_Callback2_t callbackCommit, SWIG_Callback3_t callbackAccept, SWIG_Callback4_t callbackIsIncremental, SWIG_Callback5_t callbackSynchronize, SWIG_Callback6_t callbackRevert, SWIG_Callback7_t callbackReset, SWIG_Callback8_t callbackGetSynchronizedObjectiveValue, SWIG_Callback9_t callbackGetAcceptedObjectiveValue)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Demon_RunWrapper___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_ExitSearchSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_LocalSearchFilterVector___(void *jarg1)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsMember_get___()
static SWIG_CSharpExceptionArgument_t SWIG_csharp_exceptions_argument[]
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_GetTransitValue___(void *jarg1, long long jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeFalseConstraint__SWIG_0___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RegularLimit___(void *jarg1)
virtual void OnSynchronize(operations_research::Assignment const *delta)
virtual void ExitSearch()
End of the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_reserve___(void *jarg1, unsigned long jarg2)
virtual void Accept(ModelVisitor *const visitor) const
Accepts the given model visitor.
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_SWIGUpcast___(operations_research::IntVarIterator *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntervalContainer_Copy___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_ToStringSwigExplicitLocalSearchFilterManager___(void *jarg1)
void SetAssignmentFromAssignment(Assignment *target_assignment, const std::vector< IntVar * > &target_vars, const Assignment *source_assignment, const std::vector< IntVar * > &source_vars)
NOLINT.
SWIGINTERN int std_vector_Sl_operations_research_DecisionBuilder_Sm__Sg__IndexOf(std::vector< operations_research::DecisionBuilder * > *self, operations_research::DecisionBuilder *const &value)
@ VAR_CONSTANT_ARRAY_EXPRESSION_MAX
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5, void *jarg6, void *jarg7, void *jarg8, void *jarg9)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperatorTemplate_IsIncremental___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenEndBound__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_TYPE_ON_VEHICLE_UP_TO_VISIT_get___()
@ INTERVAL_SET_TIMES_FORWARD
Selects the variable with the lowest starting time of all variables, and fixes its starting time to t...
char *(SWIGSTDCALL * SWIG_Callback0_t)()
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGINTERN std::vector< std::vector< int > > * new_std_vector_Sl_std_vector_Sl_int_Sg__Sg___SWIG_2(int capacity)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_Accept___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AddWeightedSumLessOrEqualConstantDimension__SWIG_0___(void *jarg1, int length2, int64 *jarg2, int length3, int64 *jarg3)
const char * what() const
int64 MaxVarArray(const std::vector< IntVar * > &vars)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLess__SWIG_2___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_RoutingModel___(void *jarg1)
static const char kNextsArgument[]
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solutions___(void *jarg1)
@ EXPR_EXPR_GREATER_OR_EQUAL
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeRandomLnsOperator__SWIG_1___(void *jarg1, void *jarg2, int jarg3, int jarg4)
@ LK
Lin-Kernighan local search.
virtual ~SwigDirector_LocalSearchFilterManager()
void EnterSearch() override
Beginning of the search.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_CHOOSE_MAX_AVERAGE_IMPACT_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarElement_Bound___(void *jarg1)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsEqual__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
unsigned int(SWIGSTDCALL * SWIG_Callback4_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVarLocalSearchOperator__SWIG_1___(void *jarg1, unsigned int jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_FindErrorInRoutingSearchParameters___(int search_parameters_size, uint8 *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback7_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_BeginAcceptNeighbor___(void *jarg1, void *jarg2)
static const char kMirrorOperation[]
Operations.
static SWIG_CSharpException_t SWIG_csharp_exceptions[]
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kVariableGroupExtension_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SafeStartExpr___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentIntContainer_CopyIntersection___(void *jarg1, void *jarg2)
SWIGEXPORT operations_research::BaseObject *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_SWIGUpcast___(operations_research::SearchMonitor *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_ConsiderAlternatives___(void *jarg1, long long jarg2)
static const char kLateCostArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IN_ROOT_NODE_get___()
static const char kIntervalUnaryRelation[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLessOrEqual__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
IntExpr * MakeElement(const std::vector< int64 > &values, IntVar *const index)
values[index]
virtual void Apply(operations_research::Solver *const s)
Apply will be called first when the decision is executed.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_TransitVar___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RankLast___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_capacity___(void *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasDimension___(void *jarg1, char *jarg2)
static const char kStartMinArgument[]
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackApplyWrapper, SWIG_Callback2_t callbackRefuteWrapper, SWIG_Callback3_t callbackAccept)
@ INT_VALUE_DEFAULT
The default behavior is ASSIGN_MIN_VALUE.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_BeginNextDecisionSwigExplicitSearchLimit___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_ROUTING_INVALID_get___()
static const char kStartSyncOnStartOperation[]
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__Reverse__SWIG_0(std::vector< std::vector< int64 > > *self)
virtual bool IsIncremental() const
SWIG_CSharpExceptionArgumentCallback_t callback
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_InitSwigExplicitRegularLimit___(void *jarg1)
bool SkipUnchanged(int index) const override
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleVars___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_AcceptSwigExplicitRegularLimit___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchFilter_OnSynchronizeSwigExplicitIntVarLocalSearchFilter___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_NumIntVars___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_AssignmentIntervalContainer___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Compose__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_SetFixedCostOfVehicle___(void *jarg1, long long jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetPerformedRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
UnaryIntervalRelation
This enum is used in Solver::MakeIntervalVarRelation to specify the temporal relation between an inte...
virtual bool AtSolution()
This method is called when a valid solution is found.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_EndValue___(void *jarg1)
~LocalSearchPhaseParameters()
OptimizeVar * MakeMaximize(IntVar *const v, int64 step)
Creates a maximization objective.
RoutingDimensionIndex DimensionIndex
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_CONSTRAINT_MAX_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMaxArgument_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntervalVarVector__SWIG_2___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Copy___(void *jarg1, void *jarg2)
@ CHOOSE_MIN_SIZE_HIGHEST_MIN
Among unbound variables, select the variable with the smallest size, i.e., the smallest number of pos...
DemonPriority
This enum represents the three possible priorities for a demon in the Solver queue.
void RefuteDecision(Decision *const d) override
Before refuting the decision.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kNonEqual_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Decision_ToStringSwigExplicitDecision___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_OptimizeVar___(void *jarg1, unsigned int jarg2, void *jarg3, long long jarg4)
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)(void *, void *, long long, long long)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTimeLimit__SWIG_0___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__AddRange(std::vector< operations_research::LocalSearchFilter * > *self, std::vector< operations_research::LocalSearchFilter * > const &values)
void Accept(ModelVisitor *const visitor) const override
Accepts the given model visitor.
virtual void RestartSearch()
Restart the search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsBetweenCt___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, void *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNumOfSingletonNodes___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64Vector_Repeat___(long long jarg1, int jarg2)
@ INCREMENT
Operator which defines one neighbor per variable.
void(SWIGSTDCALL * SWIG_Callback24_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_SELECT_MAX_IMPACT_get___()
SWIGEXPORT operations_research::IntExpr *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVar_SWIGUpcast___(operations_research::IntVar *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Solutions___(void *jarg1)
virtual void VisitUnknownDecision()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ImprovementSearchLimit_MakeClone___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DecisionBuilder___()
SWIGINTERN std::vector< long >::value_type const & std_vector_Sl_int64_Sg__getitem(std::vector< int64 > *self, int index)
virtual void EndInitialPropagation()
After the initial propagation.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_AssignmentIntervalContainer___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndFailSwigExplicitSearchMonitor___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_DecisionVisitor___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_TWOOPT_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetDisjunctionIndices__SWIG_1___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNBestValueSolutionCollector__SWIG_1___(void *jarg1, int jarg2, unsigned int jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_UseFastLocalSearch___(void *jarg1)
static const char kMaximizeArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNonZeroCostClassesCount___(void *jarg1)
SWIGEXPORT operations_research::Constraint *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DisjunctiveConstraint_SWIGUpcast___(operations_research::DisjunctiveConstraint *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetArcCostForFirstSolution___(void *jarg1, long long jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOperator__SWIG_0___(void *jarg1, void *jarg2, int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTrace_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_type_index_of_vehicle_get___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_TypeRequirementChecker___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenStartRange__SWIG_0___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__RemoveAt(std::vector< operations_research::LocalSearchOperator * > *self, int index)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kTransition_get___()
void swig_connect_director(SWIG_Callback0_t callbackToString, SWIG_Callback1_t callbackMakeNextNeighbor, SWIG_Callback2_t callbackStart, SWIG_Callback3_t callbackReset, SWIG_Callback4_t callbackHasFragments, SWIG_Callback5_t callbackHoldsDelta)
@ OROPT
Relocate: OROPT and RELOCATE.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_HasHardTypeIncompatibilities___(void *jarg1)
virtual IntVar * IsEqual(int64 constant)=0
IsEqual.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_AcceptSwigExplicitOptimizeVar___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingNonStrictBoxesConstraint__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, int length4, int64 *jarg4, int length5, int64 *jarg5)
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_size___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_PropagationBaseObject___(void *jarg1)
virtual bool HasFragments() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_EXPR_EXPRESSION_MAX_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAtEnd___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_WhenRange___(void *jarg1, void *jarg2)
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kScalProd_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_Accept___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, long long jarg5, long long jarg6)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLocalSearchPhaseParameters__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_PerformedMax___(void *jarg1, void *jarg2)
virtual void NoMoreSolutions()
When the search tree is finished.
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_ToString___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RevPartialSequence_NumFirstRanked___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_PATH_get___()
SWIGINTERN std::vector< std::vector< int64 > > * std_vector_Sl_std_vector_Sl_int64_Sg__Sg__GetRange(std::vector< std::vector< int64 > > *self, int index, int count)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Clear___(void *jarg1)
@ EXPR_CONSTANT_IS_LESS_OR_EQUAL
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDisjunctive_get___()
std::string DebugString() const override
SWIGEXPORT unsigned long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_capacity___(void *jarg1)
static const char kEvaluatorArgument[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSymmetryManager__SWIG_4___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
void(SWIGSTDCALL * SWIG_Callback1_t)()
void(SWIGSTDCALL * SWIG_Callback24_t)()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_CONSTANT_CONSTANT_BETWEEN_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIndexExpression___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_IntVectorVector__SWIG_1___(void *jarg1)
SWIGINTERN int std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__LastIndexOf(std::vector< operations_research::LocalSearchFilter * > *self, operations_research::LocalSearchFilter *const &value)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_AfterDecision___(void *jarg1, void *jarg2, unsigned int jarg3)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsEqual_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMemberCt__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_TYPE_ADDED_TO_VEHICLE_get___()
@ CHOOSE_DYNAMIC_GLOBAL_BEST
Pairs are compared each time a variable is selected.
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetHomogeneousCost___(void *jarg1, long long jarg2, long long jarg3)
virtual void ExitSearch()
End of the search.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLog_ApplyDecision___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_GlobalVehicleBreaksConstraint___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingDimension_CumulVar___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_OptimizeVar_ApplyBound___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Unperformed___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Start___(void *jarg1, int jarg2)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddConstantDimensionWithSlack___(void *jarg1, long long jarg2, long long jarg3, long long jarg4, unsigned int jarg5, char *jarg6)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_ProgressPercentSwigExplicitRegularLimit___(void *jarg1)
SWIGINTERN operations_research::LocalSearchFilter * std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__getitemcopy(std::vector< operations_research::LocalSearchFilter * > *self, int index)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Branches___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DecisionBuilderVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_RankLast___(void *jarg1, int jarg2)
virtual IntVar * Var()=0
Creates a variable from the expression.
static const char kLightElement2[]
virtual int64 GetAcceptedObjectiveValue() const
Objective value from the last time Accept() was called and returned true.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_IsLessOrEqual__SWIG_0___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeConvexPiecewiseExpr___(void *jarg1, void *jarg2, long long jarg3, long long jarg4, long long jarg5, long long jarg6)
static const char kGreaterOrEqual[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeTimeLimit__SWIG_1___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetStartRange___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
@ ROUTING_FAIL_TIMEOUT
Time limit reached before finding a solution with RoutingModel::Solve().
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_OldEndMax___(void *jarg1)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsBefore(operations_research::IntervalVar *self, int64 date)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_GetNumberOfVehicles___(void *jarg1)
EvaluatorLocalSearchOperators
This enum is used in Solver::MakeOperator associated with an evaluator to specify the neighborhood to...
@ ASSIGN_MAX_VALUE
Selects the max value of the selected variable.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_EXPR_OPPOSITE_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntervalVar_Sm__Sg__Reverse__SWIG_0(std::vector< operations_research::IntervalVar * > *self)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_SetDurationMax___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_DECREMENT_get___()
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Remove___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSymmetryManager__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_getitem___(void *jarg1, int jarg2)
SWIGEXPORT operations_research::IntVar *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_SWIGUpcast___(operations_research::BooleanVar *jarg1)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__RemoveRange(std::vector< std::vector< int > > *self, int index, int count)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Constraints___(void *jarg1)
virtual bool IsIncremental() const
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAtStart(operations_research::IntervalVar *self, operations_research::IntervalVar *other)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_kNoDisjunction_get___()
unsigned int(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarLocalSearchOperatorTemplate___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback5_t)()
@ VAR_CONSTANT_ARRAY_ELEMENT
@ CHOOSE_RANDOM
Randomly select one of the remaining unbound variables.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeProd__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_IsLocalSearchProfilingEnabled___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCount__SWIG_0___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
Base class of all search limits.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_2___(void *jarg1, void *jarg2, int length3, int64 *jarg3, void *jarg4, char *jarg5)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_DefaultPhaseParameters_var_selection_schema_get___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsGreaterCstVar___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreaker_director_connect___(void *objarg, SwigDirector_SymmetryBreaker::SWIG_Callback0_t callback0, SwigDirector_SymmetryBreaker::SWIG_Callback1_t callback1, SwigDirector_SymmetryBreaker::SWIG_Callback2_t callback2, SwigDirector_SymmetryBreaker::SWIG_Callback3_t callback3, SwigDirector_SymmetryBreaker::SWIG_Callback4_t callback4, SwigDirector_SymmetryBreaker::SWIG_Callback5_t callback5, SwigDirector_SymmetryBreaker::SWIG_Callback6_t callback6, SwigDirector_SymmetryBreaker::SWIG_Callback7_t callback7)
SWIGINTERN operations_research::IntervalVar * operations_research_IntervalVar_RelaxedMax(operations_research::IntervalVar *self)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_Resize___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarVector_InsertRange___(void *jarg1, int jarg2, void *jarg3)
static const char kTrace[]
static const int64 kNoPenalty
Constant used to express a hard constraint instead of a soft penalty.
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLess__SWIG_1___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
IntVar * Var() override
Creates a variable from the expression.
static const char kIsDifferent[]
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AreEmptyRouteCostsConsideredForVehicle___(void *jarg1, int jarg2)
virtual int ProgressPercent()
Returns a percentage representing the propress of the search before reaching limits.
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGINTERN std::vector< operations_research::LocalSearchFilter * > * std_vector_Sl_operations_research_LocalSearchFilter_Sm__Sg__Repeat(operations_research::LocalSearchFilter *const &value, int count)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kEndsArgument_get___()
@ KEEP_RIGHT
Left branches are ignored.
void(SWIGSTDCALL * SWIG_Callback15_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMaximize___(void *jarg1, void *jarg2, long long jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllSolutionCollector__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_MutableSequenceVarContainer___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_RankNotFirst___(void *jarg1, void *jarg2, int jarg3)
virtual bool IsUncheckedSolutionLimitReached()
Returns true if the limit of solutions has been reached including unchecked solutions.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BooleanVar_IsGreaterOrEqual___(void *jarg1, long long jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_GlobalVehicleBreaksConstraint_ToString___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdGreaterOrEqual__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3, long long jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Solve__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
This struct holds all parameters for the default search.
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Try__SWIG_0___(void *jarg1, void *jarg2, void *jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_InsertVoidConstraint___(void *jarg1, void *jarg2, int jarg3)
void(SWIGSTDCALL * SWIG_Callback19_t)()
void(SWIGSTDCALL * SWIG_Callback3_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetMutableDimension___(void *jarg1, char *jarg2)
static const char kRelaxedMaxOperation[]
static const char kStepArgument[]
SWIGINTERN void std_vector_Sl_operations_research_LocalSearchOperator_Sm__Sg__Reverse__SWIG_1(std::vector< operations_research::LocalSearchOperator * > *self, int index, int count)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVarRelation__SWIG_0___(void *jarg1, void *jarg2, int jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_SetRange___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDistribute__SWIG_7___(void *jarg1, void *jarg2, int length3, int *jarg3, int length4, int *jarg4, int length5, int *jarg5)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kIsLessOrEqual_get___()
LocalSearchOperators
This enum is used in Solver::MakeOperator to specify the neighborhood to create.
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_VehicleTypeContainer_Type___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNestedOptimize__SWIG_3___(void *jarg1, void *jarg2, void *jarg3, unsigned int jarg4, long long jarg5, void *jarg6, void *jarg7, void *jarg8)
virtual bool InitPosition() const
Returns true if the operator needs to restart its initial position at each call to Start()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_Solve__SWIG_0___(void *jarg1, void *jarg2)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kSizeArgument_get___()
virtual void BeginInitialPropagation()
Before the initial propagation.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_2___(void *jarg1, void *jarg2, void *jarg3)
virtual bool HoldsDelta() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CROSS_DATE_get___()
@ EXCHANGE
Operator which exchanges the positions of two nodes.
virtual void EndInitialPropagation()
After the initial propagation.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_IsUncheckedSolutionLimitReachedSwigExplicitRegularLimit___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Repeat___(void *jarg1, int jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSortingConstraint___(void *jarg1, void *jarg2, void *jarg3)
void(SWIGSTDCALL * SWIG_Callback4_t)(void *)
SWIGINTERN std::vector< int64 > std_vector_Sl_std_vector_Sl_int64_Sg__Sg__getitemcopy(std::vector< std::vector< int64 > > *self, int index)
SWIGINTERN void std_vector_Sl_int_Sg__AddRange(std::vector< int > *self, std::vector< int > const &values)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RegularLimit_Copy___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::Constraint * operations_research_IntExpr_Member__SWIG_1(operations_research::IntExpr *self, std::vector< int > const &values)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchLimit_Check___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNotBetweenCt___(void *jarg1, void *jarg2, long long jarg3, long long jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_WhenPerformedBound__SWIG_0___(void *jarg1, void *jarg2)
static const char kPositionYArgument[]
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNumberOfDisjunctions___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_STAYS_IN_SYNC_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntervalVar___(void *jarg1)
@ VAR_ARRAY_CONSTANT_ARRAY_SCAL_PROD
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarArrayExpression___(void *jarg1, void *jarg2, int jarg3)
virtual void NoMoreSolutions()
When the search tree is finished.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NewSearchAux__SWIG_5___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5, void *jarg6)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_AddLocalSearchOperator___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::IntVar * operations_research_IntExpr_IsLess__SWIG_1(operations_research::IntExpr *self, operations_research::IntExpr *const other)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PropagationMonitor_BeginConstraintInitialPropagation___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Accept___(void *jarg1, void *jarg2)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__RemoveAt(std::vector< std::vector< int64 > > *self, int index)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_AssignmentElement___(void *jarg1)
static const char kMember[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntervalVarArray___(void *jarg1, int jarg2, long long jarg3, long long jarg4, long long jarg5, long long jarg6, long long jarg7, long long jarg8, unsigned int jarg9, char *jarg10, void *jarg11)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_5___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_ImprovementSearchLimit___(void *jarg1)
virtual void BeginInitialPropagation()
Before the initial propagation.
@ VAR_CONSTANT_LESS_OR_EQUAL
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCumulative__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4, char *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_RevPartialSequence__SWIG_0___(int length1, int *jarg1)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarIterator_Ok___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeOperator__SWIG_2___(void *jarg1, void *jarg2, void *jarg3, int jarg4)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_Insert___(void *jarg1, int jarg2, void *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_getitemcopy___(void *jarg1, int jarg2)
void(SWIGSTDCALL * SWIG_Callback8_t)(void *, unsigned int)
static const char kVarBoundWatcher[]
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_EndSearchAux___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVar_Accept___(void *jarg1, void *jarg2)
SwigDirector_SequenceVarLocalSearchOperator()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_IntVarLocalSearchFilter___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeAllDifferentExcept___(void *jarg1, void *jarg2, long long jarg3)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int64_Sg__Sg__SetRange(std::vector< std::vector< int64 > > *self, int index, std::vector< std::vector< int64 > > const &values)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarLocalSearchOperatorTemplate_Var___(void *jarg1, long long jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntExpr_Range___(void *jarg1, long *jarg2, long *jarg3)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVarVector_Remove___(void *jarg1, void *jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterVector_AddRange___(void *jarg1, void *jarg2)
unsigned int(SWIGSTDCALL * SWIG_Callback6_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarLocalSearchOperator_Sequence___(void *jarg1, long long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_BaseIntExpr_Var___(void *jarg1)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetVehicleClassesCount___(void *jarg1)
int TopProgressPercent()
Returns a percentage representing the propress of the search before reaching the limits of the top-le...
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_SWITCH_BRANCHES_get___()
@ SWIG_CSharpNullReferenceException
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchMonitor_BeginMakeNextNeighbor___(void *jarg1, void *jarg2)
virtual std::string DebugString() const
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIsLessOrEqualCstVar___(void *jarg1, void *jarg2, long long jarg3)
@ VAR_ARRAY_CONSTANT_INDEX
char *(SWIGSTDCALL * SWIG_Callback0_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_VisitSequenceArrayArgument___(void *jarg1, char *jarg2, void *jarg3)
@ RELOCATE
Relocate neighborhood with length of 1 (see OROPT comment).
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_RegisterDemon___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MAXIMIZATION_get___()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kDivide_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingIndexManager_IndexToNode___(void *jarg1, long long jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_VAR_ARRAY_SUM_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindVarArrayConstantExpression___(void *jarg1, void *jarg2, long long jarg3, int jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProdGreaterOrEqual__SWIG_1___(void *jarg1, void *jarg2, int length3, int *jarg3, long long jarg4)
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitorVector_Contains___(void *jarg1, void *jarg2)
virtual void Start(operations_research::Assignment const *assignment)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Try__SWIG_1___(void *jarg1, void *jarg2, void *jarg3, void *jarg4)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_FilterEvent_filter_get___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Assignment_SetEndValue___(void *jarg1, void *jarg2, long long jarg3)
virtual void PeriodicCheck()
Periodic call to check limits in long running methods.
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SearchMonitor_EndFail___(void *jarg1)
long long(SWIGSTDCALL * SWIG_Callback8_t)()
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kMin_get___()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_SearchLimit___(void *jarg1)
void *(SWIGSTDCALL * SWIG_Callback28_t)()
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntVectorVector_reserve___(void *jarg1, unsigned long jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeMoveTowardTargetOperator__SWIG_1___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
virtual void ApplyDecision(operations_research::Decision *const d)
Before applying the decision.
SWIGEXPORT unsigned int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_NextSolution___(void *jarg1)
SWIGINTERN bool std_vector_Sl_int_Sg__Contains(std::vector< int > *self, int const &value)
SWIGINTERN void std_vector_Sl_std_vector_Sl_int_Sg__Sg__Insert(std::vector< std::vector< int > > *self, int index, std::vector< int > const &x)
unsigned int(SWIGSTDCALL * SWIG_Callback17_t)(void *, void *)
SWIGEXPORT char *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelVisitor_kInt64ToBoolExtension_get___()
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchFilterManager_kAccept_get___()
SWIGINTERN void std_vector_Sl_operations_research_IntVar_Sm__Sg__setitem(std::vector< operations_research::IntVar * > *self, int index, operations_research::IntVar *const &val)
void(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_Int64VectorVector__SWIG_2___(int jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_DisjunctiveConstraint___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Int64VectorVector_Reverse__SWIG_1___(void *jarg1, int jarg2, int jarg3)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarElement_Restore___(void *jarg1)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVarElement_DurationMax___(void *jarg1)
unsigned int(SWIGSTDCALL * SWIG_Callback20_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentSequenceContainer_AddAtPosition___(void *jarg1, void *jarg2, int jarg3)
virtual ~SwigDirector_IntVarLocalSearchFilter()
virtual bool AcceptDelta(operations_research::Assignment *delta, operations_research::Assignment *deltadelta)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SymmetryBreakerVector_getitem___(void *jarg1, int jarg2)
void(SWIGSTDCALL * SWIG_Callback2_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeNonOverlappingBoxesConstraint__SWIG_0___(void *jarg1, void *jarg2, void *jarg3, void *jarg4, void *jarg5)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeScalProd__SWIG_0___(void *jarg1, void *jarg2, int length3, int64 *jarg3)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeLimit__SWIG_7___(void *jarg1, void *jarg2, void *jarg3)
@ EXPR_EXPR_CONSTANT_CONDITIONAL
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_ClearFailIntercept___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_RelaxedMax___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_LocalSearchOperatorVector_Reverse__SWIG_0___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_EndsAfter___(void *jarg1, long long jarg2)
SWIGINTERN std::vector< int >::value_type const & std_vector_Sl_int_Sg__getitem(std::vector< int > *self, int index)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_RestoreAssignment___(void *jarg1, void *jarg2)
SWIGINTERN operations_research::Constraint * operations_research_IntervalVar_StartsAfter(operations_research::IntervalVar *self, int64 date)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_delete_Constraint___(void *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSearchLog__SWIG_4___(void *jarg1, int jarg2, void *jarg3)
bool HoldsDelta() const override
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Pack_AssignAllPossibleToBin___(void *jarg1, int jarg2)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_SequenceVarVector_Add___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_new_DecisionVisitor___()
virtual void OnSynchronize(const Assignment *delta)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_AssignmentElement_Activate___(void *jarg1)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntervalVar_SetEndRange___(void *jarg1, long long jarg2, long long jarg3)
static const char kCoefficientsArgument[]
static const char kLessOrEqual[]
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeSymmetryManager__SWIG_1___(void *jarg1, void *jarg2)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeDifference__SWIG_1___(void *jarg1, long long jarg2, void *jarg3)
void Start(const Assignment *assignment) override
This method should not be overridden.
virtual bool HasFragments() const
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_IntTupleSet_Insert__SWIG_0___(void *jarg1, int length2, int *jarg2)
SWIGEXPORT long long SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_RoutingModel_GetNumberOfDecisionsInFirstSolution___(void *jarg1, int search_parameters_size, uint8 *jarg2)
SWIGINTERN operations_research::IntExpr * operations_research_IntExpr_IndexOf__SWIG_1(operations_research::IntExpr *self, std::vector< operations_research::IntVar * > const &vars)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeCount__SWIG_1___(void *jarg1, void *jarg2, long long jarg3, void *jarg4)
static const char kTransitsArgument[]
void(SWIGSTDCALL * SWIG_Callback21_t)()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_Try__SWIG_3___(void *jarg1, void *jarg2)
SWIGEXPORT int SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_CHOOSE_MIN_SIZE_HIGHEST_MIN_get___()
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ModelCache_FindExprExprConstantExpression___(void *jarg1, void *jarg2, void *jarg3, long long jarg4, int jarg5)
SWIGEXPORT void SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_PathOperator_OnNodeInitialization___(void *jarg1)
SWIGEXPORT operations_research::IntVarLocalSearchOperator *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_ChangeValue_SWIGUpcast___(operations_research::ChangeValue *jarg1)
SWIGEXPORT void *SWIGSTDCALL CSharp_GooglefOrToolsfConstraintSolver_Solver_MakeIntVar__SWIG_0___(void *jarg1, long long jarg2, long long jarg3, char *jarg4)
A Decision represents a choice point in the search tree.