zimpl-3.3.6/LICENSE0000644001417200060250000001674313301553023013570 0ustar bzfschlooptimi GNU LESSER GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. This version of the GNU Lesser General Public License incorporates the terms and conditions of version 3 of the GNU General Public License, supplemented by the additional permissions listed below. 0. Additional Definitions. As used herein, "this License" refers to version 3 of the GNU Lesser General Public License, and the "GNU GPL" refers to version 3 of the GNU General Public License. "The Library" refers to a covered work governed by this License, other than an Application or a Combined Work as defined below. An "Application" is any work that makes use of an interface provided by the Library, but which is not otherwise based on the Library. Defining a subclass of a class defined by the Library is deemed a mode of using an interface provided by the Library. A "Combined Work" is a work produced by combining or linking an Application with the Library. The particular version of the Library with which the Combined Work was made is also called the "Linked Version". The "Minimal Corresponding Source" for a Combined Work means the Corresponding Source for the Combined Work, excluding any source code for portions of the Combined Work that, considered in isolation, are based on the Application, and not on the Linked Version. The "Corresponding Application Code" for a Combined Work means the object code and/or source code for the Application, including any data and utility programs needed for reproducing the Combined Work from the Application, but excluding the System Libraries of the Combined Work. 1. Exception to Section 3 of the GNU GPL. You may convey a covered work under sections 3 and 4 of this License without being bound by section 3 of the GNU GPL. 2. Conveying Modified Versions. If you modify a copy of the Library, and, in your modifications, a facility refers to a function or data to be supplied by an Application that uses the facility (other than as an argument passed when the facility is invoked), then you may convey a copy of the modified version: a) under this License, provided that you make a good faith effort to ensure that, in the event an Application does not supply the function or data, the facility still operates, and performs whatever part of its purpose remains meaningful, or b) under the GNU GPL, with none of the additional permissions of this License applicable to that copy. 3. Object Code Incorporating Material from Library Header Files. The object code form of an Application may incorporate material from a header file that is part of the Library. You may convey such object code under terms of your choice, provided that, if the incorporated material is not limited to numerical parameters, data structure layouts and accessors, or small macros, inline functions and templates (ten or fewer lines in length), you do both of the following: a) Give prominent notice with each copy of the object code that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the object code with a copy of the GNU GPL and this license document. 4. Combined Works. You may convey a Combined Work under terms of your choice that, taken together, effectively do not restrict modification of the portions of the Library contained in the Combined Work and reverse engineering for debugging such modifications, if you also do each of the following: a) Give prominent notice with each copy of the Combined Work that the Library is used in it and that the Library and its use are covered by this License. b) Accompany the Combined Work with a copy of the GNU GPL and this license document. c) For a Combined Work that displays copyright notices during execution, include the copyright notice for the Library among these notices, as well as a reference directing the user to the copies of the GNU GPL and this license document. d) Do one of the following: 0) Convey the Minimal Corresponding Source under the terms of this License, and the Corresponding Application Code in a form suitable for, and under terms that permit, the user to recombine or relink the Application with a modified version of the Linked Version to produce a modified Combined Work, in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source. 1) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (a) uses at run time a copy of the Library already present on the user's computer system, and (b) will operate properly with a modified version of the Library that is interface-compatible with the Linked Version. e) Provide Installation Information, but only if you would otherwise be required to provide such information under section 6 of the GNU GPL, and only to the extent that such information is necessary to install and execute a modified version of the Combined Work produced by recombining or relinking the Application with a modified version of the Linked Version. (If you use option 4d0, the Installation Information must accompany the Minimal Corresponding Source and Corresponding Application Code. If you use option 4d1, you must provide the Installation Information in the manner specified by section 6 of the GNU GPL for conveying Corresponding Source.) 5. Combined Libraries. You may place library facilities that are a work based on the Library side by side in a single library together with other library facilities that are not Applications and are not covered by this License, and convey such a combined library under terms of your choice, if you do both of the following: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities, conveyed under the terms of this License. b) Give prominent notice with the combined library that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 6. Revised Versions of the GNU Lesser General Public License. The Free Software Foundation may publish revised and/or new versions of the GNU Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library as you received it specifies that a certain numbered version of the GNU Lesser General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that published version or of any later version published by the Free Software Foundation. If the Library as you received it does not specify a version number of the GNU Lesser General Public License, you may choose any version of the GNU Lesser General Public License ever published by the Free Software Foundation. If the Library as you received it specifies that a proxy can decide whether future versions of the GNU Lesser General Public License shall apply, that proxy's public statement of acceptance of any version is permanent authorization for you to choose that version for the Library. zimpl-3.3.6/README0000644001417200060250000001071213301553023013431 0ustar bzfschlooptimiINTRODUCTION ------------ ZIMPL is a little language to translate the mathematical model of a problem into a linear or (mixed-)integer mathematical program expressed in .lp or .mps file format which can be read by a LP or MIP solver. If you use Zimpl for research and publish results, the best way to refer to Zimpl is to cite my Ph.d. thesis: @PHDTHESIS{Koch2004, author = "Thorsten Koch", title = "Rapid Mathematical Programming", year = "2004", school = "Technische {Universit\"at} Berlin", url = "http://www.zib.de/Publications/abstracts/ZR-04-58/", note = "ZIB-Report 04-58", } COMPILING --------- To compile Zimpl you need two additional librarys: - GNU Multiple Precision Arithmetic Library Version 4.2.2 or newer at http://www.swox.com/gmp - zlib Version 1.2.5 or newer at http://www.gzip.org/zlib/ Zimpl has not been tested with older versions of above librarys. GMP Version 3.x will not work for sure. If zlib.h and gmp.h and libgmp.a and libz.a are not at the usual places you have to adapt the Makefile, see below. On a Linux system you might succeed with just saying: make Otherwise: Whatever with GNU C : gmake Linux/x86 with Intel C : gmake COMP=intel Tru64 with Compaq C : gmake COMP=compaq Solaris with SUN Forte C : gmake COMP=sun AIX with VisualAge C : gmake COMP=ibm Windows with Cygwin/GCC : gmake COMP=gnu HPUX with HP C : gmake COMP=hp IRIX with SGI C : gmake COMP=sgi If your configuration is not in the list or does not work, you have to change the Makefile. Go to make/local an add a file make. There you can set the usual suspects like CC, CFLAGS, LDFLAG, and so on. The most likely reason that you can't compile, is that gmp.h or zlib.h are not in your include path (-I) or that libgmp.a oder libz.a are not in your library path (-L). Example: CPPFLAGS += -I/tmp/gmp/include LDFLAGS += -L/tmp/gmp/lib Have a look at Makefile and make/make.* to get an idea. On some MAC systems, GMP is installed under /sw/include and /sw/lib. If these are not contained in the library and include paths, you have to add them explicitly, as shown above. WINDOWS ------- You can just the through the source files into Visual Studio 2010. Please add the contents of the src/WIN directory to the files to be compiled. Make sure to set the following defines: WIN32 or WIN64 and INLINE= As for the libraries we recommend to replace gmp by MPIR - Multiple Precision Integers and Rationals version 2.4.0 or newer from http://mpir.org Furthermore, you need PCRE - Perl Compatible Regular Expressions version 8.12 or newer from http://www.pcre.org which should be compiled using the following two defines -DWITH_PCRE -DPCRE_STATIC CHECKING -------- Do a "make check" and look if it works. If not, compile again with an added "OPT=dbg" to the gmake invocation. If a failure in the 'subto' test is reported, this is to a difference in the behaviour of printf() and not a problem. INSTALLATION ------------ Copy bin/zimpl.*.opt to wherever you like. ALL GNULESS ----------- if you don't have gcc and gmake etc. You can try the following. Go to src and say "cc -O *.c -o zimpl". LICENSE ------- ZIMPL is under the GNU Lesser General Public License Version 3. See the file LICENSE for details. LATEST VERSION -------------- Can be found at http://zimpl.zib.de BUGS ---- Probably several. If you find one, send a description with runnable example .zpl file to koch@zib.de (Better even, send a working fix ;-) REMARK ------ If anything is changed in the code I would recommend recompiling without NDEBUG and NO_MSHELL defined. This will slow down the code considerably but will do a lot of consistency checking. In the source code are a lot of comments starting with /*lint ... and also a target in the Makefile. These are for flexelint (see http://www.gimpel.com) a very good version of lint. If you are interested in my settings used for this project, send me an email. THANKS ------ To Tuomo Takkula, Armin Fuegenschuh, Marc Pfetsch, Daniel Junglas, Joerg Rambau, Tobias Achterberg, Andreas Bley, Sebastian Orlowski, Bejamin Hiller, Ralf Borndoerfer, Martin Assmann, Nicolas Weber, Marc Moerig, Jens Hillmann, Dimitri Sverdlov, Joachim Reichel, Maciej Warszawski and all I forgot for their comments and bug reports. COMPLAINTS ---------- >/dev/null Have fun! zimpl-3.3.6/CHANGELOG0000644001417200060250000006451713303714344014006 0ustar bzfschlooptimi3.3.6 30. May 2018 Release - fixed bug not restoring gmp memory functions when using zimpl as a library - Zimpl now should be able to handle sets with more than 2 billion entries. 3.3.5 04. Feb 2018 Release - changed to C99 - changed to PClint+ (in progress) - Removed more cppcheck messages - Fixed minor issues in the documentation found by Laurent Poirrier - Fixed strange behaviour when encountering another objective function. - Replaced my bool.h by stdbool.h 3.3.4 8. Mar 2017 Release - added cppcheck target to makefile - scan-build make OPT=dbg works - Corrected the spacing of the NAME field in MPS output. - Fixed bug in library call regarding setting the random seed by arguments. - Fixed two bugs in the examples of the documentation found by Maximilian Ernestus 3.3.3 1. Jul 2015 Release - Added Windows Makefile. 3.3.2 27. Feb 2014 Release - All -O6 changed to -O3 in submakefiles. - ZLIB=false works now. - Fixed bug when vif then or else is used with an non-linear function. - Fixed bug when using indicators with vif - Fixed bug that appeared when asking a param with a ranged index set and a default for a string entry. 3.3.1 9. Dec 2012 Release - Fixed bug when reading wrong index type. - Fixed bug with constants in non-linear expresions. 3.3.0 29. Jul 2012 Release - Added support for functions sqrt, exp, pow, log, ln, sgn, sgnpow, sin, cos, tan, abs in non-linear case. - Fixed bug with indicator constraints and >= 3.2.0 29. Oct 2011 Release - There are new Makefile variables SHARED and STATIC. If set either of them to true Zimpl will in some case be generated as a shared library or completly statically linked. Works for the moment for most gcc based targets. - Replaced a quadratic routine that could lead to excessive running times when generating constraints with many coefficients. - Restructured and documented the xlpglue interface. The documentation can not be generated by make doxygen - Removed the presolving option. This will be done at a later time in an independend program. - Made sure all warnings get silenced by -v0 - Error 195 Genuine empty index set has been changed to Warning 195. - Zimpl now needs about 780 KB less stack space when using a read statement. - round() was working wrong with negative numbers. It shoud be now rounding to nearest integer by rounding half away from zero. - Implemented grouping of constraints. If two or more constraints are connected by "and" they can be used together within a forall or if. - It is now possible to conditional constraints without an else part. - Fixed bug in lp-file writer. Quadratic constraints are not to be divided by 2. Only objective functions. 3.1.0 30. Sep 2010 Release - Changed License to LGPL Version 3 - Improved Documentation: Thanks Tuomo! - Experimental support for non-linear constraints. x*y*z and x^3 should work. Output either directly through the interface or in PIP format. - Reworked the file writing routines. Now supports PIP format. HUM and RLP format updated. - Fixed a bug that would happen in certain cases if a param is overridden by the commandline. - Fixed a bug in certain vif-then-else constructs. - Fixed a bug in the implementation of the xor operator on variables. - Speed up term processing significantly. Mostly needed for computer generated Zimpl programs with long explicit sums. - Possibly improved correct computation of operator precedences. - Parenthesis '(' ')' are now needed after min/max if no expression is evaluated. - Fixed bug in grammar: parse error at min({1..3})+2 3.0.0 10. Sep 2009 Release - New attribut for constraints: indicator If vif is part of the constraint it is modelled as an indicator constraint and not by an big-M formulation. - It is now possible to give attributes also to constraints which use vif. - New attribut for constraints: checkonly. Meaning as follows: separate: do not include in initial LP, separate later on, need not to be checked for feasibility -> usercut in CPLEX -> init=False,separate=True,check=False in SCIP checkonly: do not include in initial LP, separate only to check for feasibility. -> Lazy cut in CPLEX -> init=False,separate=False,check=True in SCIP It is possible to set both attributes. This will result in init=False,separate=True,check=True in SCIP and for the constraint to appear both in the User Cut and the Lazy Cut section in the LP file. - Fixed bug with extended functions in the objective - When using zpl_read* it is now possible to select whether Zimpl is doing GMP memory management. - Fixed bug in zpl_read_with_args - Constant computation are now pruned and not done repeatedly - Changed version naming scheme - Improved position of error pointer for some 133 errors 2.09 23. April 2009 Release - Fixed a bug leading to crashes at the end of the program especially on x86-64. - New round() function rounding towards zero. - It is now possible to read empty files. 2.08 26. Sep 2008 Release - Implemented subset(A, 3, 5) giving the all subsets with 3, 4, and 5 elements. - Line length of program output as comment limited to 128 chars. - Updated SOS output. Now included into LPF and MPS output. No explicit .sos file is written anymore. 2.07 24. Aug 2007 Release - Fixed a bug in the new memory handling code. - Some changes in Makefiles, etc. to make it compatible with the ZIB Optimization Suite 1.0 2.06 02. Aug 2007 Release - If a variable is printed with "do print" the type and bounds of the variable are also given. - Implemented concatenating strings with the "+" operator. "hallo " + "wie" -> "hallo wie". - Removed a small bug which lead to incorrect variable names in the .tbl file if -l was used. - It is now possible to write out several strings and numbers with one PRINT statement. E.g.: do print "x= ", x, " m/s" - Improved memory handling for strings, tuples, and lists. - Implemented new file format RLP which permutes the order of the constraint and variables. - New parameter match "regular_expression" to the read function. If given, only those lines are read, which match the given expression. - New function substr(string_expression, start, length) returns the substring starting at start with the given length. In case start is negative, it is counted from the end of the string. - New function length(string_expression) returns the length of the string. - It is now possible to override a parameter value given in the Zimpl file with a command line -Dname=value. - Improved processing of initializer list for parameters and sets. Removed stack overflow for very long lists. - It is now possible to write var x <= if (test == 7) then 8 else infinity end; and similar. - Implemented "implicit" for binary and integer variables. - "{ }", "{ }", etc are now recognised as empty sets, not only "{}". Same for "<>". - The Zimpl-model is writte to the LP files as a comment. - It is now possible to have the output of a command as input to Zimpl. zimpl -P "cpp -DXXX=7 %s" test1.zpl will run test1.zpl through cpp with option -DXXX=7 and give the output to Zimpl. - A warning 215 is issued if the given start values violate a constraint. - If a .mst or .ord file is written, the constraints are tested against the given start values and a warning 215 is issued if a constraint is violated. - New product operator: prod in I : p[i] computes the product of all p[i]. 2.05 18. Sep 2006 Release - it is now possible to write just min A or max B for a one dimensional set of numbers to get the minimum/maximum number of the set. - The maximum length for variable names can now be set with the "-l length" command line option. - If verbose is set to Normal (1) or Verbose (2) warnings are only given once per statement. - Fixed wrong precedence of ^ operator. - Using the Zimpl library without gmp is now possible. make libdbl will generate a Zimpl library that uses numbdbl.c instead of numbgmp.c. Be aware that the code is not testet and that using doubles has a lot of nasty problems, like what happens when you compare two numbers. - It is now possible to define function that have a boolen value, like defbool(a,b) := a != b and (a > 5 or c <= 7); - If boolean-expr THEN boolean-expr ELSE boolean-expr END is now possible. - It is now possible to read all values in a file into a set. { read "data.dat" as "" } will real all values one after the other and put them into the set. "" also works. - Fixed several bugs that occured when reading lines longer than 8192 bytes long. - New function "zpl_read_with_args" to allow processing of command line defines, -s seed and multi file input in embedded apllications. - Funktions argmin/argmax implemented: argmin(5) in { 1 .. 100 } : abs(50 - i) will generate the set containing the indices of the five smallest |50-i| evaluations. Be aware that the the result is not neseccarily unambiguous since the index set i snot ordered. For example argmin in { 1 .. 10 } : 5. In case of argmin(1) the "(1)" can be omitted. argmax is the same the other way around. - It is now possible to initialise parameters without giving the index tuple explicitly. Writing param a[{1..4}*{1..3}] := read "matrix.dat" as "n+" comment "#"; with for example a file like 1 2 3 4 5 6 7 8 # here is a comment 9 10 11 12 or with a file like this 1 2 3 4 5 6 7 8 9 10 11 12 will result in a[1,1] = 1 ... a[4,3] = 12 Excess elements in the files are ignored. If there are not enough elements in the file, the elements in the parameter will be undefined, or set to default if present. Use "s+" for strings. - Check was missing if the parameter from a file is indeed a number. Bug fixed regarding the field number given for tuple fields errors. - Input from stringfiles is now possible. This allows to embed Zimpl programs into other programs without using any external files. - Small bug in multi iterator validation fixed. 2.04 30. Jan 2006 Release - Funktion random(minimum, maximum) implemented, which generates (hopefully) uniformly distributed random values between minimum and maximum. (not very well tested) - A warning 203 is generated in many cases when the indexing tuple is completely fixed. - Objective function inversion warning for MPS files is now only issued once. - A constant value in the objective function is now translated automatically into a variable __ObjOffset. This works on all output formats. - powerset() is now also generating the empty set. - It is now possible to write: UNION in I with i > 5 : A[i]; INTER in I with i > 5 : A[i]; to get the union or intersetection of all the involved sets. - When initialising an indexed set with a list any "with" clause on the set expresion was ignored. - Error 195 was the same as 135. It is now all 135. Error 195 has a new meaning. - It is now possible to read a single value by param n := read "huhu.dat" as "4n" skip 4 use 1 The above would read the fourth value in the fifth line of the file huhu.dat. - Fixed error in description of -n in -h output and some typos in the documentation. - Fixed problem when reading DOS format data files. The CR at the end of the line is now removed instead of being attached to the last field. - Fixed bug with IN operator and Rangesets. - It is now possible to build sets by indexing an expression: { in I with i != 3 : p[i] }; or { in A with i != 3 : }; - Special Ordered Sets (SOS) implemented. Thanks Daniel. - Changed a problem with the -n cf option due to a change in the LP file format specification. - Tabs are now allowed as separators after keywords (set, param, ...) - Control characters (notably CR from DOS files) are now ignored (treated as space) on input. - Zimpl is now build as a library to simplify incorporation into other programs. 2.03 2. Mar 2005 Release - If -v=0 ist set, most warnings are now suppressed. - Documentation improved. - Applying union, minus, intersection, or symmetric difference to two sets with tuples that have different component types will now result in a useful error message. - Fixed a bug that let unknown names evaluate to a member of a set. Example: subto c1: forall in I do w[k] <= 1; did not result in an error. - Fixed a bug that made it possible to put an undefined name in a set. - There is now a difference between "to" and "..". "to" tries to do exactly what is requested possibly resulting in an empty set. ".." does as before its best to produce a range. - Fixed Bug in print command appearing in connection with default clause. - Fixed Bug in handling of set products. - Decreased memory consumption of hash tables. - Slightly faster string hashing. - Improved error handling for wrong components in sets. 2.02 15. May 2004 Release - New function ordinal ord(s,t,c) implemented. While there is no specific order, all sets have one. That is ord will evaluate to the c-th component of the t-th tuple in set s. ord({1..10}*{"a","b"}, 3, 1) is something between 1 and 10, possibly 3. But doing do forall in {1..card(I)} do print ord(E,i,1); will print every element in I if it is one dimensional. - Improved detection of incorrect initialization of sets and params. - Bug in mod function fixed. Before mod gave the wrong result, if the two numbers had factors in common. - New -m switch that will write a CPLEX MST file with MIP starting values. - Complete new Set implementation. - If verbose is >= 3, the local variable stack is printed if an error occurs. - Makefile changed to support Mac OS-X. - New -V flag to show the version number. -h now also prints the banner text. - man page created 2.01 29. Oct 2003 Release - min/max over a indexed set of numbers, will now issue a warning, if the index set is empty. - Preprocessing is now switched on with the -O (optimize) switch. - Fixed a major bug that occured, if two number were subtracted from a constraint like in x - 5 + 3 >= 1 - Documentation update. Many spelling errors removed. do print and do check statements documented. - vif and vabs implemented. See documentation for details. - set implementation changed. Generated powersets and subsets do not use a hash table anymore. This should reduce memory consumption, but might slow things down a little bit. - xor implemented. - Fixed bug in presolve that resulted in fixed variables not removed. - Missing linefeed in hum format fixed. - Implemented "check" statement. - Implemented the "do" statement. This changes the syntax for print. It is now "do print". Now "do forall in I do print i; " is possible. - Error 163 now shows the location of the error. (Always start of the line ;-) - It is now possible to define non indexed parameters on the command line. -Dpeng=12 is equivalent to param peng := 12; in the Zimpl file. - <,<=,>=,> for strings implemented. - Function sqrt() implemented. - Functions log(), ln(), exp() reactivated. - Some error cases of parameter input were not handled correctly. - Table input for parameter implemented. - if for contstraints and summands implemented. - if for set expressions implemented. - Self defined functions implemented. 2.00 17. Sep 2003 Release - Function sgn(expr) implemented. - Fixed a bug in the set range routine. Now ranges with negative numbers are allowed. - Fixed bugs with MPS format. - New output format "hum" for -t parameter generates unmangled human readable, maschine unreadble LP format output. This replaces the -m switch. - Changed -v switch to -v0..3 and also the outputs that appear by default. - It is now possible to omit the .zpl extension on the input files. - Changed output routine, so that it should work even with with braindead OS like Windoof. Also allowed to use a different directory separator. - Trailing text on the last line should now draw a message. - Bug fixed, that resulted in an unreadable LP file if the index set of the variable has negative numbers. - Fixed bug, that cut extensions from basenames given by -o . - Fixed internal bug with bool not function. - We now get an error message instead of an abort() if the initialisation list of an parameter is empty. - New functions min/max that take a list of expression, like min(2, 5, a[4], b[7] / 2); (a and b are parameters) - Included zlib. It is now possible to read in .gz transparantly. - New function exists() that looks if a set has at least one member, e.g. exists( in I with i > 5 ) should be equivatent to card( { in I with i > 5 }) > 0 - Better diagnosis if a variable/parameter/set name is used a second time. - It is now possible to have contraint/obective names that are identical to variable/parameter/set names. - Changed gererated numbers for long names to hex. This needs less space. - Names are now 8 characters long for MPS output, but 16 for LPF. This is accroding to the CPLEX 7.0 specification. Starting at 8.0 it is possible to have 255 character long names, we want to stay compatible with the older versions. - Changed the syntax for set initialisation. if an indexset is assigned it has to be included in braces like set A := { in I with i > 5 } - It is now possible to write { in A with a > 5 } whenever a set is needed. This means also it is now possible to nest indexsets, like in { in { in C with k > 2 } with i mod 2 == 0 } - Ranges are now possible: 7 <= 5x + 6 y <= 99 (MPS output not yet here) - First presolve implemented. -p now switches on presolve, -F does what -p did before. - Fixed bug that empty constraints were ignored, even with a non zero right hand side. - Changed everything to rational numbers (GMP) (Funktions exp, log, ln, rand are out of order) - Fixed that variable which were not part of a constraint, were omitted in the Bounds section of the LPF/MPS file. - new -m switch to write unmangled lp file. 1.05 23. Mar 2003 Release - make check now works. - Removed senseless default in non indexed parameter. - New Makefile that allows different architectures in parallel. - Replaced rbt functions by a hash table. Mainly for portability. - Fixed bug in print statement that accured when trying to print a indexed set, without giving an index. - It is now allowed to use a WITH clause in the initialisation of parameters, variables and sets, like param x[ in I with i > 5] := i * 4; - Fixed bug that accured in the following case: param x[<"1", i> in A] := i * 4; - The number of elements in a set is now estimated and the hash table is sized accordingly. This should same some memory especially with the powerset function. - Fixed bug in param initialisation which set the type of the param always to NUMB. - Changes param initialsation. STRG values are allowed within indexed intialiszations. - Changed IF command. It can now handle (in principle) all types as return values, but only NUMB, STRG, NAME are allowed by the parser. - Change the implementation of SUM command. Major speedup. - Implemented random(min, max) generates a random number between min and max. At the moment rand() is used, but this will change. - It is now possible to have a default value for a parameter. param p[A] := <1> 1, <2> 2 default 99 will declare all p[i] with i in A and not 1 or 2 to return 99. - Corrected a typo, that resulted in .orf files instead of .ord - sym_lookup is now resolved in the scanner (speedup). - Added new flag -p "filter" which pipes the output through the filter, enabling for example compression. (Daniels idea) - The output files will be created in the current directory, if no -o flag is given. If it is present the name and path given will be used. - New possible value infinit/-infinity for upper/lower bounds. - We might display a warning if writing to a file fails somewhere in the middle. - When writing MPS there is a warning if the problem was inverted. - Warning about different dimension tuples prints tuples. - Tabs are now allowed at the start of a statement. - Non integral variable bounds for integral Variables are Warned about and fixed. - Bug fixed, that would not only set one variable from integer to binary, but all that would follow in the set also. - New function powerset(N) implemented. This generates all subsets of N. Example: set S[] = powerset(N); - New statement print started. - Function subsets(N, k) implemented. This generates all subsets of N with k elements. It is now possible to leave out the indexing subset in a set declaration. So set S[] := subsets(N, 3); is valid. Additional the new function indexset(S) returns the index set of S. - Indexed Sets implemented. - added "!" factorial function. - log, ln, exp where missing in the parser and the documentation. 1.04 20. Oct 2002 Release - Bug fixed in storage of variable and constraint names. - Grammar fixed, since trailing '*' expr of vexpr where not parsed. - Only variables that are written to the LP are written to the ".tbl" file. - Fixed a bug that would discard free variables with non zero costs. - Changed the output of the ".tbl" file. Now also the long constraint names are enclosed in doublequotes. - New options -n cm|cn|cf that control how the constraints in the LPF/MPS file are named. "cm" will number them 1..n with a "c" in front. "cn" will use the name supplied in the subto statement and number them 1..n within the statement. "cf" will use the name of the subto, then a 1..n number like in "cm" and then append all the local variables from the forall statements. (It is open if the "f" in "cf" stands for "full" or for "fuegenschuh".) - Grammar changed again, to allow x/3 as shorthand for x * 1/3 - Changed grammar again, to get rid of conflicts. - A union B does no longer warn about dublicate elements. This should also speed up oder set operations a bit. - The read template syntax is checked more precice. - Integer variables with bounds [0,1] are automatically changed to binary variables. - New function proj(set,tuple) wich projects a set to the elements of the tuple given. Example: set A := { 1 to 9 } * { 10 to 19 } * { "A","B" }; set B := proj(A, <3,1>) will give: <"A",1>, <"A",2"> ... <"B",9> - Bug fixed, dublicate constraint names now give an error message. - New functions log(x), ln(x) and exp(x), meaning logarithm to base 10, natural logarithm and e^x. - It is now possible to have variables on both sides of an inequality. "x[1] <= y[1]" is now supported. - Changed the parser to (hopefully) correct parse inequalites in all possible varietes. This includes nested sums and coefficents at all places. 1.03 31. Jul 2002 Release - A division by Zero now gives an error message (instead of an exception or whatever) - It is now possible to assign a qualified set expression to a set, like set C := in A * B with i < j; - It is now possible to nest "forall" statements. This can vastly reduce the memory needed, because it is no longer neccessary to build big cross products to loop over them. So instead of forall in I * J with i < j do it is possible to write forall in I do forall in J with i < j do - elems where now reused, this reduces the memory needed. - changed to not copy in principle const objects, this should have improved speed. 1.02 05. Jul 2002 Release - new functions FLOOR(expr) and CEIL(expr) which find the next integer down and up. - Bug fixed in MPS output that lets zimpl write BOUND lines for variables that are not used. - new flag -r that write a CPLEX branching order file (.ord). Two new attributes for variables: "priority expr" sets the branching priority for the variable. "startval expr" sets the start values for the variable - new function ABS(expr) that returns the absolut value of expr. - new function CARD(set) that computes the cardinality of a set. - memory leak pugged, that occured when summing over a restricted set. - added possiblility to initialise parameter per set element, the same way as variables. - the row scaling factor is now also printed in the .tbl file. - Added "attributes" to the constraints. At the moment the following are understood: scale : scales the constraint before writing the LP file. After scaling the absolut larges coefficient will be one. separate : Means "this constraint should be separated". At the moment, such constraints are written in an "User constraint" section in the LP-File. But CPlex does not recognise this. - "sum" is now also valid for expressions without variables. - Fixed error in LPF Writing Routine, that would write "Inf" instead of "+Inf". - Wrong template in read now gives an error message instead of an segment violation. 1.01 30. Oct 2001 Bug fix release - Added several missing const's to the code. - Unterminated string constants where not reported as errors. This led to very irritating behavior. Fixed. - Since it is possible that string type set members include spaces, the "real" name in the .tbl file is now surrounded by doublequotes. (I am not totally sure this is a good idea. Maybe I should just, change all spaces to underscores.) - It is now possible to write -x[3] in a constraint. Before it was neccessary to write -1*x[3]. - Changed the field splitting for the read statement. The FS keyword is gone. Read now tries to do the "right" thing. Look at the documentation for details. - When writing LP-format files, one's as coefficents are no longer written. This makes the files somewhat shorter. - -d (Debug) Option is no longer be ignored. - Default field separators for the read statement are now , <;> and ( is new). - Fixed one minor malloc error with the include statement. - Removed all uses of alloca() for better AIX compatibility. - String valued parameters now work. 1.00 09. Oct 2001 Initial release zimpl-3.3.6/Makefile0000644001417200060250000002075413371051600014221 0ustar bzfschlooptimi#* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: Makefile * #* Name....: Zimpl Makefile * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2005-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* # .PHONY: all depend clean lint doc doxygen check valgrind libdbl coverage ARCH := $(shell uname -m | \ sed \ -e s/sun../sparc/ \ -e s/i.86/x86/ \ -e s/i86pc/x86/ \ -e s/amd64/x86_64/ \ -e s/IP../mips/ \ -e s/9000..../hppa/ \ -e s/Power\ Macintosh/ppc/ \ -e s/00........../pwr4/) OSTYPE := $(shell uname -s | \ tr '[:upper:]' '[:lower:]' | \ tr '/' '_' | \ sed \ -e s/cygwin.*/cygwin/ \ -e s/irix../irix/ \ -e s/windows.*/windows/ \ -e s/mingw.*/mingw/) HOSTNAME := $(shell uname -n | tr '[:upper:]' '[:lower:]') VERSION = 3.3.6 VERBOSE = false SHARED = false STATIC = false ZLIB = true LINK = static OPT = opt COMP = gnu CC = gcc CC_o = -o # LINKCC = gcc LINKCC_o = -o #the white space is important LIBEXT = .a YACC = bison LEX = flex DCC = gcc LINT = pclp64_linux # _debug CPPCHECK = cppcheck AR = ar cr AR_o = RANLIB = ranlib DOXY = doxygen VALGRIND = valgrind --tool=memcheck --leak-check=full \ --leak-resolution=high --show-reachable=yes SRCDIR = src/zimpl BINDIR = bin LIBDIR = lib LINTCONF = /opt/pclint/config CPPFLAGS = -I$(SRCDIR)/.. -DVERSION='"$(VERSION)"' CFLAGS = -O LDFLAGS = -lgmp -lm YFLAGS = -d -t -v LFLAGS = -d ARFLAGS = DFLAGS = -MM GCCWARN = -Wall -W -Wpointer-arith -Wcast-align -Wwrite-strings \ -Wstrict-prototypes -Wmissing-prototypes -Winline \ -Wmissing-declarations -Wshadow -Waggregate-return \ -Wno-unused -Wno-unknown-pragmas ifeq ($(ZLIB),true) LDFLAGS += -lz else CPPFLAGS += -DWITHOUT_ZLIB endif ifeq ($(SHARED),true) LINK = shared endif ifeq ($(STATIC),true) LINK = static endif BASE = $(OSTYPE).$(ARCH).$(COMP).$(OPT) OBJDIR = obj/O.$(OSTYPE).$(ARCH).$(COMP).$(LINK).$(OPT) NAME = zimpl BINNAME = $(NAME)-$(VERSION).$(OSTYPE).$(ARCH).$(COMP).$(LINK).$(OPT) LIBNAME = $(NAME)-$(VERSION).$(BASE) LIBRARY = $(LIBDIR)/lib$(LIBNAME)$(LIBEXT) LIBRARYDBL = $(LIBDIR)/lib$(LIBNAME).dbl$(LIBEXT) LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE)$(LIBEXT) LIBDBLLINK = $(LIBDIR)/lib$(NAME).$(BASE).dbl$(LIBEXT) BINARY = $(BINDIR)/$(BINNAME) BINARYDBL = $(BINDIR)/$(BINNAME).dbl BINLINK = $(BINDIR)/$(NAME).$(BASE) BINSHORTLINK = $(BINDIR)/$(NAME) DEPEND = $(SRCDIR)/depend #----------------------------------------------------------------------------- OBJECT = zimpl.o xlpglue.o zlpglue.o \ ratlpstore.o ratlpfwrite.o ratmpswrite.o ratmstwrite.o \ ratordwrite.o ratpresolve.o LIBBASE = blkmem.o bound.o code.o conname.o define.o elem.o entry.o \ hash.o heap.o idxset.o inst.o iread.o list.o \ load.o local.o metaio.o mmlparse2.o mmlscan.o mono.o \ mshell.o prog.o random.o rdefpar.o source.o \ setempty.o setpseudo.o setlist.o setrange.o setprod.o \ setmulti.o set4.o stmt.o stkchk.o strstore2.o symbol.o \ term2.o tuple.o vinst.o zimpllib.o LIBOBJ = $(LIBBASE) gmpmisc.o numbgmp.o LIBDBLOBJ = $(LIBBASE) numbdbl.o OBJXXX = $(addprefix $(OBJDIR)/,$(OBJECT)) LIBXXX = $(addprefix $(OBJDIR)/,$(LIBOBJ)) LIBDBLXXX = $(addprefix $(OBJDIR)/,$(LIBDBLOBJ)) OBJSRC = $(addprefix $(SRCDIR)/,$(OBJECT:.o=.c)) LIBSRC = $(addprefix $(SRCDIR)/,$(LIBOBJ:.o=.c)) #(SRCDIR)/numbdbl.c #----------------------------------------------------------------------------- include make/make.$(OSTYPE).$(ARCH).$(COMP).$(OPT) -include make/local/make.$(HOSTNAME) -include make/local/make.$(HOSTNAME).$(COMP) -include make/local/make.$(HOSTNAME).$(COMP).$(OPT) #----------------------------------------------------------------------------- FLAGS += $(USRFLAGS) OFLAGS += $(USROFLAGS) CFLAGS += $(USRCFLAGS) $(USROFLAGS) LDFLAGS += $(USRLDFLAGS) ARFLAGS += $(USRARFLAGS) DFLAGS += $(USRDFLAGS) ifeq ($(VERBOSE),false) .SILENT: $(LIBRARY) $(LIBLINK) $(BINARY) $(BINLINK) $(BINSHORTLINK) \ $(SRCDIR)/mmlparse2.c $(SRCDIR)/mmlscan.c $(OBJXXX) $(LIBXXX) $(LIBDBLXXX) endif all: $(LIBRARY) $(LIBLINK) $(BINARY) $(BINLINK) $(BINSHORTLINK) double: $(LIBRARYDBL) $(LIBDBLLINK) $(BINARYDBL) # $(BINLINK) $(BINSHORTLINK) $(LIBLINK): $(LIBRARY) @rm -f $@ cd $(dir $@) && ln -s $(notdir $(LIBRARY)) $(notdir $@) $(LIBDBLLINK): $(LIBRARYDBL) @rm -f $@ cd $(dir $@) && ln -s $(notdir $(LIBRARYDBL)) $(notdir $@) $(BINLINK) $(BINSHORTLINK): $(BINARY) @rm -f $@ cd $(dir $@) && ln -s $(notdir $(BINARY)) $(notdir $@) $(BINARY): $(OBJDIR) $(BINDIR) $(OBJXXX) $(LIBRARY) @echo "-> linking $@" ifeq ($(COMP), msvc) $(LINKCC) $(CFLAGS) $(OBJXXX) $(LIBRARY) $(LDFLAGS) $(LINKCC_o)$@ else $(LINKCC) $(CFLAGS) $(OBJXXX) -L$(LIBDIR) -l$(LIBNAME) $(LDFLAGS) $(LINKCC_o)$@ endif $(BINARYDBL): $(OBJDIR) $(BINDIR) $(OBJXXX) $(LIBRARYDBL) @echo "-> linking $@" $(LINKCC) $(CFLAGS) $(OBJXXX) -L$(LIBDIR) -l$(LIBNAME).dbl $(LDFLAGS) $(CC_o)$@ $(LIBRARY): $(OBJDIR) $(LIBDIR) $(LIBXXX) @echo "-> generating library $@" -rm -f $(LIBRARY) $(AR) $(AR_o)$@ $(LIBXXX) $(ARFLAGS) ifneq ($(RANLIB),) $(RANLIB) $@ endif libdbl: $(LIBRARYDBL) $(LIBDBLLINK) $(LIBRARYDBL): $(OBJDIR) $(LIBDIR) $(LIBDBLXXX) @echo "-> generating library $@" -rm -f $(LIBRARYDBL) $(AR) $@ $(LIBDBLXXX) $(ARFLAGS) $(RANLIB) $@ $(SRCDIR)/mmlparse2.c: $(SRCDIR)/mmlparse2.y $(SRCDIR)/mme.h @echo "-> generating yacc parser $@" $(YACC) $(YFLAGS) -o $@ $< $(SRCDIR)/mmlscan.c: $(SRCDIR)/mmlscan.l $(SRCDIR)/mme.h @echo "-> generating lex scanner $@" $(LEX) $(LFLAGS) -o$@ $< lint: $(OBJSRC) $(LIBSRC) $(LINT) $(LINTCONF)/co-gcc.lnt $(SRCDIR)/project2.lnt \ -I$(LINTCONF) -I$(SRCDIR) -dNO_MSHELL -dVERSION='"$(VERSION)"' $^ cppcheck: $(OBJSRC) $(LIBSRC) $(CPPCHECK) $(CPPFLAGS) -I/usr/include -I/usr/include/x86_64-linux-gnu -I/usr/include/x86_64-linux-gnu/bits -I/usr/include/x86_64-linux-gnu/sys -I/usr/include/linux -I/usr/lib/gcc/x86_64-linux-gnu/5/include --inline-suppr --suppressions-list=src/cppcheck.txt --enable=warning,style,performance,portability,information $^ doc: cd doc; make -f Makefile doxygen: cd doc; $(DOXY) $(NAME).dxy check: cd check; \ /bin/sh ./check.sh ../$(BINARY) valgrind: cd check; \ /bin/sh ./check.sh "$(VALGRIND) ../$(BINARY)" coverage: -ln -s ../../src $(OBJDIR) -mkdir -p gcov lcov -d $(OBJDIR) -z make OPT=gcov check lcov -d $(OBJDIR) -c >gcov/z.capture lcov -d $(OBJDIR) -r gcov/z.capture "*mmlscan.c" "*mmlparse2.c" >gcov/zimpl.capture genhtml -o gcov gcov/zimpl.capture -rm gcov/z.capture $(OBJDIR): @echo "** creating directory \"$@\"" @-mkdir -p $(OBJDIR) $(LIBDIR): @echo "** creating directory \"$@\"" @-mkdir -p $(LIBDIR) $(BINDIR): @echo "** creating directory \"$@\"" @-mkdir -p $(BINDIR) clean: -rm -rf $(OBJDIR)/* $(BINARY) $(LIBRARY) $(LIBRARYDBL) $(LIBLINK) $(BINLINK) $(BINSHORTLINK) depend: $(SHELL) -ec '$(DCC) $(DFLAGS) $(CPPFLAGS) $(OBJSRC) $(LIBSRC) \ | sed '\''s|^\([0-9A-Za-z\_]\{1,\}\)\.o|$$\(OBJDIR\)/\1.o|g'\'' \ >$(DEPEND)' -include $(DEPEND) $(OBJDIR)/%.o: $(SRCDIR)/%.c @echo "-> compiling $@" $(CC) $(CPPFLAGS) $(CFLAGS) -c $< $(CC_o)$@ # --- EOF --------------------------------------------------------------------- zimpl-3.3.6/Makefile.nmake0000644001417200060250000001157013371051600015307 0ustar bzfschlooptimi# $Id: Makefile,v 1.82 2011/10/31 08:48:56 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: Makefile * #* Name....: Zimpl Makefile * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2005-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* # #.PHONY: all clean ARCH = x86 OSTYPE = win VERSION = 3.3.3 VERBOSE = 0 LINK = normal OPT = opt COMP = msvc CC = cl AR = lib LD = link SRCDIR = src BINDIR = bin LIBDIR = lib CPPFLAGS = /DVERSION=\"$(VERSION)\" \ /I$(SRCDIR) /I$(SRCDIR)\WIN \ /Dpopen=_popen /Dpclose=_pclose /DWITH_PCRE=1 \ /Ilib\zlib \ /Ilib\pcre \ /Ilib\mpir.$(ARCH) \ /D_CRT_SECURE_NO_WARNINGS CFLAGS = ARFLAGS = /nologo LIBS = lib\libz.$(ARCH).lib \ lib\libpcre.$(ARCH).lib \ lib\libmpir.$(ARCH).lib LDFLAGS = /NODEFAULTLIB:LIBCMT /NODEFAULTLIB:LIBCMTD /STACK:67108864 /OPT:REF /OPT:ICF /NOLOGO BASE = $(OSTYPE).$(ARCH).$(COMP).$(OPT) OBJDIR = obj\O.$(OSTYPE).$(ARCH).$(COMP).$(LINK).$(OPT) NAME = zimpl BINNAME = $(NAME)-$(VERSION).$(OSTYPE).$(ARCH).$(COMP).$(LINK).$(OPT) LIBNAME = $(NAME)-$(VERSION).$(BASE) LIBRARY = $(LIBDIR)\lib$(LIBNAME).lib BINARY = $(BINDIR)\$(BINNAME).exe DEPEND = $(SRCDIR)\depend #----------------------------------------------------------------------------- OBJECT = $(OBJDIR)\zimpl.obj $(OBJDIR)\xlpglue.obj $(OBJDIR)\zlpglue.obj \ $(OBJDIR)\ratlpstore.obj $(OBJDIR)\ratlpfwrite.obj $(OBJDIR)\ratmpswrite.obj $(OBJDIR)\ratmstwrite.obj \ $(OBJDIR)\ratordwrite.obj $(OBJDIR)\ratpresolve.obj LIBBASE = $(OBJDIR)\getopt.obj $(OBJDIR)\blkmem.obj $(OBJDIR)\bound.obj $(OBJDIR)\code.obj $(OBJDIR)\conname.obj \ $(OBJDIR)\define.obj $(OBJDIR)\elem.obj $(OBJDIR)\entry.obj \ $(OBJDIR)\hash.obj $(OBJDIR)\heap.obj $(OBJDIR)\idxset.obj $(OBJDIR)\inst.obj $(OBJDIR)\iread.obj $(OBJDIR)\list.obj \ $(OBJDIR)\load.obj $(OBJDIR)\local.obj $(OBJDIR)\metaio.obj $(OBJDIR)\mmlparse2.obj $(OBJDIR)\mmlscan.obj $(OBJDIR)\mono.obj \ $(OBJDIR)\mshell.obj $(OBJDIR)\prog.obj $(OBJDIR)\random.obj $(OBJDIR)\rdefpar.obj $(OBJDIR)\source.obj \ $(OBJDIR)\setempty.obj $(OBJDIR)\setpseudo.obj $(OBJDIR)\setlist.obj $(OBJDIR)\setrange.obj $(OBJDIR)\setprod.obj \ $(OBJDIR)\setmulti.obj $(OBJDIR)\set4.obj $(OBJDIR)\stmt.obj $(OBJDIR)\stkchk.obj $(OBJDIR)\strstore2.obj $(OBJDIR)/symbol.obj \ $(OBJDIR)\term2.obj $(OBJDIR)\tuple.obj $(OBJDIR)\vinst.obj $(OBJDIR)\zimpllib.obj LIBOBJ = $(LIBBASE) $(OBJDIR)\gmpmisc.obj $(OBJDIR)\numbgmp.obj #----------------------------------------------------------------------------- !include make/nmake.$(OSTYPE).$(ARCH).$(COMP).$(OPT) #----------------------------------------------------------------------------- !if $(VERBOSE) == 0 !CMDSWITCHES +S !endif all: $(LIBRARY) $(BINARY) $(BINARY): $(OBJDIR) $(BINDIR) $(OBJECT) $(LIBRARY) @echo "-> linking $@" $(LD) $(LDFLAGS) /OUT:$@ $(OBJECT) $(LIBRARY) $(LIBS) $(LIBRARY): $(OBJDIR) $(LIBDIR) $(LIBOBJ) @echo "-> generating library $@" @del $(LIBRARY) $(AR) $(ARFLAGS) /OUT:$@ $(LIBOBJ) $(OBJDIR): @echo "** creating directory \"$@\"" @mkdir $(OBJDIR) $(LIBDIR): @echo "** creating directory \"$@\"" @mkdir $(LIBDIR) $(BINDIR): @echo "** creating directory \"$@\"" @mkdir $(BINDIR) clean: del /Q $(OBJDIR)\*.* $(BINARY) $(LIBRARY) !include $(DEPEND) {$(SRCDIR)}.c{$(OBJDIR)}.obj: @echo "-> compiling $@" $(CC) $(CPPFLAGS) $(CFLAGS) /c $< /Fo$@ $(OBJDIR)\getopt.obj: $(SRCDIR)\WIN\getopt.c $(SRCDIR)\WIN\getopt.h $(CC) $(CPPFLAGS) $(CFLAGS) /c $(SRCDIR)\WIN\getopt.c /Fo$@ # --- EOF --------------------------------------------------------------------- zimpl-3.3.6/make/0000755001417200060250000000000013303265236013475 5ustar bzfschlooptimizimpl-3.3.6/make/make.linux.x86.gnu.valgrind0000644001417200060250000000105513303265233020512 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.valgrind,v 1.12 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O3 -m32 -march=pentiumpro -g -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86.gnu.opt-gccold0000644001417200060250000000101713303265233020735 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.opt-gccold,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -m32 -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.mingw.x86.msvc.opt0000644001417200060250000000127113303265236017652 0ustar bzfschlooptimiCPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES -D_DLL CFLAGS = -O3 LDFLAGS = -NODEFAULTLIB:LIBCMT -NODEFAULTLIB:LIBCMTD -STACK:67108864 -OPT:REF -OPT:ICF -NOLOGO -LTCG CC = cl CC_o = -Fo CFLAGS = LINKCC = link LINKCC_o = -OUT: AR = lib -nologo AR_o = /OUT: RANLIB = LIBEXT = .lib CPPFLAGS += -Dpopen=_popen -Dpclose=_pclose -Dinline=_inline -DNDEBUG -DWITH_PCRE=1 -D_WIN32 -W2 -wd4272 -Ox -nologo CPPFLAGS += -Isrc/WIN -Ilib/pcre -Ilib/zlib -Ilib/pcre -Ilib/mpir.$(ARCH) LDFLAGS += lib/libz.$(ARCH).$(OPT).lib \ lib/libpcre.$(ARCH).$(OPT).lib \ lib/libmpir.$(ARCH).$(OPT).lib LIBBASE += getopt.ozimpl-3.3.6/make/make.darwin.x86_64.gnu.opt0000644001417200060250000000103313301553023020133 0ustar bzfschlooptimi#--- $Id: make.darwin.x86_64.gnu.opt,v 1.8 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS += -O3 -m64 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS = -Bstatic -lgmp -lm #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.irix.mips.sgi.dbg0000644001417200060250000000032713301553023017564 0ustar bzfschlooptimi#--- $Id: make.irix.mips.sgi.dbg,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" CFLAGS = -fullwarn -g LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/nmake.win.x86.msvc.opt0000644001417200060250000000020713301553023017472 0ustar bzfschlooptimiCPPFLAGS = $(CPPFLAGS) /Dinline=_inline /DWIN32 /DNDEBUG CFLAGS = $(CFLAGS) /W2 /wd4274 /Ox /nologo LDFLAGS = $(LDFLAGS) /LTCG zimpl-3.3.6/make/make.darwin.ppc.gnu.opt0000644001417200060250000000033213301553023017760 0ustar bzfschlooptimi#--- $Id: make.darwin.ppc.gnu.opt,v 1.7 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.sparc.gnu.dbg0000644001417200060250000000034513301553023020127 0ustar bzfschlooptimi#--- $Id: make.sunos.sparc.gnu.dbg,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -g -fident $(GCCWARN) LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.sparc.gnu.opt0000644001417200060250000000033213301553023020171 0ustar bzfschlooptimi#--- $Id: make.sunos.sparc.gnu.opt,v 1.8 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86.intel.dbg0000644001417200060250000000063713301553023017762 0ustar bzfschlooptimi#--- $Id: make.linux.x86.intel.dbg,v 1.14 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DFREEMEM CFLAGS = -g -fp-model precise -w2 -Wcheck \ -par_report0 -vec_report0 \ -wd111,171,279,981,1173,1419,1684 LDFLAGS = -lgmp -lm # -wd383,444,810 ifeq ($(ZLIB),true) LDFLAGS += -lz endif #ifeq ($(LINK),shared) #LINK = normal #endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.freebsd.x86.gnu.opt0000644001417200060250000000037713301553023017762 0ustar bzfschlooptimi#--- $Id: make.freebsd.x86.gnu.opt,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -I/usr/local/include -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -L/usr/local/lib -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.cygwin.x86_64.gnu.opt0000644001417200060250000000037613301553023020160 0ustar bzfschlooptimi#--- $Id: make.cygwin.x86.gnu.opt,v 1.9 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DWINDOWS -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -march=pentiumpro $(GCCWARN) LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86_64.gnu.opt0000644001417200060250000000035613301553023020025 0ustar bzfschlooptimi#--- $Id: make.sunos.x86_64.gnu.opt,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -m64 -mtune=native LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.hp-ux.hppa.hp.dbg0000644001417200060250000000036713301553023017463 0ustar bzfschlooptimi#--- $Id: make.hp-ux.hppa.hp.dbg,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" -Dfinite=isfinite CFLAGS = -z -g +DD64 +W21,486,474 LDFLAGS = -noshared -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.cygwin.x86_64.gnu.dbg0000644001417200060250000000034313301553023020104 0ustar bzfschlooptimi#--- $Id: make.cygwin.x86.gnu.dbg,v 1.9 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DWINDOWS -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O -g $(GCCWARN) LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86.gnu.dbg0000644001417200060250000000101713301553023017431 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.dbg,v 1.14 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES -Dinline= CFLAGS = -O0 -m32 -g -fident -ftrapv $(GCCWARN) LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.linux.x86.gnu.gcov0000644001417200060250000000104213301553023017631 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.gcov,v 1.10 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DCOVERAGE -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m32 -g -fprofile-arcs -ftest-coverage LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.mingw.x86.msvc.dbg0000644001417200060250000000125513303265236017606 0ustar bzfschlooptimiCPPFLAGS += -DNO_MSHELL -D__NO_MATH_INLINES -D_DLL CFLAGS = LDFLAGS = -NODEFAULTLIB:LIBCMT -NODEFAULTLIB:LIBCMTD -STACK:67108864 -OPT:REF -OPT:ICF -NOLOGO -LTCG CC = cl CC_o = -Fo CFLAGS = LINKCC = link LINKCC_o = -OUT: AR = lib -nologo AR_o = /OUT: RANLIB = LIBEXT = .lib CPPFLAGS += -Dpopen=_popen -Dpclose=_pclose -Dinline=_inline -DNDEBUG -DWITH_PCRE=1 -D_WIN32 -W2 -wd4272 -Ox -nologo CPPFLAGS += -Isrc/WIN -Ilib/pcre -Ilib/zlib -Ilib/pcre -Ilib/mpir.$(ARCH) LDFLAGS += lib/libz.$(ARCH).$(OPT).lib \ lib/libpcre.$(ARCH).$(OPT).lib \ lib/libmpir.$(ARCH).$(OPT).lib LIBBASE += getopt.o zimpl-3.3.6/make/make.linux.x86.gnu.prf0000644001417200060250000000105213303265233017470 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.prf,v 1.11 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -march=pentiumpro -m32 -g -pg $(GCCWARN) -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86.gnu.opt0000644001417200060250000000075113301553023017513 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.gnu.opt,v 1.8 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -Bstatic #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.gnu.gcov0000644001417200060250000000105413303265233020152 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.gcov,v 1.10 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DCOVERAGE -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m64 -g -fprofile-arcs -ftest-coverage -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.gnu.prf0000644001417200060250000000105313303265233020002 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.gnu.prf,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O -m64 -mtune=native -g -pg $(GCCWARN) -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.mingw.x86.gnu.opt0000644001417200060250000000036513303265233017473 0ustar bzfschlooptimi#--- $Id: make.mingw.x86.gnu.opt,v 1.3 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -std=gnu99 LDFLAGS = -lgmp -lpcreposix -lpcre -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.eko.opt0000644001417200060250000000041713301553023020000 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.eko.opt,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CC = pathcc CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -std=c99 -D_POSIX_C_SOURCE=2 -march=auto -m64 -O3 -ipa LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.eko.dbg0000644001417200060250000000044313301553023017731 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.eko.dbg,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CC = pathcc CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -std=c89 -Dinline= -D_POSIX_C_SOURCE=2 -march=em64t -m64 -O0 -g $(GCCWARN) LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.darwin.x86.intel.dbg0000644001417200060250000000050713301553023020103 0ustar bzfschlooptimi#--- $Id: make.darwin.x86.intel.dbg,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DFREEMEM CFLAGS = -g -fp-model precise -w2 -Wcheck \ -par_report0 -vec_report0 \ -wd111,171,279,981,1173,1419,1684 LDFLAGS = -lgmp -lm -Bstatic # -wd383,444,810 ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.clang.dbg0000644001417200060250000000126713303265233020251 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.gnu.dbg,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CC = clang CPPFLAGS += -DFREEMEM #-D__NO_MATH_INLINES CFLAGS = -O0 -m64 -g -Weverything -Wno-padded -Wno-switch-enum -Wno-covered-switch-default -Wno-static-in-inline -Wno-pedantic -Wno-format-nonliteral -Wno-shorten-64-to-32 -Wno-disable-macro-expansion -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) LIBRARY = $(LIBDIR)/lib$(LIBNAME).so LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC AR = gcc -m64 -shared -o # the trailing space is important ARFLAGS = $(LDFLAGS) RANLIB = true endif ifeq ($(LINK),static) LDFLAGS += -static endif zimpl-3.3.6/make/make.mingw.x86_64.msvc.dbg0000644001417200060250000000125513303265236020117 0ustar bzfschlooptimiCPPFLAGS += -DNO_MSHELL -D__NO_MATH_INLINES -D_DLL CFLAGS = LDFLAGS = -NODEFAULTLIB:LIBCMT -NODEFAULTLIB:LIBCMTD -STACK:67108864 -OPT:REF -OPT:ICF -NOLOGO -LTCG CC = cl CC_o = -Fo CFLAGS = LINKCC = link LINKCC_o = -OUT: AR = lib -nologo AR_o = /OUT: RANLIB = LIBEXT = .lib CPPFLAGS += -Dpopen=_popen -Dpclose=_pclose -Dinline=_inline -DNDEBUG -DWITH_PCRE=1 -D_WIN64 -W2 -wd4272 -Ox -nologo CPPFLAGS += -Isrc/WIN -Ilib/pcre -Ilib/zlib -Ilib/pcre -Ilib/mpir.$(ARCH) LDFLAGS += lib/libz.$(ARCH).$(OPT).lib \ lib/libpcre.$(ARCH).$(OPT).lib \ lib/libmpir.$(ARCH).$(OPT).lib LIBBASE += getopt.o zimpl-3.3.6/make/make.cygwin.x86.gnu.dbg0000644001417200060250000000034413301553023017574 0ustar bzfschlooptimi#--- $Id: make.cygwin.x86.gnu.dbg,v 1.9 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DWINDOWS -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O -g $(GCCWARN) LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.osf1.alpha.compaq.opt0000644001417200060250000000034713301553023020344 0ustar bzfschlooptimi#--- $Id: make.osf1.alpha.compaq.opt,v 1.10 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" CFLAGS = -O4 -fast LDFLAGS = -non_shared -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86.opt0000644001417200060250000000035713301553023016725 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.opt,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" CFLAGS = -fast -xprefetch=auto -xipo=2 LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.freebsd.x86_64.gnu.opt0000644001417200060250000000040213301553023020260 0ustar bzfschlooptimi#--- $Id: make.freebsd.x86_64.gnu.opt,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -I/usr/local/include -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -L/usr/local/lib -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86.dbg0000644001417200060250000000032713301553023016654 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.dbg,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" CFLAGS = -g -xcheck=stkovf LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.irix.mips.sgi.opt0000644001417200060250000000033013301553023017624 0ustar bzfschlooptimi#--- $Id: make.irix.mips.sgi.opt,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -Dinline="" CFLAGS = -O2 -mips4 -IPA LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.win.x86.mingw-cross.opt0000644001417200060250000000050013301553023020610 0ustar bzfschlooptimi#--- $Id: make.win.x86.mingw-cross.opt,v 1.8 2014/03/03 08:36:28 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES -DWITH_PCRE -DPCRE_STATIC CFLAGS = -O3 -march=pentiumpro -g LDFLAGS = -lpcreposix -lpcre -lgmp -lm -static BINARY = $(BINDIR)/$(TARGET).exe ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.aix.pwr4.ibm.opt0000644001417200060250000000041413301553023017346 0ustar bzfschlooptimi#--- $Id: make.aix.pwr4.ibm.opt,v 1.9 2010/06/10 19:42:42 bzfkocht Exp $ CC = xlc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" \ -DLHT_BUCKETS=50000017U -DUSE_FSYNC CFLAGS = -O3 -q64 -qmaxmem=-1 \ -qarch=auto -qtune=auto -qcache=auto \ -qsuppress=1506-732 zimpl-3.3.6/make/make.osf1.alpha.compaq.dbg0000644001417200060250000000040113301553023020265 0ustar bzfschlooptimi#--- $Id: make.osf1.alpha.compaq.dbg,v 1.9 2010/06/10 19:42:42 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" CFLAGS = -std1 -w0 -gall -check \ -msg_disable strctpadding,nestincl,ignorecallval,unusedincl,unnecincl,hexoctunsign,questcompare2 zimpl-3.3.6/make/make.mingw.x86_64.msvc.opt0000644001417200060250000000127113303265236020163 0ustar bzfschlooptimiCPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES -D_DLL CFLAGS = -O3 LDFLAGS = -NODEFAULTLIB:LIBCMT -NODEFAULTLIB:LIBCMTD -STACK:67108864 -OPT:REF -OPT:ICF -NOLOGO -LTCG CC = cl CC_o = -Fo CFLAGS = LINKCC = link LINKCC_o = -OUT: AR = lib -nologo AR_o = /OUT: RANLIB = LIBEXT = .lib CPPFLAGS += -Dpopen=_popen -Dpclose=_pclose -Dinline=_inline -DNDEBUG -DWITH_PCRE=1 -D_WIN64 -W2 -wd4272 -Ox -nologo CPPFLAGS += -Isrc/WIN -Ilib/pcre -Ilib/zlib -Ilib/pcre -Ilib/mpir.$(ARCH) LDFLAGS += lib/libz.$(ARCH).$(OPT).lib \ lib/libpcre.$(ARCH).$(OPT).lib \ lib/libmpir.$(ARCH).$(OPT).lib LIBBASE += getopt.ozimpl-3.3.6/make/make.aix.pwr4.ibm.dbg0000644001417200060250000000034513301553023017303 0ustar bzfschlooptimi#--- $Id: make.aix.pwr4.ibm.dbg,v 1.9 2010/06/10 19:42:42 bzfkocht Exp $ CC = xlc CPPFLAGS += -DFREEMEM -Dinline="" -DUSE_FSYNC CFLAGS = -g -q64 -qmaxmem=-1 -bnoquiet -qsuppress=1506-732 \ -qflttrap -qcheck=all #-qwarn64 zimpl-3.3.6/make/make.mingw.x86.gnu.dbg0000644001417200060250000000040113303265233017414 0ustar bzfschlooptimi#--- $Id: make.mingw.x86.gnu.dbg,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DWINDOWS -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O -g $(GCCWARN) -std=gnu99 LDFLAGS = -lgmp -lpcreposix -lpcre -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/nmake.win.x86_64.msvc.dbg0000644001417200060250000000020113301553023017727 0ustar bzfschlooptimiCPPFLAGS = $(CPPFLAGS) /Dinline= /DWIN64 CFLAGS = $(CFLAGS) /W4 /Zi /wd4001 /wd4127 /wd4206 /wd4701 /wd4702 /wd4274 /nologo zimpl-3.3.6/make/make.freebsd.x86.gnu.dbg0000644001417200060250000000042213301553023017703 0ustar bzfschlooptimi#--- $Id: make.freebsd.x86.gnu.dbg,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -I/usr/local/include -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -g -fident -ftrapv $(GCCWARN) LDFLAGS = -L/usr/local/lib -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86.sun.dbg0000644001417200060250000000033313301553023017455 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.sun.dbg,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" CFLAGS = -g -xcheck=stkovf LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86.sun.opt0000644001417200060250000000036313301553023017526 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.sun.opt,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" CFLAGS = -fast -xprefetch=auto -xipo=2 LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.sunos.x86_64.gnu.dbg0000644001417200060250000000035313301553023017754 0ustar bzfschlooptimi#--- $Id: make.sunos.x86_64.gnu.dbg,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m64 -g -fident $(GCCWARN) LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.darwin.ppc.gnu.dbg0000644001417200060250000000032313301553023017712 0ustar bzfschlooptimi#--- $Id: make.darwin.ppc.gnu.dbg,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O -g $(GCCWARN) LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/nmake.win.x86.msvc.dbg0000644001417200060250000000020113301553023017416 0ustar bzfschlooptimiCPPFLAGS = $(CPPFLAGS) /Dinline= /DWIN32 CFLAGS = $(CFLAGS) /W4 /Zi /wd4001 /wd4127 /wd4206 /wd4701 /wd4702 /wd4274 /nologo zimpl-3.3.6/make/make.linux.x86.intel.opt0000644001417200060250000000057713301553023020033 0ustar bzfschlooptimi#--- $Id: make.linux.x86.intel.opt,v 1.14 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DNDEBUG -DNO_MSHELL CFLAGS = -O3 -ip -fp-model precise -w1 -par_report0 -vec_report0 \ -wd1173 LDFLAGS = -lgmp -lm -static #ifeq ($(LINK),shared) #LINK = normal #endif #ifeq ($(LINK),static) LDFLAGS += -static #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.intel.opt0000644001417200060250000000057013301553023020335 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.intel.opt,v 1.4 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DNDEBUG -DNO_MSHELL CFLAGS = -O3 -ip -fp-model precise -w1 -par_report0 -vec_report0 \ -wd1173 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif #ifeq ($(LINK),shared) #LINK = normal #endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.sunos.sparc.sun.dbg0000644001417200060250000000033613301553023020143 0ustar bzfschlooptimi#--- $Id: make.sunos.sparc.sun.dbg,v 1.11 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DFREEMEM -Dinline="" CFLAGS = -g -xcheck=stkovf LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.win.x86.mingw-cross.dbg0000644001417200060250000000045613301553023020554 0ustar bzfschlooptimi#--- $Id: make.win.x86.mingw-cross.dbg,v 1.6 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES -DWITH_PCRE -DPCRE_STATIC CFLAGS = -O -g $(GCCWARN) LDFLAGS = -lpcreposix -lpcre -lgmp -lm -static BINARY = $(BINDIR)/$(BINNAME).exe ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86.gnu.opt0000644001417200060250000000101513303265236017505 0ustar bzfschlooptimi#--- $Id: make.linux.x86.gnu.opt,v 1.15 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -m32 -mtune=native -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) #LDFLAGS += -static #endif zimpl-3.3.6/make/make.darwin.x86.gnu.opt0000644001417200060250000000065613301553023017634 0ustar bzfschlooptimiCPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS = -Bstatic -lgmp -lm #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.hp-ux.hppa.hp.opt0000644001417200060250000000040013301553023017515 0ustar bzfschlooptimi#--- $Id: make.hp-ux.hppa.hp.opt,v 1.8 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" -Dfinite=isfinite CFLAGS = +O3 +DD64 +W21,486,474 LDFLAGS = -noshared -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.gnu.opt-gccold0000644001417200060250000000103213303265233021243 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.gnu.opt-gccold,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -m64 -std=gnu99 LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.linux.x86_64.gnu.dbg0000644001417200060250000000100213303265233017741 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.gnu.dbg,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m64 -g $(GCCWARN) -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.darwin.x86.gnu.dbg0000644001417200060250000000067513301553023017567 0ustar bzfschlooptimiCPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m32 -g -fident $(GCCWARN) LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m32 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS = -Bstatic -lgmp -lm #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.linux.x86_64.intel.dbg0000644001417200060250000000064213301553023020267 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.intel.dbg,v 1.4 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DFREEMEM CFLAGS = -g -fp-model precise -w2 -Wcheck \ -par_report0 -vec_report0 \ -wd111,171,279,981,1173,1419,1684 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif # -wd383,444,810 #ifeq ($(LINK),shared) #LINK = normal #endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.freebsd.x86_64.gnu.dbg0000644001417200060250000000042513301553023020217 0ustar bzfschlooptimi#--- $Id: make.freebsd.x86_64.gnu.dbg,v 1.2 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -I/usr/local/include -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -g -fident -ftrapv $(GCCWARN) LDFLAGS = -L/usr/local/lib -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/nmake.win.x86_64.msvc.opt0000644001417200060250000000020713301553023020003 0ustar bzfschlooptimiCPPFLAGS = $(CPPFLAGS) /Dinline=_inline /DWIN64 /DNDEBUG CFLAGS = $(CFLAGS) /W2 /wd4274 /Ox /nologo LDFLAGS = $(LDFLAGS) /LTCG zimpl-3.3.6/make/make.linux.x86_64.gnu.opt0000644001417200060250000000102013303265236020012 0ustar bzfschlooptimi#--- $Id: make.linux.x86_64.gnu.opt,v 1.9 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -g -m64 -mtune=native -std=gnu99 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -static #endif zimpl-3.3.6/make/make.sunos.sparc.sun.opt0000644001417200060250000000036613301553023020214 0ustar bzfschlooptimi#--- $Id: make.sunos.sparc.sun.opt,v 1.12 2014/01/12 11:07:04 bzfkocht Exp $ CC = cc CPPFLAGS += -DNDEBUG -DNO_MSHELL -Dinline="" CFLAGS = -fast -xprefetch=auto -xipo=2 LDFLAGS = -Bstatic -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.darwin.x86.intel.opt0000644001417200060250000000042513301553023020150 0ustar bzfschlooptimi#--- $Id: make.darwin.x86.intel.opt,v 1.3 2014/01/12 11:07:04 bzfkocht Exp $ CC = icc CPPFLAGS += -DNDEBUG -DNO_MSHELL CFLAGS = -O3 -ip -fp-model precise -w1 -par_report0 -vec_report0 \ -wd1173 LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.darwin.x86_64.gnu.dbg0000644001417200060250000000106213301553023020067 0ustar bzfschlooptimi#--- $Id: make.darwin.x86_64.gnu.dbg,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -m64 -g -fident $(GCCWARN) LDFLAGS = -lgmp -lm ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -m64 -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS = -Bstatic -lgmp -lm #endif ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/make.cygwin.x86.gnu.opt0000644001417200060250000000040213301553023017635 0ustar bzfschlooptimi#--- $Id: make.cygwin.x86.gnu.opt,v 1.9 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DWINDOWS -DNDEBUG -DNO_MSHELL -D__NO_MATH_INLINES CFLAGS = -O3 -march=pentiumpro -g $(GCCWARN) LDFLAGS = -lgmp -lm -static ifeq ($(ZLIB),true) LDFLAGS += -lz endif zimpl-3.3.6/make/local/0000755001417200060250000000000013301553023014557 5ustar bzfschlooptimizimpl-3.3.6/make/make.sunos.x86.gnu.dbg0000644001417200060250000000076313301553023017450 0ustar bzfschlooptimi#--- $Id: make.sunos.x86.gnu.dbg,v 1.7 2014/01/12 11:07:04 bzfkocht Exp $ CPPFLAGS += -DFREEMEM -D__NO_MATH_INLINES CFLAGS = -O0 -g -fident $(GCCWARN) LDFLAGS = -lgmp -lm ifeq ($(ZLIB),true) LDFLAGS += -lz endif ifeq ($(LINK),shared) #LIBRARY = $(LIBDIR)/lib$(LIBNAME).so #LIBLINK = $(LIBDIR)/lib$(NAME).$(BASE).so CFLAGS += -fPIC #AR = gcc -shared -o # the trailing space is important #ARFLAGS = $(LDFLAGS) #RANLIB = true endif #ifeq ($(LINK),static) LDFLAGS += -Bstatic #endif zimpl-3.3.6/src/0000755001417200060250000000000013303714344013346 5ustar bzfschlooptimizimpl-3.3.6/src/project2.lnt0000644001417200060250000001244513303714141015616 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: project2.lnt */ /* Name....: PCLint+ Project Settings */ /* Author..: Thorsten Koch */ /* Copyright (C) 2001-2018 by Thorsten Koch */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ // TK 29Jan2018 //-hook(pre_option, -cond('%[option]' == '-sem', -reject)) //# Fix Bug in pclint 1.0 -max_threads=8 -vt_depth=20 +fsc // strings are const -A(C99) -width(132,4) -"format=%f:%l: %t %n: %m" -ffc // Function takes Custody flag -> off //-hFb^3 // //-e636 // strong type //-e632 // strong type -e571 // cast leads to sign extention -e750 // local MACRO not referenced // -esym(534,close,creat,fclose,fprintf,fputc,fflush,fsync,pclose,gzclose) -esym(534,fputs,fscanf,fseek,fwrite,lseek,memcpy,memmove,memset) -esym(534,printf,puts,scanf,sprintf,sscanf,strcat,strcpy) -esym(534,strncat,strncpy,unlink,write,regerror) // -e592 // Non-literal format specifier used without arguments -e749 // local enumeration constant not referenced -e758 // Operator followed by operator is confusing -e766 // Include of header file not used -e788 // enum constant not used within defaulted switch -e801 // Use of goto is deprecated -e826 // Suspicious pointer-to-pointer conversion -e834 // Operator followed by operator is confusing. Use parentheses // -strong(AzJzX,Tuple,Set,Str,vbool_cmp_operator,vbool_fixed_result) -strong(AzJzX,IdxSet,Term,TermElem,ineq_type,Ineq,Local,ListElem,List) -strong(AzJzX,ListElem,List,ListData,list_type) -strong(AzJzX,stmt_type,Stmt,Prog,code_type,CodeNode) -strong(AzJzX,RDef,RPar,MFP,rpar_type,RParVal) -strong(AazJX,Bound) -strong(AzJzX,bound_type) -strong(AzJzX,Heap,heap_type,HeapData,heapCmp) -strong(AizJzX,SetIter,setcheck_type,define_type,Define) -strong(AzJzX,Var,var_type,VarState,var_class,Con,con_type,ConState,LpDirect,lp_type,lp_format,lp_type,lp_direct) -strong(AzJzX,LpsHElem,lps_hash_type) -strong(AzJzX,PSResult) -strong(AzJzX,set_type,SetVTab,SetEmpty,SetPseudo,SetHead,SetList,SetRange,SetProd,SetMulti) -strong(AzJzX,SetEmptyIter,SetPseudoIter,SetListIter,SetRangeIter,SetProdIter,SetMultiIter) -strong(AzJzX,elem_type,Elem,ElemValue,ElemStore) -strong(AzJzX,Entry,EntryValue,symbol_type,Symbol) -strong(AzJzX,Pool,PoolElem) -strong(AzJzX,Numb,NumbStore) -strong(AzJzX,StrgFile,file_type) -strong(AzJzX,hash_type,Hash,HElem,SetElemIdx) -strong(AzJzX,HeapData,heap_data) -strong(AcJX,Inst) //-strong(AJXB,LintBool) // -esym(537,stdarg.h,sys/types.h) // repeated include file -esym(534,stkchk_used_x) // ignore return value -efile(413 428 537 613 661 676 685, src/mmlparse2.c) -efile(717 732 734 744 746 774 825 845 2704, src/mmlparse2.c) -efile(755, src/mmlparse2.h) -esym(*, yyptr, yynerrs, yystate, yyerrstatus, yytokentype, yychar, yylen) -esym(*, yyresult, yytype_int8, yytype_int16, yytop, yybottom, yyvsp, yyssp, yyvaluep) -esym(2701, yylex, yyerror, yydebug,yy_flex_debug) -efile(527 616 633 825, src/mmlscan.c) -efile(534 527 537 539 574 676 702 712 714 716 717 725 732 737 744 765 773 774 775 835 845 891 893, src/mmlscan.c) -esym(*, yyleng, yytext, yyset_extra, yyget_extra, flex_int8_t, flex_uint8_t, flex_uint32_t, yy_trans_info, yy_trans_info::yy_verify, yy_trans_info::yy_nxt) -efile(663, src/numbgmp.c) -esym(714 759 765, numb_div, numb_intdiv, numb_mod) // symbol not externally used -esym(755, ZIMPL_VERSION) -esym(755, mem_check_all, mem_hide, mem_maximum, mem_used) -esym(755, stchk_display) -e769 // global enumeration constant not referenced -esym(818, iter_next, iter_reset) // parameter could be pointer to const -esym(818, set_empty_get_tuple, set_pseudo_get_tuple) // parameter could be pointer to const -efunc(2466,iter_next) // used even marked as unused -esym(755,Min,stkchk_display) // global Macro not referenced -esym(757,lps_readmps) -esym(714 759 765, lps_delcon, lps_delvar, lps_flags, lps_getsos, lps_setbndname, lps_setcontype, lps_setprobname, lps_setrhsname, lps_setrngname, lps_setscale, lps_setvalue, lps_setvartype, lps_vartype) // not referenced, move to module, made static -esym(759 765, lps_number, lps_getvar) // move to module, made static -esym(714 759 765, code_set_child, code_value_bits, code_value_contype, code_value_size, code_value_varclass) -esym(714 759 765, idxset_print) -esym(714 759 765, i_bool_false, i_set_pseudo) // ??? -esym(759 765, list_print) -esym(759 765, mio_add_strg_file, mio_gets) -esym(768, set_empty::head, set_multi::head, set_prod::head, set_pseudo::head, set_range::head) -esym(768, set_empty_iter::dummy) -esym(714 759 765, gmp_print_mpq) -esym(714 759 765, term_print) -esym(714 759 765, zpl_read, zpl_read_with_args) -esym(714 759 765, tuple_combine) -esym(714 759 765, numb_tostr) -esym(714 759 765, symbol_get_dim, symbol_get_numb, symbol_get_set, symbol_get_strg, symbol_get_var, symbol_has_entry, symbol_is_valid) -esym(714 759 765, stkchk_display_x, stkchk_maxi, stkchk_start) -esym(714 759 765, mono_mul_entry) -esym(714 759 765, prog_is_valid) //++dbool=LintBool //++dtrue=((LintBool)1) //++dfalse=((LintBool)0) //-header(lint.h) zimpl-3.3.6/src/WIN/0000755001417200060250000000000013303714141013776 5ustar bzfschlooptimizimpl-3.3.6/src/WIN/getopt.h0000644001417200060250000001500313303714141015450 0ustar bzfschlooptimi/* getopt.h */ /* Declarations for getopt. Copyright (C) 1989-1994, 1996-1999, 2001 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. */ #ifndef _GETOPT_H #ifndef __need_getopt # define _GETOPT_H 1 #endif /* If __GNU_LIBRARY__ is not already defined, either we are being used standalone, or this is the first header included in the source file. If we are being used with glibc, we need to include , but that does not exist if we are standalone. So: if __GNU_LIBRARY__ is not defined, include , which will pull in for us if it's from glibc. (Why ctype.h? It's guaranteed to exist and it doesn't flood the namespace with stuff the way some other headers do.) */ #if !defined __GNU_LIBRARY__ # include #endif #ifdef __cplusplus extern "C" { #endif /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ extern char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns -1, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ extern int optind; /* Callers store zero here to inhibit the error message `getopt' prints for unrecognized options. */ extern int opterr; /* Set to an option character which was unrecognized. */ extern int optopt; #ifndef __need_getopt /* Describe the long-named options requested by the application. The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector of `struct option' terminated by an element containing a name which is zero. The field `has_arg' is: no_argument (or 0) if the option does not take an argument, required_argument (or 1) if the option requires an argument, optional_argument (or 2) if the option takes an optional argument. If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ struct option { # if (defined __STDC__ && __STDC__) || defined __cplusplus const char *name; # else char *name; # endif /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* Names for the values of the `has_arg' field of `struct option'. */ # define no_argument 0 # define required_argument 1 # define optional_argument 2 #endif /* need getopt */ /* Get definitions and prototypes for functions to process the arguments in ARGV (ARGC of them, minus the program name) for options given in OPTS. Return the option character from OPTS just read. Return -1 when there are no more options. For unrecognized options, or options missing arguments, `optopt' is set to the option letter, and '?' is returned. The OPTS string is a list of characters which are recognized option letters, optionally followed by colons, specifying that that letter takes an argument, to be placed in `optarg'. If a letter in OPTS is followed by two colons, its argument is optional. This behavior is specific to the GNU `getopt'. The argument `--' causes premature termination of argument scanning, explicitly telling `getopt' that there are no more options. If OPTS begins with `--', then non-option arguments are treated as arguments to the option '\0'. This behavior is specific to the GNU `getopt'. */ #if (defined __STDC__ && __STDC__) || defined __cplusplus # ifdef __GNU_LIBRARY__ /* Many other libraries have conflicting prototypes for getopt, with differences in the consts, in stdlib.h. To avoid compilation errors, only prototype getopt for the GNU C library. */ extern int getopt (int ___argc, char *const *___argv, const char *__shortopts); # else /* not __GNU_LIBRARY__ */ extern int getopt (); # endif /* __GNU_LIBRARY__ */ # ifndef __need_getopt extern int getopt_long (int ___argc, char *const *___argv, const char *__shortopts, const struct option *__longopts, int *__longind); extern int getopt_long_only (int ___argc, char *const *___argv, const char *__shortopts, const struct option *__longopts, int *__longind); /* Internal only. Users should not call this directly. */ extern int _getopt_internal (int ___argc, char *const *___argv, const char *__shortopts, const struct option *__longopts, int *__longind, int __long_only); # endif #else /* not __STDC__ */ extern int getopt (); # ifndef __need_getopt extern int getopt_long (); extern int getopt_long_only (); extern int _getopt_internal (); # endif #endif /* __STDC__ */ #ifdef __cplusplus } #endif /* Make sure we later can get all the definitions and declarations. */ #undef __need_getopt #endif /* getopt.h */ zimpl-3.3.6/src/WIN/unistd.h0000644001417200060250000000103013303714141015447 0ustar bzfschlooptimi#ifndef _UNISTD_H #define _UNISTD_H /* This file intended to serve as a drop-in replacement for * unistd.h on Windows * Please add functionality as neeeded */ #include #include #include /* getopt from: http://www.pwilson.net/sample.html. */ #ifdef __cplusplus extern "C" { #endif #define srandom srand #define random rand #define W_OK 2 #define R_OK 4 #define access _access #define ftruncate _chsize #define ssize_t int #ifdef __cplusplus } #endif #endif /* unistd.h */ zimpl-3.3.6/src/WIN/getopt.c0000644001417200060250000011636313303714141015456 0ustar bzfschlooptimi /* Getopt for GNU. NOTE: getopt is now part of the C library, so if you don't know what "Keep this file name-space clean" means, talk to drepper@gnu.org before changing it! Copyright (C) 1987,88,89,90,91,92,93,94,95,96,98,99,2000,2001 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. */ /* This tells Alpha OSF/1 not to define a getopt prototype in . Ditto for AIX 3.2 and . */ #ifndef _NO_PROTO # define _NO_PROTO #endif #ifdef HAVE_CONFIG_H # include #endif #if !defined __STDC__ || !__STDC__ /* This is a separate conditional since some stdc systems reject `defined (const)'. */ # ifndef const # define const # endif #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #define GETOPT_INTERFACE_VERSION 2 #if !defined _LIBC && defined __GLIBC__ && __GLIBC__ >= 2 # include # if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION # define ELIDE_CODE # endif #endif #ifndef ELIDE_CODE /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ /* Don't include stdlib.h for non-GNU C libraries because some of them contain conflicting prototypes for getopt. */ # include # include #endif /* GNU C library. */ #ifdef VMS # include # if HAVE_STRING_H - 0 # include # endif #endif #ifndef _ /* This is for other GNU distributions with internationalized messages. */ # if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC # include # ifndef _ # define _(msgid) gettext (msgid) # endif # else # define _(msgid) (msgid) # endif # if defined _LIBC && defined USE_IN_LIBIO # include # endif #endif /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. Setting the environment variable POSIXLY_CORRECT disables permutation. Then the behavior is completely standard. GNU application programs can use a third alternative mode in which they can distinguish the relative order of options and other arguments. */ #include "getopt.h" /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns -1, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ /* 1003.2 says this must be 1 before any call. */ int optind = 1; /* Formerly, initialization of getopt depended on optind==0, which causes problems with re-calling getopt as programs generally don't know that. */ int __getopt_initialized; /* The next char to be scanned in the option-element in which the last option character we returned was found. This allows us to pick up the scan where we left off. If this is zero, or a null string, it means resume the scan by advancing to the next ARGV-element. */ static char *nextchar; /* Callers store zero here to inhibit the error message for unrecognized options. */ int opterr = 1; /* Set to an option character which was unrecognized. This must be initialized on some systems to avoid linking in the system's own getopt implementation. */ int optopt = '?'; /* Describe how to deal with options that follow non-option ARGV-elements. If the caller did not specify anything, the default is REQUIRE_ORDER if the environment variable POSIXLY_CORRECT is defined, PERMUTE otherwise. REQUIRE_ORDER means don't recognize them as options; stop option processing when the first non-option is seen. This is what Unix does. This mode of operation is selected by either setting the environment variable POSIXLY_CORRECT, or using `+' as the first character of the list of option characters. PERMUTE is the default. We permute the contents of ARGV as we scan, so that eventually all the non-options are at the end. This allows options to be given in any order, even with programs that were not written to expect this. RETURN_IN_ORDER is an option available to programs that were written to expect options and other ARGV-elements in any order and that care about the ordering of the two. We describe each non-option ARGV-element as if it were the argument of an option with character code 1. Using `-' as the first character of the list of option characters selects this mode of operation. The special argument `--' forces an end of option-scanning regardless of the value of `ordering'. In the case of RETURN_IN_ORDER, only `--' can cause `getopt' to return -1 with `optind' != ARGC. */ static enum { REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER } ordering; /* Value of POSIXLY_CORRECT environment variable. */ static char *posixly_correct; #ifdef __GNU_LIBRARY__ /* We want to avoid inclusion of string.h with non-GNU libraries because there are many ways it can cause trouble. On some systems, it contains special magic macros that don't work in GCC. */ # include # define my_index strchr #else # if HAVE_STRING_H || WIN32 || WIN64/* Pete Wilson mod 7/28/02 */ # include # else # include # endif /* Avoid depending on library functions or files whose names are inconsistent. */ #ifndef getenv extern char *getenv (); #endif static char * my_index ( const char *str, int chr) { while (*str) { if (*str == chr) return (char *) str; str++; } return 0; } /* If using GCC, we can safely declare strlen this way. If not using GCC, it is ok not to declare it. */ #ifdef __GNUC__ /* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h. That was relevant to code that was here before. */ # if (!defined __STDC__ || !__STDC__) && !defined strlen /* gcc with -traditional declares the built-in strlen to return int, and has done so at least since version 2.4.5. -- rms. */ extern int strlen (const char *); # endif /* not __STDC__ */ #endif /* __GNUC__ */ #endif /* not __GNU_LIBRARY__ */ /* Handle permutation of arguments. */ /* Describe the part of ARGV that contains non-options that have been skipped. `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is the index after the last of them. */ static int first_nonopt; static int last_nonopt; #ifdef _LIBC /* Stored original parameters. XXX This is no good solution. We should rather copy the args so that we can compare them later. But we must not use malloc(3). */ extern int __libc_argc; extern char **__libc_argv; /* Bash 2.0 gives us an environment variable containing flags indicating ARGV elements that should not be considered arguments. */ # ifdef USE_NONOPTION_FLAGS /* Defined in getopt_init.c */ extern char *__getopt_nonoption_flags; static int nonoption_flags_max_len; static int nonoption_flags_len; # endif # ifdef USE_NONOPTION_FLAGS # define SWAP_FLAGS(ch1, ch2) \ if (nonoption_flags_len > 0) \ { \ char __tmp = __getopt_nonoption_flags[ch1]; \ __getopt_nonoption_flags[ch1] = __getopt_nonoption_flags[ch2]; \ __getopt_nonoption_flags[ch2] = __tmp; \ } # else # define SWAP_FLAGS(ch1, ch2) # endif #else /* !_LIBC */ # define SWAP_FLAGS(ch1, ch2) #endif /* _LIBC */ /* Exchange two adjacent subsequences of ARGV. One subsequence is elements [first_nonopt,last_nonopt) which contains all the non-options that have been skipped so far. The other is elements [last_nonopt,optind), which contains all the options processed since those non-options were skipped. `first_nonopt' and `last_nonopt' are relocated so that they describe the new indices of the non-options in ARGV after they are moved. */ #if defined __STDC__ && __STDC__ static void exchange (char **); #endif static void exchange ( char **argv) { int bottom = first_nonopt; int middle = last_nonopt; int top = optind; char *tem; /* Exchange the shorter segment with the far end of the longer segment. That puts the shorter segment into the right place. It leaves the longer segment in the right place overall, but it consists of two parts that need to be swapped next. */ #if defined _LIBC && defined USE_NONOPTION_FLAGS /* First make sure the handling of the `__getopt_nonoption_flags' string can work normally. Our top argument must be in the range of the string. */ if (nonoption_flags_len > 0 && top >= nonoption_flags_max_len) { /* We must extend the array. The user plays games with us and presents new arguments. */ char *new_str = malloc (top + 1); if (new_str == NULL) nonoption_flags_len = nonoption_flags_max_len = 0; else { memset (__mempcpy (new_str, __getopt_nonoption_flags, nonoption_flags_max_len), '\0', top + 1 - nonoption_flags_max_len); nonoption_flags_max_len = top + 1; __getopt_nonoption_flags = new_str; } } #endif while (top > middle && middle > bottom) { if (top - middle > middle - bottom) { /* Bottom segment is the short one. */ int len = middle - bottom; register int i; /* Swap it with the top part of the top segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[top - (middle - bottom) + i]; argv[top - (middle - bottom) + i] = tem; SWAP_FLAGS (bottom + i, top - (middle - bottom) + i); } /* Exclude the moved bottom segment from further swapping. */ top -= len; } else { /* Top segment is the short one. */ int len = top - middle; register int i; /* Swap it with the bottom part of the bottom segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[middle + i]; argv[middle + i] = tem; SWAP_FLAGS (bottom + i, middle + i); } /* Exclude the moved top segment from further swapping. */ bottom += len; } } /* Update records for the slots the non-options now occupy. */ first_nonopt += (optind - last_nonopt); last_nonopt = optind; } /* Initialize the internal data when the first call is made. */ #if defined __STDC__ && __STDC__ static const char *_getopt_initialize (int, char *const *, const char *); #endif static const char * _getopt_initialize ( int argc, char *const *argv, const char *optstring) { /* Start processing options with ARGV-element 1 (since ARGV-element 0 is the program name); the sequence of previously skipped non-option ARGV-elements is empty. */ first_nonopt = last_nonopt = optind; nextchar = NULL; posixly_correct = getenv ("POSIXLY_CORRECT"); /* Determine how to handle the ordering of options and nonoptions. */ if (optstring[0] == '-') { ordering = RETURN_IN_ORDER; ++optstring; } else if (optstring[0] == '+') { ordering = REQUIRE_ORDER; ++optstring; } else if (posixly_correct != NULL) ordering = REQUIRE_ORDER; else ordering = PERMUTE; #if defined _LIBC && defined USE_NONOPTION_FLAGS if (posixly_correct == NULL && argc == __libc_argc && argv == __libc_argv) { if (nonoption_flags_max_len == 0) { if (__getopt_nonoption_flags == NULL || __getopt_nonoption_flags[0] == '\0') nonoption_flags_max_len = -1; else { const char *orig_str = __getopt_nonoption_flags; int len = nonoption_flags_max_len = strlen (orig_str); if (nonoption_flags_max_len < argc) nonoption_flags_max_len = argc; __getopt_nonoption_flags = (char *) malloc (nonoption_flags_max_len); if (__getopt_nonoption_flags == NULL) nonoption_flags_max_len = -1; else memset (__mempcpy (__getopt_nonoption_flags, orig_str, len), '\0', nonoption_flags_max_len - len); } } nonoption_flags_len = nonoption_flags_max_len; } else nonoption_flags_len = 0; #endif return optstring; } /* Scan elements of ARGV (whose length is ARGC) for option characters given in OPTSTRING. If an element of ARGV starts with '-', and is not exactly "-" or "--", then it is an option element. The characters of this element (aside from the initial '-') are option characters. If `getopt' is called repeatedly, it returns successively each of the option characters from each of the option elements. If `getopt' finds another option character, it returns that character, updating `optind' and `nextchar' so that the next call to `getopt' can resume the scan with the following option character or ARGV-element. If there are no more option characters, `getopt' returns -1. Then `optind' is the index in ARGV of the first ARGV-element that is not an option. (The ARGV-elements have been permuted so that those that are not options now come last.) OPTSTRING is a string containing the legitimate option characters. If an option character is seen that is not listed in OPTSTRING, return '?' after printing an error message. If you set `opterr' to zero, the error message is suppressed but we still return '?'. If a char in OPTSTRING is followed by a colon, that means it wants an arg, so the following text in the same ARGV-element, or the text of the following ARGV-element, is returned in `optarg'. Two colons mean an option that wants an optional arg; if there is text in the current ARGV-element, it is returned in `optarg', otherwise `optarg' is set to zero. If OPTSTRING starts with `-' or `+', it requests different methods of handling the non-option ARGV-elements. See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. Long-named options begin with `--' instead of `-'. Their names may be abbreviated as long as the abbreviation is unique or is an exact match for some defined option. If they have an argument, it follows the option name in the same ARGV-element, separated from the option name by a `=', or else the in next ARGV-element. When `getopt' finds a long-named option, it returns 0 if that option's `flag' field is nonzero, the value of the option's `val' field if the `flag' field is zero. The elements of ARGV aren't really const, because we permute them. But we pretend they're const in the prototype to be compatible with other systems. LONGOPTS is a vector of `struct option' terminated by an element containing a name which is zero. LONGIND returns the index in LONGOPT of the long-named option found. It is only valid when a long-named option has been found by the most recent call. If LONG_ONLY is nonzero, '-' as well as '--' can introduce long-named options. */ int _getopt_internal ( int argc, char *const *argv, const char *optstring, const struct option *longopts, int *longind, int long_only) { int print_errors = opterr; if (optstring[0] == ':') print_errors = 0; if (argc < 1) return -1; optarg = NULL; if (optind == 0 || !__getopt_initialized) { if (optind == 0) optind = 1; /* Don't scan ARGV[0], the program name. */ optstring = _getopt_initialize (argc, argv, optstring); __getopt_initialized = 1; } /* Test whether ARGV[optind] points to a non-option argument. Either it does not have option syntax, or there is an environment flag from the shell indicating it is not an option. The later information is only used when the used in the GNU libc. */ #if defined _LIBC && defined USE_NONOPTION_FLAGS # define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0' \ || (optind < nonoption_flags_len \ && __getopt_nonoption_flags[optind] == '1')) #else # define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0') #endif if (nextchar == NULL || *nextchar == '\0') { /* Advance to the next ARGV-element. */ /* Give FIRST_NONOPT and LAST_NONOPT rational values if OPTIND has been moved back by the user (who may also have changed the arguments). */ if (last_nonopt > optind) last_nonopt = optind; if (first_nonopt > optind) first_nonopt = optind; if (ordering == PERMUTE) { /* If we have just processed some options following some non-options, exchange them so that the options come first. */ if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (last_nonopt != optind) first_nonopt = optind; /* Skip any additional non-options and extend the range of non-options previously skipped. */ while (optind < argc && NONOPTION_P) optind++; last_nonopt = optind; } /* The special ARGV-element `--' means premature end of options. Skip it like a null option, then exchange with previous non-options as if it were an option, then skip everything else like a non-option. */ if (optind != argc && !strcmp (argv[optind], "--")) { optind++; if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (first_nonopt == last_nonopt) first_nonopt = optind; last_nonopt = argc; optind = argc; } /* If we have done all the ARGV-elements, stop the scan and back over any non-options that we skipped and permuted. */ if (optind == argc) { /* Set the next-arg-index to point at the non-options that we previously skipped, so the caller will digest them. */ if (first_nonopt != last_nonopt) optind = first_nonopt; return -1; } /* If we have come to a non-option and did not permute it, either stop the scan or describe it to the caller and pass it by. */ if (NONOPTION_P) { if (ordering == REQUIRE_ORDER) return -1; optarg = argv[optind++]; return 1; } /* We have found another option-ARGV-element. Skip the initial punctuation. */ nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-')); } /* Decode the current option-ARGV-element. */ /* Check whether the ARGV-element is a long option. If long_only and the ARGV-element has the form "-f", where f is a valid short option, don't consider it an abbreviated form of a long option that starts with f. Otherwise there would be no way to give the -f short option. On the other hand, if there's a long option "fubar" and the ARGV-element is "-fu", do consider that an abbreviation of the long option, just like "--fu", and not "-f" with arg "u". This distinction seems to be the most useful approach. */ if (longopts != NULL && (argv[optind][1] == '-' || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1]))))) { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound = -1; int option_index; for (nameend = nextchar; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, nameend - nextchar)) { if ((unsigned int) (nameend - nextchar) == (unsigned int) strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else if (long_only || pfound->has_arg != p->has_arg || pfound->flag != p->flag || pfound->val != p->val) /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("%s: option `%s' is ambiguous\n"), argv[0], argv[optind]); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option `%s' is ambiguous\n"), argv[0], argv[optind]); #endif } nextchar += strlen (nextchar); optind++; optopt = 0; return '?'; } if (pfound != NULL) { option_index = indfound; optind++; if (*nameend) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = nameend + 1; else { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; #endif if (argv[optind - 1][1] == '-') { /* --option */ #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("\ %s: option `--%s' doesn't allow an argument\n"), argv[0], pfound->name); #else fprintf (stderr, _("\ %s: option `--%s' doesn't allow an argument\n"), argv[0], pfound->name); #endif } else { /* +option or -option */ #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("\ %s: option `%c%s' doesn't allow an argument\n"), argv[0], argv[optind - 1][0], pfound->name); #else fprintf (stderr, _("\ %s: option `%c%s' doesn't allow an argument\n"), argv[0], argv[optind - 1][0], pfound->name); #endif } #if defined _LIBC && defined USE_IN_LIBIO if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #endif } nextchar += strlen (nextchar); optopt = pfound->val; return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); #endif } nextchar += strlen (nextchar); optopt = pfound->val; return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* Can't find it as a long option. If this is not getopt_long_only, or the option starts with '--' or is not a valid short option, then it's an error. Otherwise interpret it as a short option. */ if (!long_only || argv[optind][1] == '-' || my_index (optstring, *nextchar) == NULL) { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; #endif if (argv[optind][1] == '-') { /* --option */ #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("%s: unrecognized option `--%s'\n"), argv[0], nextchar); #else fprintf (stderr, _("%s: unrecognized option `--%s'\n"), argv[0], nextchar); #endif } else { /* +option or -option */ #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("%s: unrecognized option `%c%s'\n"), argv[0], argv[optind][0], nextchar); #else fprintf (stderr, _("%s: unrecognized option `%c%s'\n"), argv[0], argv[optind][0], nextchar); #endif } #if defined _LIBC && defined USE_IN_LIBIO if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #endif } nextchar = (char *) ""; optind++; optopt = 0; return '?'; } } /* Look at and handle the next short option-character. */ { char c = *nextchar++; char *temp = my_index (optstring, c); /* Increment `optind' when we start to process its last character. */ if (*nextchar == '\0') ++optind; if (temp == NULL || c == ':') { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; #endif if (posixly_correct) { /* 1003.2 specifies the format of this message. */ #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("%s: illegal option -- %c\n"), argv[0], c); #else fprintf (stderr, _("%s: illegal option -- %c\n"), argv[0], c); #endif } else { #if defined _LIBC && defined USE_IN_LIBIO __asprintf (&buf, _("%s: invalid option -- %c\n"), argv[0], c); #else fprintf (stderr, _("%s: invalid option -- %c\n"), argv[0], c); #endif } #if defined _LIBC && defined USE_IN_LIBIO if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #endif } optopt = c; return '?'; } /* Convenience. Treat POSIX -W foo same as long option --foo */ if (temp[0] == 'W' && temp[1] == ';') { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound = 0; int option_index; /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (print_errors) { /* 1003.2 specifies the format of this message. */ #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("%s: option requires an argument -- %c\n"), argv[0], c); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option requires an argument -- %c\n"), argv[0], c); #endif } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; return c; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; /* optarg is now the argument, see if it's in the table of longopts. */ for (nextchar = nameend = optarg; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, nameend - nextchar)) { if ((unsigned int) (nameend - nextchar) == strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("%s: option `-W %s' is ambiguous\n"), argv[0], argv[optind]); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option `-W %s' is ambiguous\n"), argv[0], argv[optind]); #endif } nextchar += strlen (nextchar); optind++; return '?'; } if (pfound != NULL) { option_index = indfound; if (*nameend) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = nameend + 1; else { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("\ %s: option `-W %s' doesn't allow an argument\n"), argv[0], pfound->name); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("\ %s: option `-W %s' doesn't allow an argument\n"), argv[0], pfound->name); #endif } nextchar += strlen (nextchar); return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (print_errors) { #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("\ %s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option `%s' requires an argument\n"), argv[0], argv[optind - 1]); #endif } nextchar += strlen (nextchar); return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } nextchar = NULL; return 'W'; /* Let the application handle it. */ } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*nextchar != '\0') { optarg = nextchar; optind++; } else optarg = NULL; nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (print_errors) { /* 1003.2 specifies the format of this message. */ #if defined _LIBC && defined USE_IN_LIBIO char *buf; __asprintf (&buf, _("%s: option requires an argument -- %c\n"), argv[0], c); if (_IO_fwide (stderr, 0) > 0) __fwprintf (stderr, L"%s", buf); else fputs (buf, stderr); free (buf); #else fprintf (stderr, _("%s: option requires an argument -- %c\n"), argv[0], c); #endif } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; nextchar = NULL; } } return c; } } int getopt ( int argc, char *const *argv, const char *optstring) { return _getopt_internal (argc, argv, optstring, (const struct option *) 0, (int *) 0, 0); } #endif /* Not ELIDE_CODE. */ /* Compile with -DTEST to make an executable for use in testing the above definition of `getopt'. */ /* #define TEST */ /* Pete Wilson mod 7/28/02 */ #ifdef TEST #ifndef exit /* Pete Wilson mod 7/28/02 */ int exit(int); /* Pete Wilson mod 7/28/02 */ #endif /* Pete Wilson mod 7/28/02 */ int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; c = getopt (argc, argv, "abc:d:0123456789"); if (c == -1) break; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ zimpl-3.3.6/src/zimpl/0000755001417200060250000000000013317100345014474 5ustar bzfschlooptimizimpl-3.3.6/src/zimpl/stmt.c0000644001417200060250000001345313304236715015644 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: stmt.c */ /* Name....: Statement Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/stkchk.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/idxset.h" #include "zimpl/rdefpar.h" #include "zimpl/bound.h" #include "zimpl/define.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/list.h" #include "zimpl/local.h" #include "zimpl/code.h" #include "zimpl/inst.h" #include "zimpl/stmt.h" #define STMT_SID 0x53746d74 struct statement { SID StmtType type; const char* filename; int lineno; const char* text; CodeNode* node; }; #define MAX_WARNINGS 1000 static int warning_count[MAX_WARNINGS]; static void activate_warnings(void) { int i; for(i = 0; i < MAX_WARNINGS; i++) warning_count[i] = 0; } static void show_suppressed_warnings(void) { if (verbose > VERB_QUIET && verbose < VERB_CHATTER) { int i; for(i = 0; i < MAX_WARNINGS; i++) if (warning_count[i] > 1) fprintf(stderr, "--- Warning %3d: suppressed %d further message(s)\n", i, warning_count[i] - 1); } } bool stmt_trigger_warning(int no) { bool ret; assert(no >= 0); assert(no < MAX_WARNINGS); ret = (warning_count[no] == 0); warning_count[no]++; if (verbose >= VERB_CHATTER) ret = true; if (verbose <= VERB_QUIET) ret = false; return ret; } Stmt* stmt_new( StmtType type, const char* filename, int lineno, const char* text) { Stmt* stmt = calloc(1, sizeof(*stmt));; assert(filename != NULL); assert(text != NULL); assert(stmt != NULL); assert(lineno > 0); stmt->type = type; stmt->filename = strdup(filename); stmt->lineno = lineno; stmt->text = strdup(text); stmt->node = NULL; SID_set(stmt, STMT_SID); assert(stmt_is_valid(stmt)); return stmt; } void stmt_free(Stmt* stmt) { assert(stmt_is_valid(stmt)); SID_del(stmt); if (stmt->node != NULL) code_free(stmt->node); free((void*)stmt->filename); free((void*)stmt->text); free(stmt); } bool stmt_is_valid(const Stmt* stmt) { return ((stmt != NULL) && SID_ok(stmt, STMT_SID) && (stmt->filename != NULL) && (stmt->lineno > 0) && (stmt->text != NULL)); } const char* stmt_get_filename(const Stmt* stmt) { assert(stmt_is_valid(stmt)); return stmt->filename; } int stmt_get_lineno(const Stmt* stmt) { assert(stmt_is_valid(stmt)); return stmt->lineno; } const char* stmt_get_text(const Stmt* stmt) { assert(stmt_is_valid(stmt)); return stmt->text; } void stmt_parse(Stmt* stmt) { Trace("stmt_parse"); assert(stmt_is_valid(stmt)); if (verbose >= VERB_VERBOSE) printf("Parsing %s %d\n", stmt->filename, stmt->lineno); parse_stmt(stmt); stmt->node = code_get_root(); } void stmt_execute(const Stmt* stmt) { unsigned int inst_count = code_get_inst_count(); Trace("stmt_execute"); assert(stmt_is_valid(stmt)); if (verbose >= VERB_VERBOSE) printf("Executing %s %d\n", stmt->filename, stmt->lineno); activate_warnings(); (void)code_prune_tree(stmt->node); /* ??? I don't think this can happen without a parse error first. */ if (code_get_type(code_eval(stmt->node)) != CODE_VOID) { /* ^^^^^^^^^^^^^^^^^^^^ */ fprintf(stderr, "*** Error 169: Execute must return void element\n"); zpl_exit(EXIT_FAILURE); } show_suppressed_warnings(); if (verbose >= VERB_CHATTER) { printf("Instructions evaluated: %u\n", code_get_inst_count() - inst_count); stkchk_maximum(stdout); } } void stmt_print(FILE* fp, const Stmt* stmt) { static const char* const type_name[] = { "Unknown", "Set", "Param", "Var", "Min", "Max", "Cons", "Define", "Print", "SOS" }; assert(stmt_is_valid(stmt)); /* Lint weiss hier dass das assert immer erfuellt sein muss. * aber wir wollen es trotzdem. */ assert((unsigned int)stmt->type < (sizeof(type_name) / sizeof(type_name[0]))); /*lint !e650 */ fprintf(fp, "%s %04d %-7s [%s]\n", stmt->filename, stmt->lineno, type_name[(int)stmt->type], stmt->text); } zimpl-3.3.6/src/zimpl/zimpllib.c0000644001417200060250000002347313304236715016502 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: zimpllib.c */ /* Name....: ZIMPL Library Interface */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2005-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/stkchk.h" #include "zimpl/blkmem.h" #include "zimpl/random.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/bound.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/list.h" #include "zimpl/entry.h" #include "zimpl/xlpglue.h" #include "zimpl/prog.h" #include "zimpl/metaio.h" #include "zimpl/strstore.h" #include "zimpl/zimpllib.h" extern int yydebug; extern int yy_flex_debug; int verbose = VERB_QUIET; static jmp_buf zpl_read_env; static bool is_longjmp_ok = false; void zpl_print_banner(FILE* fp, bool with_license) { const char* const banner = "****************************************************\n" \ "* Zuse Institute Mathematical Programming Language *\n" \ "* Release %-5s Copyright (C)2018 by Thorsten Koch *\n" \ "****************************************************\n"; const char* const license = "* This is free software and you are welcome to *\n" \ "* redistribute it under certain conditions *\n" \ "* ZIMPL comes with ABSOLUTELY NO WARRANTY *\n" \ "****************************************************\n"; if (verbose >= VERB_NORMAL) { fprintf(fp, banner, VERSION); if (with_license || verbose > VERB_NORMAL) fprintf(fp, "%s", license); fputc('\n', fp); } } void zpl_exit(int retval) { if (is_longjmp_ok) longjmp(zpl_read_env, retval); #if defined(NDEBUG) || defined(COVERAGE) exit(retval); #else abort(); /* to get a stack trace */ #endif } static bool is_valid_identifier(const char* s) { assert(s != NULL); /* Identifiers start with a letter or a '_' */ if (!isalpha(*s) || *s == '_') return false; /* Then letters, digits or '_' can follow. */ while(isalnum(*++s) || *s == '_') ; return *s == '\0'; } void zpl_var_print(FILE* fp, const Var* var) { const char* name = xlp_getvarname(prog_get_lp(), var); VarClass class = xlp_getclass(prog_get_lp(), var); Bound* lower = xlp_getlower(prog_get_lp(), var); Bound* upper = xlp_getupper(prog_get_lp(), var); fprintf(fp, "\"%s\" ", name); switch(class) { case VAR_CON : fprintf(fp, "real ["); break; case VAR_IMP : fprintf(fp, "implicit integer ["); break; case VAR_INT : fprintf(fp, "integer ["); break; default : abort(); } bound_print(fp, lower); fprintf(fp, ","); bound_print(fp, upper); fprintf(fp, "] "); bound_free(upper); bound_free(lower); } void zpl_add_parameter(const char* def) { const char* warning = "--- Warning 175: Illegal syntax for command line define \"%s\" -- ignored\n"; Set* set; Symbol* sym; Tuple* tuple; Entry* entry; char* name; char* value; assert(def != NULL); name = strdup(def); value = strchr(name, '='); if (value == NULL) { fprintf(stderr, warning, def); free(name); return; } *value = '\0'; value++; if (strlen(name) == 0 || strlen(value) == 0 || !is_valid_identifier(name)) { if (verbose > VERB_QUIET) fprintf(stderr, warning, def); free(name); return; } set = set_pseudo_new(); sym = symbol_new(str_new(name), SYM_ERR, set, 1, ENTRY_NULL); tuple = tuple_new(0); if (!numb_is_number(value)) entry = entry_new_strg(tuple, str_new(value)); else { Numb* numb = numb_new_ascii(value); entry = entry_new_numb(tuple, numb); numb_free(numb); } symbol_add_entry(sym, entry); tuple_free(tuple); set_free(set); free(name); } bool zpl_read(const char* filename, bool with_management, void* user_data) { Prog* prog = NULL; void* lp = NULL; bool ret = false; stkchk_init(); yydebug = 0; yy_flex_debug = 0; zpl_print_banner(stdout, false); blk_init(); str_init(); rand_init(13021967UL); numb_init(with_management); elem_init(); set_init(); mio_init(); interns_init(); local_init(); if (0 == setjmp(zpl_read_env)) { Set* set; is_longjmp_ok = true; set = set_pseudo_new(); (void)symbol_new(SYMBOL_NAME_INTERNAL, SYM_VAR, set, 100, NULL); set_free(set); prog = prog_new(); prog_load(prog, NULL, filename); if (prog_is_empty(prog)) fprintf(stderr, "*** Error 168: No program statements to execute\n"); else { if (verbose >= VERB_DEBUG) prog_print(stderr, prog); lp = xlp_alloc(filename, false, user_data); prog_execute(prog, lp); ret = true; } } is_longjmp_ok = false; if (lp != NULL) xlp_free(lp); if (prog != NULL) prog_free(prog); local_exit(); interns_exit(); mio_exit(); symbol_exit(); define_exit(); set_exit(); elem_exit(); numb_exit(); str_exit(); blk_exit(); return ret; } bool zpl_read_with_args(char** argv, int argc, bool with_management, void* user_data) { const char* options = "D:mP:s:v:"; unsigned long seed = 13021967UL; char** param_table; int param_count = 0; int c; int i; Prog* prog = NULL; void* lp = NULL; bool ret = false; char* inppipe = NULL; bool use_startval = false; stkchk_init(); yydebug = 0; yy_flex_debug = 0; param_table = malloc(sizeof(*param_table)); zpl_print_banner(stdout, false); /* getopt might be called more than once */ optind = 1; while((c = getopt(argc, argv, options)) != -1) { switch(c) { case 'D' : param_table = realloc(param_table, ((unsigned int)param_count + 1) * sizeof(*param_table)); param_table[param_count] = strdup(optarg); if (verbose >= VERB_DEBUG) printf("Parameter %d [%s]\n", param_count, param_table[param_count]); param_count++; break; case 'm' : use_startval = true; break; case 'P' : inppipe = strdup(optarg); break; case 's' : seed = (unsigned long)atol(optarg); break; case 'v' : verbose = atoi(optarg); break; case '?': fprintf(stderr, "Unknown option '%c'\n", c); return false; default : abort(); } } if ((argc - optind) < 1) { fprintf(stderr, "Filename missing\n"); free(param_table); return false; } blk_init(); str_init(); rand_init(seed); numb_init(with_management); elem_init(); set_init(); mio_init(); interns_init(); local_init(); if (0 == setjmp( zpl_read_env)) { Set* set; is_longjmp_ok = true; /* Make symbol to hold entries of internal variables */ set = set_pseudo_new(); (void)symbol_new(SYMBOL_NAME_INTERNAL, SYM_VAR, set, 100, NULL); set_free(set); /* Now store the param defines */ for(i = 0; i < param_count; i++) zpl_add_parameter(param_table[i]); prog = prog_new(); for(i = optind; i < argc; i++) prog_load(prog, inppipe, argv[i]); if (prog_is_empty(prog)) fprintf(stderr, "*** Error 168: No program statements to execute\n"); else { if (verbose >= VERB_DEBUG) prog_print(stderr, prog); lp = xlp_alloc(argv[optind], use_startval, user_data); prog_execute(prog, lp); ret = true; } } is_longjmp_ok = false; if (lp != NULL) xlp_free(lp); /* Now clean up. */ if (inppipe != NULL) free(inppipe); for(i = 0; i < param_count; i++) free(param_table[i]); free(param_table); if (prog != NULL) prog_free(prog); local_exit(); interns_exit(); mio_exit(); symbol_exit(); define_exit(); set_exit(); elem_exit(); numb_exit(); str_exit(); blk_exit(); return ret; } zimpl-3.3.6/src/zimpl/set4.c0000644001417200060250000004124513304236715015534 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: set4.c */ /* Name....: Set Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/list.h" #include "zimpl/hash.h" #include "zimpl/stmt.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/set4.h" #define TEST_DUBLICATE 0 #define SET_SID 0x5365745f #ifndef NDEBUG static #endif SetVTab* set_vtab_global = NULL; void set_init() { assert(set_vtab_global == NULL); set_vtab_global = calloc((size_t)SET_TYPES, sizeof(*set_vtab_global)); assert(set_vtab_global != NULL); set_empty_init(set_vtab_global); set_pseudo_init(set_vtab_global); set_list_init(set_vtab_global); set_range_init(set_vtab_global); set_prod_init(set_vtab_global); set_multi_init(set_vtab_global); #if 0 set_union_init(set_vtab_global); set_inter_init(set_vtab_global); set_minus_init(set_vtab_global); set_sdiff_init(set_vtab_global); #endif } void set_exit() { assert(set_vtab_global != NULL); free(set_vtab_global); set_vtab_global = NULL; } Set* set_new_from_list(const List* list, SetCheckType check) { ListElem* le = NULL; Set* set = NULL; assert(list_is_valid(list)); assert(list_get_elems(list) > 0); if (list_is_elemlist(list)) set = set_list_new_from_elems(list, check); else if (list_is_tuplelist(list)) { int dim = tuple_get_dim(list_get_tuple(list, &le)); if (dim == 1) set = set_list_new_from_tuples(list, check); else set = set_multi_new_from_list(list, check); } else { assert(list_is_entrylist(list)); int dim = tuple_get_dim(entry_get_tuple(list_get_entry(list, &le))); if (dim == 1) set = set_list_new_from_entries(list, check); else set = set_multi_new_from_list(list, check); } assert(set_is_valid(set)); return set; } void set_free(Set* set) { set_vtab_global[set->head.type].set_free(set); } bool set_is_valid(const Set* set) { return set != NULL && set_vtab_global[set->head.type].set_is_valid(set); } Set* set_copy(const Set* set) { return set_vtab_global[set->head.type].set_copy(set); } inline SetIterIdx set_lookup_idx(const Set* set, const Tuple* tuple, int offset) { return set_vtab_global[set->head.type].set_lookup_idx(set, tuple, offset); } bool set_lookup(const Set* set, const Tuple* tuple) { if (set->head.dim != tuple_get_dim(tuple)) return false; return set_vtab_global[set->head.type].set_lookup_idx(set, tuple, 0) >= 0; } inline void set_get_tuple_intern(const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { set_vtab_global[set->head.type].set_get_tuple(set, idx, tuple, offset); } Tuple* set_get_tuple(const Set* set, SetIterIdx idx) { Tuple* tuple; tuple = tuple_new(set->head.dim); assert(set_is_valid(set)); assert(idx >= 0); assert(idx < set->head.members); set_get_tuple_intern(set, idx, tuple, 0); return tuple; } inline SetIter* set_iter_init_intern(const Set* set, const Tuple* pattern, int offset) { return set_vtab_global[set->head.type].iter_init(set, pattern, offset); } SetIter* set_iter_init(const Set* set, const Tuple* pattern) { return set_iter_init_intern(set, pattern, 0); } inline bool set_iter_next_intern(SetIter* iter, const Set* set, Tuple* tuple, int offset) { return set_vtab_global[set->head.type].iter_next(iter, set, tuple, offset); } Tuple* set_iter_next(SetIter* iter, const Set* set) { Tuple* tuple; tuple = tuple_new(set->head.dim); if (set_iter_next_intern(iter, set, tuple, 0)) return tuple; tuple_free(tuple); return NULL; } inline void set_iter_exit_intern(SetIter* iter, const Set* set) { set_vtab_global[set->head.type].iter_exit(iter, set); } void set_iter_exit(SetIter* iter, const Set* set) { set_iter_exit_intern(iter, set); } inline void set_iter_reset_intern(SetIter* iter, const Set* set) { set_vtab_global[set->head.type].iter_reset(iter, set); } int set_get_dim(const Set* set) { assert(set_is_valid(set)); return set->head.dim; } int set_get_members(const Set* set) { assert(set_is_valid(set)); return set->head.members; } void set_print(FILE* fp, const Set* set) { assert(fp != NULL); assert(set_is_valid(set)); switch(set->head.type) { case SET_EMPTY : fprintf(fp, "Empty: "); break; case SET_PSEUDO : fprintf(fp, "Pseudo: "); break; case SET_LIST : fprintf(fp, "List: "); break; case SET_RANGE : fprintf(fp, "Range: "); break; case SET_PROD : fprintf(fp, "Product: "); break; case SET_MULTI : fprintf(fp, "Multi: "); break; default : abort(); } fprintf(fp, "|%d|", set->head.dim); fprintf(fp, "{"); SetIter* iter = set_iter_init(set, NULL); Tuple* tuple; bool first = true; while(NULL != (tuple = set_iter_next(iter, set))) { if (first) first = false; else fprintf(fp, ","); tuple_print(fp, tuple); tuple_free(tuple); } set_iter_exit(iter, set); fprintf(fp, "}"); } /* In A or in B */ Set* set_union(const Set* set_a, const Set* set_b) { Set* set; SetIter* iter; List* list = NULL; Tuple* tuple; assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); assert(set_a->head.dim == set_b->head.dim || set_a->head.type == SET_EMPTY || set_b->head.type == SET_EMPTY); iter = set_iter_init(set_a, NULL); while(NULL != (tuple = set_iter_next(iter, set_a))) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); tuple_free(tuple); } set_iter_exit(iter, set_a); iter = set_iter_init(set_b, NULL); while(NULL != (tuple = set_iter_next(iter, set_b))) { if (!set_lookup(set_a, tuple)) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } tuple_free(tuple); } set_iter_exit(iter, set_b); if (list == NULL) { assert(set_get_members(set_a) + set_get_members(set_b) == 0); set = set_empty_new( set_a->head.type == SET_EMPTY ? set_b->head.dim : set_a->head.dim); } else { set = set_new_from_list(list, SET_CHECK_NONE); assert(set_get_members(set) <= set_get_members(set_a) + set_get_members(set_b)); list_free(list); } return set; } /* In A and in B */ Set* set_inter(const Set* set_a, const Set* set_b) { Set* set; SetIter* iter; List* list = NULL; Tuple* tuple; assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); assert(set_a->head.dim == set_b->head.dim || set_a->head.type == SET_EMPTY || set_b->head.type == SET_EMPTY); iter = set_iter_init(set_a, NULL); while(NULL != (tuple = set_iter_next(iter, set_a))) { if (set_lookup(set_b, tuple)) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } tuple_free(tuple); } set_iter_exit(iter, set_a); if (list == NULL) set = set_empty_new( set_a->head.type == SET_EMPTY ? set_b->head.dim : set_a->head.dim); else { set = set_new_from_list(list, SET_CHECK_NONE); assert(set_get_members(set) <= set_get_members(set_a) + set_get_members(set_b)); list_free(list); } return set; } /* In A but not in B */ Set* set_minus(const Set* set_a, const Set* set_b) { Set* set; SetIter* iter; List* list = NULL; Tuple* tuple; assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); assert(set_a->head.dim == set_b->head.dim || set_a->head.type == SET_EMPTY || set_b->head.type == SET_EMPTY); iter = set_iter_init(set_a, NULL); while(NULL != (tuple = set_iter_next(iter, set_a))) { if (!set_lookup(set_b, tuple)) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } tuple_free(tuple); } set_iter_exit(iter, set_a); if (list == NULL) { assert(set_is_subseteq(set_a, set_b)); set = set_empty_new( set_a->head.type == SET_EMPTY ? set_b->head.dim : set_a->head.dim); } else { set = set_new_from_list(list, SET_CHECK_NONE); assert(set_get_members(set) <= set_get_members(set_a)); list_free(list); } return set; } /* In A and not in B or in B and not in A (Symetric difference) */ Set* set_sdiff(const Set* set_a, const Set* set_b) { Set* set; SetIter* iter; List* list = NULL; Tuple* tuple; assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); assert(set_a->head.dim == set_b->head.dim || set_a->head.type == SET_EMPTY || set_b->head.type == SET_EMPTY); iter = set_iter_init(set_a, NULL); while(NULL != (tuple = set_iter_next(iter, set_a))) { if (!set_lookup(set_b, tuple)) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } tuple_free(tuple); } set_iter_exit(iter, set_a); iter = set_iter_init(set_b, NULL); while(NULL != (tuple = set_iter_next(iter, set_b))) { if (!set_lookup(set_a, tuple)) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } tuple_free(tuple); } set_iter_exit(iter, set_b); if (list == NULL) { assert(set_is_equal(set_a, set_b)); set = set_empty_new( set_a->head.type == SET_EMPTY ? set_b->head.dim : set_a->head.dim); } else { set = set_new_from_list(list, SET_CHECK_NONE); assert(set_get_members(set) <= set_get_members(set_a) + set_get_members(set_b)); list_free(list); } return set; } /* project set_a to a new set, using the elements index in the tuple. */ Set* set_proj(const Set* set, const Tuple* pattern) { Tuple* tuple; Tuple* new_tuple; SetIter* iter; List* list = NULL; int i; int dim; int* idx; Set* new_set; assert(set_is_valid(set)); assert(tuple_is_valid(pattern)); dim = tuple_get_dim(pattern); idx = malloc(sizeof(*idx) * (size_t)dim); assert(idx != NULL); for(i = 0; i < dim; i++) { assert(numb_is_int(elem_get_numb(tuple_get_elem(pattern, i)))); idx[i] = numb_toint(elem_get_numb(tuple_get_elem(pattern, i))) - 1; } iter = set_iter_init(set, NULL); while(NULL != (tuple = set_iter_next(iter, set))) { new_tuple = tuple_new(dim); for(i = 0; i < dim; i++) tuple_set_elem(new_tuple, i, elem_copy(tuple_get_elem(tuple, idx[i]))); if (list == NULL) list = list_new_tuple(new_tuple); else list_add_tuple(list, new_tuple); tuple_free(tuple); tuple_free(new_tuple); } set_iter_exit(iter, set); free(idx); if (list == NULL) { assert(set_get_members(set) == 0); new_set = set_empty_new(dim); } else { new_set = set_new_from_list(list, SET_CHECK_QUIET); assert(set_get_members(new_set) <= set_get_members(set)); list_free(list); } return new_set; } /* Is A subset (or equal) of B */ bool set_is_subseteq(const Set* set_a, const Set* set_b) { SetIter* iter; Tuple* tuple; bool is_subset = true; assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); /* If A is the empty set and B is non empty, * A is a subset of B */ if (set_a->head.members == 0) return true; if (set_a->head.dim != set_b->head.dim) { if (stmt_trigger_warning(165)) { fprintf(stderr, "--- Warning 165: Comparison of different dimension sets.\n"); set_print(stderr, set_a); fputc('\n', stderr); set_print(stderr, set_b); fputc('\n', stderr); } return false; } if (set_a->head.members > set_b->head.members) return false; iter = set_iter_init(set_a, NULL); while(is_subset && NULL != (tuple = set_iter_next(iter, set_a))) { is_subset = set_lookup(set_b, tuple); tuple_free(tuple); } set_iter_exit(iter, set_a); return is_subset; } /* A is real subset of B */ bool set_is_subset(const Set* set_a, const Set* set_b) { assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); if (set_a->head.members >= set_b->head.members) return false; return set_is_subseteq(set_a, set_b); } /* A has the same elements as B */ bool set_is_equal(const Set* set_a, const Set* set_b) { assert(set_is_valid(set_a)); assert(set_is_valid(set_b)); if (set_a->head.members != set_b->head.members) return false; return set_is_subseteq(set_a, set_b); } /* n elements in set * k elements in subset * i index for counter */ /*lint -sem(counter_inc, 1p == 3n && 2n > 0 && 3n > 0 && 4n >= 0, @n > 0) */ static int counter_inc(int* counter, int n, int k, int i) { int ret = 0; counter[i]++; if (counter[i] == n - i) { if (i == k - 1) return 1; ret = counter_inc(counter, n, k, i + 1); counter[i] = counter[i + 1] + 1; } return ret; } List* set_subsets_list( const Set* set, int subset_size, List* list, SetIterIdx* idx) { int* counter; int i; Set* subset; Tuple* tuple; Entry* entry; Numb* numb; assert(set_is_valid(set)); assert(subset_size >= 0); assert(subset_size <= set->head.members); assert(idx != NULL); if (subset_size == 0) { subset = set_empty_new(set_get_dim(set)); numb = numb_new_integer(*idx); *idx += 1; tuple = tuple_new(1); tuple_set_elem(tuple, 0, elem_new_numb(numb)); entry = entry_new_set(tuple, subset); list = list_new_entry(entry); numb_free(numb); entry_free(entry); tuple_free(tuple); set_free(subset); return list; } counter = malloc(sizeof(*counter) * (size_t)subset_size); assert(counter != NULL); for(i = 0; i < subset_size; i++) counter[i] = subset_size - 1 - i; do { List* subset_list = NULL; for(i = 0; i < subset_size; i++) { tuple = set_get_tuple(set, counter[i]); if (subset_list == NULL) subset_list = list_new_tuple(tuple); else list_add_tuple(subset_list, tuple); tuple_free(tuple); } assert(subset_list != NULL); subset = set_new_from_list(subset_list, SET_CHECK_NONE); /* NO_HASH ? */ list_free(subset_list); numb = numb_new_integer(*idx); *idx += 1; tuple = tuple_new(1); tuple_set_elem(tuple, 0, elem_new_numb(numb)); entry = entry_new_set(tuple, subset); if (list == NULL) list = list_new_entry(entry); else list_add_entry(list, entry); numb_free(numb); entry_free(entry); tuple_free(tuple); set_free(subset); } while(!counter_inc(counter, set->head.members, subset_size, 0)); free(counter); assert(list != NULL); return list; } zimpl-3.3.6/src/zimpl/zimpl.c0000644001417200060250000003454113304236715016011 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: zimpl.c */ /* Name....: Zuse Institute Mathematical Programming Language */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/stkchk.h" #include "zimpl/random.h" #include "zimpl/blkmem.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/bound.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/list.h" #include "zimpl/entry.h" #include "zimpl/conname.h" #include "zimpl/xlpglue.h" #include "zimpl/zlpglue.h" #include "zimpl/prog.h" #include "zimpl/metaio.h" #include "zimpl/strstore.h" #include "zimpl/zimpllib.h" extern int yydebug; extern int yy_flex_debug; static const char* const options = "bD:fF:hl:mn:o:OP:rs:t:v:V"; static const char* const usage = "usage: %s [options] file ...\n"; static const char* const title = "This file was automatically generated by Zimpl"; static const char* const help = "\n" \ " -b enable bison debugging output.\n" \ " -D name=value assign value to parameter name.\n" \ " -f enable flex debugging output.\n" \ " -F filter filter output, for example \"gzip -c >%%s.gz\"\n" \ " -h show this help.\n" \ " -l length Maximum length of names in output file.\n" \ " -m write CPLEX MIP start value file.\n" " -n cm|cn|cf name constraint make/name/full\n" \ " -o outfile select name for the output file. Default is the name of\n" \ " the input file without extension.\n" \ " -P cmd Pipe input through command, e.g. \"cpp -DONLY_X %%s\"\n" \ " -r write CPLEX branching order file.\n" \ " -s seed random number generator seed.\n" \ " -t lp|mps|hum|rlp|pip select output format. Either LP (default), MPS format,\n" \ " human readable HUM, randomly permuted LP, or PIP polynomial IP.\n" \ " -v[0-5] verbosity level: 0 = quiet, 1 = default, up to 5 = debug\n" \ " -V print program version\n" \ " filename is the name of the input ZPL file.\n" \ "\n" ; /* " -O optimize LP by preprocessing.\n" \ */ #ifdef WITH_CALLTRACE /* Does only work with gcc */ void __cyg_profile_func_enter(void *this_fn, void *call_site) __attribute__((no_instrument_function)); void __cyg_profile_func_exit(void *this_fn, void *call_site) __attribute__((no_instrument_function)); static int call_depth = 0; void __cyg_profile_func_enter(void *this_fn, void *call_site) { call_depth++; fprintf(stderr, "%p %d\n", this_fn, call_depth); } void __cyg_profile_func_exit(void *this_fn, void *call_site) { call_depth--; } #endif //lint -sem(add_extention, 1p, 2p, @p) static char* add_extention(const char* filename, const char* extension) { char* basename; assert(filename != NULL); assert(strlen(filename) > 0); assert(extension != NULL); basename = malloc(strlen(filename) + strlen(extension) + 1); assert(basename != NULL); strcpy(basename, filename); return strcat(basename, extension); /*lint !e429 suppress 'Custodial pointer 'basename' has not been freed or returned' */ } static const char* strip_path(const char* filename) { const char* s; assert(filename != NULL); assert(strlen(filename) > 0); s = strrchr(filename, DIRSEP); return (s == NULL) ? filename : s + 1; } static char* strip_extension(char* filename) { int i; assert(filename != NULL); assert(strlen(filename) > 0); for(i = (int)strlen(filename) - 1; i >= 0; i--) if (filename[i] == DIRSEP || filename[i] == '.') break; if (i >= 0 && filename[i] == '.') filename[i] = '\0'; i = (int)strlen(filename); if (i == 0 || filename[i - 1] == DIRSEP) { fprintf(stderr, "*** Error 101: Bad filename\n"); exit(EXIT_FAILURE); } return filename; } static void check_write_ok(FILE* fp, const char* filename) { if (ferror(fp)) { fprintf(stderr, "*** Error 102: File write error\n"); perror(filename); } } int main(int argc, char* const* argv) { Prog* prog; Set* set; void* lp; const char* extension = ""; char* filter = strdup("%s"); char* outfile; char* tblfile; char* ordfile; char* mstfile; char* basefile = NULL; char* inppipe = NULL; char* outpipe; LpFormat format = LP_FORM_LPF; FILE* fp; bool write_order = false; bool write_mst = false; bool presolve = false; int name_length = 0; char* prog_text; unsigned long seed = 13021967UL; char** param_table; int param_count = 0; int c; int i; FILE* (*openfile)(const char*, const char*) = fopen; int (*closefile)(FILE*) = fclose; stkchk_init(); yydebug = 0; yy_flex_debug = 0; verbose = VERB_NORMAL; param_table = malloc(sizeof(*param_table)); while((c = getopt(argc, argv, options)) != -1) { switch(c) { case 'b' : yydebug = 1; break; case 'D' : param_table = realloc(param_table, ((unsigned int)param_count + 1) * sizeof(*param_table)); param_table[param_count] = strdup(optarg); param_count++; break; case 'h' : zpl_print_banner(stdout, true); printf(usage, argv[0]); puts(help); exit(0); case 'f' : yy_flex_debug = 1; break; case 'F' : free(filter); filter = strdup(optarg); openfile = popen; closefile = pclose; break; case 'l' : name_length = atoi(optarg); break; case 'm' : write_mst = true; break; case 'n' : if (*optarg != 'c') { fprintf(stderr, usage, argv[0]); exit(0); } switch(optarg[1]) { case 'm' : conname_format(CON_FORM_MAKE); break; case 'n' : conname_format(CON_FORM_NAME); break; case 'f' : conname_format(CON_FORM_FULL); break; default : fprintf(stderr, usage, argv[0]); exit(0); } break; case 'o' : basefile = strdup(optarg); break; case 'O' : presolve = true; break; case 'P' : inppipe = strdup(optarg); break; case 's' : seed = (unsigned long)atol(optarg); break; case 'r' : write_order = true; break; case 't' : switch(tolower(*optarg)) { case 'h' : format = LP_FORM_HUM; break; case 'm' : format = LP_FORM_MPS; break; case 'l' : format = LP_FORM_LPF; break; case 'p' : format = LP_FORM_PIP; break; case 'r' : format = LP_FORM_RLP; break; default : if (verbose > VERB_QUIET) fprintf(stderr, "--- Warning 103: Output format \"%s\" not supported, using LP format\n", optarg); format = LP_FORM_LPF; break; } break; case 'v' : verbose = atoi(optarg); break; case 'V' : printf("%s\n", VERSION); exit(0); case '?': fprintf(stderr, usage, argv[0]); exit(0); default : abort(); } } if ((argc - optind) < 1) { fprintf(stderr, usage, argv[0]); exit(0); } zpl_print_banner(stdout, true); if (basefile == NULL) basefile = strip_extension(strdup(strip_path(argv[optind]))); switch(format) { case LP_FORM_LPF : extension = ".lp"; break; case LP_FORM_MPS : extension = ".mps"; break; case LP_FORM_HUM : extension = ".hum"; break; case LP_FORM_RLP : extension = ".rlp"; break; case LP_FORM_PIP : extension = ".pip"; break; default : abort(); } assert(extension != NULL); outfile = add_extention(basefile, extension); tblfile = add_extention(basefile, ".tbl"); ordfile = add_extention(basefile, ".ord"); mstfile = add_extention(basefile, ".mst"); outpipe = malloc(strlen(basefile) + strlen(filter) + 256); assert(outpipe != NULL); blk_init(); str_init(); rand_init(seed); numb_init(true); elem_init(); set_init(); mio_init(); interns_init(); local_init(); /* Make symbol to hold entries of internal variables */ set = set_pseudo_new(); (void)symbol_new(SYMBOL_NAME_INTERNAL, SYM_VAR, set, 100, ENTRY_NULL); set_free(set); /* Now store the param defines */ for(i = 0; i < param_count; i++) zpl_add_parameter(param_table[i]); /* Next we read in the zpl program(s) */ prog = prog_new(); for(i = optind; i < argc; i++) prog_load(prog, inppipe, argv[i]); if (prog_is_empty(prog)) { fprintf(stderr, "*** Error 168: No program statements to execute\n"); exit(EXIT_FAILURE); } if (verbose >= VERB_DEBUG) prog_print(stderr, prog); lp = xlp_alloc(argv[optind], write_mst || write_order, NULL); zlp_setnamelen(lp, name_length); prog_execute(prog, lp); /* Presolve */ if (presolve) fprintf(stderr, "--- Warning: Presolve no longer support. If you need it, send me an email\n"); #if 0 if (!zlp_presolve()) exit(EXIT_SUCCESS); #endif if (verbose >= VERB_NORMAL) zlp_stat(lp); /* Write order file */ if (write_order) { sprintf(outpipe, filter, ordfile, "ord"); if (verbose >= VERB_NORMAL) printf("Writing [%s]\n", outpipe); if (NULL == (fp = (*openfile)(outpipe, "w"))) { fprintf(stderr, "*** Error 104: File open failed "); perror(ordfile); exit(EXIT_FAILURE); } zlp_orderfile(lp, fp, format); check_write_ok(fp, ordfile); (void)(*closefile)(fp); } /* Write MST file */ if (write_mst) { sprintf(outpipe, filter, mstfile, "mst"); if (verbose >= VERB_NORMAL) printf("Writing [%s]\n", outpipe); if (NULL == (fp = (*openfile)(outpipe, "w"))) { fprintf(stderr, "*** Error 104: File open failed "); perror(mstfile); exit(EXIT_FAILURE); } zlp_mstfile(lp, fp, format); check_write_ok(fp, mstfile); (void)(*closefile)(fp); } /* Write Output */ sprintf(outpipe, filter, outfile, "lp"); if (verbose >= VERB_NORMAL) printf("Writing [%s]\n", outpipe); if (NULL == (fp = (*openfile)(outpipe, "w"))) { fprintf(stderr, "*** Error 104: File open failed "); perror(outfile); exit(EXIT_FAILURE); } if (format != LP_FORM_RLP) prog_text = prog_tostr(prog, format == LP_FORM_MPS ? "* " : "\\ ", title, 128); else { prog_text = malloc(strlen(title) + 4); assert(prog_text != NULL); sprintf(prog_text, "\\%s\n", title); } zlp_write(lp, fp, format, prog_text); check_write_ok(fp, outfile); (void)(*closefile)(fp); /* We do not need the translation table for human readable format * Has to be written after the LP file, so the scaling has been done. */ if (format != LP_FORM_HUM) { /* Write translation table */ sprintf(outpipe, filter, tblfile, "tbl"); if (verbose >= VERB_NORMAL) printf("Writing [%s]\n", outpipe); if (NULL == (fp = (*openfile)(outpipe, "w"))) { fprintf(stderr, "*** Error 104: File open failed"); perror(tblfile); exit(EXIT_FAILURE); } zlp_transtable(lp, fp, format); check_write_ok(fp, tblfile); (void)(*closefile)(fp); } free(prog_text); if (verbose >= VERB_DEBUG) symbol_print_all(stderr); #if defined(__INSURE__) || !defined(NDEBUG) || defined(FREEMEM) /* Now clean up. */ if (inppipe != NULL) free(inppipe); for(i = 0; i < param_count; i++) free(param_table[i]); free(param_table); prog_free(prog); local_exit(); interns_exit(); xlp_free(lp); mio_exit(); symbol_exit(); define_exit(); set_exit(); elem_exit(); numb_exit(); str_exit(); blk_exit(); free(mstfile); free(ordfile); free(outfile); free(tblfile); free(basefile); free(filter); free(outpipe); if (verbose >= VERB_NORMAL) { mem_display(stdout); stkchk_maximum(stdout); } #endif /* __INSURE__ || !NDEBUG || FREEMEM */ return 0; } zimpl-3.3.6/src/zimpl/heap.h0000644001417200060250000000522513304236715015575 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: heap.h */ /* Name....: Heap Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2006-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _HEAP_H_ #define _HEAP_H_ #ifndef _ENTRY_H_ #error "Need to include entry.h before heap.h" #endif #ifdef __cplusplus extern "C" { #endif union heap_data { Entry* entry; }; typedef struct heap Heap; typedef union heap_data HeapData; typedef int (*HeapCmp)(HeapData, HeapData); /*lint -sem( heap_new_entry, 1n > 0 && 2p == 1, @P > malloc(1P)) */ extern Heap* heap_new_entry(int size, HeapCmp entry_cmp); /*lint -sem( heap_free, 1p == 1) */ extern void heap_free(Heap* heap); /*lint -sem( heap_is_valid, 1p == 1) */ extern bool heap_is_valid(const Heap* heap); /*lint -sem( heap_push_entry, 1p == 1 && 2p == 1) */ extern void heap_push_entry(Heap* heap, Entry* entry); /*lint -sem( heap_pop_entry, 1p == 1, @P > malloc(1P)) */ extern Entry* heap_pop_entry(Heap* heap); /*lint -sem( heap_top_entry, 1p == 1, @P > malloc(1P)) */ extern const Entry* heap_top_entry(const Heap* heap); /*lint -sem( heap_is_full, 1p == 1) */ extern bool heap_is_full(const Heap* heap); /*lint -sem( heap_is_empty, 1p == 1) */ extern bool heap_is_empty(const Heap* heap); #ifdef __cplusplus } #endif #endif /* _HEAP_H_ */ zimpl-3.3.6/src/zimpl/xlpglue.h0000644001417200060250000000673113304236715016343 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: xlpglue.h */ /* Name....: Glue between numb/term and ratlp */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _XLPGLUE_H_ #define _XLPGLUE_H_ #ifndef _RATLPTYPES_H_ #error "Need to include ratlptypes.h before xlpglue.h" #endif #ifndef _MME_H_ #error "Need to include mme.h before xlpglue.h" #endif #ifdef __cplusplus extern "C" { #endif /*lint -sem( xlp_alloc, nulterm(1) && 1p, @p) */ extern Lps* xlp_alloc(const char* name, bool need_startval, void* user_data); /*lint -sem( xlp_free, 1p == 1) */ extern void xlp_free(Lps* lp); /*lint -sem( xlp_conname, nulterm(1), 1p == 1 && 2p && nulterm(2)) */ extern bool xlp_conname_exists(const Lps* lp, const char* conname); /*lint -sem( xlp_addcon_term, 1p == 1 && nulterm(2) && 2p && 4p == 1 && 5p == 1 && 7p == 1) */ extern bool xlp_addcon_term(Lps* lp, const char* name, ConType type, const Numb* lhs, const Numb* rhs, unsigned int flags, const Term* term); /*lint -sem( xlp_addvar, 1p == 1 && nulterm(2) && 2p && 4p == 1 && 5p == 1 && 6p == 1 && 7p == 1, @p) */ extern Var* xlp_addvar(Lps* lp, const char* name, VarClass usevarclass, const Bound* lower, const Bound* upper, const Numb* priority, const Numb* startval); /*lint -sem( xlp_addsos, 1p == 1 && nulterm(2) && 2p && 4p == 1 && 5p == 1, @p) */ extern int xlp_addsos_term(Lps* lp, const char* name, SosType type, const Numb* priority, const Term* term); /*lint -sem( xlp_getvarname, 1p == 1 && 2p == 1, @p) */ const char* xlp_getvarname(const Lps* lp, const Var* var); /*lint -sem( xlp_getclass, 1p == 1 && 2p == 1) */ extern VarClass xlp_getclass(const Lps* lp, const Var* var); /*lint -sem( xlp_getlower, 1p == 1 && 2p == 1, @p) */ extern Bound* xlp_getlower(const Lps* lp, const Var* var); /*lint -sem( xlp_getupper, 1p == 1, @p) */ extern Bound* xlp_getupper(const Lps* lp, const Var* var); /*lint -sem( xlp_objname, 1p == 1 && nulterm(2) && 2p) */ extern bool xlp_setobj(Lps* lp, const char* name, bool minimize); /*lint -sem( xlp_addtocost, 1p == 1 && 2p == 1 && 3p == 1) */ extern void xlp_addtocost(Lps* lp, Var* var, const Numb* cost); #ifdef __cplusplus } #endif #endif /* _XLPGLUE_H */ zimpl-3.3.6/src/zimpl/mmlscan.l0000644001417200060250000003412613304236715016320 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mmlscan.l */ /* Name....: MML Lexcal Analyser */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ %{ #pragma clang diagnostic ignored "-Wsign-conversion" #pragma clang diagnostic ignored "-Wconversion" #pragma clang diagnostic ignored "-Wmissing-prototypes" #pragma clang diagnostic ignored "-Wunused-macros" #pragma clang diagnostic ignored "-Wmissing-noreturn" #pragma clang diagnostic ignored "-Wunneeded-internal-declaration" #pragma GCC diagnostic ignored "-Wmissing-prototypes" #pragma GCC diagnostic ignored "-Wsign-compare" /*lint -e527 -e835 -e717 */ #include #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/stmt.h" #include "zimpl/strstore.h" #include "zimpl/mmlparse2.h" extern void yyerror(const char* s); #define YY_DECL int yylex(YYSTYPE* lval) YY_DECL; static int yycolumn = 0; static int yydecl = 0; %} %option noyylineno %option never-interactive %option noyywrap %option noyymore %option noreject %option nounput %pointer %% "**"|"^" { yycolumn += yyleng; return POW; } ":=" { yycolumn += yyleng; return ASGN; } "==" { yycolumn += yyleng; return CMP_EQ; } "<=" { yycolumn += yyleng; return CMP_LE; } ">=" { yycolumn += yyleng; return CMP_GE; } "<" { yycolumn += yyleng; return CMP_LT; } ">" { yycolumn += yyleng; return CMP_GT; } "!=" { yycolumn += yyleng; return CMP_NE; } "!" { yycolumn += yyleng; return FAC; } "not" { yycolumn += yyleng; return NOT; } "and" { yycolumn += yyleng; return AND; } "or" { yycolumn += yyleng; return OR; } "xor" { yycolumn += yyleng; return XOR; } "set" { yycolumn += yyleng; yydecl = DECLSET; return DECLSET; } "param" { yycolumn += yyleng; yydecl = DECLPAR; return DECLPAR; } "var" { yycolumn += yyleng; yydecl = DECLVAR; return DECLVAR; } "maximize" { yycolumn += yyleng; yydecl = DECLMAX; return DECLMAX; } "minimize" { yycolumn += yyleng; yydecl = DECLMIN; return DECLMIN; } "subto" { yycolumn += yyleng; yydecl = DECLSUB; return DECLSUB; } "sos" { yycolumn += yyleng; yydecl = DECLSOS; return DECLSOS; } "defnumb" { yycolumn += yyleng; yydecl = DEFNUMB; return DEFNUMB; } "defstrg" { yycolumn += yyleng; yydecl = DEFSTRG; return DEFSTRG; } "defbool" { yycolumn += yyleng; yydecl = DEFBOOL; return DEFBOOL; } "defset" { yycolumn += yyleng; yydecl = DEFSET; return DEFSET; } "in" { yycolumn += yyleng; return IN; } "with"|"|" { yycolumn += yyleng; return WITH; } "do"|":" { yycolumn += yyleng; return DO; } "binary" { yycolumn += yyleng; return BINARY; } "integer" { yycolumn += yyleng; return INTEGER; } "real" { yycolumn += yyleng; return REAL; } "sum" { yycolumn += yyleng; return SUM; } "prod" { yycolumn += yyleng; return PROD; } "forall" { yycolumn += yyleng; return FORALL; } "exists" { yycolumn += yyleng; return EXISTS; } "vif" { yycolumn += yyleng; return VIF; } "if" { yycolumn += yyleng; return IF; } "then" { yycolumn += yyleng; return THEN; } "else" { yycolumn += yyleng; return ELSE; } "end" { yycolumn += yyleng; return END; } "to" { yycolumn += yyleng; return TO; } ".." { yycolumn += yyleng; return UNTIL; } "by" { yycolumn += yyleng; return BY; } "union" { yycolumn += yyleng; return UNION; } "inter" { yycolumn += yyleng; return INTER; } "symdiff" { yycolumn += yyleng; return SYMDIFF; } "cross" { yycolumn += yyleng; return CROSS; } "proj" { yycolumn += yyleng; return PROJ; } "without"|"\\" { yycolumn += yyleng; return WITHOUT; } "mod"|"modulo" { yycolumn += yyleng; return MOD; } "div" { yycolumn += yyleng; return DIV; } "min" { yycolumn += yyleng; return MIN; } "max" { yycolumn += yyleng; return MAX; } "argmin" { yycolumn += yyleng; return ARGMIN; } "argmax" { yycolumn += yyleng; return ARGMAX; } "read" { yycolumn += yyleng; return READ; } "as" { yycolumn += yyleng; return AS; } "skip" { yycolumn += yyleng; return SKIP; } "use" { yycolumn += yyleng; return USE; } "comment" { yycolumn += yyleng; return COMMENT; } "scale" { yycolumn += yyleng; return SCALE; } "separate" { yycolumn += yyleng; return SEPARATE; } "checkonly" { yycolumn += yyleng; return CHECKONLY; } "indicator" { yycolumn += yyleng; return INDICATOR; } "card" { yycolumn += yyleng; return CARD; } "abs" { yycolumn += yyleng; return ABS; } "vabs" { yycolumn += yyleng; return VABS; } "sgn" { yycolumn += yyleng; return SGN; } "round" { yycolumn += yyleng; return ROUND; } "floor" { yycolumn += yyleng; return FLOOR; } "ceil" { yycolumn += yyleng; return CEIL; } "log" { yycolumn += yyleng; return LOG; } "ln" { yycolumn += yyleng; return LN; } "exp" { yycolumn += yyleng; return EXP; } "sqrt" { yycolumn += yyleng; return SQRT; } "sin" { yycolumn += yyleng; return SIN; } "cos" { yycolumn += yyleng; return COS; } "tan" { yycolumn += yyleng; return TAN; } "asin" { yycolumn += yyleng; return ASIN; } "acos" { yycolumn += yyleng; return ACOS; } "atan" { yycolumn += yyleng; return ATAN; } "pow" { yycolumn += yyleng; return POWER; } "sgnpow" { yycolumn += yyleng; return SGNPOW; } "priority" { yycolumn += yyleng; return PRIORITY; } "startval" { yycolumn += yyleng; return STARTVAL; } "default" { yycolumn += yyleng; return DEFAULT; } "subsets" { yycolumn += yyleng; return SUBSETS; } "powerset" { yycolumn += yyleng; return POWERSET; } "indexset" { yycolumn += yyleng; return INDEXSET; } "print" { yycolumn += yyleng; return PRINT; } "check" { yycolumn += yyleng; return CHECK; } "infinity" { yycolumn += yyleng; return INFTY; } "random" { yycolumn += yyleng; return RANDOM; } "ord" { yycolumn += yyleng; return ORD; } "type1" { yycolumn += yyleng; return TYPE1; } "type2" { yycolumn += yyleng; return TYPE2; } "implicit" { yycolumn += yyleng; return IMPLICIT; } "length" { yycolumn += yyleng; return LENGTH; } "substr" { yycolumn += yyleng; return SUBSTR; } "match" { yycolumn += yyleng; return MATCH; } [0-9]+("."[0-9]+)?([eEdD][-+]?[0-9]+)? { yycolumn += yyleng; lval->numb = numb_new_ascii(yytext); /* sscanf(yytext, "%lf", &lval->numb);*/ return NUMB; } "."[0-9]+([eEdD][-+]-?[0-9]+)? { yycolumn += yyleng; lval->numb = numb_new_ascii(yytext); /* sscanf(yytext, "%lf", &lval->numb);*/ return NUMB; } [A-Za-z_][A-Za-z0-9_]* { Symbol* sym; Define* def; char errmsg[256]; int what; yycolumn += yyleng; /* If it is sure that this is the name for a constraint or * objective, or sos, we do not need to lookup the name. */ if (yydecl == DECLSUB || yydecl == DECLMIN || yydecl == DECLMAX || yydecl == DECLSOS) yydecl = 0; /* If it is sure that this is the name for a set, param or var * we check only if the name is unused and otherwise give * an appropriate error message. */ else if (yydecl == DECLSET || yydecl == DECLPAR || yydecl == DECLVAR || yydecl == DEFNUMB || yydecl == DEFSTRG || yydecl == DEFBOOL || yydecl == DEFSET) { if (NULL != symbol_lookup(yytext) || NULL != define_lookup(yytext)) { /* Allow to declare parameter on the command line and ignore the * redeclarations in the zimpl code later on */ if (yydecl == DECLPAR) { extern void yywarning(int no, const char* s); sprintf(errmsg, "Redefinition of parameter %s ignored\n", yytext); yywarning(252, errmsg); yydecl = 0; return EOF; } sprintf(errmsg, "Name \"%s\" already in use\n", yytext); yyerror(errmsg); } what = yydecl; yydecl = 0; /* if this is a define, we have to install it here, * so that recursive call succseed. */ switch(what) { case DEFNUMB : lval->def = define_new(str_new(yytext), DEF_NUMB); return DEFNAME; case DEFSTRG : lval->def = define_new(str_new(yytext), DEF_STRG); return DEFNAME; case DEFBOOL : lval->def = define_new(str_new(yytext), DEF_BOOL); return DEFNAME; case DEFSET : lval->def = define_new(str_new(yytext), DEF_SET); return DEFNAME; default : break; } } else { assert(yydecl == 0); if (NULL != (sym = symbol_lookup(yytext))) { lval->sym = sym; switch(symbol_get_type(sym)) { case SYM_NUMB : return NUMBSYM; case SYM_STRG : return STRGSYM; case SYM_VAR : return VARSYM; case SYM_SET : return SETSYM; case SYM_ERR : /* should not happen */ sprintf(errmsg, "Symbol \"%s\" not initialised\n", yytext); yyerror(errmsg); default : abort(); } } if (NULL != (def = define_lookup(yytext))) { lval->def = def; switch(define_get_type(def)) { case DEF_NUMB : return NUMBDEF; case DEF_STRG : return STRGDEF; case DEF_BOOL : return BOOLDEF; case DEF_SET : return SETDEF; case DEF_ERR : /* should not happen */ sprintf(errmsg, "Define \"%s\" not initialised\n", yytext); yyerror(errmsg); default : abort(); } } } lval->name = str_new(yytext); return NAME; } \"[^\"]*\" { yycolumn += yyleng; yytext[strlen(yytext) - 1] = '\0'; lval->strg = str_new(yytext + 1); return STRG; } \'[^\']*\' { yycolumn += yyleng; yytext[strlen(yytext) - 1] = '\0'; lval->strg = str_new(yytext + 1); return STRG; } [[:space:]]+ { yycolumn += yyleng; } . { yycolumn += yyleng; return *yytext; } <> { yycolumn += yyleng; return EOF; } %% static const Stmt* yystmt = NULL; void yyerror(const char* s) { fprintf(stderr, "*** Error 800: File %s Line %d : %s\n", stmt_get_filename(yystmt), stmt_get_lineno(yystmt), s); show_source(stderr, stmt_get_text(yystmt), yycolumn); zpl_exit(EXIT_FAILURE); } void yywarning(int no, const char* s) { if (stmt_trigger_warning(no)) fprintf(stderr, "*** Warning %d: File %s Line %d : %s\n", no, stmt_get_filename(yystmt), stmt_get_lineno(yystmt), s); } const Stmt* scan_get_stmt(void) { return yystmt; } int scan_get_column(void) { return yycolumn; } void parse_stmt(const Stmt* stmt) { YY_BUFFER_STATE state; yy_delete_buffer(YY_CURRENT_BUFFER); yystmt = stmt; yycolumn = 0; state = yy_scan_string(stmt_get_text(stmt)); if (yyparse() != 0) { fprintf(stderr, "*** Error 801: Parser failed\n"); zpl_exit(EXIT_FAILURE); } yy_delete_buffer(state); } zimpl-3.3.6/src/zimpl/hash.c0000644001417200060250000002262613304236715015602 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: hash.c */ /* Name....: Hash Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/blkmem.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/mono.h" #include "zimpl/hash.h" #define HASH_SID 0x48617368 typedef struct hash_element HElem; typedef struct set_elem_idx SetElemIdx; struct set_elem_idx { const Elem* elem; int idx; }; struct hash_element { union { const Tuple* tuple; const Entry* entry; SetElemIdx elem_idx; const Numb* numb; const Mono* mono; } value; HElem* next; }; struct hash { SID unsigned int size; int elems; HashType type; HElem** bucket; }; static void hash_statist(FILE* fp, const Hash* hash); static bool hash_is_valid(const Hash* hash) { return ((hash != NULL) && (hash->type == HASH_TUPLE || hash->type == HASH_ENTRY || hash->type == HASH_ELEM_IDX || hash->type == HASH_NUMB || hash->type == HASH_MONO) && SID_ok(hash, HASH_SID)); } Hash* hash_new(HashType type, int size) { static const unsigned int bucket_size[] = { 53U, 103U, 503U, 1009U, 5003U, 10007U, 50021U, 100003U, 500009U, 1000003U, 5000011U, 10000019U, 50000017U, 0U }; Hash* hash = calloc(1, sizeof(*hash)); int i; assert(hash != NULL); assert(size >= 0); /* This is a linear search, but if the number of elements is large, * it will hardly matter ;-) */ for(i = 0; bucket_size[i] < (unsigned int)size && bucket_size[i + 1] != 0; i++) ; hash->size = bucket_size[i]; assert(hash->size > 11); hash->elems = 0; hash->type = type; hash->bucket = calloc(hash->size, sizeof(*hash->bucket)); assert(hash->bucket != NULL); SID_set(hash, HASH_SID); assert(hash_is_valid(hash)); return hash; } void hash_free(Hash* hash) { HElem* he; HElem* hq; unsigned int i; assert(hash_is_valid(hash)); if (verbose >= VERB_CHATTER) hash_statist(stderr, hash); SID_del(hash); for(i = 0; i < hash->size; i++) { for(he = hash->bucket[i]; he != NULL; he = hq) { hq = he->next; blk_free(he, sizeof(*he)); } } free(hash->bucket); free(hash); } void hash_add_tuple(Hash* hash, const Tuple* tuple) { HElem* he = blk_alloc(sizeof(*he)); unsigned int hcode; assert(hash_is_valid(hash)); assert(tuple_is_valid(tuple)); assert(hash->type == HASH_TUPLE); assert(he != NULL); hcode = tuple_hash(tuple) % hash->size; he->value.tuple = tuple; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; } void hash_add_entry(Hash* hash, const Entry* entry) { HElem* he = blk_alloc(sizeof(*he)); const Tuple* tuple; unsigned int hcode; assert(hash_is_valid(hash)); assert(entry_is_valid(entry)); assert(hash->type == HASH_ENTRY); assert(he != NULL); tuple = entry_get_tuple(entry); hcode = tuple_hash(tuple) % hash->size; he->value.entry = entry; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; } void hash_add_numb(Hash* hash, const Numb* numb) { HElem* he = blk_alloc(sizeof(*he)); unsigned int hcode; assert(hash_is_valid(hash)); assert(numb_is_valid(numb)); assert(hash->type == HASH_NUMB); assert(he != NULL); hcode = numb_hash(numb) % hash->size; he->value.numb = numb; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; } void hash_add_mono(Hash* hash, const Mono* mono) { HElem* he = blk_alloc(sizeof(*he)); unsigned int hcode; assert(hash_is_valid(hash)); assert(mono_is_valid(mono)); assert(hash->type == HASH_MONO); assert(he != NULL); hcode = mono_hash(mono) % hash->size; he->value.mono = mono; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; } bool hash_has_tuple(const Hash* hash, const Tuple* tuple) { unsigned int hcode = tuple_hash(tuple) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(tuple_is_valid(tuple)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!tuple_cmp(he->value.tuple, tuple)) break; return he != NULL; } bool hash_has_entry(const Hash* hash, const Tuple* tuple) { unsigned int hcode = tuple_hash(tuple) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(tuple_is_valid(tuple)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!entry_cmp(he->value.entry, tuple)) break; return he != NULL; } bool hash_has_numb(const Hash* hash, const Numb* numb) { unsigned int hcode = numb_hash(numb) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(numb_is_valid(numb)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (numb_equal(he->value.numb, numb)) break; return he != NULL; } /* Liefert NULL wenn nicht gefunden. */ const Entry* hash_lookup_entry(const Hash* hash, const Tuple* tuple) { unsigned int hcode = tuple_hash(tuple) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(tuple_is_valid(tuple)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!entry_cmp(he->value.entry, tuple)) break; if (he == NULL) return NULL; assert(he != NULL); assert(entry_is_valid(he->value.entry)); return he->value.entry; } /* Liefert NULL wenn nicht gefunden. */ const Mono* hash_lookup_mono(const Hash* hash, const Mono* mono) { unsigned int hcode = mono_hash(mono) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(mono_is_valid(mono)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (mono_equal(he->value.mono, mono)) break; if (he == NULL) return NULL; assert(he != NULL); assert(mono_is_valid(he->value.mono)); return he->value.mono; } void hash_add_elem_idx(Hash* hash, const Elem* elem, int idx) { HElem* he = blk_alloc(sizeof(*he)); unsigned int hcode; assert(hash_is_valid(hash)); assert(elem_is_valid(elem)); assert(he != NULL); hcode = elem_hash(elem) % hash->size; he->value.elem_idx.elem = elem; he->value.elem_idx.idx = idx; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; } /* Liefert -1 wenn nicht gefunden. */ int hash_lookup_elem_idx(const Hash* hash, const Elem* elem) { unsigned int hcode = elem_hash(elem) % hash->size; HElem* he; assert(hash_is_valid(hash)); assert(elem_is_valid(elem)); for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!elem_cmp(he->value.elem_idx.elem, elem)) break; if (he == NULL) return -1; assert(he != NULL); return he->value.elem_idx.idx; } static void hash_statist(FILE* fp, const Hash* hash) { HElem* he; int min = (int)hash->size; int max = 0; int sum = 0; int zeros = 0; int filled = 0; double avg = 0.0; unsigned int i; assert(fp != NULL); assert(hash_is_valid(hash)); for(i = 0; i < hash->size; i++) { int count = 0; for(he = hash->bucket[i]; he != NULL; he = he->next) count++; if (count == 0) zeros++; else filled++; if (count < min) min = count; if (count > max) max = count; sum += count; } assert(sum == hash->elems); if (filled > 0) avg = (double)sum / (double)filled; fprintf(fp, "HashStat: size=%8u sum=%6d min=%3d max=%3d avg=%4.1f zero=%6d filled=%6d\n", hash->size, sum, min, max, avg, zeros, filled); } zimpl-3.3.6/src/zimpl/code.c0000644001417200060250000006017513304236715015572 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: code.c */ /* Name....: Code Node Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/stkchk.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/idxset.h" #include "zimpl/rdefpar.h" #include "zimpl/bound.h" #include "zimpl/define.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/list.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/code.h" #include "zimpl/inst.h" typedef union code_value CodeValue; union code_value { Numb* numb; const char* strg; const char* name; Tuple* tuple; Set* set; Term* term; Entry* entry; IdxSet* idxset; bool bval; int size; List* list; VarClass varclass; ConType contype; RDef* rdef; RPar* rpar; unsigned int bits; Symbol* sym; Define* def; Bound* bound; }; #define MAX_CHILDS 8 struct code_node { SID CodeType type; Inst eval; CodeValue value; CodeNode* child[MAX_CHILDS]; const Stmt* stmt; int column; }; #define CODE_SID 0x436f6465 static CodeNode* root = NULL; static unsigned int inst_count = 0; inline bool code_is_valid(const CodeNode* node) { return ((node != NULL) && SID_ok(node, CODE_SID)); } CodeNode* code_new_inst(Inst inst, int childs, ...) { va_list ap; CodeNode* node = calloc(1, sizeof(*node)); int i; CodeNode* child; assert(inst != INST_NULL); assert(node != NULL); assert(childs <= MAX_CHILDS); node->type = CODE_ERR; /* call to eval() will set this */ node->eval = inst; /* Das sollte eigendlich ein parameter sein, aber wozu bei jedem * code_new diese Funktionen mit uebergeben. */ node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); /*lint -save -e826 */ va_start(ap, childs); for(i = 0; i < childs; i++) { child = va_arg(ap, CodeNode*); assert((child == NULL) || code_is_valid(child)); node->child[i] = child; } va_end(ap); /*lint -restore */ return node; } /* We eat the numb, i.e. we will free it! */ CodeNode* code_new_numb(Numb* numb) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_NUMB; node->eval = i_nop; node->value.numb = numb; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_strg(const char* strg) { CodeNode* node = calloc(1, sizeof(*node)); assert(strg != NULL); assert(node != NULL); node->type = CODE_STRG; node->eval = i_nop; node->value.strg = strg; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_name(const char* name) { CodeNode* node = calloc(1, sizeof(*node)); assert(name != NULL); assert(node != NULL); node->type = CODE_NAME; node->eval = i_nop; node->value.name = name; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_size(int size) { CodeNode* node = calloc(1, sizeof(*node)); assert(size >= 0); assert(node != NULL); node->type = CODE_SIZE; node->eval = i_nop; node->value.size = size; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_varclass(VarClass varclass) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_VARCLASS; node->eval = i_nop; node->value.varclass = varclass; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_contype(ConType contype) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_CONTYPE; node->eval = i_nop; node->value.contype = contype; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_bits(unsigned int bits) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_BITS; node->eval = i_nop; node->value.bits = bits; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_symbol(Symbol* sym) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_SYM; node->eval = i_nop; node->value.sym = sym; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } CodeNode* code_new_define(Define* def) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); node->type = CODE_DEF; node->eval = i_nop; node->value.def = def; node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } /* We eat the bound, i.e. we will free it! */ CodeNode* code_new_bound(BoundType type) { CodeNode* node = calloc(1, sizeof(*node)); assert(node != NULL); assert(type == BOUND_INFTY || type == BOUND_MINUS_INFTY); node->type = CODE_BOUND; node->eval = i_nop; node->value.bound = bound_new(type, NULL); node->stmt = scan_get_stmt(); node->column = scan_get_column(); SID_set(node, CODE_SID); assert(code_is_valid(node)); return node; } void code_free_value(CodeNode* node) { assert(code_is_valid(node)); switch(node->type) { case CODE_ERR : case CODE_VOID : /* Kann passieren, wenn bei code_value_() ein bis dahin unbenutzter * Knoten verwendet wird. */ break; case CODE_NUMB : assert(node->value.numb != NULL); numb_free(node->value.numb); break; case CODE_STRG : case CODE_NAME : break; case CODE_TUPLE : assert(node->value.tuple != NULL); tuple_free(node->value.tuple); node->value.tuple = NULL; node->type = CODE_ERR; break; case CODE_SET : assert(node->value.set != NULL); set_free(node->value.set); node->value.set = NULL; node->type = CODE_ERR; break; case CODE_TERM : assert(node->value.term != NULL); term_free(node->value.term); node->value.term = NULL; node->type = CODE_ERR; break; case CODE_ENTRY : assert(node->value.entry != NULL); entry_free(node->value.entry); node->value.entry = NULL; node->type = CODE_ERR; break; case CODE_IDXSET : assert(node->value.idxset != NULL); idxset_free(node->value.idxset); node->value.entry = NULL; node->type = CODE_ERR; break; case CODE_BOOL : case CODE_SIZE : break; case CODE_LIST : assert(node->value.list != NULL); list_free(node->value.list); node->value.list = NULL; node->type = CODE_ERR; break; case CODE_VARCLASS : case CODE_CONTYPE : break; case CODE_RDEF : assert(node->value.rdef != NULL); rdef_free(node->value.rdef); node->value.rdef = NULL; node->type = CODE_ERR; break; case CODE_RPAR : assert(node->value.rpar != NULL); rpar_free(node->value.rpar); node->value.rpar = NULL; node->type = CODE_ERR; break; case CODE_BITS : break; case CODE_SYM : break; case CODE_DEF : break; case CODE_BOUND : assert(node->value.bound != NULL); bound_free(node->value.bound); break; default : abort(); } } void code_free(CodeNode* node) { int i; for(i = 0; i < MAX_CHILDS; i++) if (node->child[i] != NULL) code_free(node->child[i]); code_free_value(node); free(node); } void code_set_child(CodeNode* node, int idx, CodeNode* child) { assert(code_is_valid(node)); assert(idx >= 0); assert(idx < MAX_CHILDS); assert(child != NULL); node->child[idx] = child; } CodeType code_get_type(const CodeNode* node) { assert(code_is_valid(node)); return node->type; } Inst code_get_inst(const CodeNode* node) { assert(code_is_valid(node)); return node->eval; } void code_set_root(CodeNode* node) { assert(code_is_valid(node)); root = node; } CodeNode* code_get_root(void) { return root; } unsigned int code_get_inst_count() { return inst_count; } void code_clear_inst_count() { inst_count = 0; } static inline CodeNode* code_check_type(CodeNode* node, CodeType expected) { static const char* const tname[] = { "Error", "Number", "String", "Name", "Tuple", "Set", "Term", "Bool", "Size", "IndexSet", "List", "Nothing", "Entry", "VarClass", "ConType", "ReadDefinition", "ReadParameter", "BitFlag", "Symbol", "Define", "Bound" }; assert(code_is_valid(node)); assert(sizeof(tname) / sizeof(tname[0]) > (size_t)node->type); if (node->type != expected) { assert(sizeof(tname) / sizeof(tname[0]) > (size_t)expected); fprintf(stderr, "*** Error 159: Type error, expected %s got %s\n", tname[expected], tname[node->type]); code_errmsg(node); zpl_exit(EXIT_FAILURE); } return node; } void code_errmsg(const CodeNode* node) { fprintf(stderr, "*** File: %s Line %d\n", stmt_get_filename(node->stmt), stmt_get_lineno(node->stmt)); show_source(stderr, stmt_get_text(node->stmt), node->column); if (verbose >= VERB_CHATTER) local_print_all(stderr); } inline CodeNode* code_eval(CodeNode* node) { assert(code_is_valid(node)); inst_count++; stkchk_used(); // record maximum stack use return (*node->eval)(node); } bool code_prune_tree(CodeNode* node) { static Inst const prunable[] = { i_expr_abs, i_expr_sgn, i_expr_add, i_expr_card, i_expr_ceil, i_expr_div, i_expr_exp, i_expr_sqrt, i_expr_fac, i_expr_floor, i_expr_if_else, i_expr_intdiv, i_expr_length, i_expr_ln, i_expr_log, i_expr_ord, i_expr_prod, i_expr_round, i_expr_sum, i_expr_max, i_expr_max2, i_expr_sglmax, i_expr_min, i_expr_min2, i_expr_sglmin, i_expr_mul, i_expr_mod, i_expr_neg, i_expr_pow, i_expr_sub, i_expr_substr, NULL }; bool is_all_const = true; int i; if (node->eval == (Inst)i_nop) return true; for(i = 0; i < MAX_CHILDS; i++) { if (node->child[i] != NULL) { bool is_const = code_prune_tree(node->child[i]); /* Writing directly && code_prune_tree might not work * due to shortcut evaluation. */ is_all_const = is_all_const && is_const; } } if (is_all_const) { for(i = 0; prunable[i] != INST_NULL; i++) if (prunable[i] == node->eval) break; if (prunable[i] == INST_NULL) return false; (void)code_eval(node); for(i = 0; i < MAX_CHILDS; i++) { if (node->child[i] != NULL) { code_free(node->child[i]); node->child[i] = NULL; } } node->eval = i_nop; } return is_all_const; } /* ---------------------------------------------------------------------------- * Get Funktionen * ---------------------------------------------------------------------------- */ inline CodeNode* code_get_child(const CodeNode* node, int no) { assert(code_is_valid(node)); assert(no >= 0); assert(no < MAX_CHILDS); assert(node->child[no] != NULL); return node->child[no]; } inline const Numb* code_get_numb(CodeNode* node) { return code_check_type(node, CODE_NUMB)->value.numb; } inline const char* code_get_strg(CodeNode* node) { return code_check_type(node, CODE_STRG)->value.strg; } inline const char* code_get_name(CodeNode* node) { return code_check_type(node, CODE_NAME)->value.name; } inline const Tuple* code_get_tuple(CodeNode* node) { return code_check_type(node, CODE_TUPLE)->value.tuple; } inline const Set* code_get_set(CodeNode* node) { return code_check_type(node, CODE_SET)->value.set; } inline const IdxSet* code_get_idxset(CodeNode* node) { return code_check_type(node, CODE_IDXSET)->value.idxset; } inline const Entry* code_get_entry(CodeNode* node) { return code_check_type(node, CODE_ENTRY)->value.entry; } inline const Term* code_get_term(CodeNode* node) { return code_check_type(node, CODE_TERM)->value.term; } inline int code_get_size(CodeNode* node) { return code_check_type(node, CODE_SIZE)->value.size; } inline bool code_get_bool(CodeNode* node) { return code_check_type(node, CODE_BOOL)->value.bval; } inline const List* code_get_list(CodeNode* node) { return code_check_type(node, CODE_LIST)->value.list; } inline VarClass code_get_varclass(CodeNode* node) { return code_check_type(node, CODE_VARCLASS)->value.varclass; } inline ConType code_get_contype(CodeNode* node) { return code_check_type(node, CODE_CONTYPE)->value.contype; } inline const RDef* code_get_rdef(CodeNode* node) { return code_check_type(node, CODE_RDEF)->value.rdef; } inline const RPar* code_get_rpar(CodeNode* node) { return code_check_type(node, CODE_RPAR)->value.rpar; } inline unsigned int code_get_bits(CodeNode* node) { return code_check_type(node, CODE_BITS)->value.bits; } inline Symbol* code_get_symbol(CodeNode* node) { return code_check_type(node, CODE_SYM)->value.sym; } inline Define* code_get_define(CodeNode* node) { return code_check_type(node, CODE_DEF)->value.def; } inline const Bound* code_get_bound(CodeNode* node) { return code_check_type(node, CODE_BOUND)->value.bound; } /* ---------------------------------------------------------------------------- * Value Funktionen * ---------------------------------------------------------------------------- */ void code_value_numb(CodeNode* node, Numb* numb) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_NUMB; node->value.numb = numb; } void code_value_strg(CodeNode* node, const char* strg) { assert(code_is_valid(node)); assert(strg != NULL); code_free_value(node); node->type = CODE_STRG; node->value.strg = strg; } void code_value_name(CodeNode* node, const char* name) { assert(code_is_valid(node)); assert(name != NULL); code_free_value(node); node->type = CODE_NAME; node->value.name = name; } void code_value_tuple(CodeNode* node, Tuple* tuple) { assert(code_is_valid(node)); assert(tuple_is_valid(tuple)); code_free_value(node); node->type = CODE_TUPLE; node->value.tuple = tuple; } void code_value_set(CodeNode* node, Set* set) { assert(code_is_valid(node)); assert(set_is_valid(set)); code_free_value(node); node->type = CODE_SET; node->value.set = set; } void code_value_idxset(CodeNode* node, IdxSet* idxset) { assert(code_is_valid(node)); assert(idxset_is_valid(idxset)); code_free_value(node); node->type = CODE_IDXSET; node->value.idxset = idxset; } void code_value_entry(CodeNode* node, Entry* entry) { assert(code_is_valid(node)); assert(entry_is_valid(entry)); code_free_value(node); node->type = CODE_ENTRY; node->value.entry = entry; } void code_value_term(CodeNode* node, Term* term) { assert(code_is_valid(node)); assert(term_is_valid(term)); code_free_value(node); node->type = CODE_TERM; node->value.term = term; } Term* code_value_steal_term(CodeNode* node, int no) { CodeNode* child = code_get_child(node, no); assert(code_is_valid(node)); assert(code_get_type(child) == CODE_TERM); code_free_value(node); node->type = CODE_TERM; node->value.term = child->value.term; child->type = CODE_ERR; child->value.term = NULL; return node->value.term; } void code_value_bool(CodeNode* node, bool bval) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_BOOL; node->value.bval = bval; } void code_value_size(CodeNode* node, int size) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_SIZE; node->value.size = size; } void code_value_list(CodeNode* node, List* list) { assert(code_is_valid(node)); assert(list_is_valid(list)); code_free_value(node); node->type = CODE_LIST; node->value.list = list; } void code_value_varclass(CodeNode* node, VarClass varclass) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_VARCLASS; node->value.varclass = varclass; } void code_value_contype(CodeNode* node, ConType contype) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_CONTYPE; node->value.contype = contype; } void code_value_rdef(CodeNode* node, RDef* rdef) { assert(code_is_valid(node)); assert(rdef_is_valid(rdef)); code_free_value(node); node->type = CODE_RDEF; node->value.rdef = rdef; } void code_value_rpar(CodeNode* node, RPar* rpar) { assert(code_is_valid(node)); assert(rpar_is_valid(rpar)); code_free_value(node); node->type = CODE_RPAR; node->value.rpar = rpar; } void code_value_bits(CodeNode* node, unsigned int bits) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_BITS; node->value.bits = bits; } void code_value_bound(CodeNode* node, Bound* bound) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_BOUND; node->value.bound = bound; } void code_value_void(CodeNode* node) { assert(code_is_valid(node)); code_free_value(node); node->type = CODE_VOID; } void code_copy_value(CodeNode* dst, const CodeNode* src) { assert(code_is_valid(dst)); assert(code_is_valid(src)); code_free_value(dst); switch(src->type) { case CODE_NUMB : dst->value.numb = numb_copy(src->value.numb); break; case CODE_STRG : dst->value.strg = src->value.strg; break; case CODE_NAME : dst->value.name = src->value.name; break; case CODE_TUPLE: dst->value.tuple = tuple_copy(src->value.tuple); break; case CODE_SET : dst->value.set = set_copy(src->value.set); break; case CODE_IDXSET : dst->value.idxset = idxset_copy(src->value.idxset); break; case CODE_ENTRY : dst->value.entry = entry_copy(src->value.entry); break; case CODE_TERM : dst->value.term = term_copy(src->value.term); break; case CODE_BOOL : dst->value.bval = src->value.bval; break; case CODE_SIZE : dst->value.size = src->value.size; break; case CODE_LIST : dst->value.list = list_copy(src->value.list); break; case CODE_VARCLASS : dst->value.varclass = src->value.varclass; break; case CODE_CONTYPE : dst->value.contype = src->value.contype; break; case CODE_RDEF : dst->value.rdef = rdef_copy(src->value.rdef); break; case CODE_RPAR : dst->value.rpar = rpar_copy(src->value.rpar); break; case CODE_BITS : dst->value.bits = src->value.bits; break; case CODE_BOUND : dst->value.bound = bound_copy(src->value.bound); break; case CODE_VOID : break; default : abort(); } dst->type = src->type; } /* ---------------------------------------------------------------------------- * Macro Funktionen for better inlining * ---------------------------------------------------------------------------- */ CodeNode* code_eval_child(const CodeNode* node, int no) { return code_eval(code_get_child(node, no)); } const Numb* code_eval_child_numb(const CodeNode* node, int no) { return code_get_numb(code_eval(code_get_child(node, no))); } const char* code_eval_child_strg(const CodeNode* node, int no) { return code_get_strg(code_eval(code_get_child(node, no))); } const char*code_eval_child_name(const CodeNode* node, int no) { return code_get_name(code_eval(code_get_child(node, no))); } const Tuple* code_eval_child_tuple(const CodeNode* node, int no) { return code_get_tuple(code_eval(code_get_child(node, no))); } const Set* code_eval_child_set(const CodeNode* node, int no) { return code_get_set(code_eval(code_get_child(node, no))); } const IdxSet* code_eval_child_idxset(const CodeNode* node, int no) { return code_get_idxset(code_eval(code_get_child(node, no))); } const Entry* code_eval_child_entry(const CodeNode* node, int no) { return code_get_entry(code_eval(code_get_child(node, no))); } const Term* code_eval_child_term(const CodeNode* node, int no) { return code_get_term(code_eval(code_get_child(node, no))); } int code_eval_child_size(const CodeNode* node, int no) { return code_get_size(code_eval(code_get_child(node, no))); } bool code_eval_child_bool(const CodeNode* node, int no) { return code_get_bool(code_eval(code_get_child(node, no))); } const List* code_eval_child_list(const CodeNode* node, int no) { return code_get_list(code_eval(code_get_child(node, no))); } VarClass code_eval_child_varclass(const CodeNode* node, int no) { return code_get_varclass(code_eval(code_get_child(node, no))); } ConType code_eval_child_contype(const CodeNode* node, int no) { return code_get_contype(code_eval(code_get_child(node, no))); } const RDef* code_eval_child_rdef(const CodeNode* node, int no) { return code_get_rdef(code_eval(code_get_child(node, no))); } const RPar* code_eval_child_rpar(const CodeNode* node, int no) { return code_get_rpar(code_eval(code_get_child(node, no))); } unsigned int code_eval_child_bits(const CodeNode* node, int no) { return code_get_bits(code_eval(code_get_child(node, no))); } Symbol* code_eval_child_symbol(const CodeNode* node, int no) { return code_get_symbol(code_eval(code_get_child(node, no))); } Define* code_eval_child_define(const CodeNode* node, int no) { return code_get_define(code_eval(code_get_child(node, no))); } const Bound* code_eval_child_bound(const CodeNode* node, int no) { return code_get_bound(code_eval(code_get_child(node, no))); } zimpl-3.3.6/src/zimpl/inst.h0000644001417200060250000004240013304236715015631 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: inst.h */ /* Name....: Instruction Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _INST_H_ #define _INST_H_ #ifdef __cplusplus extern "C" { #endif #define INST_NULL ((Inst)0) /* ??? */ extern CodeNode* i_expr_sin(CodeNode* self); extern CodeNode* i_expr_cos(CodeNode* self); extern CodeNode* i_expr_tan(CodeNode* self); extern CodeNode* i_expr_asin(CodeNode* self); extern CodeNode* i_expr_acos(CodeNode* self); extern CodeNode* i_expr_atan(CodeNode* self); /* inst.c */ /*lint -sem( i_bool_and, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_and(CodeNode* self); /*lint -sem( i_bool_eq, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_eq(CodeNode* self); /*lint -sem( i_bool_exists, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_exists(CodeNode* self); /*lint -sem( i_bool_false, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_false(CodeNode* self); /*lint -sem( i_bool_ge, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_ge(CodeNode* self); /*lint -sem( i_bool_gt, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_gt(CodeNode* self); /*lint -sem( i_bool_is_elem, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_is_elem(CodeNode* self); /*lint -sem( i_bool_le, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_le(CodeNode* self); /*lint -sem( i_bool_lt, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_lt(CodeNode* self); /*lint -sem( i_bool_ne, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_ne(CodeNode* self); /*lint -sem( i_bool_not, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_not(CodeNode* self); /*lint -sem( i_bool_or, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_or(CodeNode* self); /*lint -sem( i_bool_seq, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_seq(CodeNode* self); /*lint -sem( i_bool_sneq, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_sneq(CodeNode* self); /*lint -sem( i_bool_sseq, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_sseq(CodeNode* self); /*lint -sem( i_bool_subs, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_subs(CodeNode* self); /*lint -sem( i_bool_true, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_true(CodeNode* self); /*lint -sem( i_bool_xor, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bool_xor(CodeNode* self); /*lint -sem( i_bound_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_bound_new(CodeNode* self); /*lint -sem( i_check, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_check(CodeNode* self); /*lint -sem( i_constraint_list, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_constraint_list(CodeNode* self); /*lint -sem( i_constraint, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_constraint(CodeNode* self); /*lint -sem( i_rangeconst, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_rangeconst(CodeNode* self); /*lint -sem( i_elem_list_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_elem_list_add(CodeNode* self); /*lint -sem( i_elem_list_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_elem_list_new(CodeNode* self); /*lint -sem( i_entry, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_entry(CodeNode* self); /*lint -sem( i_entry_list_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_entry_list_add(CodeNode* self); /*lint -sem( i_entry_list_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_entry_list_new(CodeNode* self); /*lint -sem( i_entry_list_powerset, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_entry_list_powerset(CodeNode* self); /*lint -sem( i_entry_list_subsets, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_entry_list_subsets(CodeNode* self); /*lint -sem( i_expr_abs, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_abs(CodeNode* self); /*lint -sem( i_expr_sgn, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sgn(CodeNode* self); /*lint -sem( i_expr_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_add(CodeNode* self); /*lint -sem( i_expr_card, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_card(CodeNode* self); /*lint -sem( i_expr_ceil, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_ceil(CodeNode* self); /*lint -sem( i_expr_div, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_div(CodeNode* self); /*lint -sem( i_expr_exp, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_exp(CodeNode* self); /*lint -sem( i_expr_sqrt, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sqrt(CodeNode* self); /*lint -sem( i_expr_fac, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_fac(CodeNode* self); /*lint -sem( i_expr_floor, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_floor(CodeNode* self); /*lint -sem( i_expr_if_else, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_if_else(CodeNode* self); /*lint -sem( i_expr_intdiv, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_intdiv(CodeNode* self); /*lint -sem( i_expr_length, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_length(CodeNode* self); /*lint -sem( i_expr_ln, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_ln(CodeNode* self); /*lint -sem( i_expr_log, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_log(CodeNode* self); /*lint -sem( i_expr_ord, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_ord(CodeNode* self); /*lint -sem( i_expr_prod, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_prod(CodeNode* self); /*lint -sem( i_expr_rand, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_rand(CodeNode* self); /*lint -sem( i_expr_round, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_round(CodeNode* self); /*lint -sem( i_expr_sum, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sum(CodeNode* self); /*lint -sem( i_expr_max, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_max(CodeNode* self); /*lint -sem( i_expr_max2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_max2(CodeNode* self); /*lint -sem( i_expr_sglmax, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sglmax(CodeNode* self); /*lint -sem( i_expr_min, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_min(CodeNode* self); /*lint -sem( i_expr_min2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_min2(CodeNode* self); /*lint -sem( i_expr_sglmin, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sglmin(CodeNode* self); /*lint -sem( i_expr_mul, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_mul(CodeNode* self); /*lint -sem( i_expr_mod, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_mod(CodeNode* self); /*lint -sem( i_expr_neg, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_neg(CodeNode* self); /*lint -sem( i_expr_pow, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_pow(CodeNode* self); /*lint -sem( i_expr_sub, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_sub(CodeNode* self); /*lint -sem( i_expr_substr, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_expr_substr(CodeNode* self); /*lint -sem( i_forall, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_forall(CodeNode* self); /*lint -sem( i_idxset_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_idxset_new(CodeNode* self); /*lint -sem( i_idxset_pseudo_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_idxset_pseudo_new(CodeNode* self); /*lint -sem( i_list_matrix, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_list_matrix(CodeNode* self); /*lint -sem( i_local_deref, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_local_deref(CodeNode* self); /*lint -sem( i_matrix_list_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_matrix_list_new(CodeNode* self); /*lint -sem( i_matrix_list_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_matrix_list_add(CodeNode* self); /*lint -sem( i_newdef, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newdef(CodeNode* self); /*lint -sem( i_newsym_para1, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newsym_para1(CodeNode* self); /*lint -sem( i_newsym_para2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newsym_para2(CodeNode* self); /*lint -sem( i_newsym_set1, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newsym_set1(CodeNode* self); /*lint -sem( i_newsym_set2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newsym_set2(CodeNode* self); /*lint -sem( i_newsym_var, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_newsym_var(CodeNode* self); /*lint -sem( i_nop, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_nop(CodeNode* self); /*lint -sem( i_object_max, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_object_max(CodeNode* self); /*lint -sem( i_object_min, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_object_min(CodeNode* self); /*lint -sem( i_print, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_print(CodeNode* self); /*lint -sem( i_set_argmax, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_argmax(CodeNode* self); /*lint -sem( i_set_argmin, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_argmin(CodeNode* self); /*lint -sem( i_set_cross, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_cross(CodeNode* self); /*lint -sem( i_set_empty, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_empty(CodeNode* self); /*lint -sem( i_set_expr, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_expr(CodeNode* self); /*lint -sem( i_set_idxset, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_idxset(CodeNode* self); /*lint -sem( i_set_indexset, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_indexset(CodeNode* self); /*lint -sem( i_set_inter, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_inter(CodeNode* self); /*lint -sem( i_set_inter2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_inter2(CodeNode* self); /*lint -sem( i_set_minus, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_minus(CodeNode* self); /*lint -sem( i_set_new_tuple, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_new_tuple(CodeNode* self); /*lint -sem( i_set_new_elem, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_new_elem(CodeNode* self); /*lint -sem( i_set_proj, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_proj(CodeNode* self); /*lint -sem( i_set_pseudo, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_pseudo(CodeNode* self); /*lint -sem( i_set_range, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_range(CodeNode* self); /*lint -sem( i_set_range2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_range2(CodeNode* self); /*lint -sem( i_set_sdiff, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_sdiff(CodeNode* self); /*lint -sem( i_set_union, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_union(CodeNode* self); /*lint -sem( i_set_union2, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_set_union2(CodeNode* self); /*lint -sem( i_sos, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_sos(CodeNode* self); /*lint -sem( i_soset, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_soset(CodeNode* self); /*lint -sem( i_subto, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_subto(CodeNode* self); /*lint -sem( i_symbol_deref, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_symbol_deref(CodeNode* self); /*lint -sem( i_define_deref, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_define_deref(CodeNode* self); /*lint -sem( i_term_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_add(CodeNode* self); /*lint -sem( i_term_coeff, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_coeff(CodeNode* self); /*lint -sem( i_term_const, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_const(CodeNode* self); /*lint -sem( i_term_expr, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_expr(CodeNode* self); /*lint -sem( i_term_mul, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_mul(CodeNode* self); /*lint -sem( i_term_quadratic, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_power(CodeNode* self); /*lint -sem( i_term_power, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_sub(CodeNode* self); /*lint -sem( i_term_sum, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_term_sum(CodeNode* self); /*lint -sem( i_tuple_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_tuple_new(CodeNode* self); /*lint -sem( i_tuple_empty, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_tuple_empty(CodeNode* self); /*lint -sem( i_tuple_list_add, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_tuple_list_add(CodeNode* self); /*lint -sem( i_tuple_list_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_tuple_list_new(CodeNode* self); /* iread.c */ /*lint -sem( i_read_new, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_new(CodeNode* self); /*lint -sem( i_read_param, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_param(CodeNode* self); /*lint -sem( i_read_comment, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_comment(CodeNode* self); /*lint -sem( i_read_match, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_match(CodeNode* self); /*lint -sem( i_read_use, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_use(CodeNode* self); /*lint -sem( i_read_skip, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read_skip(CodeNode* self); /*lint -sem( i_read, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_read(CodeNode* self); /* vinst.c */ /*lint -sem( i_vabs, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vabs(CodeNode* self); /*lint -sem( i_vbool_and, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_and(CodeNode* self); /*lint -sem( i_vbool_eq, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_eq(CodeNode* self); /*lint -sem( i_vbool_ne, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_ne(CodeNode* self); /*lint -sem( i_vbool_ge, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_ge(CodeNode* self); /*lint -sem( i_vbool_gt, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_gt(CodeNode* self); /*lint -sem( i_vbool_le, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_le(CodeNode* self); /*lint -sem( i_vbool_lt, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_lt(CodeNode* self); /*lint -sem( i_vbool_not, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_not(CodeNode* self); /*lint -sem( i_vbool_or, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_or(CodeNode* self); /*lint -sem( i_vbool_xor, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vbool_xor(CodeNode* self); /*lint -sem( i_vexpr_fun, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vexpr_fun(CodeNode* self); /*lint -sem( i_vif, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vif(CodeNode* self); /*lint -sem( i_vif_else, 1p == 1, type(1), @P > malloc(1P)p) */ extern CodeNode* i_vif_else(CodeNode* self); #ifdef __cplusplus } #endif #endif /* _INST_H_ */ zimpl-3.3.6/src/zimpl/vinst.c0000644001417200060250000011163013304236715016014 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: vinst.c */ /* Name....: Variable Instructions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include /* #define TRACE 1 */ #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/bound.h" #include "zimpl/idxset.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/rdefpar.h" #include "zimpl/conname.h" #include "zimpl/stmt.h" #include "zimpl/prog.h" #include "zimpl/local.h" #include "zimpl/list.h" #include "zimpl/entry.h" #include "zimpl/heap.h" #include "zimpl/code.h" #include "zimpl/inst.h" #include "zimpl/xlpglue.h" #include "zimpl/strstore.h" enum vbool_cmp_operator { VBOOL_LT, VBOOL_LE, VBOOL_EQ, VBOOL_NE, VBOOL_GE, VBOOL_GT }; enum vbool_fixed_result { VBOOL_TRUE, VBOOL_FALSE, VBOOL_OPEN }; typedef enum vbool_cmp_operator VBCmpOp; typedef enum vbool_fixed_result VBFixed; static int internal_vars = 0; static int internal_cons = 0; void interns_init() { assert(internal_vars == 0); assert(internal_cons == 0); } void interns_exit() { internal_vars = 0; internal_cons = 0; } static void create_new_constraint( const char* basename, const char* extension, Term* term, ConType con_type, const Numb* lrhs, unsigned int flags) { char* cname; Trace("create_new_constraint"); assert(basename != NULL); assert(extension != NULL); assert(con_type != CON_RANGE); assert(term_is_valid(term)); assert(numb_is_valid(lrhs)); cname = malloc(strlen(basename) + strlen(extension) + 10 + 1); sprintf(cname, "%s%s_%d", basename, extension, internal_cons++); (void)xlp_addcon_term(prog_get_lp(), cname, con_type, lrhs, lrhs, flags, term); term_free(term); free(cname); } static Entry* create_new_var_entry( const char* basename, const char* extension, VarClass var_class, const Bound* lower, const Bound* upper) { char* vname; Tuple* tuple; Entry* entry; Var* var; Trace("create_new_var_entry"); assert(basename != NULL); assert(extension != NULL); /* assert(var_class != VAR_CON);*/ assert(bound_is_valid(lower)); assert(bound_is_valid(upper)); vname = malloc(strlen(basename) + strlen(extension) + strlen(SYMBOL_NAME_INTERNAL) + 16); sprintf(vname, "%s%s%s_%d", SYMBOL_NAME_INTERNAL, basename, extension, internal_vars++); var = xlp_addvar(prog_get_lp(), vname, var_class, lower, upper, numb_zero(), numb_zero()); tuple = tuple_new(1); tuple_set_elem(tuple, 0, elem_new_strg(str_new(vname + strlen(SYMBOL_NAME_INTERNAL)))); entry = entry_new_var(tuple, var); tuple_free(tuple); free(vname); return entry; } static VBFixed check_how_fixed( VBCmpOp cmp_op, const Numb* rhs) { VBFixed result = VBOOL_FALSE; switch(cmp_op) { case VBOOL_EQ : if (numb_equal(rhs, numb_zero())) result = VBOOL_TRUE; break; case VBOOL_NE : if (!numb_equal(rhs, numb_zero())) result = VBOOL_TRUE; break; case VBOOL_LE : if (numb_cmp(numb_zero(), rhs) <= 0) result = VBOOL_TRUE; break; case VBOOL_GE : if (numb_cmp(numb_zero(), rhs) >= 0) result = VBOOL_TRUE; break; case VBOOL_LT : if (numb_cmp(numb_zero(), rhs) < 0) result = VBOOL_TRUE; break; case VBOOL_GT : if (numb_cmp(numb_zero(), rhs) > 0) result = VBOOL_TRUE; break; default : abort(); } return result; } static VBFixed check_if_fixed( VBCmpOp cmp_op, const Numb* lower, const Numb* upper) { VBFixed result = VBOOL_OPEN; /* lower <= upper */ assert(numb_cmp(lower, upper) <= 0); switch(cmp_op) { case VBOOL_EQ : if ( (numb_cmp(lower, numb_zero()) > 0) || (numb_cmp(upper, numb_zero()) < 0)) result = VBOOL_FALSE; else { if (numb_equal(lower, upper)) { assert(numb_equal(lower, numb_zero())); assert(numb_equal(upper, numb_zero())); result = VBOOL_TRUE; } } break; case VBOOL_NE : if ( (numb_cmp(lower, numb_zero()) > 0) || (numb_cmp(upper, numb_zero()) < 0)) result = VBOOL_TRUE; else { if (numb_equal(lower, upper)) { assert(numb_equal(lower, numb_zero())); assert(numb_equal(upper, numb_zero())); result = VBOOL_FALSE; } } break; case VBOOL_LE : if (numb_cmp(upper, numb_zero()) <= 0) result = VBOOL_TRUE; else if (numb_cmp(lower, numb_zero()) > 0) result = VBOOL_FALSE; break; case VBOOL_GE : if (numb_cmp(lower, numb_zero()) >= 0) result = VBOOL_TRUE; else if (numb_cmp(upper, numb_zero()) < 0) result = VBOOL_FALSE; break; case VBOOL_LT : if (numb_cmp(upper, numb_zero()) < 0) result = VBOOL_TRUE; else if (numb_cmp(lower, numb_zero()) >= 0) result = VBOOL_FALSE; break; case VBOOL_GT : if (numb_cmp(lower, numb_zero()) > 0) result = VBOOL_TRUE; else if (numb_cmp(upper, numb_zero()) <= 0) result = VBOOL_FALSE; break; default : abort(); } return result; } static CodeNode* handle_vbool_cmp(CodeNode* self, VBCmpOp cmp_op) { Symbol* sym; Term* term; const Term* term_lhs; const Term* term_rhs; Numb* rhs; unsigned int flags; const char* cname; Bound* lower; Bound* upper; Bound* bound_zero; Bound* bound_one; Entry* entry_result; VBFixed fixed = VBOOL_OPEN; Trace("handle_vbool_cmp"); assert(code_is_valid(self)); term_lhs = code_eval_child_term(self, 0); term_rhs = code_eval_child_term(self, 1); flags = 0; rhs = numb_new_sub(term_get_constant(term_rhs), term_get_constant(term_lhs)); term = term_sub_term(term_lhs, term_rhs); if (!term_is_all_integer(term)) { fprintf(stderr, "*** Error 177: Boolean constraint not all integer\n"); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); } /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); lower = term_get_lower_bound(term); upper = term_get_upper_bound(term); if (bound_get_type(lower) != BOUND_VALUE || bound_get_type(upper) != BOUND_VALUE) { fprintf(stderr, "*** Error 185: Term in Boolean constraint not bounded\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* Check if trival infeasible */ if (term_get_elements(term) == 0) { if (stmt_trigger_warning(176)) { fprintf(stderr, "--- Warning 176: Empty LHS, in Boolean constraint\n"); code_errmsg(code_get_child(self, 0)); } fixed = check_how_fixed(cmp_op, rhs); assert(fixed != VBOOL_OPEN); } else { fixed = check_if_fixed(cmp_op, bound_get_value(lower), bound_get_value(upper)); } if (fixed != VBOOL_OPEN) { if (fixed == VBOOL_TRUE) entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_one, bound_one); else { assert(fixed == VBOOL_FALSE); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_zero); } if (stmt_trigger_warning(178)) { fprintf(stderr, "--- Warning 178: Conditional always true or false due to bounds\n"); code_errmsg(code_get_child(self, 0)); /* pos of warning message */ } term_free(term); } else { Entry* entry_xplus; Entry* entry_xminus; Entry* entry_bplus; Entry* entry_bminus; /* Remove constant from term */ term_add_constant(term, rhs); if (numb_cmp(bound_get_value(lower), numb_zero()) < 0) { Numb* numb = numb_copy(bound_get_value(lower)); numb_abs(numb); bound_free(lower); lower = bound_new(BOUND_VALUE, numb); numb_free(numb); } else { bound_free(lower); lower = bound_new(BOUND_VALUE, numb_zero()); } if (numb_cmp(bound_get_value(upper), numb_zero()) < 0) { bound_free(upper); upper = bound_new(BOUND_VALUE, numb_zero()); } /* Create x^+, x^-, b^+, b^-, Result */ entry_xplus = create_new_var_entry(cname, "_xp", VAR_INT, bound_zero, upper); entry_xminus = create_new_var_entry(cname, "_xm", VAR_INT, bound_zero, lower); entry_bplus = create_new_var_entry(cname, "_bp", VAR_INT, bound_zero, bound_one); entry_bminus = create_new_var_entry(cname, "_bm", VAR_INT, bound_zero, bound_one); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_one); /* add term = x^+ + x^- */ term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); term_add_elem(term, entry_xminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_EQUAL, rhs, flags); /* bplus <= xplus */ term = term_new(2); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_b", term, CON_RHS, numb_zero(), flags); /* bminus <= xminus */ term = term_new(2); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); term_add_elem(term, entry_xminus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_c", term, CON_RHS, numb_zero(), flags); /* bplus * upper >= xplus */ term = term_new(2); if (!numb_equal(bound_get_value(upper), numb_zero())) term_add_elem(term, entry_bplus, bound_get_value(upper), MFUN_NONE); term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_d", term, CON_LHS, numb_zero(), flags); /* bminus * lower >= xminus */ term = term_new(2); if (!numb_equal(bound_get_value(lower), numb_zero())) term_add_elem(term, entry_bminus, bound_get_value(lower), MFUN_NONE); term_add_elem(term, entry_xminus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_e", term, CON_LHS, numb_zero(), flags); switch(cmp_op) { case VBOOL_EQ : /* 1 - result = bplus + bminus => result + bplus + bminus = 1 */ term = term_new(3); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_EQUAL, numb_one(), flags); break; case VBOOL_NE : /* result = bplus + bminus => result - bplus - bminus = 0*/ term = term_new(3); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bplus, numb_minusone(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_EQUAL, numb_zero(), flags); break; case VBOOL_LE : /* bplus + bminus <= 1, * result = 1 - bplus => result + bplus = 1 */ term = term_new(2); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_RHS, numb_one(), flags); term = term_new(2); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_g", term, CON_EQUAL, numb_one(), flags); break; case VBOOL_GE : /* bplus + bminus <= 1, * result = 1 - bminus => result + bminus = 1 */ term = term_new(2); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_RHS, numb_one(), flags); term = term_new(2); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_g", term, CON_EQUAL, numb_one(), flags); break; case VBOOL_LT : /* bplus + bminus <= 1, * result = bminus => result - bminus = 0 */ term = term_new(2); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_RHS, numb_one(), flags); /* This is somewhat superflous */ term = term_new(2); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_g", term, CON_EQUAL, numb_zero(), flags); break; case VBOOL_GT : /* bplus + bminus <= 1, * result = bplus => result - bplus = 0 */ term = term_new(2); term_add_elem(term, entry_bplus, numb_one(), MFUN_NONE); term_add_elem(term, entry_bminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_f", term, CON_RHS, numb_one(), flags); /* This is somewhat superflous */ term = term_new(2); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_bplus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_g", term, CON_EQUAL, numb_zero(), flags); break; default : abort(); } symbol_add_entry(sym, entry_xplus); symbol_add_entry(sym, entry_xminus); symbol_add_entry(sym, entry_bplus); symbol_add_entry(sym, entry_bminus); } term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); symbol_add_entry(sym, entry_result); bound_free(bound_one); bound_free(bound_zero); bound_free(lower); bound_free(upper); numb_free(rhs); return self; } CodeNode* i_vbool_ne(CodeNode* self) { Trace("i_vbool_ne"); return handle_vbool_cmp(self, VBOOL_NE); } CodeNode* i_vbool_eq(CodeNode* self) { Trace("i_vbool_eq"); return handle_vbool_cmp(self, VBOOL_EQ); } CodeNode* i_vbool_lt(CodeNode* self) { Trace("i_vbool_lt"); return handle_vbool_cmp(self, VBOOL_LT); } CodeNode* i_vbool_le(CodeNode* self) { Trace("i_vbool_le"); return handle_vbool_cmp(self, VBOOL_LE); } CodeNode* i_vbool_gt(CodeNode* self) { Trace("i_vbool_gt"); return handle_vbool_cmp(self, VBOOL_GT); } CodeNode* i_vbool_ge(CodeNode* self) { Trace("i_vbool_ge"); return handle_vbool_cmp(self, VBOOL_GE); } CodeNode* i_vbool_and(CodeNode* self) { const Term* term_a; const Term* term_b; const char* cname; Term* term; Bound* bound_zero; Bound* bound_one; Entry* entry_result; unsigned int flags = 0; Symbol* sym; Trace("i_vbool_and"); cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); term_a = code_eval_child_term(self, 0); term_b = code_eval_child_term(self, 1); assert(term_get_elements(term_a) == 1); assert(term_get_elements(term_b) == 1); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_one); /* ------------------------------------- */ /* a - re >= 0 */ term = term_copy(term_a); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_LHS, numb_zero(), flags); /* b - re >= 0 */ term = term_copy(term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_b", term, CON_LHS, numb_zero(), flags); /* a + b - re <= 1 */ term = term_add_term(term_a, term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_c", term, CON_RHS, numb_one(), flags); /* ------------------------------------- */ term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_result); bound_free(bound_zero); bound_free(bound_one); return self; } CodeNode* i_vbool_or(CodeNode* self) { const Term* term_a; const Term* term_b; const char* cname; Term* term; Bound* bound_zero; Bound* bound_one; Entry* entry_result; unsigned int flags = 0; Symbol* sym; Trace("i_vbool_or"); cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); term_a = code_eval_child_term(self, 0); term_b = code_eval_child_term(self, 1); assert(term_get_elements(term_a) == 1); assert(term_get_elements(term_b) == 1); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_one); /* ------------------------------------- */ /* a - re <= 0 */ term = term_copy(term_a); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_RHS, numb_zero(), flags); /* b - re <= 0 */ term = term_copy(term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_b", term, CON_RHS, numb_zero(), flags); /* a + b - re >= 0 */ term = term_add_term(term_a, term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_c", term, CON_LHS, numb_zero(), flags); /* ------------------------------------- */ term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_result); bound_free(bound_zero); bound_free(bound_one); return self; } CodeNode* i_vbool_xor(CodeNode* self) { const Term* term_a; const Term* term_b; const char* cname; Term* term; Bound* bound_zero; Bound* bound_one; Entry* entry_result; unsigned int flags = 0; Symbol* sym; Numb* numb; Trace("i_vbool_xor"); cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); term_a = code_eval_child_term(self, 0); term_b = code_eval_child_term(self, 1); assert(term_get_elements(term_a) == 1); assert(term_get_elements(term_b) == 1); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_one); /* ------------------------------------- */ /* a + b - re >= 0 */ term = term_add_term(term_a, term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_LHS, numb_zero(), flags); /* a - b - re <= 0 */ term = term_sub_term(term_a, term_b); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_b", term, CON_RHS, numb_zero(), flags); /* a - b + re >= 0 */ term = term_sub_term(term_a, term_b); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); create_new_constraint(cname, "_c", term, CON_LHS, numb_zero(), flags); /* a + b + re <= 2 */ numb = numb_new_integer(2); term = term_add_term(term_a, term_b); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); create_new_constraint(cname, "_d", term, CON_RHS, numb, flags); numb_free(numb); /* ------------------------------------- */ term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_result); bound_free(bound_zero); bound_free(bound_one); return self; } CodeNode* i_vbool_not(CodeNode* self) { const Term* term_a; const char* cname; Term* term; Bound* bound_zero; Bound* bound_one; Entry* entry_result; unsigned int flags = 0; Symbol* sym; Trace("i_vbool_not"); cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); term_a = code_eval_child_term(self, 0); assert(term_get_elements(term_a) == 1); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bound_one); /* ------------------------------------- */ /* a + re == 1 */ term = term_copy(term_a); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_EQUAL, numb_one(), flags); /* ------------------------------------- */ term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_result); bound_free(bound_zero); bound_free(bound_one); return self; } static void generate_conditional_constraint( const CodeNode* self, const Term* vif_term, const Term* lhs_term, ConType con_type, const Numb* rhs, unsigned int flags, bool then_case) { Bound* bound; const Numb* bound_val; Trace("generate_conditional_constraint"); assert(con_type == CON_RHS || con_type == CON_LHS); bound = (con_type == CON_RHS) ? term_get_upper_bound(lhs_term) : term_get_lower_bound(lhs_term); if (bound_get_type(bound) != BOUND_VALUE) { fprintf(stderr, "*** Error 179: Conditional only possible on bounded constraints\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } bound_val = bound_get_value(bound); if ( (con_type == CON_RHS && numb_cmp(bound_val, rhs) <= 0) || (con_type == CON_LHS && numb_cmp(bound_val, rhs) >= 0)) { /* ??? This can be triggered for an eqiality constraint if after the * split one part is always true. */ if (stmt_trigger_warning(180)) { fprintf(stderr, "--- Warning 180: Conditional constraint always true due to bounds\n"); code_errmsg(self); } } else { const char* basename = conname_get(); char* cname = malloc(strlen(basename) + 5); Term* big_term = term_copy(vif_term); Numb* big_m = then_case ? numb_new_sub(bound_val, rhs) : numb_new_sub(rhs, bound_val); const Numb* new_rhs = then_case ? bound_val : rhs; term_mul_coeff(big_term, big_m); term_append_term(big_term, lhs_term); sprintf(cname, "%s_%c_%c", basename, then_case ? 't' : 'e', con_type == CON_RHS ? 'r' : 'l'); (void)xlp_addcon_term(prog_get_lp(), cname, con_type, new_rhs, new_rhs, flags, big_term); numb_free(big_m); term_free(big_term); free(cname); } bound_free(bound); } /*ARGSUSED*/ static void generate_indicator_constraint( UNUSED const CodeNode* self, const Term* vif_term, const Term* lhs_term, ConType con_type, const Numb* rhs, unsigned int flags, bool then_case) { Numb* lhs; Term* ind_term; const char* basename; char* cname; Trace("generate_indicator_constraint"); assert(flags & LP_FLAG_CON_INDIC); ind_term = term_make_conditional(vif_term, lhs_term, then_case); basename = conname_get(); cname = malloc(strlen(basename) + 5); sprintf(cname, "%s_%c", basename, then_case ? 't' : 'f'); /* CON_EQUAL -> lhs == rhs * CON_RHS -> lhs == rhs, lhs does not matter * CON_LHS -> lhs == rhs, rhs does not matter * CON_RANGE -> not allowed */ lhs = numb_copy(rhs); #if 0 if (con_type == CON_LHS) numb_neg(lhs); #endif (void)xlp_addcon_term(prog_get_lp(), cname, con_type, lhs, rhs, flags, ind_term); term_free(ind_term); numb_free(lhs); free(cname); } static void handle_vif_then_else( const CodeNode* self, const Term* vif_term, const Term* lhs_term, ConType con_type, const Term* rhs_term, unsigned int flags, bool then_case) { Term* term; Numb* rhs; Trace("handle_vif_then_else"); rhs = numb_new_sub(term_get_constant(rhs_term), term_get_constant(lhs_term)); term = term_sub_term(lhs_term, rhs_term); term_add_constant(term, rhs); /* Check if trival infeasible */ if (term_get_elements(term) == 0) { fprintf(stderr, "*** Error 181: Empty LHS, not allowed in conditional constraint\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(con_type == CON_RHS || con_type == CON_LHS || con_type == CON_EQUAL); if (!term_is_linear(term)) { fprintf(stderr, "*** Error 222: Term inside a then or else constraint not linear\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (flags & LP_FLAG_CON_INDIC) generate_indicator_constraint(self, vif_term, term, con_type, rhs, flags, then_case); else { /* <=, == */ if (con_type == CON_RHS || con_type == CON_EQUAL) generate_conditional_constraint(self, vif_term, term, CON_RHS, rhs, flags, then_case); /* >=, == */ if (con_type == CON_LHS || con_type == CON_EQUAL) generate_conditional_constraint(self, vif_term, term, CON_LHS, rhs, flags, then_case); } numb_free(rhs); term_free(term); } CodeNode* i_vif_else(CodeNode* self) { const Term* vif_term; const Term* lhs_term; const Term* rhs_term; ConType con_type; unsigned int flags; Trace("i_vif_else"); assert(code_is_valid(self)); vif_term = code_eval_child_term(self, 0); flags = code_eval_child_bits(self, 7); lhs_term = code_eval_child_term(self, 1); con_type = code_eval_child_contype(self, 2); rhs_term = code_eval_child_term(self, 3); handle_vif_then_else(code_get_child(self, 1), /* pos for error messages */ vif_term, lhs_term, con_type, rhs_term, flags, true); lhs_term = code_eval_child_term(self, 4); con_type = code_eval_child_contype(self, 5); rhs_term = code_eval_child_term(self, 6); handle_vif_then_else(code_get_child(self, 4), /* pos for error messages */ vif_term, lhs_term, con_type, rhs_term, flags, false); code_value_void(self); conname_next(); return self; } CodeNode* i_vif(CodeNode* self) { const Term* vif_term; const Term* lhs_term; const Term* rhs_term; ConType con_type; unsigned int flags; Trace("i_vif"); assert(code_is_valid(self)); vif_term = code_eval_child_term(self, 0); lhs_term = code_eval_child_term(self, 1); con_type = code_eval_child_contype(self, 2); rhs_term = code_eval_child_term(self, 3); flags = code_eval_child_bits(self, 4); handle_vif_then_else(code_get_child(self, 1), /* pos for error messages */ vif_term, lhs_term, con_type, rhs_term, flags, true); code_value_void(self); conname_next(); return self; } CodeNode* i_vabs(CodeNode* self) { Symbol* sym; Term* term; const Term* term_abs; Numb* rhs; unsigned int flags = 0; const char* cname; Bound* lower; Bound* upper; const Bound* bigger; Bound* bound_zero; Bound* bound_one; Entry* entry_xplus; Entry* entry_xminus; Entry* entry_bplus; Entry* entry_result; Trace("i_vabs"); assert(code_is_valid(self)); term_abs = code_eval_child_term(self, 0); rhs = numb_copy(term_get_constant(term_abs)); term = term_copy(term_abs); /* Check if trival infeasible */ if (term_get_elements(term) == 0) { fprintf(stderr, "*** Error 182: Empty LHS, in variable vabs\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (!term_is_all_integer(term)) { fprintf(stderr, "*** Error 183: vabs term not all integer\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } cname = conname_get(); bound_zero = bound_new(BOUND_VALUE, numb_zero()); bound_one = bound_new(BOUND_VALUE, numb_one()); lower = term_get_lower_bound(term); upper = term_get_upper_bound(term); if (bound_get_type(lower) != BOUND_VALUE || bound_get_type(upper) != BOUND_VALUE) { fprintf(stderr, "*** Error 184: vabs term not bounded\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb_neg(rhs); term_add_constant(term, rhs); if (numb_cmp(bound_get_value(lower), numb_zero()) < 0) { Numb* numb = numb_copy(bound_get_value(lower)); numb_abs(numb); bound_free(lower); lower = bound_new(BOUND_VALUE, numb); numb_free(numb); } else { bound_free(lower); lower = bound_new(BOUND_VALUE, numb_zero()); } if (numb_cmp(bound_get_value(upper), numb_zero()) < 0) { bound_free(upper); upper = bound_new(BOUND_VALUE, numb_zero()); } bigger = (numb_cmp(bound_get_value(lower), bound_get_value(upper)) > 0) ? lower : upper; /* Create x^+, x^-, Result */ entry_xplus = create_new_var_entry(cname, "_xp", VAR_INT, bound_zero, upper); entry_xminus = create_new_var_entry(cname, "_xm", VAR_INT, bound_zero, lower); entry_bplus = create_new_var_entry(cname, "_bp", VAR_INT, bound_zero, bound_one); entry_result = create_new_var_entry(cname, "_re", VAR_INT, bound_zero, bigger); /* add term = x^+ + x^- */ term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); term_add_elem(term, entry_xminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_a", term, CON_EQUAL, rhs, flags); /* bplus * upper >= xplus */ term = term_new(2); if (!numb_equal(bound_get_value(upper), numb_zero())) term_add_elem(term, entry_bplus, bound_get_value(upper), MFUN_NONE); term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_b", term, CON_LHS, numb_zero(), flags); /* (1 - bplus) * lower >= xminus * lower - bplus * lower - xminus >= 0 * - bplus * lower - xminus >= -lower * xminus + bplus * lower <= lower */ term = term_new(2); if (!numb_equal(bound_get_value(lower), numb_zero())) term_add_elem(term, entry_bplus, bound_get_value(lower), MFUN_NONE); term_add_elem(term, entry_xminus, numb_one(), MFUN_NONE); create_new_constraint(cname, "_c", term, CON_RHS, bound_get_value(lower), flags); /* result - xplus - xminus == 0 */ term = term_new(3); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); term_add_elem(term, entry_xplus, numb_minusone(), MFUN_NONE); term_add_elem(term, entry_xminus, numb_minusone(), MFUN_NONE); create_new_constraint(cname, "_d", term, CON_EQUAL, numb_zero(), flags); term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); /* Symbol for internal entries */ sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_xplus); symbol_add_entry(sym, entry_xminus); symbol_add_entry(sym, entry_bplus); symbol_add_entry(sym, entry_result); bound_free(bound_one); bound_free(bound_zero); bound_free(lower); bound_free(upper); numb_free(rhs); return self; } CodeNode* i_vexpr_fun(CodeNode* self) { Symbol* sym; const Term* term_fun; const char* cname; const Numb* expo; const Numb* funno; unsigned int flags = 0; Term* term; Entry* entry_tmp; Entry* entry_result; Bound* t_lower; Bound* t_upper; Bound* r_lower; Bound* r_upper; MFun mfun; Numb* rhs; Trace("i_vexpr_fun"); /* r = result, t = temp * * r = f(vexpr) * t = vexpr => vexpr - t == 0 * r = f(t) => f(t) - r == 0 * * WARNING: The coefficent of a monom that is a function * is used as the exponent for functions that need a second * number argument, e.g. pow(x*y, 3) */ assert(code_is_valid(self)); funno = code_eval_child_numb(self, 0); assert(numb_is_int(funno)); mfun = (MFun)numb_toint(funno); term_fun = code_eval_child_term(self, 1); switch(mfun) { case MFUN_SQRT : t_lower = bound_new(BOUND_VALUE, numb_zero()); t_upper = bound_new(BOUND_INFTY, NULL); r_lower = bound_new(BOUND_VALUE, numb_zero()); r_upper = bound_new(BOUND_INFTY, NULL); break; case MFUN_LOG : case MFUN_LN : t_lower = bound_new(BOUND_VALUE, numb_zero()); t_upper = bound_new(BOUND_INFTY, NULL); r_lower = bound_new(BOUND_MINUS_INFTY, NULL); r_upper = bound_new(BOUND_INFTY, NULL); break; case MFUN_EXP : case MFUN_TAN : case MFUN_POW : case MFUN_SGNPOW : t_lower = bound_new(BOUND_MINUS_INFTY, NULL); t_upper = bound_new(BOUND_INFTY, NULL); r_lower = bound_new(BOUND_MINUS_INFTY, NULL); r_upper = bound_new(BOUND_INFTY, NULL); break; case MFUN_SIN : case MFUN_COS : case MFUN_SGN : t_lower = bound_new(BOUND_MINUS_INFTY, NULL); t_upper = bound_new(BOUND_INFTY, NULL); r_lower = bound_new(BOUND_VALUE, numb_minusone()); r_upper = bound_new(BOUND_VALUE, numb_one()); break; case MFUN_ABS : t_lower = bound_new(BOUND_MINUS_INFTY, NULL); t_upper = bound_new(BOUND_INFTY, NULL); r_lower = bound_new(BOUND_VALUE, numb_zero()); r_upper = bound_new(BOUND_INFTY, NULL); break; default : abort(); } if (mfun == MFUN_POW || mfun == MFUN_SGNPOW) expo = code_eval_child_numb(self, 2); else expo = numb_one(); cname = conname_get(); entry_tmp = create_new_var_entry(cname, "_t", VAR_CON, t_lower, t_upper); entry_result = create_new_var_entry(cname, "_r", mfun == MFUN_SGN ? VAR_INT : VAR_CON, r_lower, r_upper); /* vexpr - t == 0 */ term = term_copy(term_fun); term_add_elem(term, entry_tmp, numb_minusone(), MFUN_NONE); rhs = numb_new_mul(term_get_constant(term), numb_minusone()); term_add_constant(term, rhs); create_new_constraint(cname, "_a", term, CON_EQUAL, rhs, flags); numb_free(rhs); /* fun(t) - r == 0 */ term = term_new(2); term_add_elem(term, entry_result, numb_minusone(), MFUN_NONE); term_add_elem(term, entry_tmp, expo, mfun); create_new_constraint(cname, "_b", term, CON_EQUAL, numb_zero(), flags); term = term_new(1); term_add_elem(term, entry_result, numb_one(), MFUN_NONE); code_value_term(self, term); sym = symbol_lookup(SYMBOL_NAME_INTERNAL); assert(sym != NULL); symbol_add_entry(sym, entry_tmp); symbol_add_entry(sym, entry_result); bound_free(t_lower); bound_free(t_upper); bound_free(r_lower); bound_free(r_upper); return self; } zimpl-3.3.6/src/zimpl/strstore.h0000644001417200060250000000351213304236715016542 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: strstore2.c */ /* Name....: String Storage Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _STRSTORE_H_ #define _STRSTORE_H_ #ifdef __cplusplus extern "C" { #endif extern void str_init(void); extern void str_exit(void); /*lint -sem( str_new, 1p && nulterm(1), @p == 1p && nulterm(@)) */ extern const char* str_new(const char* s); /*lint -sem( str_hash, 1p) */ extern unsigned int str_hash(const char* s); #ifdef __cplusplus } #endif #endif /* _STRSTORE_H_ */ zimpl-3.3.6/src/zimpl/prog.c0000644001417200060250000001374413304236715015627 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: prog.c */ /* Name....: Program Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/idxset.h" #include "zimpl/rdefpar.h" #include "zimpl/bound.h" #include "zimpl/define.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/list.h" #include "zimpl/local.h" #include "zimpl/code.h" #include "zimpl/stmt.h" #include "zimpl/prog.h" #define PROG_SID 0x50726f67 #define PROG_EXTEND_SIZE 100 static void* lp_data = NULL; struct program { SID int size; int used; int extend; Stmt** stmt; }; void* prog_get_lp() { return lp_data; } Prog* prog_new() { Prog* prog = calloc(1, sizeof(*prog)); assert(prog != NULL); prog->size = PROG_EXTEND_SIZE; prog->used = 0; prog->extend = PROG_EXTEND_SIZE; prog->stmt = calloc((size_t)prog->size, sizeof(*prog->stmt)); SID_set(prog, PROG_SID); assert(prog_is_valid(prog)); return prog; } void prog_free(Prog* prog) { int i; assert(prog_is_valid(prog)); assert(prog->stmt != NULL); SID_del(prog); for(i = 0; i < prog->used; i++) stmt_free(prog->stmt[i]); free(prog->stmt); free(prog); } bool prog_is_valid(const Prog* prog) { return ((prog != NULL) && SID_ok(prog, PROG_SID)); } bool prog_is_empty(const Prog* prog) { return prog->used == 0; } void prog_add_stmt(Prog* prog, Stmt* stmt) { assert(prog_is_valid(prog)); assert(stmt_is_valid(stmt)); assert(prog->used <= prog->size); if (prog->used == prog->size) { prog->size += prog->extend; prog->extend += prog->extend; prog->stmt = realloc( prog->stmt, (size_t)prog->size * sizeof(*prog->stmt)); assert(prog->stmt != NULL); } assert(prog->used < prog->size); prog->stmt[prog->used] = stmt; prog->used++; } void prog_print(FILE* fp, const Prog* prog) { int i; assert(prog_is_valid(prog)); fprintf(fp, "Statements: %d\n", prog->used); for(i = 0; i < prog->used; i++) stmt_print(fp, prog->stmt[i]); } void prog_execute(const Prog* prog, void* lp) { int i; assert(prog_is_valid(prog)); code_clear_inst_count(); lp_data = lp; for(i = 0; i < prog->used; i++) { stmt_parse(prog->stmt[i]); stmt_execute(prog->stmt[i]); /* These calls should make sure, that all output is really * flushed out, even in a Batch environment. */ fflush(stdout); fflush(stderr); #ifdef USE_FSYNC /* This is to force the output do disk. It is to my knowledge * only needed on AIX batch systems that seem not to flush * the output buffer. If then the job is killed for some reason * no output is generated. */ (void)fsync(fileno(stdout)); (void)fsync(fileno(stderr)); #endif } if (verbose >= VERB_NORMAL) printf("Instructions evaluated: %u\n", code_get_inst_count()); } char* prog_tostr(const Prog* prog, const char* prefix, const char* title, size_t max_output_line_len) { size_t len; char* text; int pos = 0; int i; assert(prog_is_valid(prog)); assert(prefix != NULL); assert(max_output_line_len > strlen(prefix)); /* prefix + title + \n * prog->used * (\n + prefix + stmt) * \0 */ len = strlen(prefix) + strlen(title) + 2; for(i = 0; i < prog->used; i++) { size_t line_len = strlen(stmt_get_text(prog->stmt[i])); size_t max_eff_line_len = max_output_line_len - strlen(prefix) - 1; len += line_len + ((line_len + max_eff_line_len - 1) / max_eff_line_len) * (strlen(prefix) + 1); } text = calloc(len, sizeof(*text)); pos = sprintf(&text[pos], "%s%s", prefix, title); for(i = 0; i < prog->used; i++) { const char* s = stmt_get_text(prog->stmt[i]); int k = 0; while(*s != '\0') { if ((size_t)k % max_output_line_len == 0) { k = sprintf(&text[pos], "\n%s", prefix); pos += k; } text[pos] = *s; pos++; s++; k++; } } text[pos++] = '\n'; text[pos] = '\0'; /* for(i = 0; i < prog->used; i++) * pos += sprintf(&text[pos], "%s%s\n", prefix, stmt_get_text(prog->stmt[i])); */ assert((size_t)pos + 1 == len); return text; } zimpl-3.3.6/src/zimpl/hash.h0000644001417200060250000000733013304236715015602 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: hash.h */ /* Name....: Hash Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _HASH_H_ #define _HASH_H_ #ifndef _NUMB_H_ #error "Need to include numb.h before hash.h" #endif #ifndef _ELEM_H_ #error "Need to include elem.h before hash.h" #endif #ifndef _TUPLE_H_ #error "Need to include tuple.h before hash.h" #endif #ifndef _MME_H_ #error "Need to include mme.h before hash.h (Entry,Mono)" #endif #ifdef __cplusplus extern "C" { #endif enum hash_type { HASH_ERR = 0, HASH_TUPLE, HASH_ENTRY, HASH_ELEM_IDX, HASH_NUMB, HASH_MONO }; typedef enum hash_type HashType; typedef struct hash Hash; /*lint -sem( hash_new, chneg(2), @P >= malloc(1)) */ extern Hash* hash_new(HashType type, int size); /*lint -sem( hash_free, custodial(1), cleanup, inout(1), 1P) */ extern void hash_free(Hash* hash); /*lint -sem( hash_add_tuple, inout(1), 1P >= 1, 2P >= 1) */ extern void hash_add_tuple(Hash* hash, const Tuple* tuple); /*lint -sem( hash_add_entry, inout(1), 1P >= 1, 2P >= 1) */ extern void hash_add_entry(Hash* hash, const Entry* entry); /*lint -sem( hash_add_mono, inout(1), 1P >= 1, 2P >= 1) */ extern void hash_add_mono(Hash* hash, const Mono* mono); /*lint -sem( hash_add_elem_idx, inout(1), 1P >= 1, 2p, chneg(3)) */ extern void hash_add_elem_idx(Hash* hash, const Elem* elem, int idx); /*lint -sem( hash_add_numb, inout(1), 1P >= 1, 2P >= 1) */ extern void hash_add_numb(Hash* hash, const Numb* numb); /*lint -sem( hash_has_tuple, pure, 1P >= 1, 2P >= 1) */ extern bool hash_has_tuple(const Hash* hash, const Tuple* tuple); /*lint -sem( hash_has_entry, pure, 1P >= 1, 2P >= 1) */ extern bool hash_has_entry(const Hash* hash, const Tuple* tuple); /*lint -sem( hash_has_numb, pure, 1P >= 1, 2P >= 1) */ extern bool hash_has_numb(const Hash* hash, const Numb* numb); /*lint -sem( hash_lookup_entry, pure, 1P >= 1, 2P >= 1) */ extern const Entry* hash_lookup_entry(const Hash* hash, const Tuple* tuple); /*lint -sem( hash_lookup_mono, pure, 1P >= 1, 2P >= 1) */ extern const Mono* hash_lookup_mono(const Hash* hash, const Mono* mono); /*lint -sem( hash_lookup_elem_idx, pure, 1P >= 1, 2P >= 1) */ extern int hash_lookup_elem_idx(const Hash* hash, const Elem* elem); #ifdef __cplusplus } #endif #endif /* _HASH_H_ */ zimpl-3.3.6/src/zimpl/tuple.c0000644001417200060250000001654213304236715016010 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: tuple.c */ /* Name....: Tuple Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/blkmem.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/mme.h" #include "zimpl/stmt.h" #include "zimpl/tuple.h" #define TUPLE_SID 0x5475706c #define TUPLE_STR_SIZE 100 struct tuple { SID int dim; int refc; Elem** element; }; Tuple* tuple_new(int dim) { Tuple* tuple; int count; int i; assert(dim >= 0); tuple = blk_alloc(sizeof(*tuple)); assert(tuple != NULL); /* Machen wir hier nur, weil einige Compiler bei malloc(0) * als Rueckgabe NULL liefern. Das mag das free() nicht. */ count = dim < 1 ? 1 : dim; tuple->dim = dim; tuple->refc = 1; tuple->element = calloc((size_t)count, sizeof(*tuple->element)); assert(tuple->element != NULL); for(i = 0; i < dim; i++) tuple->element[i] = NULL; SID_set(tuple, TUPLE_SID); assert(tuple_is_valid(tuple)); return tuple; } void tuple_free(Tuple* tuple) { assert(tuple_is_valid(tuple)); assert(tuple->element != NULL); tuple->refc--; if (tuple->refc == 0) { int i; for(i = 0; i < tuple->dim; i++) if (tuple->element[i] != NULL) elem_free(tuple->element[i]); SID_del(tuple); free(tuple->element); blk_free(tuple, sizeof(*tuple)); } } bool tuple_is_valid(const Tuple* tuple) { return tuple != NULL && SID_ok(tuple, TUPLE_SID) && tuple->refc > 0; } Tuple* tuple_copy(const Tuple* source) { Tuple* tuple = (Tuple*)source; assert(tuple_is_valid(tuple)); tuple->refc++; return tuple; } /* 1 = verschieden, * 0 = gleich. */ bool tuple_cmp(const Tuple* tuple_a, const Tuple* tuple_b) { int i; assert(tuple_is_valid(tuple_a)); assert(tuple_is_valid(tuple_b)); if (tuple_a == tuple_b) return false; if (tuple_a->dim != tuple_b->dim) { /* Keine Warnung wenn wir mit dem 0-Tuple vergleichen. */ if ((tuple_a->dim != 0) && (tuple_b->dim != 0)) { if (stmt_trigger_warning(167)) { fprintf(stderr, "--- Warning 167: Comparison of different dimension tuples "); tuple_print(stderr, tuple_a); fprintf(stderr, " "); tuple_print(stderr, tuple_b); fputc('\n', stderr); } } return true; } assert(tuple_a->dim == tuple_b->dim); for(i = 0; i < tuple_a->dim; i++) if (elem_cmp(tuple_a->element[i], tuple_b->element[i])) break; return i < tuple_a->dim; } int tuple_get_dim(const Tuple* tuple) { assert(tuple_is_valid(tuple)); return tuple->dim; } /*lint -e{818} supress "Pointer parameter could be declared as pointing to const" */ void tuple_set_elem(Tuple* tuple, int idx, Elem* elem) { assert(tuple_is_valid(tuple)); assert(idx >= 0); assert(idx < tuple->dim); assert(tuple->refc == 1); assert(tuple->element[idx] == NULL); tuple->element[idx] = elem; } const Elem* tuple_get_elem(const Tuple* tuple, int idx) { assert(tuple_is_valid(tuple)); assert(idx >= 0); assert(idx < tuple->dim); /* Abfrage eines noch nicht gesetzten Elements ist illegal. */ assert(tuple->element[idx] != NULL); return tuple->element[idx]; } Tuple* tuple_combine(const Tuple* ta, const Tuple* tb) { Tuple* tuple; int i; assert(tuple_is_valid(ta)); assert(tuple_is_valid(tb)); tuple = tuple_new(ta->dim + tb->dim); for(i = 0; i < ta->dim; i++) tuple->element[i] = elem_copy(ta->element[i]); for(i = 0; i < tb->dim; i++) tuple->element[ta->dim + i] = elem_copy(tb->element[i]); return tuple; } void tuple_print(FILE* fp, const Tuple* tuple) { int i; assert(tuple_is_valid(tuple)); fprintf(fp, "<"); for(i = 0; i < tuple->dim; i++) { elem_print(fp, tuple->element[i], true); fprintf(fp, "%s", (i < tuple->dim - 1) ? "," : ""); } fprintf(fp, ">"); } unsigned int tuple_hash(const Tuple* tuple) { unsigned int hcode = 0; int i; for(i = 0; i < tuple->dim; i++) hcode = DISPERSE(hcode + elem_hash(tuple->element[i])); return hcode; } #if 0 char* tuple_tostr(const Tuple* tuple) { unsigned int size = TUPLE_STR_SIZE; unsigned int len = 2; /* for the '\0' and the '[' */ char* str = malloc(size); char* selem; unsigned int selemlen; int i; assert(tuple_is_valid(tuple)); assert(str != NULL); strcpy(str, "["); for(i = 0; i < tuple->dim; i++) { selem = elem_tostr(tuple->element[i]); selemlen = strlen(selem) + 1; if (len + selemlen >= size) { size += selemlen + TUPLE_STR_SIZE; str = realloc(str, size); assert(str != NULL); } assert(len + selemlen < size); strcat(str, selem); strcat(str, i < tuple->dim - 1 ? "," : "]"); free(selem); len += selemlen; } return str; } #endif char* tuple_tostr(const Tuple* tuple) { size_t size = TUPLE_STR_SIZE; size_t len = 1; /* one for the zero '\0' */ char* str = malloc(size); int i; assert(tuple_is_valid(tuple)); assert(str != NULL); str[0] = '\0'; for(i = 0; i < tuple->dim; i++) { char* selem = elem_tostr(tuple->element[i]); size_t selemlen = strlen(selem) + 1; if (len + selemlen >= size) { size += selemlen + TUPLE_STR_SIZE; str = realloc(str, size); assert(str != NULL); } assert(len + selemlen < size); assert(elem_get_type(tuple->element[i]) == ELEM_NUMB || elem_get_type(tuple->element[i]) == ELEM_STRG); strcat(str, elem_get_type(tuple->element[i]) == ELEM_NUMB ? "#" : "$"); strcat(str, selem); free(selem); len += selemlen; } return str; } zimpl-3.3.6/src/zimpl/setrange.c0000644001417200060250000002407013304236715016462 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setrange.c */ /* Name....: Set Range Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/hash.h" #include "zimpl/stmt.h" #include "zimpl/set.h" #include "zimpl/set4.h" #ifdef _MSC_VER #pragma warning (disable: 4100) /* unreferenced formal parameter */ #endif #define SET_RANGE_SID 0x53455452 #define SET_RANGE_ITER_SID 0x53455249 /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_range_is_valid(const Set* set) { return set != NULL && SID_ok2(set->range, SET_RANGE_SID) && set->head.refc > 0 && set->head.dim == 1; } static bool set_range_iter_is_valid(const SetIter* iter) { return iter != NULL && SID_ok2(iter->range, SET_RANGE_ITER_SID) && iter->range.first >= 0 && iter->range.last >= 0 && iter->range.now >= iter->range.first; } /* ------------------------------------------------------------------------- * --- set_new * ------------------------------------------------------------------------- */ Set* set_range_new(int begin, int end, int step) { Set* set; set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = 1; set->head.members = 1 + (end - begin) / step; set->head.type = SET_RANGE; set->range.begin = begin; set->range.end = end; set->range.step = step; SID_set2(set->range, SET_RANGE_SID); assert(set_range_is_valid(set)); return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_range_copy(const Set* source) { Set* set = (Set*)source; set->head.refc++; return set; } /* ------------------------------------------------------------------------- * --- set_free * ------------------------------------------------------------------------- */ static void set_range_free(Set* set) { assert(set_range_is_valid(set)); set->head.refc--; if (set->head.refc == 0) { SID_del2(set->range); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ static int idx_to_val(SetIterIdx begin, SetIterIdx step, SetIterIdx idx) { #if 0 fprintf(stderr, "idx_to_val: %lld %lld %lld = %lld\n", begin, step, idx, begin + idx * step); #endif return begin + idx * step; } static SetIterIdx val_to_idx(SetIterIdx begin, SetIterIdx step, SetIterIdx val) { #if 0 fprintf(stderr, "val_to_idx: %lld %lld %lld = %lld\n", begin, step, val, (val - begin) / step); #endif return (val - begin) / step; } static SetIterIdx set_range_lookup_idx(const Set* set, const Tuple* tuple, int offset) { const Elem* elem; const Numb* numb; int val; assert(set_range_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); elem = tuple_get_elem(tuple, offset); /* If this is true, we asked a number set for a string. */ if (elem_get_type(elem) != ELEM_NUMB) return -1; numb = elem_get_numb(elem); assert(numb_is_int(numb)); val = numb_toint(numb); if (set->range.step > 0) { if ( val < set->range.begin || val > set->range.end || ((val - set->range.begin) % set->range.step) != 0) return -1; } else { assert(set->range.step < 0); if ( val > set->range.begin || val < set->range.end || ((set->range.begin - val) % set->range.step) != 0) return -1; } return val_to_idx(set->range.begin, set->range.step, val); } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ static void set_range_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { int val; Numb* numb; assert(set_range_is_valid(set)); assert(idx >= 0); assert(idx <= set->head.members); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); val = idx_to_val(set->range.begin, set->range.step, idx); numb = numb_new_integer(val); tuple_set_elem(tuple, offset, elem_new_numb(numb)); numb_free(numb); } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ /* Initialise Iterator. Write into iter */ static SetIter* set_range_iter_init( const Set* set, const Tuple* pattern, int offset) { const Elem* elem; SetIter* iter; assert(set_range_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(offset >= 0); assert(pattern == NULL || offset < tuple_get_dim(pattern)); iter = calloc(1, sizeof(*iter)); assert(iter != NULL); if (pattern == NULL) { iter->range.first = 0; iter->range.last = val_to_idx(set->range.begin, set->range.step, set->range.end); } else { elem = tuple_get_elem(pattern, offset); switch(elem_get_type(elem)) { case ELEM_NAME : iter->range.first = 0; iter->range.last = val_to_idx(set->range.begin, set->range.step, set->range.end); break; case ELEM_NUMB : iter->range.first = set_range_lookup_idx(set, pattern, offset); if (iter->range.first >= 0) iter->range.last = iter->range.first; else { iter->range.first = 1; iter->range.last = 0; } break; case ELEM_STRG : /* This should not happen. Probably a set with mixed * numbers and string was generated. */ default : abort(); } } iter->range.now = iter->range.first; SID_set2(iter->range, SET_RANGE_ITER_SID); assert(set_range_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* false means, there is no further element */ static bool set_range_iter_next( SetIter* iter, const Set* set, Tuple* tuple, int offset) { int val; Numb* numb; assert(set_range_iter_is_valid(iter)); assert(set_range_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); if (iter->range.now > iter->range.last) return false; val = idx_to_val(set->range.begin, set->range.step, iter->range.now); numb = numb_new_integer(val); tuple_set_elem(tuple, offset, elem_new_numb(numb)); numb_free(numb); iter->range.now++; return true; } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_range_iter_exit(SetIter* iter, UNUSED const Set* set) { assert(set_range_iter_is_valid(iter)); SID_del2(iter->range); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_range_iter_reset(SetIter* iter, UNUSED const Set* set) { assert(set_range_iter_is_valid(iter)); iter->range.now = iter->range.first; } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_range_init(SetVTab* vtab) { vtab[SET_RANGE].set_copy = set_range_copy; vtab[SET_RANGE].set_free = set_range_free; vtab[SET_RANGE].set_lookup_idx = set_range_lookup_idx; vtab[SET_RANGE].set_get_tuple = set_range_get_tuple; vtab[SET_RANGE].iter_init = set_range_iter_init; vtab[SET_RANGE].iter_next = set_range_iter_next; vtab[SET_RANGE].iter_exit = set_range_iter_exit; vtab[SET_RANGE].iter_reset = set_range_iter_reset; vtab[SET_RANGE].set_is_valid = set_range_is_valid; } zimpl-3.3.6/src/zimpl/ratlpfwrite.c0000644001417200060250000004436013304236715017221 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: lpfwrite.c */ /* Name....: LP Format File Writer */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" #include "zimpl/random.h" static void permute(int size, void** tab) { int i; if (size < 3) return; assert(size >= 3); for(i = 0; i < size; i++) { void* t; int a = rand_get_range(0, size - 1); /*lint !e426 Call to function violates semantic (1n<2n)*/ int b = rand_get_range(0, size - 1); /*lint !e426 Call to function violates semantic (1n<2n)*/ assert(a >= 0); assert(a < size); assert(b >= 0); assert(b < size); t = tab[a]; tab[a] = tab[b]; tab[b] = t; } } static void write_val(FILE* fp, LpFormat format, bool force_sign, const mpq_t val) { switch(format) { case LP_FORM_LPF : case LP_FORM_RLP : case LP_FORM_PIP : fprintf(fp, force_sign ? "%+.15g" : "%.15g", mpq_get_d(val)); break; case LP_FORM_HUM : if (force_sign && (mpq_sgn(val) > 0)) /*lint !e634 !e638 Strong type mismatch (type 'Bool') */ fprintf(fp, "+"); (void)mpq_out_str(fp, 10, val); break; default: abort(); } } static void write_lhs(FILE* fp, LpFormat format, const Con* con, ConType type) { assert(fp != NULL); assert(con != NULL); switch(type) { case CON_RHS : case CON_LHS : case CON_EQUAL : break; case CON_RANGE : write_val(fp, format, false, con->lhs); fprintf(fp, " <= "); break; default : abort(); } } static void write_rhs(FILE* fp, LpFormat format, const Con* con, ConType type) { assert(fp != NULL); assert(con != NULL); switch(type) { case CON_RHS : case CON_RANGE : fprintf(fp, " <= "); write_val(fp, format, false, con->rhs); break; case CON_LHS : fprintf(fp, " >= "); write_val(fp, format, false, con->lhs); break; case CON_EQUAL : fprintf(fp, " = "); write_val(fp, format, false, con->rhs); break; default : abort(); } fprintf(fp, "\n"); } static void write_row( FILE* fp, LpFormat format, const Con* con, char* name, int name_size) { Nzo* nzo; Nzo** nzotab; int cnt; int i; assert(fp != NULL); assert(con != NULL); assert(name != NULL); /* Add 1 in case con->size == 0 */ nzotab = calloc((size_t)con->size + 1, sizeof(*con)); assert(nzotab != NULL); for(cnt = 0, nzo = con->first; nzo != NULL; nzo = nzo->con_next) nzotab[cnt++] = nzo; assert(cnt == con->size); if (format == LP_FORM_RLP) permute(con->size, (void**)nzotab); cnt = 0; for(i = 0; i < con->size; i++) { nzo = nzotab[i]; lps_makename(name, name_size, nzo->var->name, format == LP_FORM_HUM ? -1 : nzo->var->number); if (mpq_equal(nzo->value, const_one)) fprintf(fp, " + %s", name); else if (mpq_equal(nzo->value, const_minus_one)) fprintf(fp, " - %s", name); else { fprintf(fp, " "); write_val(fp, format, true, nzo->value); fprintf(fp, " %s", name); } if (++cnt % 6 == 0) fprintf(fp, "\n "); } if (con->qme_first != NULL) { Qme* qme; if (cnt % 6 != 0) fprintf(fp, "\n "); cnt = 0; if (format == LP_FORM_LPF || format == LP_FORM_RLP) fprintf(fp, " + ["); for(qme = con->qme_first; qme != NULL; qme= qme->next) { lps_makename(name, name_size, qme->var1->name, format == LP_FORM_HUM ? -1 : qme->var1->number); if (mpq_equal(qme->value, const_one)) fprintf(fp, " + %s", name); else if (mpq_equal(qme->value, const_minus_one)) fprintf(fp, " - %s", name); else { fprintf(fp, " "); write_val(fp, format, true, qme->value); fprintf(fp, " %s", name); } if (qme->var1 == qme->var2) fprintf(fp, "^2"); else { lps_makename(name, name_size, qme->var2->name, format == LP_FORM_HUM ? -1 : qme->var2->number); fprintf(fp, " * %s", name); } if (++cnt % 6 == 0) fprintf(fp, "\n "); } if (format == LP_FORM_LPF || format == LP_FORM_RLP) { fprintf(fp, " ]\n"); cnt = 0; } } if (con->term != NULL) { const Term* term = con->term; bool only_comment = false; assert(term_get_degree(term) > 2 || !term_is_polynomial(term)); if (format != LP_FORM_PIP) { if (verbose > 0) { fprintf(stderr, "--- Warning 600: File format can only handle linear and quadratic constraints\n"); fprintf(stderr, " Constraint %s with degree %d ignored\n", con->name, term_get_degree(term)); } only_comment = true; } assert(numb_equal(term_get_constant(term), numb_zero())); if (cnt % 6 != 0) fprintf(fp, "\n "); cnt = 0; if (only_comment) fprintf(fp, "\\ "); for(i = 0; i < term_get_elements(term); i++) { const Mono* mono = term_get_element(term, i); const Numb* coeff = mono_get_coeff(mono); MFun fun = mono_get_function(mono); int k; if (fun == MFUN_NONE) { if (numb_equal(coeff, numb_one())) fprintf(fp, " +"); else { mpq_t t; mpq_init(t); numb_get_mpq(coeff, t); fprintf(fp, " "); write_val(fp, format, true, t); mpq_clear(t); } fputc(' ', fp); } else { switch(fun) { case MFUN_SQRT : fprintf(fp, " + sqrt("); break; case MFUN_LOG : fprintf(fp, " + log("); break; case MFUN_EXP : fprintf(fp, " + exp("); break; case MFUN_LN : fprintf(fp, " + ln("); break; case MFUN_SIN : fprintf(fp, " + sin("); break; case MFUN_COS : fprintf(fp, " + cos("); break; case MFUN_TAN : fprintf(fp, " + tan("); break; case MFUN_ABS : fprintf(fp, " + abs("); break; case MFUN_SGN : fprintf(fp, " + sgn("); break; case MFUN_POW : fprintf(fp, " + pow("); break; case MFUN_SGNPOW : fprintf(fp, " + sgnpow("); break; case MFUN_TRUE : case MFUN_FALSE : break; default : abort(); } } for(k = 0; k < mono_get_degree(mono); k++) { Var* var = mono_get_var(mono, k); int j; if (k > 0) fprintf(fp, " * "); for(j = 1; k + j < mono_get_degree(mono); j++) if (var != mono_get_var(mono, k + j)) break; lps_makename(name, name_size, var->name, format == LP_FORM_HUM ? -1 : var->number); if (j == 1) fprintf(fp, "%s", name); else { fprintf(fp, "%s^%d", name, j); k += j - 1; /*lint !e850 loop index variable is modified in body of the loop */ } } if (fun != MFUN_NONE) { if (fun == MFUN_POW || fun == MFUN_SGNPOW) { mpq_t t; mpq_init(t); numb_get_mpq(coeff, t); fprintf(fp, " ,"); write_val(fp, format, false, t); mpq_clear(t); } fprintf(fp, ") "); } if (++cnt % 6 == 0) fprintf(fp, "\n%s ", only_comment ? "\\" : ""); } } free(nzotab); } /* A specification for the LP file format can be found in the * ILOG CPLEX 7.0 Reference Manual page 527. * ILOG CPLEX 8.0 Reference Manual page 595. * The "Lazy Constraints" section seems to be undocumented. */ void lpf_write( const Lps* lp, FILE* fp, LpFormat format, const char* text) { const Var* var; Con* con; Con** contab; bool have_integer = false; bool have_separate = false; bool have_checkonly = false; int cnt; int i; int k; int name_size; char* name; assert(lp != NULL); assert(fp != NULL); /* Store constraint pointers and permute them * (add 1 in case lp->cons == 0) */ contab = calloc((size_t)lp->cons + 1, sizeof(*contab)); assert(contab != NULL); k = 0; for(con = lp->con_root; con != NULL; con = con->next) contab[k++] = con; assert(k == lp->cons); if (format == LP_FORM_RLP) permute(lp->cons, (void**)contab); name_size = lps_getnamesize(lp, LP_FORM_LPF); name = malloc((size_t)name_size); assert(name != NULL); if (text != NULL) fprintf(fp, "%s", text); fprintf(fp, "\\Problem name: %s\n", lp->name); fprintf(fp, "%s\n", (lp->direct == LP_MIN) ? "Minimize" : "Maximize"); fprintf(fp, " %s: ", lp->objname == NULL ? "Objective" : lp->objname); for(var = lp->var_root, cnt = 0; var != NULL; var = var->next) { /* If cost is zero, do not include in objective function */ if (mpq_equal(var->cost, const_zero)) continue; lps_makename(name, name_size, var->name, format == LP_FORM_HUM ? -1 : var->number); if (mpq_equal(var->cost, const_one)) fprintf(fp, " + %s", name); else if (mpq_equal(var->cost, const_minus_one)) fprintf(fp, " - %s", name); else { fprintf(fp, " "); write_val(fp, format, true, var->cost); fprintf(fp, " %s", name); } if (++cnt % 6 == 0) fprintf(fp, "\n "); } /* ---------------------------------------------------------------------- */ /* First loop run for normal constraints, second one for * user cuts, thrid one for lazy constraints, if any. */ for(i = 0; i < 3; i++) { if (i == 0) fprintf(fp, "\nSubject to\n"); else if (i == 1) { if (!have_separate) continue; else fprintf(fp, "\nUser Cuts\n"); } else if (i == 2) { if (!have_checkonly) continue; else fprintf(fp, "\nLazy Constraints\n"); } for(k = 0; k < lp->cons; k++) { con = contab[k]; if (con->size == 0 && con->qme_first == NULL && con->term == NULL) continue; if (i == 0 && ((con->flags & (LP_FLAG_CON_SEPAR | LP_FLAG_CON_CHECK)) != 0)) { if ((con->flags & LP_FLAG_CON_SEPAR) == LP_FLAG_CON_SEPAR) have_separate = true; if ((con->flags & LP_FLAG_CON_CHECK) == LP_FLAG_CON_CHECK) have_checkonly = true; continue; } if (i == 1 && (con->flags & LP_FLAG_CON_SEPAR) != LP_FLAG_CON_SEPAR) continue; if (i == 2 && (con->flags & LP_FLAG_CON_CHECK) != LP_FLAG_CON_CHECK) continue; if (con->type == CON_RANGE) { if (format == LP_FORM_HUM) { lps_makename(name, name_size, con->name, -1); fprintf(fp, " %s:\n ", name); write_lhs(fp, format, con, CON_RANGE); write_row(fp, format, con, name, name_size); write_rhs(fp, format, con, CON_RANGE); } else { /* Split ranges, because LP format can't handle them. */ lps_makename(name, name_size, con->name, con->number); fprintf(fp, " %sR:\n ", name); write_row(fp, format, con, name, name_size); /* changes name */ write_rhs(fp, format, con, CON_RHS); lps_makename(name, name_size, con->name, con->number); fprintf(fp, " %sL:\n ", name); write_row(fp, format, con, name, name_size); /* changes name */ write_rhs(fp, format, con, CON_LHS); } } else { lps_makename(name, name_size, con->name, format == LP_FORM_HUM ? -1 : con->number); if (i == 0) fprintf(fp, " %s:\n ", name); else if (i == 1) fprintf(fp, " %sU:\n ", name); else if (i == 2) fprintf(fp, " %sZ:\n ", name); if (con->ind_var != NULL) { lps_makename(name, name_size, con->ind_var->name, format == LP_FORM_HUM ? -1 : con->ind_var->number); fprintf(fp, "%s = %d -> ", name, con->ind_dir ? 1 : 0); } write_row(fp, format, con, name, name_size); write_rhs(fp, format, con, con->type); } } } /* ---------------------------------------------------------------------- */ fprintf(fp, "Bounds\n"); for(var = lp->var_root; var != NULL; var = var->next) { /* A variable without any entries in the matrix * or the objective function can be ignored. * (also not part of an SOS or quadratic constraint) */ if (var->size == 0 && mpq_equal(var->cost, const_zero) && !var->is_used) continue; lps_makename(name, name_size, var->name, format == LP_FORM_HUM ? -1 : var->number); if (var->type == VAR_FIXED) { fprintf(fp, " %s = ", name); write_val(fp, format, false, var->lower); fprintf(fp, "\n"); } else { /* Check if we have integer variables */ if (var->vclass == VAR_INT) have_integer = true; fprintf(fp, " "); if (var->type == VAR_LOWER || var->type == VAR_BOXED) write_val(fp, format, false, var->lower); else fprintf(fp, "-inf"); fprintf(fp, " <= %s <= ", name); if (var->type == VAR_UPPER || var->type == VAR_BOXED) { write_val(fp, format, false, var->upper); fprintf(fp, "\n"); } else fprintf(fp, "+inf\n"); } } /* ---------------------------------------------------------------------- */ if (have_integer) { fprintf(fp, "General\n"); for(var = lp->var_root; var != NULL; var = var->next) { if (var->vclass != VAR_INT) continue; if (var->size == 0 && mpq_equal(var->cost, const_zero) && !var->is_used) continue; lps_makename(name, name_size, var->name, format == LP_FORM_HUM ? -1 : var->number); fprintf(fp, " %s\n", name); } } /* ---------------------------------------------------------------------- */ if (lps_has_sos(lp)) { const Sos* sos; const Sse* sse; fprintf(fp, "SOS\n"); for(sos = lp->sos_root; sos != NULL; sos = sos->next) { cnt = 0; fprintf(fp, " %s:S%d:: ", sos->name, sos->type == SOS_TYPE1 ? 1 : 2); for(sse = sos->first; sse != NULL; sse = sse->next) { lps_makename(name, name_size, sse->var->name, format == LP_FORM_HUM ? -1 : sse->var->number); fprintf(fp, " %s:", name); write_val(fp, format, false, sse->weight); if (++cnt % 6 == 0) fputc('\n', fp); } if (cnt % 6 != 0) fputc('\n', fp); } } fprintf(fp, "End\n"); free(name); free(contab); } /* ------------------------------------------------------------------------- */ /* Emacs Local Variables: */ /* Emacs mode:c */ /* Emacs c-basic-offset:3 */ /* Emacs tab-width:8 */ /* Emacs indent-tabs-mode:nil */ /* Emacs End: */ /* ------------------------------------------------------------------------- */ zimpl-3.3.6/src/zimpl/setmulti.c0000644001417200060250000004572513304236715016532 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setmulti.c */ /* Name....: Set Multi Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/list.h" #include "zimpl/hash.h" #include "zimpl/stmt.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/set4.h" #ifdef _MSC_VER #pragma warning (disable: 4100) /* unreferenced formal parameter */ #endif #define SET_MULTI_SID 0x5345544d #define SET_MULTI_ITER_SID 0x53454d49 /* This is a bloody hack. But there seems to be no easy way to give * additional information to the compare routine needed for qsort(). */ static const Set* cmp_set = NULL; static int cmp_dim = 0; /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_multi_is_valid(const Set* set) { return set != NULL && SID_ok2(set->multi, SET_MULTI_SID) && set->head.refc > 0 && set->head.dim > 1 && set->multi.subset != NULL && set->multi.set != NULL; } static bool set_multi_iter_is_valid(const SetIter* iter) { return iter != NULL && SID_ok2(iter->multi, SET_MULTI_ITER_SID) && iter->multi.members >= 0 && iter->multi.now >= 0 && ( (iter->multi.members == 0 && iter->multi.dim == 0 && iter->multi.subset == NULL) || (iter->multi.members >= 0 && iter->multi.dim > 0 && iter->multi.subset != NULL)); } /* ------------------------------------------------------------------------- * --- internal * ------------------------------------------------------------------------- */ static int subset_cmp(const void* a, const void* b) { const SetIterIdx* aa = (const SetIterIdx*)a; const SetIterIdx* bb = (const SetIterIdx*)b; for(int i = 0; i < cmp_dim; i++) { SetIterIdx d = aa[i] - bb[i]; if (d < 0) return -1; if (d > 0) return 1; } return 0; } static int order_cmp(const void* a, const void* b) { const SetIterIdx* aa = (const SetIterIdx*)a; const SetIterIdx* bb = (const SetIterIdx*)b; assert(cmp_set != NULL); assert(cmp_dim >= 0); assert(cmp_dim < cmp_set->head.dim); SetIterIdx ai = *aa * cmp_set->head.dim + cmp_dim; SetIterIdx bi = *bb * cmp_set->head.dim + cmp_dim; SetIterIdx d = cmp_set->multi.subset[ai] - cmp_set->multi.subset[bi]; if (d < 0) return -1; if (d > 0) return 1; return 0; } /* ------------------------------------------------------------------------- * --- new * ------------------------------------------------------------------------- */ Set* set_multi_new_from_list(const List* list, SetCheckType check) { assert(list_is_valid(list)); ListElem* le = NULL; Hash* hash = NULL; bool is_entrylist = list_is_entrylist(list); int n = list_get_elems(list); const Tuple* tuple = is_entrylist ? entry_get_tuple(list_get_entry(list, &le)) : list_get_tuple(list, &le); int dim = tuple_get_dim(tuple); assert(n > 0); assert(dim > 1); Set* set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = dim; set->head.members = 0; set->head.type = SET_MULTI; set->multi.set = calloc((size_t)dim, sizeof(*set->multi.set)); set->multi.subset = calloc((size_t)(n * dim), sizeof(*set->multi.subset)); set->multi.order = calloc((size_t)dim, sizeof(*set->multi.order)); assert(set->multi.set != NULL); assert(set->multi.subset != NULL); assert(set->multi.order != NULL); for(int k = 0; k < dim; k++) set->multi.set[k] = set_list_new(n, SET_DEFAULT); if (check != SET_CHECK_NONE) hash = hash_new(HASH_TUPLE, n); le = NULL; for(int i = 0; i < n; i++) { tuple = is_entrylist ? entry_get_tuple(list_get_entry(list, &le)) : list_get_tuple(list, &le); assert(tuple != NULL); assert(hash != NULL || check == SET_CHECK_NONE); if (hash != NULL && hash_has_tuple(hash, tuple)) { if (check == SET_CHECK_WARN) { if (stmt_trigger_warning(164)) { fprintf(stderr, "--- Warning 164: Duplicate element "); tuple_print(stderr, tuple); fprintf(stderr, " for set rejected\n"); } } } else { if (hash != NULL) hash_add_tuple(hash, tuple); for(int k = 0; k < dim; k++) set->multi.subset[set->head.members * dim + k] = set_list_add_elem(set->multi.set[k], tuple_get_elem(tuple, k), SET_CHECK_QUIET); set->head.members++; } } if (hash != NULL) hash_free(hash); /* Bloody hack! */ cmp_set = set; cmp_dim = dim; /* Sort subset */ qsort(set->multi.subset, (size_t)set->head.members, (size_t)dim * sizeof(*set->multi.subset), subset_cmp); /* This could be done also later On-Demand */ for(int k = 0; k < dim; k++) { set->multi.order[k] = calloc((size_t)set->head.members, sizeof(**set->multi.order)); assert(set->multi.order[k] != NULL); for(SetIterIdx i = 0; i < set->head.members; i++) set->multi.order[k][i] = i; /* No need to sort order[0] because subset ist already sorted. */ if (k > 0) { cmp_dim = k; qsort(set->multi.order[k], (size_t)set->head.members, sizeof(**set->multi.order), order_cmp); } #ifndef NDEBUG /* Make sure order is sorted */ for(SetIterIdx i = 0; i < set->head.members - 1; i++) { SetIterIdx a = set->multi.order[k][i] * set->head.dim + k; SetIterIdx b = set->multi.order[k][i + 1] * set->head.dim + k; assert(set->multi.subset[a] <= set->multi.subset[b]); } #endif /* !NDEBUG */ } SID_set2(set->multi, SET_MULTI_SID); assert(set_multi_is_valid(set)); #ifndef NDEBUG le = NULL; for(int i = 0; i < n; i++) { tuple = is_entrylist ? entry_get_tuple(list_get_entry(list, &le)) : list_get_tuple(list, &le); assert(set_lookup(set, tuple)); } #endif return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_multi_copy(const Set* source) { Set* set = (Set*)source; int i; assert(set_multi_is_valid(source)); set->head.refc++; for(i = 0; i < set->head.dim; i++) (void)set_copy(set->multi.set[i]); return set; } /* ------------------------------------------------------------------------- * --- free * ------------------------------------------------------------------------- */ static void set_multi_free(Set* set) { int i; assert(set_multi_is_valid(set)); for(i = 0; i < set->head.dim; i++) set_free(set->multi.set[i]); set->head.refc--; if (set->head.refc == 0) { SID_del2(set->multi); for(i = 0; i < set->head.dim; i++) free(set->multi.order[i]); free(set->multi.order); free(set->multi.set); free(set->multi.subset); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ static int subset_idx_cmp(const void* a, const void* b) { const SetIterIdx* key = (const SetIterIdx*)a; const SetIterIdx* subset = (const SetIterIdx*)b; int i; assert(key != NULL); assert(subset != NULL); assert(cmp_dim > 0); for(i = 0; i < cmp_dim; i++) { SetIterIdx d = key[i] - subset[i]; if (d < 0) return -1; if (d > 0) return 1; } return 0; } static int order_idx_cmp(const void* a, const void* b) { const SetIterIdx* key = (const SetIterIdx*)a; const SetIterIdx* order = (const SetIterIdx*)b; assert(key != NULL); assert(order != NULL); assert(cmp_set != NULL); assert(cmp_dim >= 0); assert(cmp_dim < cmp_set->head.dim); assert(*order >= 0); assert(*order < cmp_set->head.members); SetIterIdx d = *key - cmp_set->multi.subset[*order * cmp_set->head.dim + cmp_dim]; if (d < 0) return -1; if (d > 0) return 1; return 0; } /* return the index of the element, -1 if not found */ static SetIterIdx set_multi_lookup_idx(const Set* set, const Tuple* tuple, int offset) { SetIterIdx* idx; ptrdiff_t result; assert(set_multi_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); idx = malloc((size_t)set->head.dim * sizeof(*idx)); assert(idx != NULL); for(int i = 0; i < set->head.dim; i++) { idx[i] = set_lookup_idx(set->multi.set[i], tuple, offset + i); if (idx[i] < 0) { free(idx); return -1; } } cmp_dim = set->head.dim; result = (ptrdiff_t)bsearch(idx, set->multi.subset, (size_t)set->head.members, (size_t)set->head.dim * sizeof(*set->multi.subset), subset_idx_cmp); free(idx); if (result == 0) return -1; assert((result - (ptrdiff_t)set->multi.subset) % (ptrdiff_t)((size_t)set->head.dim * sizeof(*set->multi.subset)) == 0); SetIterIdx k = (SetIterIdx)(result - (ptrdiff_t)set->multi.subset) / (ptrdiff_t)((size_t)set->head.dim * sizeof(*set->multi.subset)); assert(k >= 0); assert(k < set->head.members); return k; } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ static void set_multi_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { assert(set_multi_is_valid(set)); assert(idx >= 0); assert(idx <= set->head.members); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset + set->head.dim <= tuple_get_dim(tuple)); for(int i = 0; i < set->head.dim; i++) { tuple_set_elem(tuple, offset + i, elem_copy(set_list_get_elem(set->multi.set[i], set->multi.subset[idx * set->head.dim + i]))); } } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ static SetIter* set_multi_iter_init( const Set* set, const Tuple* pattern, int offset) { SetIter* iter; SetIterIdx* idx; int i; SetIterIdx j; int k; int m; int first; int last; ptrdiff_t result; int fixed_idx = -1; assert(set_multi_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(offset >= 0); assert(pattern == NULL || offset < tuple_get_dim(pattern)); iter = calloc(1, sizeof(*iter)); assert(iter != NULL); idx = malloc((size_t)set->head.dim * sizeof(*idx)); assert(idx != NULL); for(i = 0; i < set->head.dim; i++) { if (pattern == NULL || elem_get_type(tuple_get_elem(pattern, offset + i)) == ELEM_NAME) idx[i] = -1; else { idx[i] = set_lookup_idx(set->multi.set[i], pattern, offset + i); if (idx[i] < 0) break; fixed_idx = i; } } /* Impossible pattern ? */ if (i < set->head.dim) { iter->multi.members = 0; iter->multi.now = 0; } else { iter->multi.dim = set->head.dim; iter->multi.subset = calloc((size_t)set->head.members, (size_t)set->head.dim * sizeof(*iter->multi.subset)); assert(iter->multi.subset); /* Pattern matches all members ? */ if (fixed_idx < 0) { iter->multi.members = set->head.members; iter->multi.now = 0; memcpy(iter->multi.subset, set->multi.subset, (size_t)(iter->multi.members * iter->multi.dim) * sizeof(*iter->multi.subset)); } else { assert(fixed_idx >= 0); cmp_set = set; cmp_dim = fixed_idx; result = (ptrdiff_t)bsearch( &idx[fixed_idx], set->multi.order[fixed_idx], (size_t)set->head.members, sizeof(**set->multi.order), order_idx_cmp); #if 0 if (result == 0) { for(i = 0; i < set->head.members; i++) fprintf(stderr, "%d %d %d\n", i, set->multi.order[fixed_idx][i], set->multi.subset[set->multi.order[fixed_idx][i] * set->head.dim + fixed_idx]); } #endif assert(result != 0); k = (int)(result - (ptrdiff_t)set->multi.order[fixed_idx]) / (ptrdiff_t)sizeof(**set->multi.order); assert(k >= 0); assert(k < set->head.members); j = set->multi.order[fixed_idx][k]; assert(j >= 0); assert(j < set->head.members); assert(idx[fixed_idx] == set->multi.subset[j * set->head.dim + fixed_idx]); #if 0 fprintf(stderr, "@ fixe_idx: %d idx[]=%d k=%d j=%d\n", fixed_idx, idx[fixed_idx], k, j); #endif for(first = k; first >= 0; first--) { j = set->multi.order[fixed_idx][first] * set->head.dim + fixed_idx; if (idx[fixed_idx] != set->multi.subset[j]) { assert(idx[fixed_idx] > set->multi.subset[j]); break; } } for(last = k; last < set->head.members; last++) { j = set->multi.order[fixed_idx][last] * set->head.dim + fixed_idx; if (idx[fixed_idx] != set->multi.subset[j]) { assert(idx[fixed_idx] < set->multi.subset[j]); break; } } assert(first + 1 < last); m = 0; for(k = first + 1; k < last; k++) { j = set->multi.order[fixed_idx][k]; assert(idx[fixed_idx] == set->multi.subset[j * set->head.dim + fixed_idx]); for(i = 0; i < set->head.dim; i++) { /* can entry match ? */ if (idx[i] >= 0 && idx[i] != set->multi.subset[j * set->head.dim + i]) break; iter->multi.subset[m * set->head.dim + i] = set->multi.subset[j * set->head.dim + i]; } if (i == set->head.dim) m++; } iter->multi.members = m; iter->multi.now = 0; } } #if 0 fprintf(stderr, "set_multi_iter_init dim=%d members=%d\n", set->head.dim, iter->multi.members); for(i = 0; i < set->head.dim; i++) fprintf(stderr, "idx[%d]=%d\n", i, idx[i]); #endif free(idx); SID_set2(iter->multi, SET_MULTI_ITER_SID); assert(set_multi_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* false means, there is no further element */ static bool set_multi_iter_next( SetIter* iter, const Set* set, Tuple* tuple, int offset) { assert(set_multi_iter_is_valid(iter)); assert(set_multi_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset + set->head.dim <= tuple_get_dim(tuple)); if (iter->multi.now >= iter->multi.members) return false; for(int i = 0; i < iter->multi.dim; i++) tuple_set_elem(tuple, offset + i, elem_copy(set_list_get_elem(set->multi.set[i], iter->multi.subset[iter->multi.now * iter->multi.dim + i]))); iter->multi.now++; return true; } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_multi_iter_exit(SetIter* iter, UNUSED const Set* set) { assert(set_multi_iter_is_valid(iter)); SID_del2(iter->multi); if (iter->multi.subset != NULL) free(iter->multi.subset); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_multi_iter_reset(SetIter* iter, UNUSED const Set* set) { assert(set_multi_iter_is_valid(iter)); iter->multi.now = 0; } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_multi_init(SetVTab* vtab) { vtab[SET_MULTI].set_copy = set_multi_copy; vtab[SET_MULTI].set_free = set_multi_free; vtab[SET_MULTI].set_lookup_idx = set_multi_lookup_idx; vtab[SET_MULTI].set_get_tuple = set_multi_get_tuple; vtab[SET_MULTI].iter_init = set_multi_iter_init; vtab[SET_MULTI].iter_next = set_multi_iter_next; vtab[SET_MULTI].iter_exit = set_multi_iter_exit; vtab[SET_MULTI].iter_reset = set_multi_iter_reset; vtab[SET_MULTI].set_is_valid = set_multi_is_valid; } zimpl-3.3.6/src/zimpl/strstore2.c0000644001417200060250000000773213304236715016627 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: strstore2.c */ /* Name....: String Storage Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/strstore.h" #include "zimpl/mme.h" typedef struct string_storage StrStore; struct string_storage { char* begin; size_t size; size_t used; StrStore* next; }; #define MIN_STR_STORE_SIZE 65536UL /* 64k */ #define MAX_STR_STORE_SIZE 1073741824UL /* 1G */ static StrStore* store_anchor = NULL; static size_t store_size = MIN_STR_STORE_SIZE; static void extend_storage(void) { StrStore* store; assert(store_size > 0); /* Since we will not allocate anything again in this block, resize it to fit. * (not clear if this is really usefull) */ if (store_anchor != NULL) { store_anchor->begin = realloc(store_anchor->begin, store_anchor->used * sizeof(*store_anchor->begin)); store_anchor->size = store_anchor->used; } store = calloc(1, sizeof(*store_anchor)); assert(store != NULL); store->size = store_size; store->used = 0; store->next = store_anchor; store->begin = calloc(store_size, sizeof(*store->begin)); assert(store->begin != NULL); store_anchor = store; } const char* str_new(const char* s) { char* t; size_t len; assert(store_anchor != NULL); assert(s != NULL); len = strlen(s) + 1; if (len > MAX_STR_STORE_SIZE) { fprintf(stderr, "*** Error 803: String too long %zu > %zu\n", len + 1, (size_t)MAX_STR_STORE_SIZE); zpl_exit(EXIT_FAILURE); } if (store_anchor->size - store_anchor->used < len) { /* Double the store_size at least once each time, * but more often in case it is not big enough to hold a very long * string. */ if (store_size < MAX_STR_STORE_SIZE) { do { store_size *= 2; } while(len > store_size); } extend_storage(); } assert(store_anchor->size - store_anchor->used >= len); t = &store_anchor->begin[store_anchor->used]; store_anchor->used += len; return strcpy(t, s); } void str_init(void) { extend_storage(); } void str_exit(void) { StrStore* p; StrStore* q; for(p = store_anchor; p != NULL; p = q) { q = p->next; free(p->begin); free(p); } store_anchor = NULL; } unsigned int str_hash(const char* s) { #if 0 return (unsigned int)s; #else unsigned int sum = 0; int i; for(i = 0; s[i] != '\0'; i++) sum = sum * 31 + (unsigned int)s[i]; return sum; #endif } zimpl-3.3.6/src/zimpl/list.h0000644001417200060250000001052613304236715015633 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: list.h */ /* Name....: List Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _LIST_H_ #define _LIST_H_ #ifndef _MME_H_ #error "Need to include mme.h before list.h" #endif #ifdef __cplusplus extern "C" { #endif #define LIST_NULL ((List*)0) /*lint -sem( list_new_elem, 1p == 1, @P > malloc(1P)) */ extern List* list_new_elem(const Elem* elem); /*lint -sem( list_new_tuple, 1p == 1, @P > malloc(1P)) */ extern List* list_new_tuple(const Tuple* tuple); /*lint -sem( list_new_entry, 1p == 1, @P > malloc(1P)) */ extern List* list_new_entry(const Entry* entry); /*lint -sem( list_new_list, 1p == 1, @P > malloc(1P)) */ extern List* list_new_list(const List* list); /*lint -sem( list_free, custodial(1), 1p == 1) */ extern void list_free(List* list); /*lint -sem( list_is_valid, 1p == 1) */ extern bool list_is_valid(const List* list); /*lint -sem( list_is_elemlist, 1p == 1) */ extern bool list_is_elemlist(const List* list); /*lint -sem( list_is_entrylist, 1p == 1) */ extern bool list_is_entrylist(const List* list); /*lint -sem( list_is_tuplelist, 1p == 1) */ extern bool list_is_tuplelist(const List* list); /*lint -sem( list_copy, 1p == 1, @P > malloc(1P)) */ extern List* list_copy(const List* list); /*lint -sem( list_add_list, 1p == 1 && 2p == 1) */ extern void list_add_list(List* list, const List* ll); /*lint -sem( list_add_elem, 1p == 1 && 2p == 1) */ extern void list_add_elem(List* list, const Elem* elem); /*lint -sem( list_add_tuple, 1p == 1 && 2p == 1) */ extern void list_add_tuple(List* list, const Tuple* tuple); /*lint -sem( list_add_entry, 1p == 1 && 2p == 1) */ extern void list_add_entry(List* list, const Entry* entry); /*lint -sem( list_insert_elem, 1p == 1 && 2p == 1) */ extern void list_insert_elem(List* list, const Elem* elem); /*lint -sem( list_insert_tuple, 1p == 1 && 2p == 1) */ extern void list_insert_tuple(List* list, const Tuple* tuple); /*lint -sem( list_insert_entry, 1p == 1 && 2p == 1) */ extern void list_insert_entry(List* list, const Entry* entry); /*lint -sem( list_get_elems, 1p == 1, @n >= 0) */ extern int list_get_elems(const List* list); /*lint -sem( list_get_elem, 1p == 1, @P > malloc(1P)) */ extern const Elem* list_get_elem(const List* list, ListElem** idxp); /*lint -sem( list_get_tuple, 1p == 1, @P > malloc(1P)) */ extern const Tuple* list_get_tuple(const List* list, ListElem** idxp); /*lint -sem( list_get_entry, 1p == 1, @P > malloc(1P)) */ extern const Entry* list_get_entry(const List* list, ListElem** idxp); /*lint -sem( list_get_list, 1p == 1, @P > malloc(1P)) */ extern const List* list_get_list(const List* list, ListElem** idxp); /*lint -sem( list_print, 1p == 1 && 2p == 1) */ extern void list_print(FILE* fp, const List* list); #ifdef __cplusplus } #endif #endif /* _LIST_H_ */ zimpl-3.3.6/src/zimpl/setprod.c0000644001417200060250000002535713304236715016343 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setprod.c */ /* Name....: Set Product Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/hash.h" #include "zimpl/set.h" #include "zimpl/set4.h" #define SET_PROD_SID 0x53455450 #define SET_PROD_ITER_SID 0x53455049 /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_prod_is_valid(const Set* set) { return set != NULL && SID_ok2(set->prod, SET_PROD_SID) && set->head.refc > 0 && set->head.dim > 1 && set->head.members >=0 && set_is_valid(set->prod.set_a) && set_is_valid(set->prod.set_b); } static bool set_prod_iter_is_valid(const SetIter* iter) { return iter != NULL && SID_ok2(iter->prod, SET_PROD_ITER_SID) && iter->prod.iter_a != NULL && iter->prod.iter_b != NULL; } /* ------------------------------------------------------------------------- * --- set_new * ------------------------------------------------------------------------- */ Set* set_prod_new(const Set* a, const Set* b) { assert(set_is_valid(a)); assert(set_is_valid(b)); assert(a->head.type != SET_PSEUDO); assert(b->head.type != SET_PSEUDO); if (a->head.type == SET_EMPTY || b->head.type == SET_EMPTY) return set_empty_new(a->head.dim + b->head.dim); Set* set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = a->head.dim + b->head.dim; set->head.members = a->head.members * b->head.members; set->head.type = SET_PROD; set->prod.set_a = set_copy(a); set->prod.set_b = set_copy(b); SID_set2(set->prod, SET_PROD_SID); assert(set_prod_is_valid(set)); return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_prod_copy(const Set* source) { Set* set = (Set*)source; set->head.refc++; (void)set_copy(set->prod.set_a); (void)set_copy(set->prod.set_b); return set; } /* ------------------------------------------------------------------------- * --- set_free * ------------------------------------------------------------------------- */ static void set_prod_free(Set* set) { assert(set_prod_is_valid(set)); set_free(set->prod.set_a); set_free(set->prod.set_b); set->head.refc--; if (set->head.refc == 0) { SID_del2(set->prod); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ static SetIterIdx set_prod_lookup_idx(const Set* set, const Tuple* tuple, int offset) { assert(set_prod_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); SetIterIdx idx_a = set_lookup_idx(set->prod.set_a, tuple, offset); if (idx_a < 0) return -1; offset += set->prod.set_a->head.dim; SetIterIdx idx_b = set_lookup_idx(set->prod.set_b, tuple, offset); if (idx_b < 0) return -1; SetIterIdx result = idx_a * set->prod.set_b->head.members + idx_b; assert(result >= 0); // Check for overflow return result; } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ static void set_prod_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { assert(set_prod_is_valid(set)); assert(idx >= 0); assert(idx <= set->head.members); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset + set->head.dim <= tuple_get_dim(tuple)); const Set* a = set->prod.set_a; const Set* b = set->prod.set_b; int offset2 = offset + a->head.dim; set_get_tuple_intern(a, idx / b->head.members, tuple, offset); set_get_tuple_intern(b, idx % b->head.members, tuple, offset2); } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ /* Initialise Iterator. Write into iter */ static SetIter* set_prod_iter_init( const Set* set, const Tuple* pattern, int offset) { assert(set_prod_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(offset >= 0); assert(pattern == NULL || offset < tuple_get_dim(pattern)); SetIter* iter = calloc(1, sizeof(*iter)); assert(iter != NULL); iter->prod.elem = calloc((size_t)set->head.dim, sizeof(*iter->prod.elem)); assert(iter->prod.elem != NULL); iter->prod.first = true; iter->prod.iter_a = set_iter_init_intern(set->prod.set_a, pattern, offset); iter->prod.iter_b = set_iter_init_intern(set->prod.set_b, pattern, offset + set->prod.set_a->head.dim); SID_set2(iter->prod, SET_PROD_ITER_SID); assert(set_prod_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* This gets the fore part of the product and saves it and * also gets the back part */ static bool get_both_parts( const Set* a, const Set* b, SetIter* iter, SetIter* iter_a, SetIter* iter_b, Tuple* tuple, int offset, int offset2) { if (!set_iter_next_intern(iter_a, a, tuple, offset)) return false; for(int i = 0; i < a->head.dim; i++) { assert(iter->prod.elem[i] == NULL); iter->prod.elem[i] = elem_copy(tuple_get_elem(tuple, i + offset)); assert(elem_is_valid(iter->prod.elem[i])); } if (!set_iter_next_intern(iter_b, b, tuple, offset2)) return false; return true; } /* false means, there is no further element */ /*ARGSUSED*/ static bool set_prod_iter_next( SetIter* iter, const Set* set, Tuple* tuple, int offset) { assert(set_prod_iter_is_valid(iter)); assert(set_prod_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset + set->head.dim <= tuple_get_dim(tuple)); Set* a = set->prod.set_a; Set* b = set->prod.set_b; SetIter* iter_a = iter->prod.iter_a; SetIter* iter_b = iter->prod.iter_b; int offset2 = offset + a->head.dim; if (iter->prod.first) { iter->prod.first = false; return get_both_parts(a, b, iter, iter_a, iter_b, tuple, offset, offset2); } assert(!iter->prod.first); /* Get back part */ if (set_iter_next_intern(iter_b, b, tuple, offset2)) { /* copy fore part */ for(int i = 0; i < a->head.dim; i++) tuple_set_elem(tuple, i + offset, elem_copy(iter->prod.elem[i])); return true; } /* No back part, so reset it */ set_iter_reset_intern(iter_b, b); /* Clear elem cache */ for(int i = 0; i < set->head.dim; i++) { if (iter->prod.elem[i] != NULL) { elem_free(iter->prod.elem[i]); iter->prod.elem[i] = NULL; } } return get_both_parts(a, b, iter, iter_a, iter_b, tuple, offset, offset2); } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_prod_iter_exit(SetIter* iter, const Set* set) { assert(set_prod_iter_is_valid(iter)); assert(set_prod_is_valid(set)); SID_del2(iter->prod); set_iter_exit_intern(iter->prod.iter_a, set->prod.set_a); set_iter_exit_intern(iter->prod.iter_b, set->prod.set_b); for(int i = 0; i < set->head.dim; i++) if (iter->prod.elem[i] != NULL) elem_free(iter->prod.elem[i]); free(iter->prod.elem); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_prod_iter_reset(SetIter* iter, const Set* set) { assert(set_prod_iter_is_valid(iter)); assert(set_prod_is_valid(set)); iter->prod.first = true; set_iter_reset_intern(iter->prod.iter_a, set->prod.set_a); set_iter_reset_intern(iter->prod.iter_b, set->prod.set_b); } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_prod_init(SetVTab* vtab) { vtab[SET_PROD].set_copy = set_prod_copy; vtab[SET_PROD].set_free = set_prod_free; vtab[SET_PROD].set_lookup_idx = set_prod_lookup_idx; vtab[SET_PROD].set_get_tuple = set_prod_get_tuple; vtab[SET_PROD].iter_init = set_prod_iter_init; vtab[SET_PROD].iter_next = set_prod_iter_next; vtab[SET_PROD].iter_exit = set_prod_iter_exit; vtab[SET_PROD].iter_reset = set_prod_iter_reset; vtab[SET_PROD].set_is_valid = set_prod_is_valid; } zimpl-3.3.6/src/zimpl/elem.h0000644001417200060250000000666113304236715015607 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: elem.h */ /* Name....: Element Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _ELEM_H_ #define _ELEM_H_ #ifndef _NUMB_H_ #error "Need to include numb.h before elem.h" #endif #ifdef __cplusplus extern "C" { #endif enum element_type { ELEM_ERR = 0, ELEM_FREE, ELEM_NUMB, ELEM_STRG, ELEM_NAME }; typedef enum element_type ElemType; typedef struct element Elem; #define ELEM_NULL ((Elem*)0) extern void elem_init(void); extern void elem_exit(void); /*lint -sem( elem_new_numb, @P > malloc(1P)) */ extern Elem* elem_new_numb(const Numb* n); /*lint -sem( elem_new_strg, nulterm(1), 1p, @P > malloc(1P)) */ extern Elem* elem_new_strg(const char* s); /*lint -sem( elem_new_name, nulterm(1), 1p, @P > malloc(1P)) */ extern Elem* elem_new_name(const char* s); /*lint -sem( elem_free, custodial(1), 1p == 1) */ extern void elem_free(Elem* elem); /*lint -sem( elem_is_valid, 1p == 1) */ extern bool elem_is_valid(const Elem* elem); /*lint -sem( elem_copy, 1p == 1, @P > malloc(1P)) */ extern Elem* elem_copy(const Elem* elem); /*lint -sem( elem_cmp, 1p == 1 && 2p == 1) */ extern bool elem_cmp(const Elem* elem_a, const Elem* elem_b); /*lint -sem( elem_get_type, 1p == 1) */ extern ElemType elem_get_type(const Elem* elem); /*lint -sem( elem_get_numb, 1p == 1) */ extern const Numb* elem_get_numb(const Elem* elem); /*lint -sem( elem_get_strg, 1p == 1, @P > malloc(1P) && nulterm(@)) */ extern const char* elem_get_strg(const Elem* elem); /*lint -sem( elem_get_name, 1p == 1, @P > malloc(1P) && nulterm(@)) */ extern const char* elem_get_name(const Elem* elem); /*lint -sem( elem_print, 1p == 1 && 2p == 1) */ extern void elem_print(FILE* fp, const Elem* elem, bool use_quotes); /*lint -sem( elem_hash, 1p == 1) */ extern unsigned int elem_hash(const Elem* elem); /*lint -sem( elem_tostr, 1p == 1, @P > malloc(1P) && nulterm(@)) */ extern char* elem_tostr(const Elem* elem); #ifdef __cplusplus } #endif #endif /* _ELEM_H_ */ zimpl-3.3.6/src/zimpl/symbol.c0000644001417200060250000001734613304236715016167 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: symbol.c */ /* Name....: Symbol Table Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/hash.h" #include "zimpl/stmt.h" #include "zimpl/symbol.h" #define TEST_DUBLICATE 0 #define SYMBOL_SID 0x53796d62 #define SYMBOL_EXTEND_SIZE 100 struct symbol { SID const char* name; int size; int used; int extend; SymbolType type; Set* set; Hash* hash; Entry** entry; Entry* deflt; Symbol* next; }; static Symbol* anchor = NULL; Symbol* symbol_new( const char* name, SymbolType type, const Set* set, int estimated_size, const Entry* deflt) { Symbol* sym; assert(name != NULL); assert(strlen(name) > 0); assert(set != NULL); assert(estimated_size >= 0); sym = calloc(1, sizeof(*sym)); assert(sym != NULL); sym->name = name; sym->type = type; sym->size = 1; sym->used = 0; sym->extend = SYMBOL_EXTEND_SIZE; sym->set = set_copy(set); sym->hash = hash_new(HASH_ENTRY, estimated_size); sym->entry = calloc(1, sizeof(*sym->entry)); sym->deflt = (deflt != ENTRY_NULL) ? entry_copy(deflt) : ENTRY_NULL; sym->next = anchor; anchor = sym; assert(sym->entry != NULL); SID_set(sym, SYMBOL_SID); assert(symbol_is_valid(sym)); return sym; } void symbol_exit(void) { Symbol* q; Symbol* p; int i; for(p = anchor; p != NULL; p = q) { assert(symbol_is_valid(p)); SID_del(p); q = p->next; for(i = 0; i < p->used; i++) entry_free(p->entry[i]); free(p->entry); set_free(p->set); hash_free(p->hash); if (p->deflt != NULL) entry_free(p->deflt); free(p); } anchor = NULL; } bool symbol_is_valid(const Symbol* sym) { if (sym == NULL || !SID_ok(sym, SYMBOL_SID)) return false; mem_check(sym); mem_check(sym->entry); return true; } Symbol* symbol_lookup(const char* name) { Symbol* sym; assert(name != NULL); for(sym = anchor; sym != NULL; sym = sym->next) if (!strcmp(sym->name, name)) break; return sym; } bool symbol_has_entry(const Symbol* sym, const Tuple* tuple) { assert(symbol_is_valid(sym)); assert(tuple_is_valid(tuple)); return hash_has_entry(sym->hash, tuple) || (sym->deflt != NULL && set_lookup(sym->set, tuple)); } /* Liefert NULL wenn nicht gefunden. * Falls ein default zurueckgegeben wird, stimmt "tuple" nicht mit * entry->tuple ueberein. */ const Entry* symbol_lookup_entry(const Symbol* sym, const Tuple* tuple) { const Entry* entry; assert(symbol_is_valid(sym)); assert(tuple_is_valid(tuple)); entry = hash_lookup_entry(sym->hash, tuple); if (NULL == entry && sym->deflt != NULL && set_lookup(sym->set, tuple)) entry = sym->deflt; return entry; } /* Entry is eaten. * No check is done if entry->tuple is a member of sym->set ! * This has to be done before. */ void symbol_add_entry(Symbol* sym, Entry* entry) { const Tuple* tuple; assert(symbol_is_valid(sym)); assert(entry_is_valid(entry)); assert(sym->used <= sym->size); if (sym->used == sym->size) { sym->size += sym->extend; sym->extend += sym->extend; sym->entry = realloc( sym->entry, (size_t)sym->size * sizeof(*sym->entry)); assert(sym->entry != NULL); } assert(sym->used < sym->size); tuple = entry_get_tuple(entry); /* There is no index set for the internal symbol. */ assert(!strcmp(sym->name, SYMBOL_NAME_INTERNAL) || set_lookup(sym->set, tuple)); if (hash_has_entry(sym->hash, tuple)) { if (stmt_trigger_warning(166)) { fprintf(stderr, "--- Warning 166: Duplicate element "); tuple_print(stderr, tuple); fprintf(stderr, " for symbol %s rejected\n", sym->name); } entry_free(entry); } else { /* Falls noch nicht geschehen, legen wir hier den Typ des * Symbols fest. */ if ((sym->type == SYM_ERR) && (sym->used == 0)) sym->type = entry_get_type(entry); assert(sym->type != SYM_ERR); hash_add_entry(sym->hash, entry); sym->entry[sym->used] = entry; sym->used++; } } int symbol_get_dim(const Symbol* sym) { assert(symbol_is_valid(sym)); return set_get_dim(sym->set); } const Set* symbol_get_iset(const Symbol* sym) { assert(symbol_is_valid(sym)); return sym->set; } const char* symbol_get_name(const Symbol* sym) { assert(symbol_is_valid(sym)); return sym->name; } SymbolType symbol_get_type(const Symbol* sym) { assert(symbol_is_valid(sym)); return sym->type; } const Numb* symbol_get_numb(const Symbol* sym, int idx) { assert(symbol_is_valid(sym)); assert(idx >= 0); assert(idx < sym->used); return entry_get_numb(sym->entry[idx]); } const char* symbol_get_strg(const Symbol* sym, int idx) { assert(symbol_is_valid(sym)); assert(idx >= 0); assert(idx < sym->used); return entry_get_strg(sym->entry[idx]); } const Set* symbol_get_set(const Symbol* sym, int idx) { assert(symbol_is_valid(sym)); assert(idx >= 0); assert(idx < sym->used); return entry_get_set(sym->entry[idx]); } Var* symbol_get_var(const Symbol* sym, int idx) { assert(symbol_is_valid(sym)); assert(idx >= 0); assert(idx < sym->used); return entry_get_var(sym->entry[idx]); } void symbol_print(FILE* fp, const Symbol* sym) { static const char* const type_name[] = { "Error", "Numb", "Strg", "Set", "Var" }; int i; assert(symbol_is_valid(sym)); fprintf(fp, "Name : %s\n", sym->name); fprintf(fp, "Type : %s\n", type_name[sym->type]); fprintf(fp, "Index : "); set_print(fp, sym->set); fprintf(fp, "\nEntries:\n"); for(i = 0; i < sym->used; i++) { fprintf(fp, "\t%3d: ", i); entry_print(fp, sym->entry[i]); fprintf(fp, "\n"); } fprintf(fp, "\n"); } void symbol_print_all(FILE* fp) { Symbol* sym; assert(fp != NULL); for(sym = anchor; sym != NULL; sym = sym->next) symbol_print(fp, sym); } zimpl-3.3.6/src/zimpl/heap.c0000644001417200060250000001543013304236715015567 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: heap.c */ /* Name....: Heap Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2006-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/heap.h" #define HEAP_SID 0x48656170 enum heap_type { HEAP_ERR = 0, HEAP_ENTRY = 1 }; typedef enum heap_type HeapType; struct heap { SID HeapType type; int size; /**< Maximale Anzahl von Elementen im Heap */ int used; /**< Aktuelle Anzahl von Elementen im Heap */ HeapData* data; HeapCmp data_cmp; }; static void heap_print(FILE* fp, const Heap* heap) { int i; for(i = 0; i < heap->used; i++) { fprintf(fp, "%3d ", i); switch(heap->type) { case HEAP_ENTRY : entry_print(fp, heap->data[i].entry); break; default : abort(); } fprintf(fp, "\n"); } } bool heap_is_valid(const Heap* heap) { HeapData* data; int i; if ( heap == NULL || heap->type == HEAP_ERR || heap->data == NULL || heap->data_cmp == NULL || heap->size <= 0 || heap->used < 0 || heap->used > heap->size) return false; data = heap->data; /* Heap property */ for(i = 0; i < heap->used / 2; i++) { if ((*heap->data_cmp)(data[i], data[i + i]) > 0) { heap_print(stderr, heap); return false; } if (i + i + 1 < heap->used && (*heap->data_cmp)(data[i], data[i + i + 1]) > 0) { heap_print(stderr, heap); return false; } } return true; } static Heap* heap_new( HeapType type, int size, HeapCmp data_cmp) { Heap* heap = calloc(1, sizeof(*heap)); assert(type == HEAP_ENTRY); assert(size > 0); assert(data_cmp != NULL); assert(heap != NULL); heap->type = type; heap->size = size; heap->used = 0; heap->data = calloc((size_t)heap->size, sizeof(*heap->data)); heap->data_cmp = data_cmp; SID_set(heap, HEAP_SID); assert(heap_is_valid(heap)); return heap; } Heap* heap_new_entry( int size, HeapCmp heap_entry_cmp) { assert(size > 0); assert(heap_entry_cmp != NULL); return heap_new(HEAP_ENTRY, size, heap_entry_cmp); } void heap_free(Heap* heap) { int i; assert(heap_is_valid(heap)); for(i = 0; i < heap->used; i++) { switch(heap->type) { case HEAP_ENTRY : entry_free(heap->data[i].entry); break; default : abort(); } } free(heap->data); free(heap); } static void swap_entries(const Heap* heap, int i, int j) { HeapData* data = heap->data; HeapData t; t = data[i]; data[i] = data[j]; data[j] = t; } /* Bewegt einen Eintrag weiter nach unten/hinten im Vektor * bis die Teilsortierung des Baumes wieder hergestellt ist. */ static void sift_down( const Heap* heap, int current) { HeapData* data = heap->data; int child; /* Heap shift down * (Oberstes Element runter und korrigieren) */ child = current * 2; if (child + 1 < heap->used) if ((*heap->data_cmp)(data[child + 1], data[child]) < 0) child++; while(child < heap->used && (*heap->data_cmp)(data[current], data[child]) > 0) { swap_entries(heap, current, child); current = child; child += child; if (child + 1 < heap->used) if ((*heap->data_cmp)(data[child + 1], data[child]) < 0) child++; } } /* Bewegt einen Eintrag weiter hoch/nach unten im Vektor * bis die Teilsortierung des Baumes wieder hergestellt ist. */ static void sift_up( const Heap* heap, int current) { HeapData* data = heap->data; int parent = current / 2; /* Heap sift up */ while(current > 0 && (*heap->data_cmp)(data[parent], data[current]) > 0) { swap_entries(heap, current, parent); current = parent; parent /= 2; } } /* Sortiert einen Eintrag in den Heap ein. */ void heap_push_entry( Heap* heap, Entry* entry) { assert(heap_is_valid(heap)); assert(entry_is_valid(entry)); assert(heap->used < heap->size); heap->data[heap->used].entry = entry; heap->used++; sift_up(heap, heap->used - 1); assert(heap_is_valid(heap)); } /* Holt den Eintrag mit dem kleinsten Wert aus dem Heap heraus. */ Entry* heap_pop_entry( Heap* heap) { Entry* entry; assert(heap_is_valid(heap)); assert(heap->used > 0); assert(heap->type == HEAP_ENTRY); /* Heap shift down * (Oberstes Element runter und korrigieren) */ entry = heap->data[0].entry; heap->data[0].entry = NULL; heap->used--; swap_entries(heap, 0, heap->used); sift_down(heap, 0); assert(heap_is_valid(heap)); return entry; } const Entry* heap_top_entry( const Heap* heap) { assert(heap_is_valid(heap)); assert(heap->used > 0); assert(heap->type == HEAP_ENTRY); return heap->data[0].entry; } bool heap_is_full(const Heap* heap) { assert(heap_is_valid(heap)); return heap->used == heap->size; } bool heap_is_empty(const Heap* heap) { assert(heap_is_valid(heap)); return heap->used == 0; } zimpl-3.3.6/src/zimpl/define.h0000644001417200060250000000536213304236715016114 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: define.h */ /* Name....: Define Table Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _DEFINE_H_ #define _DEFINE_H_ #ifndef _NUMB_H_ #error "Need to include numb.h before define.h" #endif #ifdef __cplusplus extern "C" { #endif enum define_type { DEF_ERR = 0, DEF_NUMB, DEF_STRG, DEF_BOOL, DEF_SET }; typedef enum define_type DefineType; typedef struct define Define; /*lint -sem( define_new, nulterm(1), 1p) @p == 1 */ extern Define* define_new(const char* name, DefineType type); /*lint -sem( define_set_param, custodial(2), 1p == 1 && 2p == 1) */ extern void define_set_param(Define* def, Tuple* param); /*lint -sem( define_set_code, 1p == 1 && 2p == 1) */ extern void define_set_code(Define* def, CodeNode* code); extern void define_exit(void); /*lint -sem( define_lookup, nulterm(1), 1p, r_null) */ extern Define* define_lookup(const char* name); /*lint -sem( define_get_name, 1p == 1, @p && nulterm(@)) */ extern const char* define_get_name(const Define* def); /*lint -sem( define_get_type, 1p == 1) */ extern DefineType define_get_type(const Define* def); /*lint -sem( define_get_param, 1p == 1) */ extern const Tuple* define_get_param(const Define* def); /*lint -sem( define_get_code, 1p == 1) */ extern CodeNode* define_get_code(const Define* def); #ifdef __cplusplus } #endif #endif /* _DEFINE_H_ */ zimpl-3.3.6/src/zimpl/conname.h0000644001417200060250000000375213304236715016303 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: conname.h */ /* Name....: Constraint Names */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _CONNAME_H_ #define _CONNAME_H_ #ifdef __cplusplus extern "C" { #endif enum con_name_format { CON_FORM_MAKE, CON_FORM_NAME, CON_FORM_FULL }; typedef enum con_name_format ConNameForm; extern void conname_format(ConNameForm format); extern void conname_free(void); /*lint -sem( conname_set, nulterm(1), 1p) */ extern bool conname_set(const char* prefix); /*lint -sem( conname_set, @p && nulterm(@)) */ extern const char* conname_get(void); extern void conname_next(void); #ifdef __cplusplus } #endif #endif /* _CONNAME_H_ */ zimpl-3.3.6/src/zimpl/iread.c0000644001417200060250000005214213304236715015737 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: iread.c */ /* Name....: Read Instruction */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #ifdef WITH_PCRE #include #else #include #endif #ifndef _lint #ifndef WITHOUT_ZLIB #include #endif #else #include "zimpl/lint.h" #endif /* _lint */ #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/bound.h" #include "zimpl/idxset.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/rdefpar.h" #include "zimpl/conname.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/list.h" #include "zimpl/entry.h" #include "zimpl/heap.h" #include "zimpl/code.h" #include "zimpl/inst.h" #include "zimpl/xlpglue.h" #include "zimpl/metaio.h" #include "zimpl/strstore.h" /* read "datei" as "<1n,3s,12s,4n> %6s" skip 17 use 2000 fs " ;" */ #define MAX_FIELDS 65536 CodeNode* i_read_new(CodeNode* self) { const char* filename; const char* pattern; Trace("i_read_new"); assert(code_is_valid(self)); filename = code_eval_child_strg(self, 0); pattern = code_eval_child_strg(self, 1); code_value_rdef(self, rdef_new(filename, pattern)); return self; } CodeNode* i_read_param(CodeNode* self) { RDef* rdef; const RPar* rpar; Trace("i_read_param"); assert(code_is_valid(self)); rdef = rdef_copy(code_eval_child_rdef(self, 0)); rpar = code_eval_child_rpar(self, 1); rdef_set_param(rdef, rpar); code_value_rdef(self, rdef); return self; } CodeNode* i_read_comment(CodeNode* self) { const char* comment; Trace("i_read_comment"); assert(code_is_valid(self)); comment = code_eval_child_strg(self, 0); code_value_rpar(self, rpar_new_comment(comment)); return self; } CodeNode* i_read_match(CodeNode* self) { const char* match; Trace("i_read_match"); assert(code_is_valid(self)); match = code_eval_child_strg(self, 0); code_value_rpar(self, rpar_new_match(match)); return self; } CodeNode* i_read_use(CodeNode* self) { const Numb* use; int int_use; Trace("i_read_use"); assert(code_is_valid(self)); use = code_eval_child_numb(self, 0); if (!numb_is_int(use)) { fprintf(stderr, "*** Error 147: use value "); numb_print(stderr, use); fprintf(stderr, " is too big or not an integer\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } int_use = numb_toint(use); if (int_use <= 0) { fprintf(stderr, "*** Error 148: use value %d is not positive\n", int_use); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_rpar(self, rpar_new_use(int_use)); return self; } CodeNode* i_read_skip(CodeNode* self) { const Numb* skip; int int_skip; Trace("i_read_skip"); assert(code_is_valid(self)); skip = code_eval_child_numb(self, 0); if (!numb_is_int(skip)) { fprintf(stderr, "*** Error 149: skip value "); numb_print(stderr, skip); fprintf(stderr, " is too big or not an integer\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } int_skip = numb_toint(skip); if (int_skip < 0) { fprintf(stderr, "*** Error 150: skip value %d is negative\n", int_skip); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_rpar(self, rpar_new_skip(int_skip)); return self; } static int parse_pattern( const CodeNode* self, const char* pattern, int* param_field, int* param_type, bool* is_tuple_list, bool* is_streaming, int* hi_field_no) { const char* sep = " ,<>"; char* temp = strdup(pattern); char* s; char* t; int field; char type; int params = 0; bool is_single_value = false; assert(self != NULL); assert(pattern != NULL); assert(param_field != NULL); assert(param_type != NULL); assert(is_tuple_list != NULL); assert(hi_field_no != NULL); *is_streaming = false; *is_tuple_list = false; *hi_field_no = 0; /* Is this a tuple_list "<1n,2s>" or * an entry_list "<1n,2n> 3s" pattern * or a single value "2n" * or a stream "s+" or "n+" * or a stream tuple list "" or "" */ /*lint -e{731} supress "Boolean argument to equal/not equal" */ if (( (NULL == strchr(temp, '>')) != (NULL == strchr(temp, '<'))) || (strrchr(temp, '>') != strchr(temp, '>')) || (strrchr(temp, '<') != strchr(temp, '<'))) { fprintf(stderr, "*** Error 151: Not a valid read template\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* Is there an + involved ? Than it is a stream. */ if (NULL != strchr(temp, '+')) { t = temp; /* We have a stream template */ if (t[0] == '<') { if (strlen(t) != 4 || (t[1] != 'n' && t[1] != 's') || t[2] != '+' || t[3] != '>') { fprintf(stderr, "*** Error 151: Not a valid read template\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } *is_tuple_list = true; t++; t[2] = '\0'; } if (strlen(t) != 2 || (t[0] != 'n' && t[0] != 's') || t[1] != '+') { fprintf(stderr, "*** Error 151: Not a valid read template\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } *is_streaming = true; param_field[0] = 0; param_type [0] = t[0]; *hi_field_no = MAX_FIELDS - 1; free(temp); return 1; } /* Single value or tuple list or entry list ? */ s = strchr(temp, '>'); if (NULL == s) { /* Single value */ is_single_value = true; } else { for(++s; isspace(*s); s++) ; *is_tuple_list = (*s == '\0'); } /* Here we start to rip the template apart */ for(s = strtok(temp, sep); (s != NULL) && (params < MAX_FIELDS); s = strtok(NULL, sep)) { if (2 != sscanf(s, "%d%c", &field, &type)) { fprintf(stderr, "*** Error 152: Invalid read template syntax\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } field--; if ((field < 0) || (field >= MAX_FIELDS)) { fprintf(stderr, "*** Error 153: Invalid field number [%d]\n", field + 1); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if ((type != 'n') && (type != 's')) { fprintf(stderr, "*** Error 154: Invalid field type [%c]\n", type); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (field > *hi_field_no) *hi_field_no = field; param_field[params] = field; param_type [params] = type; params++; } free(temp); if (is_single_value) { if (params != 1) { fprintf(stderr, "*** Error 201: Invalid read template, only one field allowed\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } else if (params - (*is_tuple_list ? 0 : 1) < 1) { fprintf(stderr, "*** Error 155: Invalid read template, not enough fields\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } return params; } /*lint -sem(split_fields, nulterm(1), 1p && 2n >= 0 && 2n < MAX_FIELDS && 3p, @n >= 0) */ static int split_fields(char* s, int hi_field_no, char* field[]) { char* t = s; int fields = 0; assert(s != NULL); assert(hi_field_no >= 0); assert(hi_field_no < MAX_FIELDS); assert(field != NULL); for(;;) { bool new_field = false; switch(*s) { case '\"' : s++; t = s; while((*s != '\0') && (*s != '\"')) s++; new_field = true; break; case '\0' : case '\t' : case ' ' : case ',' : case ';' : case ':' : new_field = true; break; default : s++; break; } if (new_field) { assert(fields <= hi_field_no); assert(fields < MAX_FIELDS); /*xint --e{661} Possible access of out-of-bounds pointer */ char* u = s; field[fields] = t; fields++; if (*s == '\"') s++; while(isspace(*s)) s++; if (*s == ',' || *s == ';' || *s == ':') s++; while(isspace(*s)) s++; *u = '\0'; if (*s == '\0') break; /* Have we collected all fields we are interested in? */ if (fields - 1 == hi_field_no) break; t = s; } } return fields; } static List* process_entry_stream( const CodeNode* self, List* list, const RDef* rdef, int line, int fields, char** field, int param_type) /* param_type[0] */ { Tuple* tuple; Entry* entry; Numb* numb; int i; assert(rdef != NULL); assert(line >= 1); assert(fields >= 1); assert(field != NULL); assert(param_type == 'n' || param_type == 's'); tuple = tuple_new(0); for(i = 0; i < fields; i++) { if (param_type == 'n') { if (!numb_is_number(field[i])) { fprintf(stderr, "*** Error 174: Numeric field"); fprintf(stderr, " read as \"%s\". This is not a number.\n", field[i]); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = numb_new_ascii(field[i]); entry = entry_new_numb(tuple, numb); numb_free(numb); } else { entry = entry_new_strg(tuple, str_new(field[i])); } if (list == NULL) list = list_new_entry(entry); else list_add_entry(list, entry); entry_free(entry); } tuple_free(tuple); return list; } static List* process_tuple_stream( const CodeNode* self, List* list, const RDef* rdef, int line, int fields, char** field, int param_type) /* param_type[0] */ { Elem* elem; Numb* numb; int i; assert(rdef != NULL); assert(line >= 1); assert(fields >= 1); assert(field != NULL); assert(param_type == 'n' || param_type == 's'); for(i = 0; i < fields; i++) { Tuple* tuple = tuple_new(1); if (param_type == 'n') { if (!numb_is_number(field[i])) { fprintf(stderr, "*** Error 174: Numeric field"); fprintf(stderr, " read as \"%s\". This is not a number.\n", field[i]); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = numb_new_ascii(field[i]); elem = elem_new_numb(numb); numb_free(numb); } else { elem = elem_new_strg(str_new(field[i])); } tuple_set_elem(tuple, 0, elem); if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); tuple_free(tuple); } return list; } static List* process_line( const CodeNode* self, List* list, const RDef* rdef, int line, bool is_tuple_list, int dim, int fields, char** field, const int* param_field, const int* param_type) { Tuple* tuple; Elem* elem; Numb* numb; char* t; int i; assert(rdef != NULL); assert(line >= 1); assert(dim >= 0); assert(fields >= 1); assert(field != NULL); assert(param_type != NULL); assert(param_field != NULL); tuple = tuple_new(dim); for(i = 0; i < dim; i++) { if (param_field[i] >= fields) { fprintf(stderr, "*** Error 156: Not enough fields in data\n"); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } t = field[param_field[i]]; if (param_type[i] == 'n') { if (!numb_is_number(t)) { fprintf(stderr, "*** Error 174: Numeric field %d", param_field[i] + 1); fprintf(stderr, " read as \"%s\". This is not a number.\n", t); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = numb_new_ascii(t); elem = elem_new_numb(numb); numb_free(numb); } else { elem = elem_new_strg(str_new(t)); } tuple_set_elem(tuple, i, elem); } if (is_tuple_list) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } else { Entry* entry; if (param_field[i] >= fields) { fprintf(stderr, "*** Error 157: Not enough fields in data (value)\n"); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } t = field[param_field[i]]; if (param_type[i] == 'n') { if (!numb_is_number(t)) { fprintf(stderr, "*** Error 174: Numeric field %d", param_field[i] + 1); fprintf(stderr, " read as \"%s\". This is not a number.\n", t); fprintf(stderr, "*** File: %s line %d\n", rdef_get_filename(rdef), line); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = numb_new_ascii(t); entry = entry_new_numb(tuple, numb); numb_free(numb); } else { entry = entry_new_strg(tuple, str_new(t)); } if (list == NULL) list = list_new_entry(entry); else list_add_entry(list, entry); entry_free(entry); } tuple_free(tuple); return list; } /* The result of this function is either a tuple_list "<1n,2s>" or * an entry_list "<2n,3s> 1s" or an elem_list "n+". * The single value "1s" generates an entry_list. */ CodeNode* i_read(CodeNode* self) { MFP* fp; char* buf; char** field; int* param_field; /* template parameter field number */ int* param_type; /* template parameter field type */ bool is_tuple_list; bool is_streaming; int hi_field_no; int dim; const RDef* rdef; List* list = NULL; char* filename; char* comment; const char* match; int skip; int use; regex_t regex; Trace("i_read"); assert(code_is_valid(self)); field = malloc(MAX_FIELDS * sizeof(*field)); param_field = malloc(MAX_FIELDS * sizeof(*param_field)); param_type = malloc(MAX_FIELDS * sizeof(*param_type)); assert(field != NULL); assert(param_field != NULL); assert(param_type != NULL); rdef = code_eval_child_rdef(self, 0); use = rdef_get_use(rdef); skip = rdef_get_skip(rdef); dim = parse_pattern(self, rdef_get_pattern(rdef), param_field, param_type, &is_tuple_list, &is_streaming, &hi_field_no); filename = malloc(strlen(rdef_get_filename(rdef)) + 4); assert(filename != NULL); strcpy(filename, rdef_get_filename(rdef)); comment = malloc(strlen(rdef_get_comment(rdef)) + 3); assert(comment != NULL); comment[0] = '\n'; comment[1] = '\r'; strcpy(&comment[2], rdef_get_comment(rdef)); if (NULL != (match = rdef_get_match(rdef))) { int err = regcomp(®ex, match, REG_EXTENDED | REG_NOSUB); if (err != 0) { char errmsg[1024]; regerror(err, ®ex, errmsg, sizeof(errmsg)); fprintf(stderr, "Error 802: %s\n", errmsg); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } /* The last template parameter is the value for the entry_list. */ if (!is_tuple_list) dim--; if (NULL == (fp = mio_open(filename, ".gz"))) { code_errmsg(self); zpl_exit(EXIT_FAILURE); } else { int line = 0; if (verbose >= VERB_NORMAL) printf("Reading %s\n", filename); while(NULL != (buf = mio_get_line(fp))) { char* s; /* Count the line */ line++; /* Is this a comment line or is there a comment on the line, * then remove it. */ if (NULL != (s = strpbrk(buf, comment))) *s = '\0'; /* If this is an empty line... */ for(s = buf; (*s != '\0') && isspace(*s); s++) ; /* ... we skip it. */ if (*s == '\0') { free(buf); continue; } /* do we have regex and if yes it is matched ? * if not, skip the line. */ if (match != NULL && regexec(®ex, s, 0, NULL, 0)) { free(buf); continue; } /* Should we skip this line ? */ if (skip-- > 0) { free(buf); continue; } /* Now we break the line in fields. */ int fields = split_fields(s, hi_field_no, field); #if 0 { int i; fprintf(stdout, "Fields=%d\n", fields); for(i = 0; i < fields; i++) fprintf(stdout, "Field[%d]=[%s]\n", i, field[i]); } #endif if (is_streaming) { if (fields == MAX_FIELDS) { if (stmt_trigger_warning(213)) { fprintf(stderr, "--- Warning 213: More than %d input fields in line %d of %s\n", fields, line, filename); code_errmsg(self); } } if (is_tuple_list) list = process_tuple_stream(self, list, rdef, line, fields, field, param_type[0]); else list = process_entry_stream(self, list, rdef, line, fields, field, param_type[0]); } else { list = process_line(self, list, rdef, line, is_tuple_list, dim, fields, field, param_field, param_type); } free(buf); if (--use == 0) break; } mio_close(fp); } /* If we found nothing to put into the list, we add a dummy entry */ if (list == NULL) { Tuple* tuple = tuple_new(0); if (is_tuple_list) list = list_new_tuple(tuple); else { Set* set = set_pseudo_new(); Entry* entry = entry_new_set(tuple, set); list = list_new_entry(entry); entry_free(entry); set_free(set); } tuple_free(tuple); /* fprintf(stderr, "*** Error 158: Read from file found no data\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); */ } code_value_list(self, list); if (match != NULL) regfree(®ex); free(comment); free(filename); free(param_type); free(param_field); free(field); return self; } zimpl-3.3.6/src/zimpl/rdefpar.c0000644001417200060250000001372713304236715016304 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: rdefpar.c */ /* Name....: Read Definition / Parameter */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/mme.h" #include "zimpl/strstore.h" #include "zimpl/rdefpar.h" #define RDEF_SID 0x52446566 #define RPAR_SID 0x52506172 enum read_param_type { RPAR_ERR = 0, RPAR_SKIP, RPAR_USE, RPAR_CMNT, RPAR_MTCH }; typedef enum read_param_type RParType; typedef union read_param_value RParVal; union read_param_value { int i; const char* s; }; struct read_param { SID RParType type; RParVal val; }; struct read_definition { SID const char* filename; const char* pattern; /* this was named "template", but template */ const char* comment; /* is a C++ reserved word */ const char* match; int use; int skip; int refc; }; RDef* rdef_new(const char* filename, const char* pattern) { RDef* rdef = calloc(1, sizeof(*rdef)); assert(filename != NULL); assert(pattern != NULL); assert(rdef != NULL); rdef->filename = filename; rdef->pattern = pattern; rdef->comment = str_new(""); rdef->match = NULL; rdef->skip = 0; rdef->use = -1; rdef->refc = 1; SID_set(rdef, RDEF_SID); assert(rdef_is_valid(rdef)); return rdef; } void rdef_free(RDef* rdef) { assert(rdef_is_valid(rdef)); rdef->refc--; if (rdef->refc == 0) { SID_del(rdef); free(rdef); } } bool rdef_is_valid(const RDef* rdef) { return ((rdef != NULL) && SID_ok(rdef, RDEF_SID) && (rdef->filename != NULL) && (rdef->pattern != NULL) && (rdef->comment != NULL)); } RDef* rdef_copy(const RDef* source) { RDef* rdef = (RDef*)source; assert(rdef_is_valid(rdef)); rdef->refc++; return rdef; } void rdef_set_param(RDef* rdef, const RPar* rpar) { assert(rdef_is_valid(rdef)); assert(rpar_is_valid(rpar)); switch(rpar->type) { case RPAR_SKIP : rdef->skip = rpar->val.i; break; case RPAR_USE : rdef->use = rpar->val.i; break; case RPAR_CMNT : rdef->comment = rpar->val.s; break; case RPAR_MTCH : rdef->match = rpar->val.s; break; case RPAR_ERR : default : abort(); } } const char* rdef_get_filename(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->filename; } const char* rdef_get_pattern(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->pattern; } const char* rdef_get_comment(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->comment; } const char* rdef_get_match(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->match; } int rdef_get_use(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->use; } int rdef_get_skip(const RDef* rdef) { assert(rdef_is_valid(rdef)); return rdef->skip; } /* ---------------------------------------------------------------------------- * Read Parameter * ---------------------------------------------------------------------------- */ RPar* rpar_new_skip(int skip) { RPar* rpar = calloc(1, sizeof(*rpar)); assert(rpar != NULL); rpar->type = RPAR_SKIP; rpar->val.i = skip; SID_set(rpar, RPAR_SID); assert(rpar_is_valid(rpar)); return rpar; } RPar* rpar_new_use(int use) { RPar* rpar = calloc(1, sizeof(*rpar)); assert(rpar != NULL); rpar->type = RPAR_USE; rpar->val.i = use; SID_set(rpar, RPAR_SID); assert(rpar_is_valid(rpar)); return rpar; } RPar* rpar_new_comment(const char* comment) { RPar* rpar = calloc(1, sizeof(*rpar)); assert(rpar != NULL); assert(comment != NULL); rpar->type = RPAR_CMNT; rpar->val.s = comment; SID_set(rpar, RPAR_SID); assert(rpar_is_valid(rpar)); return rpar; } RPar* rpar_new_match(const char* match) { RPar* rpar = calloc(1, sizeof(*rpar)); assert(rpar != NULL); assert(match != NULL); rpar->type = RPAR_MTCH; rpar->val.s = match; SID_set(rpar, RPAR_SID); assert(rpar_is_valid(rpar)); return rpar; } void rpar_free(RPar* rpar) { assert(rpar_is_valid(rpar)); SID_del(rpar); free(rpar); } bool rpar_is_valid(const RPar* rpar) { return ((rpar != NULL) && SID_ok(rpar, RPAR_SID) && (rpar->type != RPAR_ERR)); } RPar* rpar_copy(const RPar* rpar) { RPar* rpnew = calloc(1, sizeof(*rpar)); assert(rpar != NULL); assert(rpnew != NULL); rpnew->type = rpar->type; rpnew->val = rpar->val; SID_set(rpnew, RPAR_SID); assert(rpar_is_valid(rpnew)); return rpnew; } zimpl-3.3.6/src/zimpl/setpseudo.c0000644001417200060250000001612713304236715016671 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setpseudo.c */ /* Name....: Set Pseudo Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/hash.h" #include "zimpl/set.h" #include "zimpl/set4.h" #define SET_PSEUDO_SID 0x53455452 #define SET_PSEUDO_ITER_SID 0x53455249 /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_pseudo_is_valid(const Set* set) { return set != NULL && SID_ok2(set->pseudo, SET_PSEUDO_SID) && set->head.refc > 0 && set->head.dim == 0 && set->head.members == 1; } static bool set_pseudo_iter_is_valid(const SetIter* iter) { return iter != NULL && SID_ok2(iter->pseudo, SET_PSEUDO_ITER_SID); } /* ------------------------------------------------------------------------- * --- set_new * ------------------------------------------------------------------------- */ Set* set_pseudo_new() { Set* set; set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = 0; set->head.members = 1; set->head.type = SET_PSEUDO; SID_set2(set->pseudo, SET_PSEUDO_SID); assert(set_pseudo_is_valid(set)); return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_pseudo_copy(const Set* source) { Set* set = (Set*)source; set->head.refc++; return set; } /* ------------------------------------------------------------------------- * --- set_free * ------------------------------------------------------------------------- */ static void set_pseudo_free(Set* set) { assert(set_pseudo_is_valid(set)); set->head.refc--; if (set->head.refc == 0) { SID_del2(set->pseudo); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ /*ARGSUSED*/ static SetIterIdx set_pseudo_lookup_idx(const Set* set, const Tuple* tuple, int offset) { assert(set_pseudo_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset == 0); assert(tuple_get_dim(tuple) == 0); return 0; } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_pseudo_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { assert(set_pseudo_is_valid(set)); assert(idx == 0); assert(tuple_is_valid(tuple)); assert(offset == 0); assert(tuple_get_dim(tuple) == 0); } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ /* Initialise Iterator. Write into iter */ /*ARGSUSED*/ static SetIter* iter_init( const Set* set, const Tuple* pattern, int offset) { SetIter* iter; assert(set_pseudo_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(pattern == NULL || tuple_get_dim(pattern) == 0); assert(offset == 0); iter = calloc(1, sizeof(*iter)); assert(iter != NULL); iter->pseudo.first = true; SID_set2(iter->pseudo, SET_PSEUDO_ITER_SID); assert(set_pseudo_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* false means, there is no further element */ /*ARGSUSED*/ static bool iter_next( SetIter* iter, UNUSED const Set* set, UNUSED Tuple* tuple, UNUSED int offset) { assert(set_pseudo_iter_is_valid(iter)); assert(set_pseudo_is_valid(set)); if (!iter->pseudo.first) return false; iter->pseudo.first = false; return true; } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void iter_exit(SetIter* iter, UNUSED const Set* set) { assert(set_pseudo_iter_is_valid(iter)); SID_del2(iter->pseudo); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void iter_reset(SetIter* iter, UNUSED const Set* set) { assert(set_pseudo_iter_is_valid(iter)); iter->pseudo.first = true; } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_pseudo_init(SetVTab* vtab) { vtab[SET_PSEUDO].set_copy = set_pseudo_copy; vtab[SET_PSEUDO].set_free = set_pseudo_free; vtab[SET_PSEUDO].set_lookup_idx = set_pseudo_lookup_idx; vtab[SET_PSEUDO].set_get_tuple = set_pseudo_get_tuple; vtab[SET_PSEUDO].iter_init = iter_init; vtab[SET_PSEUDO].iter_next = iter_next; vtab[SET_PSEUDO].iter_exit = iter_exit; vtab[SET_PSEUDO].iter_reset = iter_reset; vtab[SET_PSEUDO].set_is_valid = set_pseudo_is_valid; } zimpl-3.3.6/src/zimpl/ratlpstore.c0000644001417200060250000012522713304236715017057 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: lpstore.c */ /* Name....: Store Linear Programm */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" #ifdef _MSC_VER #pragma warning (disable: 4100) #endif #define LPF_NAME_LEN 16 #define MPS_NAME_LEN 8 #define PIP_NAME_LEN 255 #define MIN_NAME_LEN 8 struct storage { unsigned int size; Nzo* begin; Sto* next; }; static const unsigned int sto_size = 1000; #ifndef LHT_BUCKETS #define LHT_BUCKETS 1000003U #endif enum lps_hash_type { LHT_ERR = 0, LHT_VAR, LHT_CON, LHT_SOS }; typedef struct lps_hash_element LpsHElem; typedef enum lps_hash_type LpsHashType; struct lps_hash_element { LpsHElem* next; union { Con* con; Var* var; Sos* sos; } value; }; struct lps_hash { unsigned int size; int elems; LpsHashType type; LpsHElem** bucket; }; static void hash_statist(FILE* fp, const LpsHash* hash); //lint !e528 not referenced static bool hash_valid(const LpsHash* hash) { return hash != NULL && (hash->type == LHT_CON || hash->type == LHT_VAR || hash->type == LHT_SOS); } static unsigned int hashit(const char* s) { unsigned int hcode = 0; /* I am not too sure this works well for 64bit integers. */ /*lint -e{506} supress "Constant value Boolean" */ assert(sizeof(hcode) == 4); for(; *s != '\0'; s++) hcode = 31 * hcode + (unsigned char)*s; return hcode; } static LpsHash* lps_hash_new(LpsHashType type) { LpsHash* hash = calloc(1, sizeof(*hash)); assert(hash != NULL); hash->size = LHT_BUCKETS; hash->elems = 0; hash->type = type; hash->bucket = calloc(hash->size, sizeof(*hash->bucket)); assert(hash->bucket != NULL); assert(hash_valid(hash)); return hash; } static void lps_hash_free(LpsHash* hash) { LpsHElem* he; LpsHElem* hq; unsigned int i; assert(hash_valid(hash)); #if 0 #ifndef NDEBUG hash_statist(stdout, hash); #endif #endif for(i = 0; i < hash->size; i++) { for(he = hash->bucket[i]; he != NULL; he = hq) { hq = he->next; free(he); } } free(hash->bucket); free(hash); } /* Liefert NULL wenn nicht gefunden. */ static Var* hash_lookup_var(const LpsHash* hash, const char* name) { unsigned int hcode; LpsHElem* he; assert(hash_valid(hash)); assert(hash->type == LHT_VAR); assert(name != NULL); hcode = hashit(name) % hash->size; for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!strcmp(he->value.var->name, name)) break; return (he == NULL) ? (Var*)0 : he->value.var; } /* Liefert NULL wenn nicht gefunden. */ static Con* hash_lookup_con(const LpsHash* hash, const char* name) { unsigned int hcode; LpsHElem* he; assert(hash_valid(hash)); assert(hash->type == LHT_CON); assert(name != NULL); hcode = hashit(name) % hash->size; for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!strcmp(he->value.con->name, name)) break; return (he == NULL) ? (Con*)0 : he->value.con; } /* Liefert NULL wenn nicht gefunden. */ static Sos* hash_lookup_sos(const LpsHash* hash, const char* name) { unsigned int hcode; LpsHElem* he; assert(hash_valid(hash)); assert(hash->type == LHT_SOS); assert(name != NULL); hcode = hashit(name) % hash->size; for(he = hash->bucket[hcode]; he != NULL; he = he->next) if (!strcmp(he->value.sos->name, name)) break; return (he == NULL) ? (Sos*)0 : he->value.sos; } static void hash_add_var(LpsHash* hash, Var* var) { LpsHElem* he = calloc(1, sizeof(*he)); unsigned int hcode; assert(hash_valid(hash)); assert(var != NULL); assert(hash->type == LHT_VAR); assert(he != NULL); hcode = hashit(var->name) % hash->size; he->value.var = var; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; assert(hash_lookup_var(hash, var->name) == var); } static void hash_del_var(LpsHash* hash, const Var* var) { LpsHElem* he; LpsHElem* next; unsigned int hcode; assert(hash_valid(hash)); assert(var != NULL); assert(hash->type == LHT_VAR); hcode = hashit(var->name) % hash->size; for(he = hash->bucket[hcode], next = NULL; he != NULL; next = he, he = he->next) if (he->value.var == var) break; assert(he != NULL); if (next == NULL) hash->bucket[hcode] = he->next; else next->next = he->next; hash->elems--; free(he); assert(hash_valid(hash)); } static void hash_add_con(LpsHash* hash, Con* con) { LpsHElem* he = calloc(1, sizeof(*he)); unsigned int hcode; assert(hash_valid(hash)); assert(con != NULL); assert(hash->type == LHT_CON); assert(he != NULL); hcode = hashit(con->name) % hash->size; he->value.con = con; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; assert(hash_lookup_con(hash, con->name) == con); } static void hash_add_sos(LpsHash* hash, Sos* sos) { LpsHElem* he = calloc(1, sizeof(*he)); unsigned int hcode; assert(hash_valid(hash)); assert(sos != NULL); assert(hash->type == LHT_SOS); assert(he != NULL); hcode = hashit(sos->name) % hash->size; he->value.sos = sos; he->next = hash->bucket[hcode]; hash->bucket[hcode] = he; hash->elems++; assert(hash_lookup_sos(hash, sos->name) == sos); } static void hash_del_con(LpsHash* hash, const Con* con) { LpsHElem* he; LpsHElem* next; unsigned int hcode; assert(hash_valid(hash)); assert(con != NULL); assert(hash->type == LHT_CON); hcode = hashit(con->name) % hash->size; for(he = hash->bucket[hcode], next = NULL; he != NULL; next = he, he = he->next) if (he->value.con == con) break; assert(he != NULL); if (next == NULL) hash->bucket[hcode] = he->next; else next->next = he->next; hash->elems--; free(he); assert(hash_valid(hash)); } static void hash_statist(FILE* fp, const LpsHash* hash) //lint !e528 not referenced { assert(fp != NULL); assert(hash_valid(hash)); LpsHElem* he; int min = (int)hash->size; int max = 0; int sum = 0; int zeros = 0; int filled = 0; double avg = 0.0; for(unsigned int i = 0; i < hash->size; i++) { int count = 0; for(he = hash->bucket[i]; he != NULL; he = he->next) count++; if (count == 0) zeros++; else filled++; if (count < min) min = count; if (count > max) max = count; sum += count; } assert(sum == hash->elems); if (filled > 0) avg = (double)sum / (double)filled; fprintf(fp, "HashStat: size=%u sum=%d min=%d max=%d avg=%.1f zero=%d filled=%d\n", hash->size, sum, min, max, avg, zeros, filled); } #ifndef NDEBUG static bool lps_valid(const Lps* lp) { const char* err1 = "Wrong Previous Variable"; const char* err2 = "Wrong Variable Previous Nonzero"; const char* err3 = "Wrong Variable Nonzero Count"; const char* err4 = "Wrong Variable Count"; const char* err5 = "Wrong Previous Constraint"; const char* err6 = "Wrong Constraint Previous Nonzero"; const char* err7 = "Wrong Constraint Nonzero Count"; const char* err8 = "Wrong Constraint Count"; const char* err9 = "Wrong Variable"; const char* err10 = "Wrong Constraint"; const char* err11 = "Storage-size error"; const char* err12 = "Wrong Variable SID"; const char* err13 = "Wrong Constraint SID"; const char* err14 = "Strange lhs/rhs"; const char* err15 = "Wrong SOS SID"; const char* err16 = "Wrong SOS Variable SID"; const char* err18 = "Wrong SOS element count"; const char* err19 = "Wrong SOS count"; assert(lp != NULL); Var* var; Var* var_prev; Con* con; Con* con_prev; Nzo* nzo; Nzo* nzo_prev; Sto* sto; Sos* sos; Sse* sse; int var_count; int con_count; int nzo_count; int sto_count; int sos_count; int sse_count; /* Variable Test */ var_count = lp->vars; for(var = lp->var_root, var_prev = NULL; var != NULL; var = var->next) { if (var->sid != VAR_SID) { fprintf(stderr, "%s\n", err12); return false; } if (var_prev == var->prev) var_prev = var; else { fprintf(stderr, "%s\n", err1); return false; } var_count--; nzo_count = var->size; for(nzo = var->first, nzo_prev = NULL; nzo != NULL; nzo = nzo->var_next) { if (nzo_prev == nzo->var_prev) nzo_prev = nzo; else { fprintf(stderr, "%s\n", err2); return false; } if (nzo->var != var) { fprintf(stderr, "%s\n", err9); return false; } nzo_count--; } if (nzo_count) { fprintf(stderr, "%s\n", err3); return false; } } if (var_count) { fprintf(stderr, "%s\n", err4); return false; } /* Constraint Test */ con_count = lp->cons; for(con = lp->con_root, con_prev = NULL; con != NULL; con = con->next) { if (con->sid != CON_SID) { fprintf(stderr, "%s\n", err13); return false; } if (con_prev == con->prev) con_prev = con; else { fprintf(stderr, "%s\n", err5); return false; } switch(con->type) { case CON_FREE : case CON_LHS : case CON_RHS : break; case CON_RANGE : if (mpq_cmp(con->lhs, con->rhs) >= 0) { fprintf(stderr, "%s %s %g %g\n", err14, con->name, mpq_get_d(con->lhs), mpq_get_d(con->rhs)); return false; } break; case CON_EQUAL : if (!mpq_equal(con->lhs, con->rhs)) { fprintf(stderr, "%s %s %g %g\n", err14, con->name, mpq_get_d(con->lhs), mpq_get_d(con->rhs)); return false; } break; default : abort(); } con_count--; nzo_count = con->size; for(nzo = con->first, nzo_prev = NULL; nzo != NULL; nzo = nzo->con_next) { if (nzo_prev == nzo->con_prev) nzo_prev = nzo; else { fprintf(stderr, "%s\n", err6); return false; } if (nzo->con != con) { fprintf(stderr, "%s\n", err10); return false; } nzo_count--; } if (nzo_count) { fprintf(stderr, "%s\n", err7); return false; } } if (con_count) { fprintf(stderr, "%s\n", err8); return false; } /* SOS Test */ sos_count = lp->soss; for(sos = lp->sos_root; sos != NULL; sos = sos->next) { if (sos->sid != SOS_SID) { fprintf(stderr, "%s\n", err15); return false; } sos_count--; sse_count = sos->sses; for(sse = sos->first; sse != NULL; sse = sse->next) { if (sse->var->sid != VAR_SID) { fprintf(stderr, "%s\n", err16); return false; } sse_count--; } if (sse_count) { fprintf(stderr, "%s\n", err18); return false; } } if (sos_count) { fprintf(stderr, "%s\n", err19); return false; } /* Storage Test */ sto_count = 0; for(sto = lp->sto_root; sto != NULL; sto = sto->next) { assert(sto->begin != NULL); sto_count++; } if (sto_count * (int)sto_size < lp->nonzeros) { fprintf(stderr, "%s %d %u %d\n", err11, sto_count, sto_size, lp->nonzeros); return false; } return true; } #endif /* !NDEBUG */ static void lps_storage(Lps* lp) { Sto* s; Nzo* n; unsigned int i; assert(lps_valid(lp)); assert(lp->next == NULL); s = malloc(sizeof(*s)); assert(s != NULL); n = malloc(sto_size * sizeof(*n)); assert(n != NULL); for(i = 0; i < sto_size - 1; i++) { n[i].var_next = &n[i + 1]; mpq_init(n[i].value); #ifndef NDEBUG n[i].var_prev = NULL; n[i].con_next = NULL; n[i].con_prev = NULL; n[i].var = NULL; n[i].con = NULL; #endif } n[i].var_next = NULL; mpq_init(n[i].value); #ifndef NDEBUG n[i].var_prev = NULL; n[i].con_next = NULL; n[i].con_prev = NULL; n[i].var = NULL; n[i].con = NULL; #endif s->size = sto_size; s->begin = n; s->next = lp->sto_root; lp->sto_root = s; lp->next = s->begin; } Lps* lps_alloc( const char* name) { Lps* lp; assert(name != NULL); lp = malloc(sizeof(*lp)); assert(lp != NULL); lp->name = strdup(name); lp->probname = NULL; lp->objname = NULL; lp->rhsname = NULL; lp->bndname = NULL; lp->rngname = NULL; lp->type = LP_LP; lp->direct = LP_MIN; lp->vars = 0; lp->cons = 0; lp->soss = 0; lp->nonzeros = 0; lp->var_root = NULL; lp->con_root = NULL; lp->sos_root = NULL; lp->sto_root = NULL; lp->next = NULL; lp->var_hash = lps_hash_new(LHT_VAR); lp->con_hash = lps_hash_new(LHT_CON); lp->sos_hash = lps_hash_new(LHT_SOS); lp->var_last = NULL; lp->con_last = NULL; lp->sos_last = NULL; lp->name_len = 0; assert(lps_valid(lp)); return lp; } void lps_free(Lps* lp) { Var* var; Var* var_next; Con* con; Con* con_next; Sos* sos; Sos* sos_next; Sse* sse; Sse* sse_next; Sto* sto; Sto* sto_next; unsigned int i; assert(lps_valid(lp)); lps_hash_free(lp->var_hash); lps_hash_free(lp->con_hash); lps_hash_free(lp->sos_hash); for(sto = lp->sto_root; sto != NULL; sto = sto_next) { for(i = 0; i < sto_size; i++) mpq_clear(sto->begin[i].value); sto_next = sto->next; free(sto->begin); free(sto); } for(var = lp->var_root; var != NULL; var = var_next) { var_next = var->next; var->sid = 0x0; mpq_clear(var->cost); mpq_clear(var->lower); mpq_clear(var->upper); mpq_clear(var->value); mpq_clear(var->startval); free(var->name); free(var); } for(con = lp->con_root; con != NULL; con = con_next) { Qme* qme; Qme* qme_next; con_next = con->next; con->sid = 0x0; for(qme = con->qme_first; qme != NULL; qme = qme_next) { qme_next = qme->next; mpq_clear(qme->value); free(qme); } mpq_clear(con->lhs); mpq_clear(con->rhs); mpq_clear(con->scale); if (con->term != NULL) term_free(con->term); free(con->name); free(con); } for(sos = lp->sos_root; sos != NULL; sos = sos_next) { sos_next = sos->next; sos->sid = 0x0; for(sse = sos->first; sse != NULL; sse = sse_next) { sse_next = sse->next; mpq_clear(sse->weight); free(sse); } free(sos->name); free(sos); } if (lp->probname != NULL) free(lp->probname); if (lp->objname != NULL) free(lp->objname); if (lp->rhsname != NULL) free(lp->rhsname); if (lp->bndname != NULL) free(lp->bndname); if (lp->rngname != NULL) free(lp->rngname); free(lp->name); free(lp); } void lps_number(const Lps* lp) { Var* var; Con* con; int i; assert(lps_valid(lp)); for(var = lp->var_root, i = 0; var != NULL; var = var->next, i++) { assert(var != NULL); assert(var->sid == VAR_SID); var->number = i; } assert(i == lp->vars); for(con = lp->con_root, i = 0; con != NULL; con = con->next, i++) { assert(con != NULL); assert(con->sid == CON_SID); con->number = i; } assert(i == lp->cons); } Var* lps_getvar( const Lps* lp, const char* name) { Var* vr; assert(lps_valid(lp)); assert(name != NULL); vr = hash_lookup_var(lp->var_hash, name); assert((vr == NULL) || (vr->sid == VAR_SID)); assert((vr == NULL) || (!strcmp(vr->name, name))); #ifndef NDEBUG { const Var* var; for(var = lp->var_root; var != NULL; var = var->next) if (!strcmp(var->name, name)) break; assert(var == vr); } #endif return vr; } Con* lps_getcon( const Lps* lp, const char* name) { Con* cr; assert(lps_valid(lp)); assert(name != NULL); cr = hash_lookup_con(lp->con_hash, name); assert((cr == NULL) || (cr->sid == CON_SID)); assert((cr == NULL) || (!strcmp(cr->name, name))); #ifndef NDEBUG { const Con* con; for(con = lp->con_root; con != NULL; con = con->next) if (!strcmp(con->name, name)) break; assert(con == cr); } #endif return cr; } Sos* lps_getsos( const Lps* lp, const char* name) { Sos* sr; assert(lps_valid(lp)); assert(name != NULL); sr = hash_lookup_sos(lp->sos_hash, name); assert((sr == NULL) || (sr->sid == VAR_SID)); assert((sr == NULL) || (!strcmp(sr->name, name))); #ifndef NDEBUG { const Sos* sos; for(sos = lp->sos_root; sos != NULL; sos = sos->next) if (!strcmp(sos->name, name)) break; assert(sos == sr); } #endif return sr; } Nzo* lps_getnzo( const Lps* lp, const Con* con, const Var* var) { Nzo* nzo; assert(lps_valid(lp)); assert(con != NULL); assert(con->sid == CON_SID); assert(var != NULL); assert(var->sid == VAR_SID); /* Whatever is shorter */ if (var->size <= con->size) { for(nzo = var->first; nzo != NULL; nzo = nzo->var_next) if (nzo->con == con) break; } else { for(nzo = con->first; nzo != NULL; nzo = nzo->con_next) if (nzo->var == var) break; } assert((nzo == NULL) || ((nzo->var == var) && (nzo->con == con))); return nzo; } Var* lps_addvar( Lps* lp, const char* name) { Var* v; assert(lps_valid(lp)); assert(name != NULL); assert(lps_getvar(lp, name) == NULL); v = malloc(sizeof(*v)); assert(v != NULL); mpq_init(v->cost); mpq_init(v->lower); mpq_init(v->upper); mpq_init(v->value); mpq_init(v->startval); v->sid = VAR_SID; v->name = strdup(name); v->number = lp->vars; v->vclass = VAR_CON; v->type = VAR_FREE; v->is_used = false; v->priority = 0; v->size = 0; v->first = NULL; v->next = NULL; v->prev = lp->var_last; lp->var_last = v; if (v->prev == NULL) lp->var_root = v; else { assert(v->prev->next == NULL); v->prev->next = v; } lp->vars++; hash_add_var(lp->var_hash, v); assert(lps_valid(lp)); return v; } void lps_delvar( Lps* lp, Var* var) { assert(lps_valid(lp)); /* remove non-zeros */ while(var->first != NULL) lps_delnzo(lp, var->first); assert(var->size == 0); /* Correkt "next" links */ if (var->prev != NULL) { var->prev->next = var->next; assert(lp->var_root != var); } else { assert(lp->var_root == var); lp->var_root = var->next; assert(lp->var_root != NULL || lp->vars == 0); } /* Correkt "prev" links */ if (var->next != NULL) { var->next->prev = var->prev; assert(lp->var_last != var); } else { assert(lp->var_last == var); lp->var_last = var->prev; assert(lp->var_last != NULL || lp->vars == 0); } hash_del_var(lp->var_hash, var); mpq_clear(var->cost); mpq_clear(var->lower); mpq_clear(var->upper); mpq_clear(var->value); mpq_clear(var->startval); var->sid = 0; free(var->name); free(var); lp->vars--; assert(lps_valid(lp)); } Con* lps_addcon( Lps* lp, const char* name) { Con* c; assert(lps_valid(lp)); assert(name != NULL); assert(lps_getcon(lp, name) == NULL); c = calloc(1, sizeof(*c)); assert(c != NULL); mpq_init(c->lhs); mpq_init(c->rhs); mpq_init(c->scale); c->sid = CON_SID; c->name = strdup(name); c->number = lp->cons; c->size = 0; c->type = CON_FREE; c->flags = 0; c->ind_var = NULL; c->ind_dir = true; c->first = NULL; c->qme_first = NULL; c->term = NULL; c->next = NULL; c->prev = lp->con_last; lp->con_last = c; if (c->prev == NULL) lp->con_root = c; else { assert(c->prev->next == NULL); c->prev->next = c; } lp->cons++; hash_add_con(lp->con_hash, c); assert(lps_valid(lp)); return c; } void lps_delcon( Lps* lp, Con* con) { assert(lps_valid(lp)); /* remove non-zeros */ while(con->first != NULL) lps_delnzo(lp, con->first); assert(con->size == 0); /* Correkt "next" links */ if (con->prev != NULL) { con->prev->next = con->next; assert(lp->con_root != con); } else { assert(lp->con_root == con); lp->con_root = con->next; assert(lp->con_root != NULL || lp->cons == 0); } /* Correkt "prev" links */ if (con->next != NULL) { con->next->prev = con->prev; assert(lp->con_last != con); } else { assert(lp->con_last == con); lp->con_last = con->prev; assert(lp->con_last != NULL || lp->cons == 0); } hash_del_con(lp->con_hash, con); con->sid = 0x0; mpq_clear(con->lhs); mpq_clear(con->rhs); mpq_clear(con->scale); free(con->name); free(con); lp->cons--; /* ??? qme_first term ? */ assert(lps_valid(lp)); } Sos* lps_addsos( Lps* lp, const char* name, SosType type, int priority) { Sos* sos; assert(lps_valid(lp)); assert(name != NULL); assert(lps_getsos(lp, name) == NULL); sos = malloc(sizeof(*sos)); assert(sos != NULL); sos->sid = SOS_SID; sos->name = strdup(name); sos->type = type; sos->priority = priority; sos->sses = 0; sos->first = NULL; sos->next = NULL; if (lp->sos_last != NULL) lp->sos_last->next = sos; lp->sos_last = sos; if (lp->sos_root == NULL) lp->sos_root = sos; lp->soss++; hash_add_sos(lp->sos_hash, sos); assert(lps_valid(lp)); return sos; } /*ARGSUSED*/ void lps_addqme( UNUSED Lps* lp, Con* con, Var* var1, Var* var2, const mpq_t value) { Qme* qme = malloc(sizeof(*qme)); assert(qme != NULL); qme->sid = QME_SID; qme->var1 = var1; qme->var2 = var2; mpq_init(qme->value); mpq_set(qme->value, value); qme->next = con->qme_first; con->qme_first = qme; var1->is_used = true; var2->is_used = true; } /*ARGSUSED*/ void lps_addterm( UNUSED Lps* lp, Con* con, const Term* term) { int i; int k; assert(con != NULL); /* assert(term_valid(term));*/ assert(con->term == NULL); con->term = term_copy(term); for(i = 0; i < term_get_elements(term); i++) { const Mono* mono = term_get_element(term, i); for(k = 0; k < mono_get_degree(mono); k++) mono_get_var(mono, k)->is_used = true; } } void lps_addsse( Sos* sos, Var* var, const mpq_t weight) { Sse* sse; assert(sos != NULL); assert(sos->sid == SOS_SID); assert(var != NULL); assert(var->sid == VAR_SID); sse = malloc(sizeof(*sse)); assert(sse != NULL); mpq_init(sse->weight); mpq_set(sse->weight, weight); sse->var = var; sse->next = sos->first; sos->first = sse; sos->sses++; sse->var->is_used = true; } void lps_addnzo( Lps* lp, Con* con, Var* var, const mpq_t value) { Nzo* nzo; assert(lps_valid(lp)); assert(con != NULL); assert(con->sid == CON_SID); assert(var != NULL); assert(var->sid == VAR_SID); /* Ins LP aufnehmen */ if (lp->next == NULL) lps_storage(lp); nzo = lp->next; assert(nzo != NULL); lp->next = nzo->var_next; lp->nonzeros++; mpq_set(nzo->value, value); /* In die Spalte aufnehmen */ nzo->var = var; nzo->var_prev = NULL; nzo->var_next = var->first; var->first = nzo; var->size++; if (nzo->var_next != NULL) { assert(nzo->var_next->var_prev == NULL); nzo->var_next->var_prev = nzo; } /* In die Zeile aufnehmen */ nzo->con = con; nzo->con_prev = NULL; nzo->con_next = con->first; con->first = nzo; con->size++; if (nzo->con_next != NULL) { assert(nzo->con_next->con_prev == NULL); nzo->con_next->con_prev = nzo; } assert(lps_valid(lp)); } void lps_delnzo( Lps* lp, Nzo* nzo) { assert(lps_valid(lp)); assert(nzo != NULL); /* Aus der Spalte nahmen */ if (nzo == nzo->var->first) nzo->var->first = nzo->var_next; if (nzo->var_prev != NULL) nzo->var_prev->var_next = nzo->var_next; if (nzo->var_next != NULL) nzo->var_next->var_prev = nzo->var_prev; nzo->var->size--; /* Aus der Zeile nahmen */ if (nzo == nzo->con->first) nzo->con->first = nzo->con_next; if (nzo->con_prev != NULL) nzo->con_prev->con_next = nzo->con_next; if (nzo->con_next != NULL) nzo->con_next->con_prev = nzo->con_prev; nzo->con->size--; /* Aus dem LP nehmen */ nzo->var_next = lp->next; lp->next = nzo; lp->nonzeros--; assert(lps_valid(lp)); } void lps_setval( Nzo* nzo, const mpq_t value) { assert(nzo != NULL); mpq_set(nzo->value, value); } void lps_getval( const Nzo* nzo, mpq_t value) { assert(nzo != NULL); mpq_set(value, nzo->value); } void lps_setdir( Lps* lp, LpDirect direct) { assert(lps_valid(lp)); lp->direct = direct; } void lps_setprobname( Lps* lp, const char* name) { assert(lp != NULL); assert(name != NULL); if (lp->probname != NULL) free(lp->probname); lp->probname = strdup(name); } bool lps_setobjname( Lps* lp, const char* name) { assert(lp != NULL); assert(name != NULL); bool is_not_empty = lp->objname != NULL; if (is_not_empty) free(lp->objname); lp->objname = strdup(name); return is_not_empty; } void lps_setrhsname( Lps* lp, const char* name) { assert(lp != NULL); assert(name != NULL); if (lp->rhsname != NULL) free(lp->rhsname); lp->rhsname = strdup(name); } void lps_setbndname( Lps* lp, const char* name) { assert(lp != NULL); assert(name != NULL); if (lp->bndname != NULL) free(lp->bndname); lp->bndname = strdup(name); } void lps_setrngname( Lps* lp, const char* name) { assert(lp != NULL); assert(name != NULL); if (lp->rngname != NULL) free(lp->rngname); lp->rngname = strdup(name); } void lps_getcost( const Var* var, mpq_t cost) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(cost, var->cost); } bool lps_haslower(const Var* var) { assert(var != NULL); assert(var->sid == VAR_SID); return HAS_LOWER(var); } void lps_setcost( Var* var, const mpq_t cost) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(var->cost, cost); } void lps_getlower(const Var* var, mpq_t lower) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(lower, var->lower); } void lps_setlower( Var* var, const mpq_t lower) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(var->lower, lower); /* FREE -> LOWER * LOWER -> LOWER * UPPER -> BOXED/FIXED * BOXED -> BOXED/FIXED * FIXED -> BOXED/FIXED */ if (var->type == VAR_FREE) var->type = VAR_LOWER; else if (var->type != VAR_LOWER) { assert(var->type == VAR_UPPER || var->type == VAR_BOXED || var->type == VAR_FIXED); var->type = mpq_equal(var->lower, var->upper) ? VAR_FIXED : VAR_BOXED; } } bool lps_hasupper(const Var* var) { assert(var != NULL); assert(var->sid == VAR_SID); return HAS_UPPER(var); } void lps_getupper(const Var* var, mpq_t upper) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(upper, var->upper); } void lps_setupper( Var* var, const mpq_t upper) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(var->upper, upper); /* FREE -> LOWER * LOWER -> LOWER * UPPER -> BOXED/FIXED * BOXED -> BOXED/FIXED * FIXED -> BOXED/FIXED */ if (var->type == VAR_FREE) var->type = VAR_UPPER; else if (var->type != VAR_UPPER) { assert(var->type == VAR_LOWER || var->type == VAR_BOXED || var->type == VAR_FIXED); var->type = mpq_equal(var->lower, var->upper) ? VAR_FIXED : VAR_BOXED; } } void lps_setlhs( Con* con, const mpq_t lhs) { assert(con != NULL); assert(con->sid == CON_SID); mpq_set(con->lhs, lhs); /* FREE -> LHS * LHS -> LHS * RHS -> RANGE/EQUAL * RANGE -> RANGE/EQUAL * EQUAL -> RANGE/EQUAL */ if (con->type == CON_FREE) con->type = CON_LHS; else if (con->type != CON_LHS) { assert(con->type == CON_RHS || con->type == CON_RANGE || con->type == CON_EQUAL); con->type = mpq_equal(con->lhs, con->rhs) ? CON_EQUAL : CON_RANGE; } } void lps_setrhs( Con* con, const mpq_t rhs) { assert(con != NULL); assert(con->sid == CON_SID); mpq_set(con->rhs, rhs); /* FREE -> RHS * RHS -> RHS * LHS -> RANGE/EQUAL * RANGE -> RANGE/EQUAL * EQUAL -> RANGE/EQUAL */ if (con->type == CON_FREE) con->type = CON_RHS; else if (con->type != CON_RHS) { assert(con->type == CON_LHS || con->type == CON_RANGE || con->type == CON_EQUAL); con->type = mpq_equal(con->lhs, con->rhs) ? CON_EQUAL : CON_RANGE; } } void lps_setcontype( Con* con, ConType type) { assert(con != NULL); assert(con->sid == CON_SID); con->type = type; } ConType lps_contype(const Con* con) { assert(con != NULL); assert(con->sid == CON_SID); return con->type; } VarType lps_vartype(const Var* var) { assert(var != NULL); assert(var->sid == VAR_SID); return var->type; } VarClass lps_getclass(const Var *var) { assert(var != NULL); assert(var->sid == VAR_SID); return var->vclass; } void lps_setclass(Var *var, VarClass vclass) { assert(var != NULL); assert(var->sid == VAR_SID); var->vclass = vclass; } void lps_getlhs( const Con* con, mpq_t lhs) { assert(con != NULL); assert(con->sid == CON_SID); mpq_set(lhs, con->lhs); } void lps_getrhs( const Con* con, mpq_t rhs) { assert(con != NULL); assert(con->sid == CON_SID); mpq_set(rhs, con->rhs); } const char* lps_varname(const Var* var) { assert(var != NULL); assert(var->sid == VAR_SID); return var->name; } void lps_setvartype( Var* var, VarType type) { assert(var != NULL); assert(var->sid == VAR_SID); var->type = type; } unsigned int lps_flags(const Con* con) { assert(con != NULL); assert(con->sid == CON_SID); return con->flags; } void lps_addflags( Con* con, unsigned int flags) { assert(con != NULL); assert(con->sid == CON_SID); con->flags |= flags; } void lps_setscale( Con* con, const mpq_t scale) { assert(con != NULL); assert(con->sid == CON_SID); mpq_set(con->scale, scale); } void lps_setpriority( Var* var, int priority) { assert(var != NULL); assert(var->sid == VAR_SID); var->priority = priority; } void lps_setvalue( Var* var, const mpq_t value) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(var->value, value); } void lps_setstartval( Var* var, const mpq_t startval) { assert(var != NULL); assert(var->sid == VAR_SID); mpq_set(var->startval, startval); } void lps_setnamelen( Lps* lp, int name_len) { lp->name_len = name_len; } void lps_setindicator( Con* con, Var* var, bool on_true) { assert(con != NULL); assert(con->sid == CON_SID); assert(var != NULL); assert(var->sid == VAR_SID); con->ind_var = var; con->ind_dir = on_true; } void lps_stat(const Lps* lp) { assert(lps_valid(lp)); printf("Name: %s Variables: %d Constraints: %d Non Zeros: %d\n", lp->name, lp->vars, lp->cons, lp->nonzeros); } int lps_getnamesize(const Lps* lp, LpFormat format) { int name_size = 0; assert(lp != NULL); switch(format) { case LP_FORM_LPF : name_size = 1 + ((lp->name_len < MIN_NAME_LEN) ? LPF_NAME_LEN : lp->name_len); break; case LP_FORM_HUM : name_size = 4096; break; case LP_FORM_MPS : name_size = 1 + ((lp->name_len < MIN_NAME_LEN) ? MPS_NAME_LEN : lp->name_len); break; case LP_FORM_RLP : name_size = 1 + ((lp->name_len < MIN_NAME_LEN) ? LPF_NAME_LEN : lp->name_len); break; case LP_FORM_PIP : name_size = 1 + ((lp->name_len < MIN_NAME_LEN) ? PIP_NAME_LEN : lp->name_len); break; default : abort(); } assert(name_size > MIN_NAME_LEN); return name_size; } void lps_write( const Lps* lp, FILE* fp, LpFormat format, const char* text) { assert(lp != NULL); assert(fp != NULL); lps_number(lp); switch(format) { case LP_FORM_LPF : case LP_FORM_RLP : case LP_FORM_PIP : case LP_FORM_HUM : lpf_write(lp, fp, format, text); break; case LP_FORM_MPS : mps_write(lp, fp, text); break; default : abort(); } } static bool lpfstrncpy(char* t, const char* s, int len) { /* '@' was excluded, to make sure the appendix is unique. */ static const char* const allowed = "!#$%&()/,.;?_{}|~"; bool was_smashed = false; while(--len >= 0 && *s != '\0') { if (isalnum(*s) || strchr(allowed, *s) != NULL) *t = *s; else { *t = '_'; was_smashed = true; } s++; t++; } *t = '\0'; return was_smashed; } static void make_full_name( char* target, int size, const char* name) { assert(target != NULL); assert(size >= MIN_NAME_LEN); assert(name != NULL); const char* s = name; bool first = true; bool in_string = false; int i = 0; /* We allways start with a space */ while(*s != '\0' && size > i + 6) { if (*s != '#' && *s != '$') target[i++] = *s; else { if (first) { first = false; target[i++] = '['; } else { if (in_string) { target[i++] = '\"'; in_string = false; } target[i++] = ','; } if (*s == '$') { assert(!in_string); in_string = true; target[i++] = '\"'; } } assert(size >= i); s++; } if (size > i + 2) { if (in_string) target[i++] = '\"'; if (!first) target[i++] = ']'; } target[i++] = '\0'; assert(size >= i); } /* size has to be big enough to store a '@', a '\0' * and the var or row number. */ void lps_makename( char* target, int size, const char* name, int no) { char temp[9]; int len; int nlen; assert(target != NULL); assert(size > MIN_NAME_LEN); /* 8+1, so we have at least '@' + 7 digits + '\0' */ assert(name != NULL); assert(no >= -1); assert(no <= 0xFFFFFFF); /* 7 hex digits = 268,435,455 */ nlen = (int)strlen(name); /* There are 3 possibilities: * * i) name is smaller than size and does not contain problematic chars * -> just copy it. * ii) as above but contains unvalid chars * -> copy it, transform the chars to '_' and append "@varnum". * iii) the name is longer than the size. * -> do as in ii) but only copy as much chars as fit. * iv) no == -1 * -> generate a full human readable name */ if (no == -1) make_full_name(target, size, name); else if (nlen < size) { if (lpfstrncpy(target, name, nlen)) { sprintf(temp, "@%x", (unsigned int)no); len = size - (int)strlen(temp) - 1; assert(len >= 0); /* Trick: if len > strlen(target) it doesn't matter, * lpfstrncmp always appends a '\0' and the strcat below * will append temp at the right place. * Otherwise it will be appended at len, which is the * latest possible position. */ target[len] = '\0'; strcat(target, temp); } } else { sprintf(temp, "@%x", (unsigned int)no); len = size - (int)strlen(temp) - 1; /* -1 for '\0' */ assert(len >= 0); (void)lpfstrncpy(target, name, len); strcat(target, temp); } assert(strlen(target) <= (size_t)size - 1); } void lps_transtable(const Lps* lp, FILE* fp, LpFormat format, const char* head) { Var* var; Con* con; char* temp; int namelen; assert(lps_valid(lp)); assert(fp != NULL); assert(head != NULL); assert(format == LP_FORM_LPF || format == LP_FORM_MPS || format == LP_FORM_RLP || format == LP_FORM_PIP); namelen = lps_getnamesize(lp, format); temp = malloc((size_t)namelen); assert(temp != NULL); lps_number(lp); for(var = lp->var_root; var != NULL; var = var->next) { lps_makename(temp, namelen, var->name, var->number); if (var->type == VAR_FIXED) fprintf(fp, "%s\tv %7d\t%-*s\t\"%s\"\t%.16e\n", head, var->number, namelen - 1, temp, var->name, mpq_get_d(var->lower)); else { if (var->size > 0 || !mpq_equal(var->cost, const_zero)) fprintf(fp, "%s\tv %7d\t%-*s\t\"%s\"\n", head, var->number, namelen - 1, temp, var->name); } } for(con = lp->con_root; con != NULL; con = con->next) { lps_makename(temp, namelen, con->name, con->number); fprintf(fp, "%s\tc %7d\t%-*s\t\"%s\"\t%.16e\n", head, con->number, namelen - 1, temp, con->name, mpq_get_d(con->scale)); } free(temp); } void lps_clearobj(const Lps* lp) { assert(lps_valid(lp)); for(Var* var = lp->var_root; var != NULL; var = var->next) mpq_set(var->cost, const_zero); } void lps_scale(const Lps* lp) { Con* con; Nzo* nzo; mpq_t maxi; mpq_t v; assert(lps_valid(lp)); mpq_init(maxi); mpq_init(v); for(con = lp->con_root; con != NULL; con = con->next) { if ((con->flags & LP_FLAG_CON_SCALE) > 0) { mpq_set_ui(maxi, 0, 1); /* = 0 */ for(nzo = con->first; nzo != NULL; nzo = nzo->con_next) { mpq_abs(v, nzo->value); if (mpq_cmp(v, maxi) > 0) mpq_set(maxi, v); } mpq_inv(con->scale, maxi); /* scale = 1 / maxi */ if (HAS_RHS(con)) mpq_mul(con->rhs, con->rhs, con->scale); if (HAS_LHS(con)) mpq_mul(con->lhs, con->lhs, con->scale); for(nzo = con->first; nzo != NULL; nzo = nzo->con_next) mpq_mul(nzo->value, nzo->value, con->scale); } } mpq_clear(v); mpq_clear(maxi); } bool lps_has_sos(const Lps* lp) { assert(lps_valid(lp)); return lp->soss > 0; } bool lps_con_sumup(const Con* con, mpq_t sum) { bool usable = true; Nzo* nzo; mpq_t val; mpq_set_si(sum, 0, 1); mpq_init(val); for(nzo = con->first; nzo != NULL; nzo = nzo->con_next) { if (nzo->var->vclass != VAR_INT) { usable = false; break; } mpq_mul(val, nzo->value, nzo->var->startval); mpq_add(sum, sum, val); } mpq_clear(val); return usable; } /* ------------------------------------------------------------------------- */ /* Emacs Local Variables: */ /* Emacs mode:c */ /* Emacs c-basic-offset:3 */ /* Emacs tab-width:8 */ /* Emacs indent-tabs-mode:nil */ /* Emacs End: */ /* ------------------------------------------------------------------------- */ zimpl-3.3.6/src/zimpl/blkmem.h0000644001417200060250000000326113304236715016125 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: blkmem.h */ /* Name....: Block Memory Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _BLKMEM_H_ #define _BLKMEM_H_ #ifdef __cplusplus extern "C" { #endif extern void blk_init(void); extern void blk_exit(void); extern void* blk_alloc(int size); extern void blk_free(void* p, int size); #ifdef __cplusplus } #endif #endif /* _BLKMEM_H_ */ zimpl-3.3.6/src/zimpl/prog.h0000644001417200060250000000535713304236715015635 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: prog.h */ /* Name....: Program Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _PROG_H_ #define _PROG_H_ #ifndef _STMT_H_ #error "Need to include stmt.h before prog.h" #endif #ifdef __cplusplus extern "C" { #endif typedef struct program Prog; /* prog.c */ extern void* prog_get_lp(void); /*lint -sem( prog_new, 1p) */ extern Prog* prog_new(void); /*lint -sem( prog_free, custodial(1), 1p == 1) */ extern void prog_free(Prog* prog); /*lint -sem( prog_is_valid, 1p == 1) */ extern bool prog_is_valid(const Prog* prog); /*lint -sem( prog_is_empty, 1p == 1) */ extern bool prog_is_empty(const Prog* prog); /*lint -sem( prog_add_stmt, custodial(2), 1p == 1 && 2p == 1) */ extern void prog_add_stmt(Prog* prog, Stmt* stmt); /*lint -sem( prog_print, 1p == 1 && 2p == 1) */ extern void prog_print(FILE* fp, const Prog* prog); /*lint -sem( prog_execute, 1p == 1) */ extern void prog_execute(const Prog* prog, void* lp); /*lint -sem( prog_tostr, 1p == 1 && nulterm(2), @p == 1) */ extern char* prog_tostr(const Prog* prog, const char* prefix, const char* title, size_t max_output_line_len); /* load.c */ /*lint -sem( prog_load, nulterm(3), 1p == 1) */ extern void prog_load(Prog* prog, const char* cmd, const char* filename); #ifdef __cplusplus } #endif #endif /* _PROG_H_ */ zimpl-3.3.6/src/zimpl/setlist.c0000644001417200060250000003053113304236715016340 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setlist.c */ /* Name....: Set List Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/hash.h" #include "zimpl/list.h" #include "zimpl/stmt.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/set4.h" #ifdef _MSC_VER #pragma warning (disable: 4100) /* unreferenced formal parameter */ #endif #define SET_LIST_SID 0x5345544c #define SET_LIST_ITER_SID 0x53454c49 #define HASH_THRESHOLD 12 /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_list_is_valid(const Set* set) { if (set == NULL || !SID_ok2(set->list, SET_LIST_SID) || set->head.refc <= 0 || set->head.dim != 1 || set->head.members < 0 || set->list.size < set->head.members || set->list.member == NULL) return false; for(SetIterIdx i = 0; i < set->head.members; i++) if (!elem_is_valid(set->list.member[i])) return false; return true; } static bool set_list_iter_is_valid(const SetIter*iter) { return iter != NULL && SID_ok2(iter->list, SET_LIST_ITER_SID) && iter->list.first >= 0 && iter->list.last >= -1 && iter->list.now >= 0 && iter->list.now >= iter->list.first; } /* ------------------------------------------------------------------------- * --- internal * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ static SetIterIdx lookup_elem_idx(const Set* set, const Elem* elem) { assert(set_list_is_valid(set)); assert(elem_is_valid(elem)); if (set->list.hash != NULL) return hash_lookup_elem_idx(set->list.hash, elem); for(SetIterIdx i = 0; i < set->list.head.members; i++) if (!elem_cmp(elem, set->list.member[i])) return i; return -1; } /* ------------------------------------------------------------------------- * --- new * ------------------------------------------------------------------------- */ Set* set_list_new(int size, int flags) { Set* set; assert(size > 0); set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = 1; set->head.members = 0; set->head.type = SET_LIST; set->list.size = size; set->list.member = calloc((size_t)size, sizeof(*set->list.member)); assert(set->list.member != NULL); if ((flags & SET_NO_HASH) == 0 && size > HASH_THRESHOLD) set->list.hash = hash_new(HASH_ELEM_IDX, size); SID_set2(set->list, SET_LIST_SID); assert(set_list_is_valid(set)); return set; } SetIterIdx set_list_add_elem(Set* set, const Elem* elem, SetCheckType check) { SetIterIdx idx = -1; assert(set_list_is_valid(set)); assert(elem_is_valid(elem)); if (check != SET_CHECK_NONE && (idx = lookup_elem_idx(set, elem)) >= 0) { if (check != SET_CHECK_QUIET) { assert(check == SET_CHECK_WARN); if (stmt_trigger_warning(164)) { fprintf(stderr, "--- Warning 164: Duplicate element "); elem_print(stderr, elem, true); fprintf(stderr, " for set rejected\n"); } } } else { idx = set->head.members; set->list.member[idx] = elem_copy(elem); if (set->list.hash != NULL) hash_add_elem_idx(set->list.hash, set->list.member[idx], idx); set->head.members++; assert(set->head.members <= set->list.size); } assert(idx >= 0); return idx; } Set* set_list_new_from_elems(const List* list, SetCheckType check) { ListElem* le = NULL; Set* set; int n; assert(list_is_valid(list)); n = list_get_elems(list); assert(n > 0); set = set_list_new(n, SET_DEFAULT); while(n-- > 0) (void)set_list_add_elem(set, list_get_elem(list, &le), check); assert(set_list_is_valid(set)); return set; } Set* set_list_new_from_tuples(const List* list, SetCheckType check) { ListElem* le = NULL; const Tuple* tuple; Set* set; int n; assert(list_is_valid(list)); n = list_get_elems(list); assert(n > 0); set = set_list_new(n, SET_DEFAULT); while(n-- > 0) { tuple = list_get_tuple(list, &le); assert(tuple_get_dim(tuple) == 1); (void)set_list_add_elem(set, tuple_get_elem(tuple, 0), check); } assert(set_list_is_valid(set)); return set; } Set* set_list_new_from_entries(const List* list, SetCheckType check) { ListElem* le = NULL; const Tuple* tuple; Set* set; int n; assert(list_is_valid(list)); n = list_get_elems(list); assert(n > 0); set = set_list_new(n, SET_DEFAULT); while(n-- > 0) { tuple = entry_get_tuple(list_get_entry(list, &le)); assert(tuple_get_dim(tuple) == 1); (void)set_list_add_elem(set, tuple_get_elem(tuple, 0), check); } assert(set_list_is_valid(set)); return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_list_copy(const Set* source) { Set* set = (Set*)source; set->head.refc++; return set; } /* ------------------------------------------------------------------------- * --- free * ------------------------------------------------------------------------- */ static void set_list_free(Set* set) { assert(set_list_is_valid(set)); set->head.refc--; if (set->head.refc == 0) { int i; SID_del2(set->list); for(i = 0; i < set->head.members; i++) elem_free(set->list.member[i]); if (set->list.hash != NULL) hash_free(set->list.hash); free(set->list.member); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ static SetIterIdx set_list_lookup_idx(const Set* set, const Tuple* tuple, int offset) { assert(set_list_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); return lookup_elem_idx(set, tuple_get_elem(tuple, offset)); } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ static void set_list_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { assert(set_list_is_valid(set)); assert(idx >= 0); assert(idx <= set->head.members); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); tuple_set_elem(tuple, offset, elem_copy(set->list.member[idx])); } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ /* Initialise Iterator. Write into iter */ static SetIter* set_list_iter_init( const Set* set, const Tuple* pattern, int offset) { const Elem* elem; SetIter* iter; assert(set_list_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(offset >= 0); assert(pattern == NULL || offset < tuple_get_dim(pattern)); iter = calloc(1, sizeof(*iter)); assert(iter != NULL); if (pattern == NULL) { iter->list.first = 0; iter->list.last = set->head.members - 1; } else { elem = tuple_get_elem(pattern, offset); if (elem_get_type(elem) == ELEM_NAME) { iter->list.first = 0; iter->list.last = set->head.members - 1; } else { iter->list.first = lookup_elem_idx(set, elem); if (iter->list.first >= 0) iter->list.last = iter->list.first; else { iter->list.first = 1; iter->list.last = 0; } } } iter->list.now = iter->list.first; SID_set2(iter->list, SET_LIST_ITER_SID); assert(set_list_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* false means, there is no further element */ static bool set_list_iter_next( SetIter* iter, const Set* set, Tuple* tuple, int offset) { assert(set_list_iter_is_valid(iter)); assert(set_list_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset < tuple_get_dim(tuple)); if (iter->list.now > iter->list.last) return false; tuple_set_elem(tuple, offset, elem_copy(set->list.member[iter->list.now])); iter->list.now++; return true; } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_list_iter_exit(SetIter* iter, UNUSED const Set* set) { assert(set_list_iter_is_valid(iter)); SID_del2(iter->list); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void set_list_iter_reset(SetIter* iter, UNUSED const Set* set) { assert(set_list_iter_is_valid(iter)); iter->list.now = iter->list.first; } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_list_init(SetVTab* vtab) { vtab[SET_LIST].set_copy = set_list_copy; vtab[SET_LIST].set_free = set_list_free; vtab[SET_LIST].set_lookup_idx = set_list_lookup_idx; vtab[SET_LIST].set_get_tuple = set_list_get_tuple; vtab[SET_LIST].iter_init = set_list_iter_init; vtab[SET_LIST].iter_next = set_list_iter_next; vtab[SET_LIST].iter_exit = set_list_iter_exit; vtab[SET_LIST].iter_reset = set_list_iter_reset; vtab[SET_LIST].set_is_valid = set_list_is_valid; } /* ------------------------------------------------------------------------- * --- extras * ------------------------------------------------------------------------- */ const Elem* set_list_get_elem(const Set* set, SetIterIdx idx) { assert(set_list_is_valid(set)); assert(idx >= 0); assert(idx < set->head.members); return set->list.member[idx]; } zimpl-3.3.6/src/zimpl/ratordwrite.c0000644001417200060250000000561013304236715017217 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratordwrite.c */ /* Name....: ORD File Write */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" /* A specification for the ORD file format can be found in the * ILOG CPLEX 7.0 Reference Manual page 545. */ void lps_orderfile( const Lps* lp, FILE* fp, LpFormat format, const char* text) { const Var* var; int name_size; char* vtmp; assert(lp != NULL); assert(fp != NULL); assert(format == LP_FORM_LPF || format == LP_FORM_MPS); name_size = lps_getnamesize(lp, format); vtmp = malloc((size_t)name_size); assert(vtmp != NULL); if (text != NULL) fprintf(fp, "* %s\n", text); fprintf(fp, "NAME %8.8s\n", lp->name); for(var = lp->var_root; var != NULL; var = var->next) { if (var->vclass == VAR_CON) continue; if (var->size == 0) continue; if (var->type == VAR_FIXED) continue; lps_makename(vtmp, name_size, var->name, var->number); fprintf(fp, " %-*s %8d %.10e\n", name_size - 1, vtmp, var->priority, mpq_get_d(var->startval)); } fprintf(fp, "ENDATA\n"); free(vtmp); } zimpl-3.3.6/src/zimpl/elem.c0000644001417200060250000001767513304236715015611 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: elem.c */ /* Name....: Element Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/mme.h" #include "zimpl/strstore.h" #define ELEM_STORE_SIZE 1000 #define ELEM_SID 0x456c656d typedef union element_value ElemValue; typedef struct element_storage ElemStore; union element_value { Numb* numb; const char* strg; const char* name; Elem* next; }; struct element { SID ElemType type; ElemValue value; }; struct element_storage { Elem* begin; ElemStore* next; }; static ElemStore* store_anchor = NULL; static Elem* store_free = NULL; static int store_count = 0; static void extend_storage(void) { ElemStore* store = calloc(1, sizeof(*store)); Elem* elem; int i; assert(store != NULL); store->begin = malloc(ELEM_STORE_SIZE * sizeof(*store->begin)); store->next = store_anchor; store_anchor = store; for(i = 0; i < ELEM_STORE_SIZE - 1; i++) { elem = &store->begin[i]; elem->type = ELEM_FREE; elem->value.next = &store->begin[i + 1]; SID_set(elem, ELEM_SID); assert(elem_is_valid(elem)); } elem = &store->begin[i]; elem->type = ELEM_FREE; elem->value.next = store_free; SID_set(elem, ELEM_SID); assert(elem_is_valid(elem)); store_free = &store->begin[0]; assert(store->begin != NULL); assert(store_anchor != NULL); assert(store_free != NULL); } static Elem* new_elem(void) { Elem* elem; if (store_free == NULL) extend_storage(); assert(store_free != NULL); elem = store_free; store_free = elem->value.next; store_count++; assert(elem->type == ELEM_FREE); assert(elem_is_valid(elem)); return elem; } void elem_init() { } void elem_exit() { ElemStore* store; ElemStore* next; if (store_count != 0) printf("Elem store count %d\n", store_count); for(store = store_anchor; store != NULL; store = next) { #if 0 /* only for debugging */ int i; for(i = 0; i < ELEM_STORE_SIZE - 1; i++) { elem_print(stderr, &store->begin[i], true); fprintf(stderr, "\n"); } #endif next = store->next; free(store->begin); free(store); } store_anchor = NULL; store_free = NULL; store_count = 0; } Elem* elem_new_numb(const Numb* numb) { Elem* elem = new_elem(); assert(elem != NULL); elem->type = ELEM_NUMB; elem->value.numb = numb_copy(numb); return elem; } Elem* elem_new_strg(const char* strg) { Elem* elem = new_elem(); assert(strg != NULL); assert(elem != NULL); elem->type = ELEM_STRG; elem->value.strg = strg; return elem; } Elem* elem_new_name(const char* name) { Elem* elem = new_elem(); assert(name != NULL); assert(elem != NULL); elem->type = ELEM_NAME; elem->value.strg = name; return elem; } void elem_free(Elem* elem) { assert(elem_is_valid(elem)); if (elem->type == ELEM_NUMB) numb_free(elem->value.numb); elem->type = ELEM_FREE; elem->value.next = store_free; store_free = elem; store_count--; } bool elem_is_valid(const Elem* elem) { return elem != NULL && SID_ok(elem, ELEM_SID); } Elem* elem_copy(const Elem* source) { Elem* elem = new_elem(); assert(elem_is_valid(source)); assert(elem_is_valid(elem)); if (source->type != ELEM_NUMB) *elem = *source; else { elem->type = ELEM_NUMB; elem->value.numb = numb_copy(source->value.numb); } return elem; } /* 0 wenn gleich, sonst != 0 */ bool elem_cmp(const Elem* elem_a, const Elem* elem_b) { assert(elem_is_valid(elem_a)); assert(elem_is_valid(elem_b)); assert(elem_a->type != ELEM_ERR); assert(elem_b->type != ELEM_ERR); /* Auf die schnelle vorweg. */ if (elem_a == elem_b) return false; if (elem_a->type != elem_b->type) { fprintf(stderr, "*** Error 160: Comparison of elements with different types "); elem_print(stderr, elem_a, true); fprintf(stderr, " / "); elem_print(stderr, elem_b, true); fputc('\n', stderr); zpl_exit(EXIT_FAILURE); } assert(elem_a->type == elem_b->type); if (elem_a->type == ELEM_STRG) return strcmp(elem_a->value.strg, elem_b->value.strg) != 0; assert(elem_a->type == ELEM_NUMB); return !numb_equal(elem_a->value.numb, elem_b->value.numb); } ElemType elem_get_type(const Elem* elem) { assert(elem_is_valid(elem)); return elem->type; } const Numb* elem_get_numb(const Elem* elem) { assert(elem_is_valid(elem)); assert(elem->type == ELEM_NUMB); return elem->value.numb; } const char* elem_get_strg(const Elem* elem) { assert(elem_is_valid(elem)); assert(elem->type == ELEM_STRG); assert(elem->value.strg != NULL); return elem->value.strg; } const char* elem_get_name(const Elem* elem) { assert(elem_is_valid(elem)); assert(elem->type == ELEM_NAME); assert(elem->value.name != NULL); return elem->value.name; } void elem_print(FILE* fp, const Elem* elem, bool use_quotes) { assert(elem_is_valid(elem)); switch(elem->type) { case ELEM_NUMB : fprintf(fp, "%.16g", numb_todbl(elem->value.numb)); break; case ELEM_STRG : fprintf(fp, use_quotes ? "\"%s\"" : "%s", elem->value.strg); break; case ELEM_NAME : fprintf(fp, "%s", elem->value.name); break; case ELEM_FREE : fprintf(fp, "Unused Elem!"); break; default : abort(); } } unsigned int elem_hash(const Elem* elem) { unsigned int hcode = 0; switch(elem->type) { case ELEM_NUMB : hcode = numb_hash(elem->value.numb); break; case ELEM_STRG : hcode = str_hash(elem->value.strg); break; case ELEM_NAME : hcode = str_hash(elem->value.name); break; case ELEM_FREE : default : abort(); } return hcode; } char* elem_tostr(const Elem* elem) { char* str; assert(elem_is_valid(elem)); switch(elem->type) { case ELEM_NUMB : str = malloc(32); assert(str != NULL); sprintf(str, "%.16g", numb_todbl(elem->value.numb)); break; case ELEM_STRG : str = strdup(elem->value.strg); break; case ELEM_NAME : str = strdup(elem->value.name); break; case ELEM_FREE : default : abort(); } assert(str != NULL); return str; } zimpl-3.3.6/src/zimpl/random.h0000644001417200060250000000335113304236715016136 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: random.h */ /* Name....: Random Number Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _RANDOM_H_ #define _RANDOM_H_ #ifdef __cplusplus extern "C" { #endif extern void rand_init(unsigned long s); extern unsigned int rand_get_int32(void); /*lint -sem( rand_get_range, 1n < 2n) */ extern int rand_get_range(int mini, int maxi); #ifdef __cplusplus } #endif #endif /* RANDOM */ zimpl-3.3.6/src/zimpl/ratpresolve.c0000644001417200060250000003756013304236715017230 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: lpstore.c */ /* Name....: Store Linear Programm */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #if 0 /* Not used anymore ??? */ #include #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" /*lint -e{818} supress "Pointer parameter 'var' could be declared as pointing to const" */ static void remove_fixed_var( Lps* lp, Var* var, int verbose_level) { Nzo* nzo; mpq_t x; mpq_t temp; bool is_zero; assert(lp != NULL); assert(var != NULL); assert(var->type == VAR_FIXED && mpq_equal(var->lower, var->upper)); if (verbose_level > 0) printf("Removing variable %s fixed to %g\n", var->name, mpq_get_d(var->lower)); mpq_init(x); mpq_init(temp); is_zero = mpq_equal(var->lower, x /* zero */); while(var->first != NULL) { nzo = var->first; /* Do we have to ajust the lhs/rhs ? */ if (!is_zero) { mpq_mul(x, var->lower, nzo->value); /* do we have a valid rhs ? */ if (HAS_RHS(nzo->con)) { mpq_sub(temp, nzo->con->rhs, x); lps_setrhs(nzo->con, temp); } /* do we have a valid lhs ? */ if (HAS_LHS(nzo->con)) { mpq_sub(temp, nzo->con->lhs, x); lps_setlhs(nzo->con, temp); } } lps_delnzo(lp, nzo); } mpq_clear(temp); mpq_clear(x); } static PSResult simple_rows( Lps* lp, Bool* again, int verbose_level) { bool have_up; bool have_lo; mpq_t up; mpq_t lo; Nzo* nzo; Var* var; Con* con; Con* con_next; int rem_rows = 0; int rem_nzos = 0; mpq_init(up); mpq_init(lo); for(con = lp->con_root; con != NULL; con = con_next) { con_next = con->next; /* infeasible range row */ if (con->type == CON_RANGE && mpq_cmp(con->lhs, con->rhs) > 0) { printf("Infeasible range row %s lhs=%g rhs=%g\n", con->name, mpq_get_d(con->lhs), mpq_get_d(con->rhs)); return PRESOLVE_INFEASIBLE; } /* empty row ? */ if (con->size == 0) { if ( (HAS_RHS(con) && mpq_cmp(con->rhs, const_zero) < 0) || (HAS_LHS(con) && mpq_cmp(con->lhs, const_zero) > 0)) { printf("Infeasible empty row %s lhs=%g rhs=%g\n", con->name, mpq_get_d(con->lhs), mpq_get_d(con->rhs)); return PRESOLVE_INFEASIBLE; } if (verbose_level > 0) printf("Empty row %s removed\n", con->name); lps_delcon(lp, con); rem_rows++; continue; } /* unconstraint constraint */ if (con->type == CON_FREE) { if (verbose_level > 0) printf("Unconstraint row %s removed\n", con->name); rem_rows++; rem_nzos += con->size; lps_delcon(lp, con); continue; } /* row singleton */ if (con->size == 1) { have_up = false; have_lo = false; nzo = con->first; var = nzo->var; if (mpq_cmp(nzo->value, const_zero) > 0) /* x > 0 */ { if (HAS_RHS(con)) { mpq_div(up, con->rhs, nzo->value); have_up = true; } if (HAS_LHS(con)) { mpq_div(lo, con->lhs, nzo->value); have_lo = true; } } else if (mpq_cmp(nzo->value, const_zero) < 0) /* x < 0 */ { if (HAS_RHS(con)) { mpq_div(lo, con->rhs, nzo->value); have_lo = true; } if (HAS_LHS(con)) { mpq_div(up, con->lhs, nzo->value); have_up = true; } } else if ((HAS_RHS(con) && !mpq_equal(con->rhs, const_zero)) || (HAS_LHS(con) && !mpq_equal(con->lhs, const_zero))) { /* x == 0 rhs/lhs != 0 */ printf("Infeasibel row %s Zero row singleton with non zero lhs or rhs\n", con->name); return PRESOLVE_INFEASIBLE; } assert(!HAS_LOWER(var) || !HAS_UPPER(var) || mpq_cmp(var->lower, var->upper) <= 0); if (have_up && (!HAS_UPPER(var) || mpq_cmp(up, var->upper) < 0)) lps_setupper(var, up); if (have_lo && (!HAS_LOWER(var) || mpq_cmp(lo, var->lower) > 0)) lps_setlower(var, lo); if (HAS_LOWER(var) && HAS_UPPER(var) && mpq_cmp(var->lower, var->upper) > 0) { printf("Row %s implise infeasible bounds on var %s, lower=%g upper=%g\n", con->name, var->name, mpq_get_d(var->lower), mpq_get_d(var->upper)); return PRESOLVE_INFEASIBLE; } if (verbose_level > 1) printf("Row %s singleton var %s set to lower=%g upper=%g\n", con->name, var->name, mpq_get_d(var->lower), mpq_get_d(var->upper)); rem_rows++; rem_nzos++; lps_delcon(lp, con); continue; } } assert(rem_rows != 0 || rem_nzos == 0); if (rem_rows > 0) { *again = true; if (verbose_level > 0) printf("Simple row presolve removed %d rows and %d non-zeros\n", rem_rows, rem_nzos); } mpq_clear(up); mpq_clear(lo); return PRESOLVE_OKAY; } static PSResult handle_col_singleton( Lps* lp, Var* var, int verbose_level, int* rem_cols, int* rem_nzos) { Nzo* nzo; Con* con; int cmpres; mpq_t maxobj; assert(lp != NULL); assert(var != NULL); assert(verbose_level >= 0); assert(rem_cols != NULL); assert(rem_nzos != NULL); nzo = var->first; con = nzo->con; assert(!mpq_equal(nzo->value, const_zero)); mpq_init(maxobj); mpq_set(maxobj, var->cost); if (lp->direct == LP_MIN) mpq_neg(maxobj, maxobj); /* Value is positive */ if (mpq_cmp(nzo->value, const_zero) > 0.0) { /* max -3 x * s.t. 5 x (<= 8) * l <= x * * and we have NO lhs, (rhs does not matter) */ if (!HAS_LHS(con)) { cmpres = mpq_cmp(maxobj, const_zero); /* The objective is either zero or negative */ if (cmpres <= 0) { /* If we have no lower bound */ if (!HAS_LOWER(var)) { /* ... but a negative objective, so we get unbounded */ if (cmpres < 0) { printf("Unbounded var %s\n", var->name); return PRESOLVE_UNBOUNDED; } /* With a zero objective and no bounds, there is not * much we can do. */ } else { /* now we know we want to go to the lower bound. */ lps_setupper(var, var->lower); remove_fixed_var(lp, var, verbose_level); (*rem_cols)++; (*rem_nzos)++; return PRESOLVE_OKAY; } } } /* max 3 x * s.t. 5 x (>= 8) * x <= u * * and we have NO rhs, (lhs does not matter) */ if (!HAS_RHS(con)) { cmpres = mpq_cmp(maxobj, const_zero); /* The objective is either zero or positive */ if (cmpres >= 0) { /* If we have no upper bound */ if (!HAS_UPPER(var)) { /* ... but a positive objective, so we get unbounded */ if (cmpres > 0) { printf("Unbounded var %s\n", var->name); return PRESOLVE_UNBOUNDED; } /* With a zero objective and no bounds, there is not * much we can do. */ } else { /* now we know we want to go to the upper bound. */ lps_setlower(var, var->upper); remove_fixed_var(lp, var, verbose_level); (*rem_cols)++; (*rem_nzos)++; return PRESOLVE_OKAY; } } } } else { /* Value is negative */ assert(mpq_cmp(nzo->value, const_zero) < 0.0); /* max -3 x * s.t. -5 x (>= 8) * l <= x */ if (!HAS_RHS(con)) { cmpres = mpq_cmp(maxobj, const_zero); if (cmpres <= 0) { if (!HAS_LOWER(var)) { if (cmpres < 0) { printf("Unbounded var %s\n", var->name); return PRESOLVE_UNBOUNDED; } } else { lps_setupper(var, var->lower); remove_fixed_var(lp, var, verbose_level); (*rem_cols)++; (*rem_nzos)++; return PRESOLVE_OKAY; } } } /* max 3 x * s.t. -5 x (<= 8) * x <= u */ if (!HAS_LHS(con)) { cmpres = mpq_cmp(maxobj, const_zero); if (cmpres >= 0) { if (!HAS_UPPER(var)) { if (cmpres > 0) { printf("Unbounded var %s\n", var->name); return PRESOLVE_UNBOUNDED; } } else { lps_setlower(var, var->upper); remove_fixed_var(lp, var, verbose_level); (*rem_cols)++; (*rem_nzos)++; return PRESOLVE_OKAY; } } } } mpq_clear(maxobj); return PRESOLVE_OKAY; } static PSResult simple_cols( Lps* lp, Bool* again, int verbose_level) { PSResult res; mpq_t maxobj; int rem_cols = 0; int rem_nzos = 0; Var* var; mpq_init(maxobj); for(var = lp->var_root; var != NULL; var = var->next) { if (var->type == VAR_FIXED && var->size == 0) continue; /* Empty column ? */ if (var->size == 0) { mpq_set(maxobj, var->cost); if (lp->direct == LP_MIN) mpq_neg(maxobj, maxobj); if (mpq_cmp(maxobj, const_zero) > 0) { /* Do we not have an upper bound ? */ if (!HAS_UPPER(var)) { printf("Var %s unbounded\n", var->name); return PRESOLVE_UNBOUNDED; } lps_setlower(var, var->upper); } else if (mpq_cmp(maxobj, const_zero) < 0) { /* Do we not have an lower bound ? */ if (!HAS_LOWER(var)) { printf("Var %s unbounded\n", var->name); return PRESOLVE_UNBOUNDED; } lps_setupper(var, var->lower); } else { assert(mpq_equal(maxobj, const_zero)); /* any value within the bounds is ok */ if (HAS_LOWER(var)) lps_setupper(var, var->lower); else if (HAS_UPPER(var)) lps_setlower(var, var->upper); else { lps_setlower(var, const_zero); lps_setupper(var, const_zero); } } if (verbose_level > 1) printf("Empty var %s fixed\n", var->name); rem_cols++; continue; } /* infeasible bounds ? */ if (var->type == VAR_BOXED && mpq_cmp(var->lower, var->upper) > 0) { printf("Var %s infeasible bounds lower=%g upper=%g\n", var->name, mpq_get_d(var->lower), mpq_get_d(var->upper)); return PRESOLVE_INFEASIBLE; } /* Fixed column ? */ if (var->type == VAR_FIXED) { assert(var->size > 0); rem_cols++; rem_nzos += var->size; remove_fixed_var(lp, var, verbose_level); continue; } /* Column singleton */ if (var->size == 1) { res = handle_col_singleton(lp, var, verbose_level, &rem_cols, &rem_nzos); if (res != PRESOLVE_OKAY) return res; } } assert(rem_cols != 0 || rem_nzos == 0); if (rem_cols > 0) { *again = true; if (verbose_level > 0) printf("Simple col presolve removed %d cols and %d non-zeros\n", rem_cols, rem_nzos); } mpq_clear(maxobj); return PRESOLVE_OKAY; } PSResult lps_presolve(Lps* lp, int verbose_level) { PSResult ret = PRESOLVE_OKAY; bool again; /* bool rcagain; bool rragain; */ do { again = false; if (ret == PRESOLVE_OKAY) ret = simple_rows(lp, &again, verbose_level); if (ret == PRESOLVE_OKAY) ret = simple_cols(lp, &again, verbose_level); assert(ret == PRESOLVE_OKAY || again == false); } while(again); #if 0 if (ret == OKAY) ret = redundantCols(lp, rcagain); if (ret == OKAY) ret = redundantRows(lp, rragain); again = (ret == OKAY) && (rcagain || rragain); /* This has to be a loop, otherwise we could end up with * empty rows. */ while(again) { again = false; if (ret == OKAY) ret = simpleRows(lp, again); if (ret == OKAY) ret = simpleCols(lp, again); assert(ret == OKAY || again == false); } VERBOSE1({ std::cout << "IREDSM25 redundant simplifier removed " << m_remRows << " rows, " << m_remNzos << " nzos, changed " << m_chgBnds << " col bounds " << m_chgLRhs << " row bounds," << std::endl; }); #endif /* ??? does not work, because vars are not deleted */ if (lp->vars == 0 || lp->cons == 0) { /* ??? Check if this is ok. */ assert(lp->vars == 0 && lp->cons == 0); printf("Simplifier removed all variables and constraints\n"); ret = PRESOLVE_VANISHED; } return ret; } #endif zimpl-3.3.6/src/zimpl/mono.c0000644001417200060250000002330013304236715015615 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mono.c */ /* Name....: Monom Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include /* #define TRACE 1 */ #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/mono.h" #define MONO_SID 0x4d6f6e6f #define MOEL_SID 0x4d6f456c Mono* mono_new(const Numb* coeff, const Entry* entry, MFun fun) { Mono* mono = calloc(1, sizeof(*mono)); Trace("mono_new"); assert(mono != NULL); assert(entry_is_valid(entry)); assert(entry_get_type(entry) == SYM_VAR); mono->count = 1; mono->coeff = numb_copy(coeff); mono->fun = fun; mono->first.entry = entry_copy(entry); mono->first.next = NULL; SID_set(mono, MONO_SID); SID_set2(mono->first, MOEL_SID); assert(mono_is_valid(mono)); return mono; } #ifndef NDEBUG bool mono_is_valid(const Mono* mono) { const MonoElem* e; int count = 1; if (mono == NULL || !SID_ok(mono, MONO_SID) || !SID_ok2(mono->first, MOEL_SID) || mono->count < 1) abort(); mem_check(mono); assert(entry_is_valid(mono->first.entry)); for(e = mono->first.next; e != NULL; e = e->next) { count++; mem_check(e); if (!SID_ok(e, MOEL_SID)) abort(); assert(entry_is_valid(e->entry)); assert(entry_get_type(e->entry) == SYM_VAR); } if (count != mono->count) abort(); return true; } #endif void mono_free(Mono* mono) { MonoElem* e; MonoElem* q; Trace("mono_free"); assert(mono_is_valid(mono)); for(e = mono->first.next; e != NULL; e = q) { q = e->next; entry_free(e->entry); SID_del(e); free(e); } entry_free(mono->first.entry); numb_free(mono->coeff); SID_del2(mono->first); SID_del(mono); free(mono); } void mono_mul_entry( Mono* mono, const Entry* entry) { MonoElem* e; Var* var; MonoElem* last; Trace("mono_add_elem"); assert(mono_is_valid(mono)); assert(entry_is_valid(entry)); assert(entry_get_type(entry) == SYM_VAR); var = entry_get_var(entry); /* ??? This ensures that if the same variable is to come several times, * all of them come together, i.e. yxy is not allowed, yyx would be ok. * Is there any reason to do this? */ for(e = &mono->first; e != NULL; e = e->next) { last = e; assert(entry_is_valid(e->entry)); if (var == entry_get_var(e->entry)) break; } assert(last != NULL); e = calloc(1, sizeof(*e)); e->entry = entry_copy(entry); e->next = last->next; SID_set(e, MOEL_SID); last->next = e; mono->count++; assert(mono_is_valid(mono)); } Mono* mono_copy(const Mono* mono) { Mono* mnew; MonoElem* e; assert(mono_is_valid(mono)); mnew = mono_new(mono->coeff, mono->first.entry, mono->fun); for(e = mono->first.next; e != NULL; e = e->next) mono_mul_entry(mnew, e->entry); assert(mono_is_valid(mnew)); return mnew; } void mono_mul_coeff(const Mono* mono, const Numb* value) { Trace("mono_mul_coeff"); assert(mono_is_valid(mono)); assert(numb_is_valid(value)); numb_mul(mono->coeff, value); } void mono_add_coeff(const Mono* mono, const Numb* value) { Trace("mono_add_coeff"); assert(mono_is_valid(mono)); assert(numb_is_valid(value)); numb_add(mono->coeff, value); } unsigned int mono_hash(const Mono* mono) { size_t hcode = 0; const MonoElem* e; assert(mono_is_valid(mono)); for(e = &mono->first; e != NULL; e = e->next) hcode += ((size_t)entry_get_var(e->entry)) >> 2; return DISPERSE((unsigned int)hcode); } /** Checks whether two monoms cosist of the same variables. */ #if 1 /* We assume (I think it is true that there is only one distinct entry per var */ bool mono_equal(const Mono* ma, const Mono* mb) { const MonoElem* ea; const MonoElem* eb; assert(mono_is_valid(ma)); assert(mono_is_valid(mb)); if (ma->count != mb->count) return false; if (ma->count == 1 && (ma->first.entry != mb->first.entry)) return false; for(ea = &ma->first; ea != NULL; ea = ea->next) { const Entry* entry_a = ea->entry; assert(entry_is_valid(entry_a)); assert(entry_get_type(entry_a) == SYM_VAR); for(eb = &mb->first; eb != NULL; eb = eb->next) if (entry_a == eb->entry) break; if (eb == NULL) return false; /* Now all variables of a kind are consecutive */ while(ea->next != NULL && ea->next->entry == entry_a) { if (eb->next == NULL || eb->next->entry != entry_a) return false; ea = ea->next; /*lint !e850 loop index variable is modified in body of the loop */ eb = eb->next; } } return true; } #else /* old */ bool mono_equal(const Mono* ma, const Mono* mb) { const MonoElem* ea; const MonoElem* eb; Var* var_a; assert(mono_is_valid(ma)); assert(mono_is_valid(mb)); if (ma->count != mb->count) return false; if (ma->count == 1 && (entry_get_var(ma->first.entry) != entry_get_var(mb->first.entry))) return false; for(ea = &ma->first; ea != NULL; ea = ea->next) { assert(entry_is_valid(ea->entry)); var_a = entry_get_var(ea->entry); for(eb = &mb->first; eb != NULL; eb = eb->next) if (var_a == entry_get_var(eb->entry)) break; if (eb == NULL) return false; /* Now all variables of a kind are consecutive */ while(ea->next != NULL && entry_get_var(ea->next->entry) == var_a) { if (eb->next == NULL || entry_get_var(eb->next->entry) != var_a) return false; ea = ea->next; eb = eb->next; } } return true; } #endif Mono* mono_mul(const Mono* ma, const Mono* mb) { Mono* mono; const MonoElem* eb; assert(mono_is_valid(ma)); assert(mono_is_valid(mb)); mono = mono_copy(ma); numb_mul(mono->coeff, mb->coeff); for(eb = &mb->first; eb != NULL; eb = eb->next) { assert(entry_is_valid(eb->entry)); mono_mul_entry(mono, eb->entry); } assert(mono_is_valid(mono)); return mono; } void mono_neg(Mono* mono) { assert(mono_is_valid(mono)); numb_neg(mono->coeff); } bool mono_is_linear(const Mono* mono) { assert(mono_is_valid(mono)); /* ??? Effect not fully testet */ return mono->count == 1 && (mono->fun == MFUN_NONE || mono->fun == MFUN_TRUE || mono->fun == MFUN_FALSE); } int mono_get_degree(const Mono* mono) { assert(mono_is_valid(mono)); return mono->count; } const Numb* mono_get_coeff(const Mono* mono) { assert(mono_is_valid(mono)); return mono->coeff; } void mono_set_function(Mono* mono, MFun f) { assert(mono_is_valid(mono)); mono->fun = f; assert(mono_is_valid(mono)); } MFun mono_get_function(const Mono* mono) { assert(mono_is_valid(mono)); return mono->fun; } Var* mono_get_var(const Mono* mono, int idx) { const MonoElem* e = &mono->first; assert(mono_is_valid(mono)); assert(mono->count > 0); assert(idx >= 0); assert(idx <= mono->count); if (idx > 0) { for(e = e->next; --idx > 0; e = e->next) /*lint !e441 loop variable 'e' not found in 2nd expression */ assert(e != NULL); assert(e != NULL); } assert(entry_is_valid(e->entry)); return entry_get_var(e->entry); } #ifndef NDEBUG void mono_print(FILE* fp, const Mono* mono, bool print_symbol_index) { const MonoElem* e; assert(mono_is_valid(mono)); if (numb_equal(mono->coeff, numb_one())) fputc('+', fp); else { if (numb_cmp(mono->coeff, numb_zero()) >= 0) fprintf(fp, "+ %g", numb_todbl(mono->coeff)); else fprintf(fp, "- %g", -numb_todbl(mono->coeff)); } fputc(' ', fp); for(e = &mono->first; e != NULL; e = e->next) { entry_print(fp, e->entry); if (print_symbol_index) tuple_print(fp, entry_get_tuple(e->entry)); if (e->next != NULL) fprintf(fp, " * "); } } #endif /* !NDEBUG */ zimpl-3.3.6/src/zimpl/mme.h0000644001417200060250000001015413304236715015433 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mme.h */ /* Name....: Mathematical Modelling Engine */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _MME_H_ #define _MME_H_ #ifdef __cplusplus extern "C" { #endif #define ZIMPL_VERSION 336 /* the following is not in code.h because code.h needs mme.h anyway, * but we also need these declaratons. */ enum code_type { CODE_ERR = 0, CODE_NUMB, CODE_STRG, CODE_NAME, CODE_TUPLE, CODE_SET, CODE_TERM, CODE_BOOL, CODE_SIZE, CODE_IDXSET, CODE_LIST, CODE_VOID, CODE_ENTRY, CODE_VARCLASS, CODE_CONTYPE, CODE_RDEF, CODE_RPAR, CODE_BITS, CODE_SYM, CODE_DEF, CODE_BOUND }; enum symbol_type { SYM_ERR = 0, SYM_NUMB, SYM_STRG, SYM_SET, SYM_VAR }; typedef enum symbol_type SymbolType; typedef struct symbol Symbol; typedef enum code_type CodeType; typedef struct code_node CodeNode; typedef CodeNode* (*Inst)(CodeNode* self); typedef struct entry Entry; typedef struct list_element ListElem; typedef struct list List; typedef enum var_type VarType; /* From ratlptypes.h */ typedef struct mono Mono; /* From mono.h */ #define SYMBOL_NAME_INTERNAL "@@" #define VERB_QUIET 0 #define VERB_NORMAL 1 #define VERB_VERBOSE 2 #define VERB_CHATTER 3 #define VERB_DEBUG 5 /* zimpllib.c */ extern int verbose; /*lint -function(exit,zpl_exit) */ extern void zpl_exit(int retval); /* source.c */ /*lint -sem( show_source, nulterm(2), 1p == 1 && 2p) */ extern void show_source(FILE* fp, const char* text, int column); /* vinst.c */ extern void interns_init(void); extern void interns_exit(void); #define Min(a, b) (((a) <= (b)) ? (a) : (b)) #define Sgn(a) (((a) > 0) ? 1 : (((a) < 0) ? -1 : 0)) /* Directory separator, so we could redefine it for Windoof. */ #ifndef DIRSEP #define DIRSEP '/' #endif /* DIRSEP */ #ifndef NDEBUG #define SID unsigned int sid; #define SID_set(p, id) (p->sid = id) #define SID_del(p) (p->sid = 0xffffffff) #define SID_ok(p, id) (p->sid == id) #define SID_set2(p, id) (p.sid = id) #define SID_del2(p) (p.sid = 0xffffffff) #define SID_ok2(p, id) (p.sid == id) #else /* NDEBUG */ #define SID /* */ #define SID_set(p, sid) /* */ #define SID_del(p) /* */ #define SID_ok(p, id) true #define SID_set2(p, sid) /* */ #define SID_del2(p) /* */ #define SID_ok2(p, id) true #endif /* NDEBUG */ #define DISPERSE(x) (1664525U * (x) + 1013904223U) #ifdef TRACE #define Trace(fname) fprintf(stderr, "Trace: %s\n", fname); #else #define Trace(fname) /* */ #endif /* TRACE */ #if defined(__GNUC__) || defined(__CLANG__) #define UNUSED __attribute__ ((unused)) #define NORETURN __attribute__ ((noreturn)) #else #define UNUSED #define NORETURN #endif /* __GNUC__ || __CLANG__ */ #ifdef __cplusplus } #endif #endif /* _MME_H_ */ zimpl-3.3.6/src/zimpl/set4.h0000644001417200060250000002003713304236715015535 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: set4.h */ /* Name....: Set Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _SET4_H_ #define _SET4_H_ #ifdef __cplusplus extern "C" { #endif enum set_type { SET_ERROR = 0, SET_EMPTY = 1, /* dim = ?, Empty Set */ SET_PSEUDO = 2, /* dim = 0, Has only empty tuple as element */ SET_LIST = 3, /* dim = 1, Explicit enumeration of members */ SET_RANGE = 4, /* dim = 1, Range: Start to End by Increment */ SET_PROD = 5, /* dim > 1, Cross Product of two or more sets */ SET_MULTI = 6, /* dim > 1, Multidimensional Subset */ SET_UNION = 7, /* dim > 1, Union of two sets */ SET_INTER = 8, /* dim > 1, Intersection of two sets */ SET_MINUS = 9, /* dim > 1, Subtraction of two sets */ SET_SYMDIFF = 10, /* dim > 1, Symetric difference of two sets */ SET_TYPES = 11 /* marker */ }; typedef enum set_type SetType; typedef struct set_vtab SetVTab; typedef struct set_empty SetEmpty; typedef struct set_pseudo SetPseudo; typedef struct set_head SetHead; typedef struct set_list SetList; typedef struct set_range SetRange; typedef struct set_prod SetProd; typedef struct set_multi SetMulti; typedef struct set_empty_iter SetEmptyIter; typedef struct set_pseudo_iter SetPseudoIter; typedef struct set_list_iter SetListIter; typedef struct set_range_iter SetRangeIter; typedef struct set_prod_iter SetProdIter; typedef struct set_multi_iter SetMultiIter; struct set_head { int refc; int dim; SetIterIdx members; SetType type; }; struct set_empty { SetHead head; SID }; struct set_pseudo { SetHead head; SID }; struct set_list { SetHead head; /** head.dim == 1 */ int size; Elem** member; /** head.members gives the number */ Hash* hash; SID }; struct set_range { SetHead head; /** head.dim == 1 */ int begin; int end; int step; SID }; struct set_prod { SetHead head; /** head.dim > 1 */ Set* set_a; Set* set_b; SID }; /* set consists of dim list set that contain the elements of the tuples to be stored * subset is an array with consists of */ struct set_multi { SetHead head; /* head.dim > 1 */ Set** set; /* dim times, type == SET_LIST */ SetIterIdx* subset; /* members * dim */ SetIterIdx** order; /* dim * members */ SID }; union set { SetHead head; SetEmpty empty; SetPseudo pseudo; SetList list; SetRange range; SetProd prod; SetMulti multi; }; struct set_empty_iter { int dummy; SID }; struct set_pseudo_iter { bool first; SID }; struct set_list_iter { int first; int last; int now; SID }; struct set_range_iter { int first; int last; int now; SID }; struct set_prod_iter { bool first; SetIter* iter_a; SetIter* iter_b; Elem** elem; SID }; struct set_multi_iter { int dim; SetIterIdx members; SetIterIdx now; SetIterIdx* subset; SID }; union set_iter { SetEmptyIter empty; SetPseudoIter pseudo; SetListIter list; SetRangeIter range; SetProdIter prod; SetMultiIter multi; }; struct set_vtab { void (*set_free) (Set* set); Set* (*set_copy) (const Set* set); SetIterIdx (*set_lookup_idx)(const Set* set, const Tuple* tuple, int offset); void (*set_get_tuple) (const Set* set, SetIterIdx idx, Tuple* tuple, int offset); SetIter* (*iter_init) (const Set* set, const Tuple* pattern, int offset); bool (*iter_next) (SetIter* iter, const Set* set, Tuple* tuple, int offset); void (*iter_exit) (SetIter* iter, const Set* set); void (*iter_reset) (SetIter* iter, const Set* set); bool (*set_is_valid) (const Set* set); }; #define SET_DEFAULT 0x0 #define SET_NO_HASH 0x1 #ifdef NDEBUG extern SetVTab* set_vtab_global; #endif /* set4.c */ /*lint -sem( set_lookup_idx, 1p == 1 && 2p == 1 && 3n >= 0, @n >= -1) */ extern SetIterIdx set_lookup_idx(const Set* set, const Tuple* tuple, int offset); /*lint -sem( set_get_tuple_intern, 1p == 1 && 2n >= 0 && 3p == 1 && 4n >= 0) */ extern void set_get_tuple_intern(const Set* set, SetIterIdx idx, Tuple* tuple, int offset); /*lint -sem( set_iter_init_intern, 1p == 1 && 3n >= 0, @P > malloc(1P)) */ extern SetIter* set_iter_init_intern(const Set* set, const Tuple* pattern, int offset); /*lint -sem( set_iter_next_intern, 1p == 1 && 2p == 1 && 3p == 1 && 4n >= 0) */ extern bool set_iter_next_intern(SetIter* iter, const Set* set, Tuple* tuple, int offset); /*lint -sem( set_iter_exit_intern, custodial(1), 1p == 1 && 2p == 1) */ extern void set_iter_exit_intern(SetIter* iter, const Set* set); /*lint -sem( set_iter_reset_intern, 1p == 1 && 2p == 1) */ extern void set_iter_reset_intern(SetIter* iter, const Set* set); /* setempty.c */ /*lint -sem( set_empty_init, 1p == SET_TYPES) */ extern void set_empty_init(SetVTab* vtab); /* setpseudo.c */ /*lint -sem( set_pseudo_init, 1p == SET_TYPES) */ extern void set_pseudo_init(SetVTab* vtab); /* setlist.c */ /*lint -sem( set_list_init, 1p == SET_TYPES) */ extern void set_list_init(SetVTab* vtab); /*lint -sem( set_list_new, 1n > 0 && 2n >= 0, @P > malloc(1P)) */ extern Set* set_list_new(int size, int flags); /*lint -sem( set_list_add_elem, 1p == 1 && 2p == 1, @n >= -1) */ extern SetIterIdx set_list_add_elem(Set* set, const Elem* elem, SetCheckType check); /*lint -sem( set_list_new_from_elems, 1p == 1, @P > malloc(1P)) */ extern Set* set_list_new_from_elems(const List* list, SetCheckType check); /*lint -sem( set_list_new_from_tuples, 1p == 1, @P > malloc(1P)) */ extern Set* set_list_new_from_tuples(const List* list, SetCheckType check); /*lint -sem( set_list_new_from_entries, 1p == 1, @P > malloc(1P)) */ extern Set* set_list_new_from_entries(const List* list, SetCheckType check); /*lint -sem( set_list_get_elem, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Elem* set_list_get_elem(const Set* set, SetIterIdx idx); /* setrange.c */ /*lint -sem( set_range_init, 1p == SET_TYPES) */ extern void set_range_init(SetVTab* vtab); /* setprod.c */ /*lint -sem( set_prod_init, 1p == SET_TYPES) */ extern void set_prod_init(SetVTab* vtab); /* set multi.c */ /*lint -sem( set_multi_init, 1p == SET_TYPES) */ extern void set_multi_init(SetVTab* vtab); /*lint -sem( set_multi_new_from_list, 1p == 1, @P > malloc(1P)) */ extern Set* set_multi_new_from_list(const List* list, SetCheckType check); #ifdef __cplusplus } #endif #endif /* _SET4_H_ */ zimpl-3.3.6/src/zimpl/entry.c0000644001417200060250000001374513304236715016022 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: entry.c */ /* Name....: Symbol Table Entry Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/zimpllib.h" #define ENTRY_SID 0x456e7472 typedef union entry_value EntryValue; union entry_value { Numb* numb; const char* strg; Set* set; Var* var; }; struct entry { SID int refc; Tuple* tuple; SymbolType type; EntryValue value; }; Entry* entry_new_numb(const Tuple* tuple, const Numb* numb) { Entry* entry = calloc(1, sizeof(*entry)); assert(entry != NULL); assert(tuple != NULL); entry->refc = 1; entry->tuple = tuple_copy(tuple); entry->type = SYM_NUMB; entry->value.numb = numb_copy(numb); SID_set(entry, ENTRY_SID); assert(entry_is_valid(entry)); mem_check(entry); return entry; } Entry* entry_new_strg(const Tuple* tuple, const char* strg) { Entry* entry = calloc(1, sizeof(*entry)); assert(entry != NULL); assert(tuple != NULL); assert(strg != NULL); entry->refc = 1; entry->tuple = tuple_copy(tuple); entry->type = SYM_STRG; entry->value.strg = strg; SID_set(entry, ENTRY_SID); assert(entry_is_valid(entry)); return entry; } Entry* entry_new_set(const Tuple* tuple, const Set* set) { Entry* entry = calloc(1, sizeof(*entry)); assert(entry != NULL); assert(tuple != NULL); assert(set != NULL); entry->refc = 1; entry->tuple = tuple_copy(tuple); entry->type = SYM_SET; entry->value.set = set_copy(set); SID_set(entry, ENTRY_SID); assert(entry_is_valid(entry)); return entry; } Entry* entry_new_var(const Tuple* tuple, Var* var) { Entry* entry = calloc(1, sizeof(*entry)); assert(entry != NULL); assert(tuple != NULL); assert(var != NULL); entry->refc = 1; entry->tuple = tuple_copy(tuple); entry->type = SYM_VAR; entry->value.var = var; SID_set(entry, ENTRY_SID); assert(entry_is_valid(entry)); return entry; } void entry_free(Entry* entry) { assert(entry_is_valid(entry)); entry->refc--; if (entry->refc == 0) { SID_del(entry); switch(entry->type) { case SYM_NUMB : numb_free(entry->value.numb); break; case SYM_STRG : break; case SYM_SET : set_free(entry->value.set); break; case SYM_VAR : break; default : abort(); } tuple_free(entry->tuple); free(entry); } } bool entry_is_valid(const Entry* entry) { if (entry == NULL || !SID_ok(entry, ENTRY_SID)) return false; mem_check(entry); return true; } Entry* entry_copy(const Entry* source) { Entry* entry = (Entry*)source; assert(entry_is_valid(entry)); entry->refc++; return entry; } bool entry_cmp(const Entry* entry, const Tuple* tuple) { assert(entry_is_valid(entry)); assert(tuple_is_valid(tuple)); return tuple_cmp(entry->tuple, tuple); } SymbolType entry_get_type(const Entry* entry) { assert(entry_is_valid(entry)); return entry->type; } const Tuple* entry_get_tuple(const Entry* entry) { assert(entry_is_valid(entry)); assert(tuple_is_valid(entry->tuple)); return entry->tuple; } const Numb* entry_get_numb(const Entry* entry) { assert(entry_is_valid(entry)); assert(entry->type == SYM_NUMB); return entry->value.numb; } const char* entry_get_strg(const Entry* entry) { assert(entry_is_valid(entry)); assert(entry->type == SYM_STRG); return entry->value.strg; } const Set* entry_get_set(const Entry* entry) { assert(entry_is_valid(entry)); assert(entry->type == SYM_SET); return entry->value.set; } Var* entry_get_var(const Entry* entry) { assert(entry_is_valid(entry)); assert(entry->type == SYM_VAR); return entry->value.var; } void entry_print(FILE* fp, const Entry* entry) { assert(entry_is_valid(entry)); tuple_print(fp, entry->tuple); fprintf(fp, " -> "); switch(entry->type) { case SYM_NUMB : fprintf(fp, "%.16g", numb_todbl(entry->value.numb)); break; case SYM_STRG : fprintf(fp, "\"%s\"", entry->value.strg); break; case SYM_SET : set_print(fp, entry->value.set); break; case SYM_VAR : zpl_var_print(fp, entry->value.var); break; default : fprintf(fp, "Entry-ERR"); break; } } zimpl-3.3.6/src/zimpl/ratlpstore.h0000644001417200060250000001004013304236715017046 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratlpstore.h */ /* Name....: Rational Number Store Linear Programm */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _RATLPSTORE_H_ #define _RATLPSTORE_H_ #ifndef __GMP_H__ #error "Need to include gmp.h before ratlpstore.h" #endif #ifndef _RATLPTYPES_H_ #error "Need to include ratlptypes.h before ratlpstore.h" #endif #ifdef __cplusplus extern "C" { #endif typedef struct storage Sto; typedef struct lps_hash LpsHash; struct nonzero { Var* var; Con* con; Nzo* var_prev; Nzo* var_next; Nzo* con_prev; Nzo* con_next; mpq_t value; }; struct variable { unsigned int sid; char* name; int number; VarClass vclass; VarType type; bool is_used; int size; mpq_t cost; mpq_t lower; mpq_t upper; mpq_t value; mpq_t startval; int priority; Var* prev; Var* next; Nzo* first; }; #define VAR_SID 0x5e564152 struct constraint { unsigned int sid; char* name; int number; unsigned int flags; ConType type; int size; mpq_t lhs; mpq_t rhs; mpq_t scale; Var* ind_var; bool ind_dir; Con* prev; Con* next; Nzo* first; Qme* qme_first; Term* term; }; #define CON_SID 0x5e434f4e struct lpstorage { char* name; LpType type; /* ??? Wird noch nicht automatisch gesetzt */ LpDirect direct; char* probname; char* objname; char* rhsname; char* bndname; char* rngname; int vars; int cons; int soss; int nonzeros; Var* var_root; Con* con_root; Sos* sos_root; Sto* sto_root; Nzo* next; LpsHash* var_hash; LpsHash* con_hash; LpsHash* sos_hash; Var* var_last; Con* con_last; Sos* sos_last; int name_len; }; struct soselement { Var* var; mpq_t weight; Sse* next; }; struct soset { unsigned int sid; char* name; SosType type; int priority; int sses; Sos* next; Sse* first; }; #define SOS_SID 0x5e534f53 struct qmatentry { unsigned int sid; const Var* var1; const Var* var2; mpq_t value; Qme* next; }; #define QME_SID 0x514D656E /* Internal functions */ /*lint -sem( lps_getnamesize, 1p, @n > 8) */ int lps_getnamesize(const Lps* lp, LpFormat format); /*lint -sem( lps_makename, nulterm(3), 1p && 2n > 0 && 3p && 4n >= -1) */ void lps_makename(char* target, int size, const char* name, int no); #ifdef __cplusplus } #endif #endif /* _RATLPSTORE_H_ */ zimpl-3.3.6/src/zimpl/gmpmisc.c0000644001417200060250000001443613304236715016316 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratmisc.c */ /* Name....: miscellenious rational arithmetic functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/gmpmisc.h" mpq_t const_zero; mpq_t const_one; mpq_t const_minus_one; #define POOL_SIZE 10000 #define POOL_ELEM_SIZE 16 typedef union pool_elem PoolElem; typedef struct pool Pool; union pool_elem { char pad[POOL_ELEM_SIZE]; //lint !e754 union member not referenced PoolElem* next; }; struct pool { PoolElem elem[POOL_SIZE]; Pool* next; }; static Pool* pool_root = NULL; static PoolElem* pool_next = NULL; static bool gmp_with_management = false; static void* (*gmp_old_alloc) (size_t) = NULL; static void* (*gmp_old_realloc)(void*, size_t, size_t) = NULL; static void (*gmp_old_free) (void*, size_t) = NULL; static void* pool_alloc(void) { Pool* pool; PoolElem* elem; if (pool_next == NULL) { int i; pool = malloc(sizeof(*pool)); pool->next = pool_root; pool_root = pool; for(i = 0; i < POOL_SIZE - 1; i++) pool->elem[i].next = &pool->elem[i + 1]; pool->elem[i].next = NULL; pool_next = &pool->elem[0]; } assert(pool_next != NULL); elem = pool_next; pool_next = elem->next; return elem; } static void pool_free(void* pv) { PoolElem* elem = pv; elem->next = pool_next; pool_next = elem; } static void pool_exit(void) { Pool* p; Pool* q; for(p = pool_root; p != NULL; p = q) { q = p->next; free(p); } pool_root = NULL; pool_next = NULL; } /* [+|-]?[0-9]*.[0-9]+[[e|E][+|-][0-9]+]? */ /* if it does not fit here, it doesn't fit in a double either */ void gmp_str2mpq(mpq_t value, const char* num) { char tmp[1024]; int i; int k = 0; int exponent = 0; int fraction = 0; assert(num != NULL); assert(strlen(num) < 32); /* printf("%s ", num); */ /* Skip initial whitespace */ while(isspace(*num)) num++; /* Skip initial +/- */ if (*num == '+') num++; else if (*num == '-') tmp[k++] = *num++; for(i = 0; num[i] != '\0'; i++) { if (isdigit(num[i])) { tmp[k++] = num[i]; exponent -= fraction; } else if (num[i] == '.') fraction = 1; else if (tolower(num[i]) == 'e') { exponent += atoi(&num[i + 1]); break; } } while(exponent > 0) { tmp[k++] = '0'; exponent--; } tmp[k++] = '/'; tmp[k++] = '1'; while(exponent < 0) { tmp[k++] = '0'; exponent++; } tmp[k] = '\0'; /* printf("%s\n", tmp);*/ (void)mpq_set_str(value, tmp, 10); mpq_canonicalize(value); } void gmp_print_mpq(FILE* fp, const mpq_t qval) { mpf_t fval; mpf_init(fval); mpf_set_q(fval, qval); (void)mpf_out_str(fp, 10, 32, fval); fprintf(fp, " = "); (void)mpq_out_str(fp, 10, qval); fputc('\n', fp); mpf_clear(fval); } /*ARGSUSED*/ static void* gmp_alloc(size_t size) { if (size <= POOL_ELEM_SIZE) return pool_alloc(); return malloc(size); } /*ARGSUSED*/ static void* gmp_realloc(void* ptr, size_t old_size, size_t new_size) { void* p; if (old_size <= POOL_ELEM_SIZE && new_size <= POOL_ELEM_SIZE) return ptr; if (old_size <= POOL_ELEM_SIZE) { assert(new_size > POOL_ELEM_SIZE); assert(new_size > old_size); p = malloc(new_size); memcpy(p, ptr, old_size); pool_free(ptr); return p; } if (new_size <= POOL_ELEM_SIZE) { assert(old_size > POOL_ELEM_SIZE); assert(old_size > new_size); p = pool_alloc(); memcpy(p, ptr, new_size); free(ptr); return p; } return realloc(ptr, new_size); } /*ARGSUSED*/ static void gmp_free(void* ptr, size_t size) { if (size <= POOL_ELEM_SIZE) pool_free(ptr); else free(ptr); } void gmp_init(bool verbose, bool with_management) { if (with_management) { gmp_with_management = true; mp_get_memory_functions(&gmp_old_alloc, &gmp_old_realloc, &gmp_old_free); mp_set_memory_functions(gmp_alloc, gmp_realloc, gmp_free); } mpq_init(const_zero); mpq_init(const_one); mpq_init(const_minus_one); mpq_set_ui(const_one, 1, 1); /* = 1 */ mpq_set_si(const_minus_one, -1, 1); /* = -1 */ if (verbose) printf("Using GMP Version %s %s\n", gmp_version, with_management ? "[memory management redirected]" : "[memory management unchanged]"); } void gmp_exit() { mpq_clear(const_zero); mpq_clear(const_one); mpq_clear(const_minus_one); pool_exit(); if (gmp_with_management) { mp_set_memory_functions(gmp_old_alloc, gmp_old_realloc, gmp_old_free); gmp_with_management = false; } } zimpl-3.3.6/src/zimpl/idxset.c0000644001417200060250000000713613304236715016156 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: idxset.c */ /* Name....: IndexSet Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/idxset.h" #define IDXSET_SID 0x49647853 struct index_set { SID Tuple* tuple; Set* set; CodeNode* lexpr; bool is_unrestricted; }; IdxSet* idxset_new( const Tuple* tuple, const Set* set, CodeNode* lexpr, bool is_unrestricted) { IdxSet* idxset = calloc(1, sizeof(*idxset)); assert(tuple_is_valid(tuple)); assert(set_is_valid(set)); assert(lexpr != NULL); assert(idxset != NULL); idxset->tuple = tuple_copy(tuple); idxset->set = set_copy(set); idxset->lexpr = lexpr; idxset->is_unrestricted = is_unrestricted; SID_set(idxset, IDXSET_SID); assert(idxset_is_valid(idxset)); return idxset; } void idxset_free(IdxSet* idxset) { assert(idxset_is_valid(idxset)); SID_del(idxset); tuple_free(idxset->tuple); set_free(idxset->set); free(idxset); } bool idxset_is_valid(const IdxSet* idxset) { return ((idxset != NULL) && SID_ok(idxset, IDXSET_SID)); } IdxSet* idxset_copy(const IdxSet* source) { assert(idxset_is_valid(source)); return idxset_new(source->tuple, source->set, source->lexpr, source->is_unrestricted); } CodeNode* idxset_get_lexpr(const IdxSet* idxset) { assert(idxset_is_valid(idxset)); return idxset->lexpr; } const Tuple* idxset_get_tuple(const IdxSet* idxset) { assert(idxset_is_valid(idxset)); return idxset->tuple; } const Set* idxset_get_set(const IdxSet* idxset) { assert(idxset_is_valid(idxset)); return idxset->set; } bool idxset_is_unrestricted(const IdxSet* idxset) { assert(idxset_is_valid(idxset)); return idxset->is_unrestricted; } void idxset_print(FILE* fp, const IdxSet* idxset) { assert(idxset_is_valid(idxset)); fprintf(fp, "IdxSet\n"); fprintf(fp, "Tuple: "); tuple_print(fp, idxset->tuple); fputc('\n', fp); set_print(fp, idxset->set); fprintf(fp, "\nAddr-Lexpr: %p\n", (void*)idxset->lexpr); } zimpl-3.3.6/src/zimpl/metaio.h0000644001417200060250000000503613304236715016136 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: metaio.h */ /* Name....: Meta Input/Output */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2006-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _METAIO_H_ #define _METAIO_H_ #ifdef __cplusplus extern "C" { #endif typedef struct meta_file_ptr MFP; /* metaio.c */ /*lint -sem( mio_add_strg_file, nulterm(1), nulterm(2), 1p && 2p) */ extern void mio_add_strg_file(const char* name, const char* content, bool use_copy); extern void mio_init(void); extern void mio_exit(void); /*lint -sem( mio_open, nulterm(2), 2p) */ /*lint -function( fopen(1), mio_open(1)) */ /*lint -function( fopen(r), mio_open(r)) */ extern MFP* mio_open(const char* name, const char* ext); /*lint -function( fclose, mio_close) */ extern void mio_close(MFP* mfp); /*lint -function( fgetc, mio_getc) */ extern int mio_getc(const MFP* mfp); /*lint -function( fgets(1), mio_gets(2)) */ /*lint -function( fgets(2), mio_gets(3)) */ /*lint -function( fgets(3), mio_gets(1)) */ /*lint -function( fgets(r), mio_gets(r)) */ extern char* mio_gets(const MFP* mfp, char* buf, int len); /*lint -sem( mio_get_line, 1p) */ extern char* mio_get_line(const MFP* mfp); #ifdef __cplusplus } #endif #endif /* _METAIO_H_ */ zimpl-3.3.6/src/zimpl/ratmpswrite.c0000644001417200060250000002307513304236715017237 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mpswrite.c */ /* Name....: MPS File Write */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" static void write_data( FILE* fp, bool use_field5, const int indicator1, const int indicator2, const char* name1, const char* name2, const mpq_t value) { assert(name1 != NULL); assert(name2 != NULL); if (use_field5) { /* Field: 1 2 3 4 5 6 * Columns: 2-3 5-12 15-22 25-36 40-47 50-61 * 1 2 3 4 5 6 * 1234567890123456789012345678901234567890123456789012345678901234567890 * -AB-NNNNNNNN--NNNNNNNN--FFFFFFFFFFFF * x$SE@5b2 c1_718 45.786 */ fprintf(fp, " %c%c %-8.8s %-8.8s %12g\n", toupper(indicator1), toupper(indicator2), name1, name2, mpq_get_d(value)); } else { fprintf(fp, " %c%c %-8.8s %-8.8s\n", toupper(indicator1), toupper(indicator2), name1, name2); } } static void write_vars( const Lps* lp, FILE* fp, VarClass varclass, int name_size) { static bool first = true; const Var* var; const Nzo* nzo; char* vtmp; char* ctmp; mpq_t temp; assert(lp != NULL); assert(fp != NULL); vtmp = malloc((size_t)name_size); ctmp = malloc((size_t)name_size); assert(vtmp != NULL); assert(ctmp != NULL); mpq_init(temp); for(var = lp->var_root; var != NULL; var = var->next) { if (var->vclass != varclass) continue; /* Only variables with a cost not equal zero, need to be included * in the objective function */ if (!mpq_equal(var->cost, const_zero)) { lps_makename(vtmp, name_size, var->name, var->number); if (lp->direct == LP_MIN) mpq_set(temp, var->cost); else { mpq_neg(temp, var->cost); if (first) { if (verbose > 0) { fprintf(stderr, "%s\n%s\n", "--- Warning: Objective function inverted to make", " minimization problem for MPS output\n"); } first = false; } } write_data(fp, true, ' ', ' ', vtmp, "OBJECTIV", temp); } for(nzo = var->first; nzo != NULL; nzo = nzo->var_next) { assert(nzo->var == var); assert(!mpq_equal(nzo->value, const_zero)); lps_makename(vtmp, name_size, var->name, var->number); lps_makename(ctmp, name_size, nzo->con->name, nzo->con->number); write_data(fp, true, ' ', ' ', vtmp, ctmp, nzo->value); } } mpq_clear(temp); free(vtmp); free(ctmp); } void mps_write( const Lps* lp, FILE* fp, const char* text) { const Var* var; const Con* con; int indicator; bool has_ranges = false; int name_size; char* vtmp; char* ctmp; mpq_t temp; assert(lp != NULL); assert(fp != NULL); name_size = lps_getnamesize(lp, LP_FORM_MPS); vtmp = malloc((size_t)name_size); ctmp = malloc((size_t)name_size); assert(vtmp != NULL); assert(ctmp != NULL); mpq_init(temp); if (text != NULL) fprintf(fp, "%s", text); fprintf(fp, "NAME %8.8s\n", lp->name); fprintf(fp, "ROWS\n"); write_data(fp, false, 'N', ' ', "OBJECTIV", "", const_zero); for(con = lp->con_root; con != NULL; con = con->next) { if (con->size > 0) { lps_makename(ctmp, name_size, con->name, con->number); switch(lps_contype(con)) { case CON_EQUAL: indicator = 'E'; break; case CON_LHS: indicator = 'G'; break; case CON_RHS: indicator = 'L'; break; case CON_RANGE: indicator = 'E'; has_ranges = true; break; default : abort(); } write_data(fp, false, indicator, ' ', ctmp, "", const_zero); } } fprintf(fp, "COLUMNS\n"); /* First integer/binary variables */ #if 0 /* ??? Would be nice if known in advance */ if (lp->type != LP_LP) #endif { fprintf(fp, " MARK0000 'MARKER' 'INTORG'\n"); write_vars(lp, fp, VAR_INT, name_size); fprintf(fp, " MARK0001 'MARKER' 'INTEND'\n"); } write_vars(lp, fp, VAR_CON, name_size); write_vars(lp, fp, VAR_IMP, name_size); fprintf(fp, "RHS\n"); for(con = lp->con_root; con != NULL; con = con->next) { lps_makename(ctmp, name_size, con->name, con->number); switch(lps_contype(con)) { case CON_EQUAL: if (!mpq_equal(con->rhs, const_zero)) write_data(fp, true, ' ', ' ', "RHS", ctmp, con->rhs); break; case CON_LHS: if (!mpq_equal(con->lhs, const_zero)) write_data(fp, true, ' ', ' ', "RHS", ctmp, con->lhs); break; case CON_RHS: if (!mpq_equal(con->rhs, const_zero)) write_data(fp, true, ' ', ' ', "RHS", ctmp, con->rhs); break; case CON_RANGE: if (!mpq_equal(con->lhs, const_zero)) write_data(fp, true, ' ', ' ', "RHS", ctmp, con->lhs); break; default : abort(); } } if (has_ranges) { fprintf(fp, "RANGES\n"); for(con = lp->con_root; con != NULL; con = con->next) { if (lps_contype(con) == CON_RANGE) { lps_makename(ctmp, name_size, con->name, con->number); /* lhs > rhs => temp is positive * range is lhs <= x <= lhs + temp = rhs */ mpq_sub(temp, con->rhs, con->lhs); assert(!mpq_equal(temp, const_zero)); write_data(fp, true, ' ', ' ', "RNG", ctmp, temp); } } } fprintf(fp, "BOUNDS\n"); /* Variables with size == 0, have to be included because * they might contain bounds. Detailed checking should * be done in a preprocessing routine. */ for(var = lp->var_root; var != NULL; var = var->next) { /* A variable without any entries in the matrix * or the objective function can be ignored. * If we have SOS we do not know and include it. */ if (var->size == 0 && mpq_equal(var->cost, const_zero) && !lps_has_sos(lp)) continue; /* 0, oo -> nix * l, oo -> LO * 0, u -> UP * l = u -> FX * -oo -> MI * oo -> PL */ lps_makename(vtmp, name_size, var->name, var->number); if (var->type == VAR_FIXED) write_data(fp, true, 'F', 'X', "BOUND", vtmp, var->lower); else { if (var->type == VAR_LOWER || var->type == VAR_BOXED) write_data(fp, true, 'L', 'O', "BOUND", vtmp, var->lower); else write_data(fp, false, 'M', 'I', "BOUND", vtmp, const_zero); if (var->type == VAR_UPPER || var->type == VAR_BOXED) write_data(fp, true, 'U', 'P', "BOUND", vtmp, var->upper); else write_data(fp, false, 'P', 'L', "BOUND", vtmp, const_zero); } } if (lps_has_sos(lp)) { const Sos* sos; const Sse* sse; fprintf(fp, "SOS\n"); for(sos = lp->sos_root; sos != NULL; sos = sos->next) { write_data(fp, false, 'S', sos->type == SOS_TYPE1 ? '1' : '2', sos->name, "", const_zero); for (sse = sos->first; sse != NULL; sse = sse->next) { lps_makename(vtmp, name_size, sse->var->name, sse->var->number); write_data(fp, true, ' ', ' ', "", vtmp, sse->weight); } } } fprintf(fp, "ENDATA\n"); mpq_clear(temp); free(vtmp); free(ctmp); } zimpl-3.3.6/src/zimpl/inst.c0000644001417200060250000031611413304236715015632 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: inst.c */ /* Name....: Instructions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include /* #define TRACE 1 */ #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/define.h" #include "zimpl/bound.h" #include "zimpl/idxset.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/rdefpar.h" #include "zimpl/conname.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/list.h" #include "zimpl/entry.h" #include "zimpl/heap.h" #include "zimpl/code.h" #include "zimpl/inst.h" #include "zimpl/prog.h" #include "zimpl/xlpglue.h" #include "zimpl/strstore.h" static int checked_eval_numb_toint(const CodeNode* self, int no, const char* errmsg) { const Numb* numb; assert(self != NULL); assert(no >= 0); assert(errmsg != NULL); numb = code_eval_child_numb(self, no); if (!numb_is_int(numb)) { fprintf(stderr, "*** Error %s ", errmsg); numb_print(stderr, numb); fprintf(stderr, " is too big or not an integer\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } return numb_toint(numb); } /* ---------------------------------------------------------------------------- * Kontrollfluss Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_nop(CodeNode* self) { Trace("i_nop"); assert(code_is_valid(self)); if (code_get_type(self) == CODE_ERR) code_value_void(self); return self; } CodeNode* i_subto(CodeNode* self) { const char* name; Trace("i_subto"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); if (!conname_set(name)) { fprintf(stderr, "*** Error 105: Duplicate constraint name \"%s\"\n", name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } (void)code_eval_child(self, 1); /* constraint */ conname_free(); code_value_void(self); return self; } CodeNode* i_constraint_list(CodeNode* self) { Trace("i_constraint_list"); assert(code_is_valid(self)); (void)code_eval_child(self, 0); /* constraint */ (void)code_eval_child(self, 1); /* constraint */ code_value_void(self); return self; } CodeNode* i_constraint(CodeNode* self) { Term* term; const Term* term_lhs; const Term* term_rhs; ConType type; Numb* rhs; unsigned int flags; Trace("i_constraint"); assert(code_is_valid(self)); term_lhs = code_eval_child_term(self, 0); type = code_eval_child_contype(self, 1); term_rhs = code_eval_child_term(self, 2); flags = code_eval_child_bits(self, 3); rhs = numb_new_sub(term_get_constant(term_rhs), term_get_constant(term_lhs)); term = term_sub_term(term_lhs, term_rhs); /* Check if trival infeasible */ if (term_get_elements(term) == 0) { /* If zero, trival ok, otherwise ... */ int res = numb_cmp(rhs, numb_zero()); assert(type != CON_RANGE); assert(type != CON_FREE); if ( (type == CON_EQUAL && res != 0) || (type == CON_LHS && res > 0) || (type == CON_RHS && res < 0)) { fprintf(stderr, "*** Error 106: Empty LHS, constraint trivially violated\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } else { term_add_constant(term, rhs); if (xlp_addcon_term(prog_get_lp(), conname_get(), type, rhs, rhs, flags, term)) code_errmsg(self); conname_next(); } code_value_void(self); numb_free(rhs); term_free(term); return self; } CodeNode* i_rangeconst(CodeNode* self) { Term* term; Numb* lhs; Numb* rhs; unsigned int flags; Trace("i_rangeconst"); assert(code_is_valid(self)); /* It has to be either l <= x <= u, or u >= x >= l */ if (code_eval_child_contype(self, 3) != code_eval_child_contype(self, 4)) { fprintf(stderr, "*** Error 107: Range must be l <= x <= u, or u >= x >= l\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } lhs = numb_copy(code_eval_child_numb(self, 0)); term = term_copy(code_eval_child_term(self, 1)); rhs = numb_copy(code_eval_child_numb(self, 2)); flags = code_eval_child_bits(self, 5); numb_sub(lhs, term_get_constant(term)); numb_sub(rhs, term_get_constant(term)); /* Check if trival infeasible */ if (term_get_elements(term) == 0) { /* If zero, trival ok, otherwise ... */ if (numb_cmp(lhs, numb_zero()) > 0 || numb_cmp(rhs, numb_zero()) < 0) { fprintf(stderr, "*** Error 108: Empty Term with nonempty LHS/RHS, constraint trivially violated\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } else { if (numb_cmp(lhs, rhs) > 0) { fprintf(stderr, "*** Error 109: LHS/RHS contradiction, constraint trivially violated\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } term_sub_constant(term, term_get_constant(term)); if (xlp_addcon_term(prog_get_lp(), conname_get(), CON_RANGE, lhs, rhs, flags, term)) code_errmsg(self); conname_next(); } code_value_void(self); numb_free(rhs); numb_free(lhs); term_free(term); return self; } CodeNode* i_sos(CodeNode* self) { const char* name; Trace("i_sos"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); if (!conname_set(name)) { fprintf(stderr, "*** Error 105: Duplicate constraint name \"%s\"\n", name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } (void)code_eval_child(self, 1); /* soset */ conname_free(); code_value_void(self); return self; } CodeNode* i_soset(CodeNode* self) { const Term* term; const Numb* typenumb; const Numb* priority; SosType type; int ret; Trace("i_constraint"); assert(code_is_valid(self)); term = code_eval_child_term(self, 0); typenumb = code_eval_child_numb(self, 1); priority = code_eval_child_numb(self, 2); if (!numb_equal(term_get_constant(term), numb_zero())) { fprintf(stderr, "*** Error 199: Constants are not allowed in SOS declarations\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (numb_equal(typenumb, numb_one())) type = SOS_TYPE1; else type = SOS_TYPE2; ret = xlp_addsos_term(prog_get_lp(), conname_get(), type, priority, term); if ((ret & 1) && stmt_trigger_warning(200)) { fprintf(stderr, "--- Warning 200: Weights are not unique for SOS %s\n", conname_get()); code_errmsg(self); } if ((ret & 2) && stmt_trigger_warning(302)) { fprintf(stderr, "--- Warning 302: Priority has to be integral for SOS %s\n", conname_get()); code_errmsg(self); } conname_next(); code_value_void(self); return self; } static bool has_pattern_name( const Tuple* pattern) { int dim = tuple_get_dim(pattern); int i; for(i = 0; i < dim; i++) if (ELEM_NAME == elem_get_type(tuple_get_elem(pattern, i))) break; return i < dim; } static void warn_if_pattern_has_no_name( const CodeNode* self, const Tuple* pattern) { if (tuple_get_dim(pattern) > 0 && !has_pattern_name(pattern)) { if (stmt_trigger_warning(203)) { fprintf(stderr, "--- Warning 203: Indexing tuple is fixed\n"); code_errmsg(self); } } } CodeNode* i_forall(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; Trace("i_forall"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) (void)code_eval_child(self, 1); /* z.B. constraint */ local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_void(self); return self; } /* ---------------------------------------------------------------------------- * Arithmetische Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_expr_add(CodeNode* self) { CodeNode* child; Trace("i_expr_add"); assert(code_is_valid(self)); child = code_eval_child(self, 0); if (code_get_type(child) == CODE_NUMB) code_value_numb(self, numb_new_add(code_get_numb(child), code_eval_child_numb(self, 1))); else { const char* s1 = code_get_strg(child); const char* s2 = code_eval_child_strg(self, 1); char* t = malloc(strlen(s1) + strlen(s2) + 1); assert(t != NULL); strcpy(t, s1); strcat(t, s2); code_value_strg(self, str_new(t)); free(t); } return self; } CodeNode* i_expr_sub(CodeNode* self) { Trace("i_expr_sub"); assert(code_is_valid(self)); code_value_numb(self, numb_new_sub(code_eval_child_numb(self, 0), code_eval_child_numb(self, 1))); return self; } CodeNode* i_expr_mul(CodeNode* self) { Trace("i_expr_mul"); assert(code_is_valid(self)); code_value_numb(self, numb_new_mul(code_eval_child_numb(self, 0), code_eval_child_numb(self, 1))); return self; } CodeNode* i_expr_div(CodeNode* self) { const Numb* divisor; Trace("i_expr_div"); assert(code_is_valid(self)); divisor = code_eval_child_numb(self, 1); if (numb_equal(divisor, numb_zero())) { fprintf(stderr, "*** Error 110: Division by zero\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb_new_div(code_eval_child_numb(self, 0), divisor)); return self; } CodeNode* i_expr_mod(CodeNode* self) { const Numb* divisor; Trace("i_expr_mod"); assert(code_is_valid(self)); divisor = code_eval_child_numb(self, 1); if (numb_equal(divisor, numb_zero())) { fprintf(stderr, "*** Error 111: Modulo by zero\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb_new_mod(code_eval_child_numb(self, 0), divisor)); return self; } CodeNode* i_expr_intdiv(CodeNode* self) { const Numb* divisor; Trace("i_expr_intdiv"); assert(code_is_valid(self)); divisor = code_eval_child_numb(self, 1); if (numb_equal(divisor, numb_zero())) { fprintf(stderr, "*** Error 110: Division by zero\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb_new_intdiv( code_eval_child_numb(self, 0), divisor)); return self; } CodeNode* i_expr_pow(CodeNode* self) { int ex; Trace("i_expr_pow"); assert(code_is_valid(self)); ex = checked_eval_numb_toint(self, 1, "112: Exponent value"); code_value_numb(self, numb_new_pow(code_eval_child_numb(self, 0), ex)); return self; } CodeNode* i_expr_neg(CodeNode* self) { Numb* numb; Trace("i_expr_neg"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_neg(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_abs(CodeNode* self) { Numb* numb; Trace("i_expr_abs"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_abs(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_sgn(CodeNode* self) { Numb* numb; Trace("i_expr_sgn"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_sgn(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_floor(CodeNode* self) { Numb* numb; Trace("i_expr_floor"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_floor(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_ceil(CodeNode* self) { Numb* numb; Trace("i_expr_ceil"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_ceil(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_log(CodeNode* self) { Numb* numb; Trace("i_expr_log"); assert(code_is_valid(self)); numb = numb_new_log(code_eval_child_numb(self, 0)); if (numb == NULL) { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_ln(CodeNode* self) { Numb* numb; Trace("i_expr_ln"); assert(code_is_valid(self)); numb = numb_new_ln(code_eval_child_numb(self, 0)); if (numb == NULL) { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_sqrt(CodeNode* self) { Numb* numb; Trace("i_expr_sqrt"); assert(code_is_valid(self)); numb = numb_new_sqrt(code_eval_child_numb(self, 0)); if (numb == NULL) { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_exp(CodeNode* self) { Trace("i_expr_exp"); assert(code_is_valid(self)); code_value_numb(self, numb_new_exp(code_eval_child_numb(self, 0))); return self; } CodeNode* i_expr_sin(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_sin"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_cos(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_cos"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_tan(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_tan"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_asin(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_asin"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_acos(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_acos"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_atan(CodeNode* self) { Numb* numb = NULL; Trace("i_expr_atan"); assert(code_is_valid(self)); fprintf(stderr, "Not implemented yet\n"); /* ??? numb = numb_new_log(code_eval_child_numb(self, 0)); */ if (numb == NULL) //lint !e774 conditionalways true { code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb); return self; } CodeNode* i_expr_fac(CodeNode* self) { int n; Trace("i_expr_fac"); assert(code_is_valid(self)); n = checked_eval_numb_toint(self, 0, "113: Factorial value"); if (n < 0) { fprintf(stderr, "*** Error 114: Negative factorial value\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (n > 1000) { fprintf(stderr, "*** Error 115: Timeout!\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb_new_fac(n)); return self; } CodeNode* i_expr_card(CodeNode* self) { const Set* set; Trace("i_card"); assert(code_is_valid(self)); set = code_eval_child_set(self, 0); code_value_numb(self, numb_new_integer(set_get_members(set))); return self; } CodeNode* i_expr_rand(CodeNode* self) { const Numb* mini; const Numb* maxi; Trace("i_rand"); assert(code_is_valid(self)); mini = code_eval_child_numb(self, 0); maxi = code_eval_child_numb(self, 1); if (numb_cmp(mini, maxi) >= 0) { fprintf(stderr, "*** Error 204: Randomfunction parameter minimum= "); numb_print(stderr, mini); fprintf(stderr, " >= maximum= "); numb_print(stderr, maxi); fprintf(stderr, "\n"); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); } code_value_numb(self, numb_new_rand(mini, maxi)); return self; } CodeNode* i_expr_round(CodeNode* self) { Numb* numb; Trace("i_expr_round"); assert(code_is_valid(self)); numb = numb_copy(code_eval_child_numb(self, 0)); numb_round(numb); code_value_numb(self, numb); return self; } CodeNode* i_expr_if_else(CodeNode* self) { Trace("i_if"); assert(code_is_valid(self)); if (code_eval_child_bool(self, 0)) code_copy_value(self, code_eval_child(self, 1)); else code_copy_value(self, code_eval_child(self, 2)); return self; } CodeNode* i_expr_min(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; const Numb* value; Numb* min = numb_new(); bool first = true; Trace("i_expr_min"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { value = code_eval_child_numb(self, 1); if (first || numb_cmp(value, min) < 0) { numb_set(min, value); first = false; } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); if (first) { if (stmt_trigger_warning(186)) { fprintf(stderr, "--- Warning 186: Minimizing over empty set -- zero assumed\n"); code_errmsg(code_get_child(self, 0)); } } code_value_numb(self, min); return self; } CodeNode* i_expr_sglmin(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; CodeNode* lexpr; SetIter* iter; Numb* min = numb_new(); bool first = true; Trace("i_expr_sglmin"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); if (set_get_dim(set) != 1) { fprintf(stderr, "*** Error 209: MIN of set with more than one dimension\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (set_get_members(set) > 0) { Tuple* tuple = set_get_tuple(set, 0); if (elem_get_type(tuple_get_elem(tuple, 0)) != ELEM_NUMB) { fprintf(stderr, "*** Error 211: MIN of set containing non number elements\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple_free(tuple); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { const Numb* value = elem_get_numb(tuple_get_elem(tuple, 0)); if (first || numb_cmp(value, min) < 0) { numb_set(min, value); first = false; } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); } if (first) { if (stmt_trigger_warning(186)) { fprintf(stderr, "--- Warning 186: Minimizing over empty set -- zero assumed\n"); code_errmsg(code_get_child(self, 0)); } } code_value_numb(self, min); return self; } CodeNode* i_expr_max(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; const Numb* value; Numb* max = numb_new(); bool first = true; Trace("i_expr_max"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { value = code_eval_child_numb(self, 1); if (first || numb_cmp(value, max) > 0) { numb_set(max, value); first = false; } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); if (first) { if (stmt_trigger_warning(187)) { fprintf(stderr, "--- Warning 187: Maximizing over empty set -- zero assumed\n"); code_errmsg(code_get_child(self, 0)); } } code_value_numb(self, max); return self; } CodeNode* i_expr_sglmax(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; CodeNode* lexpr; SetIter* iter; Numb* max = numb_new(); bool first = true; Trace("i_expr_max"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); if (set_get_dim(set) != 1) { fprintf(stderr, "*** Error 210: MAX of set with more than one dimension\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (set_get_members(set) > 0) { Tuple* tuple = set_get_tuple(set, 0); if (elem_get_type(tuple_get_elem(tuple, 0)) != ELEM_NUMB) { fprintf(stderr, "*** Error 212: MAX of set containing non number elements\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple_free(tuple); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { const Numb* value = elem_get_numb(tuple_get_elem(tuple, 0)); if (first || numb_cmp(value, max) > 0) { numb_set(max, value); first = false; } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); } if (first) { if (stmt_trigger_warning(187)) { fprintf(stderr, "--- Warning 187: Maximizing over empty set -- zero assumed\n"); code_errmsg(code_get_child(self, 0)); } } code_value_numb(self, max); return self; } CodeNode* i_expr_sum(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; Numb* sum = numb_new(); Trace("i_expr_sum"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) numb_add(sum, code_eval_child_numb(self, 1)); local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_numb(self, sum); return self; } CodeNode* i_expr_prod(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; Numb* prod = numb_new_integer(1); Trace("i_expr_prod"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) numb_mul(prod, code_eval_child_numb(self, 1)); local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_numb(self, prod); return self; } CodeNode* i_expr_min2(CodeNode* self) { const List* list; Numb* min; ListElem* le = NULL; int n; bool first = true; Trace("i_expr_min2"); assert(code_is_valid(self)); list = code_eval_child_list(self, 0); n = list_get_elems(list); min = numb_new(); assert(n > 0); while(n-- > 0) { const Elem* elem = list_get_elem(list, &le); const Numb* numb; /* Are there only number in the selection tuple ? */ if (ELEM_NUMB != elem_get_type(elem)) { fprintf(stderr, "*** Error 116: Illegal value type in min: "); elem_print(stderr, elem, true); fprintf(stderr, " only numbers are possible\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = elem_get_numb(elem); if (first || numb_cmp(min, numb) > 0) { numb_set(min, numb); first = false; } } code_value_numb(self, min); return self; } CodeNode* i_expr_max2(CodeNode* self) { const List* list; Numb* max; ListElem* le = NULL; int n; bool first = true; Trace("i_expr_max2"); assert(code_is_valid(self)); list = code_eval_child_list(self, 0); n = list_get_elems(list); max = numb_new(); assert(n > 0); while(n-- > 0) { const Numb* numb; const Elem* elem = list_get_elem(list, &le); /* Are there only number in the selection tuple ? */ if (ELEM_NUMB != elem_get_type(elem)) { fprintf(stderr, "*** Error 117: Illegal value type in max: "); elem_print(stderr, elem, true); fprintf(stderr, " only numbers are possible\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = elem_get_numb(elem); if (first || numb_cmp(max, numb) < 0) { numb_set(max, numb); first = false; } } code_value_numb(self, max); return self; } CodeNode* i_expr_ord(CodeNode* self) { const Set* set; const Elem* elem; Tuple* tuple; int tno; int cno; Trace("i_expr_ord"); assert(code_is_valid(self)); set = code_eval_child_set(self, 0); tno = checked_eval_numb_toint(self, 1, "189: Tuple number"); cno = checked_eval_numb_toint(self, 2, "190: Component number"); if (tno < 1 || tno > set_get_members(set)) { fprintf(stderr, "*** Error 191: Tuple number %d", tno); fprintf(stderr, " is not a valid value between 1..%d\n", set_get_members(set)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (cno < 1 || cno > set_get_dim(set)) { fprintf(stderr, "*** Error 192: Component number %d", cno); fprintf(stderr, " is not a valid value between 1..%d\n", set_get_dim(set)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple = set_get_tuple(set, tno - 1); elem = tuple_get_elem(tuple, cno - 1); switch(elem_get_type(elem)) { case ELEM_NUMB : code_value_numb(self, numb_copy(elem_get_numb(elem))); break; case ELEM_STRG : code_value_strg(self, elem_get_strg(elem)); break; default : abort(); } tuple_free(tuple); return self; } CodeNode* i_expr_length(CodeNode* self) { Trace("i_expr_length"); assert(code_is_valid(self)); code_value_numb(self, numb_new_integer((int)strlen(code_eval_child_strg(self, 0)))); return self; } CodeNode* i_expr_substr(CodeNode* self) { const char* strg; int beg; int len; int maxlen; char* tmp; Trace("i_expr_substr"); assert(code_is_valid(self)); strg = code_eval_child_strg(self, 0); beg = checked_eval_numb_toint(self, 1, "217: Begin value"); len = checked_eval_numb_toint(self, 2, "218: Length value"); if (len < 0) { fprintf(stderr, "*** Error 219: Length value %d in substr is negative\n", len); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tmp = malloc((size_t)len + 1); if (beg < 0) { beg = (int)strlen(strg) + beg; if (beg < 0) beg = 0; } assert(beg >= 0); maxlen = (int)strlen(strg) - beg; if (maxlen < len) len = maxlen; if (len < 0) len = 0; else strncpy(tmp, &strg[beg], (size_t)len); tmp[len] = '\0'; code_value_strg(self, str_new(tmp)); free(tmp); return self; } /* ---------------------------------------------------------------------------- * Logische Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_bool_true(CodeNode* self) { Trace("i_bool_true"); assert(code_is_valid(self)); code_value_bool(self, true); return self; } CodeNode* i_bool_false(CodeNode* self) { Trace("i_bool_false"); assert(code_is_valid(self)); code_value_bool(self, false); return self; } CodeNode* i_bool_not(CodeNode* self) { Trace("i_bool_not"); assert(code_is_valid(self)); code_value_bool(self, !code_eval_child_bool(self, 0)); return self; } CodeNode* i_bool_and(CodeNode* self) { Trace("i_bool_and"); assert(code_is_valid(self)); code_value_bool(self, code_eval_child_bool(self, 0) && code_eval_child_bool(self, 1)); return self; } CodeNode* i_bool_or(CodeNode* self) { Trace("i_bool_or"); assert(code_is_valid(self)); code_value_bool(self, code_eval_child_bool(self, 0) || code_eval_child_bool(self, 1)); return self; } CodeNode* i_bool_xor(CodeNode* self) { bool a; bool b; Trace("i_bool_or"); assert(code_is_valid(self)); a = code_eval_child_bool(self, 0); b = code_eval_child_bool(self, 1); code_value_bool(self, (a && !b) || (b && !a)); return self; } CodeNode* i_bool_eq(CodeNode* self) { CodeNode* op1; CodeNode* op2; CodeType tp1; CodeType tp2; bool result; Trace("i_bool_eq"); assert(code_is_valid(self)); op1 = code_eval_child(self, 0); op2 = code_eval_child(self, 1); tp1 = code_get_type(op1); tp2 = code_get_type(op2); if (tp1 != tp2) { fprintf(stderr, "*** Error 118: Comparison of different types\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(tp1 == tp2); switch(tp1) { case CODE_NUMB : result = numb_equal(code_get_numb(op1), code_get_numb(op2)); break; case CODE_STRG : result = strcmp(code_get_strg(op1), code_get_strg(op2)) == 0; break; case CODE_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(op1)); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); default : abort(); } code_value_bool(self, result); return self; } CodeNode* i_bool_ne(CodeNode* self) { Trace("i_bool_ne"); assert(code_is_valid(self)); code_value_bool(self, !code_get_bool(i_bool_eq(self))); return self; } CodeNode* i_bool_ge(CodeNode* self) { CodeNode* op1; CodeNode* op2; CodeType tp1; CodeType tp2; bool result; Trace("i_bool_ge"); assert(code_is_valid(self)); op1 = code_eval_child(self, 0); op2 = code_eval_child(self, 1); tp1 = code_get_type(op1); tp2 = code_get_type(op2); if (tp1 != tp2) { fprintf(stderr, "*** Error 118: Comparison of different types\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(tp1 == tp2); switch(tp1) { case CODE_NUMB : result = numb_cmp(code_get_numb(op1), code_get_numb(op2)) >= 0; break; case CODE_STRG : result = strcmp(code_get_strg(op1), code_get_strg(op2)) >= 0; break; case CODE_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(op1)); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); default : abort(); } code_value_bool(self, result); return self; } CodeNode* i_bool_gt(CodeNode* self) { CodeNode* op1; CodeNode* op2; CodeType tp1; CodeType tp2; bool result; Trace("i_bool_gt"); assert(code_is_valid(self)); op1 = code_eval_child(self, 0); op2 = code_eval_child(self, 1); tp1 = code_get_type(op1); tp2 = code_get_type(op2); if (tp1 != tp2) { fprintf(stderr, "*** Error 118: Comparison of different types\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(tp1 == tp2); switch(tp1) { case CODE_NUMB : result = numb_cmp(code_get_numb(op1), code_get_numb(op2)) > 0; break; case CODE_STRG : result = strcmp(code_get_strg(op1), code_get_strg(op2)) > 0; break; case CODE_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(op1)); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); default : abort(); } code_value_bool(self, result); return self; } CodeNode* i_bool_le(CodeNode* self) { Trace("i_bool_le"); assert(code_is_valid(self)); code_value_bool(self, !code_get_bool(i_bool_gt(self))); return self; } CodeNode* i_bool_lt(CodeNode* self) { Trace("i_bool_lt"); assert(code_is_valid(self)); code_value_bool(self, !code_get_bool(i_bool_ge(self))); return self; } CodeNode* i_bool_seq(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_bool_seq"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); code_value_bool(self, set_is_equal(set_a, set_b)); return self; } CodeNode* i_bool_sneq(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_bool_sneq"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); code_value_bool(self, !set_is_equal(set_a, set_b)); return self; } CodeNode* i_bool_subs(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_bool_subs"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); code_value_bool(self, set_is_subset(set_a, set_b)); return self; } CodeNode* i_bool_sseq(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_bool_sseq"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); code_value_bool(self, set_is_subseteq(set_a, set_b)); return self; } static void check_tuple_set_compatible( const CodeNode* self, const Tuple* tuple_a, const Set* set_b) { Tuple* tuple_b; int i; int dim; /* An empty set is compatible with any tuple. */ if (set_get_members(set_b) == 0) return; dim = set_get_dim(set_b); if (tuple_get_dim(tuple_a) != dim) { fprintf(stderr, "*** Error 188: Index tuple "); tuple_print(stderr, tuple_a); fprintf(stderr, " has wrong dimension %d, expected %d\n", tuple_get_dim(tuple_a), dim); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple_b = set_get_tuple(set_b, 0); assert(tuple_get_dim(tuple_a) == tuple_get_dim(tuple_b)); for(i = 0; i < tuple_get_dim(tuple_a); i++) { ElemType elem_type_a = elem_get_type(tuple_get_elem(tuple_a, i)); ElemType elem_type_b = elem_get_type(tuple_get_elem(tuple_b, i)); assert(elem_type_b == ELEM_NUMB || elem_type_b == ELEM_STRG); if (elem_type_a != elem_type_b) { fprintf(stderr, "*** Error 198: Incompatible index tuple\nTuple "); tuple_print(stderr, tuple_a); fprintf(stderr, " component %d is not compatible with ", i + 1); tuple_print(stderr, tuple_b); fprintf(stderr, "\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } tuple_free(tuple_b); } CodeNode* i_bool_is_elem(CodeNode* self) { const Tuple* tuple; const Set* set; Trace("i_bool_is_elem"); assert(code_is_valid(self)); tuple = code_eval_child_tuple(self, 0); set = code_eval_child_set(self, 1); check_tuple_set_compatible(self, tuple, set); code_value_bool(self, set_lookup(set, tuple)); return self; } CodeNode* i_bool_exists(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; bool exists = false; Trace("i_bool_exists"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while(!exists && (tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); exists = code_get_bool(code_eval(lexpr)); local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_bool(self, exists); return self; } /* ---------------------------------------------------------------------------- * Set Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_set_new_tuple(CodeNode* self) { const List* list; const Tuple* tuple; ListElem* le = NULL; int dim; Trace("i_set_new_tuple"); assert(code_is_valid(self)); list = code_eval_child_list(self, 0); if (!list_is_tuplelist(list)) { /* This errors occurs, if a stream "n+" instead of "" is used in the template * for a "read" statement. */ assert(list_is_entrylist(list)); fprintf(stderr, "*** Error 214: Wrong type of set elements -- wrong read template?\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple = list_get_tuple(list, &le); assert(tuple != NULL); dim = tuple_get_dim(tuple); /* Is this a empty list with just a dummy argument? */ if (dim == 0 && list_get_elems(list) == 1) { code_value_set(self, set_empty_new(0)); } else { le = NULL; /* Start again */ while(NULL != (tuple = list_get_tuple(list, &le))) { if (tuple_get_dim(tuple) != dim) { le = NULL; fprintf(stderr, "*** Error 193: Different dimension tuples in set initialisation\n"); tuple_print(stderr, tuple); fprintf(stderr, " vs. "); tuple_print(stderr, list_get_tuple(list, &le)); fprintf(stderr, "\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } for(int i = 0; i < dim; i++) { ElemType elem_type = elem_get_type(tuple_get_elem(tuple, i)); if (elem_type != ELEM_NUMB && elem_type != ELEM_STRG) { assert(elem_type == ELEM_NAME); fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", elem_get_name(tuple_get_elem(tuple, i))); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } } code_value_set(self, set_new_from_list(list, SET_CHECK_WARN)); } return self; } CodeNode* i_set_new_elem(CodeNode* self) { const List* list; const Elem* elem; ListElem* le = NULL; Trace("i_set_new_elem"); assert(code_is_valid(self)); list = code_eval_child_list(self, 0); while(NULL != (elem = list_get_elem(list, &le))) { ElemType elem_type = elem_get_type(elem); if (elem_type != ELEM_NUMB && elem_type != ELEM_STRG) { assert(elem_type == ELEM_NAME); fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", elem_get_name(elem)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } code_value_set(self, set_new_from_list(list, SET_CHECK_WARN)); return self; } CodeNode* i_set_pseudo(CodeNode* self) { Trace("i_set_pseudo"); assert(code_is_valid(self)); code_value_set(self, set_pseudo_new()); return self; } CodeNode* i_set_empty(CodeNode* self) { int dim; Trace("i_set_empty"); assert(code_is_valid(self)); dim = code_eval_child_size(self, 0); code_value_set(self, set_empty_new(dim)); return self; } static void check_sets_compatible( const CodeNode* self, const Set* set_a, const Set* set_b, const char* op_name) { Tuple* tuple_a; Tuple* tuple_b; int i; /* If one of the two involved sets is empty, the dimension of the * other one does not matter. */ if (set_get_members(set_a) == 0 || set_get_members(set_b) == 0) return; if (set_get_dim(set_a) != set_get_dim(set_b)) { fprintf(stderr, "*** Error 119: %s of sets with different dimension\n", op_name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } tuple_a = set_get_tuple(set_a, 0); tuple_b = set_get_tuple(set_b, 0); assert(tuple_get_dim(tuple_a) == set_get_dim(set_b)); assert(tuple_get_dim(tuple_a) == tuple_get_dim(tuple_b)); for(i = 0; i < tuple_get_dim(tuple_a); i++) { ElemType elem_type_a = elem_get_type(tuple_get_elem(tuple_a, i)); ElemType elem_type_b = elem_get_type(tuple_get_elem(tuple_b, i)); assert(elem_type_a == ELEM_NUMB || elem_type_a == ELEM_STRG); assert(elem_type_b == ELEM_NUMB || elem_type_b == ELEM_STRG); if (elem_type_a != elem_type_b) { fprintf(stderr, "*** Error 120: %s of sets with different types\n", op_name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } tuple_free(tuple_a); tuple_free(tuple_b); } CodeNode* i_set_union(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_set_union"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); check_sets_compatible(self, set_a, set_b, "Union"); code_value_set(self, set_union(set_a, set_b)); return self; } CodeNode* i_set_union2(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; CodeNode* lexpr; SetIter* iter; Tuple* tuple; Set* set_r = NULL; Set* set_old; const Set* set_new; Trace("i_set_union2"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { if (set_r == NULL) set_r = set_copy(code_eval_child_set(self, 1)); else { assert(set_r != NULL); set_old = set_copy(set_r); set_new = code_eval_child_set(self, 1); check_sets_compatible(self, set_old, set_new, "Union"); set_free(set_r); set_r = set_union(set_old, set_new); set_free(set_old); } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); if (set_r == NULL) set_r = set_empty_new(tuple_get_dim(pattern)); code_value_set(self, set_r); return self; } CodeNode* i_set_minus(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_set_minus"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); check_sets_compatible(self, set_a, set_b, "Minus"); code_value_set(self, set_minus(set_a, set_b)); return self; } CodeNode* i_set_inter(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_set_inter"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); check_sets_compatible(self, set_a, set_b, "Intersection"); code_value_set(self, set_inter(set_a, set_b)); return self; } CodeNode* i_set_inter2(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; CodeNode* lexpr; SetIter* iter; Tuple* tuple; Set* set_r = NULL; Set* set_old; const Set* set_new; Trace("i_set_inter2"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); /* This routine is not efficient. * It would be better to make pairs and then unite the pairs, etc. * Now it is O(n) and it could be O(log n) */ while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { if (set_r == NULL) set_r = set_copy(code_eval_child_set(self, 1)); else { set_old = set_copy(set_r); set_new = code_eval_child_set(self, 1); check_sets_compatible(self, set_old, set_new, "Intersection"); set_free(set_r); set_r = set_inter(set_old, set_new); set_free(set_old); } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); if (set_r == NULL) set_r = set_empty_new(tuple_get_dim(pattern)); code_value_set(self, set_r); return self; } CodeNode* i_set_sdiff(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_set_sdiff"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); check_sets_compatible(self, set_a, set_b, "Symmetric Difference"); code_value_set(self, set_sdiff(set_a, set_b)); return self; } CodeNode* i_set_cross(CodeNode* self) { const Set* set_a; const Set* set_b; Trace("i_set_cross"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); set_b = code_eval_child_set(self, 1); code_value_set(self, set_prod_new(set_a, set_b)); return self; } CodeNode* i_set_range(CodeNode* self) { int from; int upto; int step; int diff; Trace("i_set_range"); assert(code_is_valid(self)); from = checked_eval_numb_toint(self, 0, "123: \"from\" value"); upto = checked_eval_numb_toint(self, 1, "124: \"upto\" value"); step = checked_eval_numb_toint(self, 2, "125: \"step\" value"); diff = upto - from; step = Sgn(diff) * abs(step); if (diff == 0) step = 1; if (step == 0) { fprintf(stderr, "*** Error 126: Zero \"step\" value in range\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_set(self, set_range_new(from, upto, step)); return self; } CodeNode* i_set_range2(CodeNode* self) { int from; int upto; int step; int diff; Trace("i_set_range2"); assert(code_is_valid(self)); from = checked_eval_numb_toint(self, 0, "123: \"from\" value"); upto = checked_eval_numb_toint(self, 1, "124: \"upto\" value"); step = checked_eval_numb_toint(self, 2, "125: \"step\" value"); diff = upto - from; if (step == 0) { fprintf(stderr, "*** Error 126: Zero \"step\" value in range\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if ((Sgn(step) > 0 && diff < 0) || (Sgn(step) < 0 && diff > 0)) code_value_set(self, set_empty_new(1)); else code_value_set(self, set_range_new(from, upto, step)); return self; } static Set* heap_to_set(const CodeNode* self, Heap* heap, int dim) { assert(code_is_valid(self)); assert(heap_is_valid(heap)); assert(dim >= 0); Set* set; if (heap_is_empty(heap)) { if (stmt_trigger_warning(206)) { fprintf(stderr, "--- Warning 206: argmin/argmax over empty set\n"); code_errmsg(code_get_child(self, 0)); } set = set_empty_new(dim); } else { Entry* entry = heap_pop_entry(heap); List* list = list_new_tuple(entry_get_tuple(entry)); entry_free(entry); while(!heap_is_empty(heap)) { entry = heap_pop_entry(heap); list_add_tuple(list, entry_get_tuple(entry)); entry_free(entry); } set = set_new_from_list(list, SET_CHECK_WARN); list_free(list); } return set; } static int argmin_entry_cmp_descending(HeapData a, HeapData b) { assert(entry_is_valid(a.entry)); assert(entry_is_valid(b.entry)); assert(entry_get_type(a.entry) == SYM_NUMB); assert(entry_get_type(b.entry) == SYM_NUMB); return numb_cmp(entry_get_numb(b.entry), entry_get_numb(a.entry)); } static int argmax_entry_cmp_ascending(HeapData a, HeapData b) { assert(entry_is_valid(a.entry)); assert(entry_is_valid(b.entry)); assert(entry_get_type(a.entry) == SYM_NUMB); assert(entry_get_type(b.entry) == SYM_NUMB); return numb_cmp(entry_get_numb(a.entry), entry_get_numb(b.entry)); } static CodeNode* do_set_argminmax(CodeNode* self, bool is_min) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; const Numb* value; Heap* heap; int size; assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 1); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); size = checked_eval_numb_toint(self, 0, "207: \"size\" value"); if (size < 1) { fprintf(stderr, "*** Error 208: \"size\" value %d not >= 1\n", size); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* There is no need for more entries than this */ if (size > set_get_members(set)) size = set_get_members(set); assert(size > 0); heap = heap_new_entry(size, is_min ? argmin_entry_cmp_descending : argmax_entry_cmp_ascending); assert(heap != NULL); warn_if_pattern_has_no_name(code_get_child(self, 1), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { value = code_eval_child_numb(self, 2); if (heap_is_full(heap)) { assert(!heap_is_empty(heap)); if (is_min) { /* Is value smaller than currently biggest in heap ? * In this case drop biggest element in heap */ if (numb_cmp(value, entry_get_numb(heap_top_entry(heap))) < 0) entry_free(heap_pop_entry(heap)); } else { /* Is value bigger than currently smallest in heap ? * In this case drop smallest element in heap */ if (numb_cmp(value, entry_get_numb(heap_top_entry(heap))) > 0) entry_free(heap_pop_entry(heap)); } } if (!heap_is_full(heap)) heap_push_entry(heap, entry_new_numb(tuple, value)); } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_set(self, heap_to_set(self, heap, tuple_get_dim(pattern))); heap_free(heap); return self; } CodeNode* i_set_argmin(CodeNode* self) { Trace("i_set_argmin"); return do_set_argminmax(self, true); } CodeNode* i_set_argmax(CodeNode* self) { Trace("i_set_argmax"); return do_set_argminmax(self, false); } CodeNode* i_set_proj(CodeNode* self) { const Set* set_a; const Tuple* tuple; int dim; int i; Trace("i_set_proj"); assert(code_is_valid(self)); set_a = code_eval_child_set(self, 0); tuple = code_eval_child_tuple(self, 1); dim = set_get_dim(set_a); for(i = 0; i < tuple_get_dim(tuple); i++) { const Elem* elem = tuple_get_elem(tuple, i); const Numb* numb; int idx; /* Are there only number in the selection tuple ? */ if (ELEM_NUMB != elem_get_type(elem)) { fprintf(stderr, "*** Error 127: Illegal value type in tuple: "); tuple_print(stderr, tuple); fprintf(stderr, " only numbers are possible\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } numb = elem_get_numb(elem); if (!numb_is_int(numb)) { fprintf(stderr, "*** Error 128: Index value "); numb_print(stderr, numb); fprintf(stderr, " in proj too big or not an integer\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } idx = numb_toint(numb); /* Are all the number between 1 and dim(set) ? */ if (idx < 1 || idx > dim) { fprintf(stderr, "*** Error 129: Illegal index %d, ", idx); fprintf(stderr, " set has only dimension %d\n", dim); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } code_value_set(self, set_proj(set_a, tuple)); return self; } CodeNode* i_set_indexset(CodeNode* self) { const Symbol* sym; Trace("i_set_indexset"); assert(code_is_valid(self)); sym = code_eval_child_symbol(self, 0); assert(sym != NULL); code_value_set(self, set_copy(symbol_get_iset(sym))); return self; } static int noneval_get_dim(const CodeNode* code_cexpr_or_tuple) { assert(code_is_valid(code_cexpr_or_tuple)); int dim = 1; /* Is it a tuple or a cexpr ? */ if (code_get_inst(code_cexpr_or_tuple) == (Inst)i_tuple_new) { for(const CodeNode* code_cexpr_list = code_get_child(code_cexpr_or_tuple, 0); code_get_inst(code_cexpr_list) == (Inst)i_elem_list_add; code_cexpr_list = code_get_child(code_cexpr_list, 0)) { dim++; } } return dim; } CodeNode* i_set_expr(CodeNode* self) { const IdxSet* idxset; const Set* iset; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; CodeNode* cexpr_or_tuple; Elem* elem = NULL; List* list = NULL; bool is_tuple_list = false; Trace("i_set_expr"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); iset = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(iset, pattern); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, iset)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { cexpr_or_tuple = code_eval_child(self, 1); switch(code_get_type(cexpr_or_tuple)) { case CODE_TUPLE : assert(list == NULL || is_tuple_list); is_tuple_list = true; break; case CODE_NUMB : assert(!is_tuple_list); elem = elem_new_numb(code_get_numb(cexpr_or_tuple)); break; case CODE_STRG : assert(!is_tuple_list); elem = elem_new_strg(code_get_strg(cexpr_or_tuple)); break; case CODE_NAME : assert(!is_tuple_list); fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(cexpr_or_tuple)); code_errmsg(self); zpl_exit(EXIT_FAILURE); default : abort(); } assert(is_tuple_list || elem != NULL); if (is_tuple_list) { if (list == NULL) list = list_new_tuple(code_get_tuple(cexpr_or_tuple)); else list_add_tuple(list, code_get_tuple(cexpr_or_tuple)); } else { assert(elem != NULL); if (list == NULL) list = list_new_elem(elem); else list_add_elem(list, elem); elem_free(elem); } } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, iset); if (list == NULL) { if (stmt_trigger_warning(202)) { fprintf(stderr, "--- Warning 202: Indexing over empty set\n"); code_errmsg(code_get_child(self, 0)); } /* If it is an cexpr list the dimension is 1, if it is a * tuple list, it is the dimension of the tuple. * Because of we are not able to determine the dimension * of the tuple just by tuple_get_dim(code_eval_child_tuple(self, 1)). */ code_value_set(self, set_empty_new(noneval_get_dim(code_get_child(self, 1)))); } else { code_value_set(self, set_new_from_list(list, SET_CHECK_WARN)); list_free(list); } return self; } /* ---------------------------------------------------------------------------- * Tupel Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_tuple_new(CodeNode* self) { const List* list = code_eval_child_list(self, 0); int n = list_get_elems(list); Tuple* tuple = tuple_new(n); ListElem* le = NULL; int i; Trace("i_tuple_new"); assert(code_is_valid(self)); for(i = 0; i < n; i++) tuple_set_elem(tuple, i, elem_copy(list_get_elem(list, &le))); code_value_tuple(self, tuple); return self; } CodeNode* i_tuple_empty(CodeNode* self) { Trace("i_tuple_empty"); assert(code_is_valid(self)); code_value_tuple(self, tuple_new(0)); return self; } /* ---------------------------------------------------------------------------- * Symbol Funktionen * ---------------------------------------------------------------------------- */ static Set* set_from_idxset(const IdxSet* idxset) { const Tuple* pattern; Tuple* tuple; Set* newset; SetIter* iter; const Set* set; CodeNode* lexpr; List* list = NULL; assert(idxset != NULL); set = idxset_get_set(idxset); lexpr = idxset_get_lexpr(idxset); pattern = idxset_get_tuple(idxset); /* Is this an pseudo(idx)set ? */ if (set_get_dim(set) == 0) { assert(tuple_get_dim(pattern) == 0); assert(code_get_bool(code_eval(lexpr))); newset = set_pseudo_new(); } else if (idxset_is_unrestricted(idxset)) { assert(code_get_bool(code_eval(lexpr))); newset = set_copy(set); } else { assert(tuple_get_dim(pattern) > 0); iter = set_iter_init(set, pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) { if (list == NULL) list = list_new_tuple(tuple); else list_add_tuple(list, tuple); } local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); if (list == NULL) { newset = set_empty_new(tuple_get_dim(pattern)); /* ??? maybe we need an error here ? */ } else { newset = set_new_from_list(list, SET_CHECK_WARN); list_free(list); } } return newset; } CodeNode* i_newsym_set1(CodeNode* self) { const char* name; const IdxSet* idxset; Set* iset; Symbol* sym; const Tuple* pattern; Tuple* tuple; SetIter* iter; Trace("i_newsym_set1"); name = code_eval_child_name(self, 0); idxset = code_eval_child_idxset(self, 1); iset = set_from_idxset(idxset); sym = symbol_new(name, SYM_SET, iset, set_get_members(iset), NULL); assert(code_is_valid(self)); if (set_get_members(iset) == 0) { fprintf(stderr, "*** Error 197: Empty index set for set\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } pattern = idxset_get_tuple(idxset); iter = set_iter_init(iset, pattern); warn_if_pattern_has_no_name(code_get_child(self, 1), pattern); while((tuple = set_iter_next(iter, iset)) != NULL) { local_install_tuple(pattern, tuple); symbol_add_entry(sym, entry_new_set(tuple, code_eval_child_set(self, 2))); local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, iset); set_free(iset); code_value_void(self); return self; } CodeNode* i_newsym_set2(CodeNode* self) { const char* name; const IdxSet* idxset; Set* iset; Symbol* sym; const List* list; ListElem* lelem; int count; int i; Trace("i_newsym_set2"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); idxset = code_eval_child_idxset(self, 1); iset = set_from_idxset(idxset); list = code_eval_child_list(self, 2); count = list_get_elems(list); assert(list_is_entrylist(list)); /* Empty set ? */ if (set_get_members(iset) == 0) { fprintf(stderr, "*** Error 197: Empty index set for set\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* Pseudo set ? */ if (set_get_dim(iset) == 0) { set_free(iset); iset = set_new_from_list(list, SET_CHECK_WARN); } sym = symbol_new(name, SYM_SET, iset, count, NULL); lelem = NULL; for(i = 0; i < count; i++) { const Entry* entry = list_get_entry(list, &lelem); const Tuple* tuple = entry_get_tuple(entry); #if 0 if (set_get_dim(iset) != tuple_get_dim(tuple)) { fprintf(stderr, "*** Error 196: Indexing Tuple "); tuple_print(stderr, tuple); fprintf(stderr, " has wrong dimension %d, expected %d\n", tuple_get_dim(tuple), set_get_dim(iset)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } #endif check_tuple_set_compatible(self, tuple, iset); if (set_lookup(iset, tuple)) symbol_add_entry(sym, entry_copy(entry)); else { fprintf(stderr, "*** Error 131: Illegal element "); tuple_print(stderr, tuple); fprintf(stderr, " for symbol\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } code_value_void(self); set_free(iset); return self; } static void insert_param_list_by_index( const CodeNode* self, Symbol* sym, const Set* iset, const Tuple* pattern, const List* list) { SetIter* iter; ListElem* le_idx = NULL; int count = 0; Tuple* tuple; int list_entries; Entry* new_entry; list_entries = list_get_elems(list); iter = set_iter_init(iset, pattern); while((tuple = set_iter_next(iter, iset)) != NULL && count < list_entries) { /* bool is not needed, because iset has only true elems */ const Entry* entry = list_get_entry(list, &le_idx); switch(entry_get_type(entry)) { case SYM_NUMB: new_entry = entry_new_numb(tuple, entry_get_numb(entry)); break; case SYM_STRG : new_entry = entry_new_strg(tuple, entry_get_strg(entry)); break; default : abort(); } if (count > 0 && symbol_get_type(sym) != entry_get_type(new_entry)) { fprintf(stderr, "*** Error 173: Illegal type in element "); entry_print(stderr, new_entry); fprintf(stderr, " for symbol\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } symbol_add_entry(sym, new_entry); tuple_free(tuple); count++; } if (tuple != NULL) tuple_free(tuple); set_iter_exit(iter, iset); if (count < list_entries) { if (stmt_trigger_warning(205)) { fprintf(stderr, "--- Warning 205: %d excess entries for symbol %s ignored\n", list_entries - count, symbol_get_name(sym)); code_errmsg(self); } } } static void insert_param_list_by_list( const CodeNode* self, Symbol* sym, const Set* iset, const List* list) { ListElem* le_idx = NULL; int list_entries; int i; list_entries = list_get_elems(list); for(i = 0; i < list_entries; i++) { const Entry* entry = list_get_entry(list, &le_idx); const Tuple* tuple = entry_get_tuple(entry); #if 0 if (set_get_dim(iset) != tuple_get_dim(tuple)) { fprintf(stderr, "*** Error 194: Indexing tuple "); tuple_print(stderr, tuple); fprintf(stderr, " has wrong dimension %d, expected %d\n", tuple_get_dim(tuple), set_get_dim(iset)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } #endif check_tuple_set_compatible(self, tuple, iset); if (!set_lookup(iset, tuple)) { fprintf(stderr, "*** Error 134: Illegal element "); tuple_print(stderr, tuple); fprintf(stderr, " for symbol\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (i > 0 && symbol_get_type(sym) != entry_get_type(entry)) { fprintf(stderr, "*** Error 173: Illegal type in element "); entry_print(stderr, entry); fprintf(stderr, " for symbol\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } symbol_add_entry(sym, entry_copy(entry)); } } /* initialisation per list */ CodeNode* i_newsym_para1(CodeNode* self) { const char* name; const IdxSet* idxset; Set* iset; const List* list; CodeNode* child3; const Entry* deflt = ENTRY_NULL; int list_entries; ListElem* le_idx; const Entry* entry; const Tuple* tuple; Trace("i_newsym_para1"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); idxset = code_eval_child_idxset(self, 1); iset = set_from_idxset(idxset); list = code_eval_child_list(self, 2); child3 = code_eval_child(self, 3); if (code_get_type(child3) != CODE_VOID) deflt = code_get_entry(code_eval(child3)); if (!list_is_entrylist(list)) { /* This errors occurs, if the parameter is missing in the template * for a "read" statement. */ assert(list_is_tuplelist(list)); fprintf(stderr, "*** Error 132: Values in parameter list missing,\n"); fprintf(stderr, " probably wrong read template\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* First element will determine the type (see SYM_ERR below) */ list_entries = list_get_elems(list); /* I found no way to make the following error happen. * You will get either an error 157 or an parse error. * In case there is a way a parse error with * message "Symbol xxx not initialised" will result. * In this case the code below should be reactivated. */ assert(list_entries > 0); #if 0 /* ??? */ /* So if there is no first element, we are in trouble. */ if (list_entries == 0) { fprintf(stderr, "*** Error xxx: Empty initialisation for parameter \"%s\n", name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } #endif le_idx = NULL; /* Now there is the question if we got an entry list with index tuples or without. * A special case is the singleton, i.e. an entry for a single parameter value. */ entry = list_get_entry(list, &le_idx); tuple = entry_get_tuple(entry); /* Check whether the file was empty */ if (entry_get_type(entry) == SYM_SET) { (void)symbol_new(name, deflt == ENTRY_NULL ? SYM_ERR : entry_get_type(deflt), iset, 0, deflt); } else { Symbol* sym; if (set_get_members(iset) == 0) { fprintf(stderr, "*** Error 135: Empty index set for parameter\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } sym = symbol_new(name, SYM_ERR, iset, list_entries, deflt); if (list_entries > 1 && tuple_get_dim(tuple) == 0 && set_get_dim(iset) > 0) { insert_param_list_by_index(self, sym, iset, idxset_get_tuple(idxset), list); } else { insert_param_list_by_list(self, sym, iset, list); } } code_value_void(self); set_free(iset); return self; } /* initialisation per element */ CodeNode* i_newsym_para2(CodeNode* self) { const char* name; Set* iset; const IdxSet* idxset; Symbol* sym; Entry* entry; Tuple* tuple; const Tuple* pattern; SetIter* iter; int count = 0; Trace("i_newsym_para2"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); idxset = code_eval_child_idxset(self, 1); iset = set_from_idxset(idxset); /* Since we alway initialise all elements, there is no use to evaluate the * default parameter. */ if (set_get_members(iset) == 0) { fprintf(stderr, "*** Error 135: Index set for parameter \"%s\" is empty\n", name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } sym = symbol_new(name, SYM_ERR, iset, set_get_members(iset), ENTRY_NULL); pattern = idxset_get_tuple(idxset); iter = set_iter_init(iset, pattern); warn_if_pattern_has_no_name(code_get_child(self, 1), pattern); while((tuple = set_iter_next(iter, iset)) != NULL) { /* bool is not needed, because iset has only true elems */ local_install_tuple(pattern, tuple); CodeNode* child = code_eval_child(self, 2); switch(code_get_type(child)) { case CODE_NUMB: entry = entry_new_numb(tuple, code_get_numb(child)); break; case CODE_STRG : entry = entry_new_strg(tuple, code_get_strg(child)); break; case CODE_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(child)); code_errmsg(code_get_child(self, 2)); zpl_exit(EXIT_FAILURE); default : abort(); } if (count > 0 && symbol_get_type(sym) != entry_get_type(entry)) { fprintf(stderr, "*** Error 173: Illegal type in element "); entry_print(stderr, entry); fprintf(stderr, " for symbol\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } symbol_add_entry(sym, entry); local_drop_frame(); tuple_free(tuple); count++; } set_iter_exit(iter, iset); code_value_void(self); set_free(iset); return self; } CodeNode* i_newsym_var(CodeNode* self) { const char* name; const IdxSet* idxset; Set* iset; Symbol* sym; Tuple* tuple; const Tuple* pattern; VarClass varclass; SetIter* iter; Numb* temp; Trace("i_newsym_var"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); idxset = code_eval_child_idxset(self, 1); varclass = code_eval_child_varclass(self, 2); iset = set_from_idxset(idxset); pattern = idxset_get_tuple(idxset); sym = symbol_new(name, SYM_VAR, iset, set_get_members(iset), NULL); iter = set_iter_init(iset, pattern); warn_if_pattern_has_no_name(code_get_child(self, 1), pattern); while((tuple = set_iter_next(iter, iset)) != NULL) { Bound* lower; Bound* upper; const Numb* priority; const Numb* startval; local_install_tuple(pattern, tuple); lower = bound_copy(code_eval_child_bound(self, 3)); upper = bound_copy(code_eval_child_bound(self, 4)); priority = code_eval_child_numb(self, 5); startval = code_eval_child_numb(self, 6); /* Parser makes sure, cannot happen */ assert(bound_get_type(lower) != BOUND_INFTY); assert(bound_get_type(upper) != BOUND_MINUS_INFTY); /* Integral bounds for integral variables ? */ if (varclass != VAR_CON) { if (bound_get_type(lower) == BOUND_VALUE) { temp = numb_copy(bound_get_value(lower)); numb_ceil(temp); if (!numb_equal(temp, bound_get_value(lower))) { bound_free(lower); lower = bound_new(BOUND_VALUE, temp); if (stmt_trigger_warning(139)) { fprintf(stderr, "--- Warning 139: Lower bound for integral var %s truncated to ", name); numb_print(stderr, temp); fputc('\n', stderr); } } numb_free(temp); } if (bound_get_type(upper) == BOUND_VALUE) { temp = numb_copy(bound_get_value(upper)); numb_floor(temp); if (!numb_equal(temp, bound_get_value(upper))) { bound_free(upper); upper = bound_new(BOUND_VALUE, temp); if (stmt_trigger_warning(140)) { fprintf(stderr, "--- Warning 140: Upper bound for integral var %s truncated to ", name); numb_print(stderr, temp); fputc('\n', stderr); } } numb_free(temp); } } if ( bound_get_type(lower) == BOUND_VALUE && bound_get_type(upper) == BOUND_VALUE && numb_cmp(bound_get_value(lower), bound_get_value(upper)) > 0) { fprintf(stderr, "*** Error 141: Infeasible due to conflicting bounds for var %s\n", name); fprintf(stderr, " lower=%g > upper=%g\n", numb_todbl(bound_get_value(lower)), numb_todbl(bound_get_value(upper))); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* Hier geben wir der Variable einen eindeutigen Namen */ char* tuplestr = tuple_tostr(tuple); char* varname = malloc(strlen(name) + strlen(tuplestr) + 2); assert(varname != NULL); sprintf(varname, "%s%s", name, tuplestr); /* Und nun legen wir sie an. */ Var* var = xlp_addvar(prog_get_lp(), varname, varclass, lower, upper, priority, startval); symbol_add_entry(sym, entry_new_var(tuple, var)); free(varname); free(tuplestr); local_drop_frame(); tuple_free(tuple); bound_free(lower); bound_free(upper); } set_iter_exit(iter, iset); code_value_void(self); set_free(iset); return self; } CodeNode* i_symbol_deref(CodeNode* self) { const Symbol* sym; const Tuple* tuple; const Entry* entry; Term* term; int i; Trace("i_symbol_deref"); assert(code_is_valid(self)); sym = code_eval_child_symbol(self, 0); tuple = code_eval_child_tuple(self, 1); /* wurde schon in mmlscan ueberprueft */ assert(sym != NULL); for(i = 0; i < tuple_get_dim(tuple); i++) { const Elem* elem = tuple_get_elem(tuple, i); /* Are there any unresolved names in the tuple? */ if (ELEM_NAME == elem_get_type(elem)) { fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", elem_get_name(elem)); code_errmsg(code_get_child(self, 1)); zpl_exit(EXIT_FAILURE); } } /* Tuple might not fit to symbol */ entry = symbol_lookup_entry(sym, tuple); if (NULL == entry) { fprintf(stderr, "*** Error 142: Unknown index "); tuple_print(stderr, tuple); fprintf(stderr, " for symbol \"%s\"\n", symbol_get_name(sym)); code_errmsg(code_get_child(self, 1)); zpl_exit(EXIT_FAILURE); } switch(symbol_get_type(sym)) { case SYM_NUMB : code_value_numb(self, numb_copy(entry_get_numb(entry))); break; case SYM_STRG : code_value_strg(self, entry_get_strg(entry)); break; case SYM_SET : code_value_set(self, set_copy(entry_get_set(entry))); break; case SYM_VAR : term = term_new(1); term_add_elem(term, entry, numb_one(), MFUN_NONE); code_value_term(self, term); break; default : abort(); } return self; } CodeNode* i_term_mul(CodeNode* self) { const Term* term_a; const Term* term_b; assert(code_is_valid(self)); term_a = code_eval_child_term(self, 0); term_b = code_eval_child_term(self, 1); code_value_term(self, term_mul_term(term_a, term_b)); return self; } CodeNode* i_term_power(CodeNode* self) { int power; const Term* term; Term* term_result; Term* term_temp; Trace("i_term_power"); assert(code_is_valid(self)); term = code_eval_child_term(self, 0); power = checked_eval_numb_toint(self, 1, "112: Exponent value"); if (power < 0) { fprintf(stderr, "*** Error 121: Negative exponent on variable\n"); code_errmsg(code_get_child(self, 0)); zpl_exit(EXIT_FAILURE); } if (power == 0) { term_result = term_new(1); term_add_constant(term_result, numb_one()); } else { term_result = term_copy(term); for(int i = 1; i < power; i++) { term_temp = term_mul_term(term_result, term); term_free(term_result); term_result = term_temp; } } code_value_term(self, term_result); return self; } CodeNode* i_newdef(CodeNode* self) { Define* def; Trace("i_newdef"); assert(code_is_valid(self)); def = code_eval_child_define(self, 0); define_set_param(def, tuple_copy(code_eval_child_tuple(self, 1))); define_set_code(def, code_get_child(self, 2)); code_value_void(self); return self; } CodeNode* i_define_deref(CodeNode* self) { const Define* def; const Tuple* tuple; const Tuple* param; int i; Trace("i_define_deref"); assert(code_is_valid(self)); def = code_eval_child_define(self, 0); tuple = code_eval_child_tuple(self, 1); for(i = 0; i < tuple_get_dim(tuple); i++) { ElemType elem_type = elem_get_type(tuple_get_elem(tuple, i)); if (elem_type != ELEM_NUMB && elem_type != ELEM_STRG) { assert(elem_type == ELEM_NAME); fprintf(stderr, "*** Error 170: Uninitialised local parameter \"%s\"\n", elem_get_name(tuple_get_elem(tuple, i))); fprintf(stderr, " in call of define \"%s\".\n", define_get_name(def)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } /* wurde schon in mmlscan ueberprueft */ assert(def != NULL); param = define_get_param(def); if (tuple_get_dim(tuple) != tuple_get_dim(param)) { fprintf(stderr, "*** Error 171: Wrong number of arguments (%d instead of %d)\n", tuple_get_dim(tuple), tuple_get_dim(param)); fprintf(stderr, " for call of define \"%s\".\n", define_get_name(def)); code_errmsg(self); zpl_exit(EXIT_FAILURE); } local_install_tuple(param, tuple); code_copy_value(self, code_eval(define_get_code(def))); local_drop_frame(); return self; } /* ---------------------------------------------------------------------------- * Index Set Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_set_idxset(CodeNode* self) { const IdxSet* idxset; Trace("i_set_idxset"); idxset = code_eval_child_idxset(self, 0); code_value_set(self, set_from_idxset(idxset)); return self; } CodeNode* i_idxset_new(CodeNode* self) { assert(code_is_valid(self)); Tuple* tuple; Tuple* t0; CodeNode* lexpr; const Set* set; int dim; bool is_unrestricted; Trace("i_idxset_new"); t0 = tuple_new(0); tuple = tuple_copy(code_eval_child_tuple(self, 0)); set = code_eval_child_set(self, 1); lexpr = code_get_child(self, 2); dim = set_get_dim(set); is_unrestricted = code_get_inst(lexpr) == (Inst)i_bool_true; /* If we get any empty set with dimension 0, it is not the result * of some other operation, but genuine empty. * This is gives a warning. */ if (dim == 0) { assert(set_get_members(set) == 0); if (stmt_trigger_warning(195)) { fprintf(stderr, "--- Warning 195: Genuine empty index as index set\n"); code_errmsg(self); } } /* Attention: set_get_members(set) == 0 is possible! */ /* If no index tuple was given, we construct one. * This will always be ok. */ if (!tuple_cmp(tuple, t0)) { tuple_free(tuple); tuple = tuple_new(dim); for(int i = 0; i < dim; i++) { char name[13]; /* "@-2000000000" */ sprintf(name, "@%d", i + 1); tuple_set_elem(tuple, i, elem_new_name(str_new(name))); } } else { /* If a index tuple was given, check if * - the dimension is correct, sets of dim 0 fit any tuple * - any not NAME type entries are compatible. * - the set is unrestricted, ie all NAMES, no WITH. */ if (dim > 0 && tuple_get_dim(tuple) != dim) { fprintf(stderr, "*** Error 188: Index tuple "); tuple_print(stderr, tuple); fprintf(stderr, " has wrong dimension %d, expected %d\n", tuple_get_dim(tuple), dim); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (set_get_members(set) > 0) { Tuple* t1 = set_get_tuple(set, 0); for(int i = 0; i < dim; i++) { ElemType elem_type = elem_get_type(tuple_get_elem(tuple, i)); if (elem_type != ELEM_NAME) { is_unrestricted = false; if (elem_type != elem_get_type(tuple_get_elem(t1, i))) { fprintf(stderr, "*** Error 198: Incompatible index tuple\n"); tuple_print(stderr, tuple); fprintf(stderr, " component %d is not compatible with ", i + 1); tuple_print(stderr, t1); fprintf(stderr, "\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } } } tuple_free(t1); } } code_value_idxset(self, idxset_new(tuple, set, lexpr, is_unrestricted)); tuple_free(t0); tuple_free(tuple); return self; } CodeNode* i_idxset_pseudo_new(CodeNode* self) { Tuple* tuple; Set* set; Trace("i_idxset_pseudo_new"); assert(code_is_valid(self)); tuple = tuple_new(0); set = set_pseudo_new(); code_value_idxset(self, idxset_new(tuple, set, code_get_child(self, 0), true)); set_free(set); tuple_free(tuple); return self; } /* ---------------------------------------------------------------------------- * Local Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_local_deref(CodeNode* self) { const char* name; const Elem* elem; Trace("i_local_deref"); assert(code_is_valid(self)); name = code_eval_child_name(self, 0); elem = local_lookup(name); if (elem == NULL) code_value_name(self, name); else { switch(elem_get_type(elem)) { case ELEM_NUMB : code_value_numb(self, numb_copy(elem_get_numb(elem))); break; case ELEM_STRG : code_value_strg(self, elem_get_strg(elem)); break; default : abort(); } } return self; } /* ---------------------------------------------------------------------------- * Term Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_term_coeff(CodeNode* self) { Term* term; const Numb* coeff; Trace("i_term_coeff"); assert(code_is_valid(self)); term = term_copy(code_eval_child_term(self, 0)); coeff = code_eval_child_numb(self, 1); term_mul_coeff(term, coeff); code_value_term(self, term); return self; } CodeNode* i_term_const(CodeNode* self) { Term* term; const Numb* numb; Trace("i_term_const"); assert(code_is_valid(self)); term = term_copy(code_eval_child_term(self, 0)); numb = code_eval_child_numb(self, 1); term_add_constant(term, numb); code_value_term(self, term); return self; } CodeNode* i_term_add(CodeNode* self) { const Term* term_b; CodeNode* child0; Trace("i_term_add"); assert(code_is_valid(self)); term_b = code_eval_child_term(self, 1); child0 = code_get_child(self, 0); if (term_get_elements(term_b) == 1) { (void)code_eval(child0); term_append_term(code_value_steal_term(self, 0), term_b); } else { code_value_term(self, term_add_term(code_eval_child_term(self, 0), term_b)); code_free_value(child0); } code_free_value(code_get_child(self, 1)); return self; } CodeNode* i_term_sub(CodeNode* self) { const Term* term_a; const Term* term_b; Trace("i_term_sub"); assert(code_is_valid(self)); term_a = code_eval_child_term(self, 0); term_b = code_eval_child_term(self, 1); code_value_term(self, term_sub_term(term_a, term_b)); return self; } CodeNode* i_term_sum(CodeNode* self) { const IdxSet* idxset; const Set* set; const Tuple* pattern; Tuple* tuple; CodeNode* lexpr; SetIter* iter; Term* term_r; Trace("i_term_sum"); assert(code_is_valid(self)); idxset = code_eval_child_idxset(self, 0); set = idxset_get_set(idxset); pattern = idxset_get_tuple(idxset); lexpr = idxset_get_lexpr(idxset); iter = set_iter_init(set, pattern); term_r = term_new(1); warn_if_pattern_has_no_name(code_get_child(self, 0), pattern); while((tuple = set_iter_next(iter, set)) != NULL) { local_install_tuple(pattern, tuple); if (code_get_bool(code_eval(lexpr))) term_append_term(term_r, code_eval_child_term(self, 1)); local_drop_frame(); tuple_free(tuple); } set_iter_exit(iter, set); code_value_term(self, term_r); return self; } CodeNode* i_term_expr(CodeNode* self) { Term* term; const Numb* numb; Trace("i_term_expr"); assert(code_is_valid(self)); term = term_new(1); numb = code_eval_child_numb(self, 0); term_add_constant(term, numb); code_value_term(self, term); return self; } /* ---------------------------------------------------------------------------- * Entry Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_entry(CodeNode* self) { const Tuple* tuple; Entry* entry; CodeNode* child; Trace("i_entry"); assert(code_is_valid(self)); tuple = code_eval_child_tuple(self, 0); child = code_eval_child(self, 1); switch(code_get_type(child)) { case CODE_NUMB : entry = entry_new_numb(tuple, code_get_numb(child)); break; case CODE_STRG : entry = entry_new_strg(tuple, code_get_strg(child)); break; case CODE_SET : entry = entry_new_set(tuple, code_get_set(child)); break; case CODE_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", code_get_name(child)); code_errmsg(child); zpl_exit(EXIT_FAILURE); default : abort(); } code_value_entry(self, entry); return self; } /* ---------------------------------------------------------------------------- * List Funktionen * ---------------------------------------------------------------------------- */ CodeNode* i_elem_list_new(CodeNode* self) { CodeNode* child = code_eval_child(self, 0); Elem* elem; Trace("i_elem_list_new"); assert(code_is_valid(self)); switch(code_get_type(child)) { case CODE_NUMB : elem = elem_new_numb(code_get_numb(child)); break; case CODE_STRG : elem = elem_new_strg(code_get_strg(child)); break; case CODE_NAME : elem = elem_new_name(code_get_name(child)); break; default : abort(); } code_value_list(self, list_new_elem(elem)); elem_free(elem); return self; } static Elem* make_elem(CodeNode* node) { Elem* elem; assert(code_is_valid(node)); switch(code_get_type(node)) { case CODE_NUMB : elem = elem_new_numb(code_get_numb(node)); break; case CODE_STRG : elem = elem_new_strg(code_get_strg(node)); break; case CODE_NAME : elem = elem_new_name(code_get_name(node)); break; default : abort(); } return elem; } CodeNode* i_elem_list_add(CodeNode* self) { CodeNode* node; Elem* elem; List* list; Trace("i_elem_list_add2"); assert(code_is_valid(self)); elem = make_elem(code_eval_child(self, 1)); list = list_new_elem(elem); elem_free(elem); node = code_get_child(self, 0); /* If true, process directly without using a lot of recursion */ while(code_get_inst(node) == (Inst)i_elem_list_add) { elem = make_elem(code_eval_child(node, 1)); list_insert_elem(list, elem); elem_free(elem); node = code_get_child(node, 0); } /* This is likely, so make it the fast way */ if (code_get_inst(node) == (Inst)i_elem_list_new) { elem = make_elem(code_eval_child(node, 0)); list_insert_elem(list, elem); elem_free(elem); } else { ListElem* l = NULL; const List* head_list; const Elem* celem; head_list = code_get_list(code_eval(node)); while(NULL != (celem = list_get_elem(head_list, &l))) list_insert_elem(list, celem); } code_value_list(self, list); return self; } CodeNode* i_tuple_list_new(CodeNode* self) { Trace("i_tuple_list_new"); assert(code_is_valid(self)); code_value_list(self, list_new_tuple( code_eval_child_tuple(self, 0))); return self; } CodeNode* i_tuple_list_add(CodeNode* self) { CodeNode* node; const Tuple* tuple; List* list; Trace("i_tuple_list_add2"); assert(code_is_valid(self)); node = code_get_child(self, 0); tuple = code_eval_child_tuple(self, 1); list = list_new_tuple(tuple); /* If true, process directly without using a lot of recursion */ while(code_get_inst(node) == (Inst)i_tuple_list_add) { list_insert_tuple(list, code_eval_child_tuple(node, 1)); node = code_get_child(node, 0); } /* This is likely, so make it the fast way */ if (code_get_inst(node) == (Inst)i_tuple_list_new) list_insert_tuple(list, code_eval_child_tuple(node, 0)); else { ListElem* l = NULL; const List* head_list; head_list = code_get_list(code_eval(node)); while(NULL != (tuple = list_get_tuple(head_list, &l))) list_insert_tuple(list, tuple); } code_value_list(self, list); return self; } CodeNode* i_entry_list_new(CodeNode* self) { Trace("i_entry_list_new"); assert(code_is_valid(self)); code_value_list(self, list_new_entry( code_eval_child_entry(self, 0))); return self; } CodeNode* i_entry_list_add(CodeNode* self) { const Entry* entry; List* list; CodeNode* node; Trace("i_entry_list_add3"); assert(code_is_valid(self)); node = code_get_child(self, 0); entry = code_eval_child_entry(self, 1); list = list_new_entry(entry); /* If true, process directly without using a lot of recursion */ while(code_get_inst(node) == (Inst)i_entry_list_add) { list_insert_entry(list, code_eval_child_entry(node, 1)); node = code_get_child(node, 0); } /* This is likely, so make it the fast way */ if (code_get_inst(node) == (Inst)i_entry_list_new) list_insert_entry(list, code_eval_child_entry(node, 0)); else { ListElem* l = NULL; const List* head_list; head_list = code_get_list(code_eval(node)); while(NULL != (entry = list_get_entry(head_list, &l))) list_insert_entry(list, entry); } code_value_list(self, list); return self; } CodeNode* i_entry_list_subsets(CodeNode* self) { const Set* set; List* list = NULL; int subset_size_from; int subset_size_to; SetIterIdx idx = 0; int used; int i; Trace("i_entry_list_subsets"); assert(code_is_valid(self)); set = code_eval_child_set(self, 0); used = set_get_members(set); subset_size_from = checked_eval_numb_toint(self, 1, "143: Size for subsets"); subset_size_to = checked_eval_numb_toint(self, 2, "143: Size for subsets"); if (subset_size_to == -1) subset_size_to = subset_size_from < used ? subset_size_from : used; if (used < 1) { fprintf(stderr, "*** Error 144: Tried to build subsets of empty set\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(set_get_dim(set) > 0); if (subset_size_from < 1 || subset_size_from > subset_size_to) { fprintf(stderr, "*** Error 145: Illegal size for subsets %d,\n", subset_size_from); fprintf(stderr, " should be between 1 and %d\n", subset_size_to); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (subset_size_to > used) { fprintf(stderr, "*** Error 220: Illegal size for subsets %d,\n", subset_size_to); fprintf(stderr, " should be between %d and %d\n", subset_size_from, used); code_errmsg(self); zpl_exit(EXIT_FAILURE); } for(i = subset_size_from; i <= subset_size_to; i++) list = set_subsets_list(set, i, list, &idx); assert(list != NULL); code_value_list(self, list); return self; } CodeNode* i_entry_list_powerset(CodeNode* self) { const Set* set; List* list = NULL; SetIterIdx idx = 0; int i; int used; Trace("i_entry_list_powerset"); assert(code_is_valid(self)); set = code_eval_child_set(self, 0); used = set_get_members(set); if (used < 1) { fprintf(stderr, "*** Error 146: Tried to build powerset of empty set\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } assert(set_get_dim(set) > 0); for(i = 0; i <= used; i++) list = set_subsets_list(set, i, list, &idx); assert(list != NULL); code_value_list(self, list); return self; } CodeNode* i_list_matrix(CodeNode* self) { Trace("i_list_matrix"); assert(code_is_valid(self)); const List* head_list = code_eval_child_list(self, 0); const List* body_list = code_eval_child_list(self, 1); List* list = NULL; ListElem* le_body = NULL; int head_count = list_get_elems(head_list); int body_count = list_get_elems(body_list); assert(head_count > 0); assert(body_count > 0); assert(body_count % 2 == 0); /* has to be even */ for(int i = 0; i < body_count; i += 2) { const List* idx_list = list_get_list(body_list, &le_body); const List* val_list = list_get_list(body_list, &le_body); int idx_count = list_get_elems(idx_list); ListElem* le_head = NULL; ListElem* le_val = NULL; /* Number of values in a lines has to be equal the * number of elements in the head list */ if (list_get_elems(val_list) != head_count) { fprintf(stderr, "*** Error 172: Wrong number of entries (%d) in table line,\n", list_get_elems(val_list)); fprintf(stderr, " expected %d entries\n", head_count); code_errmsg(self); zpl_exit(EXIT_FAILURE); } /* For each element in the head list we end up with * one element in the result list */ for(int j = 0; j < head_count; j++) { /* Construct tuple. If idx_count is not constant, we will later * get an error when the list is applied to the parameter */ Tuple* tuple = tuple_new(idx_count + 1); Entry* entry; int k; ListElem* le_idx = NULL; for(k = 0; k < idx_count; k++) tuple_set_elem(tuple, k, elem_copy(list_get_elem(idx_list, &le_idx))); tuple_set_elem(tuple, k, elem_copy(list_get_elem(head_list, &le_head))); const Elem* elem = list_get_elem(val_list, &le_val); switch(elem_get_type(elem)) { case ELEM_NUMB : entry = entry_new_numb(tuple, elem_get_numb(elem)); break; case ELEM_STRG : entry = entry_new_strg(tuple, elem_get_strg(elem)); break; case ELEM_NAME : fprintf(stderr, "*** Error 133: Unknown symbol \"%s\"\n", elem_get_name(elem)); code_errmsg(self); zpl_exit(EXIT_FAILURE); default : abort(); } if (list == NULL) list = list_new_entry(entry); else list_add_entry(list, entry); entry_free(entry); tuple_free(tuple); } } assert(list != NULL); code_value_list(self, list); return self; } CodeNode* i_matrix_list_new(CodeNode* self) { List* list; Trace("i_matrix_list_new"); assert(code_is_valid(self)); list = list_new_list(code_eval_child_list(self, 0)); list_add_list(list, code_eval_child_list(self, 1)); code_value_list(self, list); return self; } CodeNode* i_matrix_list_add(CodeNode* self) { List* list; Trace("i_matrix_list_add"); assert(code_is_valid(self)); list = list_copy(code_eval_child_list(self, 0)); list_add_list(list, code_eval_child_list(self, 1)); list_add_list(list, code_eval_child_list(self, 2)); code_value_list(self, list); return self; } static void objective(CodeNode* self, bool minimize) { const char* name; const Term* term; assert(code_is_valid(self)); name = code_eval_child_name(self, 0); if (!conname_set(name)) { fprintf(stderr, "*** Error 105: Duplicate constraint name \"%s\"\n", name); code_errmsg(self); zpl_exit(EXIT_FAILURE); } term = code_eval_child_term(self, 1); if (!term_is_linear(term)) { fprintf(stderr, "*** Error 221: The objective function has to be linear\n"); code_errmsg(self); zpl_exit(EXIT_FAILURE); } if (xlp_setobj(prog_get_lp(), name, minimize)) { fprintf(stderr, "--- Warning 223: Objective function %s overwrites existing one\n", name); code_errmsg(self); } term_to_objective(term); conname_free(); code_value_void(self); } CodeNode* i_object_min(CodeNode* self) { Trace("i_object_min"); assert(code_is_valid(self)); objective(self, true); return self; } CodeNode* i_object_max(CodeNode* self) { Trace("i_object_max"); assert(code_is_valid(self)); objective(self, false); return self; } CodeNode* i_print(CodeNode* self) { CodeNode* child; Trace("i_print"); assert(code_is_valid(self)); child = code_eval(code_get_child(self, 0)); switch(code_get_type(child)) { case CODE_LIST : { const List* list = code_get_list(child); ListElem* le = NULL; const Elem* elem; assert(list_is_elemlist(list)); while(NULL != (elem = list_get_elem(list, &le))) elem_print(stdout, elem, false); } break; case CODE_TUPLE : tuple_print(stdout, code_get_tuple(child)); break; case CODE_SET : set_print(stdout, code_get_set(child)); break; case CODE_SYM : symbol_print(stdout, code_get_symbol(child)); break; default : abort(); } fputc('\n', stdout); code_value_void(self); return self; } CodeNode* i_bound_new(CodeNode* self) { Trace("i_bound_new"); assert(code_is_valid(self)); code_value_bound(self, bound_new(BOUND_VALUE, code_eval_child_numb(self, 0))); return self; } CodeNode* i_check(CodeNode* self) { Trace("i_check"); assert(code_is_valid(self)); if (!code_eval_child_bool(self, 0)) { fprintf(stderr, "*** Error 900: Check failed!\n"); local_print_all(stderr); code_errmsg(self); zpl_exit(EXIT_FAILURE); } code_value_void(self); return self; } zimpl-3.3.6/src/zimpl/stkchk.h0000644001417200060250000000427013304236715016146 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: stkchk.h */ /* Name....: Stack usage checker */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2011-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _STKCHK_H_ #define _STKCHK_H_ #ifdef __cplusplus extern "C" { #endif #ifndef NDEBUG extern const void* stkchk_start; extern size_t stkchk_maxi; extern void stkchk_init_x(void); extern size_t stkchk_used_x(void); /*lint -sem( stkchk_maximum_x, 1p) */ extern void stkchk_maximum_x(FILE* fp); /*lint -sem( stkchk_display_x, 1p) */ extern void stkchk_display_x(FILE* fp); #define stkchk_init() stkchk_init_x() #define stkchk_used() stkchk_used_x() #define stkchk_display(fp) stkchk_display_x(fp) #define stkchk_maximum(fp) stkchk_maximum_x(fp) #else #define stkchk_init() /**/ #define stkchk_used() /**/ #define stkchk_display(fp) /**/ #define stkchk_maximum(fp) /**/ #endif /* NDEBUG */ #ifdef __cplusplus } #endif #endif /* _STKCHK_H_ */ zimpl-3.3.6/src/zimpl/load.c0000644001417200060250000001607213304236715015574 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: load.c */ /* Name....: Modell Loading Routines */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/mme.h" #include "zimpl/stmt.h" #include "zimpl/prog.h" #include "zimpl/metaio.h" #define BUF_EXT 65536 /* cpp leaves comments like # 1 "test1.zpl" # 1 "" # 1 "" # 1 "test1.zpl" the routine tries to grap the linenumber. */ static void skip_comment(const MFP* fp, int* lineno) { int k = 0; int c; (*lineno)++; do { c = mio_getc(fp); } while(!isdigit(c) && c != EOF && c != '\n'); while(isdigit(c)) { k = 10 * k + c - '0'; c = mio_getc(fp); } if (c == ' ') { c = mio_getc(fp); if (c == '\"') { c = mio_getc(fp); if (c == '<') { *lineno = k - 1; } } } while(c != EOF && c != '\n') c = mio_getc(fp); } static char* get_line(char** buf, int* size, const MFP* fp, int* lineno) { bool in_string = false; int cnt = 0; for(;;) { int c; assert(cnt <= *size); if (cnt == *size - 1) { *size += BUF_EXT; *buf = realloc(*buf, (size_t)*size); } assert(*buf != NULL); c = mio_getc(fp); if (in_string && ((c == EOF) || c == '\n')) { fprintf(stderr, "*** Error 161: Line %d: Unterminated string\n", *lineno); zpl_exit(EXIT_FAILURE); } if (c == EOF) { if (cnt > 0) { (*buf)[cnt] = '\0'; if (stmt_trigger_warning(162)) fprintf(stderr, "--- Warning 162: Line %d: Trailing \"%.20s\" ignored\n", *lineno, *buf); } return NULL; } if (c == '\n') { c = ' '; (*lineno)++; } if (iscntrl(c)) c = ' '; /* Skip leading white space */ if (cnt == 0 && isspace(c)) continue; if (c == '"') in_string = !in_string; /* Remove comments */ if (!in_string && (c == '#')) { skip_comment(fp, lineno); /* do { c = mio_getc(fp); } while((c != EOF) && (c != '\n')); (*lineno)++; */ continue; } (*buf)[cnt++] = (char)c; if (!in_string && (c == ';')) break; } (*buf)[cnt] = '\0'; return *buf; } static const char* make_pathname( char* target, const char* pathname, const char* filename) { assert(target != NULL); assert(pathname != NULL); assert(filename != NULL); /* Absolute Name ? */ if (*filename == DIRSEP) strcpy(target, filename); else { char* s; strcpy(target, pathname); if (NULL == (s = strrchr(target, DIRSEP))) strcpy(target, filename); else strcpy(s + 1, filename); } return target; } static void add_stmt( Prog* prog, const char* filename, const int lineno, const char* text) { StmtType type = STMT_ERR; assert(prog != NULL); assert(filename != NULL); assert(text != NULL); if (!strncmp(text, "set", 3) && isspace(text[3])) type = STMT_SET; else if (!strncmp(text, "param", 5) && isspace(text[5])) type = STMT_PARAM; else if (!strncmp(text, "var", 3) && isspace(text[3])) type = STMT_VAR; else if (!strncmp(text, "minimize", 8) && isspace(text[8])) type = STMT_MIN; else if (!strncmp(text, "maximize", 8) && isspace(text[8])) type = STMT_MAX; else if (!strncmp(text, "subto", 5) && isspace(text[5])) type = STMT_CONS; else if (!strncmp(text, "defnumb", 7) && isspace(text[7])) type = STMT_DEF; else if (!strncmp(text, "defstrg", 7) && isspace(text[7])) type = STMT_DEF; else if (!strncmp(text, "defbool", 7) && isspace(text[7])) type = STMT_DEF; else if (!strncmp(text, "defset", 6) && isspace(text[6])) type = STMT_DEF; else if (!strncmp(text, "do", 2) && isspace(text[2])) type = STMT_DO; else if (!strncmp(text, "sos", 3) && isspace(text[3])) type = STMT_SOS; else { fprintf(stderr, "*** Error 163: Line %d: Syntax Error\n", lineno); show_source(stderr, text, 1); zpl_exit(EXIT_FAILURE); } prog_add_stmt(prog, stmt_new(type, filename, lineno, text)); } void prog_load(Prog* prog, const char* cmdpipe, const char* filename) { int bufsize = BUF_EXT; char* buf = malloc((size_t)bufsize); MFP* fp; char* s; int lineno = 1; char newname [1024]; char* temp; char* myfilename; assert(prog != NULL); assert(filename != NULL); assert(buf != NULL); assert(filename != NULL); if (cmdpipe == NULL) myfilename = strdup(filename); else { myfilename = malloc(strlen(filename) + strlen(cmdpipe) + 1024); sprintf(&myfilename[1], cmdpipe, filename); myfilename[0] = '#'; } if (NULL == (fp = mio_open(myfilename, ".zpl"))) zpl_exit(EXIT_FAILURE); if (verbose) printf("Reading %s\n", myfilename); while((s = get_line(&buf, &bufsize, fp, &lineno)) != NULL) { assert(!isspace(*s)); /* This could happen if we have a ;; somewhere. */ if (*s == '\0') continue; if (1 == sscanf(s, "include \"%1023[^\"]\"", newname)) { temp = malloc(strlen(filename) + strlen(newname) + 2); prog_load(prog, cmdpipe, make_pathname(temp, filename, newname)); free(temp); } else { add_stmt(prog, filename, lineno, s); } } mio_close(fp); free(myfilename); free(buf); } zimpl-3.3.6/src/zimpl/entry.h0000644001417200060250000000657713304236715016034 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: entry.h */ /* Name....: Symbol Table Entry Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _ENTRY_H_ #define _ENTRY_H_ #ifdef __cplusplus extern "C" { #endif #define ENTRY_NULL ((Entry*)0) /*lint -sem( entry_new_numb, 1p == 1, @P > malloc(1P)) */ extern Entry* entry_new_numb(const Tuple* tuple, const Numb* numb); /*lint -sem( entry_new_strg, nulterm(2), 1p == 1 && 2p, @P > malloc(1P)) */ extern Entry* entry_new_strg(const Tuple* tuple, const char* strg); /*lint -sem( entry_new_set, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Entry* entry_new_set(const Tuple* tuple, const Set* set); /*lint -sem( entry_new_var, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Entry* entry_new_var(const Tuple* tuple, Var* var); /*lint -sem( entry_free, custodial(1), 1p == 1) */ extern void entry_free(Entry* entry); /*lint -sem( entry_is_valid, 1p == 1) */ extern bool entry_is_valid(const Entry* entry); /*lint -sem( entry_copy, 1p == 1, @P > malloc(1P)) */ extern Entry* entry_copy(const Entry* entry); /*lint -sem( entry_cmp, 1p == 1 && 2p == 1) */ extern bool entry_cmp(const Entry* entry, const Tuple* tuple); /*lint -sem( entry_get_type, 1p == 1, @n >= 0) */ extern SymbolType entry_get_type(const Entry* entry); /*lint -sem( entry_get_tuple, 1p == 1, @P > malloc(1P)) */ extern const Tuple* entry_get_tuple(const Entry* entry); /*lint -sem( entry_get_numb, 1p == 1) */ extern const Numb* entry_get_numb(const Entry* entry); /*lint -sem( entry_get_strg, 1p == 1, @p && nulterm(@)) */ extern const char* entry_get_strg(const Entry* entry); /*lint -sem( entry_get_set, 1p == 1, @P > malloc(1P)) */ extern const Set* entry_get_set(const Entry* entry); /*lint -sem( entry_get_var, 1p == 1, @P > malloc(1P)) */ extern Var* entry_get_var(const Entry* entry); /*lint -sem( entry_print, 1p == 1 && 2p == 1) */ extern void entry_print(FILE* fp, const Entry* entry); #ifdef __cplusplus } #endif #endif /* _ENTRY_H_ */ zimpl-3.3.6/src/zimpl/numbgmp.c0000644001417200060250000004115113304236715016316 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: numbgmp.c */ /* Name....: Number Functions using gmp */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include /* #define TRACE 1 */ #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/random.h" #include "zimpl/gmpmisc.h" #include "zimpl/mme.h" #include "zimpl/numb.h" #define NUMB_STORE_SIZE 1000 #define NUMB_SID 0x4e756d62 typedef struct numb_storage NumbStore; /* Note: In case of gmt use refc and infinity indicator. */ struct number { SID union { mpq_t numb; Numb* next; } value; }; struct numb_storage { Numb* begin; NumbStore* next; }; static NumbStore* store_anchor = NULL; static Numb* store_free = NULL; static int store_count = 0; /* constants */ static Numb* numb_const_zero = NULL; static Numb* numb_const_one = NULL; static Numb* numb_const_minusone = NULL; static Numb* numb_const_unknown = NULL; /* ??? numb_const_unkown is a hack. GMP has no way to indicate NaN or Infinity. * But we need this for example to convey that the startvalue of a variable has * not been set. */ static void extend_storage(void) { NumbStore* store = calloc(1, sizeof(*store)); Numb* numb; int i; assert(store != NULL); store->begin = malloc(NUMB_STORE_SIZE * sizeof(*store->begin)); store->next = store_anchor; store_anchor = store; for(i = 0; i < NUMB_STORE_SIZE - 1; i++) { numb = &store->begin[i]; numb->value.next = &store->begin[i + 1]; SID_set(numb, NUMB_SID); assert(numb_is_valid(numb)); } numb = &store->begin[i]; numb->value.next = store_free; SID_set(numb, NUMB_SID); assert(numb_is_valid(numb)); store_free = &store->begin[0]; assert(store->begin != NULL); assert(store_anchor != NULL); assert(store_free != NULL); } void numb_init(bool with_management) { store_anchor = NULL; store_free = NULL; gmp_init(verbose >= VERB_VERBOSE, with_management); numb_const_zero = numb_new(); numb_const_one = numb_new_integer(1); numb_const_minusone = numb_new_integer(-1); numb_const_unknown = numb_new_ascii("7e21"); } void numb_exit() { NumbStore* store; NumbStore* next; numb_free(numb_const_zero); numb_free(numb_const_one); numb_free(numb_const_minusone); numb_free(numb_const_unknown); numb_const_zero = NULL; numb_const_one = NULL; numb_const_minusone = NULL; numb_const_unknown = NULL; if (store_count != 0) printf("Numb store count %d\n", store_count); for(store = store_anchor; store != NULL; store = next) { next = store->next; /* ??? mpq_clear() is not called for the used ones. * This would be faster then doing it in numb_free. */ /* ??? SIDs are not cleared. */ free(store->begin); free(store); } store_anchor = NULL; store_free = NULL; store_count = 0; gmp_exit(); } /* value is zero */ Numb* numb_new(void) { Numb* numb; Trace("numb_new"); if (store_free == NULL) extend_storage(); assert(store_free != NULL); numb = store_free; store_free = numb->value.next; store_count++; mpq_init(numb->value.numb); return numb; } Numb* numb_new_ascii(const char* val) { Numb* numb = numb_new(); assert(numb != NULL); gmp_str2mpq(numb->value.numb, val); return numb; } Numb* numb_new_integer(int val) { Numb* numb = numb_new(); assert(numb != NULL); mpq_set_si(numb->value.numb, val, 1); return numb; } Numb* numb_new_mpq(const mpq_t val) { Numb* numb = numb_new(); assert(numb != NULL); mpq_set(numb->value.numb, val); return numb; } void numb_free(Numb* numb) { Trace("numb_free"); assert(numb_is_valid(numb)); mpq_clear(numb->value.numb); numb->value.next = store_free; store_free = numb; store_count--; } bool numb_is_valid(const Numb* numb) { return numb != NULL && SID_ok(numb, NUMB_SID); } Numb* numb_copy(const Numb* source) { Numb* numb = numb_new(); assert(numb_is_valid(source)); assert(numb_is_valid(numb)); mpq_set(numb->value.numb, source->value.numb); return numb; } /* true wenn gleich, sonst false */ bool numb_equal(const Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); return mpq_equal(numb_a->value.numb, numb_b->value.numb) != 0; } /* Return a positive value if op1 > op2, zero if op1 = op2, and a negative value if op1 < op2 */ int numb_cmp(const Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); return mpq_cmp(numb_a->value.numb, numb_b->value.numb); } void numb_set(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_set(numb_a->value.numb, numb_b->value.numb); } void numb_add(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_add(numb_a->value.numb, numb_a->value.numb, numb_b->value.numb); } Numb* numb_new_add(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_add(numb->value.numb, numb_a->value.numb, numb_b->value.numb); return numb; } void numb_sub(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_sub(numb_a->value.numb, numb_a->value.numb, numb_b->value.numb); } Numb* numb_new_sub(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_sub(numb->value.numb, numb_a->value.numb, numb_b->value.numb); return numb; } void numb_mul(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_mul(numb_a->value.numb, numb_a->value.numb, numb_b->value.numb); } Numb* numb_new_mul(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_mul(numb->value.numb, numb_a->value.numb, numb_b->value.numb); return numb; } void numb_div(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_div(numb_a->value.numb, numb_a->value.numb, numb_b->value.numb); } Numb* numb_new_div(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_div(numb->value.numb, numb_a->value.numb, numb_b->value.numb); return numb; } void numb_intdiv(Numb* numb_a, const Numb* numb_b) { mpz_t q; assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_div(numb_a->value.numb, numb_a->value.numb, numb_b->value.numb); mpz_init(q); mpz_tdiv_q(q, mpq_numref(numb_a->value.numb), mpq_denref(numb_a->value.numb)); mpq_set_z(numb_a->value.numb, q); mpz_clear(q); } Numb* numb_new_intdiv(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); mpz_t q; assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpq_div(numb->value.numb, numb_a->value.numb, numb_b->value.numb); mpz_init(q); mpz_tdiv_q(q, mpq_numref(numb->value.numb), mpq_denref(numb->value.numb)); mpq_set_z(numb->value.numb, q); mpz_clear(q); return numb; } void numb_mod(Numb* numb_a, const Numb* numb_b) { mpz_t a; mpz_t b; mpz_t r; assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpz_init(a); mpz_init(b); mpz_init(r); mpz_mul(a, mpq_numref(numb_a->value.numb), mpq_denref(numb_b->value.numb)); mpz_mul(b, mpq_numref(numb_b->value.numb), mpq_denref(numb_a->value.numb)); mpz_mod(r, a, b); mpq_set_z(numb_a->value.numb, r); mpz_clear(r); mpz_clear(b); mpz_clear(a); } Numb* numb_new_mod(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); mpz_t a; mpz_t b; mpz_t r; assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); mpz_init(a); mpz_init(b); mpz_init(r); mpz_mul(a, mpq_numref(numb_a->value.numb), mpq_denref(numb_b->value.numb)); mpz_mul(b, mpq_numref(numb_b->value.numb), mpq_denref(numb_a->value.numb)); mpz_mod(r, a, b); mpq_set_z(numb->value.numb, r); mpz_clear(r); mpz_clear(b); mpz_clear(a); return numb; } Numb* numb_new_pow(const Numb* base, int expo) { Numb* numb = numb_new(); int i; bool is_negative = false; assert(numb != NULL); assert(numb_is_valid(base)); /* ??? we should limit the exponent to say 1000 */ if (expo < 0) { is_negative = true; expo = -expo; } mpq_set_si(numb->value.numb, 1, 1); /* set to 1 */ for(i = 0; i < expo; i++) mpq_mul(numb->value.numb, numb->value.numb, base->value.numb); if (is_negative) mpq_inv(numb->value.numb, numb->value.numb); return numb; } Numb* numb_new_fac(int n) { Numb* numb = numb_new(); mpz_t z; assert(numb != NULL); assert(n >= 0); mpz_init(z); mpz_fac_ui(z, (unsigned int)n); mpq_set_z(numb->value.numb, z); mpz_clear(z); return numb; } void numb_neg(Numb* numb) { assert(numb_is_valid(numb)); mpq_neg(numb->value.numb, numb->value.numb); } void numb_abs(Numb* numb) { assert(numb_is_valid(numb)); mpq_abs(numb->value.numb, numb->value.numb); } void numb_sgn(Numb* numb) { assert(numb_is_valid(numb)); /*lint -e(634) Strong type mismatch (type 'Bool') in equality or conditional */ switch(mpq_sgn(numb->value.numb)) { case -1 : mpq_set(numb->value.numb, const_minus_one); break; case 0 : mpq_set(numb->value.numb, const_zero); break; case 1 : mpq_set(numb->value.numb, const_one); break; default : abort(); } } int numb_get_sgn(const Numb* numb) { assert(numb_is_valid(numb)); return mpq_sgn(numb->value.numb); //lint !e633 !e634 strong type mismatch } void numb_round(Numb* numb) { mpz_t q; mpq_t h; assert(numb_is_valid(numb)); mpz_init(q); mpq_init(h); mpq_set_d(h, 0.5); if (mpq_sgn(numb->value.numb) >= 0) //lint !e633 !e634 !e638 strong type mismatch mpq_add(numb->value.numb, numb->value.numb, h); else mpq_sub(numb->value.numb, numb->value.numb, h); mpz_tdiv_q(q, mpq_numref(numb->value.numb), mpq_denref(numb->value.numb)); mpq_set_z(numb->value.numb, q); mpz_clear(q); mpq_clear(h); } void numb_ceil(Numb* numb) { mpz_t q; assert(numb_is_valid(numb)); mpz_init(q); mpz_cdiv_q(q, mpq_numref(numb->value.numb), mpq_denref(numb->value.numb)); mpq_set_z(numb->value.numb, q); mpz_clear(q); } void numb_floor(Numb* numb) { mpz_t q; assert(numb_is_valid(numb)); mpz_init(q); mpz_fdiv_q(q, mpq_numref(numb->value.numb), mpq_denref(numb->value.numb)); mpq_set_z(numb->value.numb, q); mpz_clear(q); } Numb* numb_new_log(const Numb* numb) { char temp[256]; double d; assert(numb_is_valid(numb)); d = log10(mpq_get_d(numb->value.numb)); /* !finite == !isfinite == isnan || isinf */ if ((d != d) || (d == -HUGE_VAL)) /*lint !e777 */ /* == isnan(d) || isinf(d) */ { sprintf(temp, "*** Error 700: log(%f)", mpq_get_d(numb->value.numb)); perror(temp); return NULL; } sprintf(temp, "%.16e", d); return numb_new_ascii(temp); } Numb* numb_new_sqrt(const Numb* numb) { char temp[256]; double d; assert(numb_is_valid(numb)); d = sqrt(mpq_get_d(numb->value.numb)); /* !finite == !isfinite == isnan || isinf */ if (d != d) /*lint !e777 */ /* == isnan(d) || isinf(d) */ { sprintf(temp, "*** Error 701: sqrt(%f)", mpq_get_d(numb->value.numb)); perror(temp); return NULL; } sprintf(temp, "%.16e", d); return numb_new_ascii(temp); } Numb* numb_new_exp(const Numb* numb) { char temp[32]; assert(numb_is_valid(numb)); sprintf(temp, "%.16e", exp(mpq_get_d(numb->value.numb))); return numb_new_ascii(temp); } Numb* numb_new_ln(const Numb* numb) { char temp[256]; double d; assert(numb_is_valid(numb)); d = log(mpq_get_d(numb->value.numb)); /* !finite == !isfinite == isnan || isinf */ if ((d != d) || (d == -HUGE_VAL)) /*lint !e777 */ /* == isnan(d) || isinf(d) */ { sprintf(temp, "*** Error 702: ln(%f)", mpq_get_d(numb->value.numb)); perror(temp); return NULL; } sprintf(temp, "%.16e", d); return numb_new_ascii(temp); } Numb* numb_new_rand(const Numb* mini, const Numb* maxi) { Numb* numb = numb_new(); mpq_t maxint; mpq_t factor; assert(numb != NULL); assert(numb_is_valid(mini)); assert(numb_is_valid(maxi)); assert(numb_cmp(mini, maxi) <= 0); mpq_init(factor); mpq_init(maxint); mpq_set_ui(numb->value.numb, rand_get_int32(), 1); mpq_set_ui(maxint, 4294967295UL, 1); mpq_div(numb->value.numb, numb->value.numb, maxint); mpq_sub(factor, maxi->value.numb, mini->value.numb); mpq_mul(numb->value.numb, numb->value.numb, factor); mpq_add(numb->value.numb, numb->value.numb, mini->value.numb); mpq_clear(factor); mpq_clear(maxint); return numb; } double numb_todbl(const Numb* numb) { assert(numb_is_valid(numb)); return mpq_get_d(numb->value.numb); } void numb_get_mpq(const Numb* numb, mpq_t value) { assert(numb_is_valid(numb)); mpq_set(value, numb->value.numb); } void numb_print(FILE* fp, const Numb* numb) { assert(numb_is_valid(numb)); fprintf(fp, "%.16g", mpq_get_d(numb->value.numb)); } unsigned int numb_hash(const Numb* numb) { union { struct { unsigned int a; unsigned int b; } i; double d; } d2i; unsigned int hcode; d2i.d = mpq_get_d(numb->value.numb); hcode = d2i.i.a ^ d2i.i.b; return hcode; } char* numb_tostr(const Numb* numb) { char* str; assert(numb_is_valid(numb)); str = malloc(32); assert(str != NULL); sprintf(str, "%.16g", mpq_get_d(numb->value.numb)); return str; } const Numb* numb_zero() { return numb_const_zero; } const Numb* numb_one() { return numb_const_one; } const Numb* numb_minusone() { return numb_const_minusone; } const Numb* numb_unknown() { return numb_const_unknown; } bool numb_is_int(const Numb* numb) { /* Do we have an integer ? */ if (mpz_get_si(mpq_denref(numb->value.numb)) == 1) { /* And is it small enough ? */ if (mpz_fits_sint_p(mpq_numref(numb->value.numb)) == 1) return true; } return false; } int numb_toint(const Numb* numb) { assert(numb_is_valid(numb)); assert(numb_is_int(numb)); return (int)mpz_get_si(mpq_numref(numb->value.numb)); } bool numb_is_number(const char *s) { /* 5 !*/ if (isdigit(*s)) return true; /* maybe -5 or .6 or -.7 ? */ if (*s != '+' && *s != '-' && *s != '.') return false; s++; /* -5 or .6 ! */ if (isdigit(*s)) return true; /* maybe -.7 ? */ if (*s != '.') return false; s++; return isdigit(*s); } zimpl-3.3.6/src/zimpl/code.h0000644001417200060250000003005513304236715015571 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: code.h */ /* Name....: Code Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _CODE_H_ #define _CODE_H_ #ifndef _RATLPTYPES_H_ #error "Need to include ratlptypes.h before code.h" #endif #ifndef _MME_H_ #error "Need to include mme.h before code.h" #endif #ifdef __cplusplus extern "C" { #endif /*lint -sem( code_new_inst, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern CodeNode* code_new_inst(Inst inst, int childs, ...); /*lint -sem( code_new_numb, custodial(1), 1p == 1, @P > malloc(1P)) */ extern CodeNode* code_new_numb(Numb* numb); /*lint -sem( code_new_strg, nulterm(1), 1p, @P > malloc(1P)) */ extern CodeNode* code_new_strg(const char* strg); /*lint -sem( code_new_name, nulterm(1), 1p, @P > malloc(1P)) */ extern CodeNode* code_new_name(const char* name); /*lint -sem( code_new_size, @P > malloc(1P)) */ extern CodeNode* code_new_size(int size); /*lint -sem( code_new_varclass, @P > malloc(1P)) */ extern CodeNode* code_new_varclass(VarClass varclass); /*lint -sem( code_new_contype, @P > malloc(1P)) */ extern CodeNode* code_new_contype(ConType contype); /*lint -sem( code_new_bits, @P > malloc(1P)) */ extern CodeNode* code_new_bits(unsigned int bits); /*lint -sem( code_new_symbol, @P > malloc(1P)) */ extern CodeNode* code_new_symbol(Symbol* sym); /*lint -sem( code_new_define, @P > malloc(1P)) */ extern CodeNode* code_new_define(Define* def); /*lint -sem( code_new_bound, @P > malloc(1P)) */ extern CodeNode* code_new_bound(BoundType type); /*lint -sem( code_free, custodial(1), 1p == 1) */ extern void code_free(CodeNode* node); /*lint -sem( code_free_value, @P > malloc(1P)) */ extern void code_free_value(CodeNode* node); /*lint -sem( code_is_valid, 1p == 1) */ extern bool code_is_valid(const CodeNode* node); /*lint -sem( code_get_type, 1p == 1) */ extern CodeType code_get_type(const CodeNode* node); /*lint -sem( code_get_inst, 1p == 1, @p) */ extern Inst code_get_inst(const CodeNode* node); /*lint -sem( code_set_root, custodial(1), 1p == 1) */ extern void code_set_root(CodeNode* node); /*lint -sem( code_get_root, @P > malloc(1P)) */ extern CodeNode* code_get_root(void); /*lint -sem( code_set_child, custodial(3), 1p == 1 && 2n >= 0 && 3p == 1) */ extern void code_set_child(CodeNode* node, int idx, CodeNode* child); /*lint -sem( code_errmsg, 1p == 1) */ extern void code_errmsg(const CodeNode* node); #if 0 /*lint -sem( code_check_type, 1p == 1, @P > malloc(1P)p) */ extern CodeNode* code_check_type(CodeNode* node, CodeType expected); #endif /*lint -sem( code_eval, 1p == 1, @P > malloc(1P)p) */ extern CodeNode* code_eval(CodeNode* node); /*lint -sem( code_prune_tree, 1p == 1) */ extern bool code_prune_tree(CodeNode* node); /*lint -sem( code_get_child, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern CodeNode* code_get_child(const CodeNode* node, int no); /*lint -sem( code_get_numb, 1p == 1) */ extern const Numb* code_get_numb(CodeNode* node); /*lint -sem( code_get_strg, 1p == 1, @p && nulterm(@)) */ extern const char* code_get_strg(CodeNode* node); /*lint -sem( code_get_name, 1p == 1, @p && nulterm(@)) */ extern const char* code_get_name(CodeNode* node); extern unsigned int code_get_inst_count(void); /*lint -sem( code_get_tuple, 1p == 1, @P > malloc(1P)) */ extern void code_clear_inst_count(void); extern const Tuple* code_get_tuple(CodeNode* node); /*lint -sem( code_get_set, 1p == 1, @P > malloc(1P)) */ extern const Set* code_get_set(CodeNode* node); /*lint -sem( code_get_idxset, 1p == 1, @P > malloc(1P)) */ extern const IdxSet* code_get_idxset(CodeNode* node); /*lint -sem( code_get_entry, 1p == 1, @P > malloc(1P)) */ extern const Entry* code_get_entry(CodeNode* node); /*lint -sem( code_get_term, 1p == 1, @P > malloc(1P)) */ extern const Term* code_get_term(CodeNode* node); /*lint -sem( code_get_size, 1p == 1) */ extern int code_get_size(CodeNode* node); /*lint -sem( code_get_bool, 1p == 1) */ extern bool code_get_bool(CodeNode* node); /*lint -sem( code_get_list, 1p == 1, @P > malloc(1P)) */ extern const List* code_get_list(CodeNode* node); /*lint -sem( code_get_varclass, 1p == 1) */ extern VarClass code_get_varclass(CodeNode* node); /*lint -sem( code_get_contype, 1p == 1) */ extern ConType code_get_contype(CodeNode* node); /*lint -sem( code_get_rdef, 1p == 1, @P > malloc(1P)) */ extern const RDef* code_get_rdef(CodeNode* node); /*lint -sem( code_get_rpar, 1p == 1, @P > malloc(1P)) */ extern const RPar* code_get_rpar(CodeNode* node); /*lint -sem( code_get_bits, 1p == 1) */ extern unsigned int code_get_bits(CodeNode* node); /*lint -sem( code_get_symbol, 1p == 1) */ extern Symbol* code_get_symbol(CodeNode* node); /*lint -sem( code_get_define, 1p == 1) */ extern Define* code_get_define(CodeNode* node); /*lint -sem( code_get_bound, 1p == 1) */ extern const Bound* code_get_bound(CodeNode* node); /*lint -sem( code_value_numb, custodial(2), 1p == 1) */ extern void code_value_numb(CodeNode* node, Numb* numb); /*lint -sem( code_value_strg, nulterm(2), 1p == 1 && 2p) */ extern void code_value_strg(CodeNode* node, const char* strg); /*lint -sem( code_value_name, nulterm(2), 1p == 1 && 2p) */ extern void code_value_name(CodeNode* node, const char* name); /*lint -sem( code_value_tuple, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_tuple(CodeNode* node, Tuple* tuple); /*lint -sem( code_value_set, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_set(CodeNode* node, Set* set); /*lint -sem( code_value_idxset, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_idxset(CodeNode* node, IdxSet* idxset); /*lint -sem( code_value_entry, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_entry(CodeNode* node, Entry* entry); /*lint -sem( code_value_term, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_term(CodeNode* node, Term* term); /*lint -sem( code_value_steal_child_term, 1p == 1 && 2n >= 0, @P > malloc(1P)p) */ extern Term* code_value_steal_term(CodeNode* node, int no); /*lint -sem( code_value_bool, 1p == 1) */ extern void code_value_bool(CodeNode* node, bool bvalue); /*lint -sem( code_value_size, 1p == 1) */ extern void code_value_size(CodeNode* node, int size); /*lint -sem( code_value_list, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_list(CodeNode* node, List* list); /*lint -sem( code_value_varclass, 1p == 1) */ extern void code_value_varclass(CodeNode* node, VarClass varclass); /*lint -sem( code_value_contype, 1p == 1) */ extern void code_value_contype(CodeNode* node, ConType contype); /*lint -sem( code_value_rdef, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_rdef(CodeNode* node, RDef* rdef); /*lint -sem( code_value_rpar, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_rpar(CodeNode* node, RPar* rpar); /*lint -sem( code_value_bits, 1p == 1) */ extern void code_value_bits(CodeNode* node, unsigned int bits); /*lint -sem( code_value_bound, custodial(2), 1p == 1 && 2p == 1) */ extern void code_value_bound(CodeNode* node, Bound* bound); /*lint -sem( code_value_void, 1p == 1) */ extern void code_value_void(CodeNode* node); /*lint -sem( code_copy_value, 1p == 1 && 2p == 1) */ extern void code_copy_value(CodeNode* dst, const CodeNode* src); /*lint -sem( code_eval_child, 1p == 1 && 2n >= 0, @P > malloc(1P)p) */ extern CodeNode* code_eval_child(const CodeNode* node, int no); /*lint -sem( code_eval_child_numb, 1p == 1 && 2n >= 0) */ extern const Numb* code_eval_child_numb(const CodeNode* node, int no); /*lint -sem( char* code_eval_child_strg, 1p == 1 && 2n >= 0, @p && nulterm(@)) */ extern const char* code_eval_child_strg(const CodeNode* node, int no); /*lint -sem( code_eval_child_name, 1p == 1 && 2n >= 0, @p && nulterm(@)) */ extern const char* code_eval_child_name(const CodeNode* node, int no); /*lint -sem( code_eval_child_tuple, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Tuple* code_eval_child_tuple(const CodeNode* node, int no); /*lint -sem( code_eval_child_set, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Set* code_eval_child_set(const CodeNode* node, int no); /*lint -sem( code_eval_child_idxset, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const IdxSet* code_eval_child_idxset(const CodeNode* node, int no); /*lint -sem( code_eval_child_entry, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Entry* code_eval_child_entry(const CodeNode* node, int no); /*lint -sem( code_eval_child_term, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Term* code_eval_child_term(const CodeNode* node, int no); /*lint -sem( code_eval_child_size, 1p == 1 && 2n >= 0, @n >= 0) */ extern int code_eval_child_size(const CodeNode* node, int no); /*lint -sem( code_eval_child_bool, 1p == 1 && 2n >= 0) */ extern bool code_eval_child_bool(const CodeNode* node, int no); /*lint -sem( code_eval_child_list, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const List* code_eval_child_list(const CodeNode* node, int no); /*lint -sem( code_eval_child_varclass, 1p == 1 && 2n >= 0) */ extern VarClass code_eval_child_varclass(const CodeNode* node, int no); /*lint -sem( code_eval_child_contype, 1p == 1 && 2n >= 0) */ extern ConType code_eval_child_contype(const CodeNode* node, int no); /*lint -sem( code_eval_child_rdef, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const RDef* code_eval_child_rdef(const CodeNode* node, int no); /*lint -sem( code_eval_child_rpar, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const RPar* code_eval_child_rpar(const CodeNode* node, int no); /*lint -sem( code_eval_child_bits, 1p == 1 && 2n >= 0) */ extern unsigned int code_eval_child_bits(const CodeNode* node, int no); /*lint -sem( code_eval_child_symbol, 1p == 1 && 2n >= 0) */ extern Symbol* code_eval_child_symbol(const CodeNode* node, int no); /*lint -sem( code_eval_child_define, 1p == 1 && 2n >= 0) */ extern Define* code_eval_child_define(const CodeNode* node, int no); /*lint -sem( code_eval_child_bound, 1p == 1 && 2n >= 0) */ extern const Bound* code_eval_child_bound(const CodeNode* node, int no); #ifdef __cplusplus } #endif #endif /* _CODE_H_ */ zimpl-3.3.6/src/zimpl/setempty.c0000644001417200060250000001577113304236715016534 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: setempty.c */ /* Name....: Set Empty Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/hash.h" #include "zimpl/set.h" #include "zimpl/set4.h" #ifdef _MSC_VER #pragma warning (disable: 4100) /* unreferenced formal parameter */ #endif #define SET_EMPTY_SID 0x5345544f #define SET_EMPTY_ITER_SID 0x53454f49 /* ------------------------------------------------------------------------- * --- valid * ------------------------------------------------------------------------- */ static bool set_empty_is_valid(const Set* set) { return set != NULL && SID_ok2(set->empty, SET_EMPTY_SID) && set->head.refc > 0 && set->head.members == 0; } static bool set_empty_iter_is_valid(const SetIter* iter) { return iter != NULL && SID_ok2(iter->empty, SET_EMPTY_ITER_SID); } /* ------------------------------------------------------------------------- * --- set_new * ------------------------------------------------------------------------- */ Set* set_empty_new(int dim) { Set* set; set = calloc(1, sizeof(*set)); assert(set != NULL); set->head.refc = 1; set->head.dim = dim; set->head.members = 0; set->head.type = SET_EMPTY; SID_set2(set->empty, SET_EMPTY_SID); assert(set_empty_is_valid(set)); return set; } /* ------------------------------------------------------------------------- * --- copy * ------------------------------------------------------------------------- */ static Set* set_empty_copy(const Set* source) { Set* set = (Set*)source; set->head.refc++; return set; } /* ------------------------------------------------------------------------- * --- set_free * ------------------------------------------------------------------------- */ static void set_empty_free(Set* set) { assert(set_empty_is_valid(set)); set->head.refc--; if (set->head.refc == 0) { SID_del2(set->empty); free(set); } } /* ------------------------------------------------------------------------- * --- lookup * ------------------------------------------------------------------------- */ /* Return index number of element. -1 if not present */ /*ARGSUSED*/ static SetIterIdx set_empty_lookup_idx(const Set* set, const Tuple* tuple, int offset) { assert(set_empty_is_valid(set)); assert(tuple_is_valid(tuple)); assert(offset >= 0); return -1; } /* ------------------------------------------------------------------------- * --- get_tuple * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static NORETURN void set_empty_get_tuple( const Set* set, SetIterIdx idx, Tuple* tuple, int offset) { assert(set_empty_is_valid(set)); assert(idx >= 0); assert(idx <= set->head.members); assert(tuple_is_valid(tuple)); assert(offset >= 0); assert(offset + set->head.dim <= tuple_get_dim(tuple)); fprintf(stderr, "internal_error: set_empty_get_tuple called\n"); abort(); } /* ------------------------------------------------------------------------- * --- iter_init * ------------------------------------------------------------------------- */ /* Initialise Iterator. Write into iter */ /*ARGSUSED*/ static SetIter* iter_init( const Set* set, const Tuple* pattern, int offset) { SetIter* iter; assert(set_empty_is_valid(set)); assert(pattern == NULL || tuple_is_valid(pattern)); assert(offset == 0); iter = calloc(1, sizeof(*iter)); assert(iter != NULL); SID_set2(iter->empty, SET_EMPTY_ITER_SID); assert(set_empty_iter_is_valid(iter)); return iter; } /* ------------------------------------------------------------------------- * --- iter_next * ------------------------------------------------------------------------- */ /* false means, there is no further element */ /*ARGSUSED*/ static bool iter_next( SetIter* iter, const Set* set, UNUSED Tuple* tuple, UNUSED int offset) { assert(set_empty_iter_is_valid(iter)); assert(set_empty_is_valid(set)); return false; } /* ------------------------------------------------------------------------- * --- iter_exit * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void iter_exit(SetIter* iter, UNUSED const Set* set) { assert(set_empty_iter_is_valid(iter)); SID_del2(iter->empty); free(iter); } /* ------------------------------------------------------------------------- * --- iter_reset * ------------------------------------------------------------------------- */ /*ARGSUSED*/ static void iter_reset(SetIter* iter, UNUSED const Set* set) { assert(set_empty_iter_is_valid(iter)); } /* ------------------------------------------------------------------------- * --- vtab_init * ------------------------------------------------------------------------- */ void set_empty_init(SetVTab* vtab) { vtab[SET_EMPTY].set_copy = set_empty_copy; vtab[SET_EMPTY].set_free = set_empty_free; vtab[SET_EMPTY].set_lookup_idx = set_empty_lookup_idx; vtab[SET_EMPTY].set_get_tuple = set_empty_get_tuple; vtab[SET_EMPTY].iter_init = iter_init; vtab[SET_EMPTY].iter_next = iter_next; vtab[SET_EMPTY].iter_exit = iter_exit; vtab[SET_EMPTY].iter_reset = iter_reset; vtab[SET_EMPTY].set_is_valid = set_empty_is_valid; } zimpl-3.3.6/src/zimpl/bound.c0000644001417200060250000000627113304236715015764 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: bound.c */ /* Name....: Bound value */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/mme.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #define BOUND_SID 0x426F756E struct bound { SID BoundType type; Numb* value; }; Bound* bound_new(BoundType type, const Numb* value) { Bound* bound = calloc(1, sizeof(*bound)); assert(bound != NULL); bound->type = type; if (bound->type == BOUND_VALUE) { assert(value != NULL); bound->value = numb_copy(value); } SID_set(bound, BOUND_SID); assert(bound_is_valid(bound)); return bound; } void bound_free(Bound* bound) { assert(bound_is_valid(bound)); if (bound->type == BOUND_VALUE) numb_free(bound->value); SID_del(bound); free(bound); } bool bound_is_valid(const Bound* bound) { if (bound == NULL || !SID_ok(bound, BOUND_SID) || (bound->type == BOUND_VALUE && bound->value == NULL) || (bound->type != BOUND_VALUE && bound->value != NULL)) return false; mem_check(bound); return true; } Bound* bound_copy(const Bound* source) { assert(bound_is_valid(source)); return bound_new(source->type, source->value); } BoundType bound_get_type(const Bound* bound) { assert(bound_is_valid(bound)); return bound->type; } const Numb* bound_get_value(const Bound* bound) { assert(bound_is_valid(bound)); assert(bound->type == BOUND_VALUE); return bound->value; } void bound_print(FILE* fp, const Bound* bound) { switch(bound->type) { case BOUND_INFTY : fprintf(fp, "oo"); break; case BOUND_MINUS_INFTY : fprintf(fp, "-oo"); break; case BOUND_VALUE : numb_print(fp, bound->value); break; default : abort(); } } zimpl-3.3.6/src/zimpl/idxset.h0000644001417200060250000000556213304236715016164 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: idxset.h */ /* Name....: IndexSet Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _IDXSET_H_ #define _IDXSET_H_ #ifndef _TUPLE_H_ #error "Need to include tuple.h before idxset.h" #endif #ifndef _SET_H_ #error "Need to include set.h before idxset.h" #endif #ifdef __cplusplus extern "C" { #endif typedef struct index_set IdxSet; /* idxset.c */ /*lint -sem( idxset_new, 1p == 1 && 2p == 1 && 3p == 1, @P > malloc(1P)) */ extern IdxSet* idxset_new( const Tuple* tuple, const Set* set, CodeNode* lexpr, bool is_unrestricted); /*lint -sem( idxset_free, custodial(1), 1p == 1) */ extern void idxset_free(IdxSet* idxset); /*lint -sem( idxset_is_valid, 1p == 1) */ extern bool idxset_is_valid(const IdxSet* idxset); /*lint -sem( idxset_copy, 1p == 1, @P > malloc(1P)) */ extern IdxSet* idxset_copy(const IdxSet* source); /*lint -sem( idxset_get_lexpr, 1p == 1, @P > malloc(1P)) */ extern CodeNode* idxset_get_lexpr(const IdxSet* idxset); /*lint -sem( idxset_get_tuple, 1p == 1, @P > malloc(1P)) */ extern const Tuple* idxset_get_tuple(const IdxSet* idxset); /*lint -sem( idxset_get_set, 1p == 1, @P > malloc(1P)) */ extern const Set* idxset_get_set(const IdxSet* idxset); /*lint -sem( idxset_is_unrestricted, 1p == 1) */ extern bool idxset_is_unrestricted(const IdxSet* idxset); /*lint -sem( idxset_print, 1p == 1 && 2p == 1) */ extern void idxset_print(FILE* fp, const IdxSet* idxset); #ifdef __cplusplus } #endif #endif /* _IDXSET_H_ */ zimpl-3.3.6/src/zimpl/conname.c0000644001417200060250000000733213304236715016274 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: conname.c */ /* Name....: Constraint Names */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/mme.h" #include "zimpl/bound.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/local.h" #include "zimpl/stmt.h" #include "zimpl/prog.h" #include "zimpl/xlpglue.h" #include "zimpl/conname.h" static char* cpfix = NULL; static int count = 1; static char* cname = NULL; static size_t clen = 0; static ConNameForm cform = CON_FORM_NAME; void conname_format(ConNameForm format) { cform = format; } void conname_free() { assert(cname != NULL); assert(cpfix != NULL); free(cname); free(cpfix); cname = NULL; clen = 0; } /* return False if we are in mode CON_FORM_NAME and * already a constraint with the prefix exists. Otherwise this * is unimportant, because all constraints will get a unique * number anyway. */ bool conname_set(const char* prefix) { assert(prefix != NULL); assert(cname == NULL); cpfix = strdup(prefix); clen = strlen(cpfix) + 16; cname = malloc(clen); assert(cname != NULL); if (cform != CON_FORM_NAME) return true; assert(cform == CON_FORM_NAME); count = 1; strcpy(cname, cpfix); strcat(cname, "_1"); if (xlp_conname_exists(prog_get_lp(), cname)) return false; strcat(cname, "_a_0"); return !xlp_conname_exists(prog_get_lp(), cname); } const char* conname_get() { char* localstr; size_t newlen; assert(cpfix != NULL); assert(cname != NULL); switch(cform) { case CON_FORM_MAKE : sprintf(cname, "c%d", count); break; case CON_FORM_NAME : sprintf(cname, "%s_%d", cpfix, count); break; case CON_FORM_FULL : localstr = local_tostrall(); newlen = strlen(localstr) + strlen(cpfix) + 16; if (newlen > clen) { clen = newlen; cname = realloc(cname, clen); assert(cname != NULL); } sprintf(cname, "%s_%s%s", cpfix, strlen(localstr) > 0 ? ";" : "", localstr); free(localstr); break; } assert(strlen(cname) < clen); return cname; } void conname_next() { count++; } zimpl-3.3.6/src/zimpl/zlpglue.h0000644001417200060250000000447313304236715016346 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: zlpglue.h */ /* Name....: Glue between Zimpl command line and ratlp */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _ZLPGLUE_H_ #define _ZLPGLUE_H_ #ifndef _RATLPTYPES_H_ #error "Need to include ratlptypes.h before xlpglue.h" #endif #ifdef __cplusplus extern "C" { #endif /*lint -sem( zlp_stat, 1p == 1) */ extern void zlp_stat(Lps* lp); /*lint -sem( zlp_setnamelen, 1p ==1 && 2n >= 0) */ extern void zlp_setnamelen(Lps* lp, int name_len); /*lint -sem( zlp_write, 1p == 1 && 2p == 1 && nulterm(4)) */ extern void zlp_write(Lps* lp, FILE* fp, LpFormat format, const char* title); /*lint -sem( zlp_transtable, 1p == 1 && 2p == 1) */ extern void zlp_transtable(Lps* lp, FILE* fp, LpFormat format); /*lint -sem( zlp_orderfile, 1p == 1 && 2p == 1) */ extern void zlp_orderfile(Lps* lp, FILE* fp, LpFormat format); /*lint -sem( zlp_mstfile, 1p == 1 && 2p == 1) */ extern void zlp_mstfile(Lps* lp, FILE* fp, LpFormat format); #ifdef __cplusplus } #endif #endif /* _ZLPGLUE_H */ zimpl-3.3.6/src/zimpl/define.c0000644001417200060250000000746513304236715016115 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: define.c */ /* Name....: Define Table Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/define.h" #define DEFINE_SID 0x44656669 struct define { SID const char* name; DefineType type; Tuple* param; CodeNode* code; Define* next; }; #ifndef NDEBUG static Define anchor = { 0, "", DEF_ERR, NULL, NULL, NULL }; #else static Define anchor = { "", DEF_ERR, NULL, NULL, NULL }; #endif static bool define_is_valid(const Define* def) { if (def == NULL || !SID_ok(def, DEFINE_SID)) return false; mem_check(def); return true; } Define* define_new( const char* name, DefineType type) { Define* def; assert(name != NULL); assert(strlen(name) > 0); assert(type != DEF_ERR); def = calloc(1, sizeof(*def)); assert(def != NULL); def->name = name; def->type = type; def->param = NULL; def->code = NULL; def->next = anchor.next; anchor.next = def; SID_set(def, DEFINE_SID); assert(define_is_valid(def)); return def; } void define_set_param( Define* def, Tuple* param) { assert(define_is_valid(def)); assert(tuple_is_valid(param)); def->param = param; } void define_set_code( Define* def, CodeNode* code) { assert(define_is_valid(def)); assert(code != NULL); def->code = code; } void define_exit(void) { Define* q; Define* p; for(p = anchor.next; p != NULL; p = q) { assert(define_is_valid(p)); SID_del(p); tuple_free(p->param); q = p->next; free(p); } anchor.next = NULL; } Define* define_lookup(const char* name) { Define* def; assert(name != NULL); for(def = anchor.next; def != NULL; def = def->next) if (!strcmp(def->name, name)) break; return def; } const char* define_get_name(const Define* def) { assert(define_is_valid(def)); return def->name; } DefineType define_get_type(const Define* def) { assert(define_is_valid(def)); return def->type; } const Tuple* define_get_param(const Define* def) { assert(define_is_valid(def)); return def->param; } CodeNode* define_get_code(const Define* def) { assert(define_is_valid(def)); return def->code; } zimpl-3.3.6/src/zimpl/bound.h0000644001417200060250000000503313304236715015764 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: bound.h */ /* Name....: Bound value */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _BOUND_H_ #define _BOUND_H_ #ifndef _NUMB_H_ #error "Need to include numb.h before bound.h" #endif #ifdef __cplusplus extern "C" { #endif enum bound_type { BOUND_ERROR = 0, BOUND_VALUE, BOUND_INFTY, BOUND_MINUS_INFTY }; typedef enum bound_type BoundType; typedef struct bound Bound; /*lint -sem( bound_new, @P > malloc(1P)) */ extern Bound* bound_new(BoundType type, const Numb* value); /*lint -sem( bound_free, custodial(1), 1p == 1) */ extern void bound_free(Bound* bound); /*lint -sem( bound_is_valid, 1p == 1) */ extern bool bound_is_valid(const Bound* bound); /*lint -sem( bound_copy, 1p == 1, @P > malloc(1P)) */ extern Bound* bound_copy(const Bound* source); /*lint -sem( bound_get_type, 1p == 1) */ extern BoundType bound_get_type(const Bound* bound); /*lint -sem( bound_get_value, 1p == 1) */ extern const Numb* bound_get_value(const Bound* bound); /*lint -sem( bound_print, 1p == 1 && 2p == 1) */ extern void bound_print(FILE* fp, const Bound* bound); #ifdef __cplusplus } #endif #endif /* _BOUND_H_ */ zimpl-3.3.6/src/zimpl/numbdbl.c0000644001417200060250000003242013304236715016273 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: numbdbl.c */ /* Name....: Number Functions using double */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include /* #define TRACE 1 */ #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/random.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/mme.h" #define NUMB_STORE_SIZE 1000 #define NUMB_SID 0x4e756d62 typedef struct numb_storage NumbStore; /* Note: In case of gmt use refc and infinity indicator. */ struct number { SID union { double numb; Numb* next; } value; }; struct numb_storage { Numb* begin; NumbStore* next; }; static NumbStore* store_anchor = NULL; static Numb* store_free = NULL; static int store_count = 0; /* constants */ static Numb* numb_const_zero = NULL; static Numb* numb_const_one = NULL; static Numb* numb_const_minusone = NULL; static void genrand_init(unsigned long s); static unsigned long genrand_int32(void); static void extend_storage(void) { NumbStore* store = calloc(1, sizeof(*store)); Numb* numb; int i; assert(store != NULL); store->begin = malloc(NUMB_STORE_SIZE * sizeof(*store->begin)); store->next = store_anchor; store_anchor = store; for(i = 0; i < NUMB_STORE_SIZE - 1; i++) { numb = &store->begin[i]; numb->value.next = &store->begin[i + 1]; SID_set(numb, NUMB_SID); assert(numb_is_valid(numb)); } numb = &store->begin[i]; numb->value.next = store_free; SID_set(numb, NUMB_SID); assert(numb_is_valid(numb)); store_free = &store->begin[0]; assert(store->begin != NULL); assert(store_anchor != NULL); assert(store_free != NULL); } void numb_init(bool with_management) { store_anchor = NULL; store_free = NULL; numb_const_zero = numb_new(); numb_const_one = numb_new_integer(1); numb_const_minusone = numb_new_integer(-1); } void numb_exit() { NumbStore* store; NumbStore* next; numb_free(numb_const_zero); numb_free(numb_const_one); numb_free(numb_const_minusone); numb_const_zero = NULL; numb_const_one = NULL; numb_const_minusone = NULL; if (store_count != 0) printf("Numb store count %d\n", store_count); for(store = store_anchor; store != NULL; store = next) { next = store->next; free(store->begin); free(store); } store_anchor = NULL; store_free = NULL; store_count = 0; } /* value is zero */ Numb* numb_new(void) { Numb* numb; Trace("numb_new"); if (store_free == NULL) extend_storage(); assert(store_free != NULL); numb = store_free; store_free = numb->value.next; store_count++; numb->value.numb = 0.0; return numb; } Numb* numb_new_ascii(const char* val) { Numb* numb = numb_new(); assert(numb != NULL); numb->value.numb = atof(val); return numb; } Numb* numb_new_integer(int val) { Numb* numb = numb_new(); assert(numb != NULL); numb->value.numb = val; return numb; } void numb_free(Numb* numb) { Trace("numb_free"); assert(numb_is_valid(numb)); numb->value.next = store_free; store_free = numb; store_count--; } bool numb_is_valid(const Numb* numb) { return numb != NULL && SID_ok(numb, NUMB_SID); } Numb* numb_copy(const Numb* source) { Numb* numb = numb_new(); assert(numb_is_valid(source)); assert(numb_is_valid(numb)); numb->value.numb = source->value.numb; return numb; } /* true wenn gleich, sonst false */ /* ??? This not the same as with gmp :-) */ bool numb_equal(const Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); return numb_a->value.numb == numb_b->value.numb; } /* Return a positive value if op1 > op2, zero if op1 = op2, and a negative value if op1 < op2 */ int numb_cmp(const Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); if (numb_a->value.numb > numb_b->value.numb) return 1; if (numb_a->value.numb < numb_b->value.numb) return -1; return 0; } void numb_set(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb = numb_b->value.numb; } void numb_add(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb += numb_b->value.numb; } Numb* numb_new_add(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = numb_a->value.numb + numb_b->value.numb; return numb; } void numb_sub(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb -= numb_b->value.numb; } Numb* numb_new_sub(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = numb_a->value.numb - numb_b->value.numb; return numb; } void numb_mul(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb *= numb_b->value.numb; } Numb* numb_new_mul(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = numb_a->value.numb * numb_b->value.numb; return numb; } void numb_div(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb /= numb_b->value.numb; } Numb* numb_new_div(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = numb_a->value.numb / numb_b->value.numb; return numb; } void numb_intdiv(Numb* numb_a, const Numb* numb_b) { double q; assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb = trunc(numb_a->value.numb / numb_b->value.numb); } Numb* numb_new_intdiv(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = trunc(numb_a->value.numb / numb_b->value.numb); return numb; } void numb_mod(Numb* numb_a, const Numb* numb_b) { assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb_a->value.numb = fmod(numb_a->value.numb, numb_b->value.numb); } Numb* numb_new_mod(const Numb* numb_a, const Numb* numb_b) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); assert(numb_is_valid(numb_b)); numb->value.numb = fmod(numb_a->value.numb, numb_b->value.numb); return numb; } Numb* numb_new_pow(const Numb* base, int expo) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(base)); numb->value.numb = pow(base->value.numb, expo); return numb; } Numb* numb_new_fac(int n) { Numb* numb = numb_new(); int i; assert(numb != NULL); assert(n >= 0); numb->value.numb = 1; for(i = 2; i <= n; i++) numb->value.numb *= i; return numb; } void numb_neg(Numb* numb) { assert(numb_is_valid(numb)); numb->value.numb *= -1.0; } void numb_abs(Numb* numb) { assert(numb_is_valid(numb)); numb->value.numb = fabs(numb->value.numb); } void numb_sgn(Numb* numb) { assert(numb_is_valid(numb)); if (numb->value.numb < 0.0) numb->value.numb = -1.0; else if (numb->value.numb > 0.0) numb->value.numb = 1.0; else numb->value.numb = 0.0; } int numb_get_sgn(const Numb* numb) { assert(numb_is_valid(numb)); if (numb->value.numb < 0.0) return -1; if (numb->value.numb > 0.0) return 1; return 0; } void numb_round(Numb* numb) { assert(numb_is_valid(numb)); if (numb->value.numb > 0.0) numb->value.numb = trunc(numb->value.numb + 0.5); else numb->value.numb = trunc(numb->value.numb - 0.5); } void numb_ceil(Numb* numb) { assert(numb_is_valid(numb)); numb->value.numb = ceil(numb->value.numb); } void numb_floor(Numb* numb) { assert(numb_is_valid(numb)); numb->value.numb = floor(numb->value.numb); } Numb* numb_new_log(const Numb* numb_a) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); numb->value.numb = log10(numb_a->value.numb); /* !finite == !isfinite == isnan || isinf */ if (numb->value.numb != numb->value.numb) { char temp[256]; sprintf(temp, "*** Error 700: log(%f)", numb_a->value.numb); perror(temp); return NULL; } return numb; } Numb* numb_new_sqrt(const Numb* numb_a) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); numb->value.numb = sqrt(numb_a->value.numb); /* !finite == !isfinite == isnan || isinf */ if (numb->value.numb != numb->value.numb) { char temp[256]; sprintf(temp, "*** Error 701: sqrt(%f)", numb_a->value.numb); perror(temp); return NULL; } return numb; } Numb* numb_new_exp(const Numb* numb_a) { char temp[32]; Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); numb->value.numb = exp(numb_a->value.numb); return numb; } Numb* numb_new_ln(const Numb* numb_a) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(numb_a)); numb->value.numb = log(numb_a->value.numb); /* !finite == !isfinite == isnan || isinf */ if (numb->value.numb != numb->value.numb) { char temp[256]; sprintf(temp, "*** Error 702: ln(%f)", numb->value.numb); perror(temp); return NULL; } return numb; } Numb* numb_new_rand(const Numb* mini, const Numb* maxi) { Numb* numb = numb_new(); assert(numb != NULL); assert(numb_is_valid(mini)); assert(numb_is_valid(maxi)); assert(numb_cmp(mini, maxi) <= 0); numb->value.numb = rand_get_int32(); numb->value.numb /= 4294967295.0; /* MAXINT */ numb->value.numb *= maxi->value.numb - mini->value.numb; numb->value.numb += mini->value.numb; return numb; } double numb_todbl(const Numb* numb) { assert(numb_is_valid(numb)); return numb->value.numb; } void numb_print(FILE* fp, const Numb* numb) { assert(numb_is_valid(numb)); fprintf(fp, "%.16g", numb->value.numb); } unsigned int numb_hash(const Numb* numb) { union { struct { unsigned int a; unsigned int b; } i; double d; } d2i; unsigned int hcode; d2i.d = numb->value.numb; hcode = d2i.i.a ^ d2i.i.b; return hcode; } char* numb_tostr(const Numb* numb) { char* str; assert(numb_is_valid(numb)); str = malloc(32); assert(str != NULL); sprintf(str, "%.16g", numb->value.numb); return str; } const Numb* numb_zero() { return numb_const_zero; } const Numb* numb_one() { return numb_const_one; } const Numb* numb_minusone() { return numb_const_minusone; } bool numb_is_int(const Numb* numb) { return numb->value.numb == (double)((int)numb->value.numb); } int numb_toint(const Numb* numb) { assert(numb_is_valid(numb)); assert(numb_is_int(numb)); return (int)numb->value.numb; } bool numb_is_number(const char *s) { /* 5 !*/ if (isdigit(*s)) return true; /* maybe -5 or .6 or -.7 ? */ if (*s != '+' && *s != '-' && *s != '.') return false; if (*s == '\0') return false; s++; /* -5 or .6 ! */ if (isdigit(*s)) return true; /* maybe -.7 ? */ if (*s != '.') return false; if (*s == '\0') return false; s++; return isdigit(*s); } zimpl-3.3.6/src/zimpl/numb.h0000644001417200060250000001577613304236715015635 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: numb.c */ /* Name....: Number Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _NUMB_H_ #define _NUMB_H_ typedef struct number Numb; /* numbgmp.c */ extern void numb_init(bool with_management); extern void numb_exit(void); /*lint -sem( numb_new, @P >= malloc(1)) */ extern Numb* numb_new(void); /*lint -sem( numb_new_ascii, nulterm(1), 1P >= 1, @P >= malloc(1)) */ extern Numb* numb_new_ascii(const char* val); /*lint -sem( numb_new_integer, @P >= malloc(1)) */ extern Numb* numb_new_integer(int val); /*lint -sem( numb_free, custodial(1), inout(1), cleanup, 1P >= 1) */ extern void numb_free(Numb* numb); /*lint -sem( numb_is_valid, pure, 1P >= 1) */ extern bool numb_is_valid(const Numb* numb); /*lint -sem( numb_copy, 1p == 1, @P >= malloc(1)) */ extern Numb* numb_copy(const Numb* source); /*lint -sem( numb_equal, pure, 1P >= 1, 2P >= 1) */ extern bool numb_equal(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_cmp, pure, 1P >= 1, 2P >= 1) */ extern int numb_cmp(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_set, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_set(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_add, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_add(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_add, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_add(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_sub, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_sub(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_sub, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_sub(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_mul, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_mul(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_mul, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_mul(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_div, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_div(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_div, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_div(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_intdiv, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_intdiv(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_intdiv, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_intdiv(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_pow, 1P >= 1, chneg(2), @P >= malloc(1)) */ extern Numb* numb_new_pow(const Numb* base, int expo); /*lint -sem( numb_new_fac, chneg(1), @P >= malloc(1)) */ extern Numb* numb_new_fac(int n); /*lint -sem( numb_mod, inout(1), 1P >= 1, 2P >= 1) */ extern void numb_mod(Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_new_mod, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_mod(const Numb* numb_a, const Numb* numb_b); /*lint -sem( numb_neg, inout(1), 1P >= 1) */ extern void numb_neg(Numb* numb); /*lint -sem( numb_abs, inout(1), 1P >= 1) */ extern void numb_abs(Numb* numb); /*lint -sem( numb_sgn, inout(1), 1P >= 1) */ extern void numb_sgn(Numb* numb); /*lint -sem( numb_get_sgn, 1P >= 1, @n >= -1 && @n <= 1) */ extern int numb_get_sgn(const Numb* numb); /*lint -sem( numb_round, inout(1), 1P >= 1) */ extern void numb_round(Numb* numb); /*lint -sem( numb_ceil, inout(1), 1P >= 1) */ extern void numb_ceil(Numb* numb); /*lint -sem( numb_floor, inout(1), 1P >= 1) */ extern void numb_floor(Numb* numb); /*lint -sem( numb_new_log, 1P >= 1, @P >= malloc(1) || @P == 0) */ extern Numb* numb_new_log(const Numb* numb); /*lint -sem( numb_new_sqrt, 1P >= 1, @P >= malloc(1) || @P == 0) */ extern Numb* numb_new_sqrt(const Numb* numb); /*lint -sem( numb_new_exp, 1P >= 1, @P >= malloc(1)) */ extern Numb* numb_new_exp(const Numb* numb); /*lint -sem( numb_new_ln, 1P >= 1, @P >= malloc(1) || @P == 0) */ extern Numb* numb_new_ln(const Numb* numb); /*lint -sem( numb_new_rand, 1P >= 1, 2p, @P >= malloc(1)) */ extern Numb* numb_new_rand(const Numb* mini, const Numb* maxi); /*lint -sem( numb_todbl, pure, 1P >= 1) */ extern double numb_todbl(const Numb* numb); /*lint -sem( numb_print, 1P >= 1, 2P >= 1) */ extern void numb_print(FILE* fp, const Numb* numb); /*lint -sem( numb_hash, pure, 1P >= 1) */ extern unsigned int numb_hash(const Numb* numb); /*lint -sem( numb_tostr, 1P >= 1, @p) */ extern char* numb_tostr(const Numb* numb); /*lint -sem( numb_zero, @P >= 1) */ extern const Numb* numb_zero(void); /*lint -sem( numb_one, @P >= 1) */ extern const Numb* numb_one(void); /*lint -sem( numb_minusone, @P >= 1) */ extern const Numb* numb_minusone(void); /*lint -sem( numb_unknown, @P >= 1) */ extern const Numb* numb_unknown(void); /*lint -sem( numb_is_int, pure, 1P >= 1) */ extern bool numb_is_int(const Numb* numb); /*lint -sem( numb_toint, pure, 1P >= 1) */ extern int numb_toint(const Numb* numb); /*lint -sem( numb_is_number, 1P >= 1) */ extern bool numb_is_number(const char *s); #ifdef __GMP_H__ /*lint -sem( numb_new_mpq, @P >= malloc(1)) */ extern Numb* numb_new_mpq(const mpq_t val); /*lint -sem( numb_new_mpq, 1P >= 1) */ extern void numb_get_mpq(const Numb* numb, mpq_t value); #endif /* __GMP_H__ */ #endif /* _NUMB_H_ */ zimpl-3.3.6/src/zimpl/metaio.c0000644001417200060250000002536113304236715016134 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: metaio.c */ /* Name....: Meta Input/Output */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2006-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include #include #ifndef WITHOUT_ZLIB #include #endif #include "zimpl/lint.h" #include #include "zimpl/mshell.h" #include "zimpl/mme.h" #include "zimpl/metaio.h" enum file_type { MFP_ERR, MFP_STRG, MFP_FILE, MFP_PIPE #ifndef WITHOUT_ZLIB , MFP_ZLIB #endif /* ! WITHOUT_ZLIB */ }; typedef struct strg_file StrgFile; typedef enum file_type FileType; #define STRGFILE_SID 0x53544649 #define MFP_SID 0x4d46505f #define BUF_SIZE_INC 4096 struct strg_file { SID const char* name; const char* content; int length; int offset; bool use_copy; StrgFile* next; }; struct meta_file_ptr { SID FileType type; union { StrgFile* strg; FILE* file; #ifndef WITHOUT_ZLIB gzFile zlib; #endif /* ! WITHOUT_ZLIB */ } fp; }; static StrgFile* strg_file_root = NULL; static bool strgfile_is_valid(const StrgFile* sf) { return (sf != NULL) && SID_ok(sf, STRGFILE_SID) && (sf->name != NULL) && (sf->content != NULL) && (sf->length >= 0) && (sf->offset >= 0) && (sf->offset <= sf->length); } void mio_add_strg_file(const char* name, const char* content, bool use_copy) { StrgFile* sf = calloc(1, sizeof(*sf)); assert(name != NULL); assert(content != NULL); assert(sf != NULL); sf->name = strdup(name); sf->content = use_copy ? strdup(content) : content; sf->length = (int)strlen(content); /* the final '\0' is not part of the file */ sf->offset = 0; sf->use_copy = use_copy; sf->next = strg_file_root; SID_set(sf, STRGFILE_SID); assert(strgfile_is_valid(sf)); strg_file_root = sf; } static int strgfile_getc(StrgFile* sf) { int c; assert(strgfile_is_valid(sf)); if (sf->offset == sf->length) c = EOF; else { assert(sf->offset < sf->length); c = sf->content[sf->offset]; sf->offset++; } return c; } static char* strgfile_gets(StrgFile* sf, char* buf, int size) { char* s = NULL; assert(strgfile_is_valid(sf)); assert(buf != NULL); assert(size > 0); if (sf->offset < sf->length) { int i = 0; while(sf->offset < sf->length && i < size - 1) { assert(sf->content[sf->offset] != '\0'); buf[i] = sf->content[sf->offset]; sf->offset++; i++; if (buf[i - 1] == '\n') break; } buf[i] = '\0'; s = buf; } return s; } static bool mfp_is_valid(const MFP* mfp) { return mfp != NULL && SID_ok(mfp, MFP_SID) && mfp->type != MFP_ERR; } MFP* mio_open(const char* name, const char* ext) { MFP* mfp = calloc(1, sizeof(*mfp)); char* filename; StrgFile* sf; assert(name != NULL); assert(ext != NULL); assert(mfp != NULL); filename = malloc(strlen(name) + strlen(ext) + 1); assert(filename != NULL); strcpy(filename, name); /* Check if a String File is openend */ for(sf = strg_file_root; sf != NULL; sf = sf->next) if (!strcmp(name, sf->name)) break; /* Did we find something ? */ if (sf != NULL) { mfp->type = MFP_STRG; mfp->fp.strg = sf; mfp->fp.strg->offset = 0; SID_set(mfp, MFP_SID); assert(mfp_is_valid(mfp)); } else { /* Do we have a pipe? */ if (*filename == '#') { mfp->type = MFP_PIPE; if (NULL == (mfp->fp.file = popen(&filename[1], "r"))) { perror(filename); free(mfp); mfp = NULL; } else { SID_set(mfp, MFP_SID); assert(mfp_is_valid(mfp)); } } else { int len; /* This seems to be a real file, is it available ? */ if (access(filename, R_OK) != 0) { strcat(filename, ext); /* If .gz/.zpl also does not work, revert to the old name * to get a better error message. */ if (access(filename, R_OK) != 0) strcpy(filename, name); } #ifndef WITHOUT_ZLIB len = (int)strlen(filename); if (len > 3 && !strcmp(&filename[len - 3], ".gz")) { mfp->type = MFP_ZLIB; if (NULL == (mfp->fp.zlib = gzopen(filename, "r"))) { perror(filename); free(mfp); mfp = NULL; } else { SID_set(mfp, MFP_SID); assert(mfp_is_valid(mfp)); } } else #endif /* !WITHOUT_ZLIB */ { mfp->type = MFP_FILE; if (NULL == (mfp->fp.file = fopen(filename, "r"))) { perror(filename); free(mfp); mfp = NULL; } else { SID_set(mfp, MFP_SID); assert(mfp_is_valid(mfp)); } } } } free(filename); return mfp; } void mio_close(MFP* mfp) { assert(mfp_is_valid(mfp)); switch(mfp->type) { case MFP_STRG : break; case MFP_FILE : fclose(mfp->fp.file); break; case MFP_PIPE : pclose(mfp->fp.file); break; #ifndef WITHOUT_ZLIB case MFP_ZLIB : gzclose(mfp->fp.zlib); break; #endif /* ! WITHOUT_ZLIB */ default : abort(); } SID_del(mfp); free(mfp); } int mio_getc(const MFP* mfp) { int c; assert(mfp_is_valid(mfp)); switch(mfp->type) { case MFP_STRG : c = strgfile_getc(mfp->fp.strg); break; case MFP_FILE : case MFP_PIPE : c = fgetc(mfp->fp.file); break; #ifndef WITHOUT_ZLIB case MFP_ZLIB : c = gzgetc(mfp->fp.zlib); break; #endif /* ! WITHOUT_ZLIB */ default : abort(); } return c; } char* mio_gets(const MFP* mfp, char* buf, int len) { char* s = NULL; assert(mfp_is_valid(mfp)); switch(mfp->type) { case MFP_STRG : s = strgfile_gets(mfp->fp.strg, buf, len); break; case MFP_FILE : case MFP_PIPE : s = fgets(buf, len, mfp->fp.file); break; #ifndef WITHOUT_ZLIB case MFP_ZLIB : s = gzgets(mfp->fp.zlib, buf, len); break; #endif /* ! WITHOUT_ZLIB */ default : abort(); } return s; } char* mio_get_line(const MFP* mfp) { int size = 1; char* buf = NULL; char* s; assert(mfp_is_valid(mfp)); do { char* t; int pos = size - 1; size += BUF_SIZE_INC - 1; buf = (buf == NULL) ? malloc((size_t)size) : realloc(buf, (size_t)size); t = &buf[pos]; buf[size - 1] = '@'; s = mio_gets(mfp, t, BUF_SIZE_INC); } while(s != NULL && buf[size - 1] == '\0' && buf[size - 2] != '\n'); /* nothing read at all ? */ if (s == NULL && size == BUF_SIZE_INC) { free(buf); buf = NULL; } return buf; } void mio_init() { /* Setup for internal test */ static const char* const progstrg = "# $Id: metaio.c,v 1.21 2014/03/03 16:44:14 bzfkocht Exp $\n" "#\n" "# Generic formulation of the Travelling Salesmen Problem\n" "#\n" "set V := { read \"@selftest_cities.dat\" as \"<1s>\" comment \"#\" use cities };\n" "set E := { in V * V with i < j };\n" "set P[] := powerset(V);\n" "set K := indexset(P) \\ { 0 };\n" "\n" "do print cities;\n" "do print V;\n" "do print E;\n" "param px[V] := read \"@selftest_cities.dat\" as \"<1s> 2n\" comment \"#\" use cities;\n" "param py[V] := read \"@selftest_cities.dat\" as \"<1s> 3n\" comment \"#\" use cities;\n" "\n" "defnumb dist(a,b) := sqrt((px[a] - px[b])^2 + (py[a] - py[b])^2);\n" "\n" "var x[E] binary;\n" "\n" "minimize cost: sum in E : dist(i,j) * x[i, j];\n" "\n" "subto two_connected:\n" " forall in V do\n" " (sum in E : x[v,j]) + (sum in E : x[i,v]) == 2;\n" "\n" "subto no_subtour:\n" " forall in K with card(P[k]) > 2 and card(P[k]) < card(V) - 2 do\n" " sum in E with in P[k] and in P[k] : x[i,j] \n" " <= card(P[k]) - 1;\n"; static const char* const datastrg = "Berlin 5251 1340\n" "Frankfurt 5011 864\n" "Leipzig 5133 1237\n" "Heidelberg 4941 867\n" "Karlsruhe 4901 840\n" "Hamburg 5356 998\n" "Bayreuth 4993 1159\n" "Trier 4974 668\n" "Hannover 5237 972\n" "Stuttgart 4874 909\n" "Passau 4856 1344\n" "Augsburg 4833 1089\n" "Koblenz 5033 759\n" "Dortmund 5148 741\n"; mio_add_strg_file("@selftest_tspste.zpl", progstrg, false); mio_add_strg_file("@selftest_cities.dat", datastrg, false); } void mio_exit() { StrgFile* p; StrgFile* q; for(p = strg_file_root; p != NULL; p = q) { q = p->next; assert(strgfile_is_valid(p)); free((void*)p->name); if (p->use_copy) free((void*)p->content); SID_del(p); free(p); } strg_file_root = NULL; } zimpl-3.3.6/src/zimpl/term.h0000644001417200060250000001203413304236715015623 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: term.h */ /* Name....: Term Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _TERM_H_ #define _TERM_H_ #ifndef _MONO_H_ #error "Need to include mono.h before term.h" #endif #ifdef __cplusplus extern "C" { #endif typedef struct term Term; /* term.c */ /*lint -sem( term_new, 1n > 0, @P >= malloc(1)) */ extern Term* term_new(int size); /*lint -sem( term_add_elem, 1p == 1 && 2p == 1 && 3p == 1) */ extern void term_add_elem(Term* term, const Entry* entry, const Numb* coeff, MFun mfun); #if 0 /* ??? not used */ /*lint -sem( term_mul_elem, 1p == 1 && 2p == 1 && 3p == 1) */ extern void term_mul_elem(Term* term, const Entry* entry, const Numb* coeff); #endif /*lint -sem( term_free, custodial(1), 1p == 1) */ extern void term_free(Term* term); /*lint -sem( term_is_valid, 1p == 1) */ extern bool term_is_valid(const Term* term); /*lint -sem( term_copy, 1p == 1, @P == malloc(1P)) */ extern Term* term_copy(const Term* term); /*lint -sem( term_print, 1p == 1 && 2p == 1) */ extern void term_print(FILE* fp, const Term* term, bool print_symbol_index); /*lint -sem( term_append_term, 1p == 1 && 2p == 1) */ extern void term_append_term(Term* term_a, const Term* term_b); /*lint -sem( term_add_term, 1p == 1 && 2p == 1, @P == malloc(1P)) */ extern Term* term_add_term(const Term* term_a, const Term* term_b); /*lint -sem( term_sub_term, 1p == 1 && 2p == 1, @P == malloc(1P)) */ extern Term* term_sub_term(const Term* term_a, const Term* term_b); /*lint -sem( term_mul_term, 1p == 1 && 2p == 1, @P == malloc(1P)) */ extern Term* term_mul_term(const Term* term_a, const Term* term_b); /*lint -sem( term_simplify, 1p, @P == malloc(1P)) */ extern Term* term_simplify(const Term* term_org); /*lint -sem( term_add_constant, 1p == 1 && 2p == 1) */ extern void term_add_constant(Term* term, const Numb* value); /*lint -sem( term_sub_constant, 1p == 1 && 2p == 1) */ extern void term_sub_constant(Term* term, const Numb* value); /*lint -sem( term_mul_coeff, 1p == 1 && 2p == 1) */ extern void term_mul_coeff(Term* term, const Numb* value); /*lint -sem( term_get_constant, 1p == 1) */ extern const Numb* term_get_constant(const Term* term); #if 0 /* ??? not used */ /*lint -sem( term_negate, 1p == 1) */ extern void term_negate(Term* term); #endif /*lint -sem( term_to_objective, 1p == 1) */ extern void term_to_objective(const Term* term); /*lint -sem( term_get_elements, 1p == 1, @n >= 0) */ extern int term_get_elements(const Term* term); /*lint -sem( term_get_element, 1p, chneg(2), @p == 1) */ extern Mono* term_get_element(const Term* term, int i); /*lint -sem( term_get_lower_bound, 1p == 1, @P >= malloc(1)) */ extern Bound* term_get_lower_bound(const Term* term); /*lint -sem( term_get_upper_bound, 1p == 1, @P >= malloc(1)) */ extern Bound* term_get_upper_bound(const Term* term); /*lint -sem( term_is_all_integer, 1p == 1) */ extern bool term_is_all_integer(const Term* term); /*lint -sem( term_is_linear, 1p == 1) */ extern bool term_is_linear(const Term* term); /*lint -sem( term_is_polynomial, 1p == 1) */ extern bool term_is_polynomial(const Term* term); /*lint -sem( term_get_degree, 1p == 1) */ extern int term_get_degree(const Term* term); /*lint -sem( term_make_conditional, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Term* term_make_conditional(const Term* ind_term, const Term* cond_term, bool is_true); #ifdef __cplusplus } #endif #endif /* _TERM_H_ */ zimpl-3.3.6/src/zimpl/blkmem.c0000644001417200060250000001214113304236715016115 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: blkmem.c */ /* Name....: Block Memory Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/blkmem.h" typedef struct memory_block_element BlkMemElem; typedef struct memory_block BlkMem; struct memory_block_element { BlkMemElem* next; }; struct memory_block { size_t elem_count; BlkMemElem* elem; BlkMem* next; }; #define MIN_BLK_ELEM_COUNT 1024 #define MAX_BLK_ELEM_SIZE 64 #define MAX_CHAINS (MAX_BLK_ELEM_SIZE / 8) static BlkMem* blk_anchor[MAX_CHAINS]; static BlkMemElem* first_free[MAX_CHAINS]; static int blk_fails = 0; static int blk_count = 0; static void extend_memory(int chain_no) { BlkMem* block = calloc(1, sizeof(*block)); size_t elem_size = ((size_t)chain_no + 1) * 8; size_t offset = elem_size / sizeof(BlkMemElem); size_t i; assert(elem_size % (int)sizeof(BlkMemElem) == 0); assert(block != NULL); assert(chain_no >= 0); assert(chain_no < MAX_CHAINS); block->elem_count = (blk_anchor[chain_no] == NULL) ? MIN_BLK_ELEM_COUNT : (blk_anchor[chain_no]->elem_count * 2); block->elem = malloc(block->elem_count * elem_size); block->next = blk_anchor[chain_no]; blk_anchor[chain_no] = block; assert(block->elem != NULL); assert(elem_size == offset * sizeof(*block->elem)); for(i = 0; i < block->elem_count - 1; i++) block->elem[i * offset].next = &block->elem[(i + 1) * offset]; assert(i == block->elem_count - 1); block->elem[i * offset].next = first_free[chain_no]; first_free[chain_no] = &block->elem[0]; assert(first_free[chain_no] != NULL); assert(blk_anchor[chain_no] != NULL); } void blk_init(void) { int i; for(i = 0; i < MAX_CHAINS; i++) { blk_anchor[i] = NULL; first_free[i] = NULL; } } void blk_exit(void) { int i; if (blk_count != 0) printf("Block memory allocation count %d\n", blk_count); #ifndef NDEBUG if (blk_fails != 0) printf("Block memory allocation fails: %d\n", blk_fails); #endif for(i = 0; i < MAX_CHAINS; i++) { BlkMem* anchor; BlkMem* next; for(anchor = blk_anchor[i]; anchor != NULL; anchor = next) { next = anchor->next; free(anchor->elem); free(anchor); } } } void* blk_alloc(int size) { BlkMemElem* elem; int chain_no = (size + 7) / 8 - 1; assert(size > 0); assert(size < MAX_BLK_ELEM_SIZE); assert(chain_no >= 0); if (chain_no >= MAX_CHAINS) { blk_fails++; return malloc((size_t)size); } if (first_free[chain_no] == NULL) extend_memory(chain_no); assert(first_free[chain_no] != NULL); elem = first_free[chain_no]; first_free[chain_no] = elem->next; blk_count++; return elem; } void blk_free(void* p, int size) { int chain_no = (size + 7) / 8 - 1; BlkMemElem* elem = p; assert(p != NULL); assert(size > 0); assert(size < MAX_BLK_ELEM_SIZE); assert(chain_no >= 0); if (chain_no >= MAX_CHAINS) { free(p); return; } #ifndef NDEBUG /* Check whether the elem is really from on eof the blocks. */ { BlkMem* anchor = blk_anchor[chain_no]; int elem_size = (chain_no + 1) * 8; size_t offset = (size_t)elem_size / sizeof(BlkMemElem); assert(anchor != NULL); while(elem < anchor->elem || elem >= anchor->elem + anchor->elem_count * offset) { anchor = anchor->next; assert(anchor != NULL); } } #endif elem->next = first_free[chain_no]; first_free[chain_no] = elem; blk_count--; } zimpl-3.3.6/src/zimpl/mshell.c0000644001417200060250000002774413304236715016151 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mshell.c */ /* Name....: Memory Allocation Shell */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ /* * This is base on the routines from Jim Schimandle, * published in Dr. Dobbs Journal #167 09/90 p.110+. */ #include #include #include #include #include #include #include "zimpl/lint.h" #define _MSHELL_C_ #include "zimpl/mshell.h" #if defined(__GNUC__) || defined(__CLANG__) #define UNUSED __attribute__ ((unused)) #define NORETURN __attribute__ ((noreturn)) #else #define UNUSED #define NORETURN #endif /* __GNUC__ || __CLANG__ */ #if !defined(NO_MSHELL) #define ALIGN_SIZE sizeof(double) #define MEMTAG1 0xa55a #define MEMTAG2 0xd88d #define OLDTAG 0xb66b #define ENDTAG 0xc77c typedef struct memnod { unsigned short tag1; unsigned long size; struct memnod* next; struct memnod* prev; char const* file; int line; unsigned short tag2; } MHDR; #define MHDR_NIL ((MHDR*)0) #define HDR_SIZE sizeof(MHDR) #define RESERVE_SIZE (((HDR_SIZE + (ALIGN_SIZE - 1)) \ / ALIGN_SIZE) * ALIGN_SIZE) #define CLIENT_2_HDR(a) ((MHDR*)(((char*)(a)) - RESERVE_SIZE)) #define HDR_2_CLIENT(a) ((void*)(((char*)(a)) + RESERVE_SIZE)) static unsigned long mem_size = 0; static unsigned long mem_maxi = 0; static MHDR* memlist = MHDR_NIL; #define Mem_tag_err(a, b, c, d) mem_tag_err((a), (b), (c), (d), file, line) static size_t mem_alloc_size( size_t size) { size += RESERVE_SIZE + ALIGN_SIZE + ALIGN_SIZE - 1; return((size / ALIGN_SIZE) * ALIGN_SIZE); } static int* mem_endptr( MHDR* p) { size_t offset; assert(p != NULL); offset = ((RESERVE_SIZE + p->size + ALIGN_SIZE - 1) / ALIGN_SIZE) * ALIGN_SIZE; return((int*)((char*)p + offset)); } static void mem_add_list( MHDR* p) { assert((p != NULL) && (p->tag1 == MEMTAG1) && (p->tag2 == MEMTAG2)); p->next = memlist; p->prev = MHDR_NIL; if (memlist != MHDR_NIL) memlist->prev = p; memlist = p; if (mem_size > mem_maxi) mem_maxi = mem_size; } static void mem_del_list( MHDR *p) { assert((p != NULL) && (p->tag1 == MEMTAG1) && (p->tag2 == MEMTAG2)); *mem_endptr(p) = ~ENDTAG; p->tag1 = OLDTAG; p->tag2 = OLDTAG; mem_size -= p->size; if (p->next != MHDR_NIL) p->next->prev = p->prev; if (p->prev != MHDR_NIL) p->prev->next = p->next; else memlist = p->next; } static NORETURN void mem_tag_err( MHDR* p, int typ, const char* file1, const int line1, const char* file2, const int line2) { const char* const errtyp[] = { "pre1", "pre2", "post" }; assert((typ >= 0) && (typ <= 2)); (void)fprintf(stderr, "Memory tag error (%s) - %lx - %s(%d) at %s(%d)\n", errtyp[typ], (unsigned long)p, file1, line1, file2, line2); mem_display(stderr); abort(); } static void mem_valid( MHDR* p, const char* file, const int line) { if (p->tag1 != MEMTAG1) { if (p->tag1 == OLDTAG) Mem_tag_err(p, 0, p->file, p->line); Mem_tag_err(p, 0, "Unknown", 0); } if (p->tag2 != MEMTAG2) { if (p->tag1 == OLDTAG) Mem_tag_err(p, 1, p->file, p->line); Mem_tag_err(p, 1, "Unknown", 0); } if (*mem_endptr(p) != ENDTAG) Mem_tag_err(p, 2, p->file, p->line); } void* mem_malloc( size_t size, const char* file, const int line) { const char* errmsg1 = "mem_malloc(size=%u, file=%s, line=%d): out of memory\n"; const char* errmsg2 = "mem_malloc(size=%u, file=%s, line=%d): zero size\n"; MHDR* p; size_t alloc_size; if (size == 0) { fprintf(stderr, errmsg2, size, file, line); exit(EXIT_FAILURE); } alloc_size = mem_alloc_size(size); assert(alloc_size > 0); if ((p = malloc(alloc_size)) == MHDR_NIL) { fprintf(stderr, errmsg1, size, file, line); exit(EXIT_FAILURE); } p->tag1 = MEMTAG1; p->tag2 = MEMTAG2; p->size = size; mem_size += size; p->file = file; p->line = line; *mem_endptr(p) = ENDTAG; mem_add_list(p); return(HDR_2_CLIENT(p)); } void* mem_calloc( size_t item, size_t size, const char* file, const int line) { const char* errmsg1 = "mem_calloc(item=%u, size=%u, file=%s, line=%d): out of memory\n"; const char* errmsg2 = "mem_calloc(item=%u, size=%u, file=%s, line=%d): zero item/size\n"; MHDR* p; if (item == 0 || size == 0) { fprintf(stderr, errmsg2, item, size, file, line); exit(EXIT_FAILURE); } if ((p = calloc(mem_alloc_size(size * item), sizeof(char))) == MHDR_NIL) { fprintf(stderr, errmsg1, item, size, file, line); exit(EXIT_FAILURE); } p->tag1 = MEMTAG1; p->tag2 = MEMTAG2; p->size = size * item; mem_size += size * item; p->file = file; p->line = line; *mem_endptr(p) = ENDTAG; mem_add_list(p); return(HDR_2_CLIENT(p)); } void* mem_realloc( void* ptr, size_t size, const char* file, const int line) { const char* errmsg1 = "mem_realloc(size=%u, file=%s, line=%d): out of memory\n"; const char* errmsg2 = "mem_realloc(file=%s, line=%d): null pointer\n"; const char* errmsg3 = "mem_realloc(size=%u, file=%s, line=%d): zero size\n"; MHDR* p; if (ptr == NULL) { fprintf(stderr, errmsg2, file, line); exit(EXIT_FAILURE); } p = CLIENT_2_HDR(ptr); mem_valid(p, file, line); mem_del_list(p); if (size == 0) { fprintf(stderr, errmsg3, size, file, line); exit(EXIT_FAILURE); } if ((p = realloc(p, mem_alloc_size(size))) == MHDR_NIL) { fprintf(stderr, errmsg1, size, file, line); exit(EXIT_FAILURE); } p->tag1 = MEMTAG1; p->tag2 = MEMTAG2; p->size = size; mem_size += size; p->file = file; p->line = line; *mem_endptr(p) = ENDTAG; mem_add_list(p); return(HDR_2_CLIENT(p)); } char* mem_strdup( const char* str, const char* file, const int line) { const char* errmsg1 = "mem_strdup(file=%s, line=%d): null pointer\n"; if (str == NULL) { (void)fprintf(stderr, errmsg1, file, line); exit(EXIT_FAILURE); } return(strcpy(mem_malloc((size_t)(strlen(str) + 1), file, line), str)); } void mem_free( void* ptr, const char* file, const int line) { const char *errmsg = "mem_free(file=%s, line=%d): null pointer\n"; MHDR* p; if (ptr == NULL) { (void)fprintf(stderr, errmsg, file, line); abort(); } p = CLIENT_2_HDR(ptr); mem_valid(p, file, line); mem_del_list(p); free(p); } void mem_hide_x( void* ptr, const char* file, const int line) { const char *errmsg = "mem_checkout(file=%s, line=%d): null pointer\n"; MHDR* p; if (ptr == NULL) { (void)fprintf(stderr, errmsg, file, line); abort(); } p = CLIENT_2_HDR(ptr); mem_valid(p, file, line); mem_del_list(p); /* Size nicht verringern */ mem_size += p->size; } size_t mem_used() { return(mem_size); } void mem_maximum( FILE* fp) { (void)fprintf(fp, "Maximum amount of memory used = %lu bytes\n", mem_maxi); } void mem_display( FILE* fp) { MHDR* p; (void)fprintf(fp, "\nAddress Size File(Line) - total size %lu\n", mem_size); for(p = memlist; p != MHDR_NIL; p = p->next) { (void)fprintf(fp, "%8lx %6lu %s(%d) %s %s\n", (unsigned long)p, p->size, p->file, p->line, ((p->tag1 != MEMTAG1) || (p->tag2 != MEMTAG2)) ? "Invalid" : "", (*mem_endptr(p) == ENDTAG) ? "ok" : "Clobbered"); } mem_maximum(fp); } void mem_check_x( const void* ptr, const char* file, const int line) { MHDR* p = CLIENT_2_HDR(ptr); mem_valid(p, file, line); } void mem_check_all_x( const char* file, const int line) { MHDR* p; for(p = memlist; p != MHDR_NIL; p = p->next) mem_valid(p, file, line); } #else /* NO_MSHELL */ void* mem_malloc( size_t size, const char* file, const int line) { const char* errmsg1 = "mem_malloc(size=%u, file=%s, line=%d): out of memory\n"; void* p; assert(size > 0); if (NULL == (p = malloc(size))) { fprintf(stderr, errmsg1, size, file, line); exit(EXIT_FAILURE); } return p; } void* mem_calloc( size_t item, size_t size, const char* file, const int line) { const char* errmsg1 = "mem_calloc(item=%u, size=%u, file=%s, line=%d): out of memory\n"; void* p; assert(item > 0); assert(size > 0); if (NULL == (p = calloc(item, size))) { fprintf(stderr, errmsg1, item, size, file, line); exit(EXIT_FAILURE); } return p; } void* mem_realloc( void* ptr, size_t size, const char* file, const int line) { const char* errmsg1 = "mem_realloc(size=%u, file=%s, line=%d): out of memory\n"; void* p; assert(ptr != NULL); assert(size > 0); if (NULL == (p = realloc(ptr, size))) { fprintf(stderr, errmsg1, size, file, line); exit(EXIT_FAILURE); } return p; } char* mem_strdup( const char* str, const char* file, const int line) { const char* errmsg1 = "mem_strdup(size=%u, file=%s, line=%d): out of memory\n"; char* s; assert(str != NULL); if (NULL == (s = strdup(str))) { fprintf(stderr, errmsg1, strlen(str), file, line); exit(EXIT_FAILURE); } return s; } void mem_free( void* ptr, const char* file, const int line) { const char *errmsg = "mem_free(file=%s, line=%d): null pointer\n"; #ifndef NDEBUG if (ptr == NULL) { fprintf(stderr, errmsg, file, line); abort(); } #endif free(ptr); } #endif /* !NO_MSHELL */ /* ------------------------------------------------------------------------- */ /* Emacs Local Variables: */ /* Emacs mode:c */ /* Emacs c-basic-offset:3 */ /* Emacs tab-width:8 */ /* Emacs indent-tabs-mode:nil */ /* Emacs End: */ /* ------------------------------------------------------------------------- */ zimpl-3.3.6/src/zimpl/random.c0000644001417200060250000001314013304236715016126 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: random.c */ /* Name....: Random number functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include /* #define TRACE 1 */ #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/random.h" /* A C-program for MT19937, with initialization improved 2002/2/10. Coded by Takuji Nishimura and Makoto Matsumoto. This is a faster version by taking Shawn Cokus's optimization, Matthe Bellew's simplification, Isaku Wada's real version. Before using, initialize the state by using init_genrand(seed) . Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. The names of its contributors may not be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Any feedback is very welcome. http://www.math.keio.ac.jp/matumoto/emt.html email: matumoto@math.keio.ac.jp */ /* Period parameters */ #define N 624 #define M 397 #define MATRIX_A 0x9908b0dfU /* constant vector a */ #define UMASK 0x80000000U /* most significant w-r bits */ #define LMASK 0x7fffffffU /* least significant r bits */ #define MIXBITS(u,v) (((u) & UMASK) | ((v) & LMASK)) #define TWIST(u,v) ((MIXBITS(u,v) >> 1) ^ ((v)&1UL ? MATRIX_A : 0UL)) static unsigned int state[N]; /* the array for the state vector */ static int left = 1; static const unsigned int* next; /* initializes state[N] with a seed */ void rand_init(unsigned long s) { unsigned int j; state[0] = s & 0xffffffffU; for(j = 1; j < N; j++) { state[j] = (1812433253U * (state[j-1] ^ (state[j-1] >> 30)) + j); /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */ /* In the previous versions, MSBs of the seed affect */ /* only MSBs of the array state[]. */ /* 2002/01/09 modified by Makoto Matsumoto */ state[j] &= 0xffffffffU; /* for >32 bit machines */ } left = 1; } /* generates a random number on [0,0xffffffff]-interval */ unsigned int rand_get_int32(void) { unsigned int y; if (--left == 0) { unsigned int* p = state; int j; left = N; next = state; for(j = N - M + 1; --j; p++) /*lint !e441 !e443 */ *p = p[M] ^ TWIST(p[0], p[1]); for(j = M; --j; p++) /*lint !e441 !e443 */ *p = p[M-N] ^ TWIST(p[0], p[1]); *p = p[M-N] ^ TWIST(p[0], state[0]); } y = *next++; /* Tempering */ y ^= (y >> 11); y ^= (y << 7) & 0x9d2c5680U; y ^= (y << 15) & 0xefc60000U; y ^= (y >> 18); return y; } /* ----------------------------------------------------------------------------- */ /* Should give a random number between min and max */ int rand_get_range(int mini, int maxi) { double r = (double)rand_get_int32() / 4294967295.0; assert(mini < maxi); return (int)(r * (maxi - mini) + 0.5) + mini; } zimpl-3.3.6/src/zimpl/ratlptypes.h0000644001417200060250000000623313304236715017067 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratlptypes.h */ /* Name....: Rational Number LP Storage Library */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _RATLPTYPES_H_ #define _RATLPTYPES_H_ #ifdef __cplusplus extern "C" { #endif enum con_type { CON_FREE = 0, CON_LHS, CON_RHS, CON_RANGE, CON_EQUAL }; enum var_type { VAR_FREE = 0, VAR_LOWER, VAR_UPPER, VAR_BOXED, VAR_FIXED }; enum sos_type { SOS_ERR = 0, SOS_TYPE1, SOS_TYPE2 }; enum var_class { VAR_CON = 0, VAR_IMP, VAR_INT }; enum lp_direct { LP_MIN = 0, LP_MAX }; enum lp_type { LP_ERR = 0, LP_LP, LP_IP }; enum lp_format { LP_FORM_ERR = 0, LP_FORM_LPF, LP_FORM_HUM, LP_FORM_MPS, LP_FORM_RLP, LP_FORM_PIP }; #if 0 /* not used anymore ??? */ enum presolve_result { PRESOLVE_ERROR = 0, PRESOLVE_OKAY, PRESOLVE_INFEASIBLE, PRESOLVE_UNBOUNDED, PRESOLVE_VANISHED }; typedef enum presolve_result PSResult; #endif typedef struct nonzero Nzo; typedef struct variable Var; typedef struct constraint Con; typedef struct soset Sos; typedef struct soselement Sse; typedef struct qmatentry Qme; typedef struct lpstorage Lps; typedef enum con_type ConType; typedef enum sos_type SosType; typedef enum var_class VarClass; typedef enum lp_direct LpDirect; typedef enum lp_type LpType; typedef enum lp_format LpFormat; #define LP_FLAG_CON_SCALE 0x01 #define LP_FLAG_CON_SEPAR 0x02 #define LP_FLAG_CON_CHECK 0x04 #define LP_FLAG_CON_INDIC 0x08 #define HAS_LOWER(var) ((var)->type != VAR_FREE && (var)->type != VAR_UPPER) #define HAS_UPPER(var) ((var)->type != VAR_FREE && (var)->type != VAR_LOWER) #define HAS_LHS(con) ((con)->type != CON_FREE && (con)->type != CON_RHS) #define HAS_RHS(con) ((con)->type != CON_FREE && (con)->type != CON_LHS) #ifdef __cplusplus } #endif #endif /* _RATLPTYPES_H_ */ zimpl-3.3.6/src/zimpl/xlpglue.c0000644001417200060250000004146613304236715016342 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: xlpglue.c */ /* Name....: LP Storage Interface */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ /**@file xlpglue.c * @brief Mathematical Program Storage Interface * @author Thorsten Koch * * The function defined in this file are the once that have to be implemented * to hook Zimpl up as an reader in some other program. You have then to link * the Zimpl library together with your xlpglue.c implementation. * * Please note one important point: While the lps, var, con, and user_data pointers are * passed arround in these routines, they are never used themselves by Zimpl. It is the choice * of the implementor of the xlpglue interface whether to use these, have the different or the * same, or set the to NULL. */ #include #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/bound.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/gmpmisc.h" #include "zimpl/conname.h" #include "zimpl/stmt.h" #include "zimpl/hash.h" #include "zimpl/xlpglue.h" #ifdef _MSC_VER #pragma warning (disable: 4100) /* unreferenced formal parameter */ #endif /*lint -esym(818, lp) 'lp' could be declared as pointing to const */ static bool use_startval = false; /** Allocate storage for the mathematical program instance generated by Zimpl. * xlp_alloc() is the first xlpglue routine that will be called by Zimpl. * The user_data pointer may hold an arbitray value. * * @return The pointer returned from xlp_alloc is passed to all other xlpglue * routines, but never referenced by Zimpl itself. When implementing an * xlpglue interface you may choose to pass the user_data pointer as the Lps * pointer if it suits your needs. */ /*ARGSUSED*/ Lps* xlp_alloc( const char* name, /**< Instance name, will appear e.g. in MPS NAME section */ bool need_startval, /**< Will we supply starting values for the variables? */ UNUSED void* user_data) /**< Pointer with arbitrary data. */ { assert(name != NULL); use_startval = need_startval; return lps_alloc(name); } /** Free storage for mathematical program. * xlp_free() is the last xlpglue routine that will be called by Zimpl. */ void xlp_free( Lps* lp) /**< Pointer to storage as given by xlp_alloc */ { assert(lp != NULL); lps_free(lp); } #if 0 /* not used anymore ??? */ /** Does the mathematical program have SOS constraints? * @return True if there is at least one SOS constraint, False otherwise. */ bool xlp_hassos( const Lps* lp) /**< Pointer to storage */ { assert(lp != NULL); return lps_has_sos(lp); } #endif /** Does there already exists a constraint with the given name? * @return True if there is already a constraint with name conname, False * otherwise. */ /*ARGSUSED*/ bool xlp_conname_exists( const Lps* lp, /**< Pointer to storage */ const char* conname) /**< Constraint name to check */ { assert(lp != NULL); assert(conname != NULL); return NULL != lps_getcon(lp, conname); } /** Check if a constraint is violate by the given starting values. * @return True if the constraint violates the start values, False * otherwise. */ static bool check_con_is_invalid( const Con* con) /**< Pointer to a previous added constraint */ { bool is_invalid = false; mpq_t lhs; mpq_t rhs; mpq_t sum; assert(con != NULL); if (!use_startval) return false; mpq_init(sum); mpq_init(lhs); mpq_init(rhs); /* Get sum of coefficients time startval if usable * (no continous variables) */ if (lps_con_sumup(con, sum)) { lps_getlhs(con, lhs); lps_getrhs(con, rhs); switch(lps_contype(con)) { case CON_RHS : if (mpq_cmp(sum, rhs) > 0 && stmt_trigger_warning(215)) { is_invalid = true; fprintf(stderr, "--- Warning 215: Startvals violate constraint, sum of LHS (%g) <= RHS (%g)\n", mpq_get_d(sum), mpq_get_d(rhs)); } break; case CON_LHS : if (mpq_cmp(lhs, sum) > 0 && stmt_trigger_warning(215)) { is_invalid = true; fprintf(stderr, "--- Warning 215: Startvals violate constraint, sum of LHS (%g) >= RHS (%g)\n", mpq_get_d(sum), mpq_get_d(lhs)); } break; case CON_EQUAL : /* In case of EQUAL, both should be equal */ if ((!mpq_equal(lhs, sum) || !mpq_equal(rhs, sum)) && stmt_trigger_warning(215)) { is_invalid = true; fprintf(stderr, "--- Warning 215: Startvals violate constraint, sum of LHS (%g) == RHS (%g)\n", mpq_get_d(sum), mpq_get_d(rhs)); } break; case CON_RANGE : if ((mpq_cmp(sum, rhs) > 0 || mpq_cmp(lhs, sum) > 0) && stmt_trigger_warning(215)) { is_invalid = true; fprintf(stderr, "--- Warning 215: Startvals violate range, LHS (%g) <= Sum (%g) <= RHS (%g)\n", mpq_get_d(lhs), mpq_get_d(sum), mpq_get_d(rhs)); } break; default : abort(); } } mpq_clear(sum); mpq_clear(rhs); mpq_clear(lhs); return is_invalid; } /** Add a constraint. * Add a given a Zimpl term together with a right and/or left hand side as * a constraint to the mathematical program. The form is lhs <= term <= rhs. * @return True if the constraint violates the given start values, False * otherwise. */ bool xlp_addcon_term( Lps* lp, /**< Pointer to storage */ const char* name, /**< Name of the constraint */ ConType contype, /**< Type of constraint (LHS, RHS, EQUAL, RANGE, etc) */ const Numb* lhs, /**< lhs <= term. Not used if contype is CON_RHS */ const Numb* rhs, /**< term <= rhs. Not used if contype is CON_LHS */ unsigned int flags, /**< special treatment flags, see ratlptypes.h */ const Term* term_org) /**< term to use */ { Term* term; Con* con; mpq_t tlhs; mpq_t trhs; assert(lp != NULL); assert(name != NULL); assert(lhs != NULL); assert(rhs != NULL); assert(term_is_valid(term_org)); assert(numb_equal(term_get_constant(term_org), numb_zero())); term = term_simplify(term_org); con = lps_addcon(lp, name); assert(con != NULL); mpq_init(tlhs); mpq_init(trhs); numb_get_mpq(rhs, trhs); numb_get_mpq(lhs, tlhs); switch(contype) { case CON_RHS : lps_setrhs(con, trhs); break; case CON_LHS : lps_setlhs(con, tlhs); break; case CON_EQUAL : /* In case of EQUAL, both should be equal */ assert(mpq_equal(tlhs, trhs)); /*lint -fallthrough*/ case CON_RANGE : lps_setlhs(con, tlhs); lps_setrhs(con, trhs); break; default : abort(); } lps_addflags(con, flags); mpq_clear(trhs); mpq_clear(tlhs); if ((term_get_degree(term) > 2) || !term_is_polynomial(term)) lps_addterm(lp, con, term); else { for(int i = 0; i < term_get_elements(term); i++) { const Mono* mono = term_get_element(term, i); Var* var = mono_get_var(mono, 0); MFun mfun = mono_get_function(mono); mpq_t val1; if (mfun == MFUN_TRUE || mfun == MFUN_FALSE) { lps_setindicator(con, var, mfun == MFUN_TRUE); continue; } assert(!numb_equal(mono_get_coeff(mono), numb_zero())); mpq_init(val1); numb_get_mpq(mono_get_coeff(mono), val1); if (mono_is_linear(mono)) { Nzo* nzo = lps_getnzo(lp, con, var); if (nzo == NULL) lps_addnzo(lp, con, var, val1); else { mpq_t val2; mpq_init(val2); lps_getval(nzo, val2); mpq_add(val1, val1, val2); if (mpq_equal(val1, const_zero)) lps_delnzo(lp, nzo); else lps_setval(nzo, val1); mpq_clear(val2); } } else { assert(term_get_degree(term) == 2); lps_addqme(lp, con, var, mono_get_var(mono, 1), val1); } mpq_clear(val1); } } term_free(term); return check_con_is_invalid(con); } /** Add a new variable to the mathematical program. * @return Pointer to the variable. This is never dereferenced in Zimpl and * my be an arbitrary pointer used to reference this particular * variable. */ Var* xlp_addvar( Lps* lp, /**< Pointer to storage */ const char* name, /**< Name of the variable */ VarClass varclass, /**< Class of the variable (Continous, Implicit, Integer) */ const Bound* lower, /**< Lower bound of the variable */ const Bound* upper, /**< Upper bound of the variable */ const Numb* priority, /**< Priority value of branching order */ const Numb* startval) /**< Start value. If equal numb_unknown() startval is undefined */ { Var* var; mpq_t temp; assert(lp != NULL); assert(name != NULL); assert(lower != NULL); assert(upper != NULL); assert(priority != NULL); assert(startval != NULL); var = lps_addvar(lp, name); lps_setclass(var, varclass); mpq_init(temp); if (bound_get_type(lower) == BOUND_VALUE) { numb_get_mpq(bound_get_value(lower), temp); lps_setlower(var, temp); } if (bound_get_type(upper) == BOUND_VALUE) { numb_get_mpq(bound_get_value(upper), temp); lps_setupper(var, temp); } if (numb_equal(startval, numb_unknown())) numb_get_mpq(numb_zero(), temp); else numb_get_mpq(startval, temp); lps_setstartval(var, temp); numb_get_mpq(priority, temp); /*lint -e{663} supress "Suspicious array to pointer conversion" */ if (mpz_get_si(mpq_denref(temp)) != 1) if (verbose > VERB_QUIET) fprintf(stderr, "--- Warning 301: variable priority has to be integral\n"); /*lint -e{663} supress "Suspicious array to pointer conversion" */ lps_setpriority(var, (int)mpz_get_si(mpq_numref(temp))); mpq_clear(temp); return var; } /** Add a SOS constraint. * Add a given a Zimpl term as an SOS constraint to the mathematical program. * @return 0 if everything is ok, 1 bit is set if not all of the weights are * unique, 2 bit is set if the weights are not integer. */ int xlp_addsos_term( Lps* lp, /**< Pointer to storage */ const char* name, /**< Name of the constraint */ SosType type, /**< Type of SOS (1, 2) */ const Numb* priority, /**< Priority value for constraint */ const Term* term) /**< Term to use */ { Sos* sos; mpq_t temp; Hash* hash; int i; bool has_duplicates = false; bool has_nonintprio = false; assert(lp != NULL); assert(name != NULL); assert(priority != NULL); assert(term_is_valid(term)); assert(numb_equal(term_get_constant(term), numb_zero())); mpq_init(temp); numb_get_mpq(priority, temp); /*lint -e{663} supress "Suspicious array to pointer conversion" */ if (mpz_get_si(mpq_denref(temp)) != 1) has_nonintprio = true; /*lint -e{663} supress "Suspicious array to pointer conversion" */ sos = lps_addsos(lp, name, type, (int)mpz_get_si(mpq_numref(temp))); assert(sos != NULL); hash = hash_new(HASH_NUMB, term_get_elements(term)); assert(hash != NULL); for(i = 0; i < term_get_elements(term); i++) { const Mono* mono = term_get_element(term, i); const Numb* coeff = mono_get_coeff(mono); Var* var = mono_get_var(mono, 0); assert(!numb_equal(coeff, numb_zero())); assert(mono_is_linear(mono)); /* Each weight is allowed only once. */ if (hash_has_numb(hash, coeff)) has_duplicates = true; hash_add_numb(hash, coeff); numb_get_mpq(coeff, temp); lps_addsse(sos, var, temp); } hash_free(hash); mpq_clear(temp); return (has_duplicates ? 1 : 0) + (has_nonintprio ? 2 : 0); } /** Get name of variable. * @return The name of the variable. */ /*ARGSUSED*/ const char* xlp_getvarname( UNUSED const Lps* lp, /**< Pointer to storage */ const Var* var) /**< Pointer to variable as returned by xlp_addvar() */ { assert(var != NULL); return lps_varname(var); } /** Get the class of the variable. * @return The class of the variable. */ /*ARGSUSED*/ VarClass xlp_getclass( UNUSED const Lps* lp, /**< Pointer to storage */ const Var* var) /**< Pointer to variable as returned by xlp_addvar() */ { assert(var != NULL); return lps_getclass(var); } /** Get the lower bound of the variable. * @return The lower bound of the variable. */ /*ARGSUSED*/ Bound* xlp_getlower( UNUSED const Lps* lp, /**< Pointer to storage */ const Var* var) /**< Pointer to variable as returned by xlp_addvar() */ { assert(var != NULL); Bound* bound; if (!lps_haslower(var)) bound = bound_new(BOUND_MINUS_INFTY, numb_zero()); else { mpq_t lower; mpq_init(lower); lps_getlower(var, lower); Numb* numb = numb_new_mpq(lower); bound = bound_new(BOUND_VALUE, numb); numb_free(numb); mpq_clear(lower); } return bound; } /** Get the upper bound of the variable. * @return The upper bound of the variable. */ /*ARGSUSED*/ Bound* xlp_getupper( UNUSED const Lps* lp, /**< Pointer to storage */ const Var* var) /**< Pointer to variable as returned by xlp_addvar() */ { assert(var != NULL); Bound* bound; if (!lps_hasupper(var)) bound = bound_new(BOUND_INFTY, numb_zero()); else { mpq_t upper; mpq_init(upper); lps_getupper(var, upper); Numb* numb = numb_new_mpq(upper); bound = bound_new(BOUND_VALUE, numb); numb_free(numb); mpq_clear(upper); } return bound; } /** Set the name and direction of the objective function, i.e. minimization or maximization * Coefficents of the objective function will be set to all zero. */ bool xlp_setobj( Lps* lp, /**< Pointer to storage */ const char* name, /**< The name of the objective function */ bool minimize) /**< True if the problem should be minimized, False if it should be maximized */ { assert(lp != NULL); assert(name != NULL); lps_clearobj(lp); lps_setdir(lp, minimize ? LP_MIN : LP_MAX); return lps_setobjname(lp, name); } /** Add to the objective value coefficient of a variable. */ /*ARGSUSED*/ void xlp_addtocost( UNUSED Lps* lp, /**< Pointer to storage */ Var* var, /**< Pointer to variable as returned by xlp_addvar() */ const Numb* cost) /**< Value to be added to the objective coefficient of the variable */ { mpq_t val1; mpq_t val2; assert(var != NULL); assert(cost != NULL); mpq_init(val1); mpq_init(val2); lps_getcost(var, val1); numb_get_mpq(cost, val2); mpq_add(val1, val1, val2); lps_setcost(var, val1); mpq_clear(val1); mpq_clear(val2); } zimpl-3.3.6/src/zimpl/tuple.h0000644001417200060250000000612113304236715016005 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: tuple.h */ /* Name....: Tuple Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _TUPLE_H_ #define _TUPLE_H_ #ifndef _ELEM_H_ #error "Need to include elem.h before tuple.h" #endif #ifdef __cplusplus extern "C" { #endif typedef struct tuple Tuple; #define TUPLE_NULL ((Tuple*)0) /*lint -sem( tuple_new, 1n >= 0, @P > malloc(1P)) */ extern Tuple* tuple_new(int dim); /*lint -sem( tuple_free, custodial(1), 1p == 1) */ extern void tuple_free(Tuple* tuple); /*lint -sem( tuple_is_valid, 1p == 1) */ extern bool tuple_is_valid(const Tuple* tuple); /*lint -sem( tuple_copy, 1p == 1, @P > malloc(1P)) */ extern Tuple* tuple_copy(const Tuple* tuple); /*lint -sem( tuple_cmp, 1p == 1 && 2p == 1) */ extern bool tuple_cmp(const Tuple* tuple_a, const Tuple* tuple_b); /*lint -sem( tuple_get_dim, 1p == 1, @n > 0) */ extern int tuple_get_dim(const Tuple* tuple); /*lint -sem( tuple_set_elem, custodial(3), 1p == 1 && 2n >= 0 && 3p == 1) */ extern void tuple_set_elem(Tuple* tuple, int idx, Elem* elem); /*lint -sem( tuple_get_elem, 1p == 1 && 2n >= 0, @P > malloc(1P)) */ extern const Elem* tuple_get_elem(const Tuple* tuple, int idx); /*lint -sem( tuple_combine, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Tuple* tuple_combine(const Tuple* ta, const Tuple* tb); /*lint -sem( tuple_print, 1p == 1 && 2p == 1) */ extern void tuple_print(FILE* fp, const Tuple* tuple); /*lint -sem( tuple_hash, 1p == 1) */ extern unsigned int tuple_hash(const Tuple* tuple); /*lint -sem( tuple_tostr, 1p == 1, @P > malloc(1P) && nulterm(@)) */ extern char* tuple_tostr(const Tuple* tuple); #ifdef __cplusplus } #endif #endif /* _TUPLE_H_ */ zimpl-3.3.6/src/zimpl/mmlparse2.y0000644001417200060250000012226113304236715016603 0ustar bzfschlooptimi%{ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mmlparse2.y */ /* Name....: MML Parser */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #pragma clang diagnostic ignored "-Wdisabled-macro-expansion" #pragma clang diagnostic ignored "-Wconversion" #pragma clang diagnostic ignored "-Wsign-conversion" #pragma clang diagnostic ignored "-Wunused-macros" #pragma clang diagnostic ignored "-Wimplicit-function-declaration" #pragma clang diagnostic ignored "-Wunreachable-code" #pragma GCC diagnostic ignored "-Wstrict-prototypes" #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/symbol.h" #include "zimpl/entry.h" #include "zimpl/idxset.h" #include "zimpl/rdefpar.h" #include "zimpl/bound.h" #include "zimpl/define.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/list.h" #include "zimpl/stmt.h" #include "zimpl/local.h" #include "zimpl/code.h" #include "zimpl/inst.h" #define YYERROR_VERBOSE 1 /* the function is actually getting a YYSTYPE* as argument, but the * type isn't available here, so it is decalred to accept any number of * arguments, i.e. yylex() and not yylex(void). */ extern int yylex(); /*lint -sem(yyerror, 1p && nulterm(1), r_no) */ extern void yyerror(const char* s); %} %pure-parser %expect 12 %union { unsigned int bits; Numb* numb; const char* strg; const char* name; Symbol* sym; Define* def; CodeNode* code; }; %token DECLSET DECLPAR DECLVAR DECLMIN DECLMAX DECLSUB DECLSOS %token DEFNUMB DEFSTRG DEFBOOL DEFSET PRINT CHECK %token BINARY INTEGER REAL IMPLICIT %token ASGN DO WITH IN TO UNTIL BY FORALL EXISTS %token PRIORITY STARTVAL DEFAULT %token CMP_LE CMP_GE CMP_EQ CMP_LT CMP_GT CMP_NE INFTY %token AND OR XOR NOT %token SUM MIN MAX ARGMIN ARGMAX PROD %token IF THEN ELSE END %token INTER UNION CROSS SYMDIFF WITHOUT PROJ %token MOD DIV POW FAC %token CARD ROUND FLOOR CEIL RANDOM ORD %token ABS SGN LOG LN EXP SQRT SIN COS TAN ASIN ACOS ATAN POWER SGNPOW %token READ AS SKIP USE COMMENT MATCH %token SUBSETS INDEXSET POWERSET %token VIF VABS %token TYPE1 TYPE2 %token LENGTH SUBSTR %token NUMBSYM STRGSYM VARSYM SETSYM %token NUMBDEF STRGDEF BOOLDEF SETDEF DEFNAME %token NAME %token STRG %token NUMB %token SCALE SEPARATE CHECKONLY INDICATOR %type stmt decl_set decl_par decl_var decl_obj decl_sub decl_sos %type def_numb def_strg def_bool def_set %type exec_do command %type constraint_list constraint vbool %type cexpr cexpr_list cfactor cproduct cexpo cval %type symidx tuple tuple_list sexpr sunion sproduct sval lexpr read read_par %type idxset pure_idxset vval vproduct vfactor vexpo vexpr name_list %type cexpr_entry cexpr_entry_list set_entry set_entry_list %type par_singleton par_default %type var_type con_type lower upper priority startval %type matrix_body matrix_head %type soset sos_type %type con_attr con_attr_list %right ASGN /*%left ','*/ %left OR XOR /*%left EXISTS*/ %left AND /*%left CMP_EQ CMP_NE CMP_LE CMP_LT CMP_GE CMP_GT */ /*%left IN*/ %left NOT %left UNION WITHOUT SYMDIFF /*left INTER CROSS*/ /*%left SUM */ %left '+' '-' /*%left MIN MAX*/ /*%left PROD*/ /*%left '*' '/' MOD DIV */ %left '*' /*%right POW*/ /*%left FAC*/ %% stmt : decl_set { code_set_root($1); } | decl_par { code_set_root($1); } | decl_var { code_set_root($1); } | decl_obj { code_set_root($1); } | decl_sub { code_set_root($1); } | decl_sos { code_set_root($1); } | def_numb { code_set_root($1); } | def_strg { code_set_root($1); } | def_bool { code_set_root($1); } | def_set { code_set_root($1); } | exec_do { code_set_root($1); } ; /* ---------------------------------------------------------------------------- * --- Set Declaration * ---------------------------------------------------------------------------- */ decl_set : DECLSET NAME ASGN sexpr ';' { $$ = code_new_inst(i_newsym_set1, 3, code_new_name($2), /* Name */ code_new_inst(i_idxset_pseudo_new, 1, /* index set */ code_new_inst(i_bool_true, 0)), $4); /* initial set */ } | DECLSET NAME '[' idxset ']' ASGN sexpr ';' { $$ = code_new_inst(i_newsym_set1, 3, code_new_name($2), /* Name */ $4, /* index set */ $7); /* set */ } | DECLSET NAME '[' idxset ']' ASGN set_entry_list ';' { $$ = code_new_inst(i_newsym_set2, 3, code_new_name($2), /* Name */ $4, /* index set */ $7); /* initial set_entry_list */ } | DECLSET NAME '[' ']' ASGN set_entry_list ';' { $$ = code_new_inst(i_newsym_set2, 3, code_new_name($2), /* Name */ code_new_inst(i_idxset_pseudo_new, 1, /* index set */ code_new_inst(i_bool_true, 0)), $6); /* initial set_entry_list */ } ; set_entry_list : set_entry { $$ = code_new_inst(i_entry_list_new, 1, $1); } | set_entry_list ',' set_entry { $$ = code_new_inst(i_entry_list_add, 2, $1, $3); } | SUBSETS '(' sexpr ',' cexpr ')' { $$ = code_new_inst(i_entry_list_subsets, 3, $3, $5, code_new_numb(numb_new_integer(-1))); } | SUBSETS '(' sexpr ',' cexpr ',' cexpr ')' { $$ = code_new_inst(i_entry_list_subsets, 3, $3, $5, $7); } | POWERSET '(' sexpr ')' { $$ = code_new_inst(i_entry_list_powerset, 1, $3); } ; set_entry : tuple sexpr { $$ = code_new_inst(i_entry, 2, $1, $2); } ; /* ---------------------------------------------------------------------------- * --- Define Declaration * ---------------------------------------------------------------------------- */ def_numb : DEFNUMB DEFNAME '(' name_list ')' ASGN cexpr ';' { $$ = code_new_inst(i_newdef, 3, code_new_define($2), code_new_inst(i_tuple_new, 1, $4), $7); } ; def_strg : DEFSTRG DEFNAME '(' name_list ')' ASGN cexpr ';' { $$ = code_new_inst(i_newdef, 3, code_new_define($2), code_new_inst(i_tuple_new, 1, $4), $7); } ; def_bool : DEFBOOL DEFNAME '(' name_list ')' ASGN lexpr ';' { $$ = code_new_inst(i_newdef, 3, code_new_define($2), code_new_inst(i_tuple_new, 1, $4), $7); } ; def_set : DEFSET DEFNAME '(' name_list ')' ASGN sexpr ';' { $$ = code_new_inst(i_newdef, 3, code_new_define($2), code_new_inst(i_tuple_new, 1, $4), $7); } ; name_list : NAME { $$ = code_new_inst(i_elem_list_new, 1, code_new_name($1)); } | name_list ',' NAME { $$ = code_new_inst(i_elem_list_add, 2, $1, code_new_name($3)); } ; /* ---------------------------------------------------------------------------- * --- Param Declaration * ---------------------------------------------------------------------------- */ decl_par : DECLPAR NAME '[' idxset ']' ASGN cexpr_entry_list par_default ';' { $$ = code_new_inst(i_newsym_para1, 4, code_new_name($2), $4, $7, $8); } | DECLPAR NAME '[' idxset ']' ASGN cexpr ';' { $$ = code_new_inst(i_newsym_para2, 4, code_new_name($2), $4, $7, code_new_inst(i_nop, 0)); } | DECLPAR NAME ASGN par_singleton ';' { $$ = code_new_inst(i_newsym_para1, 4, code_new_name($2), code_new_inst(i_idxset_pseudo_new, 1, code_new_inst(i_bool_true, 0)), $4, code_new_inst(i_nop, 0)); } | DECLPAR { $$ = code_new_inst(i_nop, 0); } /* Happens when a parameter is redeclared */ ; par_singleton : cexpr_entry_list { $$ = $1; } | cexpr { $$ = code_new_inst(i_entry_list_new, 1, code_new_inst(i_entry, 2, code_new_inst(i_tuple_empty, 0), $1)); } ; par_default : /* empty */ { $$ = code_new_inst(i_nop, 0); } | DEFAULT cexpr { $$ = code_new_inst(i_entry, 2, code_new_inst(i_tuple_empty, 0), $2); } ; /* ---------------------------------------------------------------------------- * --- Var Declaration * ---------------------------------------------------------------------------- */ decl_var : DECLVAR NAME '[' idxset ']' var_type lower upper ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), $4, $6, $7, $8, code_new_numb(numb_copy(numb_unknown())), code_new_numb(numb_copy(numb_unknown()))); } | DECLVAR NAME var_type lower upper ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), code_new_inst(i_idxset_pseudo_new, 1, code_new_inst(i_bool_true, 0)), $3, $4, $5, code_new_numb(numb_copy(numb_unknown())), code_new_numb(numb_copy(numb_unknown()))); } | DECLVAR NAME '[' idxset ']' IMPLICIT BINARY ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), $4, code_new_varclass(VAR_IMP), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(0))), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(1))), code_new_numb(numb_copy(numb_unknown())), code_new_numb(numb_copy(numb_unknown()))); } | DECLVAR NAME IMPLICIT BINARY ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), code_new_inst(i_idxset_pseudo_new, 1, code_new_inst(i_bool_true, 0)), code_new_varclass(VAR_IMP), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(0))), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(1))), code_new_numb(numb_copy(numb_unknown())), code_new_numb(numb_copy(numb_unknown()))); } | DECLVAR NAME '[' idxset ']' BINARY priority startval ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), $4, code_new_varclass(VAR_INT), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(0))), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(1))), $7, $8); } | DECLVAR NAME BINARY priority startval ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), code_new_inst(i_idxset_pseudo_new, 1, code_new_inst(i_bool_true, 0)), code_new_varclass(VAR_INT), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(0))), code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(1))), $4, $5); } | DECLVAR NAME '[' idxset ']' INTEGER lower upper priority startval ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), $4, code_new_varclass(VAR_INT), $7, $8, $9, $10); } | DECLVAR NAME INTEGER lower upper priority startval ';' { $$ = code_new_inst(i_newsym_var, 7, code_new_name($2), code_new_inst(i_idxset_pseudo_new, 1, code_new_inst(i_bool_true, 0)), code_new_varclass(VAR_INT), $4, $5, $6, $7); } ; var_type : /* empty */ { $$ = code_new_varclass(VAR_CON); } | REAL { $$ = code_new_varclass(VAR_CON); } | IMPLICIT INTEGER { $$ = code_new_varclass(VAR_IMP); } ; lower : /* empty */ { $$ = code_new_inst(i_bound_new, 1, code_new_numb(numb_new_integer(0))); } | CMP_GE cexpr { $$ = code_new_inst(i_bound_new, 1, $2); } | CMP_GE '-' INFTY { $$ = code_new_bound(BOUND_MINUS_INFTY); } | CMP_GE IF lexpr THEN cexpr ELSE '-' INFTY END { $$ = code_new_inst(i_expr_if_else, 3, $3, code_new_inst(i_bound_new, 1, $5), code_new_bound(BOUND_MINUS_INFTY)); } | CMP_GE IF lexpr THEN '-' INFTY ELSE cexpr END { $$ = code_new_inst(i_expr_if_else, 3, $3, code_new_bound(BOUND_MINUS_INFTY), code_new_inst(i_bound_new, 1, $8)); } ; upper : /* empty */ { $$ = code_new_bound(BOUND_INFTY); } | CMP_LE cexpr { $$ = code_new_inst(i_bound_new, 1, $2); } | CMP_LE INFTY { $$ = code_new_bound(BOUND_INFTY); } | CMP_LE IF lexpr THEN cexpr ELSE INFTY END { $$ = code_new_inst(i_expr_if_else, 3, $3, code_new_inst(i_bound_new, 1, $5), code_new_bound(BOUND_INFTY)); } | CMP_LE IF lexpr THEN INFTY ELSE cexpr END { $$ = code_new_inst(i_expr_if_else, 3, $3, code_new_bound(BOUND_INFTY), code_new_inst(i_bound_new, 1, $7)); } ; priority : /* empty */ { $$ = code_new_numb(numb_new_integer(0)); } | PRIORITY cexpr { $$ = $2; } ; startval : /* empty */ { $$ = code_new_numb(numb_copy(numb_unknown())); } | STARTVAL cexpr { $$ = $2; } ; /* ---------------------------------------------------------------------------- * --- DATA * ---------------------------------------------------------------------------- */ cexpr_entry_list : cexpr_entry { $$ = code_new_inst(i_entry_list_new, 1, $1); } | cexpr_entry_list ',' cexpr_entry { $$ = code_new_inst(i_entry_list_add, 2, $1, $3); } | read { $$ = code_new_inst(i_read, 1, $1); } | matrix_head matrix_body { $$ = code_new_inst(i_list_matrix, 2, $1, $2); } ; cexpr_entry : tuple cexpr { $$ = code_new_inst(i_entry, 2, $1, $2); } ; matrix_head : WITH cexpr_list WITH { $$ = $2; } ; matrix_body : matrix_head cexpr_list WITH { $$ = code_new_inst(i_matrix_list_new, 2, $1, $2); } | matrix_body matrix_head cexpr_list WITH { $$ = code_new_inst(i_matrix_list_add, 3, $1, $2, $3); } ; /* ---------------------------------------------------------------------------- * --- Objective Declaration * ---------------------------------------------------------------------------- */ decl_obj : DECLMIN NAME DO vexpr ';' { $$ = code_new_inst(i_object_min, 2, code_new_name($2), $4); } | DECLMAX NAME DO vexpr ';' { $$ = code_new_inst(i_object_max, 2, code_new_name($2), $4); } ; /* ---------------------------------------------------------------------------- * --- Subto Declaration * ---------------------------------------------------------------------------- */ decl_sub : DECLSUB NAME DO constraint_list ';' { $$ = code_new_inst(i_subto, 2, code_new_name($2), $4); } ; constraint_list : constraint { $$ = code_new_inst(i_constraint_list, 2, $1, code_new_inst(i_nop, 0)); } | constraint_list AND constraint { $$ = code_new_inst(i_constraint_list, 2, $1, $3); } | FORALL idxset DO constraint_list { $$ = code_new_inst(i_constraint_list, 2, code_new_inst(i_forall, 2, $2, $4), code_new_inst(i_nop, 0)); } | IF lexpr THEN constraint_list END { $$ = code_new_inst(i_constraint_list, 2, code_new_inst(i_expr_if_else, 3, $2, $4, code_new_inst(i_nop, 0)), code_new_inst(i_nop, 0)); } | IF lexpr THEN constraint_list ELSE constraint_list END { $$ = code_new_inst(i_constraint_list, 2, code_new_inst(i_expr_if_else, 3, $2, $4, $6), code_new_inst(i_nop, 0)); } ; constraint : vexpr con_type vexpr con_attr_list { $$ = code_new_inst(i_constraint, 4, $1, $2, $3, code_new_bits($4)); } | vexpr con_type cexpr con_attr_list { $$ = code_new_inst(i_constraint, 4, $1, $2, code_new_inst(i_term_expr, 1, $3), code_new_bits($4)); } | cexpr con_type vexpr con_attr_list { $$ = code_new_inst(i_constraint, 4, code_new_inst(i_term_expr, 1, $1), $2, $3, code_new_bits($4)); } | cexpr con_type cexpr con_attr_list { $$ = code_new_inst(i_constraint, 4, code_new_inst(i_term_expr, 1, $1), $2, code_new_inst(i_term_expr, 1, $3), code_new_bits($4)); } | cexpr con_type vexpr CMP_LE cexpr con_attr_list { $$ = code_new_inst(i_rangeconst, 6, $1, $3, $5, $2, code_new_contype(CON_RHS), code_new_bits($6)); } | cexpr con_type cexpr CMP_LE cexpr con_attr_list { $$ = code_new_inst(i_rangeconst, 6, $1, code_new_inst(i_term_expr, 1, $3), $5, $2, code_new_contype(CON_RHS), code_new_bits($6)); } | cexpr con_type vexpr CMP_GE cexpr con_attr_list { $$ = code_new_inst(i_rangeconst, 6, $5, $3, $1, $2, code_new_contype(CON_LHS), code_new_bits($6)); } | cexpr con_type cexpr CMP_GE cexpr con_attr_list { $$ = code_new_inst(i_rangeconst, 6, $5, code_new_inst(i_term_expr, 1, $3), $1, $2, code_new_contype(CON_LHS), code_new_bits($6)); } | VIF vbool THEN vexpr con_type vexpr ELSE vexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, $6, $8, $9, $10, code_new_bits($12)); } | VIF vbool THEN cexpr con_type vexpr ELSE vexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, $6, $8, $9, $10, code_new_bits($12)); } | VIF vbool THEN vexpr con_type cexpr ELSE vexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, code_new_inst(i_term_expr, 1, $6), $8, $9, $10, code_new_bits($12)); } | VIF vbool THEN vexpr con_type vexpr ELSE cexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, $6, code_new_inst(i_term_expr, 1, $8), $9, $10, code_new_bits($12)); } | VIF vbool THEN vexpr con_type vexpr ELSE vexpr con_type cexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, $6, $8, $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN cexpr con_type cexpr ELSE vexpr con_type vexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, code_new_inst(i_term_expr, 1, $6), $8, $9, $10, code_new_bits($12)); } | VIF vbool THEN cexpr con_type vexpr ELSE cexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, $6, code_new_inst(i_term_expr, 1, $8), $9, $10, code_new_bits($12)); } | VIF vbool THEN cexpr con_type vexpr ELSE vexpr con_type cexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, $6, $8, $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN vexpr con_type cexpr ELSE cexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, code_new_inst(i_term_expr, 1, $6), code_new_inst(i_term_expr, 1, $8), $9, $10, code_new_bits($12)); } | VIF vbool THEN vexpr con_type cexpr ELSE vexpr con_type cexpr END con_attr_list { $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, code_new_inst(i_term_expr, 1, $6), $8, $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN vexpr con_type vexpr ELSE cexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, $6, code_new_inst(i_term_expr, 1, $8), $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN cexpr con_type cexpr ELSE cexpr con_type vexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, code_new_inst(i_term_expr, 1, $6), code_new_inst(i_term_expr, 1, $8), $9, $10, code_new_bits($12)); } | VIF vbool THEN cexpr con_type cexpr ELSE vexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, code_new_inst(i_term_expr, 1, $6), $8, $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN cexpr con_type vexpr ELSE cexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, $6, code_new_inst(i_term_expr, 1, $8), $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN vexpr con_type cexpr ELSE cexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, $4, $5, code_new_inst(i_term_expr, 1, $6), code_new_inst(i_term_expr, 1, $8), $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN cexpr con_type cexpr ELSE cexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif_else, 8, $2, code_new_inst(i_term_expr, 1, $4), $5, code_new_inst(i_term_expr, 1, $6), code_new_inst(i_term_expr, 1, $8), $9, code_new_inst(i_term_expr, 1, $10), code_new_bits($12)); } | VIF vbool THEN vexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif, 5, $2, $4, $5, $6, code_new_bits($8)); } | VIF vbool THEN cexpr con_type vexpr END con_attr_list { $$ = code_new_inst(i_vif, 5, $2, code_new_inst(i_term_expr, 1, $4), $5, $6, code_new_bits($8)); } | VIF vbool THEN vexpr con_type cexpr END con_attr_list { $$ = code_new_inst(i_vif, 5, $2, $4, $5, code_new_inst(i_term_expr, 1, $6), code_new_bits($8)); } | VIF vbool THEN cexpr con_type cexpr END con_attr_list { /* ??? This is an error */ $$ = code_new_inst(i_vif, 5, $2, code_new_inst(i_term_expr, 1, $4), $5, code_new_inst(i_term_expr, 1, $6), code_new_bits($8)); } ; vbool : vexpr CMP_NE vexpr { $$ = code_new_inst(i_vbool_ne, 2, $1, $3); } | cexpr CMP_NE vexpr { $$ = code_new_inst(i_vbool_ne, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_NE cexpr { $$ = code_new_inst(i_vbool_ne, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vexpr CMP_EQ vexpr { $$ = code_new_inst(i_vbool_eq, 2, $1, $3); } | cexpr CMP_EQ vexpr { $$ = code_new_inst(i_vbool_eq, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_EQ cexpr { $$ = code_new_inst(i_vbool_eq, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vexpr CMP_LE vexpr { $$ = code_new_inst(i_vbool_le, 2, $1, $3); } | cexpr CMP_LE vexpr { $$ = code_new_inst(i_vbool_le, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_LE cexpr { $$ = code_new_inst(i_vbool_le, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vexpr CMP_GE vexpr { $$ = code_new_inst(i_vbool_ge, 2, $1, $3); } | cexpr CMP_GE vexpr { $$ = code_new_inst(i_vbool_ge, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_GE cexpr { $$ = code_new_inst(i_vbool_ge, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vexpr CMP_LT vexpr { $$ = code_new_inst(i_vbool_lt, 2, $1, $3); } | cexpr CMP_LT vexpr { $$ = code_new_inst(i_vbool_lt, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_LT cexpr { $$ = code_new_inst(i_vbool_lt, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vexpr CMP_GT vexpr { $$ = code_new_inst(i_vbool_gt, 2, $1, $3); } | cexpr CMP_GT vexpr { $$ = code_new_inst(i_vbool_gt, 2, code_new_inst(i_term_expr, 1, $1), $3); } | vexpr CMP_GT cexpr { $$ = code_new_inst(i_vbool_gt, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | vbool AND vbool { $$ = code_new_inst(i_vbool_and, 2, $1, $3); } | vbool OR vbool { $$ = code_new_inst(i_vbool_or, 2, $1, $3); } | vbool XOR vbool { $$ = code_new_inst(i_vbool_xor, 2, $1, $3); } | NOT vbool { $$ = code_new_inst(i_vbool_not, 1, $2); } | '(' vbool ')' { $$ = $2; } ; con_attr_list : /* empty */ { $$ = 0; } | con_attr_list ',' con_attr { $$ = $1 | $3; } ; con_attr : SCALE { $$ = LP_FLAG_CON_SCALE; } | SEPARATE { $$ = LP_FLAG_CON_SEPAR; } | CHECKONLY { $$ = LP_FLAG_CON_CHECK; } | INDICATOR { $$ = LP_FLAG_CON_INDIC; } ; con_type : CMP_LE { $$ = code_new_contype(CON_RHS); } | CMP_GE { $$ = code_new_contype(CON_LHS); } | CMP_EQ { $$ = code_new_contype(CON_EQUAL); } ; vexpr : vproduct { $$ = $1; } | vexpr '+' vproduct { $$ = code_new_inst(i_term_add, 2, $1, $3); } | vexpr '-' vproduct { $$ = code_new_inst(i_term_sub, 2, $1, $3); } | vexpr '+' cproduct { $$ = code_new_inst(i_term_const, 2, $1, $3); } | vexpr '-' cproduct { $$ = code_new_inst(i_term_sub, 2, $1, code_new_inst(i_term_expr, 1, $3)); } | cexpr '+' vproduct { $$ = code_new_inst(i_term_const, 2, $3, $1); } | cexpr '-' vproduct { $$ = code_new_inst(i_term_sub, 2, code_new_inst(i_term_expr, 1, $1), $3); } ; vproduct : vfactor { $$ = $1; } | vproduct '*' cfactor { $$ = code_new_inst(i_term_coeff, 2, $1, $3); } | vproduct '/' cfactor { $$ = code_new_inst(i_term_coeff, 2, $1, code_new_inst(i_expr_div, 2, code_new_numb(numb_new_integer(1)), $3)); } | cproduct '*' vfactor { $$ = code_new_inst(i_term_coeff, 2, $3, $1); } | vproduct '*' vfactor { $$ = code_new_inst(i_term_mul, 2, $1, $3); } ; vfactor : vexpo | '+' vfactor { $$ = $2; } | '-' vfactor { $$ = code_new_inst(i_term_coeff, 2, $2, code_new_numb(numb_new_integer(-1))); } ; vexpo : vval { $$ = $1; } | vval POW cfactor { $$ = code_new_inst(i_term_power, 2, $1, $3); } | SUM idxset DO vproduct { $$ = code_new_inst(i_term_sum, 2, $2, $4); } ; vval : VARSYM symidx { $$ = code_new_inst(i_symbol_deref, 2, code_new_symbol($1), $2); } | VABS '(' vexpr ')' { $$ = code_new_inst(i_vabs, 1, $3); } | SQRT '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(-2)), $3); } | LOG '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(3)), $3); } | EXP '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(4)), $3); } | LN '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(5)), $3); } | SIN '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(6)), $3); } | COS '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(7)), $3); } | TAN '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(8)), $3); } | ABS '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(9)), $3); } | SGN '(' vexpr ')' { $$ = code_new_inst(i_vexpr_fun, 2, code_new_numb(numb_new_integer(10)), $3); } | POWER '(' vexpr ',' cexpr ')' { $$ = code_new_inst(i_vexpr_fun, 3, code_new_numb(numb_new_integer(11)), $3, $5); } | SGNPOW '(' vexpr ',' cexpr')' { $$ = code_new_inst(i_vexpr_fun, 3, code_new_numb(numb_new_integer(12)), $3, $5); } | IF lexpr THEN vexpr ELSE vexpr END { $$ = code_new_inst(i_expr_if_else, 3, $2, $4, $6); } | '(' vexpr ')' { $$ = $2; } ; /* ---------------------------------------------------------------------------- * --- SOS Declaration * ---------------------------------------------------------------------------- */ decl_sos : DECLSOS NAME DO soset ';' { $$ = code_new_inst(i_sos, 2, code_new_name($2), $4); } ; soset : sos_type priority DO vexpr { $$ = code_new_inst(i_soset, 3, $4, $1, $2); } | FORALL idxset DO soset { $$ = code_new_inst(i_forall, 2, $2, $4); } ; sos_type : /* empty */ { $$ = code_new_numb(numb_new_integer(1)); } | TYPE1 { $$ = code_new_numb(numb_new_integer(1)); } | TYPE2 { $$ = code_new_numb(numb_new_integer(2)); } ; /* ---------------------------------------------------------------------------- * --- Do Statement * ---------------------------------------------------------------------------- */ exec_do : DO command ';' { $$ = $2; } ; command : PRINT cexpr_list { $$ = code_new_inst(i_print, 1, $2); } | PRINT tuple { $$ = code_new_inst(i_print, 1, $2); } | PRINT sexpr { $$ = code_new_inst(i_print, 1, $2); } | PRINT VARSYM { $$ = code_new_inst(i_print, 1, code_new_symbol($2)); } | CHECK lexpr { $$ = code_new_inst(i_check, 1, $2); } | FORALL idxset DO command { $$ = code_new_inst(i_forall, 2, $2, $4); } ; /* ---------------------------------------------------------------------------- * --- * ---------------------------------------------------------------------------- */ idxset : pure_idxset { $$ = $1; } | sexpr { $$ = code_new_inst(i_idxset_new, 3, code_new_inst(i_tuple_empty, 0), $1, code_new_inst(i_bool_true, 0)); } ; pure_idxset : tuple IN sexpr WITH lexpr { $$ = code_new_inst(i_idxset_new, 3, $1, $3, $5); } | tuple IN sexpr { $$ = code_new_inst(i_idxset_new, 3, $1, $3, code_new_inst(i_bool_true, 0)); } ; sexpr : sunion | sexpr UNION sunion { $$ = code_new_inst(i_set_union, 2, $1, $3); } | sexpr '+' sunion { $$ = code_new_inst(i_set_union, 2, $1, $3); } | sexpr SYMDIFF sunion { $$ = code_new_inst(i_set_sdiff, 2, $1, $3); } | sexpr '-' sunion { $$ = code_new_inst(i_set_minus, 2, $1, $3); } | sexpr WITHOUT sunion { $$ = code_new_inst(i_set_minus, 2, $1, $3); } | sexpr INTER sunion { $$ = code_new_inst(i_set_inter, 2, $1, $3); } ; sunion : sproduct | UNION idxset DO sproduct { $$ = code_new_inst(i_set_union2, 2, $2, $4); } ; sproduct : sval | sproduct CROSS sval %prec '*' { $$ = code_new_inst(i_set_cross, 2, $1, $3); } | sproduct '*' sval { $$ = code_new_inst(i_set_cross, 2, $1, $3); } | INTER idxset DO sval { $$ = code_new_inst(i_set_inter2, 2, $2, $4); } ; sval : SETSYM symidx { $$ = code_new_inst(i_symbol_deref, 2, code_new_symbol($1), $2); } | SETDEF '(' cexpr_list ')' { $$ = code_new_inst(i_define_deref, 2, code_new_define($1), code_new_inst(i_tuple_new, 1, $3)); } | '{' '}' { $$ = code_new_inst(i_set_empty, 1, code_new_size(0)); } | '{' cexpr TO cexpr BY cexpr '}' { $$ = code_new_inst(i_set_range2, 3, $2, $4, $6); } | '{' cexpr TO cexpr '}' { $$ = code_new_inst(i_set_range2, 3, $2, $4, code_new_numb(numb_new_integer(1))); } | '{' cexpr UNTIL cexpr BY cexpr '}' { $$ = code_new_inst(i_set_range, 3, $2, $4, $6); } | '{' cexpr UNTIL cexpr '}' { $$ = code_new_inst(i_set_range, 3, $2, $4, code_new_numb(numb_new_integer(1))); } | ARGMIN idxset DO cexpr %prec UNION { $$ = code_new_inst(i_set_argmin, 3, code_new_numb(numb_new_integer(1)), $2, $4); } | ARGMIN '(' cexpr ')' idxset DO cexpr %prec UNION { $$ = code_new_inst(i_set_argmin, 3, $3, $5, $7); } | ARGMAX idxset DO cexpr %prec UNION { $$ = code_new_inst(i_set_argmax, 3, code_new_numb(numb_new_integer(1)), $2, $4); } | ARGMAX '(' cexpr ')' idxset DO cexpr %prec UNION { $$ = code_new_inst(i_set_argmax, 3, $3, $5, $7); } | '(' sexpr ')' { $$ = $2; } | '{' tuple_list '}' { $$ = code_new_inst(i_set_new_tuple, 1, $2); } | '{' cexpr_list '}' { $$ = code_new_inst(i_set_new_elem, 1, $2); } | '{' idxset '}' { $$ = code_new_inst(i_set_idxset, 1, $2); } | '{' idxset DO cexpr '}' { $$ = code_new_inst(i_set_expr, 2, $2, $4); } | '{' idxset DO tuple '}' { $$ = code_new_inst(i_set_expr, 2, $2, $4); } | PROJ '(' sexpr ',' tuple ')' { $$ = code_new_inst(i_set_proj, 2, $3, $5); } | INDEXSET '(' SETSYM ')' { $$ = code_new_inst(i_set_indexset, 1, code_new_symbol($3)); } | IF lexpr THEN sexpr ELSE sexpr END { $$ = code_new_inst(i_expr_if_else, 3, $2, $4, $6); } ; read : READ cexpr AS cexpr { $$ = code_new_inst(i_read_new, 2, $2, $4); } | read read_par { $$ = code_new_inst(i_read_param, 2, $1, $2); } ; read_par : SKIP cexpr { $$ = code_new_inst(i_read_skip, 1, $2); } | USE cexpr { $$ = code_new_inst(i_read_use, 1, $2); } | COMMENT cexpr { $$ = code_new_inst(i_read_comment, 1, $2); } | MATCH cexpr { $$ = code_new_inst(i_read_match, 1, $2); } ; tuple_list : tuple { $$ = code_new_inst(i_tuple_list_new, 1, $1); } | tuple_list ',' tuple { $$ = code_new_inst(i_tuple_list_add, 2, $1, $3); } | read { $$ = code_new_inst(i_read, 1, $1); } ; lexpr : cexpr CMP_EQ cexpr { $$ = code_new_inst(i_bool_eq, 2, $1, $3); } | cexpr CMP_NE cexpr { $$ = code_new_inst(i_bool_ne, 2, $1, $3); } | cexpr CMP_GT cexpr { $$ = code_new_inst(i_bool_gt, 2, $1, $3); } | cexpr CMP_GE cexpr { $$ = code_new_inst(i_bool_ge, 2, $1, $3); } | cexpr CMP_LT cexpr { $$ = code_new_inst(i_bool_lt, 2, $1, $3); } | cexpr CMP_LE cexpr { $$ = code_new_inst(i_bool_le, 2, $1, $3); } | sexpr CMP_EQ sexpr { $$ = code_new_inst(i_bool_seq, 2, $1, $3); } | sexpr CMP_NE sexpr { $$ = code_new_inst(i_bool_sneq, 2, $1, $3); } | sexpr CMP_GT sexpr { $$ = code_new_inst(i_bool_subs, 2, $3, $1); } | sexpr CMP_GE sexpr { $$ = code_new_inst(i_bool_sseq, 2, $3, $1); } | sexpr CMP_LT sexpr { $$ = code_new_inst(i_bool_subs, 2, $1, $3); } | sexpr CMP_LE sexpr { $$ = code_new_inst(i_bool_sseq, 2, $1, $3); } | lexpr AND lexpr { $$ = code_new_inst(i_bool_and, 2, $1, $3); } | lexpr OR lexpr { $$ = code_new_inst(i_bool_or, 2, $1, $3); } | lexpr XOR lexpr { $$ = code_new_inst(i_bool_xor, 2, $1, $3); } | NOT lexpr { $$ = code_new_inst(i_bool_not, 1, $2); } | '(' lexpr ')' { $$ = $2; } | tuple IN sexpr { $$ = code_new_inst(i_bool_is_elem, 2, $1, $3); } | EXISTS '(' idxset ')' { $$ = code_new_inst(i_bool_exists, 1, $3); } | BOOLDEF '(' cexpr_list ')' { $$ = code_new_inst(i_define_deref, 2, code_new_define($1), code_new_inst(i_tuple_new, 1, $3)); } | IF lexpr THEN lexpr ELSE lexpr END { $$ = code_new_inst(i_expr_if_else, 3, $2, $4, $6); } ; tuple : CMP_LT CMP_GT { $$ = code_new_inst(i_tuple_empty, 0); } | CMP_LT cexpr_list CMP_GT { $$ = code_new_inst(i_tuple_new, 1, $2); } ; symidx : /* empty */ { $$ = code_new_inst(i_tuple_empty, 0); } | '[' cexpr_list ']' { $$ = code_new_inst(i_tuple_new, 1, $2); } ; cexpr_list : cexpr { $$ = code_new_inst(i_elem_list_new, 1, $1); } | cexpr_list ',' cexpr { $$ = code_new_inst(i_elem_list_add, 2, $1, $3); } ; cexpr : cproduct { $$ = $1; } | cexpr '+' cproduct { $$ = code_new_inst(i_expr_add, 2, $1, $3); } | cexpr '-' cproduct { $$ = code_new_inst(i_expr_sub, 2, $1, $3); } ; cproduct : cfactor { $$ = $1; } | cproduct '*' cfactor { $$ = code_new_inst(i_expr_mul, 2, $1, $3); } | cproduct '/' cfactor { $$ = code_new_inst(i_expr_div, 2, $1, $3); } | cproduct MOD cfactor { $$ = code_new_inst(i_expr_mod, 2, $1, $3); } | cproduct DIV cfactor { $$ = code_new_inst(i_expr_intdiv, 2, $1, $3); } | PROD idxset DO cfactor { $$ = code_new_inst(i_expr_prod, 2, $2, $4); } ; cfactor : cexpo | '+' cexpo { $$ = $2; } | '-' cexpo { $$ = code_new_inst(i_expr_neg, 1, $2); } ; cexpo : cval | cval POW cfactor { $$ = code_new_inst(i_expr_pow, 2, $1, $3); } | SUM idxset DO cproduct { $$ = code_new_inst(i_expr_sum, 2, $2, $4); } | MIN pure_idxset DO cfactor { $$ = code_new_inst(i_expr_min, 2, $2, $4); } | MAX pure_idxset DO cfactor { $$ = code_new_inst(i_expr_max, 2, $2, $4); } | MIN '(' idxset ')' { $$ = code_new_inst(i_expr_sglmin, 1, $3); } | MAX '(' idxset ')' { $$ = code_new_inst(i_expr_sglmax, 1, $3); } ; cval : NUMB { $$ = code_new_numb($1); } | STRG { $$ = code_new_strg($1); } | NAME { $$ = code_new_inst(i_local_deref, 1, code_new_name($1)); } | NUMBSYM symidx { $$ = code_new_inst(i_symbol_deref, 2, code_new_symbol($1), $2); } | STRGSYM symidx { $$ = code_new_inst(i_symbol_deref, 2, code_new_symbol($1), $2); } | NUMBDEF '(' cexpr_list ')' { $$ = code_new_inst(i_define_deref, 2, code_new_define($1), code_new_inst(i_tuple_new, 1, $3)); } | STRGDEF '(' cexpr_list ')' { $$ = code_new_inst(i_define_deref, 2, code_new_define($1), code_new_inst(i_tuple_new, 1, $3)); } | cval FAC { $$ = code_new_inst(i_expr_fac, 1, $1); } | CARD '(' sexpr ')' { $$ = code_new_inst(i_expr_card, 1, $3); } | ABS '(' cexpr ')' { $$ = code_new_inst(i_expr_abs, 1, $3); } | SGN '(' cexpr ')' { $$ = code_new_inst(i_expr_sgn, 1, $3); } | ROUND '(' cexpr ')' { $$ = code_new_inst(i_expr_round, 1, $3); } | FLOOR '(' cexpr ')' { $$ = code_new_inst(i_expr_floor, 1, $3); } | CEIL '(' cexpr ')' { $$ = code_new_inst(i_expr_ceil, 1, $3); } | LOG '(' cexpr ')' { $$ = code_new_inst(i_expr_log, 1, $3); } | LN '(' cexpr ')' { $$ = code_new_inst(i_expr_ln, 1, $3); } | EXP '(' cexpr ')' { $$ = code_new_inst(i_expr_exp, 1, $3); } | SQRT '(' cexpr ')' { $$ = code_new_inst(i_expr_sqrt, 1, $3); } | SIN '(' cexpr ')' { $$ = code_new_inst(i_expr_sin, 1, $3); } | COS '(' cexpr ')' { $$ = code_new_inst(i_expr_cos, 1, $3); } | TAN '(' cexpr ')' { $$ = code_new_inst(i_expr_tan, 1, $3); } | ASIN '(' cexpr ')' { $$ = code_new_inst(i_expr_asin, 1, $3); } | ACOS '(' cexpr ')' { $$ = code_new_inst(i_expr_acos, 1, $3); } | ATAN '(' cexpr ')' { $$ = code_new_inst(i_expr_atan, 1, $3); } | '(' cexpr ')' { $$ = $2; } | LENGTH '(' cexpr ')' { $$ = code_new_inst(i_expr_length, 1, $3); } | SUBSTR '(' cexpr ',' cexpr ',' cexpr ')' { $$ = code_new_inst(i_expr_substr, 3, $3, $5, $7); } | RANDOM '(' cexpr ',' cexpr ')' { $$ = code_new_inst(i_expr_rand, 2, $3, $5); } | IF lexpr THEN cexpr ELSE cexpr END { $$ = code_new_inst(i_expr_if_else, 3, $2, $4, $6); } | ORD '(' sexpr ',' cexpr ',' cexpr ')' { $$ = code_new_inst(i_expr_ord, 3, $3, $5, $7); } | MIN '(' cexpr_list ')' { $$ = code_new_inst(i_expr_min2, 1, $3); } | MAX '(' cexpr_list ')' { $$ = code_new_inst(i_expr_max2, 1, $3); } ; zimpl-3.3.6/src/zimpl/term2.c0000644001417200060250000004126513304236715015710 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: term2.c */ /* Name....: Term Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include /* #define TRACE 1 */ #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/bound.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/mono.h" #include "zimpl/hash.h" #include "zimpl/term.h" #include "zimpl/stmt.h" #include "zimpl/prog.h" #include "zimpl/xlpglue.h" #define TERM_EXTEND_SIZE 16 #define TERM_SID 0x5465726d struct term { SID Numb* constant; int size; int used; Mono** elem; }; Term* term_new(int size) { Term* term = calloc(1, sizeof(*term)); Trace("term_new"); assert(term != NULL); assert(size > 0); term->constant = numb_new_integer(0); term->size = size; term->used = 0; term->elem = calloc((size_t)term->size, sizeof(*term->elem)); SID_set(term, TERM_SID); assert(term_is_valid(term)); return term; } void term_add_elem(Term* term, const Entry* entry, const Numb* coeff, MFun mfun) { Trace("term_add_elem"); assert(term_is_valid(term)); assert(entry_is_valid(entry)); assert(!numb_equal(coeff, numb_zero())); assert(term->used <= term->size); if (term->used == term->size) { term->size += TERM_EXTEND_SIZE; term->elem = realloc( term->elem, (size_t)term->size * sizeof(*term->elem)); assert(term->elem != NULL); } assert(term->used < term->size); term->elem[term->used] = mono_new(coeff, entry, mfun); term->used++; assert(term_is_valid(term)); } #if 0 /* not used */ void term_mul_elem(Term* term, const Entry* entry, const Numb* coeff) { int i; Trace("term_mul_elem"); assert(term_is_valid(term)); assert(entry_is_valid(entry)); assert(!numb_equal(coeff, numb_zero())); assert(term->used <= term->size); for(i = 0; i < term->used; i++) { mono_mul_entry(term->elem[i], entry); mono_mul_coeff(term->elem[i], coeff); } assert(term_is_valid(term)); } #endif void term_free(Term* term) { int i; Trace("term_free"); assert(term_is_valid(term)); SID_del(term); for(i = 0; i < term->used; i++) mono_free(term->elem[i]); numb_free(term->constant); free(term->elem); free(term); } bool term_is_valid(const Term* term) { int i; if (term == NULL || !SID_ok(term, TERM_SID) || term->used > term->size) abort(); for(i = 0; i < term->used; i++) if (numb_equal(mono_get_coeff(term->elem[i]), numb_zero())) abort(); return true; } Term* term_copy(const Term* term) { Term* tnew = term_new(term->used + TERM_EXTEND_SIZE); int i; Trace("term_copy"); assert(term_is_valid(term)); assert(term_is_valid(tnew)); for(i = 0; i < term->used; i++) tnew->elem[i] = mono_copy(term->elem[i]); tnew->used = term->used; numb_set(tnew->constant, term->constant); assert(term_is_valid(tnew)); return tnew; } void term_append_term( Term* term, const Term* term_b) { int i; /* ??? test auf gleiche monome fehlt!!! */ Trace("term_append_term"); assert(term_is_valid(term)); assert(term_is_valid(term_b)); if (term->used + term_b->used >= term->size) { term->size = term->used + term_b->used; term->elem = realloc( term->elem, (size_t)(term->size + TERM_EXTEND_SIZE)* sizeof(*term->elem)); assert(term->elem != NULL); } assert(term->used + term_b->used <= term->size); if (!numb_equal(term_b->constant, numb_zero())) numb_add(term->constant, term_b->constant); for(i = 0; i < term_b->used; i++) { term->elem[term->used] = mono_copy(term_b->elem[i]); term->used++; } assert(term_is_valid(term)); } Term* term_mul_term(const Term* term_a, const Term* term_b) { Term* term; Term* term_simplified; int i; int k; Trace("term_mul_term"); assert(term_is_valid(term_a)); assert(term_is_valid(term_b)); term = term_new((term_a->used + 1) * (term_b->used + 1)); /* +1 for constant */ for(i = 0; i < term_a->used; i++) { for(k = 0; k < term_b->used; k++) { assert(term->used < term->size); term->elem[term->used] = mono_mul(term_a->elem[i], term_b->elem[k]); term->used++; } } if (!numb_equal(term_b->constant, numb_zero())) { for(i = 0; i < term_a->used; i++) { assert(term->used < term->size); term->elem[term->used] = mono_copy(term_a->elem[i]); mono_mul_coeff(term->elem[term->used], term_b->constant); term->used++; } } if (!numb_equal(term_a->constant, numb_zero())) { for(i = 0; i < term_b->used; i++) { assert(term->used < term->size); term->elem[term->used] = mono_copy(term_b->elem[i]); mono_mul_coeff(term->elem[term->used], term_a->constant); term->used++; } } numb_free(term->constant); term->constant = numb_new_mul(term_a->constant, term_b->constant); assert(term_is_valid(term)); term_simplified = term_simplify(term); term_free(term); return term_simplified; } Term* term_add_term(const Term* term_a, const Term* term_b) { Term* term; int i; Trace("term_add_term"); assert(term_is_valid(term_a)); assert(term_is_valid(term_b)); term = term_new(term_a->used + term_b->used + TERM_EXTEND_SIZE); term->used = term_a->used + term_b->used; numb_set(term->constant, term_a->constant); numb_add(term->constant, term_b->constant); assert(term->size >= term->used); for(i = 0; i < term_a->used; i++) term->elem[i] = mono_copy(term_a->elem[i]); for(i = 0; i < term_b->used; i++) term->elem[i + term_a->used] = mono_copy(term_b->elem[i]); assert(term_is_valid(term)); return term; } Term* term_sub_term(const Term* term_a, const Term* term_b) { Term* term; int i; Trace("term_sub_term"); assert(term_is_valid(term_a)); assert(term_is_valid(term_b)); term = term_new(term_a->used + term_b->used + TERM_EXTEND_SIZE); term->used = term_a->used + term_b->used; numb_set(term->constant, term_a->constant); numb_sub(term->constant, term_b->constant); assert(term->size >= term->used); for(i = 0; i < term_a->used; i++) term->elem[i] = mono_copy(term_a->elem[i]); for(i = 0; i < term_b->used; i++) { term->elem[i + term_a->used] = mono_copy(term_b->elem[i]); mono_neg(term->elem[i + term_a->used]); } assert(term_is_valid(term)); return term; } /** Combines monoms in the term where possible */ /* ??? TODO:reimplement with a hash list */ #if 1 Term* term_simplify(const Term* term_org) { Term* term; int i; Hash* hash; assert(term_is_valid(term_org)); term = term_new(term_org->used); hash = hash_new(HASH_MONO, term_org->used); numb_set(term->constant, term_org->constant); for(i = 0; i < term_org->used; i++) { const Mono* mono = hash_lookup_mono(hash, term_org->elem[i]); if (mono == NULL) { term->elem[term->used] = mono_copy(term_org->elem[i]); hash_add_mono(hash, term->elem[term->used]); term->used++; } else { assert(mono_equal(mono, term_org->elem[i])); mono_add_coeff(mono, mono_get_coeff(term_org->elem[i])); } } hash_free(hash); /* Check if there are any cancellations */ for(i = 0; i < term->used; i++) { if (numb_equal(mono_get_coeff(term->elem[i]), numb_zero())) { mono_free(term->elem[i]); if (term->used > 0) { term->used--; term->elem[i] = term->elem[term->used]; } } } assert(term_is_valid(term)); return term; } #else /* Old and quadratic */ Term* term_simplify(const Term* term_org) { Term* term; Bool* done; int i; assert(term_is_valid(term_org)); term = term_new(term_org->used); done = calloc(term_org->used, sizeof(*done)); assert(done != NULL); numb_set(term->constant, term_org->constant); for(i = 0; i < term_org->used; i++) { int k; if (done[i]) continue; term->elem[term->used] = mono_copy(term_org->elem[i]); for(k = i + 1; k < term_org->used; k++) { if (!done[k] && mono_equal(term->elem[term->used], term_org->elem[k])) { mono_add_coeff(term->elem[term->used], mono_get_coeff(term_org->elem[k])); done[k] = true; } } if (!numb_equal(mono_get_coeff(term->elem[term->used]), numb_zero())) term->used++; else mono_free(term->elem[term->used]); } free(done); assert(term_is_valid(term)); return term; } #endif /*lint -e{818} supress "Pointer parameter 'term' could be declared as pointing to const" */ void term_add_constant( Term* term, const Numb* value) { Trace("term_add_constant"); assert(term_is_valid(term)); numb_add(term->constant, value); assert(term_is_valid(term)); } /*lint -e{818} supress "Pointer parameter 'term' could be declared as pointing to const" */ void term_sub_constant(Term* term, const Numb* value) { Trace("term_sub_constant"); assert(term_is_valid(term)); numb_sub(term->constant, value); assert(term_is_valid(term)); } void term_mul_coeff(Term* term, const Numb* value) { int i; Trace("term_mul_coeff"); assert(term_is_valid(term)); numb_mul(term->constant, value); if (numb_equal(value, numb_zero())) { for(i = 0; i < term->used; i++) mono_free(term->elem[i]); term->used = 0; } else { for(i = 0; i < term->used; i++) mono_mul_coeff(term->elem[i], value); } assert(term_is_valid(term)); } const Numb* term_get_constant(const Term* term) { assert(term_is_valid(term)); return term->constant; } #if 0 /* not used */ void term_negate(Term* term) { Trace("term_negate"); assert(term_is_valid(term)); term_mul_coeff(term, numb_minusone()); } #endif void term_to_objective(const Term* term) { Var* var; int i; Trace("term_to_objective"); assert(term_is_valid(term)); /* If we have a constant in the objective, generate an artificial * variable @OOffset fixed to the value. This works allways. * This is needed because there is no general way for example in * MPS format to specify an objective value offset. */ if (!numb_equal(term->constant, numb_zero())) { const char* format = "%sObjOffset"; Bound* lower = bound_new(BOUND_VALUE, numb_one()); Bound* upper = bound_new(BOUND_VALUE, numb_one()); char* vname = malloc(strlen(SYMBOL_NAME_INTERNAL) + strlen(format) + 1); sprintf(vname, format, SYMBOL_NAME_INTERNAL); var = xlp_addvar(prog_get_lp(), vname, VAR_CON, lower, upper, numb_zero(), numb_zero()); xlp_addtocost(prog_get_lp(), var, term->constant); free(vname); bound_free(upper); bound_free(lower); } for(i = 0; i < term->used; i++) { const Numb* coeff = mono_get_coeff(term->elem[i]); assert(!numb_equal(coeff, numb_zero())); assert(mono_is_linear(term->elem[i])); var = mono_get_var(term->elem[i], 0); xlp_addtocost(prog_get_lp(), var, coeff); } } int term_get_elements(const Term* term) { assert(term_is_valid(term)); return term->used; } Mono* term_get_element(const Term* term, int i) { assert(term_is_valid(term)); assert(i >= 0); assert(i < term->used); return term->elem[i]; } Bound* term_get_lower_bound(const Term* term) { Bound* bound; Numb* lower; Numb* value; int i; lower = numb_new_integer(0); for(i = 0; i < term->used; i++) { const Numb* coeff = mono_get_coeff(term->elem[i]); int sign = numb_get_sgn(coeff); assert(sign != 0); bound = (sign > 0) ? xlp_getlower(prog_get_lp(), mono_get_var(term->elem[i], 0)) : xlp_getupper(prog_get_lp(), mono_get_var(term->elem[i], 0)); if (bound_get_type(bound) != BOUND_VALUE) goto finish; value = numb_new_mul(bound_get_value(bound), coeff); numb_add(lower, value); bound_free(bound); numb_free(value); } numb_add(lower, term->constant); bound = bound_new(BOUND_VALUE, lower); finish: numb_free(lower); return bound; } Bound* term_get_upper_bound(const Term* term) { Bound* bound; Numb* upper; Numb* value; int i; upper = numb_new_integer(0); for(i = 0; i < term->used; i++) { const Numb* coeff = mono_get_coeff(term->elem[i]); int sign = numb_get_sgn(coeff); assert(sign != 0); bound = (sign > 0) ? xlp_getupper(prog_get_lp(), mono_get_var(term->elem[i], 0)) : xlp_getlower(prog_get_lp(), mono_get_var(term->elem[i], 0)); if (bound_get_type(bound) != BOUND_VALUE) goto finish; value = numb_new_mul(bound_get_value(bound), coeff); numb_add(upper, value); bound_free(bound); numb_free(value); } numb_add(upper, term->constant); bound = bound_new(BOUND_VALUE, upper); finish: numb_free(upper); return bound; } int term_get_degree(const Term* term) { int degree = 0; int i; for(i = 0; i < term->used; i++) if (degree < mono_get_degree(term->elem[i])) degree = mono_get_degree(term->elem[i]); return degree; } bool term_is_linear(const Term* term) { int i; for(i = 0; i < term->used; i++) if (!mono_is_linear(term->elem[i])) return false; return true; } bool term_is_polynomial(const Term* term) { int i; for(i = 0; i < term->used; i++) if ((mono_get_function(term->elem[i]) != MFUN_NONE) && (mono_get_function(term->elem[i]) != MFUN_TRUE) && (mono_get_function(term->elem[i]) != MFUN_FALSE)) return false; return true; } Term* term_make_conditional(const Term* ind_term, const Term* cond_term, bool is_true) { Term* term; assert(term_is_valid(ind_term)); assert(term_is_valid(cond_term)); assert(term_get_elements(ind_term) == 1); assert(term_get_degree(ind_term) == 1); assert(numb_equal(mono_get_coeff(term_get_element(ind_term, 0)), numb_one())); term = term_copy(ind_term); mono_set_function(term_get_element(term, 0), is_true ? MFUN_TRUE : MFUN_FALSE); term_append_term(term, cond_term); return term; } bool term_is_all_integer(const Term* term) { int i; for(i = 0; i < term->used; i++) { VarClass vc = xlp_getclass(prog_get_lp(), mono_get_var(term->elem[i], 0)); if (vc != VAR_INT && vc != VAR_IMP) return false; } return true; } #ifndef NDEBUG void term_print(FILE* fp, const Term* term, bool print_symbol_index) { int i; assert(term_is_valid(term)); for(i = 0; i < term->used; i++) mono_print(fp, term->elem[i], print_symbol_index); if (!numb_equal(term->constant, numb_zero())) { if (numb_cmp(term->constant, numb_zero()) >= 0) fprintf(fp, " + %.16g ", numb_todbl(term->constant)); else fprintf(fp, " - %.16g ", -numb_todbl(term->constant)); } } #endif /* !NDEBUG */ zimpl-3.3.6/src/zimpl/zlpglue.c0000644001417200060250000001072113304236715016332 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: zlpglue.c */ /* Name....: LP Storage Interface Zimpl commandline part */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/bound.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/zlpglue.h" /*lint -esym(818, lp) 'lp' could be declared as pointing to const */ static const char* const title = "This file was automatically generated by Zimpl"; /** Print some statistics about the mathematical program stored. */ void zlp_stat( Lps* lp) /**< Pointer to storage */ { assert(lp != NULL); lps_stat(lp); } /** Set the maximal length for generated variable and constraint names. */ void zlp_setnamelen( Lps* lp, /**< Pointer to storage */ int name_len) /**< Maximal length for generated variable and constraint names */ { assert(lp != NULL); lps_setnamelen(lp, name_len); } #if 0 /* Not used anymore */ bool zlp_presolve(Lps* lp) { PSResult res; res = lps_presolve(lp, verbose); switch(res) { case PRESOLVE_INFEASIBLE : printf("Model is infeasible\n"); return false; case PRESOLVE_UNBOUNDED : printf("Model is unbounded\n"); return false; case PRESOLVE_VANISHED : printf("Presolve solved the problem -- see .tbl file for values\n"); break; case PRESOLVE_OKAY : break; default : abort(); } return true; } #endif /** Write mathematical program to file. */ void zlp_write( Lps* lp, /**< Pointer to storage */ FILE* fp, /**< File pointer to write to */ LpFormat format, /**< File format */ const char* text) /**< Comment to be written into the file */ { assert(lp != NULL); assert(fp != NULL); lps_scale(lp); lps_write(lp, fp, format, text); } /** Write variable and constraint translation table to file. * Depending on the maximal allowed name length, variable and constraint * names will be mangled to keep them unique. This table provied the * necessary translation between the mangled and the original name. */ void zlp_transtable( Lps* lp, /**< Pointer to storage */ FILE* fp, /**< File pointer to write to */ LpFormat format) /**< File format */ { assert(lp != NULL); assert(fp != NULL); lps_transtable(lp, fp, format, "zimpl"); } /** Write branching ordering information to file. */ void zlp_orderfile( Lps* lp, /**< Pointer to storage */ FILE* fp, /**< File pointer to write to */ LpFormat format) /**< File format */ { assert(lp != NULL); assert(fp != NULL); lps_orderfile(lp, fp, format, title); } /** Write Mip STart file. */ void zlp_mstfile( Lps* lp, /**< Pointer to storage */ FILE* fp, /**< File pointer to write to */ LpFormat format) /**< File format */ { assert(lp != NULL); assert(fp != NULL); lps_mstfile(lp, fp, format, title); } zimpl-3.3.6/src/zimpl/ratsoswrite.c0000644001417200060250000000546513304236715017247 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratsoswrite.c */ /* Name....: SOS File Write */ /* Author..: Thorsten Koch, Daniel Junglas */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2005-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/mshell.h" #include #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" #include "zimpl/mme.h" /* Write SOS definitions to a file. * A specification for the SOS file format can be found in the * ILOG CPLEX Reference Manual. */ void lps_sosfile( const Lps* lp, FILE* fp, LpFormat format, const char* text) { const Sos* sos; const Sse* sse; int name_size; char* vtmp; assert(lp != NULL); assert(fp != NULL); assert(format == LP_FORM_LPF || format == LP_FORM_MPS); name_size = lps_getnamesize(lp, format); vtmp = malloc((size_t)name_size); assert(vtmp != NULL); if (text != NULL) fprintf(fp, "* %s\n", text); fprintf(fp, "NAME %8.8s\n", lp->name); for(sos = lp->sos_root; sos != NULL; sos = sos->next) { fprintf(fp, "* %s\n", sos->name); fprintf(fp, " S%d %d\n", sos->type == SOS_TYPE1 ? 1 : 2, sos->priority); for (sse = sos->first; sse != NULL; sse = sse->next) { lps_makename(vtmp, name_size, sse->var->name, sse->var->number); fprintf(fp, " %-*s %.10g\n", name_size - 1, vtmp, mpq_get_d(sse->weight)); } } fprintf(fp, "ENDATA\n"); free(vtmp); } zimpl-3.3.6/src/zimpl/symbol.h0000644001417200060250000000744513304236715016173 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: symbol.h */ /* Name....: Symbol Table Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _SYMBOL_H_ #define _SYMBOL_H_ #ifndef _TUPLE_H_ #error "Need to include tuple.h before symbol.h" #endif #ifndef _SET_H_ #error "Need to include set.h before symbol.h" #endif #ifndef _MME_H_ #error "Need to include mme.h before symbol.h" #endif #ifdef __cplusplus extern "C" { #endif /*lint -sem( symbol_new, nulterm(1), 1p && 3p == 1 && 4n >= 0, @P > malloc(1P)) */ extern Symbol* symbol_new(const char* name, SymbolType type, const Set* set, int estimated_size, const Entry* deflt); extern void symbol_exit(void); /*lint -sem( symbol_is_valid, 1p == 1) */ extern bool symbol_is_valid(const Symbol* symbol); /*lint -sem( symbol_lookup, nulterm(1), 1p, r_null) */ extern Symbol* symbol_lookup(const char* name); /*lint -sem( symbol_has_entry, 1p == 1 && 2p == 1) */ extern bool symbol_has_entry(const Symbol* sym, const Tuple* tuple); /*lint -sem( symbol_lookup_entry, 1p == 1 && 2p == 1) */ extern const Entry* symbol_lookup_entry(const Symbol* sym, const Tuple* tuple); /*lint -sem( symbol_add_entry, custodial(2), 1p == 1 && 2p == 1) */ extern void symbol_add_entry(Symbol* sym, Entry* entry); /*lint -sem( symbol_get_dim, 1p == 1, @n >= 0) */ extern int symbol_get_dim(const Symbol* sym); /*lint -sem( symbol_get_iset, 1p == 1, @P > malloc(1P)) */ extern const Set* symbol_get_iset(const Symbol* sym); /*lint -sem( symbol_get_name, 1p == 1, @p && nulterm(@)) */ extern const char* symbol_get_name(const Symbol* sym); /*lint -sem( symbol_get_type, 1p == 1) */ extern SymbolType symbol_get_type(const Symbol* sym); /*lint -sem( symbol_get_numb, 1p == 1) */ extern const Numb* symbol_get_numb(const Symbol* sym, int idx); /*lint -sem( symbol_get_strg, 1p == 1, @p && nulterm(@)) */ extern const char* symbol_get_strg(const Symbol* sym, int idx); /*lint -sem( symbol_get_set, 1p == 1, @P > malloc(1P)) */ extern const Set* symbol_get_set(const Symbol* sym, int idx); /*lint -sem( symbol_get_var, 1p == 1, @P > malloc(1P)) */ extern Var* symbol_get_var(const Symbol* sym, int idx); /*lint -sem( symbol_print, 1p == 1 && 2p == 1) */ extern void symbol_print(FILE* fp, const Symbol* sym); /*lint -sem( symbol_print_all, 1p == 1) */ extern void symbol_print_all(FILE* fp); #ifdef __cplusplus } #endif #endif /* _SYMBOL_H_ */ zimpl-3.3.6/src/zimpl/lint.h0000644001417200060250000000676313304236715015636 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: lint.h */ /* Name....: Lint defines */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _LINT_H_ #define _LINT_H_ /* Use this file only if we are linting */ #ifdef _lint #if 0 #ifdef __cplusplus extern "C" { #endif /* Unfortunately strdup() is not a POSIX function. */ /*lint -sem(strdup, 1p && nulterm(1), @P == malloc(1P) && nulterm(@p)) */ extern char* strdup(const char* s); /* It is not clear if isinf() and isnan() are already POSIX * or only in the next Draft. */ extern int isinf(double); extern int isnan(double); extern int isfinite(double); extern int finite(double); /* This is probably not POSIX */ /*lint -esym(757, optarg, optind, opterr, optopt) */ /*lint -sem(getopt, 1n > 0 && 2p && 3p) */ extern int getopt(int argc, char* const argv[], const char* optstring); extern char* optarg; extern int optind; extern int opterr; extern int optopt; /*lint -function(fopen, popen) */ extern FILE* popen(const char *command, const char *type); /*lint -function(fclose, pclose) */ /*lint -esym(534, pclose) */ extern int pclose(FILE *stream); /*lint -sem(fsync, 1n >= 0, @n <= 0) */ extern int fsync(int fd); /* zlib support */ /*lint -esym(534,gzclose) */ typedef void* gzFile; /*lint -sem( gzopen, 1p && nulterm(1) && 2p && nulterm(2), r_null) */ extern gzFile gzopen(const char *path, const char *mode); /*lint -sem( gzread, 1p == 1 && 2p) */ extern int gzread(gzFile file, void* buf, unsigned len); /*lint -sem( gzwrite, 1p == 1 && 2p) */ extern int gzwrite(gzFile file, const void* buf, unsigned len); /*lint -sem( gzputs, 1p == 1 && 2p && nulterm(2)) */ extern int gzputs(gzFile file, const char *s); /*lintx -sem( gzgets, 1p == 1 && 2p > 0 && 2P <= 3n && 3n > 0, @P == 2P || @P == 0) */ /*lint -function(fgets(1), gzgets(2)) */ /*lint -function(fgets(2), gzgets(3)) */ /*lint -function(fgets(3), gzgets(1)) */ /*lint -function(fgets(r), gzgets(r)) */ extern char* gzgets(gzFile file, char *buf, int len); /*lint -function(fgetc, gzgetc) */ extern int gzgetc(gzFile file); /*lint -sem( gzclose, 1p == 1) */ extern int gzclose(gzFile file); #ifdef __cplusplus } #endif #endif // 0 #endif /* _lint */ typedef _Bool LintBool; #endif /* _LINT_H_ */ zimpl-3.3.6/src/zimpl/mshell.h0000644001417200060250000000667313304236715016154 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mshell.h */ /* Name....: Memory Allocation Shell */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _MSHELL_H_ #define _MSHELL_H_ #ifdef __cplusplus extern "C" { #endif /*lint -sem( mem_malloc, nulterm(2), 1n > 0 && 2p, @P == malloc(1n)) */ extern void* mem_malloc(size_t, const char*, const int); /*lint -sem( mem_calloc, nulterm(3), 1n > 0 && 2n > 0 && 3p, @P == malloc(1n * 2n)) */ extern void* mem_calloc(size_t, size_t, const char*, const int); /*lint -sem( mem_realloc, custodial(1), nulterm(3), 1p > 0 && 2n > 0 && 3p, @P == malloc(2n)) */ extern void* mem_realloc(void*, size_t, const char*, const int); /*lint -sem( mem_strdup, nulterm(1), nulterm(2), 1p > 0 && 2p > 0, @P == malloc(1P)) */ extern char* mem_strdup(const char*, const char*, const int); /*lint -sem( mem_free, custodial(1), nulterm(2), 1p > 0 && 2p) */ extern void mem_free(void*, const char*, const int); #ifndef _MSHELL_C_ #ifdef strdup #undef strdup #endif /* strdup */ /*lint -e652 -e683*/ #define malloc(a) mem_malloc((a), __FILE__, __LINE__) #define calloc(a, b) mem_calloc((a), (b), __FILE__, __LINE__) #define realloc(a, b) mem_realloc((a), (b), __FILE__, __LINE__) #define strdup(a) mem_strdup((a), __FILE__, __LINE__) #define free(a) mem_free((a), __FILE__, __LINE__) /*line +e652 +e683*/ #endif /* _MSHELL_C_ */ #ifndef NO_MSHELL extern size_t mem_used(void); extern void mem_maximum(FILE* fp); extern void mem_display(FILE* fp); extern void mem_check_x(const void* p, const char* file, const int line); extern void mem_check_all_x(const char* file, const int line); extern void mem_hide_x(void* p, const char* file, const int line); #define mem_check(a) mem_check_x(a, __FILE__, __LINE__) #define mem_check_all() mem_check_all_x(__FILE__, __LINE__) #define mem_hide(a) mem_hide_x(a, __FILE__, __LINE__) #else /* NO_MSHELL */ #define mem_used() /**/ #define mem_maximum(a) /**/ #define mem_display(a) /**/ #define mem_check(a) /**/ #define mem_check_all() /**/ #define mem_hide(a) /**/ #endif /* !NO_MSHELL */ #ifdef __cplusplus } #endif #endif /* _MSHELL_H_ */ zimpl-3.3.6/src/zimpl/stmt.h0000644001417200060250000000622413304236715015647 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: stmt.h */ /* Name....: Statement Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _STMT_H_ #define _STMT_H_ #ifdef __cplusplus extern "C" { #endif enum statement_type { STMT_ERR = 0, STMT_SET, STMT_PARAM, STMT_VAR, STMT_MIN, STMT_MAX, STMT_CONS, STMT_DEF, STMT_DO, STMT_SOS }; typedef enum statement_type StmtType; typedef struct statement Stmt; /* stmt.c */ /*lint -sem( stmt_new, nulterm(2), nulterm(4), 2p && 3n >= 0 && 4p, @P > malloc(1P)) */ extern Stmt* stmt_new(StmtType type, const char* filename, int lineno, const char* text); /*lint -sem( stmt_free, custodial(1), 1p == 1) */ extern void stmt_free(Stmt* stmt); /*lint -sem( stmt_is_valid, 1p == 1) */ extern bool stmt_is_valid(const Stmt* stmt); /*lint -sem( stmt_get_filename, 1p == 1, @P > malloc(1P) && nulterm(@)) */ extern const char* stmt_get_filename(const Stmt* stmt); /*lint -sem( stmt_get_lineno, 1p == 1, @n > 0) */ extern int stmt_get_lineno(const Stmt* stmt); /*lint -sem( stmt_get_text, 1p == 1, @p && nulterm(@)) */ extern const char* stmt_get_text(const Stmt* stmt); /*lint -sem( stmt_parse, 1p == 1) */ extern void stmt_parse(Stmt* stmt); /*lint -sem( stmt_execute, 1p == 1) */ extern void stmt_execute(const Stmt* stmt); /*lint -sem( stmt_print, 1p == 1 && 2p == 1) */ extern void stmt_print(FILE* fp, const Stmt* stmt); /*lint -sem( stmt_trigger_warning, 1n >= 0) */ extern bool stmt_trigger_warning(int no); /* mmlparse.y */ extern int yyparse(void); /* mmlscan.l */ /*lint -sem( parse_stmt, 1p) */ extern void parse_stmt(const Stmt* stmt); extern const Stmt* scan_get_stmt(void); extern int scan_get_column(void); #ifdef __cplusplus } #endif #endif /* _STMT_H_ */ zimpl-3.3.6/src/zimpl/list.c0000644001417200060250000002246213304236715015630 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: list.c */ /* Name....: List Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/blkmem.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/set.h" #include "zimpl/entry.h" #include "zimpl/list.h" #define LIST_SID 0x4c697374 enum list_type { LIST_ERR = 0, LIST_ELEM, LIST_TUPLE, LIST_ENTRY, LIST_IDXELEM, LIST_LIST }; typedef enum list_type ListType; typedef union list_data ListData; union list_data { Entry* entry; Tuple* tuple; Elem* elem; List* list; }; struct list_element { ListData data; ListElem* prev; ListElem* next; }; struct list { SID int refc; int elems; ListType type; ListElem anchor; }; static void list_add_data(List* list, const ListData* data) { ListElem* elem = blk_alloc(sizeof(*elem)); assert(list_is_valid(list)); assert(elem != NULL); assert(data != NULL); elem->data = *data; elem->next = &list->anchor; elem->prev = list->anchor.prev; list->anchor.prev->next = elem; list->anchor.prev = elem; list->elems++; } static void list_insert_data(List* list, const ListData* data) { ListElem* elem = blk_alloc(sizeof(*elem)); assert(list_is_valid(list)); assert(elem != NULL); assert(data != NULL); elem->data = *data; elem->next = list->anchor.next; elem->prev = &list->anchor; list->anchor.next->prev = elem; list->anchor.next = elem; list->elems++; } static List* list_new(ListType type, const ListData* data) { List* list = calloc(1, sizeof(*list)); assert(list != NULL); assert(data != NULL); list->refc = 1; list->elems = 0; list->type = type; list->anchor.prev = &list->anchor; list->anchor.next = &list->anchor; SID_set(list, LIST_SID); assert(list_is_valid(list)); list_add_data(list, data); return list; } List* list_new_elem(const Elem* elem) { ListData data; assert(elem_is_valid(elem)); data.elem = elem_copy(elem); return list_new(LIST_ELEM, &data); } List* list_new_tuple(const Tuple* tuple) { ListData data; assert(tuple_is_valid(tuple)); data.tuple = tuple_copy(tuple); return list_new(LIST_TUPLE, &data); } List* list_new_entry(const Entry* entry) { ListData data; assert(entry_is_valid(entry)); data.entry = entry_copy(entry); return list_new(LIST_ENTRY, &data); } List* list_new_list(const List* list) { ListData data; assert(list_is_valid(list)); data.list = list_copy(list); return list_new(LIST_LIST, &data); } void list_free(List* list) { ListElem* p; ListElem* q; assert(list_is_valid(list)); list->refc--; if (list->refc == 0) { SID_del(list); for(p = list->anchor.next; p != &list->anchor; p = q) { assert(p != NULL); q = p->next; switch(list->type) { case LIST_ELEM : elem_free(p->data.elem); break; case LIST_TUPLE : tuple_free(p->data.tuple); break; case LIST_ENTRY : entry_free(p->data.entry); break; case LIST_IDXELEM : break; case LIST_LIST : list_free(p->data.list); break; default : abort(); } blk_free(p, sizeof(*p)); } free(list); } } bool list_is_valid(const List* list) { return ((list != NULL) && SID_ok(list, LIST_SID) && (list->refc > 0)); } bool list_is_elemlist(const List* list) { assert(list_is_valid(list)); return list->type == LIST_ELEM; } bool list_is_entrylist(const List* list) { assert(list_is_valid(list)); return list->type == LIST_ENTRY; } bool list_is_tuplelist(const List* list) { assert(list_is_valid(list)); return list->type == LIST_TUPLE; } List* list_copy(const List* source) { List* list = (List*)source; assert(list_is_valid(list)); list->refc++; return list; } void list_add_elem(List* list, const Elem* elem) { ListData data; assert(list_is_valid(list)); assert(elem_is_valid(elem)); assert(list->type == LIST_ELEM); data.elem = elem_copy(elem); list_add_data(list, &data); } void list_insert_elem(List* list, const Elem* elem) { ListData data; assert(list_is_valid(list)); assert(elem_is_valid(elem)); assert(list->type == LIST_ELEM); data.elem = elem_copy(elem); list_insert_data(list, &data); } void list_add_tuple(List* list, const Tuple* tuple) { ListData data; assert(list_is_valid(list)); assert(tuple_is_valid(tuple)); assert(list->type == LIST_TUPLE); data.tuple = tuple_copy(tuple); list_add_data(list, &data); } void list_insert_tuple(List* list, const Tuple* tuple) { ListData data; assert(list_is_valid(list)); assert(tuple_is_valid(tuple)); assert(list->type == LIST_TUPLE); data.tuple = tuple_copy(tuple); list_insert_data(list, &data); } void list_add_entry(List* list, const Entry* entry) { ListData data; assert(list_is_valid(list)); assert(entry_is_valid(entry)); assert(list->type == LIST_ENTRY); data.entry = entry_copy(entry); list_add_data(list, &data); } void list_insert_entry(List* list, const Entry* entry) { ListData data; assert(list_is_valid(list)); assert(entry_is_valid(entry)); assert(list->type == LIST_ENTRY); data.entry = entry_copy(entry); list_insert_data(list, &data); } void list_add_list(List* list, const List* ll) { ListData data; assert(list_is_valid(list)); assert(list_is_valid(ll)); assert(list->type == LIST_LIST); data.list = list_copy(ll); list_add_data(list, &data); } int list_get_elems(const List* list) { assert(list_is_valid(list)); return list->elems; } static ListData* list_get_data(const List* list, ListElem** idxp) { assert(list_is_valid(list)); assert(idxp != NULL); if (*idxp == NULL) *idxp = list->anchor.next; assert(*idxp != NULL); if (*idxp == &list->anchor) return NULL; *idxp = (*idxp)->next; return &((*idxp)->prev->data); } const Elem* list_get_elem(const List* list, ListElem** idxp) { ListData* data; assert(list_is_valid(list)); assert(list->type == LIST_ELEM); assert(idxp != NULL); data = list_get_data(list, idxp); return (data == NULL) ? ELEM_NULL : data->elem; } const Tuple* list_get_tuple(const List* list, ListElem** idxp) { ListData* data; assert(list_is_valid(list)); assert(list->type == LIST_TUPLE); assert(idxp != NULL); data = list_get_data(list, idxp); return (data == NULL) ? TUPLE_NULL : data->tuple; } const Entry* list_get_entry(const List* list, ListElem** idxp) { ListData* data; assert(list_is_valid(list)); assert(list->type == LIST_ENTRY); assert(idxp != NULL); data = list_get_data(list, idxp); return (data == NULL) ? ENTRY_NULL : data->entry; } const List* list_get_list(const List* list, ListElem** idxp) { ListData* data; assert(list_is_valid(list)); assert(list->type == LIST_LIST); assert(idxp != NULL); data = list_get_data(list, idxp); return (data == NULL) ? LIST_NULL : data->list; } void list_print(FILE* fp, const List* list) { ListElem* le; for(le = list->anchor.next; le != &list->anchor; le = le->next) { assert(le != NULL); switch(list->type) { case LIST_ELEM : elem_print(fp, le->data.elem, true); break; case LIST_TUPLE : tuple_print(fp, le->data.tuple); break; case LIST_ENTRY : entry_print(fp, le->data.entry); break; case LIST_LIST : list_print(fp, le->data.list); break; default : abort(); } fprintf(fp, "\n"); } } zimpl-3.3.6/src/zimpl/rdefpar.h0000644001417200060250000000711513304236715016303 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: rdefpar.c */ /* Name....: Read Definition / Parameter */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _RDEFPAR_H_ #define _RDEFPAR_H_ #ifdef __cplusplus extern "C" { #endif typedef struct read_param RPar; typedef struct read_definition RDef; /*lint -sem( rdef_new, nulterm(1), nulterm(2), 1p && 2p, @P > malloc(1P)) */ extern RDef* rdef_new(const char* filename, const char* pattern); /*lint -sem( rdef_free, custodial(1), 1p == 1) */ extern void rdef_free(RDef* rdef); /*lint -sem( rdef_is_valid, 1p == 1) */ extern bool rdef_is_valid(const RDef* rdef); /*lint -sem( rdef_copy, 1p == 1, @P > malloc(1P)) */ extern RDef* rdef_copy(const RDef* rdef); /*lint -sem( rdef_set_param, 1p == 1 && 2p == 1) */ extern void rdef_set_param(RDef* rdef, const RPar* rpar); /*lint -sem( rdef_get_filename, 1p == 1, @p && nulterm(@)) */ extern const char* rdef_get_filename(const RDef* rdef); /*lint -sem( rdef_get_pattern, 1p == 1, @p && nulterm(@)) */ extern const char* rdef_get_pattern(const RDef* rdef); /*lint -sem( rdef_get_comment, 1p == 1, @p && nulterm(@)) */ extern const char* rdef_get_comment(const RDef* rdef); /*lint -sem( rdef_get_match, 1p == 1) */ extern const char* rdef_get_match(const RDef* rdef); /*lint -sem( rdef_get_use, 1p == 1) */ extern int rdef_get_use(const RDef* rdef); /*lint -sem( rdef_get_skip, 1p == 1) */ extern int rdef_get_skip(const RDef* rdef); /*lint -sem( rpar_new_skip, @P > malloc(1P)) */ extern RPar* rpar_new_skip(int skip); /*lint -sem( rpar_new_use, @P > malloc(1P)) */ extern RPar* rpar_new_use(int use); /*lint -sem( rpar_new_comment, 1p && nulterm(1), @P > malloc(1P)) */ extern RPar* rpar_new_comment(const char* comment); /*lint -sem( rpar_new_match, 1p && nulterm(1), @P > malloc(1P)) */ extern RPar* rpar_new_match(const char* match); /*lint -sem( rpar_free, custodial(1), 1p == 1) */ extern void rpar_free(RPar* rpar); /*lint -sem( rpar_is_valid, 1p == 1) */ extern bool rpar_is_valid(const RPar* rpar); /*lint -sem( rpar_copy, 1p == 1, @P > malloc(1P)) */ extern RPar* rpar_copy(const RPar* rpar); #ifdef __cplusplus } #endif #endif /* _RDEFPAR_H_ */ zimpl-3.3.6/src/zimpl/stkchk.c0000644001417200060250000000442713304236715016145 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: stkchk.c */ /* Name....: Stack usage checker */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2011-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef NDEBUG #include #include "zimpl/stkchk.h" const void* stkchk_start = 0; size_t stkchk_maxi = 0; void stkchk_init_x() { int a; stkchk_start = &a; /*lint !e733 !e789 Assigning address of auto variable 'a' to static */ stkchk_maxi = 0; } size_t stkchk_used_x() { size_t used = (size_t)((const char*)stkchk_start - (const char*)&used); /*??? Questionable side effect. Function looks like reporting stack use * but actually also needed for recording. */ if (used > stkchk_maxi) stkchk_maxi = used; return used; } void stkchk_maximum_x(FILE* fp) { (void)fprintf(fp, "Maximum amount of stack used = %lu bytes\n", (unsigned long)stkchk_maxi); } void stkchk_display_x(FILE* fp) { (void)fprintf(fp, "Current amount of stack used = %lu bytes\n", (unsigned long)stkchk_used()); } #endif /* NDEBUG */ zimpl-3.3.6/src/zimpl/gmpmisc.h0000644001417200060250000000374513304236715016324 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: gmpmisc.c */ /* Name....: miscellenious rational arithmetic functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _GMPMISC_H_ #define _GMPMISC_H_ #ifndef __GMP_H__ #error "Need to include gmp.h before gmpmisc.h" #endif #ifdef __cplusplus extern "C" { #endif extern mpq_t const_zero; extern mpq_t const_one; extern mpq_t const_minus_one; /*lint -sem(gmp_str2mpq, 1p && 2p && nulterm(2)) */ extern void gmp_str2mpq(mpq_t value, const char* num); /*lint -sem(gmp_print, 1p == 1 && 2p ) */ extern void gmp_print_mpq(FILE* fp, const mpq_t qval); extern void gmp_init(bool verb, bool with_management); extern void gmp_exit(void); #ifdef __cplusplus } #endif #endif /* _GMPMISC_H */ zimpl-3.3.6/src/zimpl/ratmstwrite.c0000644001417200060250000000553313304236715017242 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratmstwrite.c */ /* Name....: MST File Write */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/lint.h" #include "zimpl/mshell.h" #include #include "zimpl/gmpmisc.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/bound.h" #include "zimpl/mme.h" #include "zimpl/mono.h" #include "zimpl/term.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" /* A specification for the ORD file format can be found in the * ILOG CPLEX 7.0 Reference Manual page 545. */ void lps_mstfile( const Lps* lp, FILE* fp, LpFormat format, const char* text) { const Var* var; int name_size; char* vtmp; assert(lp != NULL); assert(fp != NULL); assert(format == LP_FORM_LPF || format == LP_FORM_MPS); name_size = lps_getnamesize(lp, format); vtmp = malloc((size_t)name_size); assert(vtmp != NULL); if (text != NULL) fprintf(fp, "* %s\n", text); fprintf(fp, "NAME %8.8s\n", lp->name); for(var = lp->var_root; var != NULL; var = var->next) { if (var->vclass == VAR_CON) continue; if (var->size == 0) continue; lps_makename(vtmp, name_size, var->name, var->number); fprintf(fp, " %-*s %.10e", name_size - 1, vtmp, mpq_get_d(var->startval)); fputc('\n', fp); } fprintf(fp, "ENDATA\n"); free(vtmp); } zimpl-3.3.6/src/zimpl/local.h0000644001417200060250000000436413304236715015755 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: local.h */ /* Name....: Local Parameter Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _LOCAL_H_ #define _LOCAL_H_ #ifndef _ELEM_H_ #error "Need to include elem.h before local.h" #endif #ifndef _TUPLE_H_ #error "Need to include tuple.h before local.h" #endif #ifdef __cplusplus extern "C" { #endif extern void local_init(void); extern void local_exit(void); extern void local_drop_frame(void); /*lint -sem( local_lookup, nulterm(1), 1p, r_null) */ extern const Elem* local_lookup(const char* name); /*lint -sem( local_install_tuple, 1p == 1 && 2p == 1) */ extern void local_install_tuple(const Tuple* patt, const Tuple* vals); /*lint -sem( local_print_all, 1p == 1) */ extern void local_print_all(FILE* fp); /*lint -sem( local_tostrall, @p && nulterm(@)) */ extern char* local_tostrall(void); #ifdef __cplusplus } #endif #endif /* _LOCAL_H_ */ zimpl-3.3.6/src/zimpl/ratlp.h0000644001417200060250000002232313304236715016000 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: ratlp.h */ /* Name....: Rational Number LP Storage Library */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _RATLP_H_ #define _RATLP_H_ #ifndef __GMP_H__ #error "Need to include gmp.h before ratlp.h" #endif #ifndef _RATLPTYPES_H_ #error "Need to include ratlptypes.h before ratlp.h" #endif #ifndef _MME_H_ #error "Need to include mme.h before ratlp.h" #endif #ifdef __cplusplus extern "C" { #endif /* lpstore.c */ /*lint -sem( lps_alloc, nulterm(1), 1p, @p) */ extern Lps* lps_alloc(const char* name); /*lint -sem( lps_free, custodial(1), 1p) */ extern void lps_free(Lps* lp); /*lint -sem( lps_number, 1p == 1) */ extern void lps_number(const Lps* lp); /*lint -sem( lps_getsos, nulterm(2), 1p && 2p) */ extern Sos* lps_getsos(const Lps* lp, const char* name); /*lint -sem( lps_getvar, nulterm(2), 1p && 2p) */ extern Var* lps_getvar(const Lps* lp, const char* name); /*lint -sem( lps_getcon, nulterm(2), 1p && 2p) */ extern Con* lps_getcon(const Lps* lp, const char* name); /*lint -sem( lps_getnzo, 1p == 1 && 2p == 1 && 3p == 1) */ extern Nzo* lps_getnzo(const Lps* lp, const Con* con, const Var* var); /*lint -sem( lps_addsos, nulterm(2), 1p == 1 && 2p && 4n >= 0, @p) */ extern Sos* lps_addsos(Lps* lp, const char* name, SosType type, int priority); /*lint -sem( lps_addsse, 1p == 1 && 2p == 1 && 3p == 1) */ extern void lps_addsse(Sos* sos, Var* var, const mpq_t weight); /*lint -sem( lps_addvar, nulterm(2), 1p == 1 && 2p, @p) */ extern Var* lps_addvar(Lps* lp, const char* name); /*lint -sem( lps_delvar, 1p == 1 && 2p == 1) */ extern void lps_delvar(Lps* lp, Var* var); /*lint -sem( lps_addcon, nulterm(2), 1p == 1 && 2p, @p) */ extern Con* lps_addcon(Lps* lp, const char* name); /*lint -sem( lps_delcon, 1p == 1 && 2p == 1) */ extern void lps_delcon(Lps* lp, Con* con); /*lint -sem( lps_addnzo, 1p == 1 && 2p == 1 && 3p == 1) */ extern void lps_addnzo(Lps* lp, Con* con, Var* var, const mpq_t value); /*lint -sem( lps_delnzo, 1p == 1 && 2p == 1) */ extern void lps_delnzo(Lps* lp, Nzo* nzo); /*lint -sem( lps_addqme, 1p == 1 && 2p == 1 && 3p == 1 && 4p == 1) */ extern void lps_addqme(Lps* lp, Con* con, Var* var1, Var* var2, const mpq_t value); /*lint -sem( lps_addterm, 1p == 1 && 2p == 1 && 3p == 1) */ extern void lps_addterm(Lps* lp, Con* con, const Term* term); /*lint -sem( lps_stat, 1p == 1) */ extern void lps_stat(const Lps* lp); /*lint -sem( lps_setval, 1p == 1) */ extern void lps_setval(Nzo* nzo, const mpq_t value); /*lint -sem( lps_getval, 1p == 1) */ extern void lps_getval(const Nzo* nzo, mpq_t value); /*lint -sem( lps_stat, 1p == 1) */ extern void lps_setdir(Lps* lp, LpDirect direct); /*lint -sem( lps_setprobname, nulterm(2), 1p && 2p) */ extern void lps_setprobname(Lps* lp, const char* name); /*lint -sem( lps_setobjname, nulterm(2), 1p && 2p) */ extern bool lps_setobjname(Lps* lp, const char* name); /*lint -sem( lps_setrhsname, nulterm(2), 1p && 2p) */ extern void lps_setrhsname(Lps* lp, const char* name); /*lint -sem( lps_setbndname, nulterm(2), 1p && 2p) */ extern void lps_setbndname(Lps* lp, const char* name); /*lint -sem( lps_setrngname, nulterm(2), 1p && 2p) */ extern void lps_setrngname(Lps* lp, const char* name); /*lint -sem( lps_getcost, 1p == 1) */ extern void lps_getcost(const Var* var, mpq_t cost); /*lint -sem( lps_setcost, 1p == 1) */ extern void lps_setcost(Var* var, const mpq_t cost); /*lint -sem( lps_haslower, 1p == 1) */ extern bool lps_haslower(const Var* var); /*lint -sem( lps_getlower, 1p == 1) */ extern void lps_getlower(const Var* var, mpq_t lower); /*lint -sem( lps_setlower, 1p == 1) */ extern void lps_setlower(Var* var, const mpq_t lower); /*lint -sem( lps_hasupper, 1p == 1) */ extern bool lps_hasupper(const Var* var); /*lint -sem( lps_getupper, 1p == 1) */ extern void lps_getupper(const Var* var, mpq_t upper); /*lint -sem( lps_setupper, 1p == 1) */ extern void lps_setupper(Var* var, const mpq_t upper); /*lint -sem( lps_getclass, 1p == 1) */ extern VarClass lps_getclass(const Var* var); /*lint -sem( lps_setclass, 1p == 1) */ extern void lps_setclass(Var* var, VarClass vclass); /*lint -sem( lps_setlhs, 1p == 1) */ extern void lps_setlhs(Con* con, const mpq_t lhs); /*lint -sem( lps_setrhs, 1p == 1) */ extern void lps_setrhs(Con* con, const mpq_t rhs); /*lint -sem( lps_setcontype, 1p == 1) */ extern void lps_setcontype(Con* con, ConType type); /*lint -sem( lps_contype, 1p == 1) */ extern ConType lps_contype(const Con* con); /*lint -sem( lps_vartype, 1p == 1) */ extern VarType lps_vartype(const Var* var); /*lint -sem( lps_getlhs, 1p == 1) */ extern void lps_getlhs(const Con* con, mpq_t lhs); /*lint -sem( lps_getrhs, 1p == 1) */ extern void lps_getrhs(const Con* con, mpq_t rhs); /*lint -sem( lps_varname, 1p == 1, @p) */ //nulterm(@) ??? extern const char* lps_varname(const Var* var); /*lint -sem( lps_setvartype, 1p == 1) */ extern void lps_setvartype(Var* con, VarType type); /*lint -sem( lps_flags, 1p == 1) */ extern unsigned int lps_flags(const Con* con); /*lint -sem( lps_addflags, 1p == 1) */ extern void lps_addflags(Con* con, unsigned int flags); /*lint -sem( lps_setscale, 1p == 1) */ extern void lps_setscale(Con* con, const mpq_t scale); /*lint -sem( lps_setpriority, 1p == 1) */ extern void lps_setpriority(Var* var, int priority); /*lint -sem( lps_setvalue, 1p == 1) */ extern void lps_setvalue(Var* var, const mpq_t value); /*lint -sem( lps_setstartval, 1p == 1) */ extern void lps_setstartval(Var* var, const mpq_t startval); /*lint -sem( lps_setnamelen, 1p == 1) */ extern void lps_setnamelen(Lps* lp, int name_len); /*lint -sem( lps_setindictaor, 1p == 1 && 2p == 1) */ extern void lps_setindicator(Con* con, Var* var, bool on_true); /*lint -sem( lps_write, nulterm(4), 1p == 1 && 2p == 1) */ extern void lps_write(const Lps* lp, FILE* fp, LpFormat format, const char* text); /*lint -sem( lps_transtable, nulterm(4), 1p == 1 && 2p == 1 && 4p) */ extern void lps_transtable(const Lps* lp, FILE* fp, LpFormat format, const char* head); /*lint -sem( lps_clearobj, 1p == 1) */ extern void lps_clearobj(const Lps* lp); /*lint -sem( lps_scale, 1p == 1) */ extern void lps_scale(const Lps* lp); /*lint -sem( lps_scale, 1p == 1) */ extern bool lps_has_sos(const Lps* lp); /*lint -sem( lps_con_sumup, 1p == 1) */ extern bool lps_con_sumup(const Con* con, mpq_t sum); /* ratlpfwrite.c */ /*lint -sem( lpf_write, nulterm(3), 1p == 1 && 2p == 1) */ extern void lpf_write(const Lps* lp, FILE* fp, LpFormat format, const char* text); /* ratmpswrite.c */ /*lint -sem( lpf_write, nulterm(3), 1p == 1 && 2p == 1) */ extern void mps_write(const Lps* lp, FILE* fp, const char* text); /* ratordwrite.c */ /*lint -sem( lps_ordwrite, nulterm(4), 1p == 1 && 2p == 1) */ extern void lps_orderfile(const Lps* lp, FILE* fp, LpFormat format, const char* text); /* ratmstwrite.c */ /*lint -sem( lps_mstwrite, nulterm(4), 1p == 1 && 2p == 1) */ extern void lps_mstfile(const Lps* lp, FILE* fp, LpFormat format, const char* text); #if 0 /* Not used anymore ??? */ /* ratpresolve.c */ /*lint -sem( lps_presolve, 1p == 1 && 2n >= 0) */ extern PSResult lps_presolve(Lps* lp, int verbose_level); #endif #ifdef __cplusplus } #endif #endif /* _RATLP_H_ */ zimpl-3.3.6/src/zimpl/set.h0000644001417200060250000001165713304236715015461 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: set4.c */ /* Name....: Set Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _SET_H_ #define _SET_H_ #ifndef _MME_H_ #error "Need to include mme.h before set.h" #endif #ifdef __cplusplus extern "C" { #endif enum set_check_type { SET_CHECK_NONE, SET_CHECK_QUIET, SET_CHECK_WARN }; typedef enum set_check_type SetCheckType; typedef long long SetIterIdx; typedef union set Set; typedef union set_iter SetIter; extern void set_init(void); extern void set_exit(void); /*lint -sem( set_free, custodial(1), 1p == 1) */ extern void set_free(Set* set); /*lint -sem( set_is_valid, 1p == 1) */ extern bool set_is_valid(const Set* set); /*lint -sem( set_copy, 1p == 1, @P > malloc(1P)) */ extern Set* set_copy(const Set* set); /*lint -sem( set_lookup, 1p == 1 && 2p == 1) */ extern bool set_lookup(const Set* set, const Tuple* tuple); /*lint -sem( set_iter_init, 1p == 1, @P > malloc(1P)) */ extern SetIter* set_iter_init(const Set* set, const Tuple* pattern); /*lint -sem( set_iter_next, 1p == 1 && 2p == 1) */ extern Tuple* set_iter_next(SetIter* iter, const Set* set); /*lint -sem( set_iter_exit, 1p == 1 && 2p == 1) */ extern void set_iter_exit(SetIter* iter, const Set* set); /*lint -sem( set_get_dim, 1p == 1, @n >= 0) */ extern int set_get_dim(const Set* set); /*lint -sem( set_get_members, 1p == 1, @n >= 0) */ extern int set_get_members(const Set* set); /*lint -sem( set_get_tuple, 1p == 1 && 2n >= 0) */ extern Tuple* set_get_tuple(const Set* set, SetIterIdx idx); /*lint -sem( set_print, 1p == 1 && 2p == 1) */ extern void set_print(FILE* fp, const Set* set); /*lint -sem( set_empty_new, 1n >= 0, @P > malloc(1P)) */ extern Set* set_empty_new(int dim); extern Set* set_pseudo_new(void); /*lint -sem( set_new_from_list, 1p == 1, @P > malloc(1P)) */ extern Set* set_new_from_list(const List* list, SetCheckType check); /*lint -sem( set_range_new, @P > malloc(1P)) */ extern Set* set_range_new(int begin, int end, int step); /*lint -sem( set_prod_new, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_prod_new(const Set* a, const Set* b); /*lint -sem( set_union, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_union(const Set* seta, const Set* setb); /*lint -sem( set_inter, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_inter(const Set* set_a, const Set* set_b); /*lint -sem( set_minus, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_minus(const Set* set_a, const Set* set_b); /*lint -sem( set_sdiff, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_sdiff(const Set* set_a, const Set* set_b); /*lint -sem( set_proj, 1p == 1 && 2p == 1, @P > malloc(1P)) */ extern Set* set_proj(const Set* set_a, const Tuple* pattern); /*lint -sem( set_is_subseteq, 1p == 1 && 2p == 1) */ extern bool set_is_subseteq(const Set* set_a, const Set* set_b); /*lint -sem( set_is_subset, 1p == 1 && 2p == 1) */ extern bool set_is_subset(const Set* set_a, const Set* set_b); /*lint -sem( set_is_equal, 1p == 1 && 2p == 1) */ extern bool set_is_equal(const Set* set_a, const Set* set_b); /*lint -sem( set_subset_list, 1p == 1 && 2n > 0 && 4p == 1, @P > malloc(1P)) */ extern List* set_subsets_list( const Set* set, int subset_size, List* list, SetIterIdx* idx); #ifdef __cplusplus } #endif #endif /* _SET_H_ */ zimpl-3.3.6/src/zimpl/source.c0000644001417200060250000000444313304236715016154 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: source.c */ /* Name....: Source Code Printing Function */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/ratlptypes.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" void show_source(FILE* fp, const char* text, int column) { int len; int beg; int end; assert(fp != NULL); assert(text != NULL); assert(column >= 0); if (column > 0) column--; len = (int)strlen(text); beg = column - 30; end = column + 30; if (beg < 0) { end -= beg; beg = 0; } if (end > len) { beg -= end - len; end = len; } if (beg < 0) beg = 0; assert(beg >= 0); assert(end <= len); assert(beg <= end); fprintf(fp, "*** %-*s\n", end - beg, &text[beg]); fprintf(fp, "*** %*s^^^\n", column - beg, ""); } zimpl-3.3.6/src/zimpl/local.c0000644001417200060250000001205713304236715015746 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: local.c */ /* Name....: Local Parameter Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2001-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include "zimpl/mshell.h" #include "zimpl/numb.h" #include "zimpl/elem.h" #include "zimpl/tuple.h" #include "zimpl/mme.h" #include "zimpl/local.h" #define LOCAL_STR_SIZE 100 typedef struct local Local; struct local { const char* name; Elem* element; Local* next; }; static Local anchor = { "", NULL, NULL }; void local_init() { assert(strlen(anchor.name) == 0); assert(anchor.element == NULL); assert(anchor.next == NULL); } void local_exit() { assert(strlen(anchor.name) == 0); assert(anchor.element == NULL); anchor.next = NULL; } static void local_new(const char* name, const Elem* elem) { Local* local; assert(name != NULL); local = calloc(1, sizeof(*local)); assert(local != NULL); local->name = name; local->element = (elem == ELEM_NULL) ? ELEM_NULL : elem_copy(elem); local->next = anchor.next; anchor.next = local; } static void local_new_frame(void) { local_new("", ELEM_NULL); } void local_drop_frame(void) { bool frame = false; Local* q = NULL; Local* p; for(p = anchor.next; (p != NULL) && !frame; p = q) { q = p->next; if (p->element == ELEM_NULL) frame = true; else elem_free(p->element); free(p); } anchor.next = q; } const Elem* local_lookup(const char* name) { Local* local; assert(name != NULL); for(local = anchor.next; local != NULL; local = local->next) if (!strcmp(local->name, name)) break; return local == NULL ? ELEM_NULL : local->element; } void local_install_tuple(const Tuple* pattern, const Tuple* values) { const char* name; int i; assert(tuple_is_valid(pattern)); assert(tuple_is_valid(values)); assert(tuple_get_dim(pattern) == tuple_get_dim(values)); local_new_frame(); for(i = 0; i < tuple_get_dim(pattern); i++) { const Elem* elem = tuple_get_elem(pattern, i); if (elem_get_type(elem) == ELEM_NAME) { name = elem_get_name(elem); elem = tuple_get_elem(values, i); assert(elem_get_type(elem) != ELEM_NAME); local_new(name, elem); } } } void local_print_all(FILE* fp) { const Local* local; for(local = anchor.next; local != NULL; local = local->next) { if (local->element == NULL) fprintf(fp, "New Frame"); else { fprintf(fp, "%s = ", local->name); elem_print(fp, local->element, true); } fprintf(fp, "\n"); } } char* local_tostrall() { const Local* local; size_t size = LOCAL_STR_SIZE; size_t len = 1; /* fuer die '\0' */ char* str = malloc(size); char* selem; size_t selemlen; bool after_elem = false; assert(str != NULL); str[0] = '\0'; for(local = anchor.next; local != NULL; local = local->next) { /* Frame ? */ if (local->element == NULL) { selem = strdup(";"); selemlen = 1; after_elem = false; } else { selem = elem_tostr(local->element); selemlen = strlen(selem) + (after_elem ? 1 : 0); } if (len + selemlen >= size) { size += selemlen + LOCAL_STR_SIZE; str = realloc(str, size); assert(str != NULL); } assert(len + selemlen < size); strcat(str, after_elem ? "@" : ""); strcat(str, selem); free(selem); len += selemlen; after_elem = (local->element != NULL); } return str; } zimpl-3.3.6/src/zimpl/zimpllib.h0000644001417200060250000000426613304236715016506 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: zimpllib.h */ /* Name....: Zimpl library */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2005-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _ZIMPL_LIB_H_ #define _ZIMPL_LIB_H_ #ifdef __cplusplus extern "C" { #endif /*lint -sem( zpl_add_parameter, 1p >= 1) */ extern void zpl_add_parameter(const char* def); /*lint -sem( zpl_var_print, 1p == 1 && 2p == 1) */ extern void zpl_var_print(FILE* fp, const Var* var); /*lint -sem( zpl_print_banner, 1p == 1) */ extern void zpl_print_banner(FILE* fp, bool with_license); /*lint -sem( zpl_read, 1p >= 1) */ extern bool zpl_read(const char* filename, bool with_management, void* user_data); /*lint -sem( zpl_read_with_args, 1p >= 2n && 2n > 0) */ extern bool zpl_read_with_args(char** argv, int argc, bool with_management, void* user_data); #ifdef __cplusplus } #endif #endif /* _ZIMPL_LIB_H_ */ zimpl-3.3.6/src/zimpl/mono.h0000644001417200060250000001065613304236715015634 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: mono.h */ /* Name....: Monom Functions */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2007-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef _MONO_H_ #define _MONO_H_ #ifdef __cplusplus extern "C" { #endif enum mono_function { MFUN_SQRT = -2, MFUN_NONE = 0, MFUN_TRUE = 1, MFUN_FALSE = 2, MFUN_LOG = 3, MFUN_EXP = 4, MFUN_LN = 5, MFUN_SIN = 6, MFUN_COS = 7, MFUN_TAN = 8, MFUN_ABS = 9, MFUN_SGN = 10, MFUN_POW = 11, MFUN_SGNPOW = 12 }; typedef enum mono_function MFun; typedef struct mono_element MonoElem; struct mono_element { SID Entry* entry; MonoElem* next; }; /* if fun is != MFUN_NONE, the meaning of (fun, elem, coeff) is * fun(elem). coeff is not used, unless fun is MFUN_POW oder MFUN_SGNPOW * in which case coeff is the second argument, i.e. fun(elem, coeff). */ struct mono { SID int count; /* Only needed to hopefully compare monoms faster. */ MFun fun; Numb* coeff; MonoElem first; }; /*lint -sem( mono_new, 1P >= 1, 2P >= 1, @P >= malloc(1)) */ extern Mono* mono_new(const Numb* coeff, const Entry* entry, MFun fun); /*lint -sem( mono_is_valid, pure, 1P >= 1) */ extern bool mono_is_valid(const Mono* mono); /*lint -sem( mono_free, custodial(1), cleanup, inout(1), 1P >= 1) */ extern void mono_free(Mono* mono); /*lint -sem( mono_mul_entry, inout(1), 1P >= 1, 2P >= 1) */ extern void mono_mul_entry(Mono* mono, const Entry* entry); /*lint -sem( mono_copy, 1P >= 1, @P == malloc(1P)) */ extern Mono* mono_copy(const Mono* mono); /*lint -sem( mono_mul_coeff, inout(1), 1P >= 1, 2P >= 1) */ extern void mono_mul_coeff(const Mono* term, const Numb* value); /*lint -sem( mono_add_coeff, inout(1), 1P >= 1, 2P >= 1) */ extern void mono_add_coeff(const Mono* term, const Numb* value); /*lint -sem( mono_hash, pure, 1P >= 1) */ extern unsigned int mono_hash(const Mono* mono); /*lint -sem( mono_equal, pure, 1P >= 1, 2P >= 1) */ extern bool mono_equal(const Mono* ma, const Mono* mb); /*lint -sem( mono_mul, 1P >= 1, 2P >= 1, @P == malloc(1P)) */ extern Mono* mono_mul(const Mono* ma, const Mono* mb); /*lint -sem( mono_neg, inout(1), 1P >= 1) */ extern void mono_neg(Mono* mono); /*lint -sem( mono_is_linear, pure, 1P >= 1) */ extern bool mono_is_linear(const Mono* mono); /*lint -sem( mono_get_degree, pure, 1P >= 1, @n >= 1) */ extern int mono_get_degree(const Mono* mono); /*lint -sem( mono_get_coeff, pure, 1P >= 1, @P >= 1) */ extern const Numb* mono_get_coeff(const Mono* mono); /*lint -sem( mono_set_function, inout(1), 1P >= 1) */ extern void mono_set_function(Mono* mono, MFun f); /*lint -sem( mono_get_function, pure, 1P >= 1) */ extern MFun mono_get_function(const Mono* mono); /*lint -sem( mono_get_var, 1P >= 1, chneg(2), @P >= 1) */ extern Var* mono_get_var(const Mono* mono, int idx); /*lint -sem( mono_print, 1P >= 1, 2P >= 1) */ extern void mono_print(FILE* fp, const Mono* mono, bool print_symbol_index); #ifdef __cplusplus } #endif #endif /* _MONO_H_ */ zimpl-3.3.6/src/zimpl/rathumwrite.c0000644001417200060250000002066013304236715017226 0ustar bzfschlooptimi/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* */ /* File....: lpfwrite.c */ /* Name....: LP Format File Writer */ /* Author..: Thorsten Koch */ /* Copyright by Author, All rights reserved */ /* */ /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ /* * Copyright (C) 2003-2018 by Thorsten Koch * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include #include #include #include #include #include "zimpl/gmpmisc.h" #include "zimpl/ratlp.h" #include "zimpl/ratlpstore.h" static void write_name(FILE* fp, const char* name) { const char* s = name; bool first = true; bool in_string = false; assert(fp != NULL); assert(name != NULL); /* We allways start with a space */ fputc(' ', fp); while(*s != '\0') { if (*s != '#' && *s != '$') fputc(*s, fp); else { if (first) { first = false; fputc('[', fp); } else { if (in_string) { fputc('\"', fp); in_string = false; } fputc(',', fp); } if (*s == '$') { assert(!in_string); in_string = true; fputc('\"', fp); } } s++; } if (in_string) fputc('\"', fp); if (!first) fputc(']', fp); } static void write_lhs(FILE* fp, const Con* con, ConType type) { assert(fp != NULL); assert(con != NULL); switch(type) { case CON_RHS : case CON_LHS : case CON_EQUAL : break; case CON_RANGE : mpq_out_str(fp, 10, con->lhs); fprintf(fp, " <= "); break; default : abort(); } } static void write_rhs(FILE* fp, const Con* con, ConType type) { assert(fp != NULL); assert(con != NULL); switch(type) { case CON_RHS : case CON_RANGE : fprintf(fp, " <= "); mpq_out_str(fp, 10, con->rhs); break; case CON_LHS : fprintf(fp, " >= "); mpq_out_str(fp, 10, con->lhs); break; case CON_EQUAL : fprintf(fp, " = "); mpq_out_str(fp, 10, con->rhs); break; default : abort(); } fprintf(fp, "\n"); } static void write_row( FILE* fp, const Con* con) { const Nzo* nzo; int cnt = 0; assert(fp != NULL); assert(con != NULL); for(nzo = con->first; nzo != NULL; nzo = nzo->con_next) { if (mpq_equal(nzo->value, const_one)) fprintf(fp, " +"); else if (mpq_equal(nzo->value, const_minus_one)) fprintf(fp, " -"); else { fputc(' ', fp); /*lint -e(634) Strong type mismatch (type 'Bool') in equality or conditional */ if (mpq_sgn(nzo->value) > 0) fprintf(fp, "+"); mpq_out_str(fp, 10, nzo->value); } write_name(fp, nzo->var->name); if (++cnt % 6 == 0) fprintf(fp, "\n "); } } void hum_write( const Lps* lp, FILE* fp, const char* text) { const Var* var; const Con* con; bool have_integer = false; int cnt; assert(lp != NULL); assert(fp != NULL); if (text != NULL) fprintf(fp, "%s\n", text); fprintf(fp, "Problem: %s\n", lp->name); fprintf(fp, "%s\n", (lp->direct == LP_MIN) ? "Minimize" : "Maximize"); fprintf(fp, " %s: ", lp->objname == NULL ? "Objective" : lp->objname); for(var = lp->var_root, cnt = 0; var != NULL; var = var->next) { /* If cost is zero, do not include in objective function */ if (mpq_equal(var->cost, const_zero)) continue; if (mpq_equal(var->cost, const_one)) fprintf(fp, " +"); else if (mpq_equal(var->cost, const_minus_one)) fprintf(fp, " -"); else { fputc(' ', fp); /*lint -e(634) Strong type mismatch (type 'Bool') in equality or conditional */ if (mpq_sgn(var->cost) > 0) fprintf(fp, "+"); mpq_out_str(fp, 10, var->cost); } write_name(fp, var->name); if (++cnt % 6 == 0) fprintf(fp, "\n "); } /* ---------------------------------------------------------------------- */ fprintf(fp, "\nSubject to:\n"); for(con = lp->con_root; con != NULL; con = con->next) { if (con->size == 0) continue; write_name(fp, con->name); fprintf(fp, ":\n "); write_lhs(fp, con, con->type); write_row(fp, con); write_rhs(fp, con, con->type); } /* ---------------------------------------------------------------------- */ fprintf(fp, "Bounds\n"); for(var = lp->var_root; var != NULL; var = var->next) { /* A variable without any entries in the matrix * or the objective function can be ignored. */ if (var->size == 0 && mpq_equal(var->cost, const_zero) && !lps_has_sos(lp)) continue; if (var->type == VAR_FIXED) { write_name(fp, var->name); fprintf(fp, " = "); mpq_out_str(fp, 10, var->lower); } else { /* Check if we have integer variables */ if (var->vclass == VAR_INT) have_integer = true; if (var->type == VAR_LOWER || var->type == VAR_BOXED) mpq_out_str(fp, 10, var->lower); else fprintf(fp, " -Inf"); fprintf(fp, " <="); write_name(fp, var->name); fprintf(fp, " <= "); if (var->type == VAR_UPPER || var->type == VAR_BOXED) mpq_out_str(fp, 10, var->upper); else fprintf(fp, "+Inf"); } fprintf(fp, "\n"); } /* ---------------------------------------------------------------------- */ if (have_integer) { fprintf(fp, "General\n"); for(var = lp->var_root; var != NULL; var = var->next) { if (var->vclass != VAR_INT) continue; if (var->size == 0 && mpq_equal(var->cost, const_zero) && !lps_has_sos(lp)) continue; write_name(fp, var->name); fputc('\n', fp); } } /* ---------------------------------------------------------------------- */ if (lps_has_sos(lp)) { const Sos* sos; const Sse* sse; fprintf(fp, "SOS\n"); for(sos = lp->sos_root; sos != NULL; sos = sos->next) { fprintf(fp, "%s S%d ", sos->name, sos->type == SOS_TYPE1 ? 1 : 2); for(sse = sos->first; sse != NULL; sse = sse->next) { write_name(fp, sse->var->name); mpq_out_str(fp, 10, sse->weight); fputc('\n', fp); } } } fprintf(fp, "End\n"); } /* ------------------------------------------------------------------------- */ /* Emacs Local Variables: */ /* Emacs mode:c */ /* Emacs c-basic-offset:3 */ /* Emacs tab-width:8 */ /* Emacs indent-tabs-mode:nil */ /* Emacs End: */ /* ------------------------------------------------------------------------- */ zimpl-3.3.6/src/project.lnt0000644001417200060250000000747513303714141015543 0ustar bzfschlooptimi-passes(3) +fsc // strings are const -ffc // Function takes Custody flag -> off -A(C90) -hFb^3 -width(132,4) -"format=%f:%l: %t %n: %m" //-Ilint //-Ilint/posix //-I/usr/include +libh(lint.h) -function(exit,_assert) -function(exit,__assert) -function(exit,__assertfail) -function(exit,__assert_fail) -function(exit,zimpl_exit) -esym(534,close,creat,fclose,fprintf,fputc,fflush,fsync) -esym(534,fputs,fscanf,fseek,fwrite,lseek,memcpy,memmove,memset) -esym(534,printf,puts,scanf,sprintf,sscanf,strcat,strcpy) -esym(534,strncat,strncpy,unlink,write,regerror) // -e592 // Non-literal format specifier used without arguments -e749 // local enumeration constant not referenced -e758 // Operator followed by operator is confusing -e766 // Include of header file not used -e788 // enum constant not used within defaulted switch -e801 // Use of goto is deprecated -e826 // Suspicious pointer-to-pointer conversion -e834 // Operator followed by operator is confusing. Use parentheses // -efile(766,mshell.h) -efile(537,stdarg.h,float.h,alloca.h,math.h,stdio.h) -esym(666,assert) -efile(525,mmlparse.y,mmlparse.c) -esym(757,yylen) -DYYMAXDEPTH=0 -esym(526,__builtin_next_arg) -esym(628,__builtin_next_arg) -esym(718,__builtin_next_arg) -esym(746,__builtin_next_arg) //-esym(749,list_type::LIST_ERR); -esym(773,BEGIN) -esym(760,FLEX_DEBUG) -esym(765,yy_create_buffer,yy_scan_buffer,yy_scan_string,yy_scan_bytes) -esym(765,yy_switch_to_buffer,yyout,yyin,yy_flush_buffer,yyrestart) -esym(765,yy_init_buffer,yyleng) -esym(768,code) //-esym(123,malloc,calloc,realloc,free) -strong(AzJzX,Tuple,Set,Str,VBCmpOp,VBFixed) -strong(AzJzX,IdxSet,Term,TermElem,IneqType,Ineq,Local,ListElem,List) -strong(AzJzX,ListElem,List,ListData,ListType) -strong(AzJzX,StmtType,Stmt,Prog,CodeType,CodeNode) -strong(AzJzX,RDef,RPar,MFP,RParType,RParVal) -strong(AzJzX,Bound,BoundType) -strong(AzJzX,Heap,HeapType,HeapData,heapCmp) -strong(AzJzX,SetIter,SetCheckType,DefineType,Define) -strong(AzJzX,Var,VarType,VarState,VarClass,Con,ConType,ConState,LpDirect,LpType,LpFormat) -strong(AzJzX,LpsHElem,LpsHashType) -strong(AzJzX,PSResult) -strong(AzJzX,SetType,SetVTab,SetEmpty,SetPseudo,SetHead,SetList,SetRange,SetProd,SetMulti) -strong(AzJzX,SetEmptyIter,SetPseudoIter,SetListIter,SetRangeIter,SetProdIter,SetMultiIter) -strong(AzJzX,ElemType,Elem,ElemValue,ElemStore) -strong(AzJzX,Entry,EntryValue,SymbolType,Symbol) -strong(AzJzX,Pool,PoolElem) -strong(AzJzX,Numb,NumbStore) -strong(AzJzX,StrgFile,FileType) -strong(AzJzX,HashType,Hash,HElem,SetElemIdx) -strong(AzJzX,HeapData,heap_data) -strong(AcJX,Inst) -strong(AJXbl,Bool) -e793 // ANSI limit of 1024 'macros in module' exceeded /* ratlpstore.c */ -esym(528,hash_statist) /* iread.c */ -esym(771,field) // Symbol 'field' (line 227) conceivably not initialized /* gmpmisc.c */ -esym(754,pool_elem::pad) //-e429 //--- Bison --- -esym(424, yyss, yyvs) // klappt nicht -esym(613, yyss, yyvs) -esym(673, yyss, yyvs) // klappt nicht -esym(553,YYENABLE_NLS,YYLTYPE_IS_TRIVIAL) -efile(451,lint/posix/stdio.h) // repeated include file //--- GMP --- -esym(534,__gmpf_out_str,__gmpq_set_str,__gmpq_out_str) -esym(849,GMP_RAND_ALG_LC,GMP_RAND_ALG_DEFAULT) //--- ratlp -esym(757,lps_readmps) // global not referenced -efunc(662,code_new_inst) -efunc(803,lps_makename) //--- set4.h --- -esym(768,set_empty::head,set_pseudo::head,set_range::head,set_prod::head,set_multi::head) -esym(768,set_empty_iter::dummy) //--- elem.c --- -esym(522,elem_init) //--- code.c --- -esym(534,stkchk_used_x) // ignoring return value //--- iread.c --- -esym(645,regex) // regex may not have been initialized //-------------- NOCH ZU TUN -------------------------------- -e714 // Symbol not referenced -e765 // external could be made static -e759 // header declaration for symbol could be moved from header to module -e769 // global enumeration constant not referenced -e755 // global macro not referenced -e413 zimpl-3.3.6/src/CMakeLists.txt0000644001417200060250000001062313303714141016103 0ustar bzfschlooptimibison_target(MMLPARSE2 zimpl/mmlparse2.y ${CMAKE_CURRENT_BINARY_DIR}/zimpl/mmlparse2.c COMPILE_FLAGS -t) flex_target(MMLSCAN zimpl/mmlscan.l ${CMAKE_CURRENT_BINARY_DIR}/zimpl/mmlscan.c) file(MAKE_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/zimpl) # add include directory for bison header include_directories(${CMAKE_CURRENT_BINARY_DIR}) # for zimpl headers include_directories(zimpl) set(libsources zimpl/blkmem.c zimpl/bound.c zimpl/code.c zimpl/conname.c zimpl/define.c zimpl/elem.c zimpl/entry.c zimpl/hash.c zimpl/heap.c zimpl/idxset.c zimpl/inst.c zimpl/iread.c zimpl/list.c zimpl/load.c zimpl/local.c zimpl/metaio.c ${BISON_MMLPARSE2_OUTPUTS} ${FLEX_MMLSCAN_OUTPUTS} zimpl/mono.c zimpl/mshell.c zimpl/prog.c zimpl/random.c zimpl/rdefpar.c zimpl/source.c zimpl/setempty.c zimpl/setpseudo.c zimpl/setlist.c zimpl/setrange.c zimpl/setprod.c zimpl/setmulti.c zimpl/set4.c zimpl/stmt.c zimpl/stkchk.c zimpl/strstore2.c zimpl/symbol.c zimpl/term2.c zimpl/tuple.c zimpl/vinst.c zimpl/zimpllib.c) if(GMP_FOUND) set(libsources ${libsources} zimpl/gmpmisc.c zimpl/numbgmp.c) else() set(libsources ${libsources} zimpl/numbdbl.c) endif() set(binsources zimpl/zimpl.c zimpl/xlpglue.c zimpl/zlpglue.c zimpl/ratlpstore.c zimpl/ratlpfwrite.c zimpl/ratmpswrite.c zimpl/ratmstwrite.c zimpl/ratordwrite.c zimpl/ratpresolve.c) set(headers zimpl/blkmem.h zimpl/bound.h zimpl/code.h zimpl/conname.h zimpl/define.h zimpl/elem.h zimpl/entry.h zimpl/gmpmisc.h zimpl/hash.h zimpl/heap.h zimpl/idxset.h zimpl/inst.h zimpl/lint.h zimpl/list.h zimpl/local.h zimpl/metaio.h zimpl/mme.h ${BISON_MMLPARSE2_OUTPUT_HEADER} zimpl/mono.h zimpl/mshell.h zimpl/numb.h zimpl/prog.h zimpl/random.h zimpl/ratlp.h zimpl/ratlpstore.h zimpl/ratlptypes.h zimpl/rdefpar.h zimpl/set4.h zimpl/set.h zimpl/stkchk.h zimpl/stmt.h zimpl/strstore.h zimpl/symbol.h zimpl/term.h zimpl/tuple.h zimpl/xlpglue.h zimpl/zimpllib.h zimpl/zlpglue.h) include_directories(${PROJECT_SOURCE_DIR}/src) if(MSVC) set(headers ${headers} WIN/unistd.h) set(libsources ${libsources} WIN/getopt.c) include_directories(${PROJECT_SOURCE_DIR}/src/WIN) endif() #create zimpl with pic add_library(libzimpl-pic STATIC ${libsources}) set_target_properties(libzimpl-pic PROPERTIES POSITION_INDEPENDENT_CODE on) target_link_libraries(libzimpl-pic ${libs}) #create zimpl without pic add_library(libzimpl STATIC ${libsources}) target_link_libraries(libzimpl ${libs}) #create zimpl binary add_executable(zimpl ${binsources}) target_link_libraries(zimpl libzimpl ${libs}) set_target_properties(libzimpl PROPERTIES OUTPUT_NAME "zimpl") set_target_properties(libzimpl-pic PROPERTIES OUTPUT_NAME "zimpl-pic") # install the header files of zimpl install(FILES ${headers} DESTINATION include/zimpl) # install the binary and the library to appropriate locations and add them to an export group install(TARGETS libzimpl zimpl libzimpl-pic EXPORT zimpl-targets LIBRARY DESTINATION lib ARCHIVE DESTINATION lib RUNTIME DESTINATION bin INCLUDES DESTINATION include) # Add library targets to the build-tree export set export(TARGETS libzimpl libzimpl-pic FILE "${CMAKE_BINARY_DIR}/zimpl-targets.cmake") #configure the config file for the build tree set(CONF_INCLUDE_DIRS ${PROJECT_SOURCE_DIR}/src) if(MSVC) set(CONF_INCLUDE_DIRS ${CONF_INCLUDE_DIRS} ${PROJECT_SOURCE_DIR}/src/WIN) endif() configure_file(${PROJECT_SOURCE_DIR}/zimpl-config.cmake.in "${CMAKE_BINARY_DIR}/zimpl-config.cmake" @ONLY) #configure the config file for the install set(CONF_INCLUDE_DIRS \${CMAKE_CURRENT_LIST_DIR}/../../../include) if(MSVC) set(CONF_INCLUDE_DIRS ${CONF_INCLUDE_DIRS} \${CMAKE_CURRENT_LIST_DIR}/../../../include/WIN) endif() configure_file(${PROJECT_SOURCE_DIR}/zimpl-config.cmake.in "${PROJECT_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/zimpl-config.cmake" @ONLY) # install the targets of the zimpl export group and the config file so that oter projects # can link easily against zimpl install(EXPORT zimpl-targets FILE zimpl-targets.cmake DESTINATION lib/cmake/zimpl) install(FILES "${PROJECT_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/zimpl-config.cmake" DESTINATION lib/cmake/zimpl) zimpl-3.3.6/src/cppcheck.txt0000644001417200060250000000117713303714141015670 0ustar bzfschlooptiminegativeIndex:src/mmlparse2.c:2059 unsignedLessThanZero:src/mmlscan.c:2094 unsignedLessThanZero:src/mmlscan.c:2107 unusedStructMember:src/mmlscan.c:473 unusedStructMember:src/mmlscan.c:474 variableScope:src/mshell.c:187 variableScope:src/mshell.c:189 variableScope:src/mshell.c:228 variableScope:src/mshell.c:230 variableScope:src/mshell.c:264 variableScope:src/mshell.c:266 variableScope:src/mshell.c:268 variableScope:src/mshell.c:311 variableScope:src/mshell.c:326 variableScope:src/mshell.c:348 variableScope:src/ratlpstore.c:384 variableScope:src/ratlpstore.c:388 variableScope:src/ratlpstore.c:391 variableScope:src/ratlpstore.c:398 zimpl-3.3.6/doc/zimpl.man0000644001417200060250000001033013304236715015153 0ustar bzfschlooptimi.\" Process this file with .\" groff -man -Tascii zimpl.man .\" .TH ZIMPL 1 "14 Mar 2017" Linux "User Manuals" .SH NAME zimpl \- Zuse Institute Mathematical Programming Language .SH SYNOPSIS .B zimpl [ \-b ] [ \-D .I name=value .B ] [ \-f ] [ \-F .I filter .B ] [ \-h ] [ \-m ] [ \-l .I length .B [ \-n .I cm|cn|cf .B ] [ \-o .I outfile .B ] [ \-O ] [ \-P .I filter .B [ \-r ] [ \-t .I lp|mps|hum|rlp|pip .B ] [ \-s .I seed .B ] [ \-v .I 0-5 .B ] [ \-V ] .I file .B ... .SH DESCRIPTION .B Zimpl is a little language to translate the mathematical model of a problem into a linear or (mixed-)integer mathematical program expressed in LPF or MPS file format which can be read by a LP or MIP solver. None of the options is necessary. All input files in .B zpl format that are given are concatenated and processed as if they are one big file. This makes is possible to combine different parts of a model on the command line. In this case the first filename given will be used as basename for the output files in absence of an .B \-o option. The .B \-t option is to select the output format. .B mps can be read by every solver. .B lpf is a CPLEX format, but can also read by several solvers. BE aware that for example Range-rows can not be expressed in .B lpf . If you would like to inspected the output yourself, .B hum format is a variant of .B lpf with no name mangeling whatever, but unfortunately this violates several format restrictions, so no solver will read this in. If .B rlp is specified the output is in .B lpf format, but rows and columns are randomly permuted. .SH OPTIONS .IP \-b Enable .BR bison (1) debugging output. .IP "\-D name=value" Sets the parameter .I name to the specified value. This is equivalent with having this line in the Zimpl program: param name:=val . .IP -f Enable .BR flex (1) debugging output. .IP "\-F filter" The output is piped through a filter. A %s in the string is replaced by the output filename. For example: -F "gzip \-c >%s.gz" would compress all the output files. .IP -h Show program help. .IP "\-l length" Sets the maximum length for variable names in LPF output files. .IP -m Write a CPLEX .mst Mip STart file. .IP "\-n cm|cn|cf" Select the format for the generation of constraint names. Can be either .I cm which will number them 1 ... n with a `c' in front. .I cn will use the name supplied in the subto statement and number them 1 ... n within the statement. .I cf will use the name given with the subto, then a 1 .. n number like in .I cm and then append all the local variables from the forall statements. .IP "-o outfile" Sets the base-name for the output files. Default is the name of the input file without extension. .IP \-O Optimize the generated LP by doing some presolve analysis (experimental). .IP "\-P filter" The input is piped through a filter. A %s in the string is replaced by the input filename. For example: \-F "cpp -DWITH_C1 %s" would pass the input file through the C-preprocessor. .IP \-r Write a CPLEX .ord branching order file. .IP "\-s seed" Set the random number generator seed. .IP "\-t lp|mps|hum|rlp|pip" Selects the output format. Can be either .I lp which is default, or .I mps , or .I hum , which is (only) human readable, or .I rlp , which is randomly permuted, or .I pip , which means polynimial IP. .IP "\-v 0-5" Set the verbosity level. 0 is quiet, 1 is default, 2 is verbose, 3 is chatter, and 5 is debug. .IP \-V Prints the version number. .\".SH FILES .\".SH ENVIRONMENT .SH DIAGNOSTICS The following diagnostics may be issued on stderr: 101 Bad filename .RS The name given with the .B \-o option is either missing, a directory name, or starts with a dot. .RE 175 Illegal syntax for command line define -- ignored .RS The parameter of a .B \-D option was either not of the form .I "name=value" or the name was not a legal identifier. .RE There are about a hundred other possible error messages, but these are either about the contend of the input file, or system messages. .SH BUGS Please report any bug to the author. .SH AUTHOR Thorsten Koch .SH "WEBSITE" The lastest version of Zimpl is always available at . .SH "SEE ALSO" The Zimpl User Guide at . .\".BR zpl (5), .\".BR lpf (5), .\".BR mps (5) zimpl-3.3.6/check/0000755001417200060250000000000013303714344013634 5ustar bzfschlooptimizimpl-3.3.6/check/errors/0000755001417200060250000000000013301553023015141 5ustar bzfschlooptimizimpl-3.3.6/check/errors/e211.zpl0000644001417200060250000000012413301553023016335 0ustar bzfschlooptimi# $Id: e211.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := min({"a","b"}); zimpl-3.3.6/check/errors/e119_3.err.ref0000644001417200060250000000025113301553023017325 0ustar bzfschlooptimi*** Error 119: Intersection of sets with different dimension *** File: e119_3.zpl Line 2 *** set A:={1..5} inter {1..2}*{3..4}; *** ^^^ zimpl-3.3.6/check/errors/e700_2.err.ref0000644001417200060250000000021513301553023017320 0ustar bzfschlooptimi*** Error 700: log(-1.000000): Numerical argument out of domain *** File: e700_2.zpl Line 2 *** param x := log(-1); *** ^^^ zimpl-3.3.6/check/errors/e148.err.ref0000644001417200060250000000025713301553023017113 0ustar bzfschlooptimi*** Error 148: use value -3 is not positive *** File: e148.zpl Line 2 *** set A := { read "dummy.dat" as "<1n>" use -3 }; *** ^^^ zimpl-3.3.6/check/errors/e120_1.zpl0000644001417200060250000000014713301553023016561 0ustar bzfschlooptimi# $Id: e120_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={<1,"a">,<2,"b">}+{<"c",3>,<"e",4>}; zimpl-3.3.6/check/errors/e207.err.ref0000644001417200060250000000032313301553023017101 0ustar bzfschlooptimi*** Error 207: "size" value 10000000000 is too big or not an integer *** File: e207.zpl Line 2 *** set A := argmin(10000000000) in { 1 .. 20 } : i; *** ^^^ zimpl-3.3.6/check/errors/e204.err.ref0000644001417200060250000000022113301553023017073 0ustar bzfschlooptimi*** Error 204: Randomfunction parameter minimum= 5 >= maximum= 3 *** File: e204.zpl Line 2 *** param r := random(5,3); *** ^^^ zimpl-3.3.6/check/errors/e197_1.zpl0000644001417200060250000000015413301553023016575 0ustar bzfschlooptimi# $Id: e197_1.zpl,v 1.6 2010/06/10 19:42:42 bzfkocht Exp $ set K[ in {1..2} with i > 3] := { <1>, <2> }; zimpl-3.3.6/check/errors/e113.err.ref0000644001417200060250000000020513301553023017074 0ustar bzfschlooptimi*** Error 113: Factorial value 3.5 is too big or not an integer *** File: e113.zpl Line 2 *** param a := 3.5!; *** ^^^ zimpl-3.3.6/check/errors/e118_3.err.ref0000644001417200060250000000023113301553023017322 0ustar bzfschlooptimi*** Error 118: Comparison of different types *** File: e118_3.zpl Line 2 *** param a := if 2 > "a" then 3 else "b" end; *** ^^^ zimpl-3.3.6/check/errors/e219.err.ref0000644001417200060250000000023613301553023017107 0ustar bzfschlooptimi*** Error 219: Length value -1 in substr is negative *** File: e219.zpl Line 2 *** param n := substr("hallo", 2, -1); *** ^^^ zimpl-3.3.6/check/errors/e151_1.err.ref0000644001417200060250000000023613301553023017322 0ustar bzfschlooptimi*** Error 151: Not a valid read template *** File: e151_1.zpl Line 2 *** set A := { read "dummy.dat" as "1n>" }; *** ^^^ zimpl-3.3.6/check/errors/e124.zpl0000644001417200060250000000011613301553023016341 0ustar bzfschlooptimi# $Id: e124.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1 to 5.5}; zimpl-3.3.6/check/errors/e190.err.ref0000644001417200060250000000024013301553023017100 0ustar bzfschlooptimi*** Error 190: Component number 0.7 is too big or not an integer *** File: e190.zpl Line 2 *** param x := ord({1..5},1,0.7); *** ^^^ zimpl-3.3.6/check/errors/e120_2.zpl0000644001417200060250000000014513301553023016560 0ustar bzfschlooptimi# $Id: e120_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={<"a",1,5>,<"b",3,4>}-{<1,"a",3>}; zimpl-3.3.6/check/errors/e197_1.err.ref0000644001417200060250000000025713301553023017337 0ustar bzfschlooptimi*** Error 197: Empty index set for set *** File: e197_1.zpl Line 2 *** set K[ in {1..2} with i > 3] := { <1>, <2> }; *** ^^^ zimpl-3.3.6/check/errors/e135_1.zpl0000644001417200060250000000015613301553023016567 0ustar bzfschlooptimi# $Id: e135_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I:={1..2}; param p[ in I with i > 3] := i; zimpl-3.3.6/check/errors/e174_3.err.ref0000644001417200060250000000035113301553023017327 0ustar bzfschlooptimi*** Error 174: Numeric field read as "hallo". This is not a number. *** File: e174.dat line 1 *** File: e174_3.zpl Line 2 *** param p[{1..3}] := read "e174.dat" as "n+" ; *** ^^^ zimpl-3.3.6/check/errors/e193.err.ref0000644001417200060250000000026113301553023017106 0ustar bzfschlooptimi*** Error 193: Different dimension tuples in set initialisation <1> vs. <1,2> *** File: e193.zpl Line 2 *** set I := { <1,2>, <1>, <2,3> }; *** ^^^ zimpl-3.3.6/check/errors/e201.dat0000644001417200060250000000005113301553023016276 0ustar bzfschlooptimi15 3 4 5 6 17 7 8 8 8 18 4 5 55 5zimpl-3.3.6/check/errors/e151_2.zpl0000644001417200060250000000014313301553023016562 0ustar bzfschlooptimi# $Id: e151_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n" }; zimpl-3.3.6/check/errors/e221.zpl0000644001417200060250000000012313301553023016335 0ustar bzfschlooptimi# $Id: e221.zpl,v 1.2 2010/06/10 19:42:42 bzfkocht Exp $ var x; maximize a: x * x; zimpl-3.3.6/check/errors/e220.err.ref0000644001417200060250000000026713301553023017103 0ustar bzfschlooptimi*** Error 220: Illegal size for subsets 6, should be between 3 and 5 *** File: e220.zpl Line 2 *** set S[]:=subsets({1..5}, 3, 6); *** ^^^ zimpl-3.3.6/check/errors/e157.err.ref0000644001417200060250000000030713301553023017107 0ustar bzfschlooptimi*** Error 157: Not enough fields in data (value) *** File: e157.dat line 1 *** File: e157.zpl Line 2 *** set A:={read "e157.dat" as "<1n> 2n"}; *** ^^^ zimpl-3.3.6/check/errors/e119_3.zpl0000644001417200060250000000013613301553023016571 0ustar bzfschlooptimi# $Id: e119_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={1..5} inter {1..2}*{3..4}; zimpl-3.3.6/check/errors/e151_3.err.ref0000644001417200060250000000024213301553023017321 0ustar bzfschlooptimi*** Error 151: Not a valid read template *** File: e151_3.zpl Line 2 *** set A := { read "dummy.dat" as "<1n>>" }; *** ^^^ zimpl-3.3.6/check/errors/e702_2.zpl0000644001417200060250000000011613301553023016564 0ustar bzfschlooptimi# $Id: e702_2.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := ln(-1); zimpl-3.3.6/check/errors/e145.zpl0000644001417200060250000000012713301553023016346 0ustar bzfschlooptimi# $Id: e145.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set S[]:=subsets({1..5}, 7); zimpl-3.3.6/check/errors/e154.err.ref0000644001417200060250000000023313301553023017102 0ustar bzfschlooptimi*** Error 154: Invalid field type [q] *** File: e154.zpl Line 2 *** set A := { read "dummy.dat" as "<1q>" }; *** ^^^ zimpl-3.3.6/check/errors/e118_2.err.ref0000644001417200060250000000023313301553023017323 0ustar bzfschlooptimi*** Error 118: Comparison of different types *** File: e118_2.zpl Line 2 *** param a := if 2 >= "a" then 3 else "b" end; *** ^^^ zimpl-3.3.6/check/errors/e107.zpl0000644001417200060250000000012713301553023016344 0ustar bzfschlooptimi# $Id: e107.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ var x; subto c1: 5 <= x >= 4; zimpl-3.3.6/check/errors/e157.dat0000644001417200060250000000000413301553023016306 0ustar bzfschlooptimi1 2 zimpl-3.3.6/check/errors/e218.err.ref0000644001417200060250000000030113301553023017077 0ustar bzfschlooptimi*** Error 218: Length value 123456789012 is too big or not an integer *** File: e218.zpl Line 2 *** param n := substr("hallo", 2,123456789012); *** ^^^ zimpl-3.3.6/check/errors/e153.err.ref0000644001417200060250000000025113301553023017101 0ustar bzfschlooptimi*** Error 153: Invalid field number [70000] *** File: e153.zpl Line 2 *** set A := { read "dummy.dat" as "<70000n>" }; *** ^^^ zimpl-3.3.6/check/errors/e105.err.ref0000644001417200060250000000016613301553023017103 0ustar bzfschlooptimi*** Error 105: Duplicate constraint name "c1" *** File: e105.zpl Line 4 *** subto c1: x <= 6; *** ^^^ zimpl-3.3.6/check/errors/e133_5.zpl0000644001417200060250000000014313301553023016565 0ustar bzfschlooptimi# $Id: e133_5.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param q := if x <= y then 1 else 2 end; zimpl-3.3.6/check/errors/e110_1.zpl0000644001417200060250000000011313301553023016551 0ustar bzfschlooptimi# $Id: e110_1.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 3/0; zimpl-3.3.6/check/errors/e183.zpl0000644001417200060250000000014313301553023016346 0ustar bzfschlooptimi# $Id: e183.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a real <= 6; subto c1: vabs(a) <= 2; zimpl-3.3.6/check/errors/e146.err.ref0000644001417200060250000000020513301553023017102 0ustar bzfschlooptimi*** Error 146: Tried to build powerset of empty set *** File: e146.zpl Line 2 *** set S[]:=powerset({}); *** ^^^ zimpl-3.3.6/check/errors/e119_4.err.ref0000644001417200060250000000026513301553023017333 0ustar bzfschlooptimi*** Error 119: Symmetric Difference of sets with different dimension *** File: e119_4.zpl Line 2 *** set A:={1..5} symdiff {1..2}*{3..4}; *** ^^^ zimpl-3.3.6/check/errors/e119_4.zpl0000644001417200060250000000014013301553023016565 0ustar bzfschlooptimi# $Id: e119_4.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={1..5} symdiff {1..2}*{3..4}; zimpl-3.3.6/check/errors/e108.err.ref0000644001417200060250000000024313301553023017102 0ustar bzfschlooptimi*** Error 108: Empty Term with nonempty LHS/RHS, constraint trivially violated *** File: e108.zpl Line 2 *** subto c1: 5 <= 17 <= 4; *** ^^^ zimpl-3.3.6/check/errors/e211.err.ref0000644001417200060250000000022213301553023017072 0ustar bzfschlooptimi*** Error 211: MIN of set containing non number elements *** File: e211.zpl Line 2 *** param n := min({"a","b"}); *** ^^^ zimpl-3.3.6/check/errors/e105_1.zpl0000644001417200060250000000014613301553023016563 0ustar bzfschlooptimi# $Id: e105_1.zpl,v 1.1 2011/07/31 15:10:45 bzfkocht Exp $ var x; subto c1: x >= 5; subto c1: x <= 6; zimpl-3.3.6/check/errors/e173_3.zpl0000644001417200060250000000016313301553023016571 0ustar bzfschlooptimi# $Id: e173_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a[{1..9}] := read "e173.dat" as "n+", <9> "hallo";zimpl-3.3.6/check/errors/e185.err.ref0000644001417200060250000000022513301553023017107 0ustar bzfschlooptimi*** Error 185: Term in Boolean constraint not bounded *** File: e185.zpl Line 4 *** subto c1: vif(a > 2) then a <= 6 end; *** ^^^ zimpl-3.3.6/check/errors/e120_1.err.ref0000644001417200060250000000026013301553023017313 0ustar bzfschlooptimi*** Error 120: Union of sets with different types *** File: e120_1.zpl Line 2 *** set A:={<1,"a">,<2,"b">}+{<"c",3>,<"e",4>}; *** ^^^ zimpl-3.3.6/check/errors/e701.zpl0000644001417200060250000000011613301553023016342 0ustar bzfschlooptimi# $Id: e701.zpl,v 1.6 2010/06/10 19:42:42 bzfkocht Exp $ param x := sqrt(-1); zimpl-3.3.6/check/errors/e120_2.err.ref0000644001417200060250000000025413301553023017317 0ustar bzfschlooptimi*** Error 120: Minus of sets with different types *** File: e120_2.zpl Line 2 *** set A:={<"a",1,5>,<"b",3,4>}-{<1,"a",3>}; *** ^^^ zimpl-3.3.6/check/errors/e145.err.ref0000644001417200060250000000026113301553023017103 0ustar bzfschlooptimi*** Error 145: Illegal size for subsets 7, should be between 1 and 5 *** File: e145.zpl Line 2 *** set S[]:=subsets({1..5}, 7); *** ^^^ zimpl-3.3.6/check/errors/e105_1.err.ref0000644001417200060250000000017013301553023017316 0ustar bzfschlooptimi*** Error 105: Duplicate constraint name "c1" *** File: e105_1.zpl Line 4 *** subto c1: x <= 6; *** ^^^ zimpl-3.3.6/check/errors/e222_2.zpl0000644001417200060250000000021613301553023016562 0ustar bzfschlooptimi# $Id: e222_2.zpl,v 1.1 2014/01/12 09:47:38 bzfkocht Exp $ var x binary; var y binary; subto c1: vif x == 1 then y >= 1 else y * y == 0 end; zimpl-3.3.6/check/errors/e172.err.ref0000644001417200060250000000037213301553023017106 0ustar bzfschlooptimi*** Error 172: Wrong number of entries (2) in table line, expected 3 entries *** File: e172.zpl Line 5 *** {1..3}*{1..3}] := | 1, 2, 3 | |1| 0, 1 | |2| 3, 4, 5 |; *** ^^^ zimpl-3.3.6/check/errors/e118_1.zpl0000644001417200060250000000014713301553023016570 0ustar bzfschlooptimi# $Id: e118_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a := if 2 == "a" then 3 else "b" end; zimpl-3.3.6/check/errors/e133_7.zpl0000644001417200060250000000020113301553023016562 0ustar bzfschlooptimi# $Id: e133_7.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := {1,2,3}; var w[I]; subto c1: forall in I do w[k] <= 1; zimpl-3.3.6/check/errors/e702_1.err.ref0000644001417200060250000000020413301553023017317 0ustar bzfschlooptimi*** Error 702: ln(0.000000): Numerical result out of range *** File: e702_1.zpl Line 2 *** param x := ln(0); *** ^^^ zimpl-3.3.6/check/errors/e701.err.ref0000644001417200060250000000021613301553023017101 0ustar bzfschlooptimi*** Error 701: sqrt(-1.000000): Numerical argument out of domain *** File: e701.zpl Line 2 *** param x := sqrt(-1); *** ^^^ zimpl-3.3.6/check/errors/e217.err.ref0000644001417200060250000000024513301553023017105 0ustar bzfschlooptimi*** Error 217: Begin value 2.5 is too big or not an integer *** File: e217.zpl Line 2 *** param n := substr("hallo", 2.5,4); *** ^^^ zimpl-3.3.6/check/errors/e152_1.zpl0000644001417200060250000000014413301553023016563 0ustar bzfschlooptimi# $Id: e152_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "" }; zimpl-3.3.6/check/errors/e156.dat0000644001417200060250000000000413301553023016305 0ustar bzfschlooptimi1 2 zimpl-3.3.6/check/errors/e120_3.err.ref0000644001417200060250000000025113301553023017315 0ustar bzfschlooptimi*** Error 120: Intersection of sets with different types *** File: e120_3.zpl Line 2 *** set A:={"a", "b", "c"} inter {1..3}; *** ^^^ zimpl-3.3.6/check/errors/e209.zpl0000644001417200060250000000013013301553023016341 0ustar bzfschlooptimi# $Id: e209.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := min({1..3}*{1..3}); zimpl-3.3.6/check/errors/e147.err.ref0000644001417200060250000000027713301553023017114 0ustar bzfschlooptimi*** Error 147: use value 1.5 is too big or not an integer *** File: e147.zpl Line 2 *** set A := { read "dummy.dat" as "<1n>" use 1.5 }; *** ^^^ zimpl-3.3.6/check/errors/e163.err.ref0000644001417200060250000000007513301553023017106 0ustar bzfschlooptimi*** Error 163: Line 2: Syntax Error *** pagam x = 5; *** ^^^ zimpl-3.3.6/check/errors/e214.zpl0000644001417200060250000000013313301553023016340 0ustar bzfschlooptimi# $Id: e214.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set A:={read "e214.dat" as "n+"}; zimpl-3.3.6/check/errors/e212.err.ref0000644001417200060250000000022213301553023017073 0ustar bzfschlooptimi*** Error 212: MAX of set containing non number elements *** File: e212.zpl Line 2 *** param n := max({"a","b"}); *** ^^^ zimpl-3.3.6/check/errors/e188_1.zpl0000644001417200060250000000013113301553023016570 0ustar bzfschlooptimi# $Id: e188_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := { in {1..5} }; zimpl-3.3.6/check/errors/e168.zpl0000644001417200060250000000007013301553023016350 0ustar bzfschlooptimi# $Id: e168.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $zimpl-3.3.6/check/errors/e141.err.ref0000644001417200060250000000024513301553023017101 0ustar bzfschlooptimi*** Error 141: Infeasible due to conflicting bounds for var x lower=4 > upper=2 *** File: e141.zpl Line 2 *** var x >= 4 <= 2; *** ^^^ zimpl-3.3.6/check/errors/e220.zpl0000644001417200060250000000013213301553023016334 0ustar bzfschlooptimi# $Id: e220.zpl,v 1.5 2011/07/31 15:10:45 bzfkocht Exp $ set S[]:=subsets({1..5}, 3, 6); zimpl-3.3.6/check/errors/e151_4.zpl0000644001417200060250000000014513301553023016566 0ustar bzfschlooptimi# $Id: e151_4.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<<1n>" }; zimpl-3.3.6/check/errors/e198_1.err.ref0000644001417200060250000000025413301553023017335 0ustar bzfschlooptimi*** Error 198: Incompatible index tuple component 2 is not compatible with <1,2> *** File: e198_1.zpl Line 3 *** set B:={ in A}; *** ^^^ zimpl-3.3.6/check/errors/e129.err.ref0000644001417200060250000000021313301553023017102 0ustar bzfschlooptimi*** Error 129: Illegal index 3, set has only dimension 2 *** File: e129.zpl Line 3 *** set B := proj(A, <3>); *** ^^^ zimpl-3.3.6/check/errors/e115.zpl0000644001417200060250000000011313301553023016336 0ustar bzfschlooptimi# $Id: e115.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 1001!; zimpl-3.3.6/check/errors/e133_3.zpl0000644001417200060250000000014313301553023016563 0ustar bzfschlooptimi# $Id: e133_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param q := if x != y then 1 else 2 end; zimpl-3.3.6/check/errors/e127.err.ref0000644001417200060250000000024113301553023017101 0ustar bzfschlooptimi*** Error 127: Illegal value type in tuple: <"a"> only numbers are possible *** File: e127.zpl Line 3 *** set B := proj(A, <"a">); *** ^^^ zimpl-3.3.6/check/errors/e182.zpl0000644001417200060250000000014713301553023016351 0ustar bzfschlooptimi# $Id: e182.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a integer <= 6; subto c1: vabs(0*a) <= 2;zimpl-3.3.6/check/errors/e183.err.ref0000644001417200060250000000016713301553023017112 0ustar bzfschlooptimi*** Error 183: vabs term not all integer *** File: e183.zpl Line 4 *** subto c1: vabs(a) <= 2; *** ^^^ zimpl-3.3.6/check/errors/e133_2.zpl0000644001417200060250000000014013301553023016557 0ustar bzfschlooptimi# $Id: e133_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I:={1..2}; param p[I] := <1> i; zimpl-3.3.6/check/errors/e112.zpl0000644001417200060250000000011313301553023016333 0ustar bzfschlooptimi# $Id: e112.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 3^2.5; zimpl-3.3.6/check/errors/e156.err.ref0000644001417200060250000000027113301553023017106 0ustar bzfschlooptimi*** Error 156: Not enough fields in data *** File: e156.dat line 1 *** File: e156.zpl Line 2 *** set A:={read "e156.dat" as "<2n>"}; *** ^^^ zimpl-3.3.6/check/errors/e133_2.err.ref0000644001417200060250000000016113301553023017320 0ustar bzfschlooptimi*** Error 133: Unknown symbol "i" *** File: e133_2.zpl Line 3 *** param p[I] := <1> i; *** ^^^ zimpl-3.3.6/check/errors/e700_3.zpl0000644001417200060250000000012513301553023016563 0ustar bzfschlooptimi# $Id: e700_3.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := log(1/10^400); zimpl-3.3.6/check/errors/e218.zpl0000644001417200060250000000014513301553023016347 0ustar bzfschlooptimi# $Id: e218.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := substr("hallo", 2,123456789012); zimpl-3.3.6/check/errors/e201_1.zpl0000644001417200060250000000015013301553023016553 0ustar bzfschlooptimi# $Id: e201_1.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param p := read "e201.dat" as "2n 3n" use 1; zimpl-3.3.6/check/errors/e173_2.err.ref0000644001417200060250000000034113301553023017324 0ustar bzfschlooptimi*** Error 173: Illegal type in element <3> -> "hallo" for symbol *** File: e173_2.zpl Line 2 *** param a[ in {1..5}] := if i == 3 then "hallo" else 2 end; *** ^^^ zimpl-3.3.6/check/errors/e152_2.err.ref0000644001417200060250000000023513301553023017323 0ustar bzfschlooptimi*** Error 152: Invalid read template syntax *** File: e152_2.zpl Line 2 *** set A := { read "dummy.dat" as "n" }; *** ^^^ zimpl-3.3.6/check/errors/e184.err.ref0000644001417200060250000000016313301553023017107 0ustar bzfschlooptimi*** Error 184: vabs term not bounded *** File: e184.zpl Line 4 *** subto c1: vabs(a) <= 2; *** ^^^ zimpl-3.3.6/check/errors/e700_1.zpl0000644001417200060250000000011613301553023016561 0ustar bzfschlooptimi# $Id: e700_1.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := log(0); zimpl-3.3.6/check/errors/e168.err.ref0000644001417200060250000000006013301553023017105 0ustar bzfschlooptimi*** Error 168: No program statements to execute zimpl-3.3.6/check/errors/e207.zpl0000644001417200060250000000015613301553023016347 0ustar bzfschlooptimi# $Id: e207.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set A := argmin(10000000000) in { 1 .. 20 } : i; zimpl-3.3.6/check/errors/e174_1.zpl0000644001417200060250000000014413301553023016567 0ustar bzfschlooptimi# $Id: e174_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := { read "e174.dat" as "<1n>" }; zimpl-3.3.6/check/errors/e151_1.zpl0000644001417200060250000000014313301553023016561 0ustar bzfschlooptimi# $Id: e151_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "1n>" }; zimpl-3.3.6/check/errors/e110_1.err.ref0000644001417200060250000000014613301553023017315 0ustar bzfschlooptimi*** Error 110: Division by zero *** File: e110_1.zpl Line 2 *** param a := 3/0; *** ^^^ zimpl-3.3.6/check/errors/e142_1.err.ref0000644001417200060250000000017213301553023017321 0ustar bzfschlooptimi*** Error 142: Unknown index <6> for symbol "x" *** File: e142_1.zpl Line 4 *** subto c1: x[6] <= 5; *** ^^^ zimpl-3.3.6/check/errors/e188_2.zpl0000644001417200060250000000013613301553023016576 0ustar bzfschlooptimiset A := { 1, 2, 3 }; set B := { 1 .. 3 } * { "a", "b" }; set C := { in A with in B };zimpl-3.3.6/check/errors/e900.err.ref0000644001417200060250000000014313301553023017101 0ustar bzfschlooptimi*** Error 900: Check failed! *** File: e900.zpl Line 2 *** do check 2 == 3; *** ^^^ zimpl-3.3.6/check/errors/e120_4.err.ref0000644001417200060250000000024113301553023017315 0ustar bzfschlooptimi*** Error 120: Symmetric Difference of sets with different types *** File: e120_4.zpl Line 2 *** set A:={1..5} symdiff {"a"}; *** ^^^ zimpl-3.3.6/check/errors/e110_2.err.ref0000644001417200060250000000015613301553023017317 0ustar bzfschlooptimi*** Error 110: Division by zero *** File: e110_2.zpl Line 2 *** param a := 3 div 0; *** ^^^ zimpl-3.3.6/check/errors/e135_3.zpl0000644001417200060250000000014713301553023016571 0ustar bzfschlooptimi# $Id: e135_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param y[ in {1..5} with i > 5] := <1> 6; zimpl-3.3.6/check/errors/e177.zpl0000644001417200060250000000016213301553023016352 0ustar bzfschlooptimi# $Id: e177.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a real <= 10; subto c1: vif a <= 5 then a >= 2 end;zimpl-3.3.6/check/errors/e170.zpl0000644001417200060250000000014713301553023016346 0ustar bzfschlooptimi# $Id: e170.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ defnumb test(i) := i + 1; param x := test(k); zimpl-3.3.6/check/errors/e198_2.err.ref0000644001417200060250000000031013301553023017327 0ustar bzfschlooptimi*** Error 198: Incompatible index tuple Tuple component 1 is not compatible with <1> *** File: e198_2.zpl Line 3 *** set C := { in A with in B }; *** ^^^ zimpl-3.3.6/check/errors/e133_3.err.ref0000644001417200060250000000020013301553023017313 0ustar bzfschlooptimi*** Error 133: Unknown symbol "x" *** File: e133_3.zpl Line 2 *** param q := if x != y then 1 else 2 end; *** ^^^ zimpl-3.3.6/check/errors/e132.err.ref0000644001417200060250000000032313301553023017076 0ustar bzfschlooptimi*** Error 132: Values in parameter list missing, probably wrong read template *** File: e132.zpl Line 3 *** param p[I] := read "e132.dat" as "<1n>"; *** ^^^ zimpl-3.3.6/check/errors/e132.zpl0000644001417200060250000000016213301553023016341 0ustar bzfschlooptimi# $Id: e132.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I:={1..3}; param p[I] := read "e132.dat" as "<1n>"; zimpl-3.3.6/check/errors/e159.zpl0000644001417200060250000000012013301553023016344 0ustar bzfschlooptimi# $Id: e159.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := 5 / "hallo";zimpl-3.3.6/check/errors/e174_1.err.ref0000644001417200060250000000034013301553023017323 0ustar bzfschlooptimi*** Error 174: Numeric field 1 read as "hallo". This is not a number. *** File: e174.dat line 1 *** File: e174_1.zpl Line 2 *** set I := { read "e174.dat" as "<1n>" }; *** ^^^ zimpl-3.3.6/check/errors/e126_2.zpl0000644001417200060250000000012413301553023016563 0ustar bzfschlooptimi# $Id: e126_2.zpl,v 1.7 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1 .. 5 by 0}; zimpl-3.3.6/check/errors/e702_3.err.ref0000644001417200060250000000022213301553023017321 0ustar bzfschlooptimi*** Error 702: ln(0.000000): Numerical result out of range *** File: e702_3.zpl Line 2 *** param x := ln(1/10^400); *** ^^^ zimpl-3.3.6/check/errors/e173_1.zpl0000644001417200060250000000015013301553023016563 0ustar bzfschlooptimi# $Id: e173_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a[{1..3}] := <1> 1, <2> "hallo", <3> 3;zimpl-3.3.6/check/errors/e900.zpl0000644001417200060250000000011113301553023016336 0ustar bzfschlooptimi# $Id: e900.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ do check 2 == 3;zimpl-3.3.6/check/errors/e123.zpl0000644001417200060250000000011613301553023016340 0ustar bzfschlooptimi# $Id: e123.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1.5 to 5}; zimpl-3.3.6/check/errors/e210.zpl0000644001417200060250000000013013301553023016331 0ustar bzfschlooptimi# $Id: e210.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := max({1..3}*{1..3}); zimpl-3.3.6/check/errors/e182.err.ref0000644001417200060250000000017513301553023017110 0ustar bzfschlooptimi*** Error 182: Empty LHS, in variable vabs *** File: e182.zpl Line 4 *** subto c1: vabs(0*a) <= 2; *** ^^^ zimpl-3.3.6/check/errors/e222_1.err.ref0000644001417200060250000000026313301553023017321 0ustar bzfschlooptimi*** Error 222: Term inside a then or else constraint not linear *** File: e222_1.zpl Line 5 *** subto c1: vif x == 1 then y * y == 1 end; *** ^^^ zimpl-3.3.6/check/errors/e112.err.ref0000644001417200060250000000020713301553023017075 0ustar bzfschlooptimi*** Error 112: Exponent value 2.5 is too big or not an integer *** File: e112.zpl Line 2 *** param a := 3^2.5; *** ^^^ zimpl-3.3.6/check/errors/e159.err.ref0000644001417200060250000000021113301553023017103 0ustar bzfschlooptimi*** Error 159: Type error, expected Number got String *** File: e159.zpl Line 2 *** param x := 5 / "hallo"; *** ^^^ zimpl-3.3.6/check/errors/e133_1.err.ref0000644001417200060250000000015113301553023017316 0ustar bzfschlooptimi*** Error 133: Unknown symbol "i" *** File: e133_1.zpl Line 3 *** param p[I] := i; *** ^^^ zimpl-3.3.6/check/errors/e142_2.zpl0000644001417200060250000000034413301553023016565 0ustar bzfschlooptimi# $Id: e142_2.zpl,v 1.1 2013/02/24 16:01:57 bzfkocht Exp $ set T := { 0 .. 1 }; set TR:= { "0900", "0915" } cross { "R1", "R2" }; var x[TR]; param bonus[T] := <0> 5 default 0; subto c1: sum in TR : bonus[t] * x[t,r] <= 5; zimpl-3.3.6/check/errors/e118_3.zpl0000644001417200060250000000014613301553023016571 0ustar bzfschlooptimi# $Id: e118_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a := if 2 > "a" then 3 else "b" end; zimpl-3.3.6/check/errors/e131.err.ref0000644001417200060250000000023013301553023017072 0ustar bzfschlooptimi*** Error 131: Illegal element <6> for symbol *** File: e131.zpl Line 2 *** set A[{1..5}] := <1> {1}, <6> {2}; *** ^^^ zimpl-3.3.6/check/errors/e197_3.err.ref0000644001417200060250000000030113301553023017327 0ustar bzfschlooptimi*** Error 197: Empty index set for set *** File: e197_3.zpl Line 2 *** set K[ in { 1..2} with i > 3 ] := subsets({1..10}, 2); *** ^^^ zimpl-3.3.6/check/errors/e119_1.zpl0000644001417200060250000000013013301553023016561 0ustar bzfschlooptimi# $Id: e119_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={1..5}+{1..2}*{3..4}; zimpl-3.3.6/check/errors/e129.zpl0000644001417200060250000000015013301553023016344 0ustar bzfschlooptimi# $Id: e129.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1..5}*{1..5}; set B := proj(A, <3>); zimpl-3.3.6/check/errors/e118_1.err.ref0000644001417200060250000000023313301553023017322 0ustar bzfschlooptimi*** Error 118: Comparison of different types *** File: e118_1.zpl Line 2 *** param a := if 2 == "a" then 3 else "b" end; *** ^^^ zimpl-3.3.6/check/errors/e188_2.err.ref0000644001417200060250000000026013301553023017332 0ustar bzfschlooptimi*** Error 188: Index tuple <1> has wrong dimension 1, expected 2 *** File: e188_2.zpl Line 3 *** set C := { in A with in B }; *** ^^^ zimpl-3.3.6/check/errors/e109.err.ref0000644001417200060250000000022613301553023017104 0ustar bzfschlooptimi*** Error 109: LHS/RHS contradiction, constraint trivially violated *** File: e109.zpl Line 3 *** subto c1: 5 <= x <= 4; *** ^^^ zimpl-3.3.6/check/errors/e173.dat0000644001417200060250000000001113301553023016302 0ustar bzfschlooptimi1 2 3 4 5zimpl-3.3.6/check/errors/e135_1.err.ref0000644001417200060250000000024013301553023017317 0ustar bzfschlooptimi*** Error 135: Index set for parameter "p" is empty *** File: e135_1.zpl Line 3 *** param p[ in I with i > 3] := i; *** ^^^ zimpl-3.3.6/check/errors/e201_1.err.ref0000644001417200060250000000027513301553023017321 0ustar bzfschlooptimi*** Error 201: Invalid read template, only one field allowed *** File: e201_1.zpl Line 2 *** param p := read "e201.dat" as "2n 3n" use 1; *** ^^^ zimpl-3.3.6/check/errors/e163.zpl0000644001417200060250000000010613301553023016343 0ustar bzfschlooptimi# $Id: e163.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ pagam x = 5; zimpl-3.3.6/check/errors/e117.zpl0000644001417200060250000000012413301553023016342 0ustar bzfschlooptimi# $Id: e117.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := max(2, 3, "a"); zimpl-3.3.6/check/errors/e155.zpl0000644001417200060250000000015113301553023016344 0ustar bzfschlooptimi# $Id: e155.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x[{1..5}] := read "dummy.dat" as "<> 1n"; zimpl-3.3.6/check/errors/e126_1.zpl0000644001417200060250000000012413301553023016562 0ustar bzfschlooptimi# $Id: e126_1.zpl,v 1.7 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1 to 5 by 0}; zimpl-3.3.6/check/errors/e173_1.err.ref0000644001417200060250000000030313301553023017321 0ustar bzfschlooptimi*** Error 173: Illegal type in element <2> -> "hallo" for symbol *** File: e173_1.zpl Line 2 *** param a[{1..3}] := <1> 1, <2> "hallo", <3> 3; *** ^^^ zimpl-3.3.6/check/errors/e802.err.ref0000644001417200060250000000025613301553023017107 0ustar bzfschlooptimiError 802: Unmatched [ or [^ *** File: e802.zpl Line 2 *** set D := { read "read3.dat" as "<3n>" match " [0+}" }; *** ^^^ zimpl-3.3.6/check/errors/e150.zpl0000644001417200060250000000015213301553023016340 0ustar bzfschlooptimi# $Id: e150.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n>" skip -1 }; zimpl-3.3.6/check/errors/e172.zpl0000644001417200060250000000017713301553023016353 0ustar bzfschlooptimi# $Id: e172.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param p[{1..3}*{1..3}] := | 1, 2, 3 | |1| 0, 1 | |2| 3, 4, 5 |; zimpl-3.3.6/check/errors/e128.err.ref0000644001417200060250000000022613301553023017105 0ustar bzfschlooptimi*** Error 128: Index value 1.5 in proj too big or not an integer *** File: e128.zpl Line 3 *** set B := proj(A, <1.5>); *** ^^^ zimpl-3.3.6/check/errors/e111.zpl0000644001417200060250000000011513301553023016334 0ustar bzfschlooptimi# $Id: e111.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 3 mod 0; zimpl-3.3.6/check/errors/e131.zpl0000644001417200060250000000013413301553023016337 0ustar bzfschlooptimi# $Id: e131.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A[{1..5}] := <1> {1}, <6> {2}; zimpl-3.3.6/check/errors/e197_2.err.ref0000644001417200060250000000025713301553023017340 0ustar bzfschlooptimi*** Error 197: Empty index set for set *** File: e197_2.zpl Line 2 *** set K[ in {1..5} with i > 6] := { <1>, <2> }; *** ^^^ zimpl-3.3.6/check/errors/e212.zpl0000644001417200060250000000012413301553023016336 0ustar bzfschlooptimi# $Id: e212.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := max({"a","b"}); zimpl-3.3.6/check/errors/e142_2.err.ref0000644001417200060250000000027013301553023017321 0ustar bzfschlooptimi*** Error 142: Unknown index <"0900"> for symbol "bonus" *** File: e142_2.zpl Line 6 *** subto c1: sum in TR : bonus[t] * x[t,r] <= 5; *** ^^^ zimpl-3.3.6/check/errors/e198_1.zpl0000644001417200060250000000015013301553023016572 0ustar bzfschlooptimi# $Id: e198_1.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set A:={<1,2>,<2,3>}; set B:={ in A}; zimpl-3.3.6/check/errors/e116.err.ref0000644001417200060250000000024113301553023017077 0ustar bzfschlooptimi*** Error 116: Illegal value type in min: "a" only numbers are possible *** File: e116.zpl Line 2 *** param a := min(2, 3, "a"); *** ^^^ zimpl-3.3.6/check/errors/e192.err.ref0000644001417200060250000000025513301553023017110 0ustar bzfschlooptimi*** Error 192: Component number 3 is not a valid value between 1..2 *** File: e192.zpl Line 2 *** param x := ord({<1,1>,<3,5>},2,3); *** ^^^ zimpl-3.3.6/check/errors/e702_1.zpl0000644001417200060250000000011513301553023016562 0ustar bzfschlooptimi# $Id: e702_1.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := ln(0); zimpl-3.3.6/check/errors/e185.zpl0000644001417200060250000000015713301553023016355 0ustar bzfschlooptimi# $Id: e185.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a integer; subto c1: vif(a > 2) then a <= 6 end; zimpl-3.3.6/check/errors/e190.zpl0000644001417200060250000000012713301553023016346 0ustar bzfschlooptimi# $Id: e190.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := ord({1..5},1,0.7); zimpl-3.3.6/check/errors/e155.err.ref0000644001417200060250000000027413301553023017110 0ustar bzfschlooptimi*** Error 155: Invalid read template, not enough fields *** File: e155.zpl Line 2 *** param x[{1..5}] := read "dummy.dat" as "<> 1n"; *** ^^^ zimpl-3.3.6/check/errors/e153.zpl0000644001417200060250000000014613301553023016346 0ustar bzfschlooptimi# $Id: e153.zpl,v 1.6 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<70000n>" }; zimpl-3.3.6/check/errors/e110_2.zpl0000644001417200060250000000011713301553023016556 0ustar bzfschlooptimi# $Id: e110_2.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 3 div 0; zimpl-3.3.6/check/errors/e133_10.zpl0000644001417200060250000000013513301553023016642 0ustar bzfschlooptimi# $Id: e133_10.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { in {1..10} : j }; zimpl-3.3.6/check/errors/e133.dat0000644001417200060250000000000113301553023016275 0ustar bzfschlooptimi#zimpl-3.3.6/check/errors/e105_2.zpl0000644001417200060250000000014413301553023016562 0ustar bzfschlooptimi# $Id: e105_2.zpl,v 1.1 2011/07/31 15:10:45 bzfkocht Exp $ var x; subto c1: x >= 5; minimize c1: x; zimpl-3.3.6/check/errors/e144.zpl0000644001417200060250000000012313301553023016341 0ustar bzfschlooptimi# $Id: e144.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set S[]:=subsets({}, 2); zimpl-3.3.6/check/errors/e201_2.zpl0000644001417200060250000000014313301553023016556 0ustar bzfschlooptimi# $Id: e201_2.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param p := read "e201.dat" as "" use 1; zimpl-3.3.6/check/errors/e141.zpl0000644001417200060250000000011213301553023016334 0ustar bzfschlooptimi# $Id: e141.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var x >= 4 <= 2; zimpl-3.3.6/check/errors/e161.err.ref0000644001417200060250000000005313301553023017100 0ustar bzfschlooptimi*** Error 161: Line 2: Unterminated string zimpl-3.3.6/check/errors/e106.err.ref0000644001417200060250000000020013301553023017071 0ustar bzfschlooptimi*** Error 106: Empty LHS, constraint trivially violated *** File: e106.zpl Line 2 *** subto c1: 5 <= 4; *** ^^^ zimpl-3.3.6/check/errors/e133_10.err.ref0000644001417200060250000000021213301553023017374 0ustar bzfschlooptimi*** Error 133: Unknown symbol "j" *** File: e133_10.zpl Line 2 *** set A := { in {1..10} : j }; *** ^^^ zimpl-3.3.6/check/errors/e222_2.err.ref0000644001417200060250000000031313301553023017316 0ustar bzfschlooptimi*** Error 222: Term inside a then or else constraint not linear *** File: e222_2.zpl Line 5 *** subto c1: vif x == 1 then y >= 1 else y * y == 0 end; *** ^^^ zimpl-3.3.6/check/errors/e174_2.err.ref0000644001417200060250000000033113301553023017324 0ustar bzfschlooptimi*** Error 174: Numeric field 2 read as "das". This is not a number. *** File: e174.dat line 1 *** File: e174_2.zpl Line 2 *** param p := read "e174.dat" as "2n" ; *** ^^^ zimpl-3.3.6/check/errors/e152_1.err.ref0000644001417200060250000000024313301553023017321 0ustar bzfschlooptimi*** Error 152: Invalid read template syntax *** File: e152_1.zpl Line 2 *** set A := { read "dummy.dat" as "" }; *** ^^^ zimpl-3.3.6/check/errors/e800.zpl0000644001417200060250000000010613301553023016341 0ustar bzfschlooptimi# $Id: e800.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x = 5; zimpl-3.3.6/check/errors/e128.zpl0000644001417200060250000000015213301553023016345 0ustar bzfschlooptimi# $Id: e128.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1..5}*{1..5}; set B := proj(A, <1.5>); zimpl-3.3.6/check/errors/e133_5.err.ref0000644001417200060250000000020013301553023017315 0ustar bzfschlooptimi*** Error 133: Unknown symbol "x" *** File: e133_5.zpl Line 2 *** param q := if x <= y then 1 else 2 end; *** ^^^ zimpl-3.3.6/check/errors/e156.zpl0000644001417200060250000000013513301553023016347 0ustar bzfschlooptimi# $Id: e156.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={read "e156.dat" as "<2n>"}; zimpl-3.3.6/check/errors/e199.err.ref0000644001417200060250000000032513301553023017115 0ustar bzfschlooptimi*** Error 199: Constants are not allowed in SOS declarations *** File: e199.zpl Line 4 *** sos c2: type1 priority 100 : sum in I : i * x[i] + 3; *** ^^^ zimpl-3.3.6/check/errors/e177.err.ref0000644001417200060250000000021713301553023017111 0ustar bzfschlooptimi*** Error 177: Boolean constraint not all integer *** File: e177.zpl Line 5 *** subto c1: vif a <= 5 then a >= 2 end; *** ^^^ zimpl-3.3.6/check/errors/e197_3.zpl0000644001417200060250000000016513301553023016601 0ustar bzfschlooptimi# $Id: e197_3.zpl,v 1.6 2010/06/10 19:42:42 bzfkocht Exp $ set K[ in { 1..2} with i > 3 ] := subsets({1..10}, 2); zimpl-3.3.6/check/errors/e170.err.ref0000644001417200060250000000024513301553023017103 0ustar bzfschlooptimi*** Error 170: Uninitialised local parameter "k" in call of define "test". *** File: e170.zpl Line 3 *** param x := test(k); *** ^^^ zimpl-3.3.6/check/errors/e133_9.err.ref0000644001417200060250000000015713301553023017334 0ustar bzfschlooptimi*** Error 133: Unknown symbol "b" *** File: e133_9.zpl Line 2 *** set I := {1,b,3}; *** ^^^ zimpl-3.3.6/check/errors/e133_8.err.ref0000644001417200060250000000021613301553023017327 0ustar bzfschlooptimi*** Error 133: Unknown symbol "k" *** File: e133_8.zpl Line 4 *** subto c1: forall in {k} do w[i] <= 1; *** ^^^ zimpl-3.3.6/check/errors/e133_6.zpl0000644001417200060250000000014213301553023016565 0ustar bzfschlooptimi# $Id: e133_6.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param q := if x < y then 1 else 2 end; zimpl-3.3.6/check/errors/e113.zpl0000644001417200060250000000011213301553023016333 0ustar bzfschlooptimi# $Id: e113.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := 3.5!; zimpl-3.3.6/check/errors/e219.zpl0000644001417200060250000000013413301553023016346 0ustar bzfschlooptimi# $Id: e219.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := substr("hallo", 2, -1); zimpl-3.3.6/check/errors/e700_3.err.ref0000644001417200060250000000022513301553023017322 0ustar bzfschlooptimi*** Error 700: log(0.000000): Numerical result out of range *** File: e700_3.zpl Line 2 *** param x := log(1/10^400); *** ^^^ zimpl-3.3.6/check/errors/e135_2.err.ref0000644001417200060250000000025313301553023017324 0ustar bzfschlooptimi*** Error 135: Empty index set for parameter *** File: e135_2.zpl Line 2 *** param y[ in {1..2} with i > 3] := <1> 6; *** ^^^ zimpl-3.3.6/check/errors/e800.err.ref0000644001417200060250000000020213301553023017074 0ustar bzfschlooptimi*** Error 800: File e800.zpl Line 2 : syntax error, unexpected $undefined, expecting ASGN or '[' *** param x = 5; *** ^^^ zimpl-3.3.6/check/errors/e121.zpl0000644001417200060250000000003413301553023016335 0ustar bzfschlooptimivar x; subto c1: x^-2 == 5; zimpl-3.3.6/check/errors/e126_2.err.ref0000644001417200060250000000017713301553023017331 0ustar bzfschlooptimi*** Error 126: Zero "step" value in range *** File: e126_2.zpl Line 2 *** set A := {1 .. 5 by 0}; *** ^^^ zimpl-3.3.6/check/errors/e127.zpl0000644001417200060250000000015213301553023016344 0ustar bzfschlooptimi# $Id: e127.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1..5}*{1..5}; set B := proj(A, <"a">); zimpl-3.3.6/check/errors/e135_2.zpl0000644001417200060250000000014713301553023016570 0ustar bzfschlooptimi# $Id: e135_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param y[ in {1..2} with i > 3] := <1> 6; zimpl-3.3.6/check/errors/e133_6.err.ref0000644001417200060250000000017713301553023017333 0ustar bzfschlooptimi*** Error 133: Unknown symbol "x" *** File: e133_6.zpl Line 2 *** param q := if x < y then 1 else 2 end; *** ^^^ zimpl-3.3.6/check/errors/e132.dat0000644001417200060250000000000713301553023016302 0ustar bzfschlooptimi1 2 2 3zimpl-3.3.6/check/errors/e217.zpl0000644001417200060250000000013413301553023016344 0ustar bzfschlooptimi# $Id: e217.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param n := substr("hallo", 2.5,4); zimpl-3.3.6/check/errors/e160.err.ref0000644001417200060250000000010313301553023017073 0ustar bzfschlooptimi*** Error 160: Comparison of elements with different types "A" / 2 zimpl-3.3.6/check/errors/e107.err.ref0000644001417200060250000000021313301553023017076 0ustar bzfschlooptimi*** Error 107: Range must be l <= x <= u, or u >= x >= l *** File: e107.zpl Line 3 *** subto c1: 5 <= x >= 4; *** ^^^ zimpl-3.3.6/check/errors/e199.zpl0000644001417200060250000000023113301553023016353 0ustar bzfschlooptimi# $Id: e199.zpl,v 1.6 2010/06/10 19:42:42 bzfkocht Exp $ set I := {1 .. 5}; var x[I] binary; sos c2: type1 priority 100 : sum in I : i * x[i] + 3; zimpl-3.3.6/check/errors/e191.err.ref0000644001417200060250000000023113301553023017101 0ustar bzfschlooptimi*** Error 191: Tuple number 3 is not a valid value between 1..2 *** File: e191.zpl Line 2 *** param x := ord({1,3},3,1); *** ^^^ zimpl-3.3.6/check/errors/e135_3.err.ref0000644001417200060250000000025313301553023017325 0ustar bzfschlooptimi*** Error 135: Empty index set for parameter *** File: e135_3.zpl Line 2 *** param y[ in {1..5} with i > 5] := <1> 6; *** ^^^ zimpl-3.3.6/check/errors/e181.err.ref0000644001417200060250000000025513301553023017106 0ustar bzfschlooptimi*** Error 181: Empty LHS, not allowed in conditional constraint *** File: e181.zpl Line 4 *** subto c1: vif a <= 5 then 0*a <= 2 end; *** ^^^ zimpl-3.3.6/check/errors/e208.zpl0000644001417200060250000000014613301553023016347 0ustar bzfschlooptimi# $Id: e208.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set A := argmin(-17) in { 1 .. 20 } : i; zimpl-3.3.6/check/errors/e143.err.ref0000644001417200060250000000024213301553023017100 0ustar bzfschlooptimi*** Error 143: Size for subsets 1.5 is too big or not an integer *** File: e143.zpl Line 2 *** set S[]:=subsets({1..5}, 1.5); *** ^^^ zimpl-3.3.6/check/errors/e149.zpl0000644001417200060250000000015313301553023016351 0ustar bzfschlooptimi# $Id: e149.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n>" skip 0.5 }; zimpl-3.3.6/check/errors/e108.zpl0000644001417200060250000000012113301553023016337 0ustar bzfschlooptimi# $Id: e108.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ subto c1: 5 <= 17 <= 4; zimpl-3.3.6/check/errors/e184.zpl0000644001417200060250000000014113301553023016345 0ustar bzfschlooptimi# $Id: e184.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a integer; subto c1: vabs(a) <= 2; zimpl-3.3.6/check/errors/e198_2.zpl0000644001417200060250000000011713301553023016576 0ustar bzfschlooptimiset A := { 1, 2, 3 }; set B := { 1 .. 3 }; set C := { in A with in B };zimpl-3.3.6/check/errors/e133_7.err.ref0000644001417200060250000000022213301553023017323 0ustar bzfschlooptimi*** Error 133: Unknown symbol "k" *** File: e133_7.zpl Line 4 *** subto c1: forall in I do w[k] <= 1; *** ^^^ zimpl-3.3.6/check/errors/e204.zpl0000644001417200060250000000012013301553023016333 0ustar bzfschlooptimi# $Id: e204.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param r := random(5,3);zimpl-3.3.6/check/errors/e192.zpl0000644001417200060250000000013413301553023016346 0ustar bzfschlooptimi# $Id: e192.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := ord({<1,1>,<3,5>},2,3); zimpl-3.3.6/check/errors/e120_4.zpl0000644001417200060250000000013013301553023016554 0ustar bzfschlooptimi# $Id: e120_4.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={1..5} symdiff {"a"}; zimpl-3.3.6/check/errors/e152_2.zpl0000644001417200060250000000014113301553023016561 0ustar bzfschlooptimi# $Id: e152_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "n" }; zimpl-3.3.6/check/errors/e171.err.ref0000644001417200060250000000026313301553023017104 0ustar bzfschlooptimi*** Error 171: Wrong number of arguments (2 instead of 1) for call of define "test". *** File: e171.zpl Line 3 *** param x := test(1,2); *** ^^^ zimpl-3.3.6/check/errors/e150.err.ref0000644001417200060250000000025613301553023017103 0ustar bzfschlooptimi*** Error 150: skip value -1 is negative *** File: e150.zpl Line 2 *** set A := { read "dummy.dat" as "<1n>" skip -1 }; *** ^^^ zimpl-3.3.6/check/errors/e119_2.zpl0000644001417200060250000000013013301553023016562 0ustar bzfschlooptimi# $Id: e119_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={1..5}-{1..2}*{3..4}; zimpl-3.3.6/check/errors/e802.zpl0000644001417200060250000000016113301553023016344 0ustar bzfschlooptimi# $Id: e802.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set D := { read "read3.dat" as "<3n>" match " [0+}" }; zimpl-3.3.6/check/errors/e143.zpl0000644001417200060250000000013113301553023016337 0ustar bzfschlooptimi# $Id: e143.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set S[]:=subsets({1..5}, 1.5); zimpl-3.3.6/check/errors/e147.zpl0000644001417200060250000000015213301553023016346 0ustar bzfschlooptimi# $Id: e147.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n>" use 1.5 }; zimpl-3.3.6/check/errors/e700_2.zpl0000644001417200060250000000011713301553023016563 0ustar bzfschlooptimi# $Id: e700_2.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := log(-1); zimpl-3.3.6/check/errors/e119_2.err.ref0000644001417200060250000000022613301553023017326 0ustar bzfschlooptimi*** Error 119: Minus of sets with different dimension *** File: e119_2.zpl Line 2 *** set A:={1..5}-{1..2}*{3..4}; *** ^^^ zimpl-3.3.6/check/errors/e173_2.zpl0000644001417200060250000000016713301553023016574 0ustar bzfschlooptimi# $Id: e173_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a[ in {1..5}] := if i == 3 then "hallo" else 2 end;zimpl-3.3.6/check/errors/e189.zpl0000644001417200060250000000014113301553023016352 0ustar bzfschlooptimi# $Id: e189.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := ord({1..5},1000000000000,1); zimpl-3.3.6/check/errors/e125.err.ref0000644001417200060250000000022413301553023017100 0ustar bzfschlooptimi*** Error 125: "step" value 0.5 is too big or not an integer *** File: e125.zpl Line 2 *** set A := {1 to 5 by 0.5}; *** ^^^ zimpl-3.3.6/check/errors/e189.err.ref0000644001417200060250000000027213301553023017115 0ustar bzfschlooptimi*** Error 189: Tuple number 1000000000000 is too big or not an integer *** File: e189.zpl Line 2 *** param x := ord({1..5},1000000000000,1); *** ^^^ zimpl-3.3.6/check/errors/e116.zpl0000644001417200060250000000012413301553023016341 0ustar bzfschlooptimi# $Id: e116.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := min(2, 3, "a"); zimpl-3.3.6/check/errors/e109.zpl0000644001417200060250000000012713301553023016346 0ustar bzfschlooptimi# $Id: e109.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ var x; subto c1: 5 <= x <= 4; zimpl-3.3.6/check/errors/e134.zpl0000644001417200060250000000013613301553023016344 0ustar bzfschlooptimi# $Id: e134.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I:={1..2}; param p[I] := <3> 4; zimpl-3.3.6/check/errors/e174_2.zpl0000644001417200060250000000014113301553023016565 0ustar bzfschlooptimi# $Id: e174_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param p := read "e174.dat" as "2n" ; zimpl-3.3.6/check/errors/e210.err.ref0000644001417200060250000000023013301553023017070 0ustar bzfschlooptimi*** Error 210: MAX of set with more than one dimension *** File: e210.zpl Line 2 *** param n := max({1..3}*{1..3}); *** ^^^ zimpl-3.3.6/check/errors/e174_3.zpl0000644001417200060250000000015113301553023016567 0ustar bzfschlooptimi# $Id: e174_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param p[{1..3}] := read "e174.dat" as "n+" ; zimpl-3.3.6/check/errors/e209.err.ref0000644001417200060250000000023013301553023017100 0ustar bzfschlooptimi*** Error 209: MIN of set with more than one dimension *** File: e209.zpl Line 2 *** param n := min({1..3}*{1..3}); *** ^^^ zimpl-3.3.6/check/errors/e702_3.zpl0000644001417200060250000000012413301553023016564 0ustar bzfschlooptimi# $Id: e702_3.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := ln(1/10^400); zimpl-3.3.6/check/errors/e111.err.ref0000644001417200060250000000015213301553023017073 0ustar bzfschlooptimi*** Error 111: Modulo by zero *** File: e111.zpl Line 2 *** param a := 3 mod 0; *** ^^^ zimpl-3.3.6/check/errors/e106.zpl0000644001417200060250000000011413301553023016337 0ustar bzfschlooptimi# $Id: e106.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ subto c1: 5 <= 4; zimpl-3.3.6/check/errors/e142_1.zpl0000644001417200060250000000015413301553023016563 0ustar bzfschlooptimi# $Id: e142_1.zpl,v 1.1 2013/02/24 16:01:57 bzfkocht Exp $ set I := {1 to 5}; var x[I]; subto c1: x[6] <= 5;zimpl-3.3.6/check/errors/e120_3.zpl0000644001417200060250000000014013301553023016554 0ustar bzfschlooptimi# $Id: e120_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={"a", "b", "c"} inter {1..3}; zimpl-3.3.6/check/errors/e171.zpl0000644001417200060250000000015113301553023016342 0ustar bzfschlooptimi# $Id: e171.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ defnumb test(i) := i + 1; param x := test(1,2); zimpl-3.3.6/check/errors/e191.zpl0000644001417200060250000000012413301553023016344 0ustar bzfschlooptimi# $Id: e191.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := ord({1,3},3,1); zimpl-3.3.6/check/errors/e151_3.zpl0000644001417200060250000000014513301553023016565 0ustar bzfschlooptimi# $Id: e151_3.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n>>" }; zimpl-3.3.6/check/errors/e105.zpl0000644001417200060250000000014413301553023016341 0ustar bzfschlooptimi# $Id: e105.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ var x; subto c1: x >= 5; subto c1: x <= 6; zimpl-3.3.6/check/errors/e193.zpl0000644001417200060250000000013113301553023016344 0ustar bzfschlooptimi# $Id: e193.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := { <1,2>, <1>, <2,3> }; zimpl-3.3.6/check/errors/e181.zpl0000644001417200060250000000016513301553023016350 0ustar bzfschlooptimi# $Id: e181.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a integer <= 6; subto c1: vif a <= 5 then 0*a <= 2 end;zimpl-3.3.6/check/errors/e188_1.err.ref0000644001417200060250000000024413301553023017333 0ustar bzfschlooptimi*** Error 188: Index tuple has wrong dimension 2, expected 1 *** File: e188_1.zpl Line 2 *** set I := { in {1..5} }; *** ^^^ zimpl-3.3.6/check/errors/e174.dat0000644001417200060250000000005113301553023016307 0ustar bzfschlooptimi"hallo" "das" "wie" "ist" "gehts" "nett" zimpl-3.3.6/check/errors/e124.err.ref0000644001417200060250000000021213301553023017074 0ustar bzfschlooptimi*** Error 124: "upto" value 5.5 is too big or not an integer *** File: e124.zpl Line 2 *** set A := {1 to 5.5}; *** ^^^ zimpl-3.3.6/check/errors/e123.err.ref0000644001417200060250000000021213301553023017073 0ustar bzfschlooptimi*** Error 123: "from" value 1.5 is too big or not an integer *** File: e123.zpl Line 2 *** set A := {1.5 to 5}; *** ^^^ zimpl-3.3.6/check/errors/e133_9.zpl0000644001417200060250000000012013301553023016564 0ustar bzfschlooptimi# $Id: e133_9.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := {1,b,3}; zimpl-3.3.6/check/errors/e148.zpl0000644001417200060250000000015113301553023016346 0ustar bzfschlooptimi# $Id: e148.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1n>" use -3 }; zimpl-3.3.6/check/errors/e146.zpl0000644001417200060250000000012113301553023016341 0ustar bzfschlooptimi# $Id: e146.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set S[]:=powerset({}); zimpl-3.3.6/check/errors/e125.zpl0000644001417200060250000000012313301553023016340 0ustar bzfschlooptimi# $Id: e125.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := {1 to 5 by 0.5}; zimpl-3.3.6/check/errors/e119_1.err.ref0000644001417200060250000000022613301553023017325 0ustar bzfschlooptimi*** Error 119: Union of sets with different dimension *** File: e119_1.zpl Line 2 *** set A:={1..5}+{1..2}*{3..4}; *** ^^^ zimpl-3.3.6/check/errors/e114.zpl0000644001417200060250000000011313301553023016335 0ustar bzfschlooptimi# $Id: e114.zpl,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ param a := (-3)!; zimpl-3.3.6/check/errors/e126_1.err.ref0000644001417200060250000000017713301553023017330 0ustar bzfschlooptimi*** Error 126: Zero "step" value in range *** File: e126_1.zpl Line 2 *** set A := {1 to 5 by 0}; *** ^^^ zimpl-3.3.6/check/errors/e133_4.zpl0000644001417200060250000000020413301553023016562 0ustar bzfschlooptimi# $Id: e133_4.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param p[{1..3}*{1..3}] := | 1, 2, 3 | |1| 0, 1, x | |2| 3, 4, 5 |; zimpl-3.3.6/check/errors/e134.err.ref0000644001417200060250000000017413301553023017104 0ustar bzfschlooptimi*** Error 134: Illegal element <3> for symbol *** File: e134.zpl Line 3 *** param p[I] := <3> 4; *** ^^^ zimpl-3.3.6/check/errors/e121.err.ref0000644001417200060250000000016313301553023017076 0ustar bzfschlooptimi*** Error 121: Negative exponent on variable *** File: e121.zpl Line 2 *** subto c1: x^-2 == 5; *** ^^^ zimpl-3.3.6/check/errors/e133_4.err.ref0000644001417200060250000000030213301553023017317 0ustar bzfschlooptimi*** Error 133: Unknown symbol "x" *** File: e133_4.zpl Line 5 *** .3}*{1..3}] := | 1, 2, 3 | |1| 0, 1, x | |2| 3, 4, 5 |; *** ^^^ zimpl-3.3.6/check/errors/e157.zpl0000644001417200060250000000014013301553023016344 0ustar bzfschlooptimi# $Id: e157.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A:={read "e157.dat" as "<1n> 2n"}; zimpl-3.3.6/check/errors/e221.err.ref0000644001417200060250000000020113301553023017070 0ustar bzfschlooptimi*** Error 221: The objective function has to be linear *** File: e221.zpl Line 3 *** maximize a: x * x; *** ^^^ zimpl-3.3.6/check/errors/e144.err.ref0000644001417200060250000000021013301553023017074 0ustar bzfschlooptimi*** Error 144: Tried to build subsets of empty set *** File: e144.zpl Line 2 *** set S[]:=subsets({}, 2); *** ^^^ zimpl-3.3.6/check/errors/e700_1.err.ref0000644001417200060250000000020713301553023017320 0ustar bzfschlooptimi*** Error 700: log(0.000000): Numerical result out of range *** File: e700_1.zpl Line 2 *** param x := log(0); *** ^^^ zimpl-3.3.6/check/errors/e197_2.zpl0000644001417200060250000000015413301553023016576 0ustar bzfschlooptimi# $Id: e197_2.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set K[ in {1..5} with i > 6] := { <1>, <2> }; zimpl-3.3.6/check/errors/e161.zpl0000644001417200060250000000011413301553023016340 0ustar bzfschlooptimi# $Id: e161.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param x := "hallo; zimpl-3.3.6/check/errors/e179.err.ref0000644001417200060250000000025113301553023017111 0ustar bzfschlooptimi*** Error 179: Conditional only possible on bounded constraints *** File: e179.zpl Line 5 *** subto c1: vif a <= 5 then b <= 2 end; *** ^^^ zimpl-3.3.6/check/errors/e117.err.ref0000644001417200060250000000024113301553023017100 0ustar bzfschlooptimi*** Error 117: Illegal value type in max: "a" only numbers are possible *** File: e117.zpl Line 2 *** param a := max(2, 3, "a"); *** ^^^ zimpl-3.3.6/check/errors/e105_2.err.ref0000644001417200060250000000016413301553023017322 0ustar bzfschlooptimi*** Error 105: Duplicate constraint name "c1" *** File: e105_2.zpl Line 4 *** minimize c1: x; *** ^^^ zimpl-3.3.6/check/errors/e222_1.zpl0000644001417200060250000000020213301553023016554 0ustar bzfschlooptimi# $Id: e222_1.zpl,v 1.1 2014/01/12 09:47:38 bzfkocht Exp $ var x binary; var y binary; subto c1: vif x == 1 then y * y == 1 end; zimpl-3.3.6/check/errors/e133_8.zpl0000644001417200060250000000020413301553023016566 0ustar bzfschlooptimi# $Id: e133_8.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I := {1,2,3}; var w[I]; subto c1: forall in {k} do w[i] <= 1; zimpl-3.3.6/check/errors/e114.err.ref0000644001417200060250000000015713301553023017103 0ustar bzfschlooptimi*** Error 114: Negative factorial value *** File: e114.zpl Line 2 *** param a := (-3)!; *** ^^^ zimpl-3.3.6/check/errors/e118_2.zpl0000644001417200060250000000014713301553023016571 0ustar bzfschlooptimi# $Id: e118_2.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ param a := if 2 >= "a" then 3 else "b" end; zimpl-3.3.6/check/errors/e173_3.err.ref0000644001417200060250000000033113301553023017324 0ustar bzfschlooptimi*** Error 173: Illegal type in element <6> -> "hallo" for symbol *** File: e173_3.zpl Line 2 *** param a[{1..9}] := read "e173.dat" as "n+", <9> "hallo"; *** ^^^ zimpl-3.3.6/check/errors/e214.dat0000644001417200060250000000000413301553023016300 0ustar bzfschlooptimi1 2 zimpl-3.3.6/check/errors/e214.err.ref0000644001417200060250000000025113301553023017077 0ustar bzfschlooptimi*** Error 214: Wrong type of set elements -- wrong read template? *** File: e214.zpl Line 2 *** set A:={read "e214.dat" as "n+"}; *** ^^^ zimpl-3.3.6/check/errors/e179.zpl0000644001417200060250000000021613301553023016354 0ustar bzfschlooptimi# $Id: e179.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ var a integer <= 6; var b integer <= infinity; subto c1: vif a <= 5 then b <= 2 end;zimpl-3.3.6/check/errors/e154.zpl0000644001417200060250000000014213301553023016343 0ustar bzfschlooptimi# $Id: e154.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set A := { read "dummy.dat" as "<1q>" }; zimpl-3.3.6/check/errors/e151_2.err.ref0000644001417200060250000000023613301553023017323 0ustar bzfschlooptimi*** Error 151: Not a valid read template *** File: e151_2.zpl Line 2 *** set A := { read "dummy.dat" as "<1n" }; *** ^^^ zimpl-3.3.6/check/errors/e115.err.ref0000644001417200060250000000013713301553023017102 0ustar bzfschlooptimi*** Error 115: Timeout! *** File: e115.zpl Line 2 *** param a := 1001!; *** ^^^ zimpl-3.3.6/check/errors/e133_1.zpl0000644001417200060250000000013413301553023016561 0ustar bzfschlooptimi# $Id: e133_1.zpl,v 1.5 2010/06/10 19:42:41 bzfkocht Exp $ set I:={1..2}; param p[I] := i; zimpl-3.3.6/check/errors/e160.zpl0000644001417200060250000000012513301553023016341 0ustar bzfschlooptimi# $Id: e160.zpl,v 1.7 2010/06/10 19:42:41 bzfkocht Exp $ set A := { <1,2>, <1,"A"> };zimpl-3.3.6/check/errors/e702_2.err.ref0000644001417200060250000000021213301553023017317 0ustar bzfschlooptimi*** Error 702: ln(-1.000000): Numerical argument out of domain *** File: e702_2.zpl Line 2 *** param x := ln(-1); *** ^^^ zimpl-3.3.6/check/errors/e208.err.ref0000644001417200060250000000024713301553023017107 0ustar bzfschlooptimi*** Error 208: "size" value -17 not >= 1 *** File: e208.zpl Line 2 *** set A := argmin(-17) in { 1 .. 20 } : i; *** ^^^ zimpl-3.3.6/check/errors/e201_2.err.ref0000644001417200060250000000026313301553023017317 0ustar bzfschlooptimi*** Error 201: Invalid read template, only one field allowed *** File: e201_2.zpl Line 2 *** param p := read "e201.dat" as "" use 1; *** ^^^ zimpl-3.3.6/check/errors/e151_4.err.ref0000644001417200060250000000024213301553023017322 0ustar bzfschlooptimi*** Error 151: Not a valid read template *** File: e151_4.zpl Line 2 *** set A := { read "dummy.dat" as "<<1n>" }; *** ^^^ zimpl-3.3.6/check/errors/e149.err.ref0000644001417200060250000000030213301553023017103 0ustar bzfschlooptimi*** Error 149: skip value 0.5 is too big or not an integer *** File: e149.zpl Line 2 *** set A := { read "dummy.dat" as "<1n>" skip 0.5 }; *** ^^^ zimpl-3.3.6/check/presol.mst.ref0000644001417200060250000000103613301553023016431 0ustar bzfschlooptimi* This file was automatically generated by Zimpl NAME presol.z x#1 1.0000000000e+00 x#2 0.0000000000e+00 x#3 1.0000000000e+00 x#4 0.0000000000e+00 x#5 1.0000000000e+00 y#1 5.0000000000e+00 y#2 5.0000000000e+00 y#3 5.0000000000e+00 y#4 5.0000000000e+00 y#5 5.0000000000e+00 w#1 0.0000000000e+00 w#2 0.0000000000e+00 w#3 0.0000000000e+00 w#4 0.0000000000e+00 w#5 0.0000000000e+00 ENDATA zimpl-3.3.6/check/expr.lp.ref0000644001417200060250000000632213301553023015716 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1 .. 10 }; \ set S := { "moin", "hello", "ho" }; \ param a[ in I] := i + 3; \ var x[I]; \ subto c01: (3 * a[1] + 5) * x[1] >= a[2] * 2 - 4; \ subto c02: a[1] mod 2 >= x[1] / 7; \ subto c03: a[1] div 2 >= x[1] - 3; \ subto c04: card(I) * x[1] >= abs(a[1] - a[2]); \ subto c05: a[1]^a[2] <= x[1] * 3!; \ subto c06: floor(a[1] / 3) <= x[2] * ceil(a[2] / 7); \ subto c07: -exp(ln(a[4])) >= -x[3]; \ subto c08: x[3] + log(10) == -6; \ subto c09: (min in I : a[i]) * x[1] >= x[2] * max in I : a[i]; \ subto c10: x[1] * if sum in I : a[i] > 20 then 2 else -4 end >= 5; \ subto c11: a[1]^-a[2] >= x[2] / 100; \ subto c12: x[3] >= min(6, 2/7, a[1], a[3]); \ subto c13: x[3] <= max(6, 2/7, a[1], a[3]); \ subto c14: sum in {1..10} do i mod 8 * x[i] >= 5; \ subto c15: sum in I do sgn(5 - i) * x[i] >= 3; \ subto c16: sum in I do random(10,20) * x[i] >= random(50,1000); \ subto c17: x[min(I)] <= x[max(I)]; \ subto c18: (prod in I with i < 4 : a[i]) * x[1] <= 800; \ subto c19: sum in S with substr(s, 1, 1) == "o" : x[length(s)] >= 2; \ subto c20: sum in S with substr(s, -1, 1) == "o" : x[length(s)] >= 2; \ subto c21: sum in S with substr(s, 2, 2) == "ll" : x[length(s)] <= 2; \ subto c22: sum in S with substr(s, -6, 5) != "" : x[length(s)] <= 2; \ subto c23: sum in { 4, 9, 16 }: x[sqrt(i)] >= 5; \ do check 2 + 3 * 4 == 2 + (3 * 4); \ do check -2^2 == -4; \ do check +10^-2 == 1/100; \ do check -3! == -1 * 2 * 3; \ do check 3 * 2! == 3 * 2; \ do check 2^3^4 == 2^(3^4); \ do check 3!^-2^4*5 == ((2 * 3)^(-2 * 2 * 2 * 2)) * 5; \ do check 4 + 1 / 3 * sum in I : 3 * i == sum in I : i + 4; \ do check 3 * min(I) == min in I : i * 3; \ do check ord(S,1,1) + ord(S,2,1) + ord(S,3,1) == "moinhelloho"; \ do check round(3.5) == 4; \ do check round(3.499999999999) == 3; \ do check round(0.00000000001) == 0; \ do check round(0.5) == 1; \ do check round(-3.5) == -4; \ do check round(-3.499999999999) == -3; \ do check round(-0.00000000001) == 0; \ do check round(-0.5) == -1; \Problem name: expr.zpl Minimize Objective: Subject to c01_1: +17 x#1 >= 6 c02_1: -0.142857142857143 x#1 >= 0 c03_1: - x#1 >= -5 c04_1: +10 x#1 >= 1 c05_1: -6 x#1 <= -1024 c06_1: - x#2 <= -1 c07_1: + x#3 >= 7 c08_1: + x#3 = -7 c09_1: -13 x#2 +4 x#1 >= 0 c10_1: +2 x#1 >= 5 c11_1: -0.01 x#2 >= -0.0009765625 c12_1: + x#3 >= 0.285714285714286 c13_1: + x#3 <= 6 c14_1: +2 x#10 + x#9 +7 x#7 +6 x#6 +5 x#5 +4 x#4 +3 x#3 +2 x#2 + x#1 >= 5 c15_1: - x#10 - x#9 - x#8 - x#7 - x#6 + x#4 + x#3 + x#2 + x#1 >= 3 c16_1: +17.9001148738666 x#10 +11.5917902233991 x#9 +18.3648624686442 x#8 +12.5420364510599 x#7 +15.8814903897889 x#6 +18.6992346422512 x#5 +14.2337213163808 x#4 +17.3649246844847 x#3 +17.3913663526511 x#2 +11.3414655791925 x#1 >= 393.855458973873 c17_1: - x#10 + x#1 <= 0 c18_1: +120 x#1 <= 800 c19_1: + x#2 + x#4 >= 2 c20_1: + x#2 + x#5 >= 2 c21_1: + x#5 <= 2 c22_1: + x#2 + x#5 + x#4 <= 2 c23_1: + x#4 + x#3 + x#2 >= 5 Bounds 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf 0 <= x#6 <= +inf 0 <= x#7 <= +inf 0 <= x#8 <= +inf 0 <= x#9 <= +inf 0 <= x#10 <= +inf End zimpl-3.3.6/check/read2.dat0000644001417200060250000003757713301553023015337 0ustar bzfschlooptimi# $Id: read2.dat,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ DbemYrJkekDyrxmZZuXvCztT 1464700470,0.932470, 223139274;-789471623; -1699807895:1927028692: 1470542478 1114139353 1.09911:0.575962 831492440 "dzJWJ, LOg"[ ok? sYZznzGKrLLKnTNYrmagNZbz 901121857,1.101813, 1475188595;-1363237345; -1850415153:1453564973: 2117131852 1125080688 1.10712:4.61114 164029565 "nZOiDxL, iRGH"[ ok? rXexNAqcrOVCjxQLAdGwLsQo 1765031311,1.200740, 1902574381;-872125302; -1246737513:1225510207: 1512681883 1223406074 2.44857:2.58975 648702147 "hzRCg, NaMAaXz"[ ok? dPguIQKkAcKBCZiMjgjIBffE 133915503,4.320406, 806328518;-761444896; -1665687192:1626987333: 1624813130 638903608 2.00343:0.879227 928395650 "wfXz, SRT"[ ok? EWVUubMnOXlkMQocUjpncQSR 1369185072,0.505984, 1822060284;-504391; -581496129:1392590074: 1664984401 1836074602 4.92255:3.46839 227474611 "MNqf, GiBWru"[ ok? ywxkabVFgXytJunlibrkmfkA 1655484423,2.631265, 443868839;-1179148974; -254002319:663953196: 1753324112 1299014983 4.93599:1.20125 1983671210 "yvdxL, neohXhtyLTJ"[ ok? tflMvljPVVGOoHakwmqaOFhU 1653928963,1.295018, 2055711690;-1487548724; -91766661:2052174183: 1761097638 885236730 0.531865:0.393992 398653970 "mjkyanj, jgLDGjnR"[ ok? pjKpOUDcwJJchEPGeAuWnYgJ 1911788911,1.431708, 9948641;-643640925; -1559138993:348659080: 1466516772 1602730468 0.382657:0.853188 1208230654 "nltGnsES, XWreGoYCqoP"[ ok? hovMesUTBUUDExIVPiyOGqGe 380957511,0.960825, 1633806477;-1969982497; -299275980:1068058867: 1561063672 705752692 4.38928:8.9267 1161530872 "SxguLNAT, ykUHXQpd"[ ok? WRrKwiDjDaFsBZWsXRdJdZoa 1266473526,0.031327, 1475174443;-1415975022; -845147328:39133252: 1519956612 148139633 0.231184:20.0524 549639594 "kCBB, JDBO"[ ok? WZWLyDHDQjunocTxfEUfsqAn 1632799790,11.126522, 1404141630;-391780070; -2136907151:367690630: 1091107258 951911541 1.26694:3.54103 1725435687 "QHXKbd, abK"[ ok? huJWNwdKltUSAPmBICoYqLeb 1602984272,0.207851, 294682362;-70489911; -759780751:263599648: 472012367 1087878519 0.220718:0.548641 1518919500 "LySYt, Px"[ ok? QOvKiHPHxIRVoqzwriNKBdTF 1311345792,1.091785, 593977430;-1445723168; -1596900771:2121484200: 136682982 91958014 1.83602:0.703409 1604798853 "kcDFipCt, FMu"[ ok? IvoEbtgXWanKIkPfmfdmrlDF 811294833,3.404565, 740791592;-2104348125; -1499576489:2106018146: 80844767 1284557986 0.805916:1.10002 1579305904 "wLCrh, ry"[ ok? WUOorqKiuRHkACsViNmuzWNm 118853963,4.245847, 1805978813;-1132900439; -680259595:670297586: 1585535090 1389378716 1.13094:0.697376 279799094 "lMJhTeoL, TxL"[ ok? VOCYonuFJvjpKKSPrRcsZOuH 936684310,0.143649, 448791405;-705635130; -433223688:249649305: 1845163249 766223022 0.779136:1.59996 602572665 "uThsjOYI, hAy"[ ok? emwiFLLFxisaIDbqbtvgcpSA 1972809426,0.063399, 1844020787;-380391958; -1470713481:273383630: 661681130 1009843740 3.11948:1.01015 1061561991 "RTDG, Ob"[ ok? zyOIqKCqwMDIkJZSVzKtmcHu 396216237,0.512336, 1220369461;-892826982; -1203335666:482954771: 322877007 176663093 0.30155:1.76238 1734247917 "IyZOP, feQQ"[ ok? aiTmDUexQtFSWvyLYGJyfTwj 978103472,0.124160, 270407198;-1520399681; -1411417145:145172434: 322700085 369390018 3.07584:0.488599 1669670332 "uAxa, vjHUUYLjbMN"[ ok? lSxzUZXgSKuxraglnMjXoqAW 1046114092,0.687991, 1124670473;-835016296; -416060548:1556017325: 1628307704 1067434526 3.06204:0.373255 1483214784 "gmFrpq, CV"[ ok? XGcHTHCtIHYDcFviimLBQcjG 1880781604,0.955819, 857991776;-1734522374; -704784105:1605085415: 1703610057 1913397880 2.06511:0.600632 1195315210 "FGoD, JDTK"[ ok? jVzMCrjuqCeLsWJnYYmevbDE 1383773713,5.890636, 2124720517;-466543558; -1882781997:195126806: 529226722 1016154897 0.654266:0.738207 1929065761 "xDRgbSZb, IGP"[ ok? TZyQxiFaUrmafjlsXgpiBlUS 1029566334,0.654670, 1412670428;-651681811; -181755150:234010098: 1419044410 711952552 27.1047:0.450336 1953121880 "raQz, eTk"[ ok? ZsBCsxwKGakPQKJXEUOGFJqc 1978166933,0.974218, 966628684;-1352210564; -1797868951:450537107: 1622188902 983360802 2.53792:2.3701 1940073259 "PwBLEaNj, NLsrjKEhkNNP"[ ok? WUqAsUBFTdaIgBntFOLNsuTH 201136930,0.197022, 1808683076;-1383470501; -175975910:538904248: 678265923 1552219041 1.43769:0.306908 290270601 "xENGjUbm, bE"[ ok? mPQXjmIlAQMmiQmPuKCrwWwm 1633406970,0.994700, 763681947;-609634607; -2034041932:524236988: 521910701 919310974 1.12202:1.40756 1060436749 "rKSodOdc, Dt"[ ok? RkIbnqxxjKxHLTTqwFGqbqlh 273225752,0.558988, 1703381229;-971463870; -950897815:436960847: 180066996 818734252 1.99732:0.158527 824434794 "xTWS, Mx"[ ok? KQpBgukUBiExrtcyCvrZgmSz 2028056426,112.539773, 1287441116;-1881416923; -195777662:781587224: 157731120 1804708587 1.28902:1.20377 371627206 "obgEcMZJ, JGkCXlgIstAZ"[ ok? EABnbMNikepXYmztjpYnNpHx 1371596097,1.012287, 425478943;-1167525262; -665135020:477480965: 1260037399 68786302 0.348106:2.8741 90426708 "FQxsJeOS, RO"[ ok? iFRYRKwucVISYlyjAvoMUVqD 228411816,1.325266, 189360269;-1961044125; -1008999633:1381949944: 1135053371 1518856826 1.96723:1.43165 676422178 "ZQPtvJuu, tb"[ ok? PvAHCTuJACOtkMEQpRwprLfs 377924886,1.456960, 317819979;-1471318457; -113959740:956206342: 155162990 412688038 1.74857:0.522932 2075507688 "aJTtiVmp, birWMkaw"[ ok? VpIVwSbTiaeuGVmspaRDYrJH 1006419141,0.395132, 1879322188;-920973424; -302302978:415066973: 408566930 1183986754 0.645606:3.27861 1674873432 "OVUkvMa, Djyf"[ ok? arMIedKQzOtAQZkCyNRyPvlm 1041804220,0.633177, 1070670912;-23890760; -356889090:1977138111: 2105535657 22997560 0.349921:1.13984 782709949 "SGLvKSoU, oOGMzunfa"[ ok? OjfZNucnZiKTPGgFGXwzBZoe 1838471503,0.638453, 518445871;-1244374093; -1961689717:199015452: 740713660 173836390 1.69446:2.35078 372717380 "ciLpUtgp, bPke"[ ok? kOchKWSvvgFYdyEhDOpfPHlX 1506515787,0.507876, 1603723590;-302663535; -409424767:1724642880: 1662046154 800816131 0.472412:0.696849 1525507053 "QOEWhMYC, MoXyFqLBsJD"[ ok? WFAhXwUcmqTaOyiSCpFYCgAX 1976229935,1.290004, 791026263;-1209547248; -231741934:864789264: 1124716362 1523577153 20.4497:0.606197 693405982 "YbbVEsVo, plUO"[ ok? ffHSKprUEVeEmoPjETwROjzo 935689798,0.048017, 454259918;-1455885813; -661283449:309330341: 1116081394 361590034 0.33601:0.421535 1443983806 "OkBuc, fw"[ ok? KzhHILXxcOxvLPHUMsHYIuwf 868896939,0.193697, 1647006686;-1083580079; -151677331:518405766: 686211420 701188857 1.06631:0.0595273 193354325 "jWaGxVTQ, qz"[ ok? sNQGllUmjNrjMkngYFWiMgde 1852659420,1.059744, 45962353;-1472014211; -569613826:1836137504: 1171791844 2046463950 3.34885:0.401521 900524249 "TeJgrPut, VOY"[ ok? wkWlzbGSZtvyzmcaXKtWcbam 310902315,2.633164, 1325870122;-581011200; -726712502:2109383531: 1454290918 192772694 0.0327808:0.34064 272666125 "DgBW, zLtfrPx"[ ok? tXRdNFsSDsVJiltcATUpUJbu 612676095,2.467057, 1491598374;-216298497; -395199539:1333981066: 2106914374 767546005 1.31912:0.570943 250365877 "TYPFw, JI"[ ok? GKngyxnCrfXvEQBGpouyrRhW 786136958,0.607213, 1065065480;-2119017790; -6830437:1764201398: 1849774174 958497523 1.49799:0.742017 1740418712 "bBVG, PeueD"[ ok? sfkIawkGajoRHRhfqfCgRIjj 1049019160,0.227077, 848560489;-836198377; -406155321:1975301993: 1389650526 1785902779 0.478093:3.5085 2091757319 "EuCWWfrI, pxLs"[ ok? awkgtkgcpiBZsHqpJDMSKTtw 1988855249,0.657779, 1573152160;-1713995138; -518078589:2023725233: 590379231 913137032 2.08322:0.970568 189286026 "gBrasJ, vrYqxkxCj"[ ok? gaZzBsDBkDSArYSFGDLlXupu 679500209,0.898341, 745917888;-155809311; -1095376280:84917846: 1337714800 2112713053 0.134232:2.03089 1997695653 "nmuZUzhU, zzGhZ"[ ok? JTcLRvRVGnptqsKwKftFGRFt 797756049,0.397521, 479145267;-289891055; -367660940:1947212012: 349872645 277818965 1.19606:5.44384 1970401032 "sstLvyxt, FK"[ ok? RysKQVwOqXHTmWVRUnIzAuNx 1159247829,6.629040, 1477419777;-1272112571; -75841059:2017567803: 1337612374 1459688155 0.803259:2.34417 177135239 "QOHhOeDJ, IOx"[ ok? pVvjtanciJwBrRWzDwXqjpTV 1547566154,1.164123, 1654571174;-226084640; -1421124225:1344720363: 1798543540 315490977 0.148464:0.573993 192549926 "TrozdNGP, efaEWl"[ ok? BOyXYAUvlBclBTcrYsVjrbdn 607733195,0.577292, 2032354479;-1650308503; -428183943:340742058: 797013369 136459851 0.459189:1.61603 1844411516 "vuMwSBpj, XfTzu"[ ok? xkhVeWZdSjyHIkqvboFHqcXo 2143872630,15.124809, 1628737685;-2033225825; -551174680:1844043468: 158262123 888419517 0.585839:2.16379 1592605069 "pDBWhPia, ygAA"[ ok? egFduAugqnXytdaIEhmOcoHz 1320956151,0.261166, 1409396741;-720521555; -1421423950:1308475935: 2068120000 1404430520 1.32962:0.939709 853737043 "jvHxJndm, Alm"[ ok? qYtfbmWiaLyzJmIraTRcZxXS 1021397630,0.248557, 958893220;-1975678883; -1573858501:1650156887: 837551842 1059827558 0.157113:0.20238 1094042107 "HDLDO, YcAoVp"[ ok? iChrMcRuiblSqgRvysKwFxfv 87813143,1.505596, 1755852775;-234017295; -487872137:1221718577: 351508657 1109078156 0.253457:0.438908 1720317085 "lPHjqkb, KSvrh"[ ok? zzZRbLKqzepvHyrtprHrACXS 1251871006,2.109112, 1840692692;-1431341121; -25270299:2137864839: 62481091 1988681812 0.229452:1.1619 99615595 "uKqdwqdk, avyJGMyWdtUX"[ ok? RSWyAWMSBeUXucZVPkLBMOhE 989556973,1.046537, 1066055685;-2142005352; -1750495926:816241374: 577441781 984222712 2.10438:2.35264 1051964906 "ojIz, LQIrK"[ ok? vBroYDLDuJJeisRVhpCZqQzN 1142946680,1.745006, 1139802821;-745040003; -66627326:1596296167: 717559476 263605833 0.51761:0.131987 1544740245 "AgNWc, TcPxvkciU"[ ok? dsiJAbxWXPNWKqJyjTnIBTwP 817467577,1.048710, 353076129;-1373259552; -347440273:895724820: 1167491801 1305803947 0.458945:0.244305 1883856445 "cMpX, sox"[ ok? rhwnLEXHqoyqSUiqlaTIjKlH 234102889,0.108408, 1936817625;-2019704438; -911913776:934641967: 2025989756 1594801858 0.249329:1.11241 972127010 "emsU, mDDwY"[ ok? stmIyXkvjOFGAYaTyryyoqfG 1544960899,35.150393, 1270508002;-1338789770; -681983459:1672029443: 1302135131 1211397665 1.27331:0.650155 867855213 "pwSdrLNx, FG"[ ok? lKExbAunJjaGdZwLPtVMsnyo 291785508,2.746893, 1259240383;-2035115761; -829090819:268557293: 1616752886 992337931 29.0065:13.0378 805126108 "uDeRCssA, Yx"[ ok? cyTuEfboZIPmHDqjYwAWJRHB 1418640354,19.691956, 1721444416;-1775713081; -162204814:138086209: 994871121 1277509886 1.54799:0.401955 1489461503 "EDNFfWRO, hJwsQreqF"[ ok? fzmCrfvnfjDZzvmxnjULLHDF 1558406301,1.127201, 2062820798;-1695560774; -679270514:653988645: 1284266322 371857088 9.85148:0.964263 73884387 "FJJqWwRN, OcSc"[ ok? qBahdnEDyUjXEKVFIeCpyyXL 2011151971,4.635000, 1443293455;-396521489; -644216760:193913957: 669728665 1216622227 9.01622:1.52917 272922678 "CdDEZbVI, WmsTMeJCuCLk"[ ok? zAPEqZdKFwlhAneqdQjsryDt 897037087,3.661483, 902628625;-1041962068; -725925709:873698097: 1097010356 1310806801 1.19308:0.787643 1415648977 "FVOQP, FECffVyFXqrp"[ ok? SMCqsJOrPRKkeobRrsPGZoXI 1958087646,0.058190, 1260487524;-1356771520; -819440641:2101177381: 1111319981 285617638 1.0939:0.555504 1225208915 "lLPt, xje"[ ok? hHgTdmeUwxFgQdZSXCvGWIrz 1673195985,0.221187, 1648260736;-13776662; -1018632370:1776539912: 1908268315 221906427 0.0250318:2.5633 1003501674 "VoBsB, SrwSWqQAUoF"[ ok? WWJRAszvdBsgdWIHcdcMWEdI 715877083,5.838308, 671044686;-1608543670; -616880248:14829438: 46590283 961372897 1.70574:1.06104 970485453 "hvIsYeay, VqIGqZ"[ ok? jEuCTgiFtqAoarLYkRYSwLrU 406092096,1.945753, 1848186156;-225820363; -1810888380:1976747399: 1963163109 2029144203 4.17731:0.0271519 1863535220 "lWMIZ, LBkUnqyNw"[ ok? ZSgXlemTsuZhVXfbbGashirn 651366922,1.252151, 1773166391;-970685641; -1041172236:1356984055: 1980748524 1490398715 1.38848:0.386835 880651775 "fFjsKMlO, bALVavBUKMSF"[ ok? ouRByMUrdahXjgMoGJKSVCWy 426620032,2.625393, 911699969;-1678352846; -941417565:1046124005: 1243363506 812943472 0.187869:0.945867 1883816918 "NsrIFJdG, Lsx"[ ok? ZTZXRmDToxzaLqrYRMDvUFKT 1976654856,0.423028, 1810351234;-920559060; -548547592:892926866: 1383586728 2024072618 0.18654:11.6888 603231201 "fJRjWkJ, wjEuJn"[ ok? yaKAAmHhmXuyhoMWwhzjXaBC 1058321620,0.863693, 594169028;-1611702627; -1196058201:1003360772: 1727679045 654967556 1.15532:0.17763 1237334808 "jarrKC, pOjbQDNagUyK"[ ok? EcfOWqFnCmYFUuARAxqCsboK 2114874470,0.749031, 732601605;-802483716; -1286106797:1745304806: 686380475 2066897604 0.613044:2.93714 1795881410 "UDWHnrlC, Uastocj"[ ok? CGneOfvyTUnOPVPjOvLUtHAC 283637485,1.508468, 1303123873;-1957010303; -1710452299:1804422162: 2073854101 939366939 0.557586:1.24974 1200197900 "QVSmjfjm, xtCmulTTLq"[ ok? OBRMjXvGqmQqPrviKMcUTKKS 1515596235,0.810540, 1381526388;-848886830; -1600048612:1982475386: 594638612 2091862145 1.41151:0.552215 1304433668 "VMcEIs, zz"[ ok? SZNMfMsnAjiUKZMSHpSkesWL 384510819,1.028107, 993980011;-769290870; -1634790555:1498522914: 828040470 1286702056 1.36387:0.801574 1904318163 "mypOJ, wNDJ"[ ok? IVMFPcpKFrQdDtOoBsICnSTE 1217781336,1.320359, 1213143842;-503279871; -207786460:2102858817: 2028031107 201856339 1.69878:0.674855 1911236866 "dhUxZIP, oj"[ ok? IQHCVLrDZveKlFbWKVUuXUEq 1099365687,0.417655, 1770781012;-282241919; -1095179536:846393772: 2057134561 1849085172 0.882052:3.38566 1520556550 "Rucg, QAC"[ ok? HOPUAlbtERiyuWsAAfMEwJNC 1014501944,0.826249, 426473947;-1213042186; -201626159:152301565: 925194657 910000021 1.09457:0.244376 597538766 "yfpXjAf, dGFwvElobJXW"[ ok? qBriguuEYBZzcWnruuemLXhK 1508864823,1.327268, 520985379;-825965415; -1743000378:731384340: 1941866237 150757584 0.0989664:11.5335 1264246660 "ASgq, SQ"[ ok? upyuEQabVUrZfTyFokMKPZSO 917459625,0.177465, 180183496;-686152335; -401103148:1012712602: 365008738 414569202 1.02438:4.27434 1421660131 "LQwg, BitBlDA"[ ok? ywMCWYKAwlsUdukuyVwBdxHp 886995147,0.755922, 1207333030;-1801903982; -1153258574:1780199277: 224695732 722702579 0.0569955:1.10684 956768324 "Ddyz, ltHPgJCh"[ ok? QPRSNwVVVSdQAwrkoSVRRpGm 476880785,1.053800, 734622554;-735397241; -717294157:2019055131: 1204008809 1892140543 4.36193:1.18831 465292468 "HvyAlTjy, PAhrV"[ ok? uaOcpEWGWTbAXLLGWetMeSIU 573730267,1.625266, 530031487;-603203563; -1071953360:1926822143: 1208710006 1960121099 146.09:0.625733 917395014 "wXxNQoSj, Bfle"[ ok? rmXwYJIfJqFBKIEqWjaLDudA 1282120451,1.497236, 960060659;-488387996; -607544537:2102460845: 379632432 477940059 2.89406:5.36821 1853943244 "TxRN, AqFXuErsfUdt"[ ok? QhsFcIxgjmnREHSmgqrhqYUK 120585787,1.262603, 1346577319;-1606873145; -1818444276:1311230161: 977883069 1966134394 0.172291:1.59197 1207828345 "SsXCJjdL, ug"[ ok? wXdGifJSqBvGdqRNDQvDPOZp 1526948042,0.082215, 1208986129;-1782242599; -1886354291:2005900300: 1555243512 164120135 0.134562:0.597834 950637266 "KXmLOOdP, zqSY"[ ok? dtEEJSwUiRgiXHyKvDCajyOu 91124494,1.168318, 1568990573;-573730801; -5414735:645565651: 1697357519 783305249 0.783315:0.581791 1448321182 "NXyPUXoK, wgTTpJ"[ ok? XxJCkYqcUmtLAaMMvOmEQUIh 195394040,0.149891, 1156239130;-963837081; -834309936:128970909: 1778293191 450066034 0.323963:0.345093 1765546804 "DLnd, FDnzSnAErH"[ ok? vcGPXqXCMxiWDGzWLFVaOfLQ 602481378,0.583331, 857074906;-118377075; -798327562:483075898: 976456742 2048322943 0.0707573:0.348077 949325162 "TYUOJwVb, jSVBvb"[ ok? jNvZVHgVJNfySInRutLyKQcl 1916964307,1.642192, 962205646;-1227402861; -1234221721:2136847328: 442001590 1414300237 2.57315:5.73903 939903390 "gCHBUj, Qpn"[ ok? kRPMxySmxZajJXPhqlecoizC 396038166,12.736928, 419866642;-2101958605; -1841840864:1005066426: 1238283704 1115966250 95.5553:1.98173 603214605 "GfIpdquJ, Xo"[ ok? xvfKlsJfulgpvGWIRTVhozYk 300128678,1.585699, 1878541863;-763992894; -1917752199:1614173921: 1590340442 515300011 7.75375:1.12023 38730034 "JOFwxlph, EHy"[ ok? hKMrxVzAUNqteOXdhtzdMaZO 2087446871,1.396112, 865680651;-467063868; -2099676076:2092813148: 1105171198 965456970 2.22493:0.912856 1684713906 "uRiplHVN, hqHTLKKt"[ ok? wgxXBbJgTLriarZPVaDbubBJ 481866104,1.403423, 762965607;-851416101; -780721694:885996626: 906960582 465034704 1.953:0.201327 152374341 "EFDHJx, LGMySowzXio"[ ok? kZXOzSbsycTcFEOGhTBgwIsP 402155568,1.158114, 1763970341;-1489771718; -875590783:786196283: 2138079853 811331127 0.644974:0.940403 2035335944 "CGXpz, dCM"[ ok? OsMIgmiSFvyuUZnVOueUrGVP 1595496675,0.407021, 2014982802;-547509418; -229568763:1185270882: 1278592107 1027184692 0.345137:0.443377 1013798395 "sfDP, jaakIxFC"[ ok? YFImQgsMxpmarEigoAZgHNea 192485785,1.979305, 574587137;-962792283; -1223677044:196002279: 1391064823 1305507615 2.04735:0.314071 1685523331 "ImeJjxiE, SRWLwYa"[ ok? aGPyWTqZmHfOlVCJoBpGovhT 40524987,1.319852, 1196361433;-1997315868; -663930191:1991343301: 797895540 1399178689 0.675514:1.56915 28285992 "lXTGoY, IrTHNl"[ ok? oCFbwBljOQuTweKzWjNWmZwk 289703649,2.123395, 1900067170;-2008305153; -1241747896:1178040512: 2061744673 1939228737 1.1606:0.133325 1048261038 "sdVwYpuj, IwNJZEyvgjNj"[ ok? # EOF zimpl-3.3.6/check/read.tbl.ref0000644001417200060250000000044113301553023016015 0ustar bzfschlooptimizimpl v 0 x "x" zimpl c 0 c1_1 "c1_1" 0.0000000000000000e+00 zimpl c 1 c2_1 "c2_1" 0.0000000000000000e+00 zimpl c 2 c3_1 "c3_1" 0.0000000000000000e+00 zimpl c 3 c4_1 "c4_1" 0.0000000000000000e+00 zimpl-3.3.6/check/sos.sos.ref0000644001417200060250000000174513301553023015741 0ustar bzfschlooptimi* This file was automatically generated by Zimpl NAME sos.zpl * c01_1 S1 0 x#1 1 * c02_1 S1 10 x#2 2 x#1 1 * c03_1 S2 0 x#1 1 x#2 2 x#1 3 * c04_1 S1 60 x#4 1 x#2 6 x#1 3 * c05_1 S2 0 x#5 5 x#4 4 x#3 3 x#2 2 x#1 1 * c06_1 S1 0 y#2 62 y#1 90 x#3 2 x#5 -10 x#4 -8 x#5 -1 * c07_1 S2 0 x#5 5 x#4 4 x#3 3 x#2 2 x#1 1 * c08_1 S2 5 y#1 1 * c08_2 S2 5 y#2 2 * c08_3 S2 5 y#3 3 * c08_4 S2 5 y#4 4 * c08_5 S2 5 y#5 5 ENDATA zimpl-3.3.6/check/bool.lp.ref0000644001417200060250000000224713301553023015675 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set A := { 1 .. 10 }; \ set B := { 5 .. 15 }; \ param a1 := if A == B or A <= B then 1 else 2 end; \ param a2 := if A != B and A < B then 1 else 2 end; \ param a3 := if not A > B and not A < B then 1 else 2 end; \ param a4 := if a1 < a2 or a2 != a3 then 1 else 2 end; \ param a5 := if if a1 != a2 then a3 < a4 else a3 > a4 end then 1 else 2 end; \ param a6 := if A == B xor A <= B then 3 else 4 end; \ param a7 := if "aaaa" >= "aaaab" then 5 else 1 end; \ param a8 := if exists( in { 1 .. 20 } with i * i == 16) then 1 else 2 end; \ param a9 := if <4> in { 1 .. 4 } then 7 else 8 end + if <"hallo"> in { "moin", "tach", "hi"} then 2 else 5 end \ + if <5> in {} then 100 else 0 end; \ var x[A]; \ maximize c1: a1 * x[1] + a2 * x[2] + a3 * x[3] + a4 * x[4] + a5 * x[5] + a6 * x[6] + a7 * x[7] + a8 * x[8] + a9 * \ x[9]; \Problem name: bool.zpl Maximize c1: +2 x#1 +2 x#2 + x#3 + x#4 +2 x#5 +4 x#6 + x#7 + x#8 +12 x#9 Subject to Bounds 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf 0 <= x#6 <= +inf 0 <= x#7 <= +inf 0 <= x#8 <= +inf 0 <= x#9 <= +inf End zimpl-3.3.6/check/param.lp.ref0000644001417200060250000000275213301553023016043 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1 .. 10 }; \ set J := { "a", "b", "c", "x", "y", "z" }; \ param a := 5; \ param b := "hallo"; \ param c[I] := <1> "a", <2> "b", <3> "c"; \ param d[I] := <2> "x", <3> "y" default "z"; \ param e[ in I with i > 5] := i + 2; \ param f[<5,j> in I * { "a", "b" }] := j; \ param g[J] := <"a"> 1, <"b"> 2, <"c"> 3, <"x"> 4, <"y"> 5, <"z"> 9; \ param h[I*J] := | "a", "c", "x", "z" | |1| 12, 17, 99, 23 | |3| 4, 3,-17, 66*5.5 | |5| 2/3, -.4, 3, abs(-4)| \ |9| 1, 2, 0, 3 | default -99; \ var x[I]; \ subto a1: a * x[1] >= 0; \ subto b2: if b == "hallo" then 5 else 3 end * x[1] >= 0; \ subto c1 : sum in I with i < 4: g[c[i]] * x[i] >= 0; \ subto d1 : sum in I : g[d[i]] * x[i] >= 0; \ subto e1 : sum in I with i > 5: e[i] * x[i] >= 0; \ subto f1 : g[f[5,"a"]] * x[1] + g[f[5,"b"]] * x[2] >= 0; \ subto h1 : sum in I*J with h[i,j] != -99: h[i,j] * x[i] >= 0; \Problem name: param.zpl Minimize Objective: Subject to a1_1: +5 x#1 >= 0 b2_1: +5 x#1 >= 0 c1_1: +3 x#3 +2 x#2 + x#1 >= 0 d1_1: +9 x#10 +9 x#9 +9 x#8 +9 x#7 +9 x#6 +9 x#5 +9 x#4 +5 x#3 +4 x#2 +9 x#1 >= 0 e1_1: +12 x#10 +11 x#9 +10 x#8 +9 x#7 +8 x#6 >= 0 f1_1: +2 x#2 + x#1 >= 0 h1_1: +6 x#9 +7.26666666666667 x#5 +353 x#3 +151 x#1 >= 0 Bounds 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf 0 <= x#6 <= +inf 0 <= x#7 <= +inf 0 <= x#8 <= +inf 0 <= x#9 <= +inf 0 <= x#10 <= +inf End zimpl-3.3.6/check/define.zpl0000644001417200060250000000430313301553023015606 0ustar bzfschlooptimi# $Id: define.zpl,v 1.8 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: define.zpl */ #* Name....: Define test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2001-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1..5 } * { 4..7}; var x[I]; defnumb dist(a,b) := a*a + b*b; subto c1: sum in I do dist(i,j) * x[i,j] >= 0; defnumb ack(i,j) := if i == 0 then j + 1 else if j == 0 then ack(i - 1, 1) else ack(i - 1, ack(i, j - 1)) end end; subto c2: ack(3,3) * x[ack(1,3),ack(2,2)] >= 0; set K := { 1..10 }; var y[K]; defbool goodone(a,b) := a > b; defset bigger(i) := { in K with goodone(j,i) }; subto c3: sum in bigger(5) : y[i] >= 0; set G := { 1..3 }; set H := { "hallo", "tach", "moin" }; param greet[G] := <1> "hallo", <2> "tach", <3> "moin"; var z[H]; defstrg greeting(m) := greet[(m + 1) mod card(G)]; subto c4: z[greeting(1)] + z[greeting(3)] >= 0; zimpl-3.3.6/check/param.tbl.ref0000644001417200060250000000150013301553023016177 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 x#6 "x#6" zimpl v 6 x#7 "x#7" zimpl v 7 x#8 "x#8" zimpl v 8 x#9 "x#9" zimpl v 9 x#10 "x#10" zimpl c 0 a1_1 "a1_1" 0.0000000000000000e+00 zimpl c 1 b2_1 "b2_1" 0.0000000000000000e+00 zimpl c 2 c1_1 "c1_1" 0.0000000000000000e+00 zimpl c 3 d1_1 "d1_1" 0.0000000000000000e+00 zimpl c 4 e1_1 "e1_1" 0.0000000000000000e+00 zimpl c 5 f1_1 "f1_1" 0.0000000000000000e+00 zimpl c 6 h1_1 "h1_1" 0.0000000000000000e+00 zimpl-3.3.6/check/bool.tbl.ref0000644001417200060250000000053713301553023016043 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 x#6 "x#6" zimpl v 6 x#7 "x#7" zimpl v 7 x#8 "x#8" zimpl v 8 x#9 "x#9" zimpl-3.3.6/check/presol.ord.ref0000644001417200060250000000107113301553023016411 0ustar bzfschlooptimi* This file was automatically generated by Zimpl NAME presol.z x#1 0 1.0000000000e+00 x#2 0 0.0000000000e+00 x#3 0 1.0000000000e+00 x#4 0 0.0000000000e+00 x#5 0 1.0000000000e+00 y#1 10 5.0000000000e+00 y#2 20 5.0000000000e+00 y#3 30 5.0000000000e+00 y#4 40 5.0000000000e+00 y#5 50 5.0000000000e+00 w#2 0 0.0000000000e+00 w#4 0 0.0000000000e+00 ENDATA zimpl-3.3.6/check/expr.tbl.ref0000644001417200060250000000350713301553023016066 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 x#6 "x#6" zimpl v 6 x#7 "x#7" zimpl v 7 x#8 "x#8" zimpl v 8 x#9 "x#9" zimpl v 9 x#10 "x#10" zimpl c 0 c01_1 "c01_1" 0.0000000000000000e+00 zimpl c 1 c02_1 "c02_1" 0.0000000000000000e+00 zimpl c 2 c03_1 "c03_1" 0.0000000000000000e+00 zimpl c 3 c04_1 "c04_1" 0.0000000000000000e+00 zimpl c 4 c05_1 "c05_1" 0.0000000000000000e+00 zimpl c 5 c06_1 "c06_1" 0.0000000000000000e+00 zimpl c 6 c07_1 "c07_1" 0.0000000000000000e+00 zimpl c 7 c08_1 "c08_1" 0.0000000000000000e+00 zimpl c 8 c09_1 "c09_1" 0.0000000000000000e+00 zimpl c 9 c10_1 "c10_1" 0.0000000000000000e+00 zimpl c 10 c11_1 "c11_1" 0.0000000000000000e+00 zimpl c 11 c12_1 "c12_1" 0.0000000000000000e+00 zimpl c 12 c13_1 "c13_1" 0.0000000000000000e+00 zimpl c 13 c14_1 "c14_1" 0.0000000000000000e+00 zimpl c 14 c15_1 "c15_1" 0.0000000000000000e+00 zimpl c 15 c16_1 "c16_1" 0.0000000000000000e+00 zimpl c 16 c17_1 "c17_1" 0.0000000000000000e+00 zimpl c 17 c18_1 "c18_1" 0.0000000000000000e+00 zimpl c 18 c19_1 "c19_1" 0.0000000000000000e+00 zimpl c 19 c20_1 "c20_1" 0.0000000000000000e+00 zimpl c 20 c21_1 "c21_1" 0.0000000000000000e+00 zimpl c 21 c22_1 "c22_1" 0.0000000000000000e+00 zimpl c 22 c23_1 "c23_1" 0.0000000000000000e+00 zimpl-3.3.6/check/metaio.lp.ref0000644001417200060250000000434213301553023016216 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set V := { read "@selftest_cities.dat" as "<1s>" comment "#" use cities }; \ set E := { in V * V with i < j }; \ set P[] := powerset(V); \ set K := indexset(P) \ { 0 }; \ do print cities; \ do print V; \ do print E; \ param px[V] := read "@selftest_cities.dat" as "<1s> 2n" comment "#" use cities; \ param py[V] := read "@selftest_cities.dat" as "<1s> 3n" comment "#" use cities; \ defnumb dist(a,b) := sqrt((px[a] - px[b])^2 + (py[a] - py[b])^2); \ var x[E] binary; \ minimize cost: sum in E : dist(i,j) * x[i, j]; \ subto two_connected: forall in V do (sum in E : x[v,j]) + (sum in E : x[i,v]) == 2; \ subto no_subtour: forall in K with card(P[k]) > 2 and card(P[k]) < card(V) - 2 do sum in E with in P[k \ ] and in P[k] : x[i,j] <= card(P[k]) - 1; \Problem name: @selftest_tspste.zpl Minimize cost: +533.081607261027 x$Berlin$Frank@0 +156.630137585332 x$Berlin$Leipzig +565.534260677459 x$Berlin$Heide@2 +610.327780786685 x$Berlin$Karls@3 +392.444900591153 x$Frankfurt$Le@4 +70.0642562224134 x$Frankfurt$He@5 +112.587743560301 x$Frankfurt$Ka@6 +416.850092959088 x$Heidelberg$L@7 +48.2597140480546 x$Heidelberg$K@8 +459.818442431358 x$Karlsruhe$Le@9 Subject to two_connected_1: + x$Berlin$Karls@3 + x$Berlin$Heide@2 + x$Berlin$Leipzig + x$Berlin$Frank@0 = 2 two_connected_2: + x$Berlin$Frank@0 + x$Frankfurt$Ka@6 + x$Frankfurt$He@5 + x$Frankfurt$Le@4 = 2 two_connected_3: + x$Karlsruhe$Le@9 + x$Heidelberg$L@7 + x$Frankfurt$Le@4 + x$Berlin$Leipzig = 2 two_connected_4: + x$Frankfurt$He@5 + x$Berlin$Heide@2 + x$Heidelberg$K@8 + x$Heidelberg$L@7 = 2 two_connected_5: + x$Heidelberg$K@8 + x$Frankfurt$Ka@6 + x$Berlin$Karls@3 + x$Karlsruhe$Le@9 = 2 Bounds 0 <= x$Berlin$Frank@0 <= 1 0 <= x$Berlin$Leipzig <= 1 0 <= x$Berlin$Heide@2 <= 1 0 <= x$Berlin$Karls@3 <= 1 0 <= x$Frankfurt$Le@4 <= 1 0 <= x$Frankfurt$He@5 <= 1 0 <= x$Frankfurt$Ka@6 <= 1 0 <= x$Heidelberg$L@7 <= 1 0 <= x$Heidelberg$K@8 <= 1 0 <= x$Karlsruhe$Le@9 <= 1 General x$Berlin$Frank@0 x$Berlin$Leipzig x$Berlin$Heide@2 x$Berlin$Karls@3 x$Frankfurt$Le@4 x$Frankfurt$He@5 x$Frankfurt$Ka@6 x$Heidelberg$L@7 x$Heidelberg$K@8 x$Karlsruhe$Le@9 End zimpl-3.3.6/check/sos.zpl0000644001417200060250000000400413301553023015156 0ustar bzfschlooptimi# $Id: sos.zpl,v 1.7 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: sos.zpl */ #* Name....: SOS test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2005-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set A := { 1 to 5 }; set B := { 1 to 5 }; var x[A]; var y[B]; param a[A] := <1> 1, <2> 2, <3> 3, <4> 4, <5> 5 ; sos c01: type1: x[1]; sos c02: type1 priority 10 : x[1] + 2 * x[2]; sos c03: type2: x[1] * 3 + 2 * x[2] + x[1]; sos c04: type1 priority 60 : 3 * (x[1] + 2 * x[2]) + x[4]; sos c05: type2 : sum in A do i * x[i]; sos c06: type1 : - x[5] - 2 * sum in A with i > 3 do i * x[i] + x[3] * 2 + 90 * y[1] + 62 * y[2]; sos c07: type2 : sum in A: a[i] * x[i]; sos c08: forall in A do type2 priority 5 : sum in B: (a[j] + i) * y[j]; zimpl-3.3.6/check/vinst.lp.ref0000644001417200060250000003535613301553023016114 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1..10 }; \ var x[I] integer >= -10 <= 10; \ subto c1: vif x[1] < 0 then x[2] == 9 end; \ subto c2: vif x[1] <= 0 then x[2] == 8 end; \ subto c3: vif x[1] == 0 then x[2] == 7 end; \ subto c4: vif x[1] != 0 then x[2] == 6 end; \ subto c5: vif x[1] >= 0 then x[2] == 5 end; \ subto c6: vif x[1] > 0 then x[2] == 4 end; \ subto c7: forall in I with i < 4 : vif vabs(x[1] + x[2]) <= 5 then x[3] + x[4] >= 5 else x[5] + x[6] >= 8 end; \ subto c8: vif 3 * x[1] + x[2] != 7 then sum in I : x[i] <= 17 else sum in I : x[i] >= 5 end; \ subto c9: vif x[1] == 1 and x[2] > 5 or x[1] == 2 and x[2] < 8 then x[3] == 7 end; \ subto c10: vif x[1] != 1 xor not x[2] == 5 then x[3] <= 2 end; \ subto c11: vif x[1] == 1 then x[2] == 0 else x[3] == 0 end, indicator; \Problem name: vinst.zpl Minimize Objective: Subject to c1_1_a_0: + __c1_1_xm_1@b - __c1_1_xp_0@a + x#1 = 0 c1_1_b_1: - __c1_1_xp_0@a + __c1_1_bp_2@c <= 0 c1_1_c_2: - __c1_1_xm_1@b + __c1_1_bm_3@d <= 0 c1_1_d_3: - __c1_1_xp_0@a +10 __c1_1_bp_2@c >= 0 c1_1_e_4: - __c1_1_xm_1@b +10 __c1_1_bm_3@d >= 0 c1_1_f_5: + __c1_1_bm_3@d + __c1_1_bp_2@c <= 1 c1_1_g_6: - __c1_1_bm_3@d + __c1_1_re_4@e = 0 c1_1_t_r: + x#2 + __c1_1_re_4@e <= 10 c1_1_t_l: + x#2 -19 __c1_1_re_4@e >= -10 c2_1_a_7: + __c2_1_xm_6@10 - __c2_1_xp_5@f + x#1 = 0 c2_1_b_8: - __c2_1_xp_5@f + __c2_1_bp_7@11 <= 0 c2_1_c_9: - __c2_1_xm_6@10 + __c2_1_bm_8@12 <= 0 c2_1_d_10: - __c2_1_xp_5@f +10 __c2_1_bp_7@11 >= 0 c2_1_e_11: - __c2_1_xm_6@10 +10 __c2_1_bm_8@12 >= 0 c2_1_f_12: + __c2_1_bm_8@12 + __c2_1_bp_7@11 <= 1 c2_1_g_13: + __c2_1_bp_7@11 + __c2_1_re_9@13 = 1 c2_1_t_r: + x#2 +2 __c2_1_re_9@13 <= 10 c2_1_t_l: + x#2 -18 __c2_1_re_9@13 >= -10 c3_1_a_14: + __c3_1_xm_11@15 - __c3_1_xp_10@14 + x#1 = 0 c3_1_b_15: - __c3_1_xp_10@14 + __c3_1_bp_12@16 <= 0 c3_1_c_16: - __c3_1_xm_11@15 + __c3_1_bm_13@17 <= 0 c3_1_d_17: - __c3_1_xp_10@14 +10 __c3_1_bp_12@16 >= 0 c3_1_e_18: - __c3_1_xm_11@15 +10 __c3_1_bm_13@17 >= 0 c3_1_f_19: + __c3_1_bm_13@17 + __c3_1_bp_12@16 + __c3_1_re_14@18 = 1 c3_1_t_r: + x#2 +3 __c3_1_re_14@18 <= 10 c3_1_t_l: + x#2 -17 __c3_1_re_14@18 >= -10 c4_1_a_20: + __c4_1_xm_16@1a - __c4_1_xp_15@19 + x#1 = 0 c4_1_b_21: - __c4_1_xp_15@19 + __c4_1_bp_17@1b <= 0 c4_1_c_22: - __c4_1_xm_16@1a + __c4_1_bm_18@1c <= 0 c4_1_d_23: - __c4_1_xp_15@19 +10 __c4_1_bp_17@1b >= 0 c4_1_e_24: - __c4_1_xm_16@1a +10 __c4_1_bm_18@1c >= 0 c4_1_f_25: - __c4_1_bm_18@1c - __c4_1_bp_17@1b + __c4_1_re_19@1d = 0 c4_1_t_r: + x#2 +4 __c4_1_re_19@1d <= 10 c4_1_t_l: + x#2 -16 __c4_1_re_19@1d >= -10 c5_1_a_26: + __c5_1_xm_21@1f - __c5_1_xp_20@1e + x#1 = 0 c5_1_b_27: - __c5_1_xp_20@1e + __c5_1_bp_22@20 <= 0 c5_1_c_28: - __c5_1_xm_21@1f + __c5_1_bm_23@21 <= 0 c5_1_d_29: - __c5_1_xp_20@1e +10 __c5_1_bp_22@20 >= 0 c5_1_e_30: - __c5_1_xm_21@1f +10 __c5_1_bm_23@21 >= 0 c5_1_f_31: + __c5_1_bm_23@21 + __c5_1_bp_22@20 <= 1 c5_1_g_32: + __c5_1_bm_23@21 + __c5_1_re_24@22 = 1 c5_1_t_r: + x#2 +5 __c5_1_re_24@22 <= 10 c5_1_t_l: + x#2 -15 __c5_1_re_24@22 >= -10 c6_1_a_33: + __c6_1_xm_26@24 - __c6_1_xp_25@23 + x#1 = 0 c6_1_b_34: - __c6_1_xp_25@23 + __c6_1_bp_27@25 <= 0 c6_1_c_35: - __c6_1_xm_26@24 + __c6_1_bm_28@26 <= 0 c6_1_d_36: - __c6_1_xp_25@23 +10 __c6_1_bp_27@25 >= 0 c6_1_e_37: - __c6_1_xm_26@24 +10 __c6_1_bm_28@26 >= 0 c6_1_f_38: + __c6_1_bm_28@26 + __c6_1_bp_27@25 <= 1 c6_1_g_39: - __c6_1_bp_27@25 + __c6_1_re_29@27 = 0 c6_1_t_r: + x#2 +6 __c6_1_re_29@27 <= 10 c6_1_t_l: + x#2 -14 __c6_1_re_29@27 >= -10 c7_1_a_40: + __c7_1_xm_31@29 - __c7_1_xp_30@28 + x#2 + x#1 = 0 c7_1_b_41: - __c7_1_xp_30@28 +20 __c7_1_bp_32@2a >= 0 c7_1_c_42: + __c7_1_xm_31@29 +20 __c7_1_bp_32@2a <= 20 c7_1_d_43: - __c7_1_xm_31@29 - __c7_1_xp_30@28 + __c7_1_re_33@2b = 0 c7_1_a_44: + __c7_1_xm_35@2d - __c7_1_xp_34@2c + __c7_1_re_33@2b = 5 c7_1_b_45: - __c7_1_xp_34@2c + __c7_1_bp_36@2e <= 0 c7_1_c_46: - __c7_1_xm_35@2d + __c7_1_bm_37@2f <= 0 c7_1_d_47: - __c7_1_xp_34@2c +15 __c7_1_bp_36@2e >= 0 c7_1_e_48: - __c7_1_xm_35@2d +5 __c7_1_bm_37@2f >= 0 c7_1_f_49: + __c7_1_bm_37@2f + __c7_1_bp_36@2e <= 1 c7_1_g_50: + __c7_1_bp_36@2e + __c7_1_re_38@30 = 1 c7_1_t_l: + x#4 + x#3 -25 __c7_1_re_38@30 >= -20 c7_1_e_l: + x#6 + x#5 +28 __c7_1_re_38@30 >= 8 c7_2_a_51: + __c7_2_xm_40@32 - __c7_2_xp_39@31 + x#2 + x#1 = 0 c7_2_b_52: - __c7_2_xp_39@31 +20 __c7_2_bp_41@33 >= 0 c7_2_c_53: + __c7_2_xm_40@32 +20 __c7_2_bp_41@33 <= 20 c7_2_d_54: - __c7_2_xm_40@32 - __c7_2_xp_39@31 + __c7_2_re_42@34 = 0 c7_2_a_55: + __c7_2_xm_44@36 - __c7_2_xp_43@35 + __c7_2_re_42@34 = 5 c7_2_b_56: - __c7_2_xp_43@35 + __c7_2_bp_45@37 <= 0 c7_2_c_57: - __c7_2_xm_44@36 + __c7_2_bm_46@38 <= 0 c7_2_d_58: - __c7_2_xp_43@35 +15 __c7_2_bp_45@37 >= 0 c7_2_e_59: - __c7_2_xm_44@36 +5 __c7_2_bm_46@38 >= 0 c7_2_f_60: + __c7_2_bm_46@38 + __c7_2_bp_45@37 <= 1 c7_2_g_61: + __c7_2_bp_45@37 + __c7_2_re_47@39 = 1 c7_2_t_l: + x#4 + x#3 -25 __c7_2_re_47@39 >= -20 c7_2_e_l: + x#6 + x#5 +28 __c7_2_re_47@39 >= 8 c7_3_a_62: + __c7_3_xm_49@3b - __c7_3_xp_48@3a + x#2 + x#1 = 0 c7_3_b_63: - __c7_3_xp_48@3a +20 __c7_3_bp_50@3c >= 0 c7_3_c_64: + __c7_3_xm_49@3b +20 __c7_3_bp_50@3c <= 20 c7_3_d_65: - __c7_3_xm_49@3b - __c7_3_xp_48@3a + __c7_3_re_51@3d = 0 c7_3_a_66: + __c7_3_xm_53@3f - __c7_3_xp_52@3e + __c7_3_re_51@3d = 5 c7_3_b_67: - __c7_3_xp_52@3e + __c7_3_bp_54@40 <= 0 c7_3_c_68: - __c7_3_xm_53@3f + __c7_3_bm_55@41 <= 0 c7_3_d_69: - __c7_3_xp_52@3e +15 __c7_3_bp_54@40 >= 0 c7_3_e_70: - __c7_3_xm_53@3f +5 __c7_3_bm_55@41 >= 0 c7_3_f_71: + __c7_3_bm_55@41 + __c7_3_bp_54@40 <= 1 c7_3_g_72: + __c7_3_bp_54@40 + __c7_3_re_56@42 = 1 c7_3_t_l: + x#4 + x#3 -25 __c7_3_re_56@42 >= -20 c7_3_e_l: + x#6 + x#5 +28 __c7_3_re_56@42 >= 8 c8_1_a_73: + __c8_1_xm_58@44 - __c8_1_xp_57@43 + x#2 +3 x#1 = 7 c8_1_b_74: - __c8_1_xp_57@43 + __c8_1_bp_59@45 <= 0 c8_1_c_75: - __c8_1_xm_58@44 + __c8_1_bm_60@46 <= 0 c8_1_d_76: - __c8_1_xp_57@43 +33 __c8_1_bp_59@45 >= 0 c8_1_e_77: - __c8_1_xm_58@44 +47 __c8_1_bm_60@46 >= 0 c8_1_f_78: - __c8_1_bm_60@46 - __c8_1_bp_59@45 + __c8_1_re_61@47 = 0 c8_1_t_r: + x#10 + x#9 + x#8 + x#7 + x#6 + x#5 + x#4 + x#3 + x#2 + x#1 +83 __c8_1_re_61@47 <= 100 c8_1_e_l: + x#10 + x#9 + x#8 + x#7 + x#6 + x#5 + x#4 + x#3 + x#2 + x#1 +105 __c8_1_re_61@47 >= 5 c9_1_a_79: + __c9_1_xm_63@49 - __c9_1_xp_62@48 + x#1 = 1 c9_1_b_80: - __c9_1_xp_62@48 + __c9_1_bp_64@4a <= 0 c9_1_c_81: - __c9_1_xm_63@49 + __c9_1_bm_65@4b <= 0 c9_1_d_82: - __c9_1_xp_62@48 +9 __c9_1_bp_64@4a >= 0 c9_1_e_83: - __c9_1_xm_63@49 +11 __c9_1_bm_65@4b >= 0 c9_1_f_84: + __c9_1_bm_65@4b + __c9_1_bp_64@4a + __c9_1_re_66@4c = 1 c9_1_a_85: + __c9_1_xm_68@4e - __c9_1_xp_67@4d + x#2 = 5 c9_1_b_86: - __c9_1_xp_67@4d + __c9_1_bp_69@4f <= 0 c9_1_c_87: - __c9_1_xm_68@4e + __c9_1_bm_70@50 <= 0 c9_1_d_88: - __c9_1_xp_67@4d +5 __c9_1_bp_69@4f >= 0 c9_1_e_89: - __c9_1_xm_68@4e +15 __c9_1_bm_70@50 >= 0 c9_1_f_90: + __c9_1_bm_70@50 + __c9_1_bp_69@4f <= 1 c9_1_g_91: - __c9_1_bp_69@4f + __c9_1_re_71@51 = 0 c9_1_a_92: - __c9_1_re_72@52 + __c9_1_re_66@4c >= 0 c9_1_b_93: - __c9_1_re_72@52 + __c9_1_re_71@51 >= 0 c9_1_c_94: - __c9_1_re_72@52 + __c9_1_re_71@51 + __c9_1_re_66@4c <= 1 c9_1_a_95: + __c9_1_xm_74@54 - __c9_1_xp_73@53 + x#1 = 2 c9_1_b_96: - __c9_1_xp_73@53 + __c9_1_bp_75@55 <= 0 c9_1_c_97: - __c9_1_xm_74@54 + __c9_1_bm_76@56 <= 0 c9_1_d_98: - __c9_1_xp_73@53 +8 __c9_1_bp_75@55 >= 0 c9_1_e_99: - __c9_1_xm_74@54 +12 __c9_1_bm_76@56 >= 0 c9_1_f_100: + __c9_1_bm_76@56 + __c9_1_bp_75@55 + __c9_1_re_77@57 = 1 c9_1_a_101: + __c9_1_xm_79@59 - __c9_1_xp_78@58 + x#2 = 8 c9_1_b_102: - __c9_1_xp_78@58 + __c9_1_bp_80@5a <= 0 c9_1_c_103: - __c9_1_xm_79@59 + __c9_1_bm_81@5b <= 0 c9_1_d_104: - __c9_1_xp_78@58 +2 __c9_1_bp_80@5a >= 0 c9_1_e_105: - __c9_1_xm_79@59 +18 __c9_1_bm_81@5b >= 0 c9_1_f_106: + __c9_1_bm_81@5b + __c9_1_bp_80@5a <= 1 c9_1_g_107: - __c9_1_bm_81@5b + __c9_1_re_82@5c = 0 c9_1_a_108: - __c9_1_re_83@5d + __c9_1_re_77@57 >= 0 c9_1_b_109: - __c9_1_re_83@5d + __c9_1_re_82@5c >= 0 c9_1_c_110: - __c9_1_re_83@5d + __c9_1_re_82@5c + __c9_1_re_77@57 <= 1 c9_1_a_111: - __c9_1_re_84@5e + __c9_1_re_72@52 <= 0 c9_1_b_112: - __c9_1_re_84@5e + __c9_1_re_83@5d <= 0 c9_1_c_113: - __c9_1_re_84@5e + __c9_1_re_83@5d + __c9_1_re_72@52 >= 0 c9_1_t_r: + x#3 +3 __c9_1_re_84@5e <= 10 c9_1_t_l: + x#3 -17 __c9_1_re_84@5e >= -10 c10_1_a_114: + __c10_1_xm_86@60 - __c10_1_xp_85@5f + x#1 = 1 c10_1_b_115: - __c10_1_xp_85@5f + __c10_1_bp_87@61 <= 0 c10_1_c_116: - __c10_1_xm_86@60 + __c10_1_bm_88@62 <= 0 c10_1_d_117: - __c10_1_xp_85@5f +9 __c10_1_bp_87@61 >= 0 c10_1_e_118: - __c10_1_xm_86@60 +11 __c10_1_bm_88@62 >= 0 c10_1_f_119: - __c10_1_bm_88@62 - __c10_1_bp_87@61 + __c10_1_re_89@63 = 0 c10_1_a_120: + __c10_1_xm_91@65 - __c10_1_xp_90@64 + x#2 = 5 c10_1_b_121: - __c10_1_xp_90@64 + __c10_1_bp_92@66 <= 0 c10_1_c_122: - __c10_1_xm_91@65 + __c10_1_bm_93@67 <= 0 c10_1_d_123: - __c10_1_xp_90@64 +5 __c10_1_bp_92@66 >= 0 c10_1_e_124: - __c10_1_xm_91@65 +15 __c10_1_bm_93@67 >= 0 c10_1_f_125: + __c10_1_bm_93@67 + __c10_1_bp_92@66 + __c10_1_re_94@68 = 1 c10_1_a_126: + __c10_1_re_95@69 + __c10_1_re_94@68 = 1 c10_1_a_127: - __c10_1_re_96@6a + __c10_1_re_95@69 + __c10_1_re_89@63 >= 0 c10_1_b_128: - __c10_1_re_96@6a - __c10_1_re_95@69 + __c10_1_re_89@63 <= 0 c10_1_c_129: + __c10_1_re_96@6a - __c10_1_re_95@69 + __c10_1_re_89@63 >= 0 c10_1_d_130: + __c10_1_re_96@6a + __c10_1_re_95@69 + __c10_1_re_89@63 <= 2 c10_1_t_r: + x#3 +8 __c10_1_re_96@6a <= 10 c11_1_a_131: + __c11_1_xm_98@6c - __c11_1_xp_97@6b + x#1 = 1 c11_1_b_132: - __c11_1_xp_97@6b + __c11_1_bp_99@6d <= 0 c11_1_c_133: - __c11_1_xm_98@6c + __c11_1_bm_10@6e <= 0 c11_1_d_134: - __c11_1_xp_97@6b +9 __c11_1_bp_99@6d >= 0 c11_1_e_135: - __c11_1_xm_98@6c +11 __c11_1_bm_10@6e >= 0 c11_1_f_136: + __c11_1_bm_10@6e + __c11_1_bp_99@6d + __c11_1_re_10@6f = 1 c11_1_t: __c11_1_re_10@6f = 1 -> + x#2 = 0 c11_1_f: __c11_1_re_10@6f = 0 -> + x#3 = 0 Bounds -10 <= x#1 <= 10 -10 <= x#2 <= 10 -10 <= x#3 <= 10 -10 <= x#4 <= 10 -10 <= x#5 <= 10 -10 <= x#6 <= 10 -10 <= x#7 <= 10 -10 <= x#8 <= 10 -10 <= x#9 <= 10 -10 <= x#10 <= 10 0 <= __c1_1_xp_0@a <= 10 0 <= __c1_1_xm_1@b <= 10 0 <= __c1_1_bp_2@c <= 1 0 <= __c1_1_bm_3@d <= 1 0 <= __c1_1_re_4@e <= 1 0 <= __c2_1_xp_5@f <= 10 0 <= __c2_1_xm_6@10 <= 10 0 <= __c2_1_bp_7@11 <= 1 0 <= __c2_1_bm_8@12 <= 1 0 <= __c2_1_re_9@13 <= 1 0 <= __c3_1_xp_10@14 <= 10 0 <= __c3_1_xm_11@15 <= 10 0 <= __c3_1_bp_12@16 <= 1 0 <= __c3_1_bm_13@17 <= 1 0 <= __c3_1_re_14@18 <= 1 0 <= __c4_1_xp_15@19 <= 10 0 <= __c4_1_xm_16@1a <= 10 0 <= __c4_1_bp_17@1b <= 1 0 <= __c4_1_bm_18@1c <= 1 0 <= __c4_1_re_19@1d <= 1 0 <= __c5_1_xp_20@1e <= 10 0 <= __c5_1_xm_21@1f <= 10 0 <= __c5_1_bp_22@20 <= 1 0 <= __c5_1_bm_23@21 <= 1 0 <= __c5_1_re_24@22 <= 1 0 <= __c6_1_xp_25@23 <= 10 0 <= __c6_1_xm_26@24 <= 10 0 <= __c6_1_bp_27@25 <= 1 0 <= __c6_1_bm_28@26 <= 1 0 <= __c6_1_re_29@27 <= 1 0 <= __c7_1_xp_30@28 <= 20 0 <= __c7_1_xm_31@29 <= 20 0 <= __c7_1_bp_32@2a <= 1 0 <= __c7_1_re_33@2b <= 20 0 <= __c7_1_xp_34@2c <= 15 0 <= __c7_1_xm_35@2d <= 5 0 <= __c7_1_bp_36@2e <= 1 0 <= __c7_1_bm_37@2f <= 1 0 <= __c7_1_re_38@30 <= 1 0 <= __c7_2_xp_39@31 <= 20 0 <= __c7_2_xm_40@32 <= 20 0 <= __c7_2_bp_41@33 <= 1 0 <= __c7_2_re_42@34 <= 20 0 <= __c7_2_xp_43@35 <= 15 0 <= __c7_2_xm_44@36 <= 5 0 <= __c7_2_bp_45@37 <= 1 0 <= __c7_2_bm_46@38 <= 1 0 <= __c7_2_re_47@39 <= 1 0 <= __c7_3_xp_48@3a <= 20 0 <= __c7_3_xm_49@3b <= 20 0 <= __c7_3_bp_50@3c <= 1 0 <= __c7_3_re_51@3d <= 20 0 <= __c7_3_xp_52@3e <= 15 0 <= __c7_3_xm_53@3f <= 5 0 <= __c7_3_bp_54@40 <= 1 0 <= __c7_3_bm_55@41 <= 1 0 <= __c7_3_re_56@42 <= 1 0 <= __c8_1_xp_57@43 <= 33 0 <= __c8_1_xm_58@44 <= 47 0 <= __c8_1_bp_59@45 <= 1 0 <= __c8_1_bm_60@46 <= 1 0 <= __c8_1_re_61@47 <= 1 0 <= __c9_1_xp_62@48 <= 9 0 <= __c9_1_xm_63@49 <= 11 0 <= __c9_1_bp_64@4a <= 1 0 <= __c9_1_bm_65@4b <= 1 0 <= __c9_1_re_66@4c <= 1 0 <= __c9_1_xp_67@4d <= 5 0 <= __c9_1_xm_68@4e <= 15 0 <= __c9_1_bp_69@4f <= 1 0 <= __c9_1_bm_70@50 <= 1 0 <= __c9_1_re_71@51 <= 1 0 <= __c9_1_re_72@52 <= 1 0 <= __c9_1_xp_73@53 <= 8 0 <= __c9_1_xm_74@54 <= 12 0 <= __c9_1_bp_75@55 <= 1 0 <= __c9_1_bm_76@56 <= 1 0 <= __c9_1_re_77@57 <= 1 0 <= __c9_1_xp_78@58 <= 2 0 <= __c9_1_xm_79@59 <= 18 0 <= __c9_1_bp_80@5a <= 1 0 <= __c9_1_bm_81@5b <= 1 0 <= __c9_1_re_82@5c <= 1 0 <= __c9_1_re_83@5d <= 1 0 <= __c9_1_re_84@5e <= 1 0 <= __c10_1_xp_85@5f <= 9 0 <= __c10_1_xm_86@60 <= 11 0 <= __c10_1_bp_87@61 <= 1 0 <= __c10_1_bm_88@62 <= 1 0 <= __c10_1_re_89@63 <= 1 0 <= __c10_1_xp_90@64 <= 5 0 <= __c10_1_xm_91@65 <= 15 0 <= __c10_1_bp_92@66 <= 1 0 <= __c10_1_bm_93@67 <= 1 0 <= __c10_1_re_94@68 <= 1 0 <= __c10_1_re_95@69 <= 1 0 <= __c10_1_re_96@6a <= 1 0 <= __c11_1_xp_97@6b <= 9 0 <= __c11_1_xm_98@6c <= 11 0 <= __c11_1_bp_99@6d <= 1 0 <= __c11_1_bm_10@6e <= 1 0 <= __c11_1_re_10@6f <= 1 General x#1 x#2 x#3 x#4 x#5 x#6 x#7 x#8 x#9 x#10 __c1_1_xp_0@a __c1_1_xm_1@b __c1_1_bp_2@c __c1_1_bm_3@d __c1_1_re_4@e __c2_1_xp_5@f __c2_1_xm_6@10 __c2_1_bp_7@11 __c2_1_bm_8@12 __c2_1_re_9@13 __c3_1_xp_10@14 __c3_1_xm_11@15 __c3_1_bp_12@16 __c3_1_bm_13@17 __c3_1_re_14@18 __c4_1_xp_15@19 __c4_1_xm_16@1a __c4_1_bp_17@1b __c4_1_bm_18@1c __c4_1_re_19@1d __c5_1_xp_20@1e __c5_1_xm_21@1f __c5_1_bp_22@20 __c5_1_bm_23@21 __c5_1_re_24@22 __c6_1_xp_25@23 __c6_1_xm_26@24 __c6_1_bp_27@25 __c6_1_bm_28@26 __c6_1_re_29@27 __c7_1_xp_30@28 __c7_1_xm_31@29 __c7_1_bp_32@2a __c7_1_re_33@2b __c7_1_xp_34@2c __c7_1_xm_35@2d __c7_1_bp_36@2e __c7_1_bm_37@2f __c7_1_re_38@30 __c7_2_xp_39@31 __c7_2_xm_40@32 __c7_2_bp_41@33 __c7_2_re_42@34 __c7_2_xp_43@35 __c7_2_xm_44@36 __c7_2_bp_45@37 __c7_2_bm_46@38 __c7_2_re_47@39 __c7_3_xp_48@3a __c7_3_xm_49@3b __c7_3_bp_50@3c __c7_3_re_51@3d __c7_3_xp_52@3e __c7_3_xm_53@3f __c7_3_bp_54@40 __c7_3_bm_55@41 __c7_3_re_56@42 __c8_1_xp_57@43 __c8_1_xm_58@44 __c8_1_bp_59@45 __c8_1_bm_60@46 __c8_1_re_61@47 __c9_1_xp_62@48 __c9_1_xm_63@49 __c9_1_bp_64@4a __c9_1_bm_65@4b __c9_1_re_66@4c __c9_1_xp_67@4d __c9_1_xm_68@4e __c9_1_bp_69@4f __c9_1_bm_70@50 __c9_1_re_71@51 __c9_1_re_72@52 __c9_1_xp_73@53 __c9_1_xm_74@54 __c9_1_bp_75@55 __c9_1_bm_76@56 __c9_1_re_77@57 __c9_1_xp_78@58 __c9_1_xm_79@59 __c9_1_bp_80@5a __c9_1_bm_81@5b __c9_1_re_82@5c __c9_1_re_83@5d __c9_1_re_84@5e __c10_1_xp_85@5f __c10_1_xm_86@60 __c10_1_bp_87@61 __c10_1_bm_88@62 __c10_1_re_89@63 __c10_1_xp_90@64 __c10_1_xm_91@65 __c10_1_bp_92@66 __c10_1_bm_93@67 __c10_1_re_94@68 __c10_1_re_95@69 __c10_1_re_96@6a __c11_1_xp_97@6b __c11_1_xm_98@6c __c11_1_bp_99@6d __c11_1_bm_10@6e __c11_1_re_10@6f End zimpl-3.3.6/check/sos.tbl.ref0000644001417200060250000000000013301553023015675 0ustar bzfschlooptimizimpl-3.3.6/check/sos.lp.ref0000644001417200060250000000251713301553023015546 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set A := { 1 to 5 }; \ set B := { 1 to 5 }; \ var x[A]; \ var y[B]; \ param a[A] := <1> 1, <2> 2, <3> 3, <4> 4, <5> 5 ; \ sos c01: type1: x[1]; \ sos c02: type1 priority 10 : x[1] + 2 * x[2]; \ sos c03: type2: x[1] * 3 + 2 * x[2] + x[1]; \ sos c04: type1 priority 60 : 3 * (x[1] + 2 * x[2]) + x[4]; \ sos c05: type2 : sum in A do i * x[i]; \ sos c06: type1 : - x[5] - 2 * sum in A with i > 3 do i * x[i] + x[3] * 2 + 90 * y[1] + 62 * y[2]; \ sos c07: type2 : sum in A: a[i] * x[i]; \ sos c08: forall in A do type2 priority 5 : sum in B: (a[j] + i) * y[j]; \Problem name: sos.zpl Minimize Objective: Subject to Bounds 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf 0 <= y#1 <= +inf 0 <= y#2 <= +inf 0 <= y#3 <= +inf 0 <= y#4 <= +inf 0 <= y#5 <= +inf SOS c01_1:S1:: x#1:1 c02_1:S1:: x#2:2 x#1:1 c03_1:S2:: x#1:1 x#2:2 x#1:3 c04_1:S1:: x#4:1 x#2:6 x#1:3 c05_1:S2:: x#5:5 x#4:4 x#3:3 x#2:2 x#1:1 c06_1:S1:: y#2:62 y#1:90 x#3:2 x#5:-10 x#4:-8 x#5:-1 c07_1:S2:: x#5:5 x#4:4 x#3:3 x#2:2 x#1:1 c08_1:S2:: y#5:6 y#4:5 y#3:4 y#2:3 y#1:2 c08_2:S2:: y#5:7 y#4:6 y#3:5 y#2:4 y#1:3 c08_3:S2:: y#5:8 y#4:7 y#3:6 y#2:5 y#1:4 c08_4:S2:: y#5:9 y#4:8 y#3:7 y#2:6 y#1:5 c08_5:S2:: y#5:10 y#4:9 y#3:8 y#2:7 y#1:6 End zimpl-3.3.6/check/subto.zpl0000644001417200060250000000701513301553023015513 0ustar bzfschlooptimi# $Id: subto.zpl,v 1.12 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: subto.zpl */ #* Name....: Subto test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2001-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set A := { 1 to 5 }; set B := { 1 to 5 }; var x[A]; var y[B]; param a[A] := <1> 1, <2> 2, <3> 3, <4> 4, <5> 5 ; minimize cost: x[1] + x[2] + 17; subto c01: x[1] <= 5; subto c02: x[1] + x[2] <= 5; subto c03: 3 * x[1] <= 5; subto c04: x[1] * 3 <= 5; subto c05: 3 * x[1] + x[2] <= 5; subto c06: x[1] + 3 * x[2] <= 5; subto c07: 3 * (x[1] + x[2]) <= 5; subto c08: (x[1] + x[2]) * 3 <= 5; subto c10: sum in A do x[i] <= 5; subto c11: sum in A do 3 * x[i] <= 5; subto c12: sum in A do (x[i] * 4) <= 5; subto c13: (sum in A do x[i]) * 4 <= 5; subto c14: sum in A do x[i] * 4 <= 5; subto c15: 5 * sum in A do x[i] <= 5; subto c16: - x[5] - 2 * sum in A with i < 3 do x[i] + x[4] * 3 <= 5; subto c17: + x[5] - 2 * sum in A with i < 3 do 7 * x[i] + 3 * x[4] <= 5; subto c18: + x[5] - 1.5 * (2 * sum in A with i < 3 do 7 * x[i] + 3 * x[4]) <= 5; subto c20: sum in A : x[i] + sum in B : y[j] >= 2; subto c21: 6 * (sum in A : x[i] + sum in B : y[j]) >= 2; subto c22: sum in A : sum in B with j > i : (x[i] + y[j]) >= 2; subto c23: 3 * sum in A : 2 * sum in B with j > i : (x[i] + y[j]) + 77 * x[5] <= 88; subto c24: forall in A : sum in B : 3 * x[j] * 4 <= 17; subto c25: y[1] + sum in A : x[i] + y[2] <= 15; subto c26: y[1] + sum in A : (x[i] + y[2]) <= 15; subto c27: y[1] + (sum in A : x[i] + y[2]) <= 15; subto c30: x[1] <= y[2]; subto c31: sum in A : x[i] -5 <= sum in B : y[j] + 12; subto c32: x[1] + 5 >= x[2]; subto c33: 5 <= x[1]; subto c34: x[1] >= 5 + x[2]; subto c35: 5 + x[1] >= x[2]; subto c36: 5 <= 6; subto c37: -5 + x[1] >= x[2]; subto c38: x[1] == a[1] + sum in A do a[i]*x[i]; subto c39: x[1] == a[1] + sum in A do x[i]*a[i]; subto c40: x[1] == a[1] + 2 * sum in A do 2*a[i]*x[i]*3 + 4; subto c41: x[1] == a[1] + 2 * sum in A do 2*x[i]*a[i]*3 + 4; subto c42: 17 <= x[1] + x[2] <= 23; subto c43: 13 * a[1] / 2 >= sum in A do a[i]*x[i] + 6 >= a[2]; subto c44: sum in A with i < 5: 10^-i * x[i] >= 5, scale; subto c45: sum in A : 0.0001 * x[i] >= 6, scale; zimpl-3.3.6/check/condit.lp.ref0000644001417200060250000000310713301553023016216 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1 to 5 }; \ var x; \ var y; \ var z[ in I] >= if (i >= 3) then -infinity else 10 end <= 100 ; \ subto c1: forall in I do if i > 2 then if i > 4 then i * x <= 5 and i * 2 * y <= 10 else \ i * z[i] <= 7 end end; \ subto c2: forall in I do if i > 2 then if i > 4 then i * x <= 5 and i * 2 * y <= 10 end els \ e i * z[i] <= 7 end; \ subto c3: forall in I: if (i > 3) then if (i == 4) then z[1] + z[2] == i else z[2] + z[3] == i \ end and z[3] + z[4] == i and z[4] + z[5] == i else if (i == 2) then z[1] + z[2] == i + 10 \ else z[2] + z[3] == i + 10 end and z[3] + z[4] == i + 10 and z[4] + z[5] == i + 10 end; \Problem name: condit.zpl Minimize Objective: Subject to c1_1: +3 z#3 <= 7 c1_2: +4 z#4 <= 7 c1_3: +5 x <= 5 c1_4: +10 y <= 10 c2_1: + z#1 <= 7 c2_2: +2 z#2 <= 7 c2_3: +5 x <= 5 c2_4: +10 y <= 10 c3_1: + z#3 + z#2 = 11 c3_2: + z#4 + z#3 = 11 c3_3: + z#5 + z#4 = 11 c3_4: + z#2 + z#1 = 12 c3_5: + z#4 + z#3 = 12 c3_6: + z#5 + z#4 = 12 c3_7: + z#3 + z#2 = 13 c3_8: + z#4 + z#3 = 13 c3_9: + z#5 + z#4 = 13 c3_10: + z#2 + z#1 = 4 c3_11: + z#4 + z#3 = 4 c3_12: + z#5 + z#4 = 4 c3_13: + z#3 + z#2 = 5 c3_14: + z#4 + z#3 = 5 c3_15: + z#5 + z#4 = 5 Bounds 0 <= x <= +inf 0 <= y <= +inf 10 <= z#1 <= 100 10 <= z#2 <= 100 -inf <= z#3 <= 100 -inf <= z#4 <= 100 -inf <= z#5 <= 100 End zimpl-3.3.6/check/var.tbl.ref0000644001417200060250000000405413301553023015676 0ustar bzfschlooptimizimpl v 0 a1 "a1" zimpl v 1 b1 "b1" zimpl v 2 b2 "b2" zimpl v 3 b3 "b3" zimpl v 4 b4 "b4" zimpl v 5 c1 "c1" zimpl v 6 c2 "c2" zimpl v 7 c3 "c3" zimpl v 8 c4 "c4" zimpl v 9 c5 "c5" zimpl v 10 d1 "d1" zimpl v 11 d2 "d2" zimpl v 12 d3 "d3" zimpl v 13 d4 "d4" zimpl v 14 e1 "e1" zimpl v 15 e2 "e2" zimpl v 16 e3 "e3" zimpl v 17 e4 "e4" zimpl v 18 e5 "e5" zimpl v 19 e6 "e6" zimpl v 20 e7 "e7" zimpl v 21 x#1 "x#1" zimpl v 22 x#2 "x#2" zimpl v 23 x#3 "x#3" zimpl v 24 x#4 "x#4" zimpl v 25 x#5 "x#5" zimpl v 26 y#1 "y#1" zimpl v 27 y#2 "y#2" zimpl v 28 y#3 "y#3" zimpl v 29 y#4 "y#4" zimpl v 30 y#5 "y#5" zimpl v 31 z#_5@1f "z#-5" zimpl v 32 z#_4@20 "z#-4" zimpl v 33 z#_3@21 "z#-3" zimpl v 34 z#_2@22 "z#-2" zimpl v 35 z#_1@23 "z#-1" zimpl v 36 w#1 "w#1" zimpl v 37 w#2 "w#2" zimpl v 38 w#3 "w#3" zimpl v 39 w#4 "w#4" zimpl v 40 w#5 "w#5" zimpl c 0 ca1_1 "ca1_1" 0.0000000000000000e+00 zimpl c 1 cb1_1 "cb1_1" 0.0000000000000000e+00 zimpl c 2 cc1_1 "cc1_1" 0.0000000000000000e+00 zimpl c 3 cd1_1 "cd1_1" 0.0000000000000000e+00 zimpl c 4 ce1_1 "ce1_1" 0.0000000000000000e+00 zimpl c 5 cy_1 "cy_1" 0.0000000000000000e+00 zimpl c 6 cd_1 "cd_1" 0.0000000000000000e+00 zimpl c 7 cf_1 "cf_1" 0.0000000000000000e+00 zimpl-3.3.6/check/presol.tbl.ref0000644001417200060250000000360213301553023016410 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 y#1 "y#1" zimpl v 6 y#2 "y#2" zimpl v 7 y#3 "y#3" zimpl v 8 y#4 "y#4" zimpl v 9 y#5 "y#5" zimpl v 10 z#1 "z#1" zimpl v 11 z#2 "z#2" zimpl v 12 z#3 "z#3" zimpl v 13 z#4 "z#4" zimpl v 14 z#5 "z#5" zimpl v 15 w#1 "w#1" 1.0000000000000000e+00 zimpl v 16 w#2 "w#2" zimpl v 17 w#3 "w#3" 1.0000000000000000e+00 zimpl v 18 w#4 "w#4" zimpl v 19 w#5 "w#5" 1.0000000000000000e+00 zimpl c 0 c1 "c1" 0.0000000000000000e+00 zimpl c 1 c2 "c2" 0.0000000000000000e+00 zimpl c 2 c3 "c3" 0.0000000000000000e+00 zimpl c 3 c4 "c4" 0.0000000000000000e+00 zimpl c 4 c5 "c5" 0.0000000000000000e+00 zimpl c 5 c6 "c6" 0.0000000000000000e+00 zimpl c 6 c7 "c7" 0.0000000000000000e+00 zimpl c 7 c8 "c8" 0.0000000000000000e+00 zimpl c 8 c9 "c9" 0.0000000000000000e+00 zimpl c 9 c10 "c10" 0.0000000000000000e+00 zimpl c 10 c11 "c11" 0.0000000000000000e+00 zimpl c 11 c12 "c12" 0.0000000000000000e+00 zimpl c 12 c13 "c13" 0.0000000000000000e+00 zimpl c 13 c14 "c14" 0.0000000000000000e+00 zimpl c 14 c15 "c15" 0.0000000000000000e+00 zimpl c 15 c16 "c16" 0.0000000000000000e+00 zimpl c 16 c17 "c17" 0.0000000000000000e+00 zimpl c 17 c18 "c18" 0.0000000000000000e+00 zimpl c 18 c19 "c19" 0.0000000000000000e+00 zimpl c 19 c20 "c20" 0.0000000000000000e+00 zimpl c 20 c21 "c21" 0.0000000000000000e+00 zimpl c 21 c22 "c22" 0.0000000000000000e+00 zimpl c 22 c23 "c23" 0.0000000000000000e+00 zimpl-3.3.6/check/read.zpl0000644001417200060250000000566413301553023015302 0ustar bzfschlooptimi# $Id: read.zpl,v 1.7 2011/09/16 09:11:49 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: read.zpl * #* Name....: read test * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2007-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set A := { read "read1.dat" as "<1s>" }; set B := { read "read1.dat" as "<1n>" skip 5 use 100 comment "#" }; set C := { read "read2.dat" as "<1s,2n,3n,4n,5n,6n,7n,8n,9n,10n,11n,12n,13s>" comment "#[" }; set D := { read "read3.dat" as "<3n>" match " [0-9][0-9][0-9] " comment "ABCDEF" }; set E := {1..8}*{1..10000}; param a1 := card(A); param b1 := sum in B : b; param c1 := sum in C : (length(a) + b + c + d + e + f + g + h + i + j / (k + l + length(m))); param d1 := sum in D : d; param mat[E] := read "read1.dat" as "n+" comment "#"; param e1 := (sum <1,i> in E : mat[1,i]) / (sum <5,i> in E : mat[5,i]) + (sum in { 2, 3, 4, 6, 7, 8 }*{1..10000} : mat[i,j]); param fix := read "read1.dat" as "2n" comment "#" use 1; var x real >= -infinity <= infinity; subto c1: x <= a1; # <= 20001 subto c2: x >= b1 - sum in { 21 .. 417 by 4 } : i; # >= 0 subto c3: e1 * x <= c1; subto c4: fix * x == d1; set F := { read "read3.dat" as "<1n>" match "Z" }; # empty set I := {}; set J := I * I; set K := I + { 1..6 }; set L := I * { 7..9 }; set M := I + { <"a","b">, <"c","d"> }; set N := { in {} : i }; do check card(F) == 0; do check card(I) == 0; do check card(K) == 6; do check card(L) == 0; do check card(M) == 2; do check card(N) == 0; var z[I]; subto c5: forall in I do z[i] == z[j]; subto c6: forall in F do z[i] == z[j]; subto c7: forall in J with i > j do z[i] == z[j]; subto c8: forall in L do z[i] == z[j]; zimpl-3.3.6/check/vinst.tbl.ref0000644001417200060250000003772013301553023016257 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 x#6 "x#6" zimpl v 6 x#7 "x#7" zimpl v 7 x#8 "x#8" zimpl v 8 x#9 "x#9" zimpl v 9 x#10 "x#10" zimpl v 10 __c1_1_xp_0@a "@@c1_1_xp_0" zimpl v 11 __c1_1_xm_1@b "@@c1_1_xm_1" zimpl v 12 __c1_1_bp_2@c "@@c1_1_bp_2" zimpl v 13 __c1_1_bm_3@d "@@c1_1_bm_3" zimpl v 14 __c1_1_re_4@e "@@c1_1_re_4" zimpl v 15 __c2_1_xp_5@f "@@c2_1_xp_5" zimpl v 16 __c2_1_xm_6@10 "@@c2_1_xm_6" zimpl v 17 __c2_1_bp_7@11 "@@c2_1_bp_7" zimpl v 18 __c2_1_bm_8@12 "@@c2_1_bm_8" zimpl v 19 __c2_1_re_9@13 "@@c2_1_re_9" zimpl v 20 __c3_1_xp_10@14 "@@c3_1_xp_10" zimpl v 21 __c3_1_xm_11@15 "@@c3_1_xm_11" zimpl v 22 __c3_1_bp_12@16 "@@c3_1_bp_12" zimpl v 23 __c3_1_bm_13@17 "@@c3_1_bm_13" zimpl v 24 __c3_1_re_14@18 "@@c3_1_re_14" zimpl v 25 __c4_1_xp_15@19 "@@c4_1_xp_15" zimpl v 26 __c4_1_xm_16@1a "@@c4_1_xm_16" zimpl v 27 __c4_1_bp_17@1b "@@c4_1_bp_17" zimpl v 28 __c4_1_bm_18@1c "@@c4_1_bm_18" zimpl v 29 __c4_1_re_19@1d "@@c4_1_re_19" zimpl v 30 __c5_1_xp_20@1e "@@c5_1_xp_20" zimpl v 31 __c5_1_xm_21@1f "@@c5_1_xm_21" zimpl v 32 __c5_1_bp_22@20 "@@c5_1_bp_22" zimpl v 33 __c5_1_bm_23@21 "@@c5_1_bm_23" zimpl v 34 __c5_1_re_24@22 "@@c5_1_re_24" zimpl v 35 __c6_1_xp_25@23 "@@c6_1_xp_25" zimpl v 36 __c6_1_xm_26@24 "@@c6_1_xm_26" zimpl v 37 __c6_1_bp_27@25 "@@c6_1_bp_27" zimpl v 38 __c6_1_bm_28@26 "@@c6_1_bm_28" zimpl v 39 __c6_1_re_29@27 "@@c6_1_re_29" zimpl v 40 __c7_1_xp_30@28 "@@c7_1_xp_30" zimpl v 41 __c7_1_xm_31@29 "@@c7_1_xm_31" zimpl v 42 __c7_1_bp_32@2a "@@c7_1_bp_32" zimpl v 43 __c7_1_re_33@2b "@@c7_1_re_33" zimpl v 44 __c7_1_xp_34@2c "@@c7_1_xp_34" zimpl v 45 __c7_1_xm_35@2d "@@c7_1_xm_35" zimpl v 46 __c7_1_bp_36@2e "@@c7_1_bp_36" zimpl v 47 __c7_1_bm_37@2f "@@c7_1_bm_37" zimpl v 48 __c7_1_re_38@30 "@@c7_1_re_38" zimpl v 49 __c7_2_xp_39@31 "@@c7_2_xp_39" zimpl v 50 __c7_2_xm_40@32 "@@c7_2_xm_40" zimpl v 51 __c7_2_bp_41@33 "@@c7_2_bp_41" zimpl v 52 __c7_2_re_42@34 "@@c7_2_re_42" zimpl v 53 __c7_2_xp_43@35 "@@c7_2_xp_43" zimpl v 54 __c7_2_xm_44@36 "@@c7_2_xm_44" zimpl v 55 __c7_2_bp_45@37 "@@c7_2_bp_45" zimpl v 56 __c7_2_bm_46@38 "@@c7_2_bm_46" zimpl v 57 __c7_2_re_47@39 "@@c7_2_re_47" zimpl v 58 __c7_3_xp_48@3a "@@c7_3_xp_48" zimpl v 59 __c7_3_xm_49@3b "@@c7_3_xm_49" zimpl v 60 __c7_3_bp_50@3c "@@c7_3_bp_50" zimpl v 61 __c7_3_re_51@3d "@@c7_3_re_51" zimpl v 62 __c7_3_xp_52@3e "@@c7_3_xp_52" zimpl v 63 __c7_3_xm_53@3f "@@c7_3_xm_53" zimpl v 64 __c7_3_bp_54@40 "@@c7_3_bp_54" zimpl v 65 __c7_3_bm_55@41 "@@c7_3_bm_55" zimpl v 66 __c7_3_re_56@42 "@@c7_3_re_56" zimpl v 67 __c8_1_xp_57@43 "@@c8_1_xp_57" zimpl v 68 __c8_1_xm_58@44 "@@c8_1_xm_58" zimpl v 69 __c8_1_bp_59@45 "@@c8_1_bp_59" zimpl v 70 __c8_1_bm_60@46 "@@c8_1_bm_60" zimpl v 71 __c8_1_re_61@47 "@@c8_1_re_61" zimpl v 72 __c9_1_xp_62@48 "@@c9_1_xp_62" zimpl v 73 __c9_1_xm_63@49 "@@c9_1_xm_63" zimpl v 74 __c9_1_bp_64@4a "@@c9_1_bp_64" zimpl v 75 __c9_1_bm_65@4b "@@c9_1_bm_65" zimpl v 76 __c9_1_re_66@4c "@@c9_1_re_66" zimpl v 77 __c9_1_xp_67@4d "@@c9_1_xp_67" zimpl v 78 __c9_1_xm_68@4e "@@c9_1_xm_68" zimpl v 79 __c9_1_bp_69@4f "@@c9_1_bp_69" zimpl v 80 __c9_1_bm_70@50 "@@c9_1_bm_70" zimpl v 81 __c9_1_re_71@51 "@@c9_1_re_71" zimpl v 82 __c9_1_re_72@52 "@@c9_1_re_72" zimpl v 83 __c9_1_xp_73@53 "@@c9_1_xp_73" zimpl v 84 __c9_1_xm_74@54 "@@c9_1_xm_74" zimpl v 85 __c9_1_bp_75@55 "@@c9_1_bp_75" zimpl v 86 __c9_1_bm_76@56 "@@c9_1_bm_76" zimpl v 87 __c9_1_re_77@57 "@@c9_1_re_77" zimpl v 88 __c9_1_xp_78@58 "@@c9_1_xp_78" zimpl v 89 __c9_1_xm_79@59 "@@c9_1_xm_79" zimpl v 90 __c9_1_bp_80@5a "@@c9_1_bp_80" zimpl v 91 __c9_1_bm_81@5b "@@c9_1_bm_81" zimpl v 92 __c9_1_re_82@5c "@@c9_1_re_82" zimpl v 93 __c9_1_re_83@5d "@@c9_1_re_83" zimpl v 94 __c9_1_re_84@5e "@@c9_1_re_84" zimpl v 95 __c10_1_xp_85@5f "@@c10_1_xp_85" zimpl v 96 __c10_1_xm_86@60 "@@c10_1_xm_86" zimpl v 97 __c10_1_bp_87@61 "@@c10_1_bp_87" zimpl v 98 __c10_1_bm_88@62 "@@c10_1_bm_88" zimpl v 99 __c10_1_re_89@63 "@@c10_1_re_89" zimpl v 100 __c10_1_xp_90@64 "@@c10_1_xp_90" zimpl v 101 __c10_1_xm_91@65 "@@c10_1_xm_91" zimpl v 102 __c10_1_bp_92@66 "@@c10_1_bp_92" zimpl v 103 __c10_1_bm_93@67 "@@c10_1_bm_93" zimpl v 104 __c10_1_re_94@68 "@@c10_1_re_94" zimpl v 105 __c10_1_re_95@69 "@@c10_1_re_95" zimpl v 106 __c10_1_re_96@6a "@@c10_1_re_96" zimpl v 107 __c11_1_xp_97@6b "@@c11_1_xp_97" zimpl v 108 __c11_1_xm_98@6c "@@c11_1_xm_98" zimpl v 109 __c11_1_bp_99@6d "@@c11_1_bp_99" zimpl v 110 __c11_1_bm_10@6e "@@c11_1_bm_100" zimpl v 111 __c11_1_re_10@6f "@@c11_1_re_101" zimpl c 0 c1_1_a_0 "c1_1_a_0" 0.0000000000000000e+00 zimpl c 1 c1_1_b_1 "c1_1_b_1" 0.0000000000000000e+00 zimpl c 2 c1_1_c_2 "c1_1_c_2" 0.0000000000000000e+00 zimpl c 3 c1_1_d_3 "c1_1_d_3" 0.0000000000000000e+00 zimpl c 4 c1_1_e_4 "c1_1_e_4" 0.0000000000000000e+00 zimpl c 5 c1_1_f_5 "c1_1_f_5" 0.0000000000000000e+00 zimpl c 6 c1_1_g_6 "c1_1_g_6" 0.0000000000000000e+00 zimpl c 7 c1_1_t_r "c1_1_t_r" 0.0000000000000000e+00 zimpl c 8 c1_1_t_l "c1_1_t_l" 0.0000000000000000e+00 zimpl c 9 c2_1_a_7 "c2_1_a_7" 0.0000000000000000e+00 zimpl c 10 c2_1_b_8 "c2_1_b_8" 0.0000000000000000e+00 zimpl c 11 c2_1_c_9 "c2_1_c_9" 0.0000000000000000e+00 zimpl c 12 c2_1_d_10 "c2_1_d_10" 0.0000000000000000e+00 zimpl c 13 c2_1_e_11 "c2_1_e_11" 0.0000000000000000e+00 zimpl c 14 c2_1_f_12 "c2_1_f_12" 0.0000000000000000e+00 zimpl c 15 c2_1_g_13 "c2_1_g_13" 0.0000000000000000e+00 zimpl c 16 c2_1_t_r "c2_1_t_r" 0.0000000000000000e+00 zimpl c 17 c2_1_t_l "c2_1_t_l" 0.0000000000000000e+00 zimpl c 18 c3_1_a_14 "c3_1_a_14" 0.0000000000000000e+00 zimpl c 19 c3_1_b_15 "c3_1_b_15" 0.0000000000000000e+00 zimpl c 20 c3_1_c_16 "c3_1_c_16" 0.0000000000000000e+00 zimpl c 21 c3_1_d_17 "c3_1_d_17" 0.0000000000000000e+00 zimpl c 22 c3_1_e_18 "c3_1_e_18" 0.0000000000000000e+00 zimpl c 23 c3_1_f_19 "c3_1_f_19" 0.0000000000000000e+00 zimpl c 24 c3_1_t_r "c3_1_t_r" 0.0000000000000000e+00 zimpl c 25 c3_1_t_l "c3_1_t_l" 0.0000000000000000e+00 zimpl c 26 c4_1_a_20 "c4_1_a_20" 0.0000000000000000e+00 zimpl c 27 c4_1_b_21 "c4_1_b_21" 0.0000000000000000e+00 zimpl c 28 c4_1_c_22 "c4_1_c_22" 0.0000000000000000e+00 zimpl c 29 c4_1_d_23 "c4_1_d_23" 0.0000000000000000e+00 zimpl c 30 c4_1_e_24 "c4_1_e_24" 0.0000000000000000e+00 zimpl c 31 c4_1_f_25 "c4_1_f_25" 0.0000000000000000e+00 zimpl c 32 c4_1_t_r "c4_1_t_r" 0.0000000000000000e+00 zimpl c 33 c4_1_t_l "c4_1_t_l" 0.0000000000000000e+00 zimpl c 34 c5_1_a_26 "c5_1_a_26" 0.0000000000000000e+00 zimpl c 35 c5_1_b_27 "c5_1_b_27" 0.0000000000000000e+00 zimpl c 36 c5_1_c_28 "c5_1_c_28" 0.0000000000000000e+00 zimpl c 37 c5_1_d_29 "c5_1_d_29" 0.0000000000000000e+00 zimpl c 38 c5_1_e_30 "c5_1_e_30" 0.0000000000000000e+00 zimpl c 39 c5_1_f_31 "c5_1_f_31" 0.0000000000000000e+00 zimpl c 40 c5_1_g_32 "c5_1_g_32" 0.0000000000000000e+00 zimpl c 41 c5_1_t_r "c5_1_t_r" 0.0000000000000000e+00 zimpl c 42 c5_1_t_l "c5_1_t_l" 0.0000000000000000e+00 zimpl c 43 c6_1_a_33 "c6_1_a_33" 0.0000000000000000e+00 zimpl c 44 c6_1_b_34 "c6_1_b_34" 0.0000000000000000e+00 zimpl c 45 c6_1_c_35 "c6_1_c_35" 0.0000000000000000e+00 zimpl c 46 c6_1_d_36 "c6_1_d_36" 0.0000000000000000e+00 zimpl c 47 c6_1_e_37 "c6_1_e_37" 0.0000000000000000e+00 zimpl c 48 c6_1_f_38 "c6_1_f_38" 0.0000000000000000e+00 zimpl c 49 c6_1_g_39 "c6_1_g_39" 0.0000000000000000e+00 zimpl c 50 c6_1_t_r "c6_1_t_r" 0.0000000000000000e+00 zimpl c 51 c6_1_t_l "c6_1_t_l" 0.0000000000000000e+00 zimpl c 52 c7_1_a_40 "c7_1_a_40" 0.0000000000000000e+00 zimpl c 53 c7_1_b_41 "c7_1_b_41" 0.0000000000000000e+00 zimpl c 54 c7_1_c_42 "c7_1_c_42" 0.0000000000000000e+00 zimpl c 55 c7_1_d_43 "c7_1_d_43" 0.0000000000000000e+00 zimpl c 56 c7_1_a_44 "c7_1_a_44" 0.0000000000000000e+00 zimpl c 57 c7_1_b_45 "c7_1_b_45" 0.0000000000000000e+00 zimpl c 58 c7_1_c_46 "c7_1_c_46" 0.0000000000000000e+00 zimpl c 59 c7_1_d_47 "c7_1_d_47" 0.0000000000000000e+00 zimpl c 60 c7_1_e_48 "c7_1_e_48" 0.0000000000000000e+00 zimpl c 61 c7_1_f_49 "c7_1_f_49" 0.0000000000000000e+00 zimpl c 62 c7_1_g_50 "c7_1_g_50" 0.0000000000000000e+00 zimpl c 63 c7_1_t_l "c7_1_t_l" 0.0000000000000000e+00 zimpl c 64 c7_1_e_l "c7_1_e_l" 0.0000000000000000e+00 zimpl c 65 c7_2_a_51 "c7_2_a_51" 0.0000000000000000e+00 zimpl c 66 c7_2_b_52 "c7_2_b_52" 0.0000000000000000e+00 zimpl c 67 c7_2_c_53 "c7_2_c_53" 0.0000000000000000e+00 zimpl c 68 c7_2_d_54 "c7_2_d_54" 0.0000000000000000e+00 zimpl c 69 c7_2_a_55 "c7_2_a_55" 0.0000000000000000e+00 zimpl c 70 c7_2_b_56 "c7_2_b_56" 0.0000000000000000e+00 zimpl c 71 c7_2_c_57 "c7_2_c_57" 0.0000000000000000e+00 zimpl c 72 c7_2_d_58 "c7_2_d_58" 0.0000000000000000e+00 zimpl c 73 c7_2_e_59 "c7_2_e_59" 0.0000000000000000e+00 zimpl c 74 c7_2_f_60 "c7_2_f_60" 0.0000000000000000e+00 zimpl c 75 c7_2_g_61 "c7_2_g_61" 0.0000000000000000e+00 zimpl c 76 c7_2_t_l "c7_2_t_l" 0.0000000000000000e+00 zimpl c 77 c7_2_e_l "c7_2_e_l" 0.0000000000000000e+00 zimpl c 78 c7_3_a_62 "c7_3_a_62" 0.0000000000000000e+00 zimpl c 79 c7_3_b_63 "c7_3_b_63" 0.0000000000000000e+00 zimpl c 80 c7_3_c_64 "c7_3_c_64" 0.0000000000000000e+00 zimpl c 81 c7_3_d_65 "c7_3_d_65" 0.0000000000000000e+00 zimpl c 82 c7_3_a_66 "c7_3_a_66" 0.0000000000000000e+00 zimpl c 83 c7_3_b_67 "c7_3_b_67" 0.0000000000000000e+00 zimpl c 84 c7_3_c_68 "c7_3_c_68" 0.0000000000000000e+00 zimpl c 85 c7_3_d_69 "c7_3_d_69" 0.0000000000000000e+00 zimpl c 86 c7_3_e_70 "c7_3_e_70" 0.0000000000000000e+00 zimpl c 87 c7_3_f_71 "c7_3_f_71" 0.0000000000000000e+00 zimpl c 88 c7_3_g_72 "c7_3_g_72" 0.0000000000000000e+00 zimpl c 89 c7_3_t_l "c7_3_t_l" 0.0000000000000000e+00 zimpl c 90 c7_3_e_l "c7_3_e_l" 0.0000000000000000e+00 zimpl c 91 c8_1_a_73 "c8_1_a_73" 0.0000000000000000e+00 zimpl c 92 c8_1_b_74 "c8_1_b_74" 0.0000000000000000e+00 zimpl c 93 c8_1_c_75 "c8_1_c_75" 0.0000000000000000e+00 zimpl c 94 c8_1_d_76 "c8_1_d_76" 0.0000000000000000e+00 zimpl c 95 c8_1_e_77 "c8_1_e_77" 0.0000000000000000e+00 zimpl c 96 c8_1_f_78 "c8_1_f_78" 0.0000000000000000e+00 zimpl c 97 c8_1_t_r "c8_1_t_r" 0.0000000000000000e+00 zimpl c 98 c8_1_e_l "c8_1_e_l" 0.0000000000000000e+00 zimpl c 99 c9_1_a_79 "c9_1_a_79" 0.0000000000000000e+00 zimpl c 100 c9_1_b_80 "c9_1_b_80" 0.0000000000000000e+00 zimpl c 101 c9_1_c_81 "c9_1_c_81" 0.0000000000000000e+00 zimpl c 102 c9_1_d_82 "c9_1_d_82" 0.0000000000000000e+00 zimpl c 103 c9_1_e_83 "c9_1_e_83" 0.0000000000000000e+00 zimpl c 104 c9_1_f_84 "c9_1_f_84" 0.0000000000000000e+00 zimpl c 105 c9_1_a_85 "c9_1_a_85" 0.0000000000000000e+00 zimpl c 106 c9_1_b_86 "c9_1_b_86" 0.0000000000000000e+00 zimpl c 107 c9_1_c_87 "c9_1_c_87" 0.0000000000000000e+00 zimpl c 108 c9_1_d_88 "c9_1_d_88" 0.0000000000000000e+00 zimpl c 109 c9_1_e_89 "c9_1_e_89" 0.0000000000000000e+00 zimpl c 110 c9_1_f_90 "c9_1_f_90" 0.0000000000000000e+00 zimpl c 111 c9_1_g_91 "c9_1_g_91" 0.0000000000000000e+00 zimpl c 112 c9_1_a_92 "c9_1_a_92" 0.0000000000000000e+00 zimpl c 113 c9_1_b_93 "c9_1_b_93" 0.0000000000000000e+00 zimpl c 114 c9_1_c_94 "c9_1_c_94" 0.0000000000000000e+00 zimpl c 115 c9_1_a_95 "c9_1_a_95" 0.0000000000000000e+00 zimpl c 116 c9_1_b_96 "c9_1_b_96" 0.0000000000000000e+00 zimpl c 117 c9_1_c_97 "c9_1_c_97" 0.0000000000000000e+00 zimpl c 118 c9_1_d_98 "c9_1_d_98" 0.0000000000000000e+00 zimpl c 119 c9_1_e_99 "c9_1_e_99" 0.0000000000000000e+00 zimpl c 120 c9_1_f_100 "c9_1_f_100" 0.0000000000000000e+00 zimpl c 121 c9_1_a_101 "c9_1_a_101" 0.0000000000000000e+00 zimpl c 122 c9_1_b_102 "c9_1_b_102" 0.0000000000000000e+00 zimpl c 123 c9_1_c_103 "c9_1_c_103" 0.0000000000000000e+00 zimpl c 124 c9_1_d_104 "c9_1_d_104" 0.0000000000000000e+00 zimpl c 125 c9_1_e_105 "c9_1_e_105" 0.0000000000000000e+00 zimpl c 126 c9_1_f_106 "c9_1_f_106" 0.0000000000000000e+00 zimpl c 127 c9_1_g_107 "c9_1_g_107" 0.0000000000000000e+00 zimpl c 128 c9_1_a_108 "c9_1_a_108" 0.0000000000000000e+00 zimpl c 129 c9_1_b_109 "c9_1_b_109" 0.0000000000000000e+00 zimpl c 130 c9_1_c_110 "c9_1_c_110" 0.0000000000000000e+00 zimpl c 131 c9_1_a_111 "c9_1_a_111" 0.0000000000000000e+00 zimpl c 132 c9_1_b_112 "c9_1_b_112" 0.0000000000000000e+00 zimpl c 133 c9_1_c_113 "c9_1_c_113" 0.0000000000000000e+00 zimpl c 134 c9_1_t_r "c9_1_t_r" 0.0000000000000000e+00 zimpl c 135 c9_1_t_l "c9_1_t_l" 0.0000000000000000e+00 zimpl c 136 c10_1_a_114 "c10_1_a_114" 0.0000000000000000e+00 zimpl c 137 c10_1_b_115 "c10_1_b_115" 0.0000000000000000e+00 zimpl c 138 c10_1_c_116 "c10_1_c_116" 0.0000000000000000e+00 zimpl c 139 c10_1_d_117 "c10_1_d_117" 0.0000000000000000e+00 zimpl c 140 c10_1_e_118 "c10_1_e_118" 0.0000000000000000e+00 zimpl c 141 c10_1_f_119 "c10_1_f_119" 0.0000000000000000e+00 zimpl c 142 c10_1_a_120 "c10_1_a_120" 0.0000000000000000e+00 zimpl c 143 c10_1_b_121 "c10_1_b_121" 0.0000000000000000e+00 zimpl c 144 c10_1_c_122 "c10_1_c_122" 0.0000000000000000e+00 zimpl c 145 c10_1_d_123 "c10_1_d_123" 0.0000000000000000e+00 zimpl c 146 c10_1_e_124 "c10_1_e_124" 0.0000000000000000e+00 zimpl c 147 c10_1_f_125 "c10_1_f_125" 0.0000000000000000e+00 zimpl c 148 c10_1_a_126 "c10_1_a_126" 0.0000000000000000e+00 zimpl c 149 c10_1_a_127 "c10_1_a_127" 0.0000000000000000e+00 zimpl c 150 c10_1_b_128 "c10_1_b_128" 0.0000000000000000e+00 zimpl c 151 c10_1_c_129 "c10_1_c_129" 0.0000000000000000e+00 zimpl c 152 c10_1_d_130 "c10_1_d_130" 0.0000000000000000e+00 zimpl c 153 c10_1_t_r "c10_1_t_r" 0.0000000000000000e+00 zimpl c 154 c11_1_a_131 "c11_1_a_131" 0.0000000000000000e+00 zimpl c 155 c11_1_b_132 "c11_1_b_132" 0.0000000000000000e+00 zimpl c 156 c11_1_c_133 "c11_1_c_133" 0.0000000000000000e+00 zimpl c 157 c11_1_d_134 "c11_1_d_134" 0.0000000000000000e+00 zimpl c 158 c11_1_e_135 "c11_1_e_135" 0.0000000000000000e+00 zimpl c 159 c11_1_f_136 "c11_1_f_136" 0.0000000000000000e+00 zimpl c 160 c11_1_t "c11_1_t" 0.0000000000000000e+00 zimpl c 161 c11_1_f "c11_1_f" 0.0000000000000000e+00 zimpl-3.3.6/check/var.zpl0000644001417200060250000000466313301553023015155 0ustar bzfschlooptimi# $Id: var.zpl,v 1.10 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: var.zpl */ #* Name....: Var test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2001-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1 .. 5 }; set K := { -5 .. -1 }; var a1; var b1 real; var b2 real <= 10; var b3 real >= 5/2; var b4 real >= 2 <= 7/3; var c1 <= 10; var c2 >= -5/4; var c3 >= 2 <= 7; var c4 <= infinity; var c5 >= -infinity <= -30; var d1 binary; var d2 binary priority 50; var d3 binary startval 1; var d4 binary priority 100 startval 1; var e1 integer; var e2 integer >= -5; var e3 integer <= 10; var e4 integer >= -2 <= 6; var e5 integer >= 5 priority 10; var e6 integer <= 10 startval 5; var e7 integer >= 2 <= 6 priority 15 startval 4; var x[I]; var y[ in I] integer >= -5 * i <= 6 * i priority 3 startval i; var z[K]; var w[ in I] <= if (i <= 3) then i else infinity end; subto ca1: a1 + sum in I : x[i] >= 17; subto cb1: b1 + b2 + b3 + b4 <= 99; subto cc1: c1 + c2 + c3 + c4 + c5 <= 77; subto cd1: d1 + d2 + d3 + d4>= 2; subto ce1: e1 + e2 + e3 + e4 + e5 + e6 + e7 <= 18; subto cy: sum in I : y[i] == -6; subto cd: sum in K : k * z[k] <= -8; subto cf: sum in I : w[i] <= 17; zimpl-3.3.6/check/set.zpl0000644001417200060250000001107213303714344015157 0ustar bzfschlooptimi# $Id: set.zpl,v 1.17 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: set.zpl */ #* Name....: Set test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2006-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set A := { "a", "b", "c" }; set B := { 1, 2, 3 }; set B2:= argmax in B : abs(3-b); set C := { 1 to 4 }; set C2:= argmin in C : c; set D := { 7 .. 8 by 2 }; set E2:= (B + C) * A; set E := argmax(card(E2)) in E2 : i; # does nothing ;-) set F := B inter C; set G := { 1 .. 5 } union D without B; set H := C symdiff { <1>, <2>, <7>, <8> }; set J := { in G with g > 3 }; set K := { <"a", 1>, <"b", 7>, <"c", 9> }; set L[B] := <1> { "a", "b" }, <2> { "c", "d", "e" }, <3> { "f" }; set LU := union in B : L[b]; set L2[] := <1> { "a", "b" }, <2> { "c", "d", "e" }, <3> { "f" }; set L2I := inter in B : (L2[b] + A); set M[ in D] := { <3 * i, 7, "d">, }; set N[ in C * B with i > j] := { i + j, i - j, i * j }; set P[] := powerset(C); set Q[] := subsets(C, 3); set R := indexset(P); set S := R; set T := { 1 to 9 } * { 10 to 19 } * { "A", "B" }; set T2 := argmin(15) in T : j - 2 * i; set U := proj(T2, <3,1>); set V := { in A*B with a == "a" or a == "b" }; set W[ in B] := { in C with c <= i }; set X := { in { in C with k > 2 } with i mod 2 == 0 }; # { 4 } set Y := { -2 .. -2 } + { -4 .. -8 by 2 } + { -16 .. -10 by -2 } + { 7 .. 1 } ; set Y2 := { -2 to -2 } + { -4 to -8 by 2 } + { -16 to -10 by -2 } + { 7 to 1 } ; set Z := C * (A * B); set AA := { in B : 2 * b }; set BB := { in A*B : }; set CC := { 1 .. 1000 } * { 1001 .. 2000 } * { "A", "B", "C", "D", "E"} * { 2001 .. 9999 } * { 1 .. 100 }; set DD := { <2,2000,"D",3000,e> in CC }; var a[L2I]; var b[B]; var c[C]; var d[D]; var e[E]; var f[F]; var g[G]; var h[H]; var j[J]; var k[K]; var l[LU]; var m[M[7]]; var n[{ 1 .. 100 }]; var p[C]; var q[C]; var u[U]; var v[V]; var xabcdefghijklmno[X]; var y[Y]; var y2[Y2]; var z[Z]; var aa[AA]; var bb[BB]; var dd[DD]; subto a1: sum in L2I : a[i] >= 0; subto b1: sum in B : b[i] >= ord(B2,1,1); subto c1: sum in C : c[i] >= ord(C2,1,1); subto d1: sum in D : d[i] >= 0; subto e1: sum in E : e[i1,i2] >= 0; subto f1: sum in F : f[i] >= 0; subto g1: sum in G : g[i] >= 0; subto h1: sum in H : h[i] >= 0; subto j1: sum in J : j[i] >= 0; subto k1: sum in K : k[i1,i2] >= 0; subto l1: forall in indexset(L) with L[i1] == L2[i1] do sum in L[i1] : l[i2] >= 0; subto m1: sum in M[7] : m[i1,i2,i3] >= 0; subto n1: forall in indexset(N) do sum in N[i1,i2] : n[i3] >= 0; subto p1: forall in R do sum in P[i1] : p[i2] >= 0; subto q1: forall in indexset(Q) do sum in Q[i1] : q[i2] >= 0; subto u1: forall in U do u[i1,i2] >= 0; subto v1: sum in V : v[i1,i2] >= 0; subto w1: forall in B do sum in W[i]: n[w] >= 0; subto x1: sum in X : xabcdefghijklmno[i] >= 0; subto y1: sum in Y : y[i] >= 0; subto y2: sum in Y2 : y2[i] >= 2; subto z1: sum in {1..card(E)} do e[ord(E,i,1),ord(E,i,2)] >= 5; subto z2: sum in Z with a1 > "b" do z[c1,a1,b1] <= 8; subto aa1: sum in AA : aa[i] >= 5; subto bb1: sum in BB : bb[i1,i2] <= 3; subto dd1: b[1] == card(DD); zimpl-3.3.6/check/define.lp.ref0000644001417200060250000000332113301553023016166 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1..5 } * { 4..7}; \ var x[I]; \ defnumb dist(a,b) := a*a + b*b; \ subto c1: sum in I do dist(i,j) * x[i,j] >= 0; \ defnumb ack(i,j) := if i == 0 then j + 1 else if j == 0 then ack(i - 1, 1) else \ ack(i - 1, ack(i, j - 1)) end end; \ subto c2: ack(3,3) * x[ack(1,3),ack(2,2)] >= 0; \ set K := { 1..10 }; \ var y[K]; \ defbool goodone(a,b) := a > b; \ defset bigger(i) := { in K with goodone(j,i) }; \ subto c3: sum in bigger(5) : y[i] >= 0; \ set G := { 1..3 }; \ set H := { "hallo", "tach", "moin" }; \ param greet[G] := <1> "hallo", <2> "tach", <3> "moin"; \ var z[H]; \ defstrg greeting(m) := greet[(m + 1) mod card(G)]; \ subto c4: z[greeting(1)] + z[greeting(3)] >= 0; \Problem name: define.zpl Minimize Objective: Subject to c1_1: +74 x#5#7 +61 x#5#6 +50 x#5#5 +41 x#5#4 +65 x#4#7 +52 x#4#6 +41 x#4#5 +32 x#4#4 +58 x#3#7 +45 x#3#6 +34 x#3#5 +25 x#3#4 +53 x#2#7 +40 x#2#6 +29 x#2#5 +20 x#2#4 +50 x#1#7 +37 x#1#6 +26 x#1#5 +17 x#1#4 >= 0 c2_1: +61 x#5#7 >= 0 c3_1: + y#10 + y#9 + y#8 + y#7 + y#6 >= 0 c4_1: + z$hallo + z$tach >= 0 Bounds 0 <= x#1#4 <= +inf 0 <= x#1#5 <= +inf 0 <= x#1#6 <= +inf 0 <= x#1#7 <= +inf 0 <= x#2#4 <= +inf 0 <= x#2#5 <= +inf 0 <= x#2#6 <= +inf 0 <= x#2#7 <= +inf 0 <= x#3#4 <= +inf 0 <= x#3#5 <= +inf 0 <= x#3#6 <= +inf 0 <= x#3#7 <= +inf 0 <= x#4#4 <= +inf 0 <= x#4#5 <= +inf 0 <= x#4#6 <= +inf 0 <= x#4#7 <= +inf 0 <= x#5#4 <= +inf 0 <= x#5#5 <= +inf 0 <= x#5#6 <= +inf 0 <= x#5#7 <= +inf 0 <= y#6 <= +inf 0 <= y#7 <= +inf 0 <= y#8 <= +inf 0 <= y#9 <= +inf 0 <= y#10 <= +inf 0 <= z$hallo <= +inf 0 <= z$tach <= +inf End zimpl-3.3.6/check/read3.dat0000644001417200060250000000037313301553023015320 0ustar bzfschlooptimiA $Id: read3.dat,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ A 656 99 B 982 99 C 474 99 D 454 99 E 565 99 F 676 99 G 982 1 H 383 2 F 123 99 U 094 7 O 45 99 I 405 3 K 069 4 K 493 5 O 66 99 P 7887 99 N 59559 99 E 4 99 I 056 6 E 6 99 E 7 99 E 8 99 F EOF zimpl-3.3.6/check/read.lp.ref0000644001417200060250000000341013301553023015646 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set A := { read "read1.dat" as "<1s>" }; \ set B := { read "read1.dat" as "<1n>" skip 5 use 100 comment "#" }; \ set C := { read "read2.dat" as "<1s,2n,3n,4n,5n,6n,7n,8n,9n,10n,11n,12n,13s>" comment "#[" }; \ set D := { read "read3.dat" as "<3n>" match " [0-9][0-9][0-9] " comment "ABCDEF" }; \ set E := {1..8}*{1..10000}; \ param a1 := card(A); \ param b1 := sum in B : b; \ param c1 := sum in C : (length(a) + b + c + d + e + f + g + h + i + j / (k + l + length(m))); \ param d1 := sum in D : d; \ param mat[E] := read "read1.dat" as "n+" comment "#"; \ param e1 := (sum <1,i> in E : mat[1,i]) / (sum <5,i> in E : mat[5,i]) + (sum in { 2, 3, 4, 6, 7, 8 } \ *{1..10000} : mat[i,j]); \ param fix := read "read1.dat" as "2n" comment "#" use 1; \ var x real >= -infinity <= infinity; \ subto c1: x <= a1; \ subto c2: x >= b1 - sum in { 21 .. 417 by 4 } : i; \ subto c3: e1 * x <= c1; \ subto c4: fix * x == d1; \ set F := { read "read3.dat" as "<1n>" match "Z" }; \ set I := {}; \ set J := I * I; \ set K := I + { 1..6 }; \ set L := I * { 7..9 }; \ set M := I + { <"a","b">, <"c","d"> }; \ set N := { in {} : i }; \ do check card(F) == 0; \ do check card(I) == 0; \ do check card(K) == 6; \ do check card(L) == 0; \ do check card(M) == 2; \ do check card(N) == 0; \ var z[I]; \ subto c5: forall in I do z[i] == z[j]; \ subto c6: forall in F do z[i] == z[j]; \ subto c7: forall in J with i > j do z[i] == z[j]; \ subto c8: forall in L do z[i] == z[j]; \Problem name: read.zpl Minimize Objective: Subject to c1_1: + x <= 20001 c2_1: + x >= 0 c3_1: +2700030000.11112 x <= 355175050622.139 c4_1: +2 x = 28 Bounds -inf <= x <= +inf End zimpl-3.3.6/check/metaio.out.ref0000644001417200060250000000051713301553023016412 0ustar bzfschlooptimi5 List: |1|{<"Berlin">,<"Frankfurt">,<"Leipzig">,<"Heidelberg">,<"Karlsruhe">} Multi: |2|{<"Berlin","Frankfurt">,<"Berlin","Leipzig">,<"Berlin","Heidelberg">,<"Berlin","Karlsruhe">,<"Frankfurt","Leipzig">,<"Frankfurt","Heidelberg">,<"Frankfurt","Karlsruhe">,<"Heidelberg","Leipzig">,<"Heidelberg","Karlsruhe">,<"Karlsruhe","Leipzig">} zimpl-3.3.6/check/print.out.ref0000644001417200060250000000141613301553023016267 0ustar bzfschlooptimiTest: 3 Product: |2|{<1,"a">,<1,"b">,<1,"c">,<2,"a">,<2,"b">,<2,"c">,<3,"a">,<3,"b">,<3,"c">,<4,"a">,<4,"b">,<4,"c">,<5,"a">,<5,"b">,<5,"c">} <1,"a"> <1,"b"> <1,"c"> <2,"a"> <2,"b"> <2,"c"> <3,"a"> <3,"b"> <3,"c"> <4,"a"> <4,"b"> <4,"c"> <5,"a"> <5,"b"> <5,"c"> Name : x Type : Var Index : Range: |1|{<1>,<2>,<3>,<4>,<5>} Entries: 0: <1> -> "x#1" real [-oo,oo] 1: <2> -> "x#2" real [-oo,20] 2: <3> -> "x#3" real [6,oo] 3: <4> -> "x#4" real [6,20] 4: <5> -> "x#5" real [6,oo] Name : y Type : Var Index : Pseudo: |0|{<>} Entries: 0: <> -> "y" integer [0,1] Name : z Type : Var Index : Pseudo: |0|{<>} Entries: 0: <> -> "z" integer [-5,7] Name : w Type : Var Index : Pseudo: |0|{<>} Entries: 0: <> -> "w" implicit integer [8,oo] unknown zimpl-3.3.6/check/minlp.zpl0000644001417200060250000000422513301553023015476 0ustar bzfschlooptimi# $Id: minlp.zpl,v 1.4 2012/11/23 13:03:43 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: minlp.zpl * #* Name....: MINLP test * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2011-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1 to 9 }; var x[I] binary; var y binary; var z binary; var a; var b; subto c1: x[1]^2 == x[1]^1 + x[1]^0; subto c2: 2 * x[1] * 3 * x[2] * 5 * x[3] <= 77; subto c3: y * z == y^2 * z^3 * 4; subto c4: sum in I : i*x[i]^i == 8; subto c5: (y + 5) * (z + 2) == 3; subto c6: (4/2 * x[1] + 2/3 * x[2])^2 == 9; subto c7: log(a) == 5; subto c8: sqrt(a) == 2; subto c9: exp(a) == 3; subto c10: ln(a) <= 7; subto c11: sin(a) <= 8; subto c12: cos(a) <= 9; subto c13: tan(a) >= 2; subto c14: abs(a) >= 6; subto c15: sgn(a) == z; subto c16: pow(a, 2/3) >= 7; subto c17: sgnpow(a, 12^2) <= 200; subto c18: 16 * log(sqrt(exp(ln(sin(cos(tan(abs(sgn(pow(sgnpow(a, -2), -3)))))))))) == 99; subto c19: (2-exp(3*a-5))^2 == b; zimpl-3.3.6/check/expr.zpl0000644001417200060250000000655213301553023015342 0ustar bzfschlooptimi# $Id: expr.zpl,v 1.20 2011/07/31 15:10:45 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: expr.zpl * #* Name....: Expression test * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2006-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1 .. 10 }; set S := { "moin", "hello", "ho" }; param a[ in I] := i + 3; var x[I]; subto c01: (3 * a[1] + 5) * x[1] >= a[2] * 2 - 4; subto c02: a[1] mod 2 >= x[1] / 7; subto c03: a[1] div 2 >= x[1] - 3; subto c04: card(I) * x[1] >= abs(a[1] - a[2]); subto c05: a[1]^a[2] <= x[1] * 3!; subto c06: floor(a[1] / 3) <= x[2] * ceil(a[2] / 7); subto c07: -exp(ln(a[4])) >= -x[3]; subto c08: x[3] + log(10) == -6; subto c09: (min in I : a[i]) * x[1] >= x[2] * max in I : a[i]; subto c10: x[1] * if sum in I : a[i] > 20 then 2 else -4 end >= 5; subto c11: a[1]^-a[2] >= x[2] / 100; subto c12: x[3] >= min(6, 2/7, a[1], a[3]); subto c13: x[3] <= max(6, 2/7, a[1], a[3]); subto c14: sum in {1..10} do i mod 8 * x[i] >= 5; subto c15: sum in I do sgn(5 - i) * x[i] >= 3; subto c16: sum in I do random(10,20) * x[i] >= random(50,1000); subto c17: x[min(I)] <= x[max(I)]; subto c18: (prod in I with i < 4 : a[i]) * x[1] <= 800; subto c19: sum in S with substr(s, 1, 1) == "o" : x[length(s)] >= 2; subto c20: sum in S with substr(s, -1, 1) == "o" : x[length(s)] >= 2; subto c21: sum in S with substr(s, 2, 2) == "ll" : x[length(s)] <= 2; subto c22: sum in S with substr(s, -6, 5) != "" : x[length(s)] <= 2; subto c23: sum in { 4, 9, 16 }: x[sqrt(i)] >= 5; do check 2 + 3 * 4 == 2 + (3 * 4); do check -2^2 == -4; do check +10^-2 == 1/100; do check -3! == -1 * 2 * 3; do check 3 * 2! == 3 * 2; do check 2^3^4 == 2^(3^4); do check 3!^-2^4*5 == ((2 * 3)^(-2 * 2 * 2 * 2)) * 5; do check 4 + 1 / 3 * sum in I : 3 * i == sum in I : i + 4; do check 3 * min(I) == min in I : i * 3; do check ord(S,1,1) + ord(S,2,1) + ord(S,3,1) == "moinhelloho"; # do check round(3.5) == 4; do check round(3.499999999999) == 3; do check round(0.00000000001) == 0; do check round(0.5) == 1; # do check round(-3.5) == -4; do check round(-3.499999999999) == -3; do check round(-0.00000000001) == 0; do check round(-0.5) == -1; zimpl-3.3.6/check/presol.mps.ref0000644001417200060250000001251213301553023016426 0ustar bzfschlooptimi* This file was automatically generated by Zimpl * set I := { 1..5 }; * var x[ in I] binary startval i mod 2; * var y[ in I] integer <= 2 * i priority i * 10 startval istart; * var z[ in I] <= 4 * i; * var w[ in I] integer >= 1 <= if i mod 2 == 1 then 1 else 2 end; * minimize cost: sum in I : -(x[i] + y[i]); * subto c1: forall in I: x[i] <= 1; * subto c2: y[1] + y[2] == 6; * subto c3: sum in I: x[i] <= 3; * subto c4: sum in I: y[i] == 15; * subto c5: forall in I: y[i] >= z[i]; * subto c6: forall in I with i < 3: x[i] <= z[i]; * subto c7: forall in I with i >= 3: 1 <= x[i] + y[i] <= 100; * subto c8: forall in I with i mod 2 == 1: -3 * w[i] == -3; * subto c9: w[2] >= 2; * subto c10: w[4] <= 2; NAME presol.z ROWS N OBJECTIV L c1 L c2 L c3 L c4 L c5 E c6 L c7 E c8 G c9 G c10 G c11 G c12 G c13 L c14 L c15 E c16 E c17 E c18 E c19 E c20 E c21 G c22 L c23 COLUMNS MARK0000 'MARKER' 'INTORG' x#1 OBJECTIV -1 x#1 c14 1 x#1 c7 1 x#1 c1 1 x#2 OBJECTIV -1 x#2 c15 1 x#2 c7 1 x#2 c2 1 x#3 OBJECTIV -1 x#3 c16 1 x#3 c7 1 x#3 c3 1 x#4 OBJECTIV -1 x#4 c17 1 x#4 c7 1 x#4 c4 1 x#5 OBJECTIV -1 x#5 c18 1 x#5 c7 1 x#5 c5 1 y#1 OBJECTIV -1 y#1 c9 1 y#1 c8 1 y#1 c6 1 y#2 OBJECTIV -1 y#2 c10 1 y#2 c8 1 y#2 c6 1 y#3 OBJECTIV -1 y#3 c16 1 y#3 c11 1 y#3 c8 1 y#4 OBJECTIV -1 y#4 c17 1 y#4 c12 1 y#4 c8 1 y#5 OBJECTIV -1 y#5 c18 1 y#5 c13 1 y#5 c8 1 w#1 c19 -3 w#2 c22 1 w#3 c20 -3 w#4 c23 1 w#5 c21 -3 MARK0001 'MARKER' 'INTEND' z#1 c14 -1 z#1 c9 -1 z#2 c15 -1 z#2 c10 -1 z#3 c11 -1 z#4 c12 -1 z#5 c13 -1 RHS RHS c1 1 RHS c2 1 RHS c3 1 RHS c4 1 RHS c5 1 RHS c6 6 RHS c7 3 RHS c8 15 RHS c16 1 RHS c17 1 RHS c18 1 RHS c19 -3 RHS c20 -3 RHS c21 -3 RHS c22 2 RHS c23 2 RANGES RNG c16 99 RNG c17 99 RNG c18 99 BOUNDS LO BOUND x#1 0 UP BOUND x#1 1 LO BOUND x#2 0 UP BOUND x#2 1 LO BOUND x#3 0 UP BOUND x#3 1 LO BOUND x#4 0 UP BOUND x#4 1 LO BOUND x#5 0 UP BOUND x#5 1 LO BOUND y#1 0 UP BOUND y#1 2 LO BOUND y#2 0 UP BOUND y#2 4 LO BOUND y#3 0 UP BOUND y#3 6 LO BOUND y#4 0 UP BOUND y#4 8 LO BOUND y#5 0 UP BOUND y#5 10 LO BOUND z#1 0 UP BOUND z#1 4 LO BOUND z#2 0 UP BOUND z#2 8 LO BOUND z#3 0 UP BOUND z#3 12 LO BOUND z#4 0 UP BOUND z#4 16 LO BOUND z#5 0 UP BOUND z#5 20 FX BOUND w#1 1 LO BOUND w#2 1 UP BOUND w#2 2 FX BOUND w#3 1 LO BOUND w#4 1 UP BOUND w#4 2 FX BOUND w#5 1 ENDATA zimpl-3.3.6/check/set.tbl.ref0000644001417200060250000001760213303714344015713 0ustar bzfschlooptimizimpl v 0 a$a "a$a" zimpl v 1 a$b "a$b" zimpl v 2 a$c "a$c" zimpl v 3 b#1 "b#1" zimpl v 4 b#2 "b#2" zimpl v 5 b#3 "b#3" zimpl v 6 c#1 "c#1" zimpl v 7 c#2 "c#2" zimpl v 8 c#3 "c#3" zimpl v 9 c#4 "c#4" zimpl v 10 d#7 "d#7" zimpl v 11 e#1$a "e#1$a" zimpl v 12 e#1$b "e#1$b" zimpl v 13 e#1$c "e#1$c" zimpl v 14 e#2$a "e#2$a" zimpl v 15 e#2$b "e#2$b" zimpl v 16 e#2$c "e#2$c" zimpl v 17 e#3$a "e#3$a" zimpl v 18 e#3$b "e#3$b" zimpl v 19 e#3$c "e#3$c" zimpl v 20 e#4$a "e#4$a" zimpl v 21 e#4$b "e#4$b" zimpl v 22 e#4$c "e#4$c" zimpl v 23 f#1 "f#1" zimpl v 24 f#2 "f#2" zimpl v 25 f#3 "f#3" zimpl v 26 g#4 "g#4" zimpl v 27 g#5 "g#5" zimpl v 28 g#7 "g#7" zimpl v 29 h#3 "h#3" zimpl v 30 h#4 "h#4" zimpl v 31 h#7 "h#7" zimpl v 32 h#8 "h#8" zimpl v 33 j#4 "j#4" zimpl v 34 j#5 "j#5" zimpl v 35 j#7 "j#7" zimpl v 36 k$a#1 "k$a#1" zimpl v 37 k$b#7 "k$b#7" zimpl v 38 k$c#9 "k$c#9" zimpl v 39 l$a "l$a" zimpl v 40 l$b "l$b" zimpl v 41 l$c "l$c" zimpl v 42 l$d "l$d" zimpl v 43 l$e "l$e" zimpl v 44 l$f "l$f" zimpl v 45 m#21#7$d "m#21#7$d" zimpl v 46 m#9#9$c "m#9#9$c" zimpl v 47 n#1 "n#1" zimpl v 48 n#2 "n#2" zimpl v 49 n#3 "n#3" zimpl v 50 n#4 "n#4" zimpl v 51 n#5 "n#5" zimpl v 52 n#6 "n#6" zimpl v 53 n#7 "n#7" zimpl v 54 n#8 "n#8" zimpl v 58 n#12 "n#12" zimpl v 147 p#1 "p#1" zimpl v 148 p#2 "p#2" zimpl v 149 p#3 "p#3" zimpl v 150 p#4 "p#4" zimpl v 151 q#1 "q#1" zimpl v 152 q#2 "q#2" zimpl v 153 q#3 "q#3" zimpl v 154 q#4 "q#4" zimpl v 155 u$B#7 "u$B#7" zimpl v 156 u$B#8 "u$B#8" zimpl v 157 u$B#9 "u$B#9" zimpl v 158 u$A#8 "u$A#8" zimpl v 159 u$A#9 "u$A#9" zimpl v 160 v$a#2 "v$a#2" zimpl v 161 v$b#2 "v$b#2" zimpl v 162 xabcdefghijkl@a2 "xabcdefghijklmno#4" zimpl v 163 y#_2@a3 "y#-2" zimpl v 164 y#_4@a4 "y#-4" zimpl v 165 y#_6@a5 "y#-6" zimpl v 166 y#_8@a6 "y#-8" zimpl v 167 y#_16@a7 "y#-16" zimpl v 168 y#_14@a8 "y#-14" zimpl v 169 y#_12@a9 "y#-12" zimpl v 170 y#_10@aa "y#-10" zimpl v 171 y#7 "y#7" zimpl v 172 y#6 "y#6" zimpl v 173 y#5 "y#5" zimpl v 174 y#4 "y#4" zimpl v 175 y#3 "y#3" zimpl v 176 y#2 "y#2" zimpl v 177 y#1 "y#1" zimpl v 178 y2#_2@b2 "y2#-2" zimpl v 185 z#1$c#1 "z#1$c#1" zimpl v 186 z#1$c#2 "z#1$c#2" zimpl v 187 z#1$c#3 "z#1$c#3" zimpl v 194 z#2$c#1 "z#2$c#1" zimpl v 195 z#2$c#2 "z#2$c#2" zimpl v 196 z#2$c#3 "z#2$c#3" zimpl v 203 z#3$c#1 "z#3$c#1" zimpl v 204 z#3$c#2 "z#3$c#2" zimpl v 205 z#3$c#3 "z#3$c#3" zimpl v 212 z#4$c#1 "z#4$c#1" zimpl v 213 z#4$c#2 "z#4$c#2" zimpl v 214 z#4$c#3 "z#4$c#3" zimpl v 215 aa#2 "aa#2" zimpl v 216 aa#4 "aa#4" zimpl v 217 aa#6 "aa#6" zimpl v 218 bb$a#3 "bb$a#3" zimpl v 219 bb$a#4 "bb$a#4" zimpl v 220 bb$a#5 "bb$a#5" zimpl v 221 bb$b#3 "bb$b#3" zimpl v 222 bb$b#4 "bb$b#4" zimpl v 223 bb$b#5 "bb$b#5" zimpl v 224 bb$c#3 "bb$c#3" zimpl v 225 bb$c#4 "bb$c#4" zimpl v 226 bb$c#5 "bb$c#5" zimpl c 0 a1_1 "a1_1" 0.0000000000000000e+00 zimpl c 1 b1_1 "b1_1" 0.0000000000000000e+00 zimpl c 2 c1_1 "c1_1" 0.0000000000000000e+00 zimpl c 3 d1_1 "d1_1" 0.0000000000000000e+00 zimpl c 4 e1_1 "e1_1" 0.0000000000000000e+00 zimpl c 5 f1_1 "f1_1" 0.0000000000000000e+00 zimpl c 6 g1_1 "g1_1" 0.0000000000000000e+00 zimpl c 7 h1_1 "h1_1" 0.0000000000000000e+00 zimpl c 8 j1_1 "j1_1" 0.0000000000000000e+00 zimpl c 9 k1_1 "k1_1" 0.0000000000000000e+00 zimpl c 10 l1_1 "l1_1" 0.0000000000000000e+00 zimpl c 11 l1_2 "l1_2" 0.0000000000000000e+00 zimpl c 12 l1_3 "l1_3" 0.0000000000000000e+00 zimpl c 13 m1_1 "m1_1" 0.0000000000000000e+00 zimpl c 14 n1_1 "n1_1" 0.0000000000000000e+00 zimpl c 15 n1_2 "n1_2" 0.0000000000000000e+00 zimpl c 16 n1_3 "n1_3" 0.0000000000000000e+00 zimpl c 17 n1_4 "n1_4" 0.0000000000000000e+00 zimpl c 18 n1_5 "n1_5" 0.0000000000000000e+00 zimpl c 19 n1_6 "n1_6" 0.0000000000000000e+00 zimpl c 20 p1_1 "p1_1" 0.0000000000000000e+00 zimpl c 21 p1_2 "p1_2" 0.0000000000000000e+00 zimpl c 22 p1_3 "p1_3" 0.0000000000000000e+00 zimpl c 23 p1_4 "p1_4" 0.0000000000000000e+00 zimpl c 24 p1_5 "p1_5" 0.0000000000000000e+00 zimpl c 25 p1_6 "p1_6" 0.0000000000000000e+00 zimpl c 26 p1_7 "p1_7" 0.0000000000000000e+00 zimpl c 27 p1_8 "p1_8" 0.0000000000000000e+00 zimpl c 28 p1_9 "p1_9" 0.0000000000000000e+00 zimpl c 29 p1_10 "p1_10" 0.0000000000000000e+00 zimpl c 30 p1_11 "p1_11" 0.0000000000000000e+00 zimpl c 31 p1_12 "p1_12" 0.0000000000000000e+00 zimpl c 32 p1_13 "p1_13" 0.0000000000000000e+00 zimpl c 33 p1_14 "p1_14" 0.0000000000000000e+00 zimpl c 34 p1_15 "p1_15" 0.0000000000000000e+00 zimpl c 35 q1_1 "q1_1" 0.0000000000000000e+00 zimpl c 36 q1_2 "q1_2" 0.0000000000000000e+00 zimpl c 37 q1_3 "q1_3" 0.0000000000000000e+00 zimpl c 38 q1_4 "q1_4" 0.0000000000000000e+00 zimpl c 39 u1_1 "u1_1" 0.0000000000000000e+00 zimpl c 40 u1_2 "u1_2" 0.0000000000000000e+00 zimpl c 41 u1_3 "u1_3" 0.0000000000000000e+00 zimpl c 42 u1_4 "u1_4" 0.0000000000000000e+00 zimpl c 43 u1_5 "u1_5" 0.0000000000000000e+00 zimpl c 44 v1_1 "v1_1" 0.0000000000000000e+00 zimpl c 45 w1_1 "w1_1" 0.0000000000000000e+00 zimpl c 46 w1_2 "w1_2" 0.0000000000000000e+00 zimpl c 47 w1_3 "w1_3" 0.0000000000000000e+00 zimpl c 48 x1_1 "x1_1" 0.0000000000000000e+00 zimpl c 49 y1_1 "y1_1" 0.0000000000000000e+00 zimpl c 50 y2_1 "y2_1" 0.0000000000000000e+00 zimpl c 51 z1_1 "z1_1" 0.0000000000000000e+00 zimpl c 52 z2_1 "z2_1" 0.0000000000000000e+00 zimpl c 53 aa1_1 "aa1_1" 0.0000000000000000e+00 zimpl c 54 bb1_1 "bb1_1" 0.0000000000000000e+00 zimpl c 55 dd1_1 "dd1_1" 0.0000000000000000e+00 zimpl-3.3.6/check/check.sh0000644001417200060250000001446313301553023015246 0ustar bzfschlooptimi#!/bin/sh # $Id: check.sh,v 1.21 2011/10/25 08:18:01 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: check.sh */ #* Name....: check script */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2007-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* # $1 = Binary PASS=0 COUNT=0 for i in expr param set subto condit var bool define vinst sos read do COUNT=`expr $COUNT + 1` $1 -v0 $i.zpl diff $i.lp $i.lp.ref >/dev/null case $? in 0) echo Test $i "(lp)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(lp)" FAIL ;; *) echo Test $i "(lp)" ERROR ;; esac COUNT=`expr $COUNT + 1` diff $i.tbl $i.tbl.ref >/dev/null case $? in 0) echo Test $i "(tbl)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(tbl)" FAIL ;; *) echo Test $i "(tbl)" ERROR ;; esac rm $i.tbl $i.lp done for i in presol do COUNT=`expr $COUNT + 1` $1 -v0 -Distart=5 -t mps -r -m -n cm $i.zpl diff $i.mps $i.mps.ref >/dev/null case $? in 0) echo Test $i "(mps)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(mps)" FAIL ;; *) echo Test $i "(mps)" ERROR ;; esac COUNT=`expr $COUNT + 1` diff $i.tbl $i.tbl.ref >/dev/null case $? in 0) echo Test $i "(tbl)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(tbl)" FAIL ;; *) echo Test $i "(tbl)" ERROR ;; esac COUNT=`expr $COUNT + 1` diff $i.mst $i.mst.ref >/dev/null case $? in 0) echo Test $i "(mst)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(mst)" FAIL ;; *) echo Test $i "(mst)" ERROR ;; esac COUNT=`expr $COUNT + 1` diff $i.ord $i.ord.ref >/dev/null case $? in 0) echo Test $i "(ord)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(ord)" FAIL ;; *) echo Test $i "(ord)" ERROR ;; esac rm $i.tbl $i.mps $i.mst $i.ord done # COUNT=`expr $COUNT + 1` $1 -v0 -Distart=4 -t hum -n cf presol.zpl diff presol.hum presol.hum.ref >/dev/null case $? in 0) echo Test presol.zpl "(hum)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test presol.zpl "(hum)" FAIL ;; *) echo Test presol.zpl "(hum)" ERROR ;; esac rm presol.hum # COUNT=`expr $COUNT + 1` $1 -v0 print.zpl >print.out diff print.out print.out.ref >/dev/null case $? in 0) echo Test print.zpl "(out)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test print.zpl "(out)" FAIL ;; *) echo Test print.zpl "(out)" ERROR ;; esac rm print.out print.tbl print.lp # # COUNT=`expr $COUNT + 1` $1 -v0 -t pip minlp.zpl diff minlp.pip minlp.pip.ref >/dev/null case $? in 0) echo Test minlp.zpl "(pip)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test minlp.zpl "(pip)" FAIL ;; *) echo Test minlp.zpl "(pip)" ERROR ;; esac rm minlp.pip minlp.tbl # # $1 -v0 -Dcities=5 -o metaio @selftest_tspste.zpl >metaio.out COUNT=`expr $COUNT + 1` diff metaio.lp metaio.lp.ref >/dev/null case $? in 0) echo Test metaio "(lp)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test metaio "(lp)" FAIL ;; *) echo Test metaio "(lp)" ERROR ;; esac COUNT=`expr $COUNT + 1` diff metaio.out metaio.out.ref >/dev/null case $? in 0) echo Test metaio "(out)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test metaio "(out)" FAIL ;; *) echo Test metaio "(out)" ERROR ;; esac rm metaio.lp metaio.tbl metaio.out # # cd warnings for i in w*.zpl do COUNT=`expr $COUNT + 1` NAME=`basename $i .zpl` ../$1 $i 2>$NAME.warn >/dev/null diff $NAME.warn $NAME.warn.ref >/dev/null case $? in 0) echo Test $i "(warn)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(warn)" FAIL ;; *) echo Test $i "(warn)" ERROR ;; esac rm -f $NAME.warn $NAME.tbl $NAME.lp $NAME.sos done 2>/dev/null # # Special w215 test COUNT=`expr $COUNT + 2` NAME=w215 ../$1 -m $NAME 2>$NAME.warn >/dev/null diff $NAME.warn $NAME-m.warn.ref >/dev/null case $? in 0) echo Test $NAME "-1 (warn)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $NAME "-1 (warn)" FAIL ;; *) echo Test $NAME "-1 (warn)" ERROR ;; esac diff $NAME.mst $NAME.mst.ref >/dev/null case $? in 0) echo Test $NAME "-2 (warn)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $NAME "-2 (warn)" FAIL ;; *) echo Test $NAME "-2 (warn)" ERROR ;; esac rm -f $NAME.warn $NAME.tbl $NAME.lp $NAME.mst # cd .. cd errors # for i in e[1-6]*.zpl do COUNT=`expr $COUNT + 1` NAME=`basename $i .zpl` ../$1 -v0 $i 2>$NAME.err fgrep -v "Aborted (core dumped)" $NAME.err | diff - $NAME.err.ref >/dev/null case $? in 0) echo Test $i "(err)" OK; PASS=`expr $PASS + 1` ;; 1) echo Test $i "(err)" FAIL ;; *) echo Test $i "(err)" ERROR ;; esac rm $NAME.err done 2>/dev/null # # Error 700 to 900 can vary # for i in e[789]*.zpl do # COUNT=`expr $COUNT + 1` NAME=`basename $i .zpl` # DIFFOPT=`awk -f ../exdiffopt.awk $NAME.err.ref` ../$1 -v0 $i 2>$NAME.err fgrep -v "Aborted (core dumped)" $NAME.err | diff - $NAME.err.ref >/dev/null case $? in 0) echo Test $i "(err)" OK;; 1) echo Test $i "(err)" FAIL "(ignored)";; *) echo Test $i "(err)" ERROR ;; esac rm $NAME.err done 2>/dev/null if [ $PASS -eq $COUNT ] ; then echo All $PASS tests passed; else echo FAILURE! Only $PASS of $COUNT tests passed; fi zimpl-3.3.6/check/bool.zpl0000644001417200060250000000441713301553023015315 0ustar bzfschlooptimi# $Id: bool.zpl,v 1.9 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: bool.zpl */ #* Name....: bool test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2001-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set A := { 1 .. 10 }; set B := { 5 .. 15 }; param a1 := if A == B or A <= B then 1 else 2 end; param a2 := if A != B and A < B then 1 else 2 end; param a3 := if not A > B and not A < B then 1 else 2 end; param a4 := if a1 < a2 or a2 != a3 then 1 else 2 end; param a5 := if if a1 != a2 then a3 < a4 else a3 > a4 end then 1 else 2 end; param a6 := if A == B xor A <= B then 3 else 4 end; param a7 := if "aaaa" >= "aaaab" then 5 else 1 end; param a8 := if exists( in { 1 .. 20 } with i * i == 16) then 1 else 2 end; param a9 := if <4> in { 1 .. 4 } then 7 else 8 end + if <"hallo"> in { "moin", "tach", "hi"} then 2 else 5 end + if <5> in {} then 100 else 0 end; var x[A]; maximize c1: a1 * x[1] + a2 * x[2] + a3 * x[3] + a4 * x[4] + a5 * x[5] + a6 * x[6] + a7 * x[7] + a8 * x[8] + a9 * x[9]; zimpl-3.3.6/check/define.tbl.ref0000644001417200060250000000251113301553023016334 0ustar bzfschlooptimizimpl v 0 x#1#4 "x#1#4" zimpl v 1 x#1#5 "x#1#5" zimpl v 2 x#1#6 "x#1#6" zimpl v 3 x#1#7 "x#1#7" zimpl v 4 x#2#4 "x#2#4" zimpl v 5 x#2#5 "x#2#5" zimpl v 6 x#2#6 "x#2#6" zimpl v 7 x#2#7 "x#2#7" zimpl v 8 x#3#4 "x#3#4" zimpl v 9 x#3#5 "x#3#5" zimpl v 10 x#3#6 "x#3#6" zimpl v 11 x#3#7 "x#3#7" zimpl v 12 x#4#4 "x#4#4" zimpl v 13 x#4#5 "x#4#5" zimpl v 14 x#4#6 "x#4#6" zimpl v 15 x#4#7 "x#4#7" zimpl v 16 x#5#4 "x#5#4" zimpl v 17 x#5#5 "x#5#5" zimpl v 18 x#5#6 "x#5#6" zimpl v 19 x#5#7 "x#5#7" zimpl v 25 y#6 "y#6" zimpl v 26 y#7 "y#7" zimpl v 27 y#8 "y#8" zimpl v 28 y#9 "y#9" zimpl v 29 y#10 "y#10" zimpl v 30 z$hallo "z$hallo" zimpl v 31 z$tach "z$tach" zimpl c 0 c1_1 "c1_1" 0.0000000000000000e+00 zimpl c 1 c2_1 "c2_1" 0.0000000000000000e+00 zimpl c 2 c3_1 "c3_1" 0.0000000000000000e+00 zimpl c 3 c4_1 "c4_1" 0.0000000000000000e+00 zimpl-3.3.6/check/var.lp.ref0000644001417200060250000000446313301553023015534 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1 .. 5 }; \ set K := { -5 .. -1 }; \ var a1; \ var b1 real; \ var b2 real <= 10; \ var b3 real >= 5/2; \ var b4 real >= 2 <= 7/3; \ var c1 <= 10; \ var c2 >= -5/4; \ var c3 >= 2 <= 7; \ var c4 <= infinity; \ var c5 >= -infinity <= -30; \ var d1 binary; \ var d2 binary priority 50; \ var d3 binary startval 1; \ var d4 binary priority 100 startval 1; \ var e1 integer; \ var e2 integer >= -5; \ var e3 integer <= 10; \ var e4 integer >= -2 <= 6; \ var e5 integer >= 5 priority 10; \ var e6 integer <= 10 startval 5; \ var e7 integer >= 2 <= 6 priority 15 startval 4; \ var x[I]; \ var y[ in I] integer >= -5 * i <= 6 * i priority 3 startval i; \ var z[K]; \ var w[ in I] <= if (i <= 3) then i else infinity end; \ subto ca1: a1 + sum in I : x[i] >= 17; \ subto cb1: b1 + b2 + b3 + b4 <= 99; \ subto cc1: c1 + c2 + c3 + c4 + c5 <= 77; \ subto cd1: d1 + d2 + d3 + d4>= 2; \ subto ce1: e1 + e2 + e3 + e4 + e5 + e6 + e7 <= 18; \ subto cy: sum in I : y[i] == -6; \ subto cd: sum in K : k * z[k] <= -8; \ subto cf: sum in I : w[i] <= 17; \Problem name: var.zpl Minimize Objective: Subject to ca1_1: + x#5 + x#4 + x#3 + x#2 + x#1 + a1 >= 17 cb1_1: + b4 + b3 + b2 + b1 <= 99 cc1_1: + c5 + c4 + c3 + c2 + c1 <= 77 cd1_1: + d4 + d3 + d2 + d1 >= 2 ce1_1: + e7 + e6 + e5 + e4 + e3 + e2 + e1 <= 18 cy_1: + y#5 + y#4 + y#3 + y#2 + y#1 = -6 cd_1: - z#_1@23 -2 z#_2@22 -3 z#_3@21 -4 z#_4@20 -5 z#_5@1f <= -8 cf_1: + w#5 + w#4 + w#3 + w#2 + w#1 <= 17 Bounds 0 <= a1 <= +inf 0 <= b1 <= +inf 0 <= b2 <= 10 2.5 <= b3 <= +inf 2 <= b4 <= 2.33333333333333 0 <= c1 <= 10 -1.25 <= c2 <= +inf 2 <= c3 <= 7 0 <= c4 <= +inf -inf <= c5 <= -30 0 <= d1 <= 1 0 <= d2 <= 1 0 <= d3 <= 1 0 <= d4 <= 1 0 <= e1 <= +inf -5 <= e2 <= +inf 0 <= e3 <= 10 -2 <= e4 <= 6 5 <= e5 <= +inf 0 <= e6 <= 10 2 <= e7 <= 6 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf -5 <= y#1 <= 6 -10 <= y#2 <= 12 -15 <= y#3 <= 18 -20 <= y#4 <= 24 -25 <= y#5 <= 30 0 <= z#_5@1f <= +inf 0 <= z#_4@20 <= +inf 0 <= z#_3@21 <= +inf 0 <= z#_2@22 <= +inf 0 <= z#_1@23 <= +inf 0 <= w#1 <= 1 0 <= w#2 <= 2 0 <= w#3 <= 3 0 <= w#4 <= +inf 0 <= w#5 <= +inf General d1 d2 d3 d4 e1 e2 e3 e4 e5 e6 e7 y#1 y#2 y#3 y#4 y#5 End zimpl-3.3.6/check/presol.zpl0000644001417200060250000000414013301553023015657 0ustar bzfschlooptimi# $Id: presol.zpl,v 1.7 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* * #* File....: presol.zpl * #* Name....: Presolve test * #* Author..: Thorsten Koch * #* Copyright by Author, All rights reserved * #* * #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #* #* Copyright (C) 2004-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1..5 }; var x[ in I] binary startval i mod 2; var y[ in I] integer <= 2 * i priority i * 10 startval istart; var z[ in I] <= 4 * i; var w[ in I] integer >= 1 <= if i mod 2 == 1 then 1 else 2 end; minimize cost: sum in I : -(x[i] + y[i]); subto c1: forall in I: x[i] <= 1; subto c2: y[1] + y[2] == 6; subto c3: sum in I: x[i] <= 3; subto c4: sum in I: y[i] == 15; subto c5: forall in I: y[i] >= z[i]; subto c6: forall in I with i < 3: x[i] <= z[i]; subto c7: forall in I with i >= 3: 1 <= x[i] + y[i] <= 100; subto c8: forall in I with i mod 2 == 1: -3 * w[i] == -3; subto c9: w[2] >= 2; subto c10: w[4] <= 2; zimpl-3.3.6/check/set.lp.ref0000644001417200060250000001704513303714344015546 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set A := { "a", "b", "c" }; \ set B := { 1, 2, 3 }; \ set B2:= argmax in B : abs(3-b); \ set C := { 1 to 4 }; \ set C2:= argmin in C : c; \ set D := { 7 .. 8 by 2 }; \ set E2:= (B + C) * A; \ set E := argmax(card(E2)) in E2 : i; \ set F := B inter C; \ set G := { 1 .. 5 } union D without B; \ set H := C symdiff { <1>, <2>, <7>, <8> }; \ set J := { in G with g > 3 }; \ set K := { <"a", 1>, <"b", 7>, <"c", 9> }; \ set L[B] := <1> { "a", "b" }, <2> { "c", "d", "e" }, <3> { "f" }; \ set LU := union in B : L[b]; \ set L2[] := <1> { "a", "b" }, <2> { "c", "d", "e" }, <3> { "f" }; \ set L2I := inter in B : (L2[b] + A); \ set M[ in D] := { <3 * i, 7, "d">, }; \ set N[ in C * B with i > j] := { i + j, i - j, i * j }; \ set P[] := powerset(C); \ set Q[] := subsets(C, 3); \ set R := indexset(P); \ set S := R; \ set T := { 1 to 9 } * { 10 to 19 } * { "A", "B" }; \ set T2 := argmin(15) in T : j - 2 * i; \ set U := proj(T2, <3,1>); \ set V := { in A*B with a == "a" or a == "b" }; \ set W[ in B] := { in C with c <= i }; \ set X := { in { in C with k > 2 } with i mod 2 == 0 }; \ set Y := { -2 .. -2 } + { -4 .. -8 by 2 } + { -16 .. -10 by -2 } + { 7 .. 1 } ; \ set Y2 := { -2 to -2 } + { -4 to -8 by 2 } + { -16 to -10 by -2 } + { 7 to 1 } ; \ set Z := C * (A * B); \ set AA := { in B : 2 * b }; \ set BB := { in A*B : }; \ set CC := { 1 .. 1000 } * { 1001 .. 2000 } * { "A", "B", "C", "D", "E"} * { 2001 .. 9999 } * { 1 .. 100 }; \ set DD := { <2,2000,"D",3000,e> in CC }; \ var a[L2I]; \ var b[B]; \ var c[C]; \ var d[D]; \ var e[E]; \ var f[F]; \ var g[G]; \ var h[H]; \ var j[J]; \ var k[K]; \ var l[LU]; \ var m[M[7]]; \ var n[{ 1 .. 100 }]; \ var p[C]; \ var q[C]; \ var u[U]; \ var v[V]; \ var xabcdefghijklmno[X]; \ var y[Y]; \ var y2[Y2]; \ var z[Z]; \ var aa[AA]; \ var bb[BB]; \ var dd[DD]; \ subto a1: sum in L2I : a[i] >= 0; \ subto b1: sum in B : b[i] >= ord(B2,1,1); \ subto c1: sum in C : c[i] >= ord(C2,1,1); \ subto d1: sum in D : d[i] >= 0; \ subto e1: sum in E : e[i1,i2] >= 0; \ subto f1: sum in F : f[i] >= 0; \ subto g1: sum in G : g[i] >= 0; \ subto h1: sum in H : h[i] >= 0; \ subto j1: sum in J : j[i] >= 0; \ subto k1: sum in K : k[i1,i2] >= 0; \ subto l1: forall in indexset(L) with L[i1] == L2[i1] do sum in L[i1] : l[i2] >= 0; \ subto m1: sum in M[7] : m[i1,i2,i3] >= 0; \ subto n1: forall in indexset(N) do sum in N[i1,i2] : n[i3] >= 0; \ subto p1: forall in R do sum in P[i1] : p[i2] >= 0; \ subto q1: forall in indexset(Q) do sum in Q[i1] : q[i2] >= 0; \ subto u1: forall in U do u[i1,i2] >= 0; \ subto v1: sum in V : v[i1,i2] >= 0; \ subto w1: forall in B do sum in W[i]: n[w] >= 0; \ subto x1: sum in X : xabcdefghijklmno[i] >= 0; \ subto y1: sum in Y : y[i] >= 0; \ subto y2: sum in Y2 : y2[i] >= 2; \ subto z1: sum in {1..card(E)} do e[ord(E,i,1),ord(E,i,2)] >= 5; \ subto z2: sum in Z with a1 > "b" do z[c1,a1,b1] <= 8; \ subto aa1: sum in AA : aa[i] >= 5; \ subto bb1: sum in BB : bb[i1,i2] <= 3; \ subto dd1: b[1] == card(DD); \Problem name: set.zpl Minimize Objective: Subject to a1_1: + a$c + a$b + a$a >= 0 b1_1: + b#3 + b#2 + b#1 >= 1 c1_1: + c#4 + c#3 + c#2 + c#1 >= 1 d1_1: + d#7 >= 0 e1_1: + e#4$c + e#4$b + e#4$a + e#3$c + e#3$b + e#3$a + e#2$c + e#2$b + e#2$a + e#1$c + e#1$b + e#1$a >= 0 f1_1: + f#3 + f#2 + f#1 >= 0 g1_1: + g#7 + g#5 + g#4 >= 0 h1_1: + h#8 + h#7 + h#4 + h#3 >= 0 j1_1: + j#7 + j#5 + j#4 >= 0 k1_1: + k$c#9 + k$b#7 + k$a#1 >= 0 l1_1: + l$b + l$a >= 0 l1_2: + l$e + l$d + l$c >= 0 l1_3: + l$f >= 0 m1_1: + m#9#9$c + m#21#7$d >= 0 n1_1: + n#2 + n#1 + n#3 >= 0 n1_2: + n#3 + n#2 + n#4 >= 0 n1_3: + n#6 + n#1 + n#5 >= 0 n1_4: + n#4 + n#3 + n#5 >= 0 n1_5: + n#8 + n#2 + n#6 >= 0 n1_6: + n#12 + n#1 + n#7 >= 0 p1_1: + p#1 >= 0 p1_2: + p#2 >= 0 p1_3: + p#3 >= 0 p1_4: + p#4 >= 0 p1_5: + p#1 + p#2 >= 0 p1_6: + p#1 + p#3 >= 0 p1_7: + p#1 + p#4 >= 0 p1_8: + p#2 + p#3 >= 0 p1_9: + p#2 + p#4 >= 0 p1_10: + p#3 + p#4 >= 0 p1_11: + p#1 + p#2 + p#3 >= 0 p1_12: + p#1 + p#2 + p#4 >= 0 p1_13: + p#1 + p#3 + p#4 >= 0 p1_14: + p#2 + p#3 + p#4 >= 0 p1_15: + p#1 + p#2 + p#3 + p#4 >= 0 q1_1: + q#1 + q#2 + q#3 >= 0 q1_2: + q#1 + q#2 + q#4 >= 0 q1_3: + q#1 + q#3 + q#4 >= 0 q1_4: + q#2 + q#3 + q#4 >= 0 u1_1: + u$B#7 >= 0 u1_2: + u$B#8 >= 0 u1_3: + u$B#9 >= 0 u1_4: + u$A#8 >= 0 u1_5: + u$A#9 >= 0 v1_1: + v$b#2 + v$a#2 >= 0 w1_1: + n#1 >= 0 w1_2: + n#2 + n#1 >= 0 w1_3: + n#3 + n#2 + n#1 >= 0 x1_1: + xabcdefghijkl@a2 >= 0 y1_1: + y#1 + y#2 + y#3 + y#4 + y#5 + y#6 + y#7 + y#_10@aa + y#_12@a9 + y#_14@a8 + y#_16@a7 + y#_8@a6 + y#_6@a5 + y#_4@a4 + y#_2@a3 >= 0 y2_1: + y2#_2@b2 >= 2 z1_1: + e#4$c + e#4$b + e#4$a + e#3$c + e#3$b + e#3$a + e#2$c + e#2$b + e#2$a + e#1$c + e#1$b + e#1$a >= 5 z2_1: + z#4$c#3 + z#4$c#2 + z#4$c#1 + z#3$c#3 + z#3$c#2 + z#3$c#1 + z#2$c#3 + z#2$c#2 + z#2$c#1 + z#1$c#3 + z#1$c#2 + z#1$c#1 <= 8 aa1_1: + aa#6 + aa#4 + aa#2 >= 5 bb1_1: + bb$c#5 + bb$c#4 + bb$c#3 + bb$b#5 + bb$b#4 + bb$b#3 + bb$a#5 + bb$a#4 + bb$a#3 <= 3 dd1_1: + b#1 = 100 Bounds 0 <= a$a <= +inf 0 <= a$b <= +inf 0 <= a$c <= +inf 0 <= b#1 <= +inf 0 <= b#2 <= +inf 0 <= b#3 <= +inf 0 <= c#1 <= +inf 0 <= c#2 <= +inf 0 <= c#3 <= +inf 0 <= c#4 <= +inf 0 <= d#7 <= +inf 0 <= e#1$a <= +inf 0 <= e#1$b <= +inf 0 <= e#1$c <= +inf 0 <= e#2$a <= +inf 0 <= e#2$b <= +inf 0 <= e#2$c <= +inf 0 <= e#3$a <= +inf 0 <= e#3$b <= +inf 0 <= e#3$c <= +inf 0 <= e#4$a <= +inf 0 <= e#4$b <= +inf 0 <= e#4$c <= +inf 0 <= f#1 <= +inf 0 <= f#2 <= +inf 0 <= f#3 <= +inf 0 <= g#4 <= +inf 0 <= g#5 <= +inf 0 <= g#7 <= +inf 0 <= h#3 <= +inf 0 <= h#4 <= +inf 0 <= h#7 <= +inf 0 <= h#8 <= +inf 0 <= j#4 <= +inf 0 <= j#5 <= +inf 0 <= j#7 <= +inf 0 <= k$a#1 <= +inf 0 <= k$b#7 <= +inf 0 <= k$c#9 <= +inf 0 <= l$a <= +inf 0 <= l$b <= +inf 0 <= l$c <= +inf 0 <= l$d <= +inf 0 <= l$e <= +inf 0 <= l$f <= +inf 0 <= m#21#7$d <= +inf 0 <= m#9#9$c <= +inf 0 <= n#1 <= +inf 0 <= n#2 <= +inf 0 <= n#3 <= +inf 0 <= n#4 <= +inf 0 <= n#5 <= +inf 0 <= n#6 <= +inf 0 <= n#7 <= +inf 0 <= n#8 <= +inf 0 <= n#12 <= +inf 0 <= p#1 <= +inf 0 <= p#2 <= +inf 0 <= p#3 <= +inf 0 <= p#4 <= +inf 0 <= q#1 <= +inf 0 <= q#2 <= +inf 0 <= q#3 <= +inf 0 <= q#4 <= +inf 0 <= u$B#7 <= +inf 0 <= u$B#8 <= +inf 0 <= u$B#9 <= +inf 0 <= u$A#8 <= +inf 0 <= u$A#9 <= +inf 0 <= v$a#2 <= +inf 0 <= v$b#2 <= +inf 0 <= xabcdefghijkl@a2 <= +inf 0 <= y#_2@a3 <= +inf 0 <= y#_4@a4 <= +inf 0 <= y#_6@a5 <= +inf 0 <= y#_8@a6 <= +inf 0 <= y#_16@a7 <= +inf 0 <= y#_14@a8 <= +inf 0 <= y#_12@a9 <= +inf 0 <= y#_10@aa <= +inf 0 <= y#7 <= +inf 0 <= y#6 <= +inf 0 <= y#5 <= +inf 0 <= y#4 <= +inf 0 <= y#3 <= +inf 0 <= y#2 <= +inf 0 <= y#1 <= +inf 0 <= y2#_2@b2 <= +inf 0 <= z#1$c#1 <= +inf 0 <= z#1$c#2 <= +inf 0 <= z#1$c#3 <= +inf 0 <= z#2$c#1 <= +inf 0 <= z#2$c#2 <= +inf 0 <= z#2$c#3 <= +inf 0 <= z#3$c#1 <= +inf 0 <= z#3$c#2 <= +inf 0 <= z#3$c#3 <= +inf 0 <= z#4$c#1 <= +inf 0 <= z#4$c#2 <= +inf 0 <= z#4$c#3 <= +inf 0 <= aa#2 <= +inf 0 <= aa#4 <= +inf 0 <= aa#6 <= +inf 0 <= bb$a#3 <= +inf 0 <= bb$a#4 <= +inf 0 <= bb$a#5 <= +inf 0 <= bb$b#3 <= +inf 0 <= bb$b#4 <= +inf 0 <= bb$b#5 <= +inf 0 <= bb$c#3 <= +inf 0 <= bb$c#4 <= +inf 0 <= bb$c#5 <= +inf End zimpl-3.3.6/check/read1.dat0000644001417200060250000162373013301553023015327 0ustar bzfschlooptimi# $Id: read1.dat,v 1.5 2010/06/10 19:42:40 bzfkocht Exp $ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 6943 6944 6945 6946 6947 6948 6949 6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 6987 6988 6989 6990 6991 6992 6993 6994 6995 6996 6997 6998 6999 7000 7001 7002 7003 7004 7005 7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 7084 7085 7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 7096 7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121 7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 7137 7138 7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164 7165 7166 7167 7168 7169 7170 7171 7172 7173 7174 7175 7176 7177 7178 7179 7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213 7214 7215 7216 7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227 7228 7229 7230 7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255 7256 7257 7258 7259 7260 7261 7262 7263 7264 7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306 7307 7308 7309 7310 7311 7312 7313 7314 7315 7316 7317 7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350 7351 7352 7353 7354 7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368 7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385 7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465 7466 7467 7468 7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589 7590 7591 7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662 7663 7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719 7720 7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776 7777 7778 7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860 7861 7862 7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926 7927 7928 7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 7987 7988 7989 7990 7991 7992 7993 7994 7995 7996 7997 7998 7999 8000 8001 8002 8003 8004 8005 8006 8007 8008 8009 8010 8011 8012 8013 8014 8015 8016 8017 8018 8019 8020 8021 8022 8023 8024 8025 8026 8027 8028 8029 8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043 8044 8045 8046 8047 8048 8049 8050 8051 8052 8053 8054 8055 8056 8057 8058 8059 8060 8061 8062 8063 8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100 8101 8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114 8115 8116 8117 8118 8119 8120 8121 8122 8123 8124 8125 8126 8127 8128 8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147 8148 8149 8150 8151 8152 8153 8154 8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169 8170 8171 8172 8173 8174 8175 8176 8177 8178 8179 8180 8181 8182 8183 8184 8185 8186 8187 8188 8189 8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207 8208 8209 8210 8211 8212 8213 8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233 8234 8235 8236 8237 8238 8239 8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264 8265 8266 8267 8268 8269 8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284 8285 8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311 8312 8313 8314 8315 8316 8317 8318 8319 8320 8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338 8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353 8354 8355 8356 8357 8358 8359 8360 8361 8362 8363 8364 8365 8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377 8378 8379 8380 8381 8382 8383 8384 8385 8386 8387 8388 8389 8390 8391 8392 8393 8394 8395 8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417 8418 8419 8420 8421 8422 8423 8424 8425 8426 8427 8428 8429 8430 8431 8432 8433 8434 8435 8436 8437 8438 8439 8440 8441 8442 8443 8444 8445 8446 8447 8448 8449 8450 8451 8452 8453 8454 8455 8456 8457 8458 8459 8460 8461 8462 8463 8464 8465 8466 8467 8468 8469 8470 8471 8472 8473 8474 8475 8476 8477 8478 8479 8480 8481 8482 8483 8484 8485 8486 8487 8488 8489 8490 8491 8492 8493 8494 8495 8496 8497 8498 8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510 8511 8512 8513 8514 8515 8516 8517 8518 8519 8520 8521 8522 8523 8524 8525 8526 8527 8528 8529 8530 8531 8532 8533 8534 8535 8536 8537 8538 8539 8540 8541 8542 8543 8544 8545 8546 8547 8548 8549 8550 8551 8552 8553 8554 8555 8556 8557 8558 8559 8560 8561 8562 8563 8564 8565 8566 8567 8568 8569 8570 8571 8572 8573 8574 8575 8576 8577 8578 8579 8580 8581 8582 8583 8584 8585 8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600 8601 8602 8603 8604 8605 8606 8607 8608 8609 8610 8611 8612 8613 8614 8615 8616 8617 8618 8619 8620 8621 8622 8623 8624 8625 8626 8627 8628 8629 8630 8631 8632 8633 8634 8635 8636 8637 8638 8639 8640 8641 8642 8643 8644 8645 8646 8647 8648 8649 8650 8651 8652 8653 8654 8655 8656 8657 8658 8659 8660 8661 8662 8663 8664 8665 8666 8667 8668 8669 8670 8671 8672 8673 8674 8675 8676 8677 8678 8679 8680 8681 8682 8683 8684 8685 8686 8687 8688 8689 8690 8691 8692 8693 8694 8695 8696 8697 8698 8699 8700 8701 8702 8703 8704 8705 8706 8707 8708 8709 8710 8711 8712 8713 8714 8715 8716 8717 8718 8719 8720 8721 8722 8723 8724 8725 8726 8727 8728 8729 8730 8731 8732 8733 8734 8735 8736 8737 8738 8739 8740 8741 8742 8743 8744 8745 8746 8747 8748 8749 8750 8751 8752 8753 8754 8755 8756 8757 8758 8759 8760 8761 8762 8763 8764 8765 8766 8767 8768 8769 8770 8771 8772 8773 8774 8775 8776 8777 8778 8779 8780 8781 8782 8783 8784 8785 8786 8787 8788 8789 8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803 8804 8805 8806 8807 8808 8809 8810 8811 8812 8813 8814 8815 8816 8817 8818 8819 8820 8821 8822 8823 8824 8825 8826 8827 8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839 8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854 8855 8856 8857 8858 8859 8860 8861 8862 8863 8864 8865 8866 8867 8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882 8883 8884 8885 8886 8887 8888 8889 8890 8891 8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902 8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919 8920 8921 8922 8923 8924 8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944 8945 8946 8947 8948 8949 8950 8951 8952 8953 8954 8955 8956 8957 8958 8959 8960 8961 8962 8963 8964 8965 8966 8967 8968 8969 8970 8971 8972 8973 8974 8975 8976 8977 8978 8979 8980 8981 8982 8983 8984 8985 8986 8987 8988 8989 8990 8991 8992 8993 8994 8995 8996 8997 8998 8999 9000 9001 9002 9003 9004 9005 9006 9007 9008 9009 9010 9011 9012 9013 9014 9015 9016 9017 9018 9019 9020 9021 9022 9023 9024 9025 9026 9027 9028 9029 9030 9031 9032 9033 9034 9035 9036 9037 9038 9039 9040 9041 9042 9043 9044 9045 9046 9047 9048 9049 9050 9051 9052 9053 9054 9055 9056 9057 9058 9059 9060 9061 9062 9063 9064 9065 9066 9067 9068 9069 9070 9071 9072 9073 9074 9075 9076 9077 9078 9079 9080 9081 9082 9083 9084 9085 9086 9087 9088 9089 9090 9091 9092 9093 9094 9095 9096 9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110 9111 9112 9113 9114 9115 9116 9117 9118 9119 9120 9121 9122 9123 9124 9125 9126 9127 9128 9129 9130 9131 9132 9133 9134 9135 9136 9137 9138 9139 9140 9141 9142 9143 9144 9145 9146 9147 9148 9149 9150 9151 9152 9153 9154 9155 9156 9157 9158 9159 9160 9161 9162 9163 9164 9165 9166 9167 9168 9169 9170 9171 9172 9173 9174 9175 9176 9177 9178 9179 9180 9181 9182 9183 9184 9185 9186 9187 9188 9189 9190 9191 9192 9193 9194 9195 9196 9197 9198 9199 9200 9201 9202 9203 9204 9205 9206 9207 9208 9209 9210 9211 9212 9213 9214 9215 9216 9217 9218 9219 9220 9221 9222 9223 9224 9225 9226 9227 9228 9229 9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240 9241 9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252 9253 9254 9255 9256 9257 9258 9259 9260 9261 9262 9263 9264 9265 9266 9267 9268 9269 9270 9271 9272 9273 9274 9275 9276 9277 9278 9279 9280 9281 9282 9283 9284 9285 9286 9287 9288 9289 9290 9291 9292 9293 9294 9295 9296 9297 9298 9299 9300 9301 9302 9303 9304 9305 9306 9307 9308 9309 9310 9311 9312 9313 9314 9315 9316 9317 9318 9319 9320 9321 9322 9323 9324 9325 9326 9327 9328 9329 9330 9331 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 9349 9350 9351 9352 9353 9354 9355 9356 9357 9358 9359 9360 9361 9362 9363 9364 9365 9366 9367 9368 9369 9370 9371 9372 9373 9374 9375 9376 9377 9378 9379 9380 9381 9382 9383 9384 9385 9386 9387 9388 9389 9390 9391 9392 9393 9394 9395 9396 9397 9398 9399 9400 9401 9402 9403 9404 9405 9406 9407 9408 9409 9410 9411 9412 9413 9414 9415 9416 9417 9418 9419 9420 9421 9422 9423 9424 9425 9426 9427 9428 9429 9430 9431 9432 9433 9434 9435 9436 9437 9438 9439 9440 9441 9442 9443 9444 9445 9446 9447 9448 9449 9450 9451 9452 9453 9454 9455 9456 9457 9458 9459 9460 9461 9462 9463 9464 9465 9466 9467 9468 9469 9470 9471 9472 9473 9474 9475 9476 9477 9478 9479 9480 9481 9482 9483 9484 9485 9486 9487 9488 9489 9490 9491 9492 9493 9494 9495 9496 9497 9498 9499 9500 9501 9502 9503 9504 9505 9506 9507 9508 9509 9510 9511 9512 9513 9514 9515 9516 9517 9518 9519 9520 9521 9522 9523 9524 9525 9526 9527 9528 9529 9530 9531 9532 9533 9534 9535 9536 9537 9538 9539 9540 9541 9542 9543 9544 9545 9546 9547 9548 9549 9550 9551 9552 9553 9554 9555 9556 9557 9558 9559 9560 9561 9562 9563 9564 9565 9566 9567 9568 9569 9570 9571 9572 9573 9574 9575 9576 9577 9578 9579 9580 9581 9582 9583 9584 9585 9586 9587 9588 9589 9590 9591 9592 9593 9594 9595 9596 9597 9598 9599 9600 9601 9602 9603 9604 9605 9606 9607 9608 9609 9610 9611 9612 9613 9614 9615 9616 9617 9618 9619 9620 9621 9622 9623 9624 9625 9626 9627 9628 9629 9630 9631 9632 9633 9634 9635 9636 9637 9638 9639 9640 9641 9642 9643 9644 9645 9646 9647 9648 9649 9650 9651 9652 9653 9654 9655 9656 9657 9658 9659 9660 9661 9662 9663 9664 9665 9666 9667 9668 9669 9670 9671 9672 9673 9674 9675 9676 9677 9678 9679 9680 9681 9682 9683 9684 9685 9686 9687 9688 9689 9690 9691 9692 9693 9694 9695 9696 9697 9698 9699 9700 9701 9702 9703 9704 9705 9706 9707 9708 9709 9710 9711 9712 9713 9714 9715 9716 9717 9718 9719 9720 9721 9722 9723 9724 9725 9726 9727 9728 9729 9730 9731 9732 9733 9734 9735 9736 9737 9738 9739 9740 9741 9742 9743 9744 9745 9746 9747 9748 9749 9750 9751 9752 9753 9754 9755 9756 9757 9758 9759 9760 9761 9762 9763 9764 9765 9766 9767 9768 9769 9770 9771 9772 9773 9774 9775 9776 9777 9778 9779 9780 9781 9782 9783 9784 9785 9786 9787 9788 9789 9790 9791 9792 9793 9794 9795 9796 9797 9798 9799 9800 9801 9802 9803 9804 9805 9806 9807 9808 9809 9810 9811 9812 9813 9814 9815 9816 9817 9818 9819 9820 9821 9822 9823 9824 9825 9826 9827 9828 9829 9830 9831 9832 9833 9834 9835 9836 9837 9838 9839 9840 9841 9842 9843 9844 9845 9846 9847 9848 9849 9850 9851 9852 9853 9854 9855 9856 9857 9858 9859 9860 9861 9862 9863 9864 9865 9866 9867 9868 9869 9870 9871 9872 9873 9874 9875 9876 9877 9878 9879 9880 9881 9882 9883 9884 9885 9886 9887 9888 9889 9890 9891 9892 9893 9894 9895 9896 9897 9898 9899 9900 9901 9902 9903 9904 9905 9906 9907 9908 9909 9910 9911 9912 9913 9914 9915 9916 9917 9918 9919 9920 9921 9922 9923 9924 9925 9926 9927 9928 9929 9930 9931 9932 9933 9934 9935 9936 9937 9938 9939 9940 9941 9942 9943 9944 9945 9946 9947 9948 9949 9950 9951 9952 9953 9954 9955 9956 9957 9958 9959 9960 9961 9962 9963 9964 9965 9966 9967 9968 9969 9970 9971 9972 9973 9974 9975 9976 9977 9978 9979 9980 9981 9982 9983 9984 9985 9986 9987 9988 9989 9990 9991 9992 9993 9994 9995 9996 9997 9998 9999 10000 10001 10002 10003 10004 10005 10006 10007 10008 10009 10010 10011 10012 10013 10014 10015 10016 10017 10018 10019 10020 10021 10022 10023 10024 10025 10026 10027 10028 10029 10030 10031 10032 10033 10034 10035 10036 10037 10038 10039 10040 10041 10042 10043 10044 10045 10046 10047 10048 10049 10050 10051 10052 10053 10054 10055 10056 10057 10058 10059 10060 10061 10062 10063 10064 10065 10066 10067 10068 10069 10070 10071 10072 10073 10074 10075 10076 10077 10078 10079 10080 10081 10082 10083 10084 10085 10086 10087 10088 10089 10090 10091 10092 10093 10094 10095 10096 10097 10098 10099 10100 10101 10102 10103 10104 10105 10106 10107 10108 10109 10110 10111 10112 10113 10114 10115 10116 10117 10118 10119 10120 10121 10122 10123 10124 10125 10126 10127 10128 10129 10130 10131 10132 10133 10134 10135 10136 10137 10138 10139 10140 10141 10142 10143 10144 10145 10146 10147 10148 10149 10150 10151 10152 10153 10154 10155 10156 10157 10158 10159 10160 10161 10162 10163 10164 10165 10166 10167 10168 10169 10170 10171 10172 10173 10174 10175 10176 10177 10178 10179 10180 10181 10182 10183 10184 10185 10186 10187 10188 10189 10190 10191 10192 10193 10194 10195 10196 10197 10198 10199 10200 10201 10202 10203 10204 10205 10206 10207 10208 10209 10210 10211 10212 10213 10214 10215 10216 10217 10218 10219 10220 10221 10222 10223 10224 10225 10226 10227 10228 10229 10230 10231 10232 10233 10234 10235 10236 10237 10238 10239 10240 10241 10242 10243 10244 10245 10246 10247 10248 10249 10250 10251 10252 10253 10254 10255 10256 10257 10258 10259 10260 10261 10262 10263 10264 10265 10266 10267 10268 10269 10270 10271 10272 10273 10274 10275 10276 10277 10278 10279 10280 10281 10282 10283 10284 10285 10286 10287 10288 10289 10290 10291 10292 10293 10294 10295 10296 10297 10298 10299 10300 10301 10302 10303 10304 10305 10306 10307 10308 10309 10310 10311 10312 10313 10314 10315 10316 10317 10318 10319 10320 10321 10322 10323 10324 10325 10326 10327 10328 10329 10330 10331 10332 10333 10334 10335 10336 10337 10338 10339 10340 10341 10342 10343 10344 10345 10346 10347 10348 10349 10350 10351 10352 10353 10354 10355 10356 10357 10358 10359 10360 10361 10362 10363 10364 10365 10366 10367 10368 10369 10370 10371 10372 10373 10374 10375 10376 10377 10378 10379 10380 10381 10382 10383 10384 10385 10386 10387 10388 10389 10390 10391 10392 10393 10394 10395 10396 10397 10398 10399 10400 10401 10402 10403 10404 10405 10406 10407 10408 10409 10410 10411 10412 10413 10414 10415 10416 10417 10418 10419 10420 10421 10422 10423 10424 10425 10426 10427 10428 10429 10430 10431 10432 10433 10434 10435 10436 10437 10438 10439 10440 10441 10442 10443 10444 10445 10446 10447 10448 10449 10450 10451 10452 10453 10454 10455 10456 10457 10458 10459 10460 10461 10462 10463 10464 10465 10466 10467 10468 10469 10470 10471 10472 10473 10474 10475 10476 10477 10478 10479 10480 10481 10482 10483 10484 10485 10486 10487 10488 10489 10490 10491 10492 10493 10494 10495 10496 10497 10498 10499 10500 10501 10502 10503 10504 10505 10506 10507 10508 10509 10510 10511 10512 10513 10514 10515 10516 10517 10518 10519 10520 10521 10522 10523 10524 10525 10526 10527 10528 10529 10530 10531 10532 10533 10534 10535 10536 10537 10538 10539 10540 10541 10542 10543 10544 10545 10546 10547 10548 10549 10550 10551 10552 10553 10554 10555 10556 10557 10558 10559 10560 10561 10562 10563 10564 10565 10566 10567 10568 10569 10570 10571 10572 10573 10574 10575 10576 10577 10578 10579 10580 10581 10582 10583 10584 10585 10586 10587 10588 10589 10590 10591 10592 10593 10594 10595 10596 10597 10598 10599 10600 10601 10602 10603 10604 10605 10606 10607 10608 10609 10610 10611 10612 10613 10614 10615 10616 10617 10618 10619 10620 10621 10622 10623 10624 10625 10626 10627 10628 10629 10630 10631 10632 10633 10634 10635 10636 10637 10638 10639 10640 10641 10642 10643 10644 10645 10646 10647 10648 10649 10650 10651 10652 10653 10654 10655 10656 10657 10658 10659 10660 10661 10662 10663 10664 10665 10666 10667 10668 10669 10670 10671 10672 10673 10674 10675 10676 10677 10678 10679 10680 10681 10682 10683 10684 10685 10686 10687 10688 10689 10690 10691 10692 10693 10694 10695 10696 10697 10698 10699 10700 10701 10702 10703 10704 10705 10706 10707 10708 10709 10710 10711 10712 10713 10714 10715 10716 10717 10718 10719 10720 10721 10722 10723 10724 10725 10726 10727 10728 10729 10730 10731 10732 10733 10734 10735 10736 10737 10738 10739 10740 10741 10742 10743 10744 10745 10746 10747 10748 10749 10750 10751 10752 10753 10754 10755 10756 10757 10758 10759 10760 10761 10762 10763 10764 10765 10766 10767 10768 10769 10770 10771 10772 10773 10774 10775 10776 10777 10778 10779 10780 10781 10782 10783 10784 10785 10786 10787 10788 10789 10790 10791 10792 10793 10794 10795 10796 10797 10798 10799 10800 10801 10802 10803 10804 10805 10806 10807 10808 10809 10810 10811 10812 10813 10814 10815 10816 10817 10818 10819 10820 10821 10822 10823 10824 10825 10826 10827 10828 10829 10830 10831 10832 10833 10834 10835 10836 10837 10838 10839 10840 10841 10842 10843 10844 10845 10846 10847 10848 10849 10850 10851 10852 10853 10854 10855 10856 10857 10858 10859 10860 10861 10862 10863 10864 10865 10866 10867 10868 10869 10870 10871 10872 10873 10874 10875 10876 10877 10878 10879 10880 10881 10882 10883 10884 10885 10886 10887 10888 10889 10890 10891 10892 10893 10894 10895 10896 10897 10898 10899 10900 10901 10902 10903 10904 10905 10906 10907 10908 10909 10910 10911 10912 10913 10914 10915 10916 10917 10918 10919 10920 10921 10922 10923 10924 10925 10926 10927 10928 10929 10930 10931 10932 10933 10934 10935 10936 10937 10938 10939 10940 10941 10942 10943 10944 10945 10946 10947 10948 10949 10950 10951 10952 10953 10954 10955 10956 10957 10958 10959 10960 10961 10962 10963 10964 10965 10966 10967 10968 10969 10970 10971 10972 10973 10974 10975 10976 10977 10978 10979 10980 10981 10982 10983 10984 10985 10986 10987 10988 10989 10990 10991 10992 10993 10994 10995 10996 10997 10998 10999 11000 11001 11002 11003 11004 11005 11006 11007 11008 11009 11010 11011 11012 11013 11014 11015 11016 11017 11018 11019 11020 11021 11022 11023 11024 11025 11026 11027 11028 11029 11030 11031 11032 11033 11034 11035 11036 11037 11038 11039 11040 11041 11042 11043 11044 11045 11046 11047 11048 11049 11050 11051 11052 11053 11054 11055 11056 11057 11058 11059 11060 11061 11062 11063 11064 11065 11066 11067 11068 11069 11070 11071 11072 11073 11074 11075 11076 11077 11078 11079 11080 11081 11082 11083 11084 11085 11086 11087 11088 11089 11090 11091 11092 11093 11094 11095 11096 11097 11098 11099 11100 11101 11102 11103 11104 11105 11106 11107 11108 11109 11110 11111 11112 11113 11114 11115 11116 11117 11118 11119 11120 11121 11122 11123 11124 11125 11126 11127 11128 11129 11130 11131 11132 11133 11134 11135 11136 11137 11138 11139 11140 11141 11142 11143 11144 11145 11146 11147 11148 11149 11150 11151 11152 11153 11154 11155 11156 11157 11158 11159 11160 11161 11162 11163 11164 11165 11166 11167 11168 11169 11170 11171 11172 11173 11174 11175 11176 11177 11178 11179 11180 11181 11182 11183 11184 11185 11186 11187 11188 11189 11190 11191 11192 11193 11194 11195 11196 11197 11198 11199 11200 11201 11202 11203 11204 11205 11206 11207 11208 11209 11210 11211 11212 11213 11214 11215 11216 11217 11218 11219 11220 11221 11222 11223 11224 11225 11226 11227 11228 11229 11230 11231 11232 11233 11234 11235 11236 11237 11238 11239 11240 11241 11242 11243 11244 11245 11246 11247 11248 11249 11250 11251 11252 11253 11254 11255 11256 11257 11258 11259 11260 11261 11262 11263 11264 11265 11266 11267 11268 11269 11270 11271 11272 11273 11274 11275 11276 11277 11278 11279 11280 11281 11282 11283 11284 11285 11286 11287 11288 11289 11290 11291 11292 11293 11294 11295 11296 11297 11298 11299 11300 11301 11302 11303 11304 11305 11306 11307 11308 11309 11310 11311 11312 11313 11314 11315 11316 11317 11318 11319 11320 11321 11322 11323 11324 11325 11326 11327 11328 11329 11330 11331 11332 11333 11334 11335 11336 11337 11338 11339 11340 11341 11342 11343 11344 11345 11346 11347 11348 11349 11350 11351 11352 11353 11354 11355 11356 11357 11358 11359 11360 11361 11362 11363 11364 11365 11366 11367 11368 11369 11370 11371 11372 11373 11374 11375 11376 11377 11378 11379 11380 11381 11382 11383 11384 11385 11386 11387 11388 11389 11390 11391 11392 11393 11394 11395 11396 11397 11398 11399 11400 11401 11402 11403 11404 11405 11406 11407 11408 11409 11410 11411 11412 11413 11414 11415 11416 11417 11418 11419 11420 11421 11422 11423 11424 11425 11426 11427 11428 11429 11430 11431 11432 11433 11434 11435 11436 11437 11438 11439 11440 11441 11442 11443 11444 11445 11446 11447 11448 11449 11450 11451 11452 11453 11454 11455 11456 11457 11458 11459 11460 11461 11462 11463 11464 11465 11466 11467 11468 11469 11470 11471 11472 11473 11474 11475 11476 11477 11478 11479 11480 11481 11482 11483 11484 11485 11486 11487 11488 11489 11490 11491 11492 11493 11494 11495 11496 11497 11498 11499 11500 11501 11502 11503 11504 11505 11506 11507 11508 11509 11510 11511 11512 11513 11514 11515 11516 11517 11518 11519 11520 11521 11522 11523 11524 11525 11526 11527 11528 11529 11530 11531 11532 11533 11534 11535 11536 11537 11538 11539 11540 11541 11542 11543 11544 11545 11546 11547 11548 11549 11550 11551 11552 11553 11554 11555 11556 11557 11558 11559 11560 11561 11562 11563 11564 11565 11566 11567 11568 11569 11570 11571 11572 11573 11574 11575 11576 11577 11578 11579 11580 11581 11582 11583 11584 11585 11586 11587 11588 11589 11590 11591 11592 11593 11594 11595 11596 11597 11598 11599 11600 11601 11602 11603 11604 11605 11606 11607 11608 11609 11610 11611 11612 11613 11614 11615 11616 11617 11618 11619 11620 11621 11622 11623 11624 11625 11626 11627 11628 11629 11630 11631 11632 11633 11634 11635 11636 11637 11638 11639 11640 11641 11642 11643 11644 11645 11646 11647 11648 11649 11650 11651 11652 11653 11654 11655 11656 11657 11658 11659 11660 11661 11662 11663 11664 11665 11666 11667 11668 11669 11670 11671 11672 11673 11674 11675 11676 11677 11678 11679 11680 11681 11682 11683 11684 11685 11686 11687 11688 11689 11690 11691 11692 11693 11694 11695 11696 11697 11698 11699 11700 11701 11702 11703 11704 11705 11706 11707 11708 11709 11710 11711 11712 11713 11714 11715 11716 11717 11718 11719 11720 11721 11722 11723 11724 11725 11726 11727 11728 11729 11730 11731 11732 11733 11734 11735 11736 11737 11738 11739 11740 11741 11742 11743 11744 11745 11746 11747 11748 11749 11750 11751 11752 11753 11754 11755 11756 11757 11758 11759 11760 11761 11762 11763 11764 11765 11766 11767 11768 11769 11770 11771 11772 11773 11774 11775 11776 11777 11778 11779 11780 11781 11782 11783 11784 11785 11786 11787 11788 11789 11790 11791 11792 11793 11794 11795 11796 11797 11798 11799 11800 11801 11802 11803 11804 11805 11806 11807 11808 11809 11810 11811 11812 11813 11814 11815 11816 11817 11818 11819 11820 11821 11822 11823 11824 11825 11826 11827 11828 11829 11830 11831 11832 11833 11834 11835 11836 11837 11838 11839 11840 11841 11842 11843 11844 11845 11846 11847 11848 11849 11850 11851 11852 11853 11854 11855 11856 11857 11858 11859 11860 11861 11862 11863 11864 11865 11866 11867 11868 11869 11870 11871 11872 11873 11874 11875 11876 11877 11878 11879 11880 11881 11882 11883 11884 11885 11886 11887 11888 11889 11890 11891 11892 11893 11894 11895 11896 11897 11898 11899 11900 11901 11902 11903 11904 11905 11906 11907 11908 11909 11910 11911 11912 11913 11914 11915 11916 11917 11918 11919 11920 11921 11922 11923 11924 11925 11926 11927 11928 11929 11930 11931 11932 11933 11934 11935 11936 11937 11938 11939 11940 11941 11942 11943 11944 11945 11946 11947 11948 11949 11950 11951 11952 11953 11954 11955 11956 11957 11958 11959 11960 11961 11962 11963 11964 11965 11966 11967 11968 11969 11970 11971 11972 11973 11974 11975 11976 11977 11978 11979 11980 11981 11982 11983 11984 11985 11986 11987 11988 11989 11990 11991 11992 11993 11994 11995 11996 11997 11998 11999 12000 12001 12002 12003 12004 12005 12006 12007 12008 12009 12010 12011 12012 12013 12014 12015 12016 12017 12018 12019 12020 12021 12022 12023 12024 12025 12026 12027 12028 12029 12030 12031 12032 12033 12034 12035 12036 12037 12038 12039 12040 12041 12042 12043 12044 12045 12046 12047 12048 12049 12050 12051 12052 12053 12054 12055 12056 12057 12058 12059 12060 12061 12062 12063 12064 12065 12066 12067 12068 12069 12070 12071 12072 12073 12074 12075 12076 12077 12078 12079 12080 12081 12082 12083 12084 12085 12086 12087 12088 12089 12090 12091 12092 12093 12094 12095 12096 12097 12098 12099 12100 12101 12102 12103 12104 12105 12106 12107 12108 12109 12110 12111 12112 12113 12114 12115 12116 12117 12118 12119 12120 12121 12122 12123 12124 12125 12126 12127 12128 12129 12130 12131 12132 12133 12134 12135 12136 12137 12138 12139 12140 12141 12142 12143 12144 12145 12146 12147 12148 12149 12150 12151 12152 12153 12154 12155 12156 12157 12158 12159 12160 12161 12162 12163 12164 12165 12166 12167 12168 12169 12170 12171 12172 12173 12174 12175 12176 12177 12178 12179 12180 12181 12182 12183 12184 12185 12186 12187 12188 12189 12190 12191 12192 12193 12194 12195 12196 12197 12198 12199 12200 12201 12202 12203 12204 12205 12206 12207 12208 12209 12210 12211 12212 12213 12214 12215 12216 12217 12218 12219 12220 12221 12222 12223 12224 12225 12226 12227 12228 12229 12230 12231 12232 12233 12234 12235 12236 12237 12238 12239 12240 12241 12242 12243 12244 12245 12246 12247 12248 12249 12250 12251 12252 12253 12254 12255 12256 12257 12258 12259 12260 12261 12262 12263 12264 12265 12266 12267 12268 12269 12270 12271 12272 12273 12274 12275 12276 12277 12278 12279 12280 12281 12282 12283 12284 12285 12286 12287 12288 12289 12290 12291 12292 12293 12294 12295 12296 12297 12298 12299 12300 12301 12302 12303 12304 12305 12306 12307 12308 12309 12310 12311 12312 12313 12314 12315 12316 12317 12318 12319 12320 12321 12322 12323 12324 12325 12326 12327 12328 12329 12330 12331 12332 12333 12334 12335 12336 12337 12338 12339 12340 12341 12342 12343 12344 12345 12346 12347 12348 12349 12350 12351 12352 12353 12354 12355 12356 12357 12358 12359 12360 12361 12362 12363 12364 12365 12366 12367 12368 12369 12370 12371 12372 12373 12374 12375 12376 12377 12378 12379 12380 12381 12382 12383 12384 12385 12386 12387 12388 12389 12390 12391 12392 12393 12394 12395 12396 12397 12398 12399 12400 12401 12402 12403 12404 12405 12406 12407 12408 12409 12410 12411 12412 12413 12414 12415 12416 12417 12418 12419 12420 12421 12422 12423 12424 12425 12426 12427 12428 12429 12430 12431 12432 12433 12434 12435 12436 12437 12438 12439 12440 12441 12442 12443 12444 12445 12446 12447 12448 12449 12450 12451 12452 12453 12454 12455 12456 12457 12458 12459 12460 12461 12462 12463 12464 12465 12466 12467 12468 12469 12470 12471 12472 12473 12474 12475 12476 12477 12478 12479 12480 12481 12482 12483 12484 12485 12486 12487 12488 12489 12490 12491 12492 12493 12494 12495 12496 12497 12498 12499 12500 12501 12502 12503 12504 12505 12506 12507 12508 12509 12510 12511 12512 12513 12514 12515 12516 12517 12518 12519 12520 12521 12522 12523 12524 12525 12526 12527 12528 12529 12530 12531 12532 12533 12534 12535 12536 12537 12538 12539 12540 12541 12542 12543 12544 12545 12546 12547 12548 12549 12550 12551 12552 12553 12554 12555 12556 12557 12558 12559 12560 12561 12562 12563 12564 12565 12566 12567 12568 12569 12570 12571 12572 12573 12574 12575 12576 12577 12578 12579 12580 12581 12582 12583 12584 12585 12586 12587 12588 12589 12590 12591 12592 12593 12594 12595 12596 12597 12598 12599 12600 12601 12602 12603 12604 12605 12606 12607 12608 12609 12610 12611 12612 12613 12614 12615 12616 12617 12618 12619 12620 12621 12622 12623 12624 12625 12626 12627 12628 12629 12630 12631 12632 12633 12634 12635 12636 12637 12638 12639 12640 12641 12642 12643 12644 12645 12646 12647 12648 12649 12650 12651 12652 12653 12654 12655 12656 12657 12658 12659 12660 12661 12662 12663 12664 12665 12666 12667 12668 12669 12670 12671 12672 12673 12674 12675 12676 12677 12678 12679 12680 12681 12682 12683 12684 12685 12686 12687 12688 12689 12690 12691 12692 12693 12694 12695 12696 12697 12698 12699 12700 12701 12702 12703 12704 12705 12706 12707 12708 12709 12710 12711 12712 12713 12714 12715 12716 12717 12718 12719 12720 12721 12722 12723 12724 12725 12726 12727 12728 12729 12730 12731 12732 12733 12734 12735 12736 12737 12738 12739 12740 12741 12742 12743 12744 12745 12746 12747 12748 12749 12750 12751 12752 12753 12754 12755 12756 12757 12758 12759 12760 12761 12762 12763 12764 12765 12766 12767 12768 12769 12770 12771 12772 12773 12774 12775 12776 12777 12778 12779 12780 12781 12782 12783 12784 12785 12786 12787 12788 12789 12790 12791 12792 12793 12794 12795 12796 12797 12798 12799 12800 12801 12802 12803 12804 12805 12806 12807 12808 12809 12810 12811 12812 12813 12814 12815 12816 12817 12818 12819 12820 12821 12822 12823 12824 12825 12826 12827 12828 12829 12830 12831 12832 12833 12834 12835 12836 12837 12838 12839 12840 12841 12842 12843 12844 12845 12846 12847 12848 12849 12850 12851 12852 12853 12854 12855 12856 12857 12858 12859 12860 12861 12862 12863 12864 12865 12866 12867 12868 12869 12870 12871 12872 12873 12874 12875 12876 12877 12878 12879 12880 12881 12882 12883 12884 12885 12886 12887 12888 12889 12890 12891 12892 12893 12894 12895 12896 12897 12898 12899 12900 12901 12902 12903 12904 12905 12906 12907 12908 12909 12910 12911 12912 12913 12914 12915 12916 12917 12918 12919 12920 12921 12922 12923 12924 12925 12926 12927 12928 12929 12930 12931 12932 12933 12934 12935 12936 12937 12938 12939 12940 12941 12942 12943 12944 12945 12946 12947 12948 12949 12950 12951 12952 12953 12954 12955 12956 12957 12958 12959 12960 12961 12962 12963 12964 12965 12966 12967 12968 12969 12970 12971 12972 12973 12974 12975 12976 12977 12978 12979 12980 12981 12982 12983 12984 12985 12986 12987 12988 12989 12990 12991 12992 12993 12994 12995 12996 12997 12998 12999 13000 13001 13002 13003 13004 13005 13006 13007 13008 13009 13010 13011 13012 13013 13014 13015 13016 13017 13018 13019 13020 13021 13022 13023 13024 13025 13026 13027 13028 13029 13030 13031 13032 13033 13034 13035 13036 13037 13038 13039 13040 13041 13042 13043 13044 13045 13046 13047 13048 13049 13050 13051 13052 13053 13054 13055 13056 13057 13058 13059 13060 13061 13062 13063 13064 13065 13066 13067 13068 13069 13070 13071 13072 13073 13074 13075 13076 13077 13078 13079 13080 13081 13082 13083 13084 13085 13086 13087 13088 13089 13090 13091 13092 13093 13094 13095 13096 13097 13098 13099 13100 13101 13102 13103 13104 13105 13106 13107 13108 13109 13110 13111 13112 13113 13114 13115 13116 13117 13118 13119 13120 13121 13122 13123 13124 13125 13126 13127 13128 13129 13130 13131 13132 13133 13134 13135 13136 13137 13138 13139 13140 13141 13142 13143 13144 13145 13146 13147 13148 13149 13150 13151 13152 13153 13154 13155 13156 13157 13158 13159 13160 13161 13162 13163 13164 13165 13166 13167 13168 13169 13170 13171 13172 13173 13174 13175 13176 13177 13178 13179 13180 13181 13182 13183 13184 13185 13186 13187 13188 13189 13190 13191 13192 13193 13194 13195 13196 13197 13198 13199 13200 13201 13202 13203 13204 13205 13206 13207 13208 13209 13210 13211 13212 13213 13214 13215 13216 13217 13218 13219 13220 13221 13222 13223 13224 13225 13226 13227 13228 13229 13230 13231 13232 13233 13234 13235 13236 13237 13238 13239 13240 13241 13242 13243 13244 13245 13246 13247 13248 13249 13250 13251 13252 13253 13254 13255 13256 13257 13258 13259 13260 13261 13262 13263 13264 13265 13266 13267 13268 13269 13270 13271 13272 13273 13274 13275 13276 13277 13278 13279 13280 13281 13282 13283 13284 13285 13286 13287 13288 13289 13290 13291 13292 13293 13294 13295 13296 13297 13298 13299 13300 13301 13302 13303 13304 13305 13306 13307 13308 13309 13310 13311 13312 13313 13314 13315 13316 13317 13318 13319 13320 13321 13322 13323 13324 13325 13326 13327 13328 13329 13330 13331 13332 13333 13334 13335 13336 13337 13338 13339 13340 13341 13342 13343 13344 13345 13346 13347 13348 13349 13350 13351 13352 13353 13354 13355 13356 13357 13358 13359 13360 13361 13362 13363 13364 13365 13366 13367 13368 13369 13370 13371 13372 13373 13374 13375 13376 13377 13378 13379 13380 13381 13382 13383 13384 13385 13386 13387 13388 13389 13390 13391 13392 13393 13394 13395 13396 13397 13398 13399 13400 13401 13402 13403 13404 13405 13406 13407 13408 13409 13410 13411 13412 13413 13414 13415 13416 13417 13418 13419 13420 13421 13422 13423 13424 13425 13426 13427 13428 13429 13430 13431 13432 13433 13434 13435 13436 13437 13438 13439 13440 13441 13442 13443 13444 13445 13446 13447 13448 13449 13450 13451 13452 13453 13454 13455 13456 13457 13458 13459 13460 13461 13462 13463 13464 13465 13466 13467 13468 13469 13470 13471 13472 13473 13474 13475 13476 13477 13478 13479 13480 13481 13482 13483 13484 13485 13486 13487 13488 13489 13490 13491 13492 13493 13494 13495 13496 13497 13498 13499 13500 13501 13502 13503 13504 13505 13506 13507 13508 13509 13510 13511 13512 13513 13514 13515 13516 13517 13518 13519 13520 13521 13522 13523 13524 13525 13526 13527 13528 13529 13530 13531 13532 13533 13534 13535 13536 13537 13538 13539 13540 13541 13542 13543 13544 13545 13546 13547 13548 13549 13550 13551 13552 13553 13554 13555 13556 13557 13558 13559 13560 13561 13562 13563 13564 13565 13566 13567 13568 13569 13570 13571 13572 13573 13574 13575 13576 13577 13578 13579 13580 13581 13582 13583 13584 13585 13586 13587 13588 13589 13590 13591 13592 13593 13594 13595 13596 13597 13598 13599 13600 13601 13602 13603 13604 13605 13606 13607 13608 13609 13610 13611 13612 13613 13614 13615 13616 13617 13618 13619 13620 13621 13622 13623 13624 13625 13626 13627 13628 13629 13630 13631 13632 13633 13634 13635 13636 13637 13638 13639 13640 13641 13642 13643 13644 13645 13646 13647 13648 13649 13650 13651 13652 13653 13654 13655 13656 13657 13658 13659 13660 13661 13662 13663 13664 13665 13666 13667 13668 13669 13670 13671 13672 13673 13674 13675 13676 13677 13678 13679 13680 13681 13682 13683 13684 13685 13686 13687 13688 13689 13690 13691 13692 13693 13694 13695 13696 13697 13698 13699 13700 13701 13702 13703 13704 13705 13706 13707 13708 13709 13710 13711 13712 13713 13714 13715 13716 13717 13718 13719 13720 13721 13722 13723 13724 13725 13726 13727 13728 13729 13730 13731 13732 13733 13734 13735 13736 13737 13738 13739 13740 13741 13742 13743 13744 13745 13746 13747 13748 13749 13750 13751 13752 13753 13754 13755 13756 13757 13758 13759 13760 13761 13762 13763 13764 13765 13766 13767 13768 13769 13770 13771 13772 13773 13774 13775 13776 13777 13778 13779 13780 13781 13782 13783 13784 13785 13786 13787 13788 13789 13790 13791 13792 13793 13794 13795 13796 13797 13798 13799 13800 13801 13802 13803 13804 13805 13806 13807 13808 13809 13810 13811 13812 13813 13814 13815 13816 13817 13818 13819 13820 13821 13822 13823 13824 13825 13826 13827 13828 13829 13830 13831 13832 13833 13834 13835 13836 13837 13838 13839 13840 13841 13842 13843 13844 13845 13846 13847 13848 13849 13850 13851 13852 13853 13854 13855 13856 13857 13858 13859 13860 13861 13862 13863 13864 13865 13866 13867 13868 13869 13870 13871 13872 13873 13874 13875 13876 13877 13878 13879 13880 13881 13882 13883 13884 13885 13886 13887 13888 13889 13890 13891 13892 13893 13894 13895 13896 13897 13898 13899 13900 13901 13902 13903 13904 13905 13906 13907 13908 13909 13910 13911 13912 13913 13914 13915 13916 13917 13918 13919 13920 13921 13922 13923 13924 13925 13926 13927 13928 13929 13930 13931 13932 13933 13934 13935 13936 13937 13938 13939 13940 13941 13942 13943 13944 13945 13946 13947 13948 13949 13950 13951 13952 13953 13954 13955 13956 13957 13958 13959 13960 13961 13962 13963 13964 13965 13966 13967 13968 13969 13970 13971 13972 13973 13974 13975 13976 13977 13978 13979 13980 13981 13982 13983 13984 13985 13986 13987 13988 13989 13990 13991 13992 13993 13994 13995 13996 13997 13998 13999 14000 14001 14002 14003 14004 14005 14006 14007 14008 14009 14010 14011 14012 14013 14014 14015 14016 14017 14018 14019 14020 14021 14022 14023 14024 14025 14026 14027 14028 14029 14030 14031 14032 14033 14034 14035 14036 14037 14038 14039 14040 14041 14042 14043 14044 14045 14046 14047 14048 14049 14050 14051 14052 14053 14054 14055 14056 14057 14058 14059 14060 14061 14062 14063 14064 14065 14066 14067 14068 14069 14070 14071 14072 14073 14074 14075 14076 14077 14078 14079 14080 14081 14082 14083 14084 14085 14086 14087 14088 14089 14090 14091 14092 14093 14094 14095 14096 14097 14098 14099 14100 14101 14102 14103 14104 14105 14106 14107 14108 14109 14110 14111 14112 14113 14114 14115 14116 14117 14118 14119 14120 14121 14122 14123 14124 14125 14126 14127 14128 14129 14130 14131 14132 14133 14134 14135 14136 14137 14138 14139 14140 14141 14142 14143 14144 14145 14146 14147 14148 14149 14150 14151 14152 14153 14154 14155 14156 14157 14158 14159 14160 14161 14162 14163 14164 14165 14166 14167 14168 14169 14170 14171 14172 14173 14174 14175 14176 14177 14178 14179 14180 14181 14182 14183 14184 14185 14186 14187 14188 14189 14190 14191 14192 14193 14194 14195 14196 14197 14198 14199 14200 14201 14202 14203 14204 14205 14206 14207 14208 14209 14210 14211 14212 14213 14214 14215 14216 14217 14218 14219 14220 14221 14222 14223 14224 14225 14226 14227 14228 14229 14230 14231 14232 14233 14234 14235 14236 14237 14238 14239 14240 14241 14242 14243 14244 14245 14246 14247 14248 14249 14250 14251 14252 14253 14254 14255 14256 14257 14258 14259 14260 14261 14262 14263 14264 14265 14266 14267 14268 14269 14270 14271 14272 14273 14274 14275 14276 14277 14278 14279 14280 14281 14282 14283 14284 14285 14286 14287 14288 14289 14290 14291 14292 14293 14294 14295 14296 14297 14298 14299 14300 14301 14302 14303 14304 14305 14306 14307 14308 14309 14310 14311 14312 14313 14314 14315 14316 14317 14318 14319 14320 14321 14322 14323 14324 14325 14326 14327 14328 14329 14330 14331 14332 14333 14334 14335 14336 14337 14338 14339 14340 14341 14342 14343 14344 14345 14346 14347 14348 14349 14350 14351 14352 14353 14354 14355 14356 14357 14358 14359 14360 14361 14362 14363 14364 14365 14366 14367 14368 14369 14370 14371 14372 14373 14374 14375 14376 14377 14378 14379 14380 14381 14382 14383 14384 14385 14386 14387 14388 14389 14390 14391 14392 14393 14394 14395 14396 14397 14398 14399 14400 14401 14402 14403 14404 14405 14406 14407 14408 14409 14410 14411 14412 14413 14414 14415 14416 14417 14418 14419 14420 14421 14422 14423 14424 14425 14426 14427 14428 14429 14430 14431 14432 14433 14434 14435 14436 14437 14438 14439 14440 14441 14442 14443 14444 14445 14446 14447 14448 14449 14450 14451 14452 14453 14454 14455 14456 14457 14458 14459 14460 14461 14462 14463 14464 14465 14466 14467 14468 14469 14470 14471 14472 14473 14474 14475 14476 14477 14478 14479 14480 14481 14482 14483 14484 14485 14486 14487 14488 14489 14490 14491 14492 14493 14494 14495 14496 14497 14498 14499 14500 14501 14502 14503 14504 14505 14506 14507 14508 14509 14510 14511 14512 14513 14514 14515 14516 14517 14518 14519 14520 14521 14522 14523 14524 14525 14526 14527 14528 14529 14530 14531 14532 14533 14534 14535 14536 14537 14538 14539 14540 14541 14542 14543 14544 14545 14546 14547 14548 14549 14550 14551 14552 14553 14554 14555 14556 14557 14558 14559 14560 14561 14562 14563 14564 14565 14566 14567 14568 14569 14570 14571 14572 14573 14574 14575 14576 14577 14578 14579 14580 14581 14582 14583 14584 14585 14586 14587 14588 14589 14590 14591 14592 14593 14594 14595 14596 14597 14598 14599 14600 14601 14602 14603 14604 14605 14606 14607 14608 14609 14610 14611 14612 14613 14614 14615 14616 14617 14618 14619 14620 14621 14622 14623 14624 14625 14626 14627 14628 14629 14630 14631 14632 14633 14634 14635 14636 14637 14638 14639 14640 14641 14642 14643 14644 14645 14646 14647 14648 14649 14650 14651 14652 14653 14654 14655 14656 14657 14658 14659 14660 14661 14662 14663 14664 14665 14666 14667 14668 14669 14670 14671 14672 14673 14674 14675 14676 14677 14678 14679 14680 14681 14682 14683 14684 14685 14686 14687 14688 14689 14690 14691 14692 14693 14694 14695 14696 14697 14698 14699 14700 14701 14702 14703 14704 14705 14706 14707 14708 14709 14710 14711 14712 14713 14714 14715 14716 14717 14718 14719 14720 14721 14722 14723 14724 14725 14726 14727 14728 14729 14730 14731 14732 14733 14734 14735 14736 14737 14738 14739 14740 14741 14742 14743 14744 14745 14746 14747 14748 14749 14750 14751 14752 14753 14754 14755 14756 14757 14758 14759 14760 14761 14762 14763 14764 14765 14766 14767 14768 14769 14770 14771 14772 14773 14774 14775 14776 14777 14778 14779 14780 14781 14782 14783 14784 14785 14786 14787 14788 14789 14790 14791 14792 14793 14794 14795 14796 14797 14798 14799 14800 14801 14802 14803 14804 14805 14806 14807 14808 14809 14810 14811 14812 14813 14814 14815 14816 14817 14818 14819 14820 14821 14822 14823 14824 14825 14826 14827 14828 14829 14830 14831 14832 14833 14834 14835 14836 14837 14838 14839 14840 14841 14842 14843 14844 14845 14846 14847 14848 14849 14850 14851 14852 14853 14854 14855 14856 14857 14858 14859 14860 14861 14862 14863 14864 14865 14866 14867 14868 14869 14870 14871 14872 14873 14874 14875 14876 14877 14878 14879 14880 14881 14882 14883 14884 14885 14886 14887 14888 14889 14890 14891 14892 14893 14894 14895 14896 14897 14898 14899 14900 14901 14902 14903 14904 14905 14906 14907 14908 14909 14910 14911 14912 14913 14914 14915 14916 14917 14918 14919 14920 14921 14922 14923 14924 14925 14926 14927 14928 14929 14930 14931 14932 14933 14934 14935 14936 14937 14938 14939 14940 14941 14942 14943 14944 14945 14946 14947 14948 14949 14950 14951 14952 14953 14954 14955 14956 14957 14958 14959 14960 14961 14962 14963 14964 14965 14966 14967 14968 14969 14970 14971 14972 14973 14974 14975 14976 14977 14978 14979 14980 14981 14982 14983 14984 14985 14986 14987 14988 14989 14990 14991 14992 14993 14994 14995 14996 14997 14998 14999 15000 15001 15002 15003 15004 15005 15006 15007 15008 15009 15010 15011 15012 15013 15014 15015 15016 15017 15018 15019 15020 15021 15022 15023 15024 15025 15026 15027 15028 15029 15030 15031 15032 15033 15034 15035 15036 15037 15038 15039 15040 15041 15042 15043 15044 15045 15046 15047 15048 15049 15050 15051 15052 15053 15054 15055 15056 15057 15058 15059 15060 15061 15062 15063 15064 15065 15066 15067 15068 15069 15070 15071 15072 15073 15074 15075 15076 15077 15078 15079 15080 15081 15082 15083 15084 15085 15086 15087 15088 15089 15090 15091 15092 15093 15094 15095 15096 15097 15098 15099 15100 15101 15102 15103 15104 15105 15106 15107 15108 15109 15110 15111 15112 15113 15114 15115 15116 15117 15118 15119 15120 15121 15122 15123 15124 15125 15126 15127 15128 15129 15130 15131 15132 15133 15134 15135 15136 15137 15138 15139 15140 15141 15142 15143 15144 15145 15146 15147 15148 15149 15150 15151 15152 15153 15154 15155 15156 15157 15158 15159 15160 15161 15162 15163 15164 15165 15166 15167 15168 15169 15170 15171 15172 15173 15174 15175 15176 15177 15178 15179 15180 15181 15182 15183 15184 15185 15186 15187 15188 15189 15190 15191 15192 15193 15194 15195 15196 15197 15198 15199 15200 15201 15202 15203 15204 15205 15206 15207 15208 15209 15210 15211 15212 15213 15214 15215 15216 15217 15218 15219 15220 15221 15222 15223 15224 15225 15226 15227 15228 15229 15230 15231 15232 15233 15234 15235 15236 15237 15238 15239 15240 15241 15242 15243 15244 15245 15246 15247 15248 15249 15250 15251 15252 15253 15254 15255 15256 15257 15258 15259 15260 15261 15262 15263 15264 15265 15266 15267 15268 15269 15270 15271 15272 15273 15274 15275 15276 15277 15278 15279 15280 15281 15282 15283 15284 15285 15286 15287 15288 15289 15290 15291 15292 15293 15294 15295 15296 15297 15298 15299 15300 15301 15302 15303 15304 15305 15306 15307 15308 15309 15310 15311 15312 15313 15314 15315 15316 15317 15318 15319 15320 15321 15322 15323 15324 15325 15326 15327 15328 15329 15330 15331 15332 15333 15334 15335 15336 15337 15338 15339 15340 15341 15342 15343 15344 15345 15346 15347 15348 15349 15350 15351 15352 15353 15354 15355 15356 15357 15358 15359 15360 15361 15362 15363 15364 15365 15366 15367 15368 15369 15370 15371 15372 15373 15374 15375 15376 15377 15378 15379 15380 15381 15382 15383 15384 15385 15386 15387 15388 15389 15390 15391 15392 15393 15394 15395 15396 15397 15398 15399 15400 15401 15402 15403 15404 15405 15406 15407 15408 15409 15410 15411 15412 15413 15414 15415 15416 15417 15418 15419 15420 15421 15422 15423 15424 15425 15426 15427 15428 15429 15430 15431 15432 15433 15434 15435 15436 15437 15438 15439 15440 15441 15442 15443 15444 15445 15446 15447 15448 15449 15450 15451 15452 15453 15454 15455 15456 15457 15458 15459 15460 15461 15462 15463 15464 15465 15466 15467 15468 15469 15470 15471 15472 15473 15474 15475 15476 15477 15478 15479 15480 15481 15482 15483 15484 15485 15486 15487 15488 15489 15490 15491 15492 15493 15494 15495 15496 15497 15498 15499 15500 15501 15502 15503 15504 15505 15506 15507 15508 15509 15510 15511 15512 15513 15514 15515 15516 15517 15518 15519 15520 15521 15522 15523 15524 15525 15526 15527 15528 15529 15530 15531 15532 15533 15534 15535 15536 15537 15538 15539 15540 15541 15542 15543 15544 15545 15546 15547 15548 15549 15550 15551 15552 15553 15554 15555 15556 15557 15558 15559 15560 15561 15562 15563 15564 15565 15566 15567 15568 15569 15570 15571 15572 15573 15574 15575 15576 15577 15578 15579 15580 15581 15582 15583 15584 15585 15586 15587 15588 15589 15590 15591 15592 15593 15594 15595 15596 15597 15598 15599 15600 15601 15602 15603 15604 15605 15606 15607 15608 15609 15610 15611 15612 15613 15614 15615 15616 15617 15618 15619 15620 15621 15622 15623 15624 15625 15626 15627 15628 15629 15630 15631 15632 15633 15634 15635 15636 15637 15638 15639 15640 15641 15642 15643 15644 15645 15646 15647 15648 15649 15650 15651 15652 15653 15654 15655 15656 15657 15658 15659 15660 15661 15662 15663 15664 15665 15666 15667 15668 15669 15670 15671 15672 15673 15674 15675 15676 15677 15678 15679 15680 15681 15682 15683 15684 15685 15686 15687 15688 15689 15690 15691 15692 15693 15694 15695 15696 15697 15698 15699 15700 15701 15702 15703 15704 15705 15706 15707 15708 15709 15710 15711 15712 15713 15714 15715 15716 15717 15718 15719 15720 15721 15722 15723 15724 15725 15726 15727 15728 15729 15730 15731 15732 15733 15734 15735 15736 15737 15738 15739 15740 15741 15742 15743 15744 15745 15746 15747 15748 15749 15750 15751 15752 15753 15754 15755 15756 15757 15758 15759 15760 15761 15762 15763 15764 15765 15766 15767 15768 15769 15770 15771 15772 15773 15774 15775 15776 15777 15778 15779 15780 15781 15782 15783 15784 15785 15786 15787 15788 15789 15790 15791 15792 15793 15794 15795 15796 15797 15798 15799 15800 15801 15802 15803 15804 15805 15806 15807 15808 15809 15810 15811 15812 15813 15814 15815 15816 15817 15818 15819 15820 15821 15822 15823 15824 15825 15826 15827 15828 15829 15830 15831 15832 15833 15834 15835 15836 15837 15838 15839 15840 15841 15842 15843 15844 15845 15846 15847 15848 15849 15850 15851 15852 15853 15854 15855 15856 15857 15858 15859 15860 15861 15862 15863 15864 15865 15866 15867 15868 15869 15870 15871 15872 15873 15874 15875 15876 15877 15878 15879 15880 15881 15882 15883 15884 15885 15886 15887 15888 15889 15890 15891 15892 15893 15894 15895 15896 15897 15898 15899 15900 15901 15902 15903 15904 15905 15906 15907 15908 15909 15910 15911 15912 15913 15914 15915 15916 15917 15918 15919 15920 15921 15922 15923 15924 15925 15926 15927 15928 15929 15930 15931 15932 15933 15934 15935 15936 15937 15938 15939 15940 15941 15942 15943 15944 15945 15946 15947 15948 15949 15950 15951 15952 15953 15954 15955 15956 15957 15958 15959 15960 15961 15962 15963 15964 15965 15966 15967 15968 15969 15970 15971 15972 15973 15974 15975 15976 15977 15978 15979 15980 15981 15982 15983 15984 15985 15986 15987 15988 15989 15990 15991 15992 15993 15994 15995 15996 15997 15998 15999 16000 16001 16002 16003 16004 16005 16006 16007 16008 16009 16010 16011 16012 16013 16014 16015 16016 16017 16018 16019 16020 16021 16022 16023 16024 16025 16026 16027 16028 16029 16030 16031 16032 16033 16034 16035 16036 16037 16038 16039 16040 16041 16042 16043 16044 16045 16046 16047 16048 16049 16050 16051 16052 16053 16054 16055 16056 16057 16058 16059 16060 16061 16062 16063 16064 16065 16066 16067 16068 16069 16070 16071 16072 16073 16074 16075 16076 16077 16078 16079 16080 16081 16082 16083 16084 16085 16086 16087 16088 16089 16090 16091 16092 16093 16094 16095 16096 16097 16098 16099 16100 16101 16102 16103 16104 16105 16106 16107 16108 16109 16110 16111 16112 16113 16114 16115 16116 16117 16118 16119 16120 16121 16122 16123 16124 16125 16126 16127 16128 16129 16130 16131 16132 16133 16134 16135 16136 16137 16138 16139 16140 16141 16142 16143 16144 16145 16146 16147 16148 16149 16150 16151 16152 16153 16154 16155 16156 16157 16158 16159 16160 16161 16162 16163 16164 16165 16166 16167 16168 16169 16170 16171 16172 16173 16174 16175 16176 16177 16178 16179 16180 16181 16182 16183 16184 16185 16186 16187 16188 16189 16190 16191 16192 16193 16194 16195 16196 16197 16198 16199 16200 16201 16202 16203 16204 16205 16206 16207 16208 16209 16210 16211 16212 16213 16214 16215 16216 16217 16218 16219 16220 16221 16222 16223 16224 16225 16226 16227 16228 16229 16230 16231 16232 16233 16234 16235 16236 16237 16238 16239 16240 16241 16242 16243 16244 16245 16246 16247 16248 16249 16250 16251 16252 16253 16254 16255 16256 16257 16258 16259 16260 16261 16262 16263 16264 16265 16266 16267 16268 16269 16270 16271 16272 16273 16274 16275 16276 16277 16278 16279 16280 16281 16282 16283 16284 16285 16286 16287 16288 16289 16290 16291 16292 16293 16294 16295 16296 16297 16298 16299 16300 16301 16302 16303 16304 16305 16306 16307 16308 16309 16310 16311 16312 16313 16314 16315 16316 16317 16318 16319 16320 16321 16322 16323 16324 16325 16326 16327 16328 16329 16330 16331 16332 16333 16334 16335 16336 16337 16338 16339 16340 16341 16342 16343 16344 16345 16346 16347 16348 16349 16350 16351 16352 16353 16354 16355 16356 16357 16358 16359 16360 16361 16362 16363 16364 16365 16366 16367 16368 16369 16370 16371 16372 16373 16374 16375 16376 16377 16378 16379 16380 16381 16382 16383 16384 16385 16386 16387 16388 16389 16390 16391 16392 16393 16394 16395 16396 16397 16398 16399 16400 16401 16402 16403 16404 16405 16406 16407 16408 16409 16410 16411 16412 16413 16414 16415 16416 16417 16418 16419 16420 16421 16422 16423 16424 16425 16426 16427 16428 16429 16430 16431 16432 16433 16434 16435 16436 16437 16438 16439 16440 16441 16442 16443 16444 16445 16446 16447 16448 16449 16450 16451 16452 16453 16454 16455 16456 16457 16458 16459 16460 16461 16462 16463 16464 16465 16466 16467 16468 16469 16470 16471 16472 16473 16474 16475 16476 16477 16478 16479 16480 16481 16482 16483 16484 16485 16486 16487 16488 16489 16490 16491 16492 16493 16494 16495 16496 16497 16498 16499 16500 16501 16502 16503 16504 16505 16506 16507 16508 16509 16510 16511 16512 16513 16514 16515 16516 16517 16518 16519 16520 16521 16522 16523 16524 16525 16526 16527 16528 16529 16530 16531 16532 16533 16534 16535 16536 16537 16538 16539 16540 16541 16542 16543 16544 16545 16546 16547 16548 16549 16550 16551 16552 16553 16554 16555 16556 16557 16558 16559 16560 16561 16562 16563 16564 16565 16566 16567 16568 16569 16570 16571 16572 16573 16574 16575 16576 16577 16578 16579 16580 16581 16582 16583 16584 16585 16586 16587 16588 16589 16590 16591 16592 16593 16594 16595 16596 16597 16598 16599 16600 16601 16602 16603 16604 16605 16606 16607 16608 16609 16610 16611 16612 16613 16614 16615 16616 16617 16618 16619 16620 16621 16622 16623 16624 16625 16626 16627 16628 16629 16630 16631 16632 16633 16634 16635 16636 16637 16638 16639 16640 16641 16642 16643 16644 16645 16646 16647 16648 16649 16650 16651 16652 16653 16654 16655 16656 16657 16658 16659 16660 16661 16662 16663 16664 16665 16666 16667 16668 16669 16670 16671 16672 16673 16674 16675 16676 16677 16678 16679 16680 16681 16682 16683 16684 16685 16686 16687 16688 16689 16690 16691 16692 16693 16694 16695 16696 16697 16698 16699 16700 16701 16702 16703 16704 16705 16706 16707 16708 16709 16710 16711 16712 16713 16714 16715 16716 16717 16718 16719 16720 16721 16722 16723 16724 16725 16726 16727 16728 16729 16730 16731 16732 16733 16734 16735 16736 16737 16738 16739 16740 16741 16742 16743 16744 16745 16746 16747 16748 16749 16750 16751 16752 16753 16754 16755 16756 16757 16758 16759 16760 16761 16762 16763 16764 16765 16766 16767 16768 16769 16770 16771 16772 16773 16774 16775 16776 16777 16778 16779 16780 16781 16782 16783 16784 16785 16786 16787 16788 16789 16790 16791 16792 16793 16794 16795 16796 16797 16798 16799 16800 16801 16802 16803 16804 16805 16806 16807 16808 16809 16810 16811 16812 16813 16814 16815 16816 16817 16818 16819 16820 16821 16822 16823 16824 16825 16826 16827 16828 16829 16830 16831 16832 16833 16834 16835 16836 16837 16838 16839 16840 16841 16842 16843 16844 16845 16846 16847 16848 16849 16850 16851 16852 16853 16854 16855 16856 16857 16858 16859 16860 16861 16862 16863 16864 16865 16866 16867 16868 16869 16870 16871 16872 16873 16874 16875 16876 16877 16878 16879 16880 16881 16882 16883 16884 16885 16886 16887 16888 16889 16890 16891 16892 16893 16894 16895 16896 16897 16898 16899 16900 16901 16902 16903 16904 16905 16906 16907 16908 16909 16910 16911 16912 16913 16914 16915 16916 16917 16918 16919 16920 16921 16922 16923 16924 16925 16926 16927 16928 16929 16930 16931 16932 16933 16934 16935 16936 16937 16938 16939 16940 16941 16942 16943 16944 16945 16946 16947 16948 16949 16950 16951 16952 16953 16954 16955 16956 16957 16958 16959 16960 16961 16962 16963 16964 16965 16966 16967 16968 16969 16970 16971 16972 16973 16974 16975 16976 16977 16978 16979 16980 16981 16982 16983 16984 16985 16986 16987 16988 16989 16990 16991 16992 16993 16994 16995 16996 16997 16998 16999 17000 17001 17002 17003 17004 17005 17006 17007 17008 17009 17010 17011 17012 17013 17014 17015 17016 17017 17018 17019 17020 17021 17022 17023 17024 17025 17026 17027 17028 17029 17030 17031 17032 17033 17034 17035 17036 17037 17038 17039 17040 17041 17042 17043 17044 17045 17046 17047 17048 17049 17050 17051 17052 17053 17054 17055 17056 17057 17058 17059 17060 17061 17062 17063 17064 17065 17066 17067 17068 17069 17070 17071 17072 17073 17074 17075 17076 17077 17078 17079 17080 17081 17082 17083 17084 17085 17086 17087 17088 17089 17090 17091 17092 17093 17094 17095 17096 17097 17098 17099 17100 17101 17102 17103 17104 17105 17106 17107 17108 17109 17110 17111 17112 17113 17114 17115 17116 17117 17118 17119 17120 17121 17122 17123 17124 17125 17126 17127 17128 17129 17130 17131 17132 17133 17134 17135 17136 17137 17138 17139 17140 17141 17142 17143 17144 17145 17146 17147 17148 17149 17150 17151 17152 17153 17154 17155 17156 17157 17158 17159 17160 17161 17162 17163 17164 17165 17166 17167 17168 17169 17170 17171 17172 17173 17174 17175 17176 17177 17178 17179 17180 17181 17182 17183 17184 17185 17186 17187 17188 17189 17190 17191 17192 17193 17194 17195 17196 17197 17198 17199 17200 17201 17202 17203 17204 17205 17206 17207 17208 17209 17210 17211 17212 17213 17214 17215 17216 17217 17218 17219 17220 17221 17222 17223 17224 17225 17226 17227 17228 17229 17230 17231 17232 17233 17234 17235 17236 17237 17238 17239 17240 17241 17242 17243 17244 17245 17246 17247 17248 17249 17250 17251 17252 17253 17254 17255 17256 17257 17258 17259 17260 17261 17262 17263 17264 17265 17266 17267 17268 17269 17270 17271 17272 17273 17274 17275 17276 17277 17278 17279 17280 17281 17282 17283 17284 17285 17286 17287 17288 17289 17290 17291 17292 17293 17294 17295 17296 17297 17298 17299 17300 17301 17302 17303 17304 17305 17306 17307 17308 17309 17310 17311 17312 17313 17314 17315 17316 17317 17318 17319 17320 17321 17322 17323 17324 17325 17326 17327 17328 17329 17330 17331 17332 17333 17334 17335 17336 17337 17338 17339 17340 17341 17342 17343 17344 17345 17346 17347 17348 17349 17350 17351 17352 17353 17354 17355 17356 17357 17358 17359 17360 17361 17362 17363 17364 17365 17366 17367 17368 17369 17370 17371 17372 17373 17374 17375 17376 17377 17378 17379 17380 17381 17382 17383 17384 17385 17386 17387 17388 17389 17390 17391 17392 17393 17394 17395 17396 17397 17398 17399 17400 17401 17402 17403 17404 17405 17406 17407 17408 17409 17410 17411 17412 17413 17414 17415 17416 17417 17418 17419 17420 17421 17422 17423 17424 17425 17426 17427 17428 17429 17430 17431 17432 17433 17434 17435 17436 17437 17438 17439 17440 17441 17442 17443 17444 17445 17446 17447 17448 17449 17450 17451 17452 17453 17454 17455 17456 17457 17458 17459 17460 17461 17462 17463 17464 17465 17466 17467 17468 17469 17470 17471 17472 17473 17474 17475 17476 17477 17478 17479 17480 17481 17482 17483 17484 17485 17486 17487 17488 17489 17490 17491 17492 17493 17494 17495 17496 17497 17498 17499 17500 17501 17502 17503 17504 17505 17506 17507 17508 17509 17510 17511 17512 17513 17514 17515 17516 17517 17518 17519 17520 17521 17522 17523 17524 17525 17526 17527 17528 17529 17530 17531 17532 17533 17534 17535 17536 17537 17538 17539 17540 17541 17542 17543 17544 17545 17546 17547 17548 17549 17550 17551 17552 17553 17554 17555 17556 17557 17558 17559 17560 17561 17562 17563 17564 17565 17566 17567 17568 17569 17570 17571 17572 17573 17574 17575 17576 17577 17578 17579 17580 17581 17582 17583 17584 17585 17586 17587 17588 17589 17590 17591 17592 17593 17594 17595 17596 17597 17598 17599 17600 17601 17602 17603 17604 17605 17606 17607 17608 17609 17610 17611 17612 17613 17614 17615 17616 17617 17618 17619 17620 17621 17622 17623 17624 17625 17626 17627 17628 17629 17630 17631 17632 17633 17634 17635 17636 17637 17638 17639 17640 17641 17642 17643 17644 17645 17646 17647 17648 17649 17650 17651 17652 17653 17654 17655 17656 17657 17658 17659 17660 17661 17662 17663 17664 17665 17666 17667 17668 17669 17670 17671 17672 17673 17674 17675 17676 17677 17678 17679 17680 17681 17682 17683 17684 17685 17686 17687 17688 17689 17690 17691 17692 17693 17694 17695 17696 17697 17698 17699 17700 17701 17702 17703 17704 17705 17706 17707 17708 17709 17710 17711 17712 17713 17714 17715 17716 17717 17718 17719 17720 17721 17722 17723 17724 17725 17726 17727 17728 17729 17730 17731 17732 17733 17734 17735 17736 17737 17738 17739 17740 17741 17742 17743 17744 17745 17746 17747 17748 17749 17750 17751 17752 17753 17754 17755 17756 17757 17758 17759 17760 17761 17762 17763 17764 17765 17766 17767 17768 17769 17770 17771 17772 17773 17774 17775 17776 17777 17778 17779 17780 17781 17782 17783 17784 17785 17786 17787 17788 17789 17790 17791 17792 17793 17794 17795 17796 17797 17798 17799 17800 17801 17802 17803 17804 17805 17806 17807 17808 17809 17810 17811 17812 17813 17814 17815 17816 17817 17818 17819 17820 17821 17822 17823 17824 17825 17826 17827 17828 17829 17830 17831 17832 17833 17834 17835 17836 17837 17838 17839 17840 17841 17842 17843 17844 17845 17846 17847 17848 17849 17850 17851 17852 17853 17854 17855 17856 17857 17858 17859 17860 17861 17862 17863 17864 17865 17866 17867 17868 17869 17870 17871 17872 17873 17874 17875 17876 17877 17878 17879 17880 17881 17882 17883 17884 17885 17886 17887 17888 17889 17890 17891 17892 17893 17894 17895 17896 17897 17898 17899 17900 17901 17902 17903 17904 17905 17906 17907 17908 17909 17910 17911 17912 17913 17914 17915 17916 17917 17918 17919 17920 17921 17922 17923 17924 17925 17926 17927 17928 17929 17930 17931 17932 17933 17934 17935 17936 17937 17938 17939 17940 17941 17942 17943 17944 17945 17946 17947 17948 17949 17950 17951 17952 17953 17954 17955 17956 17957 17958 17959 17960 17961 17962 17963 17964 17965 17966 17967 17968 17969 17970 17971 17972 17973 17974 17975 17976 17977 17978 17979 17980 17981 17982 17983 17984 17985 17986 17987 17988 17989 17990 17991 17992 17993 17994 17995 17996 17997 17998 17999 18000 18001 18002 18003 18004 18005 18006 18007 18008 18009 18010 18011 18012 18013 18014 18015 18016 18017 18018 18019 18020 18021 18022 18023 18024 18025 18026 18027 18028 18029 18030 18031 18032 18033 18034 18035 18036 18037 18038 18039 18040 18041 18042 18043 18044 18045 18046 18047 18048 18049 18050 18051 18052 18053 18054 18055 18056 18057 18058 18059 18060 18061 18062 18063 18064 18065 18066 18067 18068 18069 18070 18071 18072 18073 18074 18075 18076 18077 18078 18079 18080 18081 18082 18083 18084 18085 18086 18087 18088 18089 18090 18091 18092 18093 18094 18095 18096 18097 18098 18099 18100 18101 18102 18103 18104 18105 18106 18107 18108 18109 18110 18111 18112 18113 18114 18115 18116 18117 18118 18119 18120 18121 18122 18123 18124 18125 18126 18127 18128 18129 18130 18131 18132 18133 18134 18135 18136 18137 18138 18139 18140 18141 18142 18143 18144 18145 18146 18147 18148 18149 18150 18151 18152 18153 18154 18155 18156 18157 18158 18159 18160 18161 18162 18163 18164 18165 18166 18167 18168 18169 18170 18171 18172 18173 18174 18175 18176 18177 18178 18179 18180 18181 18182 18183 18184 18185 18186 18187 18188 18189 18190 18191 18192 18193 18194 18195 18196 18197 18198 18199 18200 18201 18202 18203 18204 18205 18206 18207 18208 18209 18210 18211 18212 18213 18214 18215 18216 18217 18218 18219 18220 18221 18222 18223 18224 18225 18226 18227 18228 18229 18230 18231 18232 18233 18234 18235 18236 18237 18238 18239 18240 18241 18242 18243 18244 18245 18246 18247 18248 18249 18250 18251 18252 18253 18254 18255 18256 18257 18258 18259 18260 18261 18262 18263 18264 18265 18266 18267 18268 18269 18270 18271 18272 18273 18274 18275 18276 18277 18278 18279 18280 18281 18282 18283 18284 18285 18286 18287 18288 18289 18290 18291 18292 18293 18294 18295 18296 18297 18298 18299 18300 18301 18302 18303 18304 18305 18306 18307 18308 18309 18310 18311 18312 18313 18314 18315 18316 18317 18318 18319 18320 18321 18322 18323 18324 18325 18326 18327 18328 18329 18330 18331 18332 18333 18334 18335 18336 18337 18338 18339 18340 18341 18342 18343 18344 18345 18346 18347 18348 18349 18350 18351 18352 18353 18354 18355 18356 18357 18358 18359 18360 18361 18362 18363 18364 18365 18366 18367 18368 18369 18370 18371 18372 18373 18374 18375 18376 18377 18378 18379 18380 18381 18382 18383 18384 18385 18386 18387 18388 18389 18390 18391 18392 18393 18394 18395 18396 18397 18398 18399 18400 18401 18402 18403 18404 18405 18406 18407 18408 18409 18410 18411 18412 18413 18414 18415 18416 18417 18418 18419 18420 18421 18422 18423 18424 18425 18426 18427 18428 18429 18430 18431 18432 18433 18434 18435 18436 18437 18438 18439 18440 18441 18442 18443 18444 18445 18446 18447 18448 18449 18450 18451 18452 18453 18454 18455 18456 18457 18458 18459 18460 18461 18462 18463 18464 18465 18466 18467 18468 18469 18470 18471 18472 18473 18474 18475 18476 18477 18478 18479 18480 18481 18482 18483 18484 18485 18486 18487 18488 18489 18490 18491 18492 18493 18494 18495 18496 18497 18498 18499 18500 18501 18502 18503 18504 18505 18506 18507 18508 18509 18510 18511 18512 18513 18514 18515 18516 18517 18518 18519 18520 18521 18522 18523 18524 18525 18526 18527 18528 18529 18530 18531 18532 18533 18534 18535 18536 18537 18538 18539 18540 18541 18542 18543 18544 18545 18546 18547 18548 18549 18550 18551 18552 18553 18554 18555 18556 18557 18558 18559 18560 18561 18562 18563 18564 18565 18566 18567 18568 18569 18570 18571 18572 18573 18574 18575 18576 18577 18578 18579 18580 18581 18582 18583 18584 18585 18586 18587 18588 18589 18590 18591 18592 18593 18594 18595 18596 18597 18598 18599 18600 18601 18602 18603 18604 18605 18606 18607 18608 18609 18610 18611 18612 18613 18614 18615 18616 18617 18618 18619 18620 18621 18622 18623 18624 18625 18626 18627 18628 18629 18630 18631 18632 18633 18634 18635 18636 18637 18638 18639 18640 18641 18642 18643 18644 18645 18646 18647 18648 18649 18650 18651 18652 18653 18654 18655 18656 18657 18658 18659 18660 18661 18662 18663 18664 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 18675 18676 18677 18678 18679 18680 18681 18682 18683 18684 18685 18686 18687 18688 18689 18690 18691 18692 18693 18694 18695 18696 18697 18698 18699 18700 18701 18702 18703 18704 18705 18706 18707 18708 18709 18710 18711 18712 18713 18714 18715 18716 18717 18718 18719 18720 18721 18722 18723 18724 18725 18726 18727 18728 18729 18730 18731 18732 18733 18734 18735 18736 18737 18738 18739 18740 18741 18742 18743 18744 18745 18746 18747 18748 18749 18750 18751 18752 18753 18754 18755 18756 18757 18758 18759 18760 18761 18762 18763 18764 18765 18766 18767 18768 18769 18770 18771 18772 18773 18774 18775 18776 18777 18778 18779 18780 18781 18782 18783 18784 18785 18786 18787 18788 18789 18790 18791 18792 18793 18794 18795 18796 18797 18798 18799 18800 18801 18802 18803 18804 18805 18806 18807 18808 18809 18810 18811 18812 18813 18814 18815 18816 18817 18818 18819 18820 18821 18822 18823 18824 18825 18826 18827 18828 18829 18830 18831 18832 18833 18834 18835 18836 18837 18838 18839 18840 18841 18842 18843 18844 18845 18846 18847 18848 18849 18850 18851 18852 18853 18854 18855 18856 18857 18858 18859 18860 18861 18862 18863 18864 18865 18866 18867 18868 18869 18870 18871 18872 18873 18874 18875 18876 18877 18878 18879 18880 18881 18882 18883 18884 18885 18886 18887 18888 18889 18890 18891 18892 18893 18894 18895 18896 18897 18898 18899 18900 18901 18902 18903 18904 18905 18906 18907 18908 18909 18910 18911 18912 18913 18914 18915 18916 18917 18918 18919 18920 18921 18922 18923 18924 18925 18926 18927 18928 18929 18930 18931 18932 18933 18934 18935 18936 18937 18938 18939 18940 18941 18942 18943 18944 18945 18946 18947 18948 18949 18950 18951 18952 18953 18954 18955 18956 18957 18958 18959 18960 18961 18962 18963 18964 18965 18966 18967 18968 18969 18970 18971 18972 18973 18974 18975 18976 18977 18978 18979 18980 18981 18982 18983 18984 18985 18986 18987 18988 18989 18990 18991 18992 18993 18994 18995 18996 18997 18998 18999 19000 19001 19002 19003 19004 19005 19006 19007 19008 19009 19010 19011 19012 19013 19014 19015 19016 19017 19018 19019 19020 19021 19022 19023 19024 19025 19026 19027 19028 19029 19030 19031 19032 19033 19034 19035 19036 19037 19038 19039 19040 19041 19042 19043 19044 19045 19046 19047 19048 19049 19050 19051 19052 19053 19054 19055 19056 19057 19058 19059 19060 19061 19062 19063 19064 19065 19066 19067 19068 19069 19070 19071 19072 19073 19074 19075 19076 19077 19078 19079 19080 19081 19082 19083 19084 19085 19086 19087 19088 19089 19090 19091 19092 19093 19094 19095 19096 19097 19098 19099 19100 19101 19102 19103 19104 19105 19106 19107 19108 19109 19110 19111 19112 19113 19114 19115 19116 19117 19118 19119 19120 19121 19122 19123 19124 19125 19126 19127 19128 19129 19130 19131 19132 19133 19134 19135 19136 19137 19138 19139 19140 19141 19142 19143 19144 19145 19146 19147 19148 19149 19150 19151 19152 19153 19154 19155 19156 19157 19158 19159 19160 19161 19162 19163 19164 19165 19166 19167 19168 19169 19170 19171 19172 19173 19174 19175 19176 19177 19178 19179 19180 19181 19182 19183 19184 19185 19186 19187 19188 19189 19190 19191 19192 19193 19194 19195 19196 19197 19198 19199 19200 19201 19202 19203 19204 19205 19206 19207 19208 19209 19210 19211 19212 19213 19214 19215 19216 19217 19218 19219 19220 19221 19222 19223 19224 19225 19226 19227 19228 19229 19230 19231 19232 19233 19234 19235 19236 19237 19238 19239 19240 19241 19242 19243 19244 19245 19246 19247 19248 19249 19250 19251 19252 19253 19254 19255 19256 19257 19258 19259 19260 19261 19262 19263 19264 19265 19266 19267 19268 19269 19270 19271 19272 19273 19274 19275 19276 19277 19278 19279 19280 19281 19282 19283 19284 19285 19286 19287 19288 19289 19290 19291 19292 19293 19294 19295 19296 19297 19298 19299 19300 19301 19302 19303 19304 19305 19306 19307 19308 19309 19310 19311 19312 19313 19314 19315 19316 19317 19318 19319 19320 19321 19322 19323 19324 19325 19326 19327 19328 19329 19330 19331 19332 19333 19334 19335 19336 19337 19338 19339 19340 19341 19342 19343 19344 19345 19346 19347 19348 19349 19350 19351 19352 19353 19354 19355 19356 19357 19358 19359 19360 19361 19362 19363 19364 19365 19366 19367 19368 19369 19370 19371 19372 19373 19374 19375 19376 19377 19378 19379 19380 19381 19382 19383 19384 19385 19386 19387 19388 19389 19390 19391 19392 19393 19394 19395 19396 19397 19398 19399 19400 19401 19402 19403 19404 19405 19406 19407 19408 19409 19410 19411 19412 19413 19414 19415 19416 19417 19418 19419 19420 19421 19422 19423 19424 19425 19426 19427 19428 19429 19430 19431 19432 19433 19434 19435 19436 19437 19438 19439 19440 19441 19442 19443 19444 19445 19446 19447 19448 19449 19450 19451 19452 19453 19454 19455 19456 19457 19458 19459 19460 19461 19462 19463 19464 19465 19466 19467 19468 19469 19470 19471 19472 19473 19474 19475 19476 19477 19478 19479 19480 19481 19482 19483 19484 19485 19486 19487 19488 19489 19490 19491 19492 19493 19494 19495 19496 19497 19498 19499 19500 19501 19502 19503 19504 19505 19506 19507 19508 19509 19510 19511 19512 19513 19514 19515 19516 19517 19518 19519 19520 19521 19522 19523 19524 19525 19526 19527 19528 19529 19530 19531 19532 19533 19534 19535 19536 19537 19538 19539 19540 19541 19542 19543 19544 19545 19546 19547 19548 19549 19550 19551 19552 19553 19554 19555 19556 19557 19558 19559 19560 19561 19562 19563 19564 19565 19566 19567 19568 19569 19570 19571 19572 19573 19574 19575 19576 19577 19578 19579 19580 19581 19582 19583 19584 19585 19586 19587 19588 19589 19590 19591 19592 19593 19594 19595 19596 19597 19598 19599 19600 19601 19602 19603 19604 19605 19606 19607 19608 19609 19610 19611 19612 19613 19614 19615 19616 19617 19618 19619 19620 19621 19622 19623 19624 19625 19626 19627 19628 19629 19630 19631 19632 19633 19634 19635 19636 19637 19638 19639 19640 19641 19642 19643 19644 19645 19646 19647 19648 19649 19650 19651 19652 19653 19654 19655 19656 19657 19658 19659 19660 19661 19662 19663 19664 19665 19666 19667 19668 19669 19670 19671 19672 19673 19674 19675 19676 19677 19678 19679 19680 19681 19682 19683 19684 19685 19686 19687 19688 19689 19690 19691 19692 19693 19694 19695 19696 19697 19698 19699 19700 19701 19702 19703 19704 19705 19706 19707 19708 19709 19710 19711 19712 19713 19714 19715 19716 19717 19718 19719 19720 19721 19722 19723 19724 19725 19726 19727 19728 19729 19730 19731 19732 19733 19734 19735 19736 19737 19738 19739 19740 19741 19742 19743 19744 19745 19746 19747 19748 19749 19750 19751 19752 19753 19754 19755 19756 19757 19758 19759 19760 19761 19762 19763 19764 19765 19766 19767 19768 19769 19770 19771 19772 19773 19774 19775 19776 19777 19778 19779 19780 19781 19782 19783 19784 19785 19786 19787 19788 19789 19790 19791 19792 19793 19794 19795 19796 19797 19798 19799 19800 19801 19802 19803 19804 19805 19806 19807 19808 19809 19810 19811 19812 19813 19814 19815 19816 19817 19818 19819 19820 19821 19822 19823 19824 19825 19826 19827 19828 19829 19830 19831 19832 19833 19834 19835 19836 19837 19838 19839 19840 19841 19842 19843 19844 19845 19846 19847 19848 19849 19850 19851 19852 19853 19854 19855 19856 19857 19858 19859 19860 19861 19862 19863 19864 19865 19866 19867 19868 19869 19870 19871 19872 19873 19874 19875 19876 19877 19878 19879 19880 19881 19882 19883 19884 19885 19886 19887 19888 19889 19890 19891 19892 19893 19894 19895 19896 19897 19898 19899 19900 19901 19902 19903 19904 19905 19906 19907 19908 19909 19910 19911 19912 19913 19914 19915 19916 19917 19918 19919 19920 19921 19922 19923 19924 19925 19926 19927 19928 19929 19930 19931 19932 19933 19934 19935 19936 19937 19938 19939 19940 19941 19942 19943 19944 19945 19946 19947 19948 19949 19950 19951 19952 19953 19954 19955 19956 19957 19958 19959 19960 19961 19962 19963 19964 19965 19966 19967 19968 19969 19970 19971 19972 19973 19974 19975 19976 19977 19978 19979 19980 19981 19982 19983 19984 19985 19986 19987 19988 19989 19990 19991 19992 19993 19994 19995 19996 19997 19998 19999 20000 20001 20002 20003 20004 20005 20006 20007 20008 20009 20010 20011 20012 20013 20014 20015 20016 20017 20018 20019 20020 20021 20022 20023 20024 20025 20026 20027 20028 20029 20030 20031 20032 20033 20034 20035 20036 20037 20038 20039 20040 20041 20042 20043 20044 20045 20046 20047 20048 20049 20050 20051 20052 20053 20054 20055 20056 20057 20058 20059 20060 20061 20062 20063 20064 20065 20066 20067 20068 20069 20070 20071 20072 20073 20074 20075 20076 20077 20078 20079 20080 20081 20082 20083 20084 20085 20086 20087 20088 20089 20090 20091 20092 20093 20094 20095 20096 20097 20098 20099 20100 20101 20102 20103 20104 20105 20106 20107 20108 20109 20110 20111 20112 20113 20114 20115 20116 20117 20118 20119 20120 20121 20122 20123 20124 20125 20126 20127 20128 20129 20130 20131 20132 20133 20134 20135 20136 20137 20138 20139 20140 20141 20142 20143 20144 20145 20146 20147 20148 20149 20150 20151 20152 20153 20154 20155 20156 20157 20158 20159 20160 20161 20162 20163 20164 20165 20166 20167 20168 20169 20170 20171 20172 20173 20174 20175 20176 20177 20178 20179 20180 20181 20182 20183 20184 20185 20186 20187 20188 20189 20190 20191 20192 20193 20194 20195 20196 20197 20198 20199 20200 20201 20202 20203 20204 20205 20206 20207 20208 20209 20210 20211 20212 20213 20214 20215 20216 20217 20218 20219 20220 20221 20222 20223 20224 20225 20226 20227 20228 20229 20230 20231 20232 20233 20234 20235 20236 20237 20238 20239 20240 20241 20242 20243 20244 20245 20246 20247 20248 20249 20250 20251 20252 20253 20254 20255 20256 20257 20258 20259 20260 20261 20262 20263 20264 20265 20266 20267 20268 20269 20270 20271 20272 20273 20274 20275 20276 20277 20278 20279 20280 20281 20282 20283 20284 20285 20286 20287 20288 20289 20290 20291 20292 20293 20294 20295 20296 20297 20298 20299 20300 20301 20302 20303 20304 20305 20306 20307 20308 20309 20310 20311 20312 20313 20314 20315 20316 20317 20318 20319 20320 20321 20322 20323 20324 20325 20326 20327 20328 20329 20330 20331 20332 20333 20334 20335 20336 20337 20338 20339 20340 20341 20342 20343 20344 20345 20346 20347 20348 20349 20350 20351 20352 20353 20354 20355 20356 20357 20358 20359 20360 20361 20362 20363 20364 20365 20366 20367 20368 20369 20370 20371 20372 20373 20374 20375 20376 20377 20378 20379 20380 20381 20382 20383 20384 20385 20386 20387 20388 20389 20390 20391 20392 20393 20394 20395 20396 20397 20398 20399 20400 20401 20402 20403 20404 20405 20406 20407 20408 20409 20410 20411 20412 20413 20414 20415 20416 20417 20418 20419 20420 20421 20422 20423 20424 20425 20426 20427 20428 20429 20430 20431 20432 20433 20434 20435 20436 20437 20438 20439 20440 20441 20442 20443 20444 20445 20446 20447 20448 20449 20450 20451 20452 20453 20454 20455 20456 20457 20458 20459 20460 20461 20462 20463 20464 20465 20466 20467 20468 20469 20470 20471 20472 20473 20474 20475 20476 20477 20478 20479 20480 20481 20482 20483 20484 20485 20486 20487 20488 20489 20490 20491 20492 20493 20494 20495 20496 20497 20498 20499 20500 20501 20502 20503 20504 20505 20506 20507 20508 20509 20510 20511 20512 20513 20514 20515 20516 20517 20518 20519 20520 20521 20522 20523 20524 20525 20526 20527 20528 20529 20530 20531 20532 20533 20534 20535 20536 20537 20538 20539 20540 20541 20542 20543 20544 20545 20546 20547 20548 20549 20550 20551 20552 20553 20554 20555 20556 20557 20558 20559 20560 20561 20562 20563 20564 20565 20566 20567 20568 20569 20570 20571 20572 20573 20574 20575 20576 20577 20578 20579 20580 20581 20582 20583 20584 20585 20586 20587 20588 20589 20590 20591 20592 20593 20594 20595 20596 20597 20598 20599 20600 20601 20602 20603 20604 20605 20606 20607 20608 20609 20610 20611 20612 20613 20614 20615 20616 20617 20618 20619 20620 20621 20622 20623 20624 20625 20626 20627 20628 20629 20630 20631 20632 20633 20634 20635 20636 20637 20638 20639 20640 20641 20642 20643 20644 20645 20646 20647 20648 20649 20650 20651 20652 20653 20654 20655 20656 20657 20658 20659 20660 20661 20662 20663 20664 20665 20666 20667 20668 20669 20670 20671 20672 20673 20674 20675 20676 20677 20678 20679 20680 20681 20682 20683 20684 20685 20686 20687 20688 20689 20690 20691 20692 20693 20694 20695 20696 20697 20698 20699 20700 20701 20702 20703 20704 20705 20706 20707 20708 20709 20710 20711 20712 20713 20714 20715 20716 20717 20718 20719 20720 20721 20722 20723 20724 20725 20726 20727 20728 20729 20730 20731 20732 20733 20734 20735 20736 20737 20738 20739 20740 20741 20742 20743 20744 20745 20746 20747 20748 20749 20750 20751 20752 20753 20754 20755 20756 20757 20758 20759 20760 20761 20762 20763 20764 20765 20766 20767 20768 20769 20770 20771 20772 20773 20774 20775 20776 20777 20778 20779 20780 20781 20782 20783 20784 20785 20786 20787 20788 20789 20790 20791 20792 20793 20794 20795 20796 20797 20798 20799 20800 20801 20802 20803 20804 20805 20806 20807 20808 20809 20810 20811 20812 20813 20814 20815 20816 20817 20818 20819 20820 20821 20822 20823 20824 20825 20826 20827 20828 20829 20830 20831 20832 20833 20834 20835 20836 20837 20838 20839 20840 20841 20842 20843 20844 20845 20846 20847 20848 20849 20850 20851 20852 20853 20854 20855 20856 20857 20858 20859 20860 20861 20862 20863 20864 20865 20866 20867 20868 20869 20870 20871 20872 20873 20874 20875 20876 20877 20878 20879 20880 20881 20882 20883 20884 20885 20886 20887 20888 20889 20890 20891 20892 20893 20894 20895 20896 20897 20898 20899 20900 20901 20902 20903 20904 20905 20906 20907 20908 20909 20910 20911 20912 20913 20914 20915 20916 20917 20918 20919 20920 20921 20922 20923 20924 20925 20926 20927 20928 20929 20930 20931 20932 20933 20934 20935 20936 20937 20938 20939 20940 20941 20942 20943 20944 20945 20946 20947 20948 20949 20950 20951 20952 20953 20954 20955 20956 20957 20958 20959 20960 20961 20962 20963 20964 20965 20966 20967 20968 20969 20970 20971 20972 20973 20974 20975 20976 20977 20978 20979 20980 20981 20982 20983 20984 20985 20986 20987 20988 20989 20990 20991 20992 20993 20994 20995 20996 20997 20998 20999 21000 21001 21002 21003 21004 21005 21006 21007 21008 21009 21010 21011 21012 21013 21014 21015 21016 21017 21018 21019 21020 21021 21022 21023 21024 21025 21026 21027 21028 21029 21030 21031 21032 21033 21034 21035 21036 21037 21038 21039 21040 21041 21042 21043 21044 21045 21046 21047 21048 21049 21050 21051 21052 21053 21054 21055 21056 21057 21058 21059 21060 21061 21062 21063 21064 21065 21066 21067 21068 21069 21070 21071 21072 21073 21074 21075 21076 21077 21078 21079 21080 21081 21082 21083 21084 21085 21086 21087 21088 21089 21090 21091 21092 21093 21094 21095 21096 21097 21098 21099 21100 21101 21102 21103 21104 21105 21106 21107 21108 21109 21110 21111 21112 21113 21114 21115 21116 21117 21118 21119 21120 21121 21122 21123 21124 21125 21126 21127 21128 21129 21130 21131 21132 21133 21134 21135 21136 21137 21138 21139 21140 21141 21142 21143 21144 21145 21146 21147 21148 21149 21150 21151 21152 21153 21154 21155 21156 21157 21158 21159 21160 21161 21162 21163 21164 21165 21166 21167 21168 21169 21170 21171 21172 21173 21174 21175 21176 21177 21178 21179 21180 21181 21182 21183 21184 21185 21186 21187 21188 21189 21190 21191 21192 21193 21194 21195 21196 21197 21198 21199 21200 21201 21202 21203 21204 21205 21206 21207 21208 21209 21210 21211 21212 21213 21214 21215 21216 21217 21218 21219 21220 21221 21222 21223 21224 21225 21226 21227 21228 21229 21230 21231 21232 21233 21234 21235 21236 21237 21238 21239 21240 21241 21242 21243 21244 21245 21246 21247 21248 21249 21250 21251 21252 21253 21254 21255 21256 21257 21258 21259 21260 21261 21262 21263 21264 21265 21266 21267 21268 21269 21270 21271 21272 21273 21274 21275 21276 21277 21278 21279 21280 21281 21282 21283 21284 21285 21286 21287 21288 21289 21290 21291 21292 21293 21294 21295 21296 21297 21298 21299 21300 21301 21302 21303 21304 21305 21306 21307 21308 21309 21310 21311 21312 21313 21314 21315 21316 21317 21318 21319 21320 21321 21322 21323 21324 21325 21326 21327 21328 21329 21330 21331 21332 21333 21334 21335 21336 21337 21338 21339 21340 21341 21342 21343 21344 21345 21346 21347 21348 21349 21350 21351 21352 21353 21354 21355 21356 21357 21358 21359 21360 21361 21362 21363 21364 21365 21366 21367 21368 21369 21370 21371 21372 21373 21374 21375 21376 21377 21378 21379 21380 21381 21382 21383 21384 21385 21386 21387 21388 21389 21390 21391 21392 21393 21394 21395 21396 21397 21398 21399 21400 21401 21402 21403 21404 21405 21406 21407 21408 21409 21410 21411 21412 21413 21414 21415 21416 21417 21418 21419 21420 21421 21422 21423 21424 21425 21426 21427 21428 21429 21430 21431 21432 21433 21434 21435 21436 21437 21438 21439 21440 21441 21442 21443 21444 21445 21446 21447 21448 21449 21450 21451 21452 21453 21454 21455 21456 21457 21458 21459 21460 21461 21462 21463 21464 21465 21466 21467 21468 21469 21470 21471 21472 21473 21474 21475 21476 21477 21478 21479 21480 21481 21482 21483 21484 21485 21486 21487 21488 21489 21490 21491 21492 21493 21494 21495 21496 21497 21498 21499 21500 21501 21502 21503 21504 21505 21506 21507 21508 21509 21510 21511 21512 21513 21514 21515 21516 21517 21518 21519 21520 21521 21522 21523 21524 21525 21526 21527 21528 21529 21530 21531 21532 21533 21534 21535 21536 21537 21538 21539 21540 21541 21542 21543 21544 21545 21546 21547 21548 21549 21550 21551 21552 21553 21554 21555 21556 21557 21558 21559 21560 21561 21562 21563 21564 21565 21566 21567 21568 21569 21570 21571 21572 21573 21574 21575 21576 21577 21578 21579 21580 21581 21582 21583 21584 21585 21586 21587 21588 21589 21590 21591 21592 21593 21594 21595 21596 21597 21598 21599 21600 21601 21602 21603 21604 21605 21606 21607 21608 21609 21610 21611 21612 21613 21614 21615 21616 21617 21618 21619 21620 21621 21622 21623 21624 21625 21626 21627 21628 21629 21630 21631 21632 21633 21634 21635 21636 21637 21638 21639 21640 21641 21642 21643 21644 21645 21646 21647 21648 21649 21650 21651 21652 21653 21654 21655 21656 21657 21658 21659 21660 21661 21662 21663 21664 21665 21666 21667 21668 21669 21670 21671 21672 21673 21674 21675 21676 21677 21678 21679 21680 21681 21682 21683 21684 21685 21686 21687 21688 21689 21690 21691 21692 21693 21694 21695 21696 21697 21698 21699 21700 21701 21702 21703 21704 21705 21706 21707 21708 21709 21710 21711 21712 21713 21714 21715 21716 21717 21718 21719 21720 21721 21722 21723 21724 21725 21726 21727 21728 21729 21730 21731 21732 21733 21734 21735 21736 21737 21738 21739 21740 21741 21742 21743 21744 21745 21746 21747 21748 21749 21750 21751 21752 21753 21754 21755 21756 21757 21758 21759 21760 21761 21762 21763 21764 21765 21766 21767 21768 21769 21770 21771 21772 21773 21774 21775 21776 21777 21778 21779 21780 21781 21782 21783 21784 21785 21786 21787 21788 21789 21790 21791 21792 21793 21794 21795 21796 21797 21798 21799 21800 21801 21802 21803 21804 21805 21806 21807 21808 21809 21810 21811 21812 21813 21814 21815 21816 21817 21818 21819 21820 21821 21822 21823 21824 21825 21826 21827 21828 21829 21830 21831 21832 21833 21834 21835 21836 21837 21838 21839 21840 21841 21842 21843 21844 21845 21846 21847 21848 21849 21850 21851 21852 21853 21854 21855 21856 21857 21858 21859 21860 21861 21862 21863 21864 21865 21866 21867 21868 21869 21870 21871 21872 21873 21874 21875 21876 21877 21878 21879 21880 21881 21882 21883 21884 21885 21886 21887 21888 21889 21890 21891 21892 21893 21894 21895 21896 21897 21898 21899 21900 21901 21902 21903 21904 21905 21906 21907 21908 21909 21910 21911 21912 21913 21914 21915 21916 21917 21918 21919 21920 21921 21922 21923 21924 21925 21926 21927 21928 21929 21930 21931 21932 21933 21934 21935 21936 21937 21938 21939 21940 21941 21942 21943 21944 21945 21946 21947 21948 21949 21950 21951 21952 21953 21954 21955 21956 21957 21958 21959 21960 21961 21962 21963 21964 21965 21966 21967 21968 21969 21970 21971 21972 21973 21974 21975 21976 21977 21978 21979 21980 21981 21982 21983 21984 21985 21986 21987 21988 21989 21990 21991 21992 21993 21994 21995 21996 21997 21998 21999 22000 22001 22002 22003 22004 22005 22006 22007 22008 22009 22010 22011 22012 22013 22014 22015 22016 22017 22018 22019 22020 22021 22022 22023 22024 22025 22026 22027 22028 22029 22030 22031 22032 22033 22034 22035 22036 22037 22038 22039 22040 22041 22042 22043 22044 22045 22046 22047 22048 22049 22050 22051 22052 22053 22054 22055 22056 22057 22058 22059 22060 22061 22062 22063 22064 22065 22066 22067 22068 22069 22070 22071 22072 22073 22074 22075 22076 22077 22078 22079 22080 22081 22082 22083 22084 22085 22086 22087 22088 22089 22090 22091 22092 22093 22094 22095 22096 22097 22098 22099 22100 22101 22102 22103 22104 22105 22106 22107 22108 22109 22110 22111 22112 22113 22114 22115 22116 22117 22118 22119 22120 22121 22122 22123 22124 22125 22126 22127 22128 22129 22130 22131 22132 22133 22134 22135 22136 22137 22138 22139 22140 22141 22142 22143 22144 22145 22146 22147 22148 22149 22150 22151 22152 22153 22154 22155 22156 22157 22158 22159 22160 22161 22162 22163 22164 22165 22166 22167 22168 22169 22170 22171 22172 22173 22174 22175 22176 22177 22178 22179 22180 22181 22182 22183 22184 22185 22186 22187 22188 22189 22190 22191 22192 22193 22194 22195 22196 22197 22198 22199 22200 22201 22202 22203 22204 22205 22206 22207 22208 22209 22210 22211 22212 22213 22214 22215 22216 22217 22218 22219 22220 22221 22222 22223 22224 22225 22226 22227 22228 22229 22230 22231 22232 22233 22234 22235 22236 22237 22238 22239 22240 22241 22242 22243 22244 22245 22246 22247 22248 22249 22250 22251 22252 22253 22254 22255 22256 22257 22258 22259 22260 22261 22262 22263 22264 22265 22266 22267 22268 22269 22270 22271 22272 22273 22274 22275 22276 22277 22278 22279 22280 22281 22282 22283 22284 22285 22286 22287 22288 22289 22290 22291 22292 22293 22294 22295 22296 22297 22298 22299 22300 22301 22302 22303 22304 22305 22306 22307 22308 22309 22310 22311 22312 22313 22314 22315 22316 22317 22318 22319 22320 22321 22322 22323 22324 22325 22326 22327 22328 22329 22330 22331 22332 22333 22334 22335 22336 22337 22338 22339 22340 22341 22342 22343 22344 22345 22346 22347 22348 22349 22350 22351 22352 22353 22354 22355 22356 22357 22358 22359 22360 22361 22362 22363 22364 22365 22366 22367 22368 22369 22370 22371 22372 22373 22374 22375 22376 22377 22378 22379 22380 22381 22382 22383 22384 22385 22386 22387 22388 22389 22390 22391 22392 22393 22394 22395 22396 22397 22398 22399 22400 22401 22402 22403 22404 22405 22406 22407 22408 22409 22410 22411 22412 22413 22414 22415 22416 22417 22418 22419 22420 22421 22422 22423 22424 22425 22426 22427 22428 22429 22430 22431 22432 22433 22434 22435 22436 22437 22438 22439 22440 22441 22442 22443 22444 22445 22446 22447 22448 22449 22450 22451 22452 22453 22454 22455 22456 22457 22458 22459 22460 22461 22462 22463 22464 22465 22466 22467 22468 22469 22470 22471 22472 22473 22474 22475 22476 22477 22478 22479 22480 22481 22482 22483 22484 22485 22486 22487 22488 22489 22490 22491 22492 22493 22494 22495 22496 22497 22498 22499 22500 22501 22502 22503 22504 22505 22506 22507 22508 22509 22510 22511 22512 22513 22514 22515 22516 22517 22518 22519 22520 22521 22522 22523 22524 22525 22526 22527 22528 22529 22530 22531 22532 22533 22534 22535 22536 22537 22538 22539 22540 22541 22542 22543 22544 22545 22546 22547 22548 22549 22550 22551 22552 22553 22554 22555 22556 22557 22558 22559 22560 22561 22562 22563 22564 22565 22566 22567 22568 22569 22570 22571 22572 22573 22574 22575 22576 22577 22578 22579 22580 22581 22582 22583 22584 22585 22586 22587 22588 22589 22590 22591 22592 22593 22594 22595 22596 22597 22598 22599 22600 22601 22602 22603 22604 22605 22606 22607 22608 22609 22610 22611 22612 22613 22614 22615 22616 22617 22618 22619 22620 22621 22622 22623 22624 22625 22626 22627 22628 22629 22630 22631 22632 22633 22634 22635 22636 22637 22638 22639 22640 22641 22642 22643 22644 22645 22646 22647 22648 22649 22650 22651 22652 22653 22654 22655 22656 22657 22658 22659 22660 22661 22662 22663 22664 22665 22666 22667 22668 22669 22670 22671 22672 22673 22674 22675 22676 22677 22678 22679 22680 22681 22682 22683 22684 22685 22686 22687 22688 22689 22690 22691 22692 22693 22694 22695 22696 22697 22698 22699 22700 22701 22702 22703 22704 22705 22706 22707 22708 22709 22710 22711 22712 22713 22714 22715 22716 22717 22718 22719 22720 22721 22722 22723 22724 22725 22726 22727 22728 22729 22730 22731 22732 22733 22734 22735 22736 22737 22738 22739 22740 22741 22742 22743 22744 22745 22746 22747 22748 22749 22750 22751 22752 22753 22754 22755 22756 22757 22758 22759 22760 22761 22762 22763 22764 22765 22766 22767 22768 22769 22770 22771 22772 22773 22774 22775 22776 22777 22778 22779 22780 22781 22782 22783 22784 22785 22786 22787 22788 22789 22790 22791 22792 22793 22794 22795 22796 22797 22798 22799 22800 22801 22802 22803 22804 22805 22806 22807 22808 22809 22810 22811 22812 22813 22814 22815 22816 22817 22818 22819 22820 22821 22822 22823 22824 22825 22826 22827 22828 22829 22830 22831 22832 22833 22834 22835 22836 22837 22838 22839 22840 22841 22842 22843 22844 22845 22846 22847 22848 22849 22850 22851 22852 22853 22854 22855 22856 22857 22858 22859 22860 22861 22862 22863 22864 22865 22866 22867 22868 22869 22870 22871 22872 22873 22874 22875 22876 22877 22878 22879 22880 22881 22882 22883 22884 22885 22886 22887 22888 22889 22890 22891 22892 22893 22894 22895 22896 22897 22898 22899 22900 22901 22902 22903 22904 22905 22906 22907 22908 22909 22910 22911 22912 22913 22914 22915 22916 22917 22918 22919 22920 22921 22922 22923 22924 22925 22926 22927 22928 22929 22930 22931 22932 22933 22934 22935 22936 22937 22938 22939 22940 22941 22942 22943 22944 22945 22946 22947 22948 22949 22950 22951 22952 22953 22954 22955 22956 22957 22958 22959 22960 22961 22962 22963 22964 22965 22966 22967 22968 22969 22970 22971 22972 22973 22974 22975 22976 22977 22978 22979 22980 22981 22982 22983 22984 22985 22986 22987 22988 22989 22990 22991 22992 22993 22994 22995 22996 22997 22998 22999 23000 23001 23002 23003 23004 23005 23006 23007 23008 23009 23010 23011 23012 23013 23014 23015 23016 23017 23018 23019 23020 23021 23022 23023 23024 23025 23026 23027 23028 23029 23030 23031 23032 23033 23034 23035 23036 23037 23038 23039 23040 23041 23042 23043 23044 23045 23046 23047 23048 23049 23050 23051 23052 23053 23054 23055 23056 23057 23058 23059 23060 23061 23062 23063 23064 23065 23066 23067 23068 23069 23070 23071 23072 23073 23074 23075 23076 23077 23078 23079 23080 23081 23082 23083 23084 23085 23086 23087 23088 23089 23090 23091 23092 23093 23094 23095 23096 23097 23098 23099 23100 23101 23102 23103 23104 23105 23106 23107 23108 23109 23110 23111 23112 23113 23114 23115 23116 23117 23118 23119 23120 23121 23122 23123 23124 23125 23126 23127 23128 23129 23130 23131 23132 23133 23134 23135 23136 23137 23138 23139 23140 23141 23142 23143 23144 23145 23146 23147 23148 23149 23150 23151 23152 23153 23154 23155 23156 23157 23158 23159 23160 23161 23162 23163 23164 23165 23166 23167 23168 23169 23170 23171 23172 23173 23174 23175 23176 23177 23178 23179 23180 23181 23182 23183 23184 23185 23186 23187 23188 23189 23190 23191 23192 23193 23194 23195 23196 23197 23198 23199 23200 23201 23202 23203 23204 23205 23206 23207 23208 23209 23210 23211 23212 23213 23214 23215 23216 23217 23218 23219 23220 23221 23222 23223 23224 23225 23226 23227 23228 23229 23230 23231 23232 23233 23234 23235 23236 23237 23238 23239 23240 23241 23242 23243 23244 23245 23246 23247 23248 23249 23250 23251 23252 23253 23254 23255 23256 23257 23258 23259 23260 23261 23262 23263 23264 23265 23266 23267 23268 23269 23270 23271 23272 23273 23274 23275 23276 23277 23278 23279 23280 23281 23282 23283 23284 23285 23286 23287 23288 23289 23290 23291 23292 23293 23294 23295 23296 23297 23298 23299 23300 23301 23302 23303 23304 23305 23306 23307 23308 23309 23310 23311 23312 23313 23314 23315 23316 23317 23318 23319 23320 23321 23322 23323 23324 23325 23326 23327 23328 23329 23330 23331 23332 23333 23334 23335 23336 23337 23338 23339 23340 23341 23342 23343 23344 23345 23346 23347 23348 23349 23350 23351 23352 23353 23354 23355 23356 23357 23358 23359 23360 23361 23362 23363 23364 23365 23366 23367 23368 23369 23370 23371 23372 23373 23374 23375 23376 23377 23378 23379 23380 23381 23382 23383 23384 23385 23386 23387 23388 23389 23390 23391 23392 23393 23394 23395 23396 23397 23398 23399 23400 23401 23402 23403 23404 23405 23406 23407 23408 23409 23410 23411 23412 23413 23414 23415 23416 23417 23418 23419 23420 23421 23422 23423 23424 23425 23426 23427 23428 23429 23430 23431 23432 23433 23434 23435 23436 23437 23438 23439 23440 23441 23442 23443 23444 23445 23446 23447 23448 23449 23450 23451 23452 23453 23454 23455 23456 23457 23458 23459 23460 23461 23462 23463 23464 23465 23466 23467 23468 23469 23470 23471 23472 23473 23474 23475 23476 23477 23478 23479 23480 23481 23482 23483 23484 23485 23486 23487 23488 23489 23490 23491 23492 23493 23494 23495 23496 23497 23498 23499 23500 23501 23502 23503 23504 23505 23506 23507 23508 23509 23510 23511 23512 23513 23514 23515 23516 23517 23518 23519 23520 23521 23522 23523 23524 23525 23526 23527 23528 23529 23530 23531 23532 23533 23534 23535 23536 23537 23538 23539 23540 23541 23542 23543 23544 23545 23546 23547 23548 23549 23550 23551 23552 23553 23554 23555 23556 23557 23558 23559 23560 23561 23562 23563 23564 23565 23566 23567 23568 23569 23570 23571 23572 23573 23574 23575 23576 23577 23578 23579 23580 23581 23582 23583 23584 23585 23586 23587 23588 23589 23590 23591 23592 23593 23594 23595 23596 23597 23598 23599 23600 23601 23602 23603 23604 23605 23606 23607 23608 23609 23610 23611 23612 23613 23614 23615 23616 23617 23618 23619 23620 23621 23622 23623 23624 23625 23626 23627 23628 23629 23630 23631 23632 23633 23634 23635 23636 23637 23638 23639 23640 23641 23642 23643 23644 23645 23646 23647 23648 23649 23650 23651 23652 23653 23654 23655 23656 23657 23658 23659 23660 23661 23662 23663 23664 23665 23666 23667 23668 23669 23670 23671 23672 23673 23674 23675 23676 23677 23678 23679 23680 23681 23682 23683 23684 23685 23686 23687 23688 23689 23690 23691 23692 23693 23694 23695 23696 23697 23698 23699 23700 23701 23702 23703 23704 23705 23706 23707 23708 23709 23710 23711 23712 23713 23714 23715 23716 23717 23718 23719 23720 23721 23722 23723 23724 23725 23726 23727 23728 23729 23730 23731 23732 23733 23734 23735 23736 23737 23738 23739 23740 23741 23742 23743 23744 23745 23746 23747 23748 23749 23750 23751 23752 23753 23754 23755 23756 23757 23758 23759 23760 23761 23762 23763 23764 23765 23766 23767 23768 23769 23770 23771 23772 23773 23774 23775 23776 23777 23778 23779 23780 23781 23782 23783 23784 23785 23786 23787 23788 23789 23790 23791 23792 23793 23794 23795 23796 23797 23798 23799 23800 23801 23802 23803 23804 23805 23806 23807 23808 23809 23810 23811 23812 23813 23814 23815 23816 23817 23818 23819 23820 23821 23822 23823 23824 23825 23826 23827 23828 23829 23830 23831 23832 23833 23834 23835 23836 23837 23838 23839 23840 23841 23842 23843 23844 23845 23846 23847 23848 23849 23850 23851 23852 23853 23854 23855 23856 23857 23858 23859 23860 23861 23862 23863 23864 23865 23866 23867 23868 23869 23870 23871 23872 23873 23874 23875 23876 23877 23878 23879 23880 23881 23882 23883 23884 23885 23886 23887 23888 23889 23890 23891 23892 23893 23894 23895 23896 23897 23898 23899 23900 23901 23902 23903 23904 23905 23906 23907 23908 23909 23910 23911 23912 23913 23914 23915 23916 23917 23918 23919 23920 23921 23922 23923 23924 23925 23926 23927 23928 23929 23930 23931 23932 23933 23934 23935 23936 23937 23938 23939 23940 23941 23942 23943 23944 23945 23946 23947 23948 23949 23950 23951 23952 23953 23954 23955 23956 23957 23958 23959 23960 23961 23962 23963 23964 23965 23966 23967 23968 23969 23970 23971 23972 23973 23974 23975 23976 23977 23978 23979 23980 23981 23982 23983 23984 23985 23986 23987 23988 23989 23990 23991 23992 23993 23994 23995 23996 23997 23998 23999 24000 24001 24002 24003 24004 24005 24006 24007 24008 24009 24010 24011 24012 24013 24014 24015 24016 24017 24018 24019 24020 24021 24022 24023 24024 24025 24026 24027 24028 24029 24030 24031 24032 24033 24034 24035 24036 24037 24038 24039 24040 24041 24042 24043 24044 24045 24046 24047 24048 24049 24050 24051 24052 24053 24054 24055 24056 24057 24058 24059 24060 24061 24062 24063 24064 24065 24066 24067 24068 24069 24070 24071 24072 24073 24074 24075 24076 24077 24078 24079 24080 24081 24082 24083 24084 24085 24086 24087 24088 24089 24090 24091 24092 24093 24094 24095 24096 24097 24098 24099 24100 24101 24102 24103 24104 24105 24106 24107 24108 24109 24110 24111 24112 24113 24114 24115 24116 24117 24118 24119 24120 24121 24122 24123 24124 24125 24126 24127 24128 24129 24130 24131 24132 24133 24134 24135 24136 24137 24138 24139 24140 24141 24142 24143 24144 24145 24146 24147 24148 24149 24150 24151 24152 24153 24154 24155 24156 24157 24158 24159 24160 24161 24162 24163 24164 24165 24166 24167 24168 24169 24170 24171 24172 24173 24174 24175 24176 24177 24178 24179 24180 24181 24182 24183 24184 24185 24186 24187 24188 24189 24190 24191 24192 24193 24194 24195 24196 24197 24198 24199 24200 24201 24202 24203 24204 24205 24206 24207 24208 24209 24210 24211 24212 24213 24214 24215 24216 24217 24218 24219 24220 24221 24222 24223 24224 24225 24226 24227 24228 24229 24230 24231 24232 24233 24234 24235 24236 24237 24238 24239 24240 24241 24242 24243 24244 24245 24246 24247 24248 24249 24250 24251 24252 24253 24254 24255 24256 24257 24258 24259 24260 24261 24262 24263 24264 24265 24266 24267 24268 24269 24270 24271 24272 24273 24274 24275 24276 24277 24278 24279 24280 24281 24282 24283 24284 24285 24286 24287 24288 24289 24290 24291 24292 24293 24294 24295 24296 24297 24298 24299 24300 24301 24302 24303 24304 24305 24306 24307 24308 24309 24310 24311 24312 24313 24314 24315 24316 24317 24318 24319 24320 24321 24322 24323 24324 24325 24326 24327 24328 24329 24330 24331 24332 24333 24334 24335 24336 24337 24338 24339 24340 24341 24342 24343 24344 24345 24346 24347 24348 24349 24350 24351 24352 24353 24354 24355 24356 24357 24358 24359 24360 24361 24362 24363 24364 24365 24366 24367 24368 24369 24370 24371 24372 24373 24374 24375 24376 24377 24378 24379 24380 24381 24382 24383 24384 24385 24386 24387 24388 24389 24390 24391 24392 24393 24394 24395 24396 24397 24398 24399 24400 24401 24402 24403 24404 24405 24406 24407 24408 24409 24410 24411 24412 24413 24414 24415 24416 24417 24418 24419 24420 24421 24422 24423 24424 24425 24426 24427 24428 24429 24430 24431 24432 24433 24434 24435 24436 24437 24438 24439 24440 24441 24442 24443 24444 24445 24446 24447 24448 24449 24450 24451 24452 24453 24454 24455 24456 24457 24458 24459 24460 24461 24462 24463 24464 24465 24466 24467 24468 24469 24470 24471 24472 24473 24474 24475 24476 24477 24478 24479 24480 24481 24482 24483 24484 24485 24486 24487 24488 24489 24490 24491 24492 24493 24494 24495 24496 24497 24498 24499 24500 24501 24502 24503 24504 24505 24506 24507 24508 24509 24510 24511 24512 24513 24514 24515 24516 24517 24518 24519 24520 24521 24522 24523 24524 24525 24526 24527 24528 24529 24530 24531 24532 24533 24534 24535 24536 24537 24538 24539 24540 24541 24542 24543 24544 24545 24546 24547 24548 24549 24550 24551 24552 24553 24554 24555 24556 24557 24558 24559 24560 24561 24562 24563 24564 24565 24566 24567 24568 24569 24570 24571 24572 24573 24574 24575 24576 24577 24578 24579 24580 24581 24582 24583 24584 24585 24586 24587 24588 24589 24590 24591 24592 24593 24594 24595 24596 24597 24598 24599 24600 24601 24602 24603 24604 24605 24606 24607 24608 24609 24610 24611 24612 24613 24614 24615 24616 24617 24618 24619 24620 24621 24622 24623 24624 24625 24626 24627 24628 24629 24630 24631 24632 24633 24634 24635 24636 24637 24638 24639 24640 24641 24642 24643 24644 24645 24646 24647 24648 24649 24650 24651 24652 24653 24654 24655 24656 24657 24658 24659 24660 24661 24662 24663 24664 24665 24666 24667 24668 24669 24670 24671 24672 24673 24674 24675 24676 24677 24678 24679 24680 24681 24682 24683 24684 24685 24686 24687 24688 24689 24690 24691 24692 24693 24694 24695 24696 24697 24698 24699 24700 24701 24702 24703 24704 24705 24706 24707 24708 24709 24710 24711 24712 24713 24714 24715 24716 24717 24718 24719 24720 24721 24722 24723 24724 24725 24726 24727 24728 24729 24730 24731 24732 24733 24734 24735 24736 24737 24738 24739 24740 24741 24742 24743 24744 24745 24746 24747 24748 24749 24750 24751 24752 24753 24754 24755 24756 24757 24758 24759 24760 24761 24762 24763 24764 24765 24766 24767 24768 24769 24770 24771 24772 24773 24774 24775 24776 24777 24778 24779 24780 24781 24782 24783 24784 24785 24786 24787 24788 24789 24790 24791 24792 24793 24794 24795 24796 24797 24798 24799 24800 24801 24802 24803 24804 24805 24806 24807 24808 24809 24810 24811 24812 24813 24814 24815 24816 24817 24818 24819 24820 24821 24822 24823 24824 24825 24826 24827 24828 24829 24830 24831 24832 24833 24834 24835 24836 24837 24838 24839 24840 24841 24842 24843 24844 24845 24846 24847 24848 24849 24850 24851 24852 24853 24854 24855 24856 24857 24858 24859 24860 24861 24862 24863 24864 24865 24866 24867 24868 24869 24870 24871 24872 24873 24874 24875 24876 24877 24878 24879 24880 24881 24882 24883 24884 24885 24886 24887 24888 24889 24890 24891 24892 24893 24894 24895 24896 24897 24898 24899 24900 24901 24902 24903 24904 24905 24906 24907 24908 24909 24910 24911 24912 24913 24914 24915 24916 24917 24918 24919 24920 24921 24922 24923 24924 24925 24926 24927 24928 24929 24930 24931 24932 24933 24934 24935 24936 24937 24938 24939 24940 24941 24942 24943 24944 24945 24946 24947 24948 24949 24950 24951 24952 24953 24954 24955 24956 24957 24958 24959 24960 24961 24962 24963 24964 24965 24966 24967 24968 24969 24970 24971 24972 24973 24974 24975 24976 24977 24978 24979 24980 24981 24982 24983 24984 24985 24986 24987 24988 24989 24990 24991 24992 24993 24994 24995 24996 24997 24998 24999 25000 25001 25002 25003 25004 25005 25006 25007 25008 25009 25010 25011 25012 25013 25014 25015 25016 25017 25018 25019 25020 25021 25022 25023 25024 25025 25026 25027 25028 25029 25030 25031 25032 25033 25034 25035 25036 25037 25038 25039 25040 25041 25042 25043 25044 25045 25046 25047 25048 25049 25050 25051 25052 25053 25054 25055 25056 25057 25058 25059 25060 25061 25062 25063 25064 25065 25066 25067 25068 25069 25070 25071 25072 25073 25074 25075 25076 25077 25078 25079 25080 25081 25082 25083 25084 25085 25086 25087 25088 25089 25090 25091 25092 25093 25094 25095 25096 25097 25098 25099 25100 25101 25102 25103 25104 25105 25106 25107 25108 25109 25110 25111 25112 25113 25114 25115 25116 25117 25118 25119 25120 25121 25122 25123 25124 25125 25126 25127 25128 25129 25130 25131 25132 25133 25134 25135 25136 25137 25138 25139 25140 25141 25142 25143 25144 25145 25146 25147 25148 25149 25150 25151 25152 25153 25154 25155 25156 25157 25158 25159 25160 25161 25162 25163 25164 25165 25166 25167 25168 25169 25170 25171 25172 25173 25174 25175 25176 25177 25178 25179 25180 25181 25182 25183 25184 25185 25186 25187 25188 25189 25190 25191 25192 25193 25194 25195 25196 25197 25198 25199 25200 25201 25202 25203 25204 25205 25206 25207 25208 25209 25210 25211 25212 25213 25214 25215 25216 25217 25218 25219 25220 25221 25222 25223 25224 25225 25226 25227 25228 25229 25230 25231 25232 25233 25234 25235 25236 25237 25238 25239 25240 25241 25242 25243 25244 25245 25246 25247 25248 25249 25250 25251 25252 25253 25254 25255 25256 25257 25258 25259 25260 25261 25262 25263 25264 25265 25266 25267 25268 25269 25270 25271 25272 25273 25274 25275 25276 25277 25278 25279 25280 25281 25282 25283 25284 25285 25286 25287 25288 25289 25290 25291 25292 25293 25294 25295 25296 25297 25298 25299 25300 25301 25302 25303 25304 25305 25306 25307 25308 25309 25310 25311 25312 25313 25314 25315 25316 25317 25318 25319 25320 25321 25322 25323 25324 25325 25326 25327 25328 25329 25330 25331 25332 25333 25334 25335 25336 25337 25338 25339 25340 25341 25342 25343 25344 25345 25346 25347 25348 25349 25350 25351 25352 25353 25354 25355 25356 25357 25358 25359 25360 25361 25362 25363 25364 25365 25366 25367 25368 25369 25370 25371 25372 25373 25374 25375 25376 25377 25378 25379 25380 25381 25382 25383 25384 25385 25386 25387 25388 25389 25390 25391 25392 25393 25394 25395 25396 25397 25398 25399 25400 25401 25402 25403 25404 25405 25406 25407 25408 25409 25410 25411 25412 25413 25414 25415 25416 25417 25418 25419 25420 25421 25422 25423 25424 25425 25426 25427 25428 25429 25430 25431 25432 25433 25434 25435 25436 25437 25438 25439 25440 25441 25442 25443 25444 25445 25446 25447 25448 25449 25450 25451 25452 25453 25454 25455 25456 25457 25458 25459 25460 25461 25462 25463 25464 25465 25466 25467 25468 25469 25470 25471 25472 25473 25474 25475 25476 25477 25478 25479 25480 25481 25482 25483 25484 25485 25486 25487 25488 25489 25490 25491 25492 25493 25494 25495 25496 25497 25498 25499 25500 25501 25502 25503 25504 25505 25506 25507 25508 25509 25510 25511 25512 25513 25514 25515 25516 25517 25518 25519 25520 25521 25522 25523 25524 25525 25526 25527 25528 25529 25530 25531 25532 25533 25534 25535 25536 25537 25538 25539 25540 25541 25542 25543 25544 25545 25546 25547 25548 25549 25550 25551 25552 25553 25554 25555 25556 25557 25558 25559 25560 25561 25562 25563 25564 25565 25566 25567 25568 25569 25570 25571 25572 25573 25574 25575 25576 25577 25578 25579 25580 25581 25582 25583 25584 25585 25586 25587 25588 25589 25590 25591 25592 25593 25594 25595 25596 25597 25598 25599 25600 25601 25602 25603 25604 25605 25606 25607 25608 25609 25610 25611 25612 25613 25614 25615 25616 25617 25618 25619 25620 25621 25622 25623 25624 25625 25626 25627 25628 25629 25630 25631 25632 25633 25634 25635 25636 25637 25638 25639 25640 25641 25642 25643 25644 25645 25646 25647 25648 25649 25650 25651 25652 25653 25654 25655 25656 25657 25658 25659 25660 25661 25662 25663 25664 25665 25666 25667 25668 25669 25670 25671 25672 25673 25674 25675 25676 25677 25678 25679 25680 25681 25682 25683 25684 25685 25686 25687 25688 25689 25690 25691 25692 25693 25694 25695 25696 25697 25698 25699 25700 25701 25702 25703 25704 25705 25706 25707 25708 25709 25710 25711 25712 25713 25714 25715 25716 25717 25718 25719 25720 25721 25722 25723 25724 25725 25726 25727 25728 25729 25730 25731 25732 25733 25734 25735 25736 25737 25738 25739 25740 25741 25742 25743 25744 25745 25746 25747 25748 25749 25750 25751 25752 25753 25754 25755 25756 25757 25758 25759 25760 25761 25762 25763 25764 25765 25766 25767 25768 25769 25770 25771 25772 25773 25774 25775 25776 25777 25778 25779 25780 25781 25782 25783 25784 25785 25786 25787 25788 25789 25790 25791 25792 25793 25794 25795 25796 25797 25798 25799 25800 25801 25802 25803 25804 25805 25806 25807 25808 25809 25810 25811 25812 25813 25814 25815 25816 25817 25818 25819 25820 25821 25822 25823 25824 25825 25826 25827 25828 25829 25830 25831 25832 25833 25834 25835 25836 25837 25838 25839 25840 25841 25842 25843 25844 25845 25846 25847 25848 25849 25850 25851 25852 25853 25854 25855 25856 25857 25858 25859 25860 25861 25862 25863 25864 25865 25866 25867 25868 25869 25870 25871 25872 25873 25874 25875 25876 25877 25878 25879 25880 25881 25882 25883 25884 25885 25886 25887 25888 25889 25890 25891 25892 25893 25894 25895 25896 25897 25898 25899 25900 25901 25902 25903 25904 25905 25906 25907 25908 25909 25910 25911 25912 25913 25914 25915 25916 25917 25918 25919 25920 25921 25922 25923 25924 25925 25926 25927 25928 25929 25930 25931 25932 25933 25934 25935 25936 25937 25938 25939 25940 25941 25942 25943 25944 25945 25946 25947 25948 25949 25950 25951 25952 25953 25954 25955 25956 25957 25958 25959 25960 25961 25962 25963 25964 25965 25966 25967 25968 25969 25970 25971 25972 25973 25974 25975 25976 25977 25978 25979 25980 25981 25982 25983 25984 25985 25986 25987 25988 25989 25990 25991 25992 25993 25994 25995 25996 25997 25998 25999 26000 26001 26002 26003 26004 26005 26006 26007 26008 26009 26010 26011 26012 26013 26014 26015 26016 26017 26018 26019 26020 26021 26022 26023 26024 26025 26026 26027 26028 26029 26030 26031 26032 26033 26034 26035 26036 26037 26038 26039 26040 26041 26042 26043 26044 26045 26046 26047 26048 26049 26050 26051 26052 26053 26054 26055 26056 26057 26058 26059 26060 26061 26062 26063 26064 26065 26066 26067 26068 26069 26070 26071 26072 26073 26074 26075 26076 26077 26078 26079 26080 26081 26082 26083 26084 26085 26086 26087 26088 26089 26090 26091 26092 26093 26094 26095 26096 26097 26098 26099 26100 26101 26102 26103 26104 26105 26106 26107 26108 26109 26110 26111 26112 26113 26114 26115 26116 26117 26118 26119 26120 26121 26122 26123 26124 26125 26126 26127 26128 26129 26130 26131 26132 26133 26134 26135 26136 26137 26138 26139 26140 26141 26142 26143 26144 26145 26146 26147 26148 26149 26150 26151 26152 26153 26154 26155 26156 26157 26158 26159 26160 26161 26162 26163 26164 26165 26166 26167 26168 26169 26170 26171 26172 26173 26174 26175 26176 26177 26178 26179 26180 26181 26182 26183 26184 26185 26186 26187 26188 26189 26190 26191 26192 26193 26194 26195 26196 26197 26198 26199 26200 26201 26202 26203 26204 26205 26206 26207 26208 26209 26210 26211 26212 26213 26214 26215 26216 26217 26218 26219 26220 26221 26222 26223 26224 26225 26226 26227 26228 26229 26230 26231 26232 26233 26234 26235 26236 26237 26238 26239 26240 26241 26242 26243 26244 26245 26246 26247 26248 26249 26250 26251 26252 26253 26254 26255 26256 26257 26258 26259 26260 26261 26262 26263 26264 26265 26266 26267 26268 26269 26270 26271 26272 26273 26274 26275 26276 26277 26278 26279 26280 26281 26282 26283 26284 26285 26286 26287 26288 26289 26290 26291 26292 26293 26294 26295 26296 26297 26298 26299 26300 26301 26302 26303 26304 26305 26306 26307 26308 26309 26310 26311 26312 26313 26314 26315 26316 26317 26318 26319 26320 26321 26322 26323 26324 26325 26326 26327 26328 26329 26330 26331 26332 26333 26334 26335 26336 26337 26338 26339 26340 26341 26342 26343 26344 26345 26346 26347 26348 26349 26350 26351 26352 26353 26354 26355 26356 26357 26358 26359 26360 26361 26362 26363 26364 26365 26366 26367 26368 26369 26370 26371 26372 26373 26374 26375 26376 26377 26378 26379 26380 26381 26382 26383 26384 26385 26386 26387 26388 26389 26390 26391 26392 26393 26394 26395 26396 26397 26398 26399 26400 26401 26402 26403 26404 26405 26406 26407 26408 26409 26410 26411 26412 26413 26414 26415 26416 26417 26418 26419 26420 26421 26422 26423 26424 26425 26426 26427 26428 26429 26430 26431 26432 26433 26434 26435 26436 26437 26438 26439 26440 26441 26442 26443 26444 26445 26446 26447 26448 26449 26450 26451 26452 26453 26454 26455 26456 26457 26458 26459 26460 26461 26462 26463 26464 26465 26466 26467 26468 26469 26470 26471 26472 26473 26474 26475 26476 26477 26478 26479 26480 26481 26482 26483 26484 26485 26486 26487 26488 26489 26490 26491 26492 26493 26494 26495 26496 26497 26498 26499 26500 26501 26502 26503 26504 26505 26506 26507 26508 26509 26510 26511 26512 26513 26514 26515 26516 26517 26518 26519 26520 26521 26522 26523 26524 26525 26526 26527 26528 26529 26530 26531 26532 26533 26534 26535 26536 26537 26538 26539 26540 26541 26542 26543 26544 26545 26546 26547 26548 26549 26550 26551 26552 26553 26554 26555 26556 26557 26558 26559 26560 26561 26562 26563 26564 26565 26566 26567 26568 26569 26570 26571 26572 26573 26574 26575 26576 26577 26578 26579 26580 26581 26582 26583 26584 26585 26586 26587 26588 26589 26590 26591 26592 26593 26594 26595 26596 26597 26598 26599 26600 26601 26602 26603 26604 26605 26606 26607 26608 26609 26610 26611 26612 26613 26614 26615 26616 26617 26618 26619 26620 26621 26622 26623 26624 26625 26626 26627 26628 26629 26630 26631 26632 26633 26634 26635 26636 26637 26638 26639 26640 26641 26642 26643 26644 26645 26646 26647 26648 26649 26650 26651 26652 26653 26654 26655 26656 26657 26658 26659 26660 26661 26662 26663 26664 26665 26666 26667 26668 26669 26670 26671 26672 26673 26674 26675 26676 26677 26678 26679 26680 26681 26682 26683 26684 26685 26686 26687 26688 26689 26690 26691 26692 26693 26694 26695 26696 26697 26698 26699 26700 26701 26702 26703 26704 26705 26706 26707 26708 26709 26710 26711 26712 26713 26714 26715 26716 26717 26718 26719 26720 26721 26722 26723 26724 26725 26726 26727 26728 26729 26730 26731 26732 26733 26734 26735 26736 26737 26738 26739 26740 26741 26742 26743 26744 26745 26746 26747 26748 26749 26750 26751 26752 26753 26754 26755 26756 26757 26758 26759 26760 26761 26762 26763 26764 26765 26766 26767 26768 26769 26770 26771 26772 26773 26774 26775 26776 26777 26778 26779 26780 26781 26782 26783 26784 26785 26786 26787 26788 26789 26790 26791 26792 26793 26794 26795 26796 26797 26798 26799 26800 26801 26802 26803 26804 26805 26806 26807 26808 26809 26810 26811 26812 26813 26814 26815 26816 26817 26818 26819 26820 26821 26822 26823 26824 26825 26826 26827 26828 26829 26830 26831 26832 26833 26834 26835 26836 26837 26838 26839 26840 26841 26842 26843 26844 26845 26846 26847 26848 26849 26850 26851 26852 26853 26854 26855 26856 26857 26858 26859 26860 26861 26862 26863 26864 26865 26866 26867 26868 26869 26870 26871 26872 26873 26874 26875 26876 26877 26878 26879 26880 26881 26882 26883 26884 26885 26886 26887 26888 26889 26890 26891 26892 26893 26894 26895 26896 26897 26898 26899 26900 26901 26902 26903 26904 26905 26906 26907 26908 26909 26910 26911 26912 26913 26914 26915 26916 26917 26918 26919 26920 26921 26922 26923 26924 26925 26926 26927 26928 26929 26930 26931 26932 26933 26934 26935 26936 26937 26938 26939 26940 26941 26942 26943 26944 26945 26946 26947 26948 26949 26950 26951 26952 26953 26954 26955 26956 26957 26958 26959 26960 26961 26962 26963 26964 26965 26966 26967 26968 26969 26970 26971 26972 26973 26974 26975 26976 26977 26978 26979 26980 26981 26982 26983 26984 26985 26986 26987 26988 26989 26990 26991 26992 26993 26994 26995 26996 26997 26998 26999 27000 27001 27002 27003 27004 27005 27006 27007 27008 27009 27010 27011 27012 27013 27014 27015 27016 27017 27018 27019 27020 27021 27022 27023 27024 27025 27026 27027 27028 27029 27030 27031 27032 27033 27034 27035 27036 27037 27038 27039 27040 27041 27042 27043 27044 27045 27046 27047 27048 27049 27050 27051 27052 27053 27054 27055 27056 27057 27058 27059 27060 27061 27062 27063 27064 27065 27066 27067 27068 27069 27070 27071 27072 27073 27074 27075 27076 27077 27078 27079 27080 27081 27082 27083 27084 27085 27086 27087 27088 27089 27090 27091 27092 27093 27094 27095 27096 27097 27098 27099 27100 27101 27102 27103 27104 27105 27106 27107 27108 27109 27110 27111 27112 27113 27114 27115 27116 27117 27118 27119 27120 27121 27122 27123 27124 27125 27126 27127 27128 27129 27130 27131 27132 27133 27134 27135 27136 27137 27138 27139 27140 27141 27142 27143 27144 27145 27146 27147 27148 27149 27150 27151 27152 27153 27154 27155 27156 27157 27158 27159 27160 27161 27162 27163 27164 27165 27166 27167 27168 27169 27170 27171 27172 27173 27174 27175 27176 27177 27178 27179 27180 27181 27182 27183 27184 27185 27186 27187 27188 27189 27190 27191 27192 27193 27194 27195 27196 27197 27198 27199 27200 27201 27202 27203 27204 27205 27206 27207 27208 27209 27210 27211 27212 27213 27214 27215 27216 27217 27218 27219 27220 27221 27222 27223 27224 27225 27226 27227 27228 27229 27230 27231 27232 27233 27234 27235 27236 27237 27238 27239 27240 27241 27242 27243 27244 27245 27246 27247 27248 27249 27250 27251 27252 27253 27254 27255 27256 27257 27258 27259 27260 27261 27262 27263 27264 27265 27266 27267 27268 27269 27270 27271 27272 27273 27274 27275 27276 27277 27278 27279 27280 27281 27282 27283 27284 27285 27286 27287 27288 27289 27290 27291 27292 27293 27294 27295 27296 27297 27298 27299 27300 27301 27302 27303 27304 27305 27306 27307 27308 27309 27310 27311 27312 27313 27314 27315 27316 27317 27318 27319 27320 27321 27322 27323 27324 27325 27326 27327 27328 27329 27330 27331 27332 27333 27334 27335 27336 27337 27338 27339 27340 27341 27342 27343 27344 27345 27346 27347 27348 27349 27350 27351 27352 27353 27354 27355 27356 27357 27358 27359 27360 27361 27362 27363 27364 27365 27366 27367 27368 27369 27370 27371 27372 27373 27374 27375 27376 27377 27378 27379 27380 27381 27382 27383 27384 27385 27386 27387 27388 27389 27390 27391 27392 27393 27394 27395 27396 27397 27398 27399 27400 27401 27402 27403 27404 27405 27406 27407 27408 27409 27410 27411 27412 27413 27414 27415 27416 27417 27418 27419 27420 27421 27422 27423 27424 27425 27426 27427 27428 27429 27430 27431 27432 27433 27434 27435 27436 27437 27438 27439 27440 27441 27442 27443 27444 27445 27446 27447 27448 27449 27450 27451 27452 27453 27454 27455 27456 27457 27458 27459 27460 27461 27462 27463 27464 27465 27466 27467 27468 27469 27470 27471 27472 27473 27474 27475 27476 27477 27478 27479 27480 27481 27482 27483 27484 27485 27486 27487 27488 27489 27490 27491 27492 27493 27494 27495 27496 27497 27498 27499 27500 27501 27502 27503 27504 27505 27506 27507 27508 27509 27510 27511 27512 27513 27514 27515 27516 27517 27518 27519 27520 27521 27522 27523 27524 27525 27526 27527 27528 27529 27530 27531 27532 27533 27534 27535 27536 27537 27538 27539 27540 27541 27542 27543 27544 27545 27546 27547 27548 27549 27550 27551 27552 27553 27554 27555 27556 27557 27558 27559 27560 27561 27562 27563 27564 27565 27566 27567 27568 27569 27570 27571 27572 27573 27574 27575 27576 27577 27578 27579 27580 27581 27582 27583 27584 27585 27586 27587 27588 27589 27590 27591 27592 27593 27594 27595 27596 27597 27598 27599 27600 27601 27602 27603 27604 27605 27606 27607 27608 27609 27610 27611 27612 27613 27614 27615 27616 27617 27618 27619 27620 27621 27622 27623 27624 27625 27626 27627 27628 27629 27630 27631 27632 27633 27634 27635 27636 27637 27638 27639 27640 27641 27642 27643 27644 27645 27646 27647 27648 27649 27650 27651 27652 27653 27654 27655 27656 27657 27658 27659 27660 27661 27662 27663 27664 27665 27666 27667 27668 27669 27670 27671 27672 27673 27674 27675 27676 27677 27678 27679 27680 27681 27682 27683 27684 27685 27686 27687 27688 27689 27690 27691 27692 27693 27694 27695 27696 27697 27698 27699 27700 27701 27702 27703 27704 27705 27706 27707 27708 27709 27710 27711 27712 27713 27714 27715 27716 27717 27718 27719 27720 27721 27722 27723 27724 27725 27726 27727 27728 27729 27730 27731 27732 27733 27734 27735 27736 27737 27738 27739 27740 27741 27742 27743 27744 27745 27746 27747 27748 27749 27750 27751 27752 27753 27754 27755 27756 27757 27758 27759 27760 27761 27762 27763 27764 27765 27766 27767 27768 27769 27770 27771 27772 27773 27774 27775 27776 27777 27778 27779 27780 27781 27782 27783 27784 27785 27786 27787 27788 27789 27790 27791 27792 27793 27794 27795 27796 27797 27798 27799 27800 27801 27802 27803 27804 27805 27806 27807 27808 27809 27810 27811 27812 27813 27814 27815 27816 27817 27818 27819 27820 27821 27822 27823 27824 27825 27826 27827 27828 27829 27830 27831 27832 27833 27834 27835 27836 27837 27838 27839 27840 27841 27842 27843 27844 27845 27846 27847 27848 27849 27850 27851 27852 27853 27854 27855 27856 27857 27858 27859 27860 27861 27862 27863 27864 27865 27866 27867 27868 27869 27870 27871 27872 27873 27874 27875 27876 27877 27878 27879 27880 27881 27882 27883 27884 27885 27886 27887 27888 27889 27890 27891 27892 27893 27894 27895 27896 27897 27898 27899 27900 27901 27902 27903 27904 27905 27906 27907 27908 27909 27910 27911 27912 27913 27914 27915 27916 27917 27918 27919 27920 27921 27922 27923 27924 27925 27926 27927 27928 27929 27930 27931 27932 27933 27934 27935 27936 27937 27938 27939 27940 27941 27942 27943 27944 27945 27946 27947 27948 27949 27950 27951 27952 27953 27954 27955 27956 27957 27958 27959 27960 27961 27962 27963 27964 27965 27966 27967 27968 27969 27970 27971 27972 27973 27974 27975 27976 27977 27978 27979 27980 27981 27982 27983 27984 27985 27986 27987 27988 27989 27990 27991 27992 27993 27994 27995 27996 27997 27998 27999 28000 28001 28002 28003 28004 28005 28006 28007 28008 28009 28010 28011 28012 28013 28014 28015 28016 28017 28018 28019 28020 28021 28022 28023 28024 28025 28026 28027 28028 28029 28030 28031 28032 28033 28034 28035 28036 28037 28038 28039 28040 28041 28042 28043 28044 28045 28046 28047 28048 28049 28050 28051 28052 28053 28054 28055 28056 28057 28058 28059 28060 28061 28062 28063 28064 28065 28066 28067 28068 28069 28070 28071 28072 28073 28074 28075 28076 28077 28078 28079 28080 28081 28082 28083 28084 28085 28086 28087 28088 28089 28090 28091 28092 28093 28094 28095 28096 28097 28098 28099 28100 28101 28102 28103 28104 28105 28106 28107 28108 28109 28110 28111 28112 28113 28114 28115 28116 28117 28118 28119 28120 28121 28122 28123 28124 28125 28126 28127 28128 28129 28130 28131 28132 28133 28134 28135 28136 28137 28138 28139 28140 28141 28142 28143 28144 28145 28146 28147 28148 28149 28150 28151 28152 28153 28154 28155 28156 28157 28158 28159 28160 28161 28162 28163 28164 28165 28166 28167 28168 28169 28170 28171 28172 28173 28174 28175 28176 28177 28178 28179 28180 28181 28182 28183 28184 28185 28186 28187 28188 28189 28190 28191 28192 28193 28194 28195 28196 28197 28198 28199 28200 28201 28202 28203 28204 28205 28206 28207 28208 28209 28210 28211 28212 28213 28214 28215 28216 28217 28218 28219 28220 28221 28222 28223 28224 28225 28226 28227 28228 28229 28230 28231 28232 28233 28234 28235 28236 28237 28238 28239 28240 28241 28242 28243 28244 28245 28246 28247 28248 28249 28250 28251 28252 28253 28254 28255 28256 28257 28258 28259 28260 28261 28262 28263 28264 28265 28266 28267 28268 28269 28270 28271 28272 28273 28274 28275 28276 28277 28278 28279 28280 28281 28282 28283 28284 28285 28286 28287 28288 28289 28290 28291 28292 28293 28294 28295 28296 28297 28298 28299 28300 28301 28302 28303 28304 28305 28306 28307 28308 28309 28310 28311 28312 28313 28314 28315 28316 28317 28318 28319 28320 28321 28322 28323 28324 28325 28326 28327 28328 28329 28330 28331 28332 28333 28334 28335 28336 28337 28338 28339 28340 28341 28342 28343 28344 28345 28346 28347 28348 28349 28350 28351 28352 28353 28354 28355 28356 28357 28358 28359 28360 28361 28362 28363 28364 28365 28366 28367 28368 28369 28370 28371 28372 28373 28374 28375 28376 28377 28378 28379 28380 28381 28382 28383 28384 28385 28386 28387 28388 28389 28390 28391 28392 28393 28394 28395 28396 28397 28398 28399 28400 28401 28402 28403 28404 28405 28406 28407 28408 28409 28410 28411 28412 28413 28414 28415 28416 28417 28418 28419 28420 28421 28422 28423 28424 28425 28426 28427 28428 28429 28430 28431 28432 28433 28434 28435 28436 28437 28438 28439 28440 28441 28442 28443 28444 28445 28446 28447 28448 28449 28450 28451 28452 28453 28454 28455 28456 28457 28458 28459 28460 28461 28462 28463 28464 28465 28466 28467 28468 28469 28470 28471 28472 28473 28474 28475 28476 28477 28478 28479 28480 28481 28482 28483 28484 28485 28486 28487 28488 28489 28490 28491 28492 28493 28494 28495 28496 28497 28498 28499 28500 28501 28502 28503 28504 28505 28506 28507 28508 28509 28510 28511 28512 28513 28514 28515 28516 28517 28518 28519 28520 28521 28522 28523 28524 28525 28526 28527 28528 28529 28530 28531 28532 28533 28534 28535 28536 28537 28538 28539 28540 28541 28542 28543 28544 28545 28546 28547 28548 28549 28550 28551 28552 28553 28554 28555 28556 28557 28558 28559 28560 28561 28562 28563 28564 28565 28566 28567 28568 28569 28570 28571 28572 28573 28574 28575 28576 28577 28578 28579 28580 28581 28582 28583 28584 28585 28586 28587 28588 28589 28590 28591 28592 28593 28594 28595 28596 28597 28598 28599 28600 28601 28602 28603 28604 28605 28606 28607 28608 28609 28610 28611 28612 28613 28614 28615 28616 28617 28618 28619 28620 28621 28622 28623 28624 28625 28626 28627 28628 28629 28630 28631 28632 28633 28634 28635 28636 28637 28638 28639 28640 28641 28642 28643 28644 28645 28646 28647 28648 28649 28650 28651 28652 28653 28654 28655 28656 28657 28658 28659 28660 28661 28662 28663 28664 28665 28666 28667 28668 28669 28670 28671 28672 28673 28674 28675 28676 28677 28678 28679 28680 28681 28682 28683 28684 28685 28686 28687 28688 28689 28690 28691 28692 28693 28694 28695 28696 28697 28698 28699 28700 28701 28702 28703 28704 28705 28706 28707 28708 28709 28710 28711 28712 28713 28714 28715 28716 28717 28718 28719 28720 28721 28722 28723 28724 28725 28726 28727 28728 28729 28730 28731 28732 28733 28734 28735 28736 28737 28738 28739 28740 28741 28742 28743 28744 28745 28746 28747 28748 28749 28750 28751 28752 28753 28754 28755 28756 28757 28758 28759 28760 28761 28762 28763 28764 28765 28766 28767 28768 28769 28770 28771 28772 28773 28774 28775 28776 28777 28778 28779 28780 28781 28782 28783 28784 28785 28786 28787 28788 28789 28790 28791 28792 28793 28794 28795 28796 28797 28798 28799 28800 28801 28802 28803 28804 28805 28806 28807 28808 28809 28810 28811 28812 28813 28814 28815 28816 28817 28818 28819 28820 28821 28822 28823 28824 28825 28826 28827 28828 28829 28830 28831 28832 28833 28834 28835 28836 28837 28838 28839 28840 28841 28842 28843 28844 28845 28846 28847 28848 28849 28850 28851 28852 28853 28854 28855 28856 28857 28858 28859 28860 28861 28862 28863 28864 28865 28866 28867 28868 28869 28870 28871 28872 28873 28874 28875 28876 28877 28878 28879 28880 28881 28882 28883 28884 28885 28886 28887 28888 28889 28890 28891 28892 28893 28894 28895 28896 28897 28898 28899 28900 28901 28902 28903 28904 28905 28906 28907 28908 28909 28910 28911 28912 28913 28914 28915 28916 28917 28918 28919 28920 28921 28922 28923 28924 28925 28926 28927 28928 28929 28930 28931 28932 28933 28934 28935 28936 28937 28938 28939 28940 28941 28942 28943 28944 28945 28946 28947 28948 28949 28950 28951 28952 28953 28954 28955 28956 28957 28958 28959 28960 28961 28962 28963 28964 28965 28966 28967 28968 28969 28970 28971 28972 28973 28974 28975 28976 28977 28978 28979 28980 28981 28982 28983 28984 28985 28986 28987 28988 28989 28990 28991 28992 28993 28994 28995 28996 28997 28998 28999 29000 29001 29002 29003 29004 29005 29006 29007 29008 29009 29010 29011 29012 29013 29014 29015 29016 29017 29018 29019 29020 29021 29022 29023 29024 29025 29026 29027 29028 29029 29030 29031 29032 29033 29034 29035 29036 29037 29038 29039 29040 29041 29042 29043 29044 29045 29046 29047 29048 29049 29050 29051 29052 29053 29054 29055 29056 29057 29058 29059 29060 29061 29062 29063 29064 29065 29066 29067 29068 29069 29070 29071 29072 29073 29074 29075 29076 29077 29078 29079 29080 29081 29082 29083 29084 29085 29086 29087 29088 29089 29090 29091 29092 29093 29094 29095 29096 29097 29098 29099 29100 29101 29102 29103 29104 29105 29106 29107 29108 29109 29110 29111 29112 29113 29114 29115 29116 29117 29118 29119 29120 29121 29122 29123 29124 29125 29126 29127 29128 29129 29130 29131 29132 29133 29134 29135 29136 29137 29138 29139 29140 29141 29142 29143 29144 29145 29146 29147 29148 29149 29150 29151 29152 29153 29154 29155 29156 29157 29158 29159 29160 29161 29162 29163 29164 29165 29166 29167 29168 29169 29170 29171 29172 29173 29174 29175 29176 29177 29178 29179 29180 29181 29182 29183 29184 29185 29186 29187 29188 29189 29190 29191 29192 29193 29194 29195 29196 29197 29198 29199 29200 29201 29202 29203 29204 29205 29206 29207 29208 29209 29210 29211 29212 29213 29214 29215 29216 29217 29218 29219 29220 29221 29222 29223 29224 29225 29226 29227 29228 29229 29230 29231 29232 29233 29234 29235 29236 29237 29238 29239 29240 29241 29242 29243 29244 29245 29246 29247 29248 29249 29250 29251 29252 29253 29254 29255 29256 29257 29258 29259 29260 29261 29262 29263 29264 29265 29266 29267 29268 29269 29270 29271 29272 29273 29274 29275 29276 29277 29278 29279 29280 29281 29282 29283 29284 29285 29286 29287 29288 29289 29290 29291 29292 29293 29294 29295 29296 29297 29298 29299 29300 29301 29302 29303 29304 29305 29306 29307 29308 29309 29310 29311 29312 29313 29314 29315 29316 29317 29318 29319 29320 29321 29322 29323 29324 29325 29326 29327 29328 29329 29330 29331 29332 29333 29334 29335 29336 29337 29338 29339 29340 29341 29342 29343 29344 29345 29346 29347 29348 29349 29350 29351 29352 29353 29354 29355 29356 29357 29358 29359 29360 29361 29362 29363 29364 29365 29366 29367 29368 29369 29370 29371 29372 29373 29374 29375 29376 29377 29378 29379 29380 29381 29382 29383 29384 29385 29386 29387 29388 29389 29390 29391 29392 29393 29394 29395 29396 29397 29398 29399 29400 29401 29402 29403 29404 29405 29406 29407 29408 29409 29410 29411 29412 29413 29414 29415 29416 29417 29418 29419 29420 29421 29422 29423 29424 29425 29426 29427 29428 29429 29430 29431 29432 29433 29434 29435 29436 29437 29438 29439 29440 29441 29442 29443 29444 29445 29446 29447 29448 29449 29450 29451 29452 29453 29454 29455 29456 29457 29458 29459 29460 29461 29462 29463 29464 29465 29466 29467 29468 29469 29470 29471 29472 29473 29474 29475 29476 29477 29478 29479 29480 29481 29482 29483 29484 29485 29486 29487 29488 29489 29490 29491 29492 29493 29494 29495 29496 29497 29498 29499 29500 29501 29502 29503 29504 29505 29506 29507 29508 29509 29510 29511 29512 29513 29514 29515 29516 29517 29518 29519 29520 29521 29522 29523 29524 29525 29526 29527 29528 29529 29530 29531 29532 29533 29534 29535 29536 29537 29538 29539 29540 29541 29542 29543 29544 29545 29546 29547 29548 29549 29550 29551 29552 29553 29554 29555 29556 29557 29558 29559 29560 29561 29562 29563 29564 29565 29566 29567 29568 29569 29570 29571 29572 29573 29574 29575 29576 29577 29578 29579 29580 29581 29582 29583 29584 29585 29586 29587 29588 29589 29590 29591 29592 29593 29594 29595 29596 29597 29598 29599 29600 29601 29602 29603 29604 29605 29606 29607 29608 29609 29610 29611 29612 29613 29614 29615 29616 29617 29618 29619 29620 29621 29622 29623 29624 29625 29626 29627 29628 29629 29630 29631 29632 29633 29634 29635 29636 29637 29638 29639 29640 29641 29642 29643 29644 29645 29646 29647 29648 29649 29650 29651 29652 29653 29654 29655 29656 29657 29658 29659 29660 29661 29662 29663 29664 29665 29666 29667 29668 29669 29670 29671 29672 29673 29674 29675 29676 29677 29678 29679 29680 29681 29682 29683 29684 29685 29686 29687 29688 29689 29690 29691 29692 29693 29694 29695 29696 29697 29698 29699 29700 29701 29702 29703 29704 29705 29706 29707 29708 29709 29710 29711 29712 29713 29714 29715 29716 29717 29718 29719 29720 29721 29722 29723 29724 29725 29726 29727 29728 29729 29730 29731 29732 29733 29734 29735 29736 29737 29738 29739 29740 29741 29742 29743 29744 29745 29746 29747 29748 29749 29750 29751 29752 29753 29754 29755 29756 29757 29758 29759 29760 29761 29762 29763 29764 29765 29766 29767 29768 29769 29770 29771 29772 29773 29774 29775 29776 29777 29778 29779 29780 29781 29782 29783 29784 29785 29786 29787 29788 29789 29790 29791 29792 29793 29794 29795 29796 29797 29798 29799 29800 29801 29802 29803 29804 29805 29806 29807 29808 29809 29810 29811 29812 29813 29814 29815 29816 29817 29818 29819 29820 29821 29822 29823 29824 29825 29826 29827 29828 29829 29830 29831 29832 29833 29834 29835 29836 29837 29838 29839 29840 29841 29842 29843 29844 29845 29846 29847 29848 29849 29850 29851 29852 29853 29854 29855 29856 29857 29858 29859 29860 29861 29862 29863 29864 29865 29866 29867 29868 29869 29870 29871 29872 29873 29874 29875 29876 29877 29878 29879 29880 29881 29882 29883 29884 29885 29886 29887 29888 29889 29890 29891 29892 29893 29894 29895 29896 29897 29898 29899 29900 29901 29902 29903 29904 29905 29906 29907 29908 29909 29910 29911 29912 29913 29914 29915 29916 29917 29918 29919 29920 29921 29922 29923 29924 29925 29926 29927 29928 29929 29930 29931 29932 29933 29934 29935 29936 29937 29938 29939 29940 29941 29942 29943 29944 29945 29946 29947 29948 29949 29950 29951 29952 29953 29954 29955 29956 29957 29958 29959 29960 29961 29962 29963 29964 29965 29966 29967 29968 29969 29970 29971 29972 29973 29974 29975 29976 29977 29978 29979 29980 29981 29982 29983 29984 29985 29986 29987 29988 29989 29990 29991 29992 29993 29994 29995 29996 29997 29998 29999 30000 30001 30002 30003 30004 30005 30006 30007 30008 30009 30010 30011 30012 30013 30014 30015 30016 30017 30018 30019 30020 30021 30022 30023 30024 30025 30026 30027 30028 30029 30030 30031 30032 30033 30034 30035 30036 30037 30038 30039 30040 30041 30042 30043 30044 30045 30046 30047 30048 30049 30050 30051 30052 30053 30054 30055 30056 30057 30058 30059 30060 30061 30062 30063 30064 30065 30066 30067 30068 30069 30070 30071 30072 30073 30074 30075 30076 30077 30078 30079 30080 30081 30082 30083 30084 30085 30086 30087 30088 30089 30090 30091 30092 30093 30094 30095 30096 30097 30098 30099 30100 30101 30102 30103 30104 30105 30106 30107 30108 30109 30110 30111 30112 30113 30114 30115 30116 30117 30118 30119 30120 30121 30122 30123 30124 30125 30126 30127 30128 30129 30130 30131 30132 30133 30134 30135 30136 30137 30138 30139 30140 30141 30142 30143 30144 30145 30146 30147 30148 30149 30150 30151 30152 30153 30154 30155 30156 30157 30158 30159 30160 30161 30162 30163 30164 30165 30166 30167 30168 30169 30170 30171 30172 30173 30174 30175 30176 30177 30178 30179 30180 30181 30182 30183 30184 30185 30186 30187 30188 30189 30190 30191 30192 30193 30194 30195 30196 30197 30198 30199 30200 30201 30202 30203 30204 30205 30206 30207 30208 30209 30210 30211 30212 30213 30214 30215 30216 30217 30218 30219 30220 30221 30222 30223 30224 30225 30226 30227 30228 30229 30230 30231 30232 30233 30234 30235 30236 30237 30238 30239 30240 30241 30242 30243 30244 30245 30246 30247 30248 30249 30250 30251 30252 30253 30254 30255 30256 30257 30258 30259 30260 30261 30262 30263 30264 30265 30266 30267 30268 30269 30270 30271 30272 30273 30274 30275 30276 30277 30278 30279 30280 30281 30282 30283 30284 30285 30286 30287 30288 30289 30290 30291 30292 30293 30294 30295 30296 30297 30298 30299 30300 30301 30302 30303 30304 30305 30306 30307 30308 30309 30310 30311 30312 30313 30314 30315 30316 30317 30318 30319 30320 30321 30322 30323 30324 30325 30326 30327 30328 30329 30330 30331 30332 30333 30334 30335 30336 30337 30338 30339 30340 30341 30342 30343 30344 30345 30346 30347 30348 30349 30350 30351 30352 30353 30354 30355 30356 30357 30358 30359 30360 30361 30362 30363 30364 30365 30366 30367 30368 30369 30370 30371 30372 30373 30374 30375 30376 30377 30378 30379 30380 30381 30382 30383 30384 30385 30386 30387 30388 30389 30390 30391 30392 30393 30394 30395 30396 30397 30398 30399 30400 30401 30402 30403 30404 30405 30406 30407 30408 30409 30410 30411 30412 30413 30414 30415 30416 30417 30418 30419 30420 30421 30422 30423 30424 30425 30426 30427 30428 30429 30430 30431 30432 30433 30434 30435 30436 30437 30438 30439 30440 30441 30442 30443 30444 30445 30446 30447 30448 30449 30450 30451 30452 30453 30454 30455 30456 30457 30458 30459 30460 30461 30462 30463 30464 30465 30466 30467 30468 30469 30470 30471 30472 30473 30474 30475 30476 30477 30478 30479 30480 30481 30482 30483 30484 30485 30486 30487 30488 30489 30490 30491 30492 30493 30494 30495 30496 30497 30498 30499 30500 30501 30502 30503 30504 30505 30506 30507 30508 30509 30510 30511 30512 30513 30514 30515 30516 30517 30518 30519 30520 30521 30522 30523 30524 30525 30526 30527 30528 30529 30530 30531 30532 30533 30534 30535 30536 30537 30538 30539 30540 30541 30542 30543 30544 30545 30546 30547 30548 30549 30550 30551 30552 30553 30554 30555 30556 30557 30558 30559 30560 30561 30562 30563 30564 30565 30566 30567 30568 30569 30570 30571 30572 30573 30574 30575 30576 30577 30578 30579 30580 30581 30582 30583 30584 30585 30586 30587 30588 30589 30590 30591 30592 30593 30594 30595 30596 30597 30598 30599 30600 30601 30602 30603 30604 30605 30606 30607 30608 30609 30610 30611 30612 30613 30614 30615 30616 30617 30618 30619 30620 30621 30622 30623 30624 30625 30626 30627 30628 30629 30630 30631 30632 30633 30634 30635 30636 30637 30638 30639 30640 30641 30642 30643 30644 30645 30646 30647 30648 30649 30650 30651 30652 30653 30654 30655 30656 30657 30658 30659 30660 30661 30662 30663 30664 30665 30666 30667 30668 30669 30670 30671 30672 30673 30674 30675 30676 30677 30678 30679 30680 30681 30682 30683 30684 30685 30686 30687 30688 30689 30690 30691 30692 30693 30694 30695 30696 30697 30698 30699 30700 30701 30702 30703 30704 30705 30706 30707 30708 30709 30710 30711 30712 30713 30714 30715 30716 30717 30718 30719 30720 30721 30722 30723 30724 30725 30726 30727 30728 30729 30730 30731 30732 30733 30734 30735 30736 30737 30738 30739 30740 30741 30742 30743 30744 30745 30746 30747 30748 30749 30750 30751 30752 30753 30754 30755 30756 30757 30758 30759 30760 30761 30762 30763 30764 30765 30766 30767 30768 30769 30770 30771 30772 30773 30774 30775 30776 30777 30778 30779 30780 30781 30782 30783 30784 30785 30786 30787 30788 30789 30790 30791 30792 30793 30794 30795 30796 30797 30798 30799 30800 30801 30802 30803 30804 30805 30806 30807 30808 30809 30810 30811 30812 30813 30814 30815 30816 30817 30818 30819 30820 30821 30822 30823 30824 30825 30826 30827 30828 30829 30830 30831 30832 30833 30834 30835 30836 30837 30838 30839 30840 30841 30842 30843 30844 30845 30846 30847 30848 30849 30850 30851 30852 30853 30854 30855 30856 30857 30858 30859 30860 30861 30862 30863 30864 30865 30866 30867 30868 30869 30870 30871 30872 30873 30874 30875 30876 30877 30878 30879 30880 30881 30882 30883 30884 30885 30886 30887 30888 30889 30890 30891 30892 30893 30894 30895 30896 30897 30898 30899 30900 30901 30902 30903 30904 30905 30906 30907 30908 30909 30910 30911 30912 30913 30914 30915 30916 30917 30918 30919 30920 30921 30922 30923 30924 30925 30926 30927 30928 30929 30930 30931 30932 30933 30934 30935 30936 30937 30938 30939 30940 30941 30942 30943 30944 30945 30946 30947 30948 30949 30950 30951 30952 30953 30954 30955 30956 30957 30958 30959 30960 30961 30962 30963 30964 30965 30966 30967 30968 30969 30970 30971 30972 30973 30974 30975 30976 30977 30978 30979 30980 30981 30982 30983 30984 30985 30986 30987 30988 30989 30990 30991 30992 30993 30994 30995 30996 30997 30998 30999 31000 31001 31002 31003 31004 31005 31006 31007 31008 31009 31010 31011 31012 31013 31014 31015 31016 31017 31018 31019 31020 31021 31022 31023 31024 31025 31026 31027 31028 31029 31030 31031 31032 31033 31034 31035 31036 31037 31038 31039 31040 31041 31042 31043 31044 31045 31046 31047 31048 31049 31050 31051 31052 31053 31054 31055 31056 31057 31058 31059 31060 31061 31062 31063 31064 31065 31066 31067 31068 31069 31070 31071 31072 31073 31074 31075 31076 31077 31078 31079 31080 31081 31082 31083 31084 31085 31086 31087 31088 31089 31090 31091 31092 31093 31094 31095 31096 31097 31098 31099 31100 31101 31102 31103 31104 31105 31106 31107 31108 31109 31110 31111 31112 31113 31114 31115 31116 31117 31118 31119 31120 31121 31122 31123 31124 31125 31126 31127 31128 31129 31130 31131 31132 31133 31134 31135 31136 31137 31138 31139 31140 31141 31142 31143 31144 31145 31146 31147 31148 31149 31150 31151 31152 31153 31154 31155 31156 31157 31158 31159 31160 31161 31162 31163 31164 31165 31166 31167 31168 31169 31170 31171 31172 31173 31174 31175 31176 31177 31178 31179 31180 31181 31182 31183 31184 31185 31186 31187 31188 31189 31190 31191 31192 31193 31194 31195 31196 31197 31198 31199 31200 31201 31202 31203 31204 31205 31206 31207 31208 31209 31210 31211 31212 31213 31214 31215 31216 31217 31218 31219 31220 31221 31222 31223 31224 31225 31226 31227 31228 31229 31230 31231 31232 31233 31234 31235 31236 31237 31238 31239 31240 31241 31242 31243 31244 31245 31246 31247 31248 31249 31250 31251 31252 31253 31254 31255 31256 31257 31258 31259 31260 31261 31262 31263 31264 31265 31266 31267 31268 31269 31270 31271 31272 31273 31274 31275 31276 31277 31278 31279 31280 31281 31282 31283 31284 31285 31286 31287 31288 31289 31290 31291 31292 31293 31294 31295 31296 31297 31298 31299 31300 31301 31302 31303 31304 31305 31306 31307 31308 31309 31310 31311 31312 31313 31314 31315 31316 31317 31318 31319 31320 31321 31322 31323 31324 31325 31326 31327 31328 31329 31330 31331 31332 31333 31334 31335 31336 31337 31338 31339 31340 31341 31342 31343 31344 31345 31346 31347 31348 31349 31350 31351 31352 31353 31354 31355 31356 31357 31358 31359 31360 31361 31362 31363 31364 31365 31366 31367 31368 31369 31370 31371 31372 31373 31374 31375 31376 31377 31378 31379 31380 31381 31382 31383 31384 31385 31386 31387 31388 31389 31390 31391 31392 31393 31394 31395 31396 31397 31398 31399 31400 31401 31402 31403 31404 31405 31406 31407 31408 31409 31410 31411 31412 31413 31414 31415 31416 31417 31418 31419 31420 31421 31422 31423 31424 31425 31426 31427 31428 31429 31430 31431 31432 31433 31434 31435 31436 31437 31438 31439 31440 31441 31442 31443 31444 31445 31446 31447 31448 31449 31450 31451 31452 31453 31454 31455 31456 31457 31458 31459 31460 31461 31462 31463 31464 31465 31466 31467 31468 31469 31470 31471 31472 31473 31474 31475 31476 31477 31478 31479 31480 31481 31482 31483 31484 31485 31486 31487 31488 31489 31490 31491 31492 31493 31494 31495 31496 31497 31498 31499 31500 31501 31502 31503 31504 31505 31506 31507 31508 31509 31510 31511 31512 31513 31514 31515 31516 31517 31518 31519 31520 31521 31522 31523 31524 31525 31526 31527 31528 31529 31530 31531 31532 31533 31534 31535 31536 31537 31538 31539 31540 31541 31542 31543 31544 31545 31546 31547 31548 31549 31550 31551 31552 31553 31554 31555 31556 31557 31558 31559 31560 31561 31562 31563 31564 31565 31566 31567 31568 31569 31570 31571 31572 31573 31574 31575 31576 31577 31578 31579 31580 31581 31582 31583 31584 31585 31586 31587 31588 31589 31590 31591 31592 31593 31594 31595 31596 31597 31598 31599 31600 31601 31602 31603 31604 31605 31606 31607 31608 31609 31610 31611 31612 31613 31614 31615 31616 31617 31618 31619 31620 31621 31622 31623 31624 31625 31626 31627 31628 31629 31630 31631 31632 31633 31634 31635 31636 31637 31638 31639 31640 31641 31642 31643 31644 31645 31646 31647 31648 31649 31650 31651 31652 31653 31654 31655 31656 31657 31658 31659 31660 31661 31662 31663 31664 31665 31666 31667 31668 31669 31670 31671 31672 31673 31674 31675 31676 31677 31678 31679 31680 31681 31682 31683 31684 31685 31686 31687 31688 31689 31690 31691 31692 31693 31694 31695 31696 31697 31698 31699 31700 31701 31702 31703 31704 31705 31706 31707 31708 31709 31710 31711 31712 31713 31714 31715 31716 31717 31718 31719 31720 31721 31722 31723 31724 31725 31726 31727 31728 31729 31730 31731 31732 31733 31734 31735 31736 31737 31738 31739 31740 31741 31742 31743 31744 31745 31746 31747 31748 31749 31750 31751 31752 31753 31754 31755 31756 31757 31758 31759 31760 31761 31762 31763 31764 31765 31766 31767 31768 31769 31770 31771 31772 31773 31774 31775 31776 31777 31778 31779 31780 31781 31782 31783 31784 31785 31786 31787 31788 31789 31790 31791 31792 31793 31794 31795 31796 31797 31798 31799 31800 31801 31802 31803 31804 31805 31806 31807 31808 31809 31810 31811 31812 31813 31814 31815 31816 31817 31818 31819 31820 31821 31822 31823 31824 31825 31826 31827 31828 31829 31830 31831 31832 31833 31834 31835 31836 31837 31838 31839 31840 31841 31842 31843 31844 31845 31846 31847 31848 31849 31850 31851 31852 31853 31854 31855 31856 31857 31858 31859 31860 31861 31862 31863 31864 31865 31866 31867 31868 31869 31870 31871 31872 31873 31874 31875 31876 31877 31878 31879 31880 31881 31882 31883 31884 31885 31886 31887 31888 31889 31890 31891 31892 31893 31894 31895 31896 31897 31898 31899 31900 31901 31902 31903 31904 31905 31906 31907 31908 31909 31910 31911 31912 31913 31914 31915 31916 31917 31918 31919 31920 31921 31922 31923 31924 31925 31926 31927 31928 31929 31930 31931 31932 31933 31934 31935 31936 31937 31938 31939 31940 31941 31942 31943 31944 31945 31946 31947 31948 31949 31950 31951 31952 31953 31954 31955 31956 31957 31958 31959 31960 31961 31962 31963 31964 31965 31966 31967 31968 31969 31970 31971 31972 31973 31974 31975 31976 31977 31978 31979 31980 31981 31982 31983 31984 31985 31986 31987 31988 31989 31990 31991 31992 31993 31994 31995 31996 31997 31998 31999 32000 32001 32002 32003 32004 32005 32006 32007 32008 32009 32010 32011 32012 32013 32014 32015 32016 32017 32018 32019 32020 32021 32022 32023 32024 32025 32026 32027 32028 32029 32030 32031 32032 32033 32034 32035 32036 32037 32038 32039 32040 32041 32042 32043 32044 32045 32046 32047 32048 32049 32050 32051 32052 32053 32054 32055 32056 32057 32058 32059 32060 32061 32062 32063 32064 32065 32066 32067 32068 32069 32070 32071 32072 32073 32074 32075 32076 32077 32078 32079 32080 32081 32082 32083 32084 32085 32086 32087 32088 32089 32090 32091 32092 32093 32094 32095 32096 32097 32098 32099 32100 32101 32102 32103 32104 32105 32106 32107 32108 32109 32110 32111 32112 32113 32114 32115 32116 32117 32118 32119 32120 32121 32122 32123 32124 32125 32126 32127 32128 32129 32130 32131 32132 32133 32134 32135 32136 32137 32138 32139 32140 32141 32142 32143 32144 32145 32146 32147 32148 32149 32150 32151 32152 32153 32154 32155 32156 32157 32158 32159 32160 32161 32162 32163 32164 32165 32166 32167 32168 32169 32170 32171 32172 32173 32174 32175 32176 32177 32178 32179 32180 32181 32182 32183 32184 32185 32186 32187 32188 32189 32190 32191 32192 32193 32194 32195 32196 32197 32198 32199 32200 32201 32202 32203 32204 32205 32206 32207 32208 32209 32210 32211 32212 32213 32214 32215 32216 32217 32218 32219 32220 32221 32222 32223 32224 32225 32226 32227 32228 32229 32230 32231 32232 32233 32234 32235 32236 32237 32238 32239 32240 32241 32242 32243 32244 32245 32246 32247 32248 32249 32250 32251 32252 32253 32254 32255 32256 32257 32258 32259 32260 32261 32262 32263 32264 32265 32266 32267 32268 32269 32270 32271 32272 32273 32274 32275 32276 32277 32278 32279 32280 32281 32282 32283 32284 32285 32286 32287 32288 32289 32290 32291 32292 32293 32294 32295 32296 32297 32298 32299 32300 32301 32302 32303 32304 32305 32306 32307 32308 32309 32310 32311 32312 32313 32314 32315 32316 32317 32318 32319 32320 32321 32322 32323 32324 32325 32326 32327 32328 32329 32330 32331 32332 32333 32334 32335 32336 32337 32338 32339 32340 32341 32342 32343 32344 32345 32346 32347 32348 32349 32350 32351 32352 32353 32354 32355 32356 32357 32358 32359 32360 32361 32362 32363 32364 32365 32366 32367 32368 32369 32370 32371 32372 32373 32374 32375 32376 32377 32378 32379 32380 32381 32382 32383 32384 32385 32386 32387 32388 32389 32390 32391 32392 32393 32394 32395 32396 32397 32398 32399 32400 32401 32402 32403 32404 32405 32406 32407 32408 32409 32410 32411 32412 32413 32414 32415 32416 32417 32418 32419 32420 32421 32422 32423 32424 32425 32426 32427 32428 32429 32430 32431 32432 32433 32434 32435 32436 32437 32438 32439 32440 32441 32442 32443 32444 32445 32446 32447 32448 32449 32450 32451 32452 32453 32454 32455 32456 32457 32458 32459 32460 32461 32462 32463 32464 32465 32466 32467 32468 32469 32470 32471 32472 32473 32474 32475 32476 32477 32478 32479 32480 32481 32482 32483 32484 32485 32486 32487 32488 32489 32490 32491 32492 32493 32494 32495 32496 32497 32498 32499 32500 32501 32502 32503 32504 32505 32506 32507 32508 32509 32510 32511 32512 32513 32514 32515 32516 32517 32518 32519 32520 32521 32522 32523 32524 32525 32526 32527 32528 32529 32530 32531 32532 32533 32534 32535 32536 32537 32538 32539 32540 32541 32542 32543 32544 32545 32546 32547 32548 32549 32550 32551 32552 32553 32554 32555 32556 32557 32558 32559 32560 32561 32562 32563 32564 32565 32566 32567 32568 32569 32570 32571 32572 32573 32574 32575 32576 32577 32578 32579 32580 32581 32582 32583 32584 32585 32586 32587 32588 32589 32590 32591 32592 32593 32594 32595 32596 32597 32598 32599 32600 32601 32602 32603 32604 32605 32606 32607 32608 32609 32610 32611 32612 32613 32614 32615 32616 32617 32618 32619 32620 32621 32622 32623 32624 32625 32626 32627 32628 32629 32630 32631 32632 32633 32634 32635 32636 32637 32638 32639 32640 32641 32642 32643 32644 32645 32646 32647 32648 32649 32650 32651 32652 32653 32654 32655 32656 32657 32658 32659 32660 32661 32662 32663 32664 32665 32666 32667 32668 32669 32670 32671 32672 32673 32674 32675 32676 32677 32678 32679 32680 32681 32682 32683 32684 32685 32686 32687 32688 32689 32690 32691 32692 32693 32694 32695 32696 32697 32698 32699 32700 32701 32702 32703 32704 32705 32706 32707 32708 32709 32710 32711 32712 32713 32714 32715 32716 32717 32718 32719 32720 32721 32722 32723 32724 32725 32726 32727 32728 32729 32730 32731 32732 32733 32734 32735 32736 32737 32738 32739 32740 32741 32742 32743 32744 32745 32746 32747 32748 32749 32750 32751 32752 32753 32754 32755 32756 32757 32758 32759 32760 32761 32762 32763 32764 32765 32766 32767 32768 32769 32770 32771 32772 32773 32774 32775 32776 32777 32778 32779 32780 32781 32782 32783 32784 32785 32786 32787 32788 32789 32790 32791 32792 32793 32794 32795 32796 32797 32798 32799 32800 32801 32802 32803 32804 32805 32806 32807 32808 32809 32810 32811 32812 32813 32814 32815 32816 32817 32818 32819 32820 32821 32822 32823 32824 32825 32826 32827 32828 32829 32830 32831 32832 32833 32834 32835 32836 32837 32838 32839 32840 32841 32842 32843 32844 32845 32846 32847 32848 32849 32850 32851 32852 32853 32854 32855 32856 32857 32858 32859 32860 32861 32862 32863 32864 32865 32866 32867 32868 32869 32870 32871 32872 32873 32874 32875 32876 32877 32878 32879 32880 32881 32882 32883 32884 32885 32886 32887 32888 32889 32890 32891 32892 32893 32894 32895 32896 32897 32898 32899 32900 32901 32902 32903 32904 32905 32906 32907 32908 32909 32910 32911 32912 32913 32914 32915 32916 32917 32918 32919 32920 32921 32922 32923 32924 32925 32926 32927 32928 32929 32930 32931 32932 32933 32934 32935 32936 32937 32938 32939 32940 32941 32942 32943 32944 32945 32946 32947 32948 32949 32950 32951 32952 32953 32954 32955 32956 32957 32958 32959 32960 32961 32962 32963 32964 32965 32966 32967 32968 32969 32970 32971 32972 32973 32974 32975 32976 32977 32978 32979 32980 32981 32982 32983 32984 32985 32986 32987 32988 32989 32990 32991 32992 32993 32994 32995 32996 32997 32998 32999 33000 33001 33002 33003 33004 33005 33006 33007 33008 33009 33010 33011 33012 33013 33014 33015 33016 33017 33018 33019 33020 33021 33022 33023 33024 33025 33026 33027 33028 33029 33030 33031 33032 33033 33034 33035 33036 33037 33038 33039 33040 33041 33042 33043 33044 33045 33046 33047 33048 33049 33050 33051 33052 33053 33054 33055 33056 33057 33058 33059 33060 33061 33062 33063 33064 33065 33066 33067 33068 33069 33070 33071 33072 33073 33074 33075 33076 33077 33078 33079 33080 33081 33082 33083 33084 33085 33086 33087 33088 33089 33090 33091 33092 33093 33094 33095 33096 33097 33098 33099 33100 33101 33102 33103 33104 33105 33106 33107 33108 33109 33110 33111 33112 33113 33114 33115 33116 33117 33118 33119 33120 33121 33122 33123 33124 33125 33126 33127 33128 33129 33130 33131 33132 33133 33134 33135 33136 33137 33138 33139 33140 33141 33142 33143 33144 33145 33146 33147 33148 33149 33150 33151 33152 33153 33154 33155 33156 33157 33158 33159 33160 33161 33162 33163 33164 33165 33166 33167 33168 33169 33170 33171 33172 33173 33174 33175 33176 33177 33178 33179 33180 33181 33182 33183 33184 33185 33186 33187 33188 33189 33190 33191 33192 33193 33194 33195 33196 33197 33198 33199 33200 33201 33202 33203 33204 33205 33206 33207 33208 33209 33210 33211 33212 33213 33214 33215 33216 33217 33218 33219 33220 33221 33222 33223 33224 33225 33226 33227 33228 33229 33230 33231 33232 33233 33234 33235 33236 33237 33238 33239 33240 33241 33242 33243 33244 33245 33246 33247 33248 33249 33250 33251 33252 33253 33254 33255 33256 33257 33258 33259 33260 33261 33262 33263 33264 33265 33266 33267 33268 33269 33270 33271 33272 33273 33274 33275 33276 33277 33278 33279 33280 33281 33282 33283 33284 33285 33286 33287 33288 33289 33290 33291 33292 33293 33294 33295 33296 33297 33298 33299 33300 33301 33302 33303 33304 33305 33306 33307 33308 33309 33310 33311 33312 33313 33314 33315 33316 33317 33318 33319 33320 33321 33322 33323 33324 33325 33326 33327 33328 33329 33330 33331 33332 33333 33334 33335 33336 33337 33338 33339 33340 33341 33342 33343 33344 33345 33346 33347 33348 33349 33350 33351 33352 33353 33354 33355 33356 33357 33358 33359 33360 33361 33362 33363 33364 33365 33366 33367 33368 33369 33370 33371 33372 33373 33374 33375 33376 33377 33378 33379 33380 33381 33382 33383 33384 33385 33386 33387 33388 33389 33390 33391 33392 33393 33394 33395 33396 33397 33398 33399 33400 33401 33402 33403 33404 33405 33406 33407 33408 33409 33410 33411 33412 33413 33414 33415 33416 33417 33418 33419 33420 33421 33422 33423 33424 33425 33426 33427 33428 33429 33430 33431 33432 33433 33434 33435 33436 33437 33438 33439 33440 33441 33442 33443 33444 33445 33446 33447 33448 33449 33450 33451 33452 33453 33454 33455 33456 33457 33458 33459 33460 33461 33462 33463 33464 33465 33466 33467 33468 33469 33470 33471 33472 33473 33474 33475 33476 33477 33478 33479 33480 33481 33482 33483 33484 33485 33486 33487 33488 33489 33490 33491 33492 33493 33494 33495 33496 33497 33498 33499 33500 33501 33502 33503 33504 33505 33506 33507 33508 33509 33510 33511 33512 33513 33514 33515 33516 33517 33518 33519 33520 33521 33522 33523 33524 33525 33526 33527 33528 33529 33530 33531 33532 33533 33534 33535 33536 33537 33538 33539 33540 33541 33542 33543 33544 33545 33546 33547 33548 33549 33550 33551 33552 33553 33554 33555 33556 33557 33558 33559 33560 33561 33562 33563 33564 33565 33566 33567 33568 33569 33570 33571 33572 33573 33574 33575 33576 33577 33578 33579 33580 33581 33582 33583 33584 33585 33586 33587 33588 33589 33590 33591 33592 33593 33594 33595 33596 33597 33598 33599 33600 33601 33602 33603 33604 33605 33606 33607 33608 33609 33610 33611 33612 33613 33614 33615 33616 33617 33618 33619 33620 33621 33622 33623 33624 33625 33626 33627 33628 33629 33630 33631 33632 33633 33634 33635 33636 33637 33638 33639 33640 33641 33642 33643 33644 33645 33646 33647 33648 33649 33650 33651 33652 33653 33654 33655 33656 33657 33658 33659 33660 33661 33662 33663 33664 33665 33666 33667 33668 33669 33670 33671 33672 33673 33674 33675 33676 33677 33678 33679 33680 33681 33682 33683 33684 33685 33686 33687 33688 33689 33690 33691 33692 33693 33694 33695 33696 33697 33698 33699 33700 33701 33702 33703 33704 33705 33706 33707 33708 33709 33710 33711 33712 33713 33714 33715 33716 33717 33718 33719 33720 33721 33722 33723 33724 33725 33726 33727 33728 33729 33730 33731 33732 33733 33734 33735 33736 33737 33738 33739 33740 33741 33742 33743 33744 33745 33746 33747 33748 33749 33750 33751 33752 33753 33754 33755 33756 33757 33758 33759 33760 33761 33762 33763 33764 33765 33766 33767 33768 33769 33770 33771 33772 33773 33774 33775 33776 33777 33778 33779 33780 33781 33782 33783 33784 33785 33786 33787 33788 33789 33790 33791 33792 33793 33794 33795 33796 33797 33798 33799 33800 33801 33802 33803 33804 33805 33806 33807 33808 33809 33810 33811 33812 33813 33814 33815 33816 33817 33818 33819 33820 33821 33822 33823 33824 33825 33826 33827 33828 33829 33830 33831 33832 33833 33834 33835 33836 33837 33838 33839 33840 33841 33842 33843 33844 33845 33846 33847 33848 33849 33850 33851 33852 33853 33854 33855 33856 33857 33858 33859 33860 33861 33862 33863 33864 33865 33866 33867 33868 33869 33870 33871 33872 33873 33874 33875 33876 33877 33878 33879 33880 33881 33882 33883 33884 33885 33886 33887 33888 33889 33890 33891 33892 33893 33894 33895 33896 33897 33898 33899 33900 33901 33902 33903 33904 33905 33906 33907 33908 33909 33910 33911 33912 33913 33914 33915 33916 33917 33918 33919 33920 33921 33922 33923 33924 33925 33926 33927 33928 33929 33930 33931 33932 33933 33934 33935 33936 33937 33938 33939 33940 33941 33942 33943 33944 33945 33946 33947 33948 33949 33950 33951 33952 33953 33954 33955 33956 33957 33958 33959 33960 33961 33962 33963 33964 33965 33966 33967 33968 33969 33970 33971 33972 33973 33974 33975 33976 33977 33978 33979 33980 33981 33982 33983 33984 33985 33986 33987 33988 33989 33990 33991 33992 33993 33994 33995 33996 33997 33998 33999 34000 34001 34002 34003 34004 34005 34006 34007 34008 34009 34010 34011 34012 34013 34014 34015 34016 34017 34018 34019 34020 34021 34022 34023 34024 34025 34026 34027 34028 34029 34030 34031 34032 34033 34034 34035 34036 34037 34038 34039 34040 34041 34042 34043 34044 34045 34046 34047 34048 34049 34050 34051 34052 34053 34054 34055 34056 34057 34058 34059 34060 34061 34062 34063 34064 34065 34066 34067 34068 34069 34070 34071 34072 34073 34074 34075 34076 34077 34078 34079 34080 34081 34082 34083 34084 34085 34086 34087 34088 34089 34090 34091 34092 34093 34094 34095 34096 34097 34098 34099 34100 34101 34102 34103 34104 34105 34106 34107 34108 34109 34110 34111 34112 34113 34114 34115 34116 34117 34118 34119 34120 34121 34122 34123 34124 34125 34126 34127 34128 34129 34130 34131 34132 34133 34134 34135 34136 34137 34138 34139 34140 34141 34142 34143 34144 34145 34146 34147 34148 34149 34150 34151 34152 34153 34154 34155 34156 34157 34158 34159 34160 34161 34162 34163 34164 34165 34166 34167 34168 34169 34170 34171 34172 34173 34174 34175 34176 34177 34178 34179 34180 34181 34182 34183 34184 34185 34186 34187 34188 34189 34190 34191 34192 34193 34194 34195 34196 34197 34198 34199 34200 34201 34202 34203 34204 34205 34206 34207 34208 34209 34210 34211 34212 34213 34214 34215 34216 34217 34218 34219 34220 34221 34222 34223 34224 34225 34226 34227 34228 34229 34230 34231 34232 34233 34234 34235 34236 34237 34238 34239 34240 34241 34242 34243 34244 34245 34246 34247 34248 34249 34250 34251 34252 34253 34254 34255 34256 34257 34258 34259 34260 34261 34262 34263 34264 34265 34266 34267 34268 34269 34270 34271 34272 34273 34274 34275 34276 34277 34278 34279 34280 34281 34282 34283 34284 34285 34286 34287 34288 34289 34290 34291 34292 34293 34294 34295 34296 34297 34298 34299 34300 34301 34302 34303 34304 34305 34306 34307 34308 34309 34310 34311 34312 34313 34314 34315 34316 34317 34318 34319 34320 34321 34322 34323 34324 34325 34326 34327 34328 34329 34330 34331 34332 34333 34334 34335 34336 34337 34338 34339 34340 34341 34342 34343 34344 34345 34346 34347 34348 34349 34350 34351 34352 34353 34354 34355 34356 34357 34358 34359 34360 34361 34362 34363 34364 34365 34366 34367 34368 34369 34370 34371 34372 34373 34374 34375 34376 34377 34378 34379 34380 34381 34382 34383 34384 34385 34386 34387 34388 34389 34390 34391 34392 34393 34394 34395 34396 34397 34398 34399 34400 34401 34402 34403 34404 34405 34406 34407 34408 34409 34410 34411 34412 34413 34414 34415 34416 34417 34418 34419 34420 34421 34422 34423 34424 34425 34426 34427 34428 34429 34430 34431 34432 34433 34434 34435 34436 34437 34438 34439 34440 34441 34442 34443 34444 34445 34446 34447 34448 34449 34450 34451 34452 34453 34454 34455 34456 34457 34458 34459 34460 34461 34462 34463 34464 34465 34466 34467 34468 34469 34470 34471 34472 34473 34474 34475 34476 34477 34478 34479 34480 34481 34482 34483 34484 34485 34486 34487 34488 34489 34490 34491 34492 34493 34494 34495 34496 34497 34498 34499 34500 34501 34502 34503 34504 34505 34506 34507 34508 34509 34510 34511 34512 34513 34514 34515 34516 34517 34518 34519 34520 34521 34522 34523 34524 34525 34526 34527 34528 34529 34530 34531 34532 34533 34534 34535 34536 34537 34538 34539 34540 34541 34542 34543 34544 34545 34546 34547 34548 34549 34550 34551 34552 34553 34554 34555 34556 34557 34558 34559 34560 34561 34562 34563 34564 34565 34566 34567 34568 34569 34570 34571 34572 34573 34574 34575 34576 34577 34578 34579 34580 34581 34582 34583 34584 34585 34586 34587 34588 34589 34590 34591 34592 34593 34594 34595 34596 34597 34598 34599 34600 34601 34602 34603 34604 34605 34606 34607 34608 34609 34610 34611 34612 34613 34614 34615 34616 34617 34618 34619 34620 34621 34622 34623 34624 34625 34626 34627 34628 34629 34630 34631 34632 34633 34634 34635 34636 34637 34638 34639 34640 34641 34642 34643 34644 34645 34646 34647 34648 34649 34650 34651 34652 34653 34654 34655 34656 34657 34658 34659 34660 34661 34662 34663 34664 34665 34666 34667 34668 34669 34670 34671 34672 34673 34674 34675 34676 34677 34678 34679 34680 34681 34682 34683 34684 34685 34686 34687 34688 34689 34690 34691 34692 34693 34694 34695 34696 34697 34698 34699 34700 34701 34702 34703 34704 34705 34706 34707 34708 34709 34710 34711 34712 34713 34714 34715 34716 34717 34718 34719 34720 34721 34722 34723 34724 34725 34726 34727 34728 34729 34730 34731 34732 34733 34734 34735 34736 34737 34738 34739 34740 34741 34742 34743 34744 34745 34746 34747 34748 34749 34750 34751 34752 34753 34754 34755 34756 34757 34758 34759 34760 34761 34762 34763 34764 34765 34766 34767 34768 34769 34770 34771 34772 34773 34774 34775 34776 34777 34778 34779 34780 34781 34782 34783 34784 34785 34786 34787 34788 34789 34790 34791 34792 34793 34794 34795 34796 34797 34798 34799 34800 34801 34802 34803 34804 34805 34806 34807 34808 34809 34810 34811 34812 34813 34814 34815 34816 34817 34818 34819 34820 34821 34822 34823 34824 34825 34826 34827 34828 34829 34830 34831 34832 34833 34834 34835 34836 34837 34838 34839 34840 34841 34842 34843 34844 34845 34846 34847 34848 34849 34850 34851 34852 34853 34854 34855 34856 34857 34858 34859 34860 34861 34862 34863 34864 34865 34866 34867 34868 34869 34870 34871 34872 34873 34874 34875 34876 34877 34878 34879 34880 34881 34882 34883 34884 34885 34886 34887 34888 34889 34890 34891 34892 34893 34894 34895 34896 34897 34898 34899 34900 34901 34902 34903 34904 34905 34906 34907 34908 34909 34910 34911 34912 34913 34914 34915 34916 34917 34918 34919 34920 34921 34922 34923 34924 34925 34926 34927 34928 34929 34930 34931 34932 34933 34934 34935 34936 34937 34938 34939 34940 34941 34942 34943 34944 34945 34946 34947 34948 34949 34950 34951 34952 34953 34954 34955 34956 34957 34958 34959 34960 34961 34962 34963 34964 34965 34966 34967 34968 34969 34970 34971 34972 34973 34974 34975 34976 34977 34978 34979 34980 34981 34982 34983 34984 34985 34986 34987 34988 34989 34990 34991 34992 34993 34994 34995 34996 34997 34998 34999 35000 35001 35002 35003 35004 35005 35006 35007 35008 35009 35010 35011 35012 35013 35014 35015 35016 35017 35018 35019 35020 35021 35022 35023 35024 35025 35026 35027 35028 35029 35030 35031 35032 35033 35034 35035 35036 35037 35038 35039 35040 35041 35042 35043 35044 35045 35046 35047 35048 35049 35050 35051 35052 35053 35054 35055 35056 35057 35058 35059 35060 35061 35062 35063 35064 35065 35066 35067 35068 35069 35070 35071 35072 35073 35074 35075 35076 35077 35078 35079 35080 35081 35082 35083 35084 35085 35086 35087 35088 35089 35090 35091 35092 35093 35094 35095 35096 35097 35098 35099 35100 35101 35102 35103 35104 35105 35106 35107 35108 35109 35110 35111 35112 35113 35114 35115 35116 35117 35118 35119 35120 35121 35122 35123 35124 35125 35126 35127 35128 35129 35130 35131 35132 35133 35134 35135 35136 35137 35138 35139 35140 35141 35142 35143 35144 35145 35146 35147 35148 35149 35150 35151 35152 35153 35154 35155 35156 35157 35158 35159 35160 35161 35162 35163 35164 35165 35166 35167 35168 35169 35170 35171 35172 35173 35174 35175 35176 35177 35178 35179 35180 35181 35182 35183 35184 35185 35186 35187 35188 35189 35190 35191 35192 35193 35194 35195 35196 35197 35198 35199 35200 35201 35202 35203 35204 35205 35206 35207 35208 35209 35210 35211 35212 35213 35214 35215 35216 35217 35218 35219 35220 35221 35222 35223 35224 35225 35226 35227 35228 35229 35230 35231 35232 35233 35234 35235 35236 35237 35238 35239 35240 35241 35242 35243 35244 35245 35246 35247 35248 35249 35250 35251 35252 35253 35254 35255 35256 35257 35258 35259 35260 35261 35262 35263 35264 35265 35266 35267 35268 35269 35270 35271 35272 35273 35274 35275 35276 35277 35278 35279 35280 35281 35282 35283 35284 35285 35286 35287 35288 35289 35290 35291 35292 35293 35294 35295 35296 35297 35298 35299 35300 35301 35302 35303 35304 35305 35306 35307 35308 35309 35310 35311 35312 35313 35314 35315 35316 35317 35318 35319 35320 35321 35322 35323 35324 35325 35326 35327 35328 35329 35330 35331 35332 35333 35334 35335 35336 35337 35338 35339 35340 35341 35342 35343 35344 35345 35346 35347 35348 35349 35350 35351 35352 35353 35354 35355 35356 35357 35358 35359 35360 35361 35362 35363 35364 35365 35366 35367 35368 35369 35370 35371 35372 35373 35374 35375 35376 35377 35378 35379 35380 35381 35382 35383 35384 35385 35386 35387 35388 35389 35390 35391 35392 35393 35394 35395 35396 35397 35398 35399 35400 35401 35402 35403 35404 35405 35406 35407 35408 35409 35410 35411 35412 35413 35414 35415 35416 35417 35418 35419 35420 35421 35422 35423 35424 35425 35426 35427 35428 35429 35430 35431 35432 35433 35434 35435 35436 35437 35438 35439 35440 35441 35442 35443 35444 35445 35446 35447 35448 35449 35450 35451 35452 35453 35454 35455 35456 35457 35458 35459 35460 35461 35462 35463 35464 35465 35466 35467 35468 35469 35470 35471 35472 35473 35474 35475 35476 35477 35478 35479 35480 35481 35482 35483 35484 35485 35486 35487 35488 35489 35490 35491 35492 35493 35494 35495 35496 35497 35498 35499 35500 35501 35502 35503 35504 35505 35506 35507 35508 35509 35510 35511 35512 35513 35514 35515 35516 35517 35518 35519 35520 35521 35522 35523 35524 35525 35526 35527 35528 35529 35530 35531 35532 35533 35534 35535 35536 35537 35538 35539 35540 35541 35542 35543 35544 35545 35546 35547 35548 35549 35550 35551 35552 35553 35554 35555 35556 35557 35558 35559 35560 35561 35562 35563 35564 35565 35566 35567 35568 35569 35570 35571 35572 35573 35574 35575 35576 35577 35578 35579 35580 35581 35582 35583 35584 35585 35586 35587 35588 35589 35590 35591 35592 35593 35594 35595 35596 35597 35598 35599 35600 35601 35602 35603 35604 35605 35606 35607 35608 35609 35610 35611 35612 35613 35614 35615 35616 35617 35618 35619 35620 35621 35622 35623 35624 35625 35626 35627 35628 35629 35630 35631 35632 35633 35634 35635 35636 35637 35638 35639 35640 35641 35642 35643 35644 35645 35646 35647 35648 35649 35650 35651 35652 35653 35654 35655 35656 35657 35658 35659 35660 35661 35662 35663 35664 35665 35666 35667 35668 35669 35670 35671 35672 35673 35674 35675 35676 35677 35678 35679 35680 35681 35682 35683 35684 35685 35686 35687 35688 35689 35690 35691 35692 35693 35694 35695 35696 35697 35698 35699 35700 35701 35702 35703 35704 35705 35706 35707 35708 35709 35710 35711 35712 35713 35714 35715 35716 35717 35718 35719 35720 35721 35722 35723 35724 35725 35726 35727 35728 35729 35730 35731 35732 35733 35734 35735 35736 35737 35738 35739 35740 35741 35742 35743 35744 35745 35746 35747 35748 35749 35750 35751 35752 35753 35754 35755 35756 35757 35758 35759 35760 35761 35762 35763 35764 35765 35766 35767 35768 35769 35770 35771 35772 35773 35774 35775 35776 35777 35778 35779 35780 35781 35782 35783 35784 35785 35786 35787 35788 35789 35790 35791 35792 35793 35794 35795 35796 35797 35798 35799 35800 35801 35802 35803 35804 35805 35806 35807 35808 35809 35810 35811 35812 35813 35814 35815 35816 35817 35818 35819 35820 35821 35822 35823 35824 35825 35826 35827 35828 35829 35830 35831 35832 35833 35834 35835 35836 35837 35838 35839 35840 35841 35842 35843 35844 35845 35846 35847 35848 35849 35850 35851 35852 35853 35854 35855 35856 35857 35858 35859 35860 35861 35862 35863 35864 35865 35866 35867 35868 35869 35870 35871 35872 35873 35874 35875 35876 35877 35878 35879 35880 35881 35882 35883 35884 35885 35886 35887 35888 35889 35890 35891 35892 35893 35894 35895 35896 35897 35898 35899 35900 35901 35902 35903 35904 35905 35906 35907 35908 35909 35910 35911 35912 35913 35914 35915 35916 35917 35918 35919 35920 35921 35922 35923 35924 35925 35926 35927 35928 35929 35930 35931 35932 35933 35934 35935 35936 35937 35938 35939 35940 35941 35942 35943 35944 35945 35946 35947 35948 35949 35950 35951 35952 35953 35954 35955 35956 35957 35958 35959 35960 35961 35962 35963 35964 35965 35966 35967 35968 35969 35970 35971 35972 35973 35974 35975 35976 35977 35978 35979 35980 35981 35982 35983 35984 35985 35986 35987 35988 35989 35990 35991 35992 35993 35994 35995 35996 35997 35998 35999 36000 36001 36002 36003 36004 36005 36006 36007 36008 36009 36010 36011 36012 36013 36014 36015 36016 36017 36018 36019 36020 36021 36022 36023 36024 36025 36026 36027 36028 36029 36030 36031 36032 36033 36034 36035 36036 36037 36038 36039 36040 36041 36042 36043 36044 36045 36046 36047 36048 36049 36050 36051 36052 36053 36054 36055 36056 36057 36058 36059 36060 36061 36062 36063 36064 36065 36066 36067 36068 36069 36070 36071 36072 36073 36074 36075 36076 36077 36078 36079 36080 36081 36082 36083 36084 36085 36086 36087 36088 36089 36090 36091 36092 36093 36094 36095 36096 36097 36098 36099 36100 36101 36102 36103 36104 36105 36106 36107 36108 36109 36110 36111 36112 36113 36114 36115 36116 36117 36118 36119 36120 36121 36122 36123 36124 36125 36126 36127 36128 36129 36130 36131 36132 36133 36134 36135 36136 36137 36138 36139 36140 36141 36142 36143 36144 36145 36146 36147 36148 36149 36150 36151 36152 36153 36154 36155 36156 36157 36158 36159 36160 36161 36162 36163 36164 36165 36166 36167 36168 36169 36170 36171 36172 36173 36174 36175 36176 36177 36178 36179 36180 36181 36182 36183 36184 36185 36186 36187 36188 36189 36190 36191 36192 36193 36194 36195 36196 36197 36198 36199 36200 36201 36202 36203 36204 36205 36206 36207 36208 36209 36210 36211 36212 36213 36214 36215 36216 36217 36218 36219 36220 36221 36222 36223 36224 36225 36226 36227 36228 36229 36230 36231 36232 36233 36234 36235 36236 36237 36238 36239 36240 36241 36242 36243 36244 36245 36246 36247 36248 36249 36250 36251 36252 36253 36254 36255 36256 36257 36258 36259 36260 36261 36262 36263 36264 36265 36266 36267 36268 36269 36270 36271 36272 36273 36274 36275 36276 36277 36278 36279 36280 36281 36282 36283 36284 36285 36286 36287 36288 36289 36290 36291 36292 36293 36294 36295 36296 36297 36298 36299 36300 36301 36302 36303 36304 36305 36306 36307 36308 36309 36310 36311 36312 36313 36314 36315 36316 36317 36318 36319 36320 36321 36322 36323 36324 36325 36326 36327 36328 36329 36330 36331 36332 36333 36334 36335 36336 36337 36338 36339 36340 36341 36342 36343 36344 36345 36346 36347 36348 36349 36350 36351 36352 36353 36354 36355 36356 36357 36358 36359 36360 36361 36362 36363 36364 36365 36366 36367 36368 36369 36370 36371 36372 36373 36374 36375 36376 36377 36378 36379 36380 36381 36382 36383 36384 36385 36386 36387 36388 36389 36390 36391 36392 36393 36394 36395 36396 36397 36398 36399 36400 36401 36402 36403 36404 36405 36406 36407 36408 36409 36410 36411 36412 36413 36414 36415 36416 36417 36418 36419 36420 36421 36422 36423 36424 36425 36426 36427 36428 36429 36430 36431 36432 36433 36434 36435 36436 36437 36438 36439 36440 36441 36442 36443 36444 36445 36446 36447 36448 36449 36450 36451 36452 36453 36454 36455 36456 36457 36458 36459 36460 36461 36462 36463 36464 36465 36466 36467 36468 36469 36470 36471 36472 36473 36474 36475 36476 36477 36478 36479 36480 36481 36482 36483 36484 36485 36486 36487 36488 36489 36490 36491 36492 36493 36494 36495 36496 36497 36498 36499 36500 36501 36502 36503 36504 36505 36506 36507 36508 36509 36510 36511 36512 36513 36514 36515 36516 36517 36518 36519 36520 36521 36522 36523 36524 36525 36526 36527 36528 36529 36530 36531 36532 36533 36534 36535 36536 36537 36538 36539 36540 36541 36542 36543 36544 36545 36546 36547 36548 36549 36550 36551 36552 36553 36554 36555 36556 36557 36558 36559 36560 36561 36562 36563 36564 36565 36566 36567 36568 36569 36570 36571 36572 36573 36574 36575 36576 36577 36578 36579 36580 36581 36582 36583 36584 36585 36586 36587 36588 36589 36590 36591 36592 36593 36594 36595 36596 36597 36598 36599 36600 36601 36602 36603 36604 36605 36606 36607 36608 36609 36610 36611 36612 36613 36614 36615 36616 36617 36618 36619 36620 36621 36622 36623 36624 36625 36626 36627 36628 36629 36630 36631 36632 36633 36634 36635 36636 36637 36638 36639 36640 36641 36642 36643 36644 36645 36646 36647 36648 36649 36650 36651 36652 36653 36654 36655 36656 36657 36658 36659 36660 36661 36662 36663 36664 36665 36666 36667 36668 36669 36670 36671 36672 36673 36674 36675 36676 36677 36678 36679 36680 36681 36682 36683 36684 36685 36686 36687 36688 36689 36690 36691 36692 36693 36694 36695 36696 36697 36698 36699 36700 36701 36702 36703 36704 36705 36706 36707 36708 36709 36710 36711 36712 36713 36714 36715 36716 36717 36718 36719 36720 36721 36722 36723 36724 36725 36726 36727 36728 36729 36730 36731 36732 36733 36734 36735 36736 36737 36738 36739 36740 36741 36742 36743 36744 36745 36746 36747 36748 36749 36750 36751 36752 36753 36754 36755 36756 36757 36758 36759 36760 36761 36762 36763 36764 36765 36766 36767 36768 36769 36770 36771 36772 36773 36774 36775 36776 36777 36778 36779 36780 36781 36782 36783 36784 36785 36786 36787 36788 36789 36790 36791 36792 36793 36794 36795 36796 36797 36798 36799 36800 36801 36802 36803 36804 36805 36806 36807 36808 36809 36810 36811 36812 36813 36814 36815 36816 36817 36818 36819 36820 36821 36822 36823 36824 36825 36826 36827 36828 36829 36830 36831 36832 36833 36834 36835 36836 36837 36838 36839 36840 36841 36842 36843 36844 36845 36846 36847 36848 36849 36850 36851 36852 36853 36854 36855 36856 36857 36858 36859 36860 36861 36862 36863 36864 36865 36866 36867 36868 36869 36870 36871 36872 36873 36874 36875 36876 36877 36878 36879 36880 36881 36882 36883 36884 36885 36886 36887 36888 36889 36890 36891 36892 36893 36894 36895 36896 36897 36898 36899 36900 36901 36902 36903 36904 36905 36906 36907 36908 36909 36910 36911 36912 36913 36914 36915 36916 36917 36918 36919 36920 36921 36922 36923 36924 36925 36926 36927 36928 36929 36930 36931 36932 36933 36934 36935 36936 36937 36938 36939 36940 36941 36942 36943 36944 36945 36946 36947 36948 36949 36950 36951 36952 36953 36954 36955 36956 36957 36958 36959 36960 36961 36962 36963 36964 36965 36966 36967 36968 36969 36970 36971 36972 36973 36974 36975 36976 36977 36978 36979 36980 36981 36982 36983 36984 36985 36986 36987 36988 36989 36990 36991 36992 36993 36994 36995 36996 36997 36998 36999 37000 37001 37002 37003 37004 37005 37006 37007 37008 37009 37010 37011 37012 37013 37014 37015 37016 37017 37018 37019 37020 37021 37022 37023 37024 37025 37026 37027 37028 37029 37030 37031 37032 37033 37034 37035 37036 37037 37038 37039 37040 37041 37042 37043 37044 37045 37046 37047 37048 37049 37050 37051 37052 37053 37054 37055 37056 37057 37058 37059 37060 37061 37062 37063 37064 37065 37066 37067 37068 37069 37070 37071 37072 37073 37074 37075 37076 37077 37078 37079 37080 37081 37082 37083 37084 37085 37086 37087 37088 37089 37090 37091 37092 37093 37094 37095 37096 37097 37098 37099 37100 37101 37102 37103 37104 37105 37106 37107 37108 37109 37110 37111 37112 37113 37114 37115 37116 37117 37118 37119 37120 37121 37122 37123 37124 37125 37126 37127 37128 37129 37130 37131 37132 37133 37134 37135 37136 37137 37138 37139 37140 37141 37142 37143 37144 37145 37146 37147 37148 37149 37150 37151 37152 37153 37154 37155 37156 37157 37158 37159 37160 37161 37162 37163 37164 37165 37166 37167 37168 37169 37170 37171 37172 37173 37174 37175 37176 37177 37178 37179 37180 37181 37182 37183 37184 37185 37186 37187 37188 37189 37190 37191 37192 37193 37194 37195 37196 37197 37198 37199 37200 37201 37202 37203 37204 37205 37206 37207 37208 37209 37210 37211 37212 37213 37214 37215 37216 37217 37218 37219 37220 37221 37222 37223 37224 37225 37226 37227 37228 37229 37230 37231 37232 37233 37234 37235 37236 37237 37238 37239 37240 37241 37242 37243 37244 37245 37246 37247 37248 37249 37250 37251 37252 37253 37254 37255 37256 37257 37258 37259 37260 37261 37262 37263 37264 37265 37266 37267 37268 37269 37270 37271 37272 37273 37274 37275 37276 37277 37278 37279 37280 37281 37282 37283 37284 37285 37286 37287 37288 37289 37290 37291 37292 37293 37294 37295 37296 37297 37298 37299 37300 37301 37302 37303 37304 37305 37306 37307 37308 37309 37310 37311 37312 37313 37314 37315 37316 37317 37318 37319 37320 37321 37322 37323 37324 37325 37326 37327 37328 37329 37330 37331 37332 37333 37334 37335 37336 37337 37338 37339 37340 37341 37342 37343 37344 37345 37346 37347 37348 37349 37350 37351 37352 37353 37354 37355 37356 37357 37358 37359 37360 37361 37362 37363 37364 37365 37366 37367 37368 37369 37370 37371 37372 37373 37374 37375 37376 37377 37378 37379 37380 37381 37382 37383 37384 37385 37386 37387 37388 37389 37390 37391 37392 37393 37394 37395 37396 37397 37398 37399 37400 37401 37402 37403 37404 37405 37406 37407 37408 37409 37410 37411 37412 37413 37414 37415 37416 37417 37418 37419 37420 37421 37422 37423 37424 37425 37426 37427 37428 37429 37430 37431 37432 37433 37434 37435 37436 37437 37438 37439 37440 37441 37442 37443 37444 37445 37446 37447 37448 37449 37450 37451 37452 37453 37454 37455 37456 37457 37458 37459 37460 37461 37462 37463 37464 37465 37466 37467 37468 37469 37470 37471 37472 37473 37474 37475 37476 37477 37478 37479 37480 37481 37482 37483 37484 37485 37486 37487 37488 37489 37490 37491 37492 37493 37494 37495 37496 37497 37498 37499 37500 37501 37502 37503 37504 37505 37506 37507 37508 37509 37510 37511 37512 37513 37514 37515 37516 37517 37518 37519 37520 37521 37522 37523 37524 37525 37526 37527 37528 37529 37530 37531 37532 37533 37534 37535 37536 37537 37538 37539 37540 37541 37542 37543 37544 37545 37546 37547 37548 37549 37550 37551 37552 37553 37554 37555 37556 37557 37558 37559 37560 37561 37562 37563 37564 37565 37566 37567 37568 37569 37570 37571 37572 37573 37574 37575 37576 37577 37578 37579 37580 37581 37582 37583 37584 37585 37586 37587 37588 37589 37590 37591 37592 37593 37594 37595 37596 37597 37598 37599 37600 37601 37602 37603 37604 37605 37606 37607 37608 37609 37610 37611 37612 37613 37614 37615 37616 37617 37618 37619 37620 37621 37622 37623 37624 37625 37626 37627 37628 37629 37630 37631 37632 37633 37634 37635 37636 37637 37638 37639 37640 37641 37642 37643 37644 37645 37646 37647 37648 37649 37650 37651 37652 37653 37654 37655 37656 37657 37658 37659 37660 37661 37662 37663 37664 37665 37666 37667 37668 37669 37670 37671 37672 37673 37674 37675 37676 37677 37678 37679 37680 37681 37682 37683 37684 37685 37686 37687 37688 37689 37690 37691 37692 37693 37694 37695 37696 37697 37698 37699 37700 37701 37702 37703 37704 37705 37706 37707 37708 37709 37710 37711 37712 37713 37714 37715 37716 37717 37718 37719 37720 37721 37722 37723 37724 37725 37726 37727 37728 37729 37730 37731 37732 37733 37734 37735 37736 37737 37738 37739 37740 37741 37742 37743 37744 37745 37746 37747 37748 37749 37750 37751 37752 37753 37754 37755 37756 37757 37758 37759 37760 37761 37762 37763 37764 37765 37766 37767 37768 37769 37770 37771 37772 37773 37774 37775 37776 37777 37778 37779 37780 37781 37782 37783 37784 37785 37786 37787 37788 37789 37790 37791 37792 37793 37794 37795 37796 37797 37798 37799 37800 37801 37802 37803 37804 37805 37806 37807 37808 37809 37810 37811 37812 37813 37814 37815 37816 37817 37818 37819 37820 37821 37822 37823 37824 37825 37826 37827 37828 37829 37830 37831 37832 37833 37834 37835 37836 37837 37838 37839 37840 37841 37842 37843 37844 37845 37846 37847 37848 37849 37850 37851 37852 37853 37854 37855 37856 37857 37858 37859 37860 37861 37862 37863 37864 37865 37866 37867 37868 37869 37870 37871 37872 37873 37874 37875 37876 37877 37878 37879 37880 37881 37882 37883 37884 37885 37886 37887 37888 37889 37890 37891 37892 37893 37894 37895 37896 37897 37898 37899 37900 37901 37902 37903 37904 37905 37906 37907 37908 37909 37910 37911 37912 37913 37914 37915 37916 37917 37918 37919 37920 37921 37922 37923 37924 37925 37926 37927 37928 37929 37930 37931 37932 37933 37934 37935 37936 37937 37938 37939 37940 37941 37942 37943 37944 37945 37946 37947 37948 37949 37950 37951 37952 37953 37954 37955 37956 37957 37958 37959 37960 37961 37962 37963 37964 37965 37966 37967 37968 37969 37970 37971 37972 37973 37974 37975 37976 37977 37978 37979 37980 37981 37982 37983 37984 37985 37986 37987 37988 37989 37990 37991 37992 37993 37994 37995 37996 37997 37998 37999 38000 38001 38002 38003 38004 38005 38006 38007 38008 38009 38010 38011 38012 38013 38014 38015 38016 38017 38018 38019 38020 38021 38022 38023 38024 38025 38026 38027 38028 38029 38030 38031 38032 38033 38034 38035 38036 38037 38038 38039 38040 38041 38042 38043 38044 38045 38046 38047 38048 38049 38050 38051 38052 38053 38054 38055 38056 38057 38058 38059 38060 38061 38062 38063 38064 38065 38066 38067 38068 38069 38070 38071 38072 38073 38074 38075 38076 38077 38078 38079 38080 38081 38082 38083 38084 38085 38086 38087 38088 38089 38090 38091 38092 38093 38094 38095 38096 38097 38098 38099 38100 38101 38102 38103 38104 38105 38106 38107 38108 38109 38110 38111 38112 38113 38114 38115 38116 38117 38118 38119 38120 38121 38122 38123 38124 38125 38126 38127 38128 38129 38130 38131 38132 38133 38134 38135 38136 38137 38138 38139 38140 38141 38142 38143 38144 38145 38146 38147 38148 38149 38150 38151 38152 38153 38154 38155 38156 38157 38158 38159 38160 38161 38162 38163 38164 38165 38166 38167 38168 38169 38170 38171 38172 38173 38174 38175 38176 38177 38178 38179 38180 38181 38182 38183 38184 38185 38186 38187 38188 38189 38190 38191 38192 38193 38194 38195 38196 38197 38198 38199 38200 38201 38202 38203 38204 38205 38206 38207 38208 38209 38210 38211 38212 38213 38214 38215 38216 38217 38218 38219 38220 38221 38222 38223 38224 38225 38226 38227 38228 38229 38230 38231 38232 38233 38234 38235 38236 38237 38238 38239 38240 38241 38242 38243 38244 38245 38246 38247 38248 38249 38250 38251 38252 38253 38254 38255 38256 38257 38258 38259 38260 38261 38262 38263 38264 38265 38266 38267 38268 38269 38270 38271 38272 38273 38274 38275 38276 38277 38278 38279 38280 38281 38282 38283 38284 38285 38286 38287 38288 38289 38290 38291 38292 38293 38294 38295 38296 38297 38298 38299 38300 38301 38302 38303 38304 38305 38306 38307 38308 38309 38310 38311 38312 38313 38314 38315 38316 38317 38318 38319 38320 38321 38322 38323 38324 38325 38326 38327 38328 38329 38330 38331 38332 38333 38334 38335 38336 38337 38338 38339 38340 38341 38342 38343 38344 38345 38346 38347 38348 38349 38350 38351 38352 38353 38354 38355 38356 38357 38358 38359 38360 38361 38362 38363 38364 38365 38366 38367 38368 38369 38370 38371 38372 38373 38374 38375 38376 38377 38378 38379 38380 38381 38382 38383 38384 38385 38386 38387 38388 38389 38390 38391 38392 38393 38394 38395 38396 38397 38398 38399 38400 38401 38402 38403 38404 38405 38406 38407 38408 38409 38410 38411 38412 38413 38414 38415 38416 38417 38418 38419 38420 38421 38422 38423 38424 38425 38426 38427 38428 38429 38430 38431 38432 38433 38434 38435 38436 38437 38438 38439 38440 38441 38442 38443 38444 38445 38446 38447 38448 38449 38450 38451 38452 38453 38454 38455 38456 38457 38458 38459 38460 38461 38462 38463 38464 38465 38466 38467 38468 38469 38470 38471 38472 38473 38474 38475 38476 38477 38478 38479 38480 38481 38482 38483 38484 38485 38486 38487 38488 38489 38490 38491 38492 38493 38494 38495 38496 38497 38498 38499 38500 38501 38502 38503 38504 38505 38506 38507 38508 38509 38510 38511 38512 38513 38514 38515 38516 38517 38518 38519 38520 38521 38522 38523 38524 38525 38526 38527 38528 38529 38530 38531 38532 38533 38534 38535 38536 38537 38538 38539 38540 38541 38542 38543 38544 38545 38546 38547 38548 38549 38550 38551 38552 38553 38554 38555 38556 38557 38558 38559 38560 38561 38562 38563 38564 38565 38566 38567 38568 38569 38570 38571 38572 38573 38574 38575 38576 38577 38578 38579 38580 38581 38582 38583 38584 38585 38586 38587 38588 38589 38590 38591 38592 38593 38594 38595 38596 38597 38598 38599 38600 38601 38602 38603 38604 38605 38606 38607 38608 38609 38610 38611 38612 38613 38614 38615 38616 38617 38618 38619 38620 38621 38622 38623 38624 38625 38626 38627 38628 38629 38630 38631 38632 38633 38634 38635 38636 38637 38638 38639 38640 38641 38642 38643 38644 38645 38646 38647 38648 38649 38650 38651 38652 38653 38654 38655 38656 38657 38658 38659 38660 38661 38662 38663 38664 38665 38666 38667 38668 38669 38670 38671 38672 38673 38674 38675 38676 38677 38678 38679 38680 38681 38682 38683 38684 38685 38686 38687 38688 38689 38690 38691 38692 38693 38694 38695 38696 38697 38698 38699 38700 38701 38702 38703 38704 38705 38706 38707 38708 38709 38710 38711 38712 38713 38714 38715 38716 38717 38718 38719 38720 38721 38722 38723 38724 38725 38726 38727 38728 38729 38730 38731 38732 38733 38734 38735 38736 38737 38738 38739 38740 38741 38742 38743 38744 38745 38746 38747 38748 38749 38750 38751 38752 38753 38754 38755 38756 38757 38758 38759 38760 38761 38762 38763 38764 38765 38766 38767 38768 38769 38770 38771 38772 38773 38774 38775 38776 38777 38778 38779 38780 38781 38782 38783 38784 38785 38786 38787 38788 38789 38790 38791 38792 38793 38794 38795 38796 38797 38798 38799 38800 38801 38802 38803 38804 38805 38806 38807 38808 38809 38810 38811 38812 38813 38814 38815 38816 38817 38818 38819 38820 38821 38822 38823 38824 38825 38826 38827 38828 38829 38830 38831 38832 38833 38834 38835 38836 38837 38838 38839 38840 38841 38842 38843 38844 38845 38846 38847 38848 38849 38850 38851 38852 38853 38854 38855 38856 38857 38858 38859 38860 38861 38862 38863 38864 38865 38866 38867 38868 38869 38870 38871 38872 38873 38874 38875 38876 38877 38878 38879 38880 38881 38882 38883 38884 38885 38886 38887 38888 38889 38890 38891 38892 38893 38894 38895 38896 38897 38898 38899 38900 38901 38902 38903 38904 38905 38906 38907 38908 38909 38910 38911 38912 38913 38914 38915 38916 38917 38918 38919 38920 38921 38922 38923 38924 38925 38926 38927 38928 38929 38930 38931 38932 38933 38934 38935 38936 38937 38938 38939 38940 38941 38942 38943 38944 38945 38946 38947 38948 38949 38950 38951 38952 38953 38954 38955 38956 38957 38958 38959 38960 38961 38962 38963 38964 38965 38966 38967 38968 38969 38970 38971 38972 38973 38974 38975 38976 38977 38978 38979 38980 38981 38982 38983 38984 38985 38986 38987 38988 38989 38990 38991 38992 38993 38994 38995 38996 38997 38998 38999 39000 39001 39002 39003 39004 39005 39006 39007 39008 39009 39010 39011 39012 39013 39014 39015 39016 39017 39018 39019 39020 39021 39022 39023 39024 39025 39026 39027 39028 39029 39030 39031 39032 39033 39034 39035 39036 39037 39038 39039 39040 39041 39042 39043 39044 39045 39046 39047 39048 39049 39050 39051 39052 39053 39054 39055 39056 39057 39058 39059 39060 39061 39062 39063 39064 39065 39066 39067 39068 39069 39070 39071 39072 39073 39074 39075 39076 39077 39078 39079 39080 39081 39082 39083 39084 39085 39086 39087 39088 39089 39090 39091 39092 39093 39094 39095 39096 39097 39098 39099 39100 39101 39102 39103 39104 39105 39106 39107 39108 39109 39110 39111 39112 39113 39114 39115 39116 39117 39118 39119 39120 39121 39122 39123 39124 39125 39126 39127 39128 39129 39130 39131 39132 39133 39134 39135 39136 39137 39138 39139 39140 39141 39142 39143 39144 39145 39146 39147 39148 39149 39150 39151 39152 39153 39154 39155 39156 39157 39158 39159 39160 39161 39162 39163 39164 39165 39166 39167 39168 39169 39170 39171 39172 39173 39174 39175 39176 39177 39178 39179 39180 39181 39182 39183 39184 39185 39186 39187 39188 39189 39190 39191 39192 39193 39194 39195 39196 39197 39198 39199 39200 39201 39202 39203 39204 39205 39206 39207 39208 39209 39210 39211 39212 39213 39214 39215 39216 39217 39218 39219 39220 39221 39222 39223 39224 39225 39226 39227 39228 39229 39230 39231 39232 39233 39234 39235 39236 39237 39238 39239 39240 39241 39242 39243 39244 39245 39246 39247 39248 39249 39250 39251 39252 39253 39254 39255 39256 39257 39258 39259 39260 39261 39262 39263 39264 39265 39266 39267 39268 39269 39270 39271 39272 39273 39274 39275 39276 39277 39278 39279 39280 39281 39282 39283 39284 39285 39286 39287 39288 39289 39290 39291 39292 39293 39294 39295 39296 39297 39298 39299 39300 39301 39302 39303 39304 39305 39306 39307 39308 39309 39310 39311 39312 39313 39314 39315 39316 39317 39318 39319 39320 39321 39322 39323 39324 39325 39326 39327 39328 39329 39330 39331 39332 39333 39334 39335 39336 39337 39338 39339 39340 39341 39342 39343 39344 39345 39346 39347 39348 39349 39350 39351 39352 39353 39354 39355 39356 39357 39358 39359 39360 39361 39362 39363 39364 39365 39366 39367 39368 39369 39370 39371 39372 39373 39374 39375 39376 39377 39378 39379 39380 39381 39382 39383 39384 39385 39386 39387 39388 39389 39390 39391 39392 39393 39394 39395 39396 39397 39398 39399 39400 39401 39402 39403 39404 39405 39406 39407 39408 39409 39410 39411 39412 39413 39414 39415 39416 39417 39418 39419 39420 39421 39422 39423 39424 39425 39426 39427 39428 39429 39430 39431 39432 39433 39434 39435 39436 39437 39438 39439 39440 39441 39442 39443 39444 39445 39446 39447 39448 39449 39450 39451 39452 39453 39454 39455 39456 39457 39458 39459 39460 39461 39462 39463 39464 39465 39466 39467 39468 39469 39470 39471 39472 39473 39474 39475 39476 39477 39478 39479 39480 39481 39482 39483 39484 39485 39486 39487 39488 39489 39490 39491 39492 39493 39494 39495 39496 39497 39498 39499 39500 39501 39502 39503 39504 39505 39506 39507 39508 39509 39510 39511 39512 39513 39514 39515 39516 39517 39518 39519 39520 39521 39522 39523 39524 39525 39526 39527 39528 39529 39530 39531 39532 39533 39534 39535 39536 39537 39538 39539 39540 39541 39542 39543 39544 39545 39546 39547 39548 39549 39550 39551 39552 39553 39554 39555 39556 39557 39558 39559 39560 39561 39562 39563 39564 39565 39566 39567 39568 39569 39570 39571 39572 39573 39574 39575 39576 39577 39578 39579 39580 39581 39582 39583 39584 39585 39586 39587 39588 39589 39590 39591 39592 39593 39594 39595 39596 39597 39598 39599 39600 39601 39602 39603 39604 39605 39606 39607 39608 39609 39610 39611 39612 39613 39614 39615 39616 39617 39618 39619 39620 39621 39622 39623 39624 39625 39626 39627 39628 39629 39630 39631 39632 39633 39634 39635 39636 39637 39638 39639 39640 39641 39642 39643 39644 39645 39646 39647 39648 39649 39650 39651 39652 39653 39654 39655 39656 39657 39658 39659 39660 39661 39662 39663 39664 39665 39666 39667 39668 39669 39670 39671 39672 39673 39674 39675 39676 39677 39678 39679 39680 39681 39682 39683 39684 39685 39686 39687 39688 39689 39690 39691 39692 39693 39694 39695 39696 39697 39698 39699 39700 39701 39702 39703 39704 39705 39706 39707 39708 39709 39710 39711 39712 39713 39714 39715 39716 39717 39718 39719 39720 39721 39722 39723 39724 39725 39726 39727 39728 39729 39730 39731 39732 39733 39734 39735 39736 39737 39738 39739 39740 39741 39742 39743 39744 39745 39746 39747 39748 39749 39750 39751 39752 39753 39754 39755 39756 39757 39758 39759 39760 39761 39762 39763 39764 39765 39766 39767 39768 39769 39770 39771 39772 39773 39774 39775 39776 39777 39778 39779 39780 39781 39782 39783 39784 39785 39786 39787 39788 39789 39790 39791 39792 39793 39794 39795 39796 39797 39798 39799 39800 39801 39802 39803 39804 39805 39806 39807 39808 39809 39810 39811 39812 39813 39814 39815 39816 39817 39818 39819 39820 39821 39822 39823 39824 39825 39826 39827 39828 39829 39830 39831 39832 39833 39834 39835 39836 39837 39838 39839 39840 39841 39842 39843 39844 39845 39846 39847 39848 39849 39850 39851 39852 39853 39854 39855 39856 39857 39858 39859 39860 39861 39862 39863 39864 39865 39866 39867 39868 39869 39870 39871 39872 39873 39874 39875 39876 39877 39878 39879 39880 39881 39882 39883 39884 39885 39886 39887 39888 39889 39890 39891 39892 39893 39894 39895 39896 39897 39898 39899 39900 39901 39902 39903 39904 39905 39906 39907 39908 39909 39910 39911 39912 39913 39914 39915 39916 39917 39918 39919 39920 39921 39922 39923 39924 39925 39926 39927 39928 39929 39930 39931 39932 39933 39934 39935 39936 39937 39938 39939 39940 39941 39942 39943 39944 39945 39946 39947 39948 39949 39950 39951 39952 39953 39954 39955 39956 39957 39958 39959 39960 39961 39962 39963 39964 39965 39966 39967 39968 39969 39970 39971 39972 39973 39974 39975 39976 39977 39978 39979 39980 39981 39982 39983 39984 39985 39986 39987 39988 39989 39990 39991 39992 39993 39994 39995 39996 39997 39998 39999 40000 40001 40002 40003 40004 40005 40006 40007 40008 40009 40010 40011 40012 40013 40014 40015 40016 40017 40018 40019 40020 40021 40022 40023 40024 40025 40026 40027 40028 40029 40030 40031 40032 40033 40034 40035 40036 40037 40038 40039 40040 40041 40042 40043 40044 40045 40046 40047 40048 40049 40050 40051 40052 40053 40054 40055 40056 40057 40058 40059 40060 40061 40062 40063 40064 40065 40066 40067 40068 40069 40070 40071 40072 40073 40074 40075 40076 40077 40078 40079 40080 40081 40082 40083 40084 40085 40086 40087 40088 40089 40090 40091 40092 40093 40094 40095 40096 40097 40098 40099 40100 40101 40102 40103 40104 40105 40106 40107 40108 40109 40110 40111 40112 40113 40114 40115 40116 40117 40118 40119 40120 40121 40122 40123 40124 40125 40126 40127 40128 40129 40130 40131 40132 40133 40134 40135 40136 40137 40138 40139 40140 40141 40142 40143 40144 40145 40146 40147 40148 40149 40150 40151 40152 40153 40154 40155 40156 40157 40158 40159 40160 40161 40162 40163 40164 40165 40166 40167 40168 40169 40170 40171 40172 40173 40174 40175 40176 40177 40178 40179 40180 40181 40182 40183 40184 40185 40186 40187 40188 40189 40190 40191 40192 40193 40194 40195 40196 40197 40198 40199 40200 40201 40202 40203 40204 40205 40206 40207 40208 40209 40210 40211 40212 40213 40214 40215 40216 40217 40218 40219 40220 40221 40222 40223 40224 40225 40226 40227 40228 40229 40230 40231 40232 40233 40234 40235 40236 40237 40238 40239 40240 40241 40242 40243 40244 40245 40246 40247 40248 40249 40250 40251 40252 40253 40254 40255 40256 40257 40258 40259 40260 40261 40262 40263 40264 40265 40266 40267 40268 40269 40270 40271 40272 40273 40274 40275 40276 40277 40278 40279 40280 40281 40282 40283 40284 40285 40286 40287 40288 40289 40290 40291 40292 40293 40294 40295 40296 40297 40298 40299 40300 40301 40302 40303 40304 40305 40306 40307 40308 40309 40310 40311 40312 40313 40314 40315 40316 40317 40318 40319 40320 40321 40322 40323 40324 40325 40326 40327 40328 40329 40330 40331 40332 40333 40334 40335 40336 40337 40338 40339 40340 40341 40342 40343 40344 40345 40346 40347 40348 40349 40350 40351 40352 40353 40354 40355 40356 40357 40358 40359 40360 40361 40362 40363 40364 40365 40366 40367 40368 40369 40370 40371 40372 40373 40374 40375 40376 40377 40378 40379 40380 40381 40382 40383 40384 40385 40386 40387 40388 40389 40390 40391 40392 40393 40394 40395 40396 40397 40398 40399 40400 40401 40402 40403 40404 40405 40406 40407 40408 40409 40410 40411 40412 40413 40414 40415 40416 40417 40418 40419 40420 40421 40422 40423 40424 40425 40426 40427 40428 40429 40430 40431 40432 40433 40434 40435 40436 40437 40438 40439 40440 40441 40442 40443 40444 40445 40446 40447 40448 40449 40450 40451 40452 40453 40454 40455 40456 40457 40458 40459 40460 40461 40462 40463 40464 40465 40466 40467 40468 40469 40470 40471 40472 40473 40474 40475 40476 40477 40478 40479 40480 40481 40482 40483 40484 40485 40486 40487 40488 40489 40490 40491 40492 40493 40494 40495 40496 40497 40498 40499 40500 40501 40502 40503 40504 40505 40506 40507 40508 40509 40510 40511 40512 40513 40514 40515 40516 40517 40518 40519 40520 40521 40522 40523 40524 40525 40526 40527 40528 40529 40530 40531 40532 40533 40534 40535 40536 40537 40538 40539 40540 40541 40542 40543 40544 40545 40546 40547 40548 40549 40550 40551 40552 40553 40554 40555 40556 40557 40558 40559 40560 40561 40562 40563 40564 40565 40566 40567 40568 40569 40570 40571 40572 40573 40574 40575 40576 40577 40578 40579 40580 40581 40582 40583 40584 40585 40586 40587 40588 40589 40590 40591 40592 40593 40594 40595 40596 40597 40598 40599 40600 40601 40602 40603 40604 40605 40606 40607 40608 40609 40610 40611 40612 40613 40614 40615 40616 40617 40618 40619 40620 40621 40622 40623 40624 40625 40626 40627 40628 40629 40630 40631 40632 40633 40634 40635 40636 40637 40638 40639 40640 40641 40642 40643 40644 40645 40646 40647 40648 40649 40650 40651 40652 40653 40654 40655 40656 40657 40658 40659 40660 40661 40662 40663 40664 40665 40666 40667 40668 40669 40670 40671 40672 40673 40674 40675 40676 40677 40678 40679 40680 40681 40682 40683 40684 40685 40686 40687 40688 40689 40690 40691 40692 40693 40694 40695 40696 40697 40698 40699 40700 40701 40702 40703 40704 40705 40706 40707 40708 40709 40710 40711 40712 40713 40714 40715 40716 40717 40718 40719 40720 40721 40722 40723 40724 40725 40726 40727 40728 40729 40730 40731 40732 40733 40734 40735 40736 40737 40738 40739 40740 40741 40742 40743 40744 40745 40746 40747 40748 40749 40750 40751 40752 40753 40754 40755 40756 40757 40758 40759 40760 40761 40762 40763 40764 40765 40766 40767 40768 40769 40770 40771 40772 40773 40774 40775 40776 40777 40778 40779 40780 40781 40782 40783 40784 40785 40786 40787 40788 40789 40790 40791 40792 40793 40794 40795 40796 40797 40798 40799 40800 40801 40802 40803 40804 40805 40806 40807 40808 40809 40810 40811 40812 40813 40814 40815 40816 40817 40818 40819 40820 40821 40822 40823 40824 40825 40826 40827 40828 40829 40830 40831 40832 40833 40834 40835 40836 40837 40838 40839 40840 40841 40842 40843 40844 40845 40846 40847 40848 40849 40850 40851 40852 40853 40854 40855 40856 40857 40858 40859 40860 40861 40862 40863 40864 40865 40866 40867 40868 40869 40870 40871 40872 40873 40874 40875 40876 40877 40878 40879 40880 40881 40882 40883 40884 40885 40886 40887 40888 40889 40890 40891 40892 40893 40894 40895 40896 40897 40898 40899 40900 40901 40902 40903 40904 40905 40906 40907 40908 40909 40910 40911 40912 40913 40914 40915 40916 40917 40918 40919 40920 40921 40922 40923 40924 40925 40926 40927 40928 40929 40930 40931 40932 40933 40934 40935 40936 40937 40938 40939 40940 40941 40942 40943 40944 40945 40946 40947 40948 40949 40950 40951 40952 40953 40954 40955 40956 40957 40958 40959 40960 40961 40962 40963 40964 40965 40966 40967 40968 40969 40970 40971 40972 40973 40974 40975 40976 40977 40978 40979 40980 40981 40982 40983 40984 40985 40986 40987 40988 40989 40990 40991 40992 40993 40994 40995 40996 40997 40998 40999 41000 41001 41002 41003 41004 41005 41006 41007 41008 41009 41010 41011 41012 41013 41014 41015 41016 41017 41018 41019 41020 41021 41022 41023 41024 41025 41026 41027 41028 41029 41030 41031 41032 41033 41034 41035 41036 41037 41038 41039 41040 41041 41042 41043 41044 41045 41046 41047 41048 41049 41050 41051 41052 41053 41054 41055 41056 41057 41058 41059 41060 41061 41062 41063 41064 41065 41066 41067 41068 41069 41070 41071 41072 41073 41074 41075 41076 41077 41078 41079 41080 41081 41082 41083 41084 41085 41086 41087 41088 41089 41090 41091 41092 41093 41094 41095 41096 41097 41098 41099 41100 41101 41102 41103 41104 41105 41106 41107 41108 41109 41110 41111 41112 41113 41114 41115 41116 41117 41118 41119 41120 41121 41122 41123 41124 41125 41126 41127 41128 41129 41130 41131 41132 41133 41134 41135 41136 41137 41138 41139 41140 41141 41142 41143 41144 41145 41146 41147 41148 41149 41150 41151 41152 41153 41154 41155 41156 41157 41158 41159 41160 41161 41162 41163 41164 41165 41166 41167 41168 41169 41170 41171 41172 41173 41174 41175 41176 41177 41178 41179 41180 41181 41182 41183 41184 41185 41186 41187 41188 41189 41190 41191 41192 41193 41194 41195 41196 41197 41198 41199 41200 41201 41202 41203 41204 41205 41206 41207 41208 41209 41210 41211 41212 41213 41214 41215 41216 41217 41218 41219 41220 41221 41222 41223 41224 41225 41226 41227 41228 41229 41230 41231 41232 41233 41234 41235 41236 41237 41238 41239 41240 41241 41242 41243 41244 41245 41246 41247 41248 41249 41250 41251 41252 41253 41254 41255 41256 41257 41258 41259 41260 41261 41262 41263 41264 41265 41266 41267 41268 41269 41270 41271 41272 41273 41274 41275 41276 41277 41278 41279 41280 41281 41282 41283 41284 41285 41286 41287 41288 41289 41290 41291 41292 41293 41294 41295 41296 41297 41298 41299 41300 41301 41302 41303 41304 41305 41306 41307 41308 41309 41310 41311 41312 41313 41314 41315 41316 41317 41318 41319 41320 41321 41322 41323 41324 41325 41326 41327 41328 41329 41330 41331 41332 41333 41334 41335 41336 41337 41338 41339 41340 41341 41342 41343 41344 41345 41346 41347 41348 41349 41350 41351 41352 41353 41354 41355 41356 41357 41358 41359 41360 41361 41362 41363 41364 41365 41366 41367 41368 41369 41370 41371 41372 41373 41374 41375 41376 41377 41378 41379 41380 41381 41382 41383 41384 41385 41386 41387 41388 41389 41390 41391 41392 41393 41394 41395 41396 41397 41398 41399 41400 41401 41402 41403 41404 41405 41406 41407 41408 41409 41410 41411 41412 41413 41414 41415 41416 41417 41418 41419 41420 41421 41422 41423 41424 41425 41426 41427 41428 41429 41430 41431 41432 41433 41434 41435 41436 41437 41438 41439 41440 41441 41442 41443 41444 41445 41446 41447 41448 41449 41450 41451 41452 41453 41454 41455 41456 41457 41458 41459 41460 41461 41462 41463 41464 41465 41466 41467 41468 41469 41470 41471 41472 41473 41474 41475 41476 41477 41478 41479 41480 41481 41482 41483 41484 41485 41486 41487 41488 41489 41490 41491 41492 41493 41494 41495 41496 41497 41498 41499 41500 41501 41502 41503 41504 41505 41506 41507 41508 41509 41510 41511 41512 41513 41514 41515 41516 41517 41518 41519 41520 41521 41522 41523 41524 41525 41526 41527 41528 41529 41530 41531 41532 41533 41534 41535 41536 41537 41538 41539 41540 41541 41542 41543 41544 41545 41546 41547 41548 41549 41550 41551 41552 41553 41554 41555 41556 41557 41558 41559 41560 41561 41562 41563 41564 41565 41566 41567 41568 41569 41570 41571 41572 41573 41574 41575 41576 41577 41578 41579 41580 41581 41582 41583 41584 41585 41586 41587 41588 41589 41590 41591 41592 41593 41594 41595 41596 41597 41598 41599 41600 41601 41602 41603 41604 41605 41606 41607 41608 41609 41610 41611 41612 41613 41614 41615 41616 41617 41618 41619 41620 41621 41622 41623 41624 41625 41626 41627 41628 41629 41630 41631 41632 41633 41634 41635 41636 41637 41638 41639 41640 41641 41642 41643 41644 41645 41646 41647 41648 41649 41650 41651 41652 41653 41654 41655 41656 41657 41658 41659 41660 41661 41662 41663 41664 41665 41666 41667 41668 41669 41670 41671 41672 41673 41674 41675 41676 41677 41678 41679 41680 41681 41682 41683 41684 41685 41686 41687 41688 41689 41690 41691 41692 41693 41694 41695 41696 41697 41698 41699 41700 41701 41702 41703 41704 41705 41706 41707 41708 41709 41710 41711 41712 41713 41714 41715 41716 41717 41718 41719 41720 41721 41722 41723 41724 41725 41726 41727 41728 41729 41730 41731 41732 41733 41734 41735 41736 41737 41738 41739 41740 41741 41742 41743 41744 41745 41746 41747 41748 41749 41750 41751 41752 41753 41754 41755 41756 41757 41758 41759 41760 41761 41762 41763 41764 41765 41766 41767 41768 41769 41770 41771 41772 41773 41774 41775 41776 41777 41778 41779 41780 41781 41782 41783 41784 41785 41786 41787 41788 41789 41790 41791 41792 41793 41794 41795 41796 41797 41798 41799 41800 41801 41802 41803 41804 41805 41806 41807 41808 41809 41810 41811 41812 41813 41814 41815 41816 41817 41818 41819 41820 41821 41822 41823 41824 41825 41826 41827 41828 41829 41830 41831 41832 41833 41834 41835 41836 41837 41838 41839 41840 41841 41842 41843 41844 41845 41846 41847 41848 41849 41850 41851 41852 41853 41854 41855 41856 41857 41858 41859 41860 41861 41862 41863 41864 41865 41866 41867 41868 41869 41870 41871 41872 41873 41874 41875 41876 41877 41878 41879 41880 41881 41882 41883 41884 41885 41886 41887 41888 41889 41890 41891 41892 41893 41894 41895 41896 41897 41898 41899 41900 41901 41902 41903 41904 41905 41906 41907 41908 41909 41910 41911 41912 41913 41914 41915 41916 41917 41918 41919 41920 41921 41922 41923 41924 41925 41926 41927 41928 41929 41930 41931 41932 41933 41934 41935 41936 41937 41938 41939 41940 41941 41942 41943 41944 41945 41946 41947 41948 41949 41950 41951 41952 41953 41954 41955 41956 41957 41958 41959 41960 41961 41962 41963 41964 41965 41966 41967 41968 41969 41970 41971 41972 41973 41974 41975 41976 41977 41978 41979 41980 41981 41982 41983 41984 41985 41986 41987 41988 41989 41990 41991 41992 41993 41994 41995 41996 41997 41998 41999 42000 42001 42002 42003 42004 42005 42006 42007 42008 42009 42010 42011 42012 42013 42014 42015 42016 42017 42018 42019 42020 42021 42022 42023 42024 42025 42026 42027 42028 42029 42030 42031 42032 42033 42034 42035 42036 42037 42038 42039 42040 42041 42042 42043 42044 42045 42046 42047 42048 42049 42050 42051 42052 42053 42054 42055 42056 42057 42058 42059 42060 42061 42062 42063 42064 42065 42066 42067 42068 42069 42070 42071 42072 42073 42074 42075 42076 42077 42078 42079 42080 42081 42082 42083 42084 42085 42086 42087 42088 42089 42090 42091 42092 42093 42094 42095 42096 42097 42098 42099 42100 42101 42102 42103 42104 42105 42106 42107 42108 42109 42110 42111 42112 42113 42114 42115 42116 42117 42118 42119 42120 42121 42122 42123 42124 42125 42126 42127 42128 42129 42130 42131 42132 42133 42134 42135 42136 42137 42138 42139 42140 42141 42142 42143 42144 42145 42146 42147 42148 42149 42150 42151 42152 42153 42154 42155 42156 42157 42158 42159 42160 42161 42162 42163 42164 42165 42166 42167 42168 42169 42170 42171 42172 42173 42174 42175 42176 42177 42178 42179 42180 42181 42182 42183 42184 42185 42186 42187 42188 42189 42190 42191 42192 42193 42194 42195 42196 42197 42198 42199 42200 42201 42202 42203 42204 42205 42206 42207 42208 42209 42210 42211 42212 42213 42214 42215 42216 42217 42218 42219 42220 42221 42222 42223 42224 42225 42226 42227 42228 42229 42230 42231 42232 42233 42234 42235 42236 42237 42238 42239 42240 42241 42242 42243 42244 42245 42246 42247 42248 42249 42250 42251 42252 42253 42254 42255 42256 42257 42258 42259 42260 42261 42262 42263 42264 42265 42266 42267 42268 42269 42270 42271 42272 42273 42274 42275 42276 42277 42278 42279 42280 42281 42282 42283 42284 42285 42286 42287 42288 42289 42290 42291 42292 42293 42294 42295 42296 42297 42298 42299 42300 42301 42302 42303 42304 42305 42306 42307 42308 42309 42310 42311 42312 42313 42314 42315 42316 42317 42318 42319 42320 42321 42322 42323 42324 42325 42326 42327 42328 42329 42330 42331 42332 42333 42334 42335 42336 42337 42338 42339 42340 42341 42342 42343 42344 42345 42346 42347 42348 42349 42350 42351 42352 42353 42354 42355 42356 42357 42358 42359 42360 42361 42362 42363 42364 42365 42366 42367 42368 42369 42370 42371 42372 42373 42374 42375 42376 42377 42378 42379 42380 42381 42382 42383 42384 42385 42386 42387 42388 42389 42390 42391 42392 42393 42394 42395 42396 42397 42398 42399 42400 42401 42402 42403 42404 42405 42406 42407 42408 42409 42410 42411 42412 42413 42414 42415 42416 42417 42418 42419 42420 42421 42422 42423 42424 42425 42426 42427 42428 42429 42430 42431 42432 42433 42434 42435 42436 42437 42438 42439 42440 42441 42442 42443 42444 42445 42446 42447 42448 42449 42450 42451 42452 42453 42454 42455 42456 42457 42458 42459 42460 42461 42462 42463 42464 42465 42466 42467 42468 42469 42470 42471 42472 42473 42474 42475 42476 42477 42478 42479 42480 42481 42482 42483 42484 42485 42486 42487 42488 42489 42490 42491 42492 42493 42494 42495 42496 42497 42498 42499 42500 42501 42502 42503 42504 42505 42506 42507 42508 42509 42510 42511 42512 42513 42514 42515 42516 42517 42518 42519 42520 42521 42522 42523 42524 42525 42526 42527 42528 42529 42530 42531 42532 42533 42534 42535 42536 42537 42538 42539 42540 42541 42542 42543 42544 42545 42546 42547 42548 42549 42550 42551 42552 42553 42554 42555 42556 42557 42558 42559 42560 42561 42562 42563 42564 42565 42566 42567 42568 42569 42570 42571 42572 42573 42574 42575 42576 42577 42578 42579 42580 42581 42582 42583 42584 42585 42586 42587 42588 42589 42590 42591 42592 42593 42594 42595 42596 42597 42598 42599 42600 42601 42602 42603 42604 42605 42606 42607 42608 42609 42610 42611 42612 42613 42614 42615 42616 42617 42618 42619 42620 42621 42622 42623 42624 42625 42626 42627 42628 42629 42630 42631 42632 42633 42634 42635 42636 42637 42638 42639 42640 42641 42642 42643 42644 42645 42646 42647 42648 42649 42650 42651 42652 42653 42654 42655 42656 42657 42658 42659 42660 42661 42662 42663 42664 42665 42666 42667 42668 42669 42670 42671 42672 42673 42674 42675 42676 42677 42678 42679 42680 42681 42682 42683 42684 42685 42686 42687 42688 42689 42690 42691 42692 42693 42694 42695 42696 42697 42698 42699 42700 42701 42702 42703 42704 42705 42706 42707 42708 42709 42710 42711 42712 42713 42714 42715 42716 42717 42718 42719 42720 42721 42722 42723 42724 42725 42726 42727 42728 42729 42730 42731 42732 42733 42734 42735 42736 42737 42738 42739 42740 42741 42742 42743 42744 42745 42746 42747 42748 42749 42750 42751 42752 42753 42754 42755 42756 42757 42758 42759 42760 42761 42762 42763 42764 42765 42766 42767 42768 42769 42770 42771 42772 42773 42774 42775 42776 42777 42778 42779 42780 42781 42782 42783 42784 42785 42786 42787 42788 42789 42790 42791 42792 42793 42794 42795 42796 42797 42798 42799 42800 42801 42802 42803 42804 42805 42806 42807 42808 42809 42810 42811 42812 42813 42814 42815 42816 42817 42818 42819 42820 42821 42822 42823 42824 42825 42826 42827 42828 42829 42830 42831 42832 42833 42834 42835 42836 42837 42838 42839 42840 42841 42842 42843 42844 42845 42846 42847 42848 42849 42850 42851 42852 42853 42854 42855 42856 42857 42858 42859 42860 42861 42862 42863 42864 42865 42866 42867 42868 42869 42870 42871 42872 42873 42874 42875 42876 42877 42878 42879 42880 42881 42882 42883 42884 42885 42886 42887 42888 42889 42890 42891 42892 42893 42894 42895 42896 42897 42898 42899 42900 42901 42902 42903 42904 42905 42906 42907 42908 42909 42910 42911 42912 42913 42914 42915 42916 42917 42918 42919 42920 42921 42922 42923 42924 42925 42926 42927 42928 42929 42930 42931 42932 42933 42934 42935 42936 42937 42938 42939 42940 42941 42942 42943 42944 42945 42946 42947 42948 42949 42950 42951 42952 42953 42954 42955 42956 42957 42958 42959 42960 42961 42962 42963 42964 42965 42966 42967 42968 42969 42970 42971 42972 42973 42974 42975 42976 42977 42978 42979 42980 42981 42982 42983 42984 42985 42986 42987 42988 42989 42990 42991 42992 42993 42994 42995 42996 42997 42998 42999 43000 43001 43002 43003 43004 43005 43006 43007 43008 43009 43010 43011 43012 43013 43014 43015 43016 43017 43018 43019 43020 43021 43022 43023 43024 43025 43026 43027 43028 43029 43030 43031 43032 43033 43034 43035 43036 43037 43038 43039 43040 43041 43042 43043 43044 43045 43046 43047 43048 43049 43050 43051 43052 43053 43054 43055 43056 43057 43058 43059 43060 43061 43062 43063 43064 43065 43066 43067 43068 43069 43070 43071 43072 43073 43074 43075 43076 43077 43078 43079 43080 43081 43082 43083 43084 43085 43086 43087 43088 43089 43090 43091 43092 43093 43094 43095 43096 43097 43098 43099 43100 43101 43102 43103 43104 43105 43106 43107 43108 43109 43110 43111 43112 43113 43114 43115 43116 43117 43118 43119 43120 43121 43122 43123 43124 43125 43126 43127 43128 43129 43130 43131 43132 43133 43134 43135 43136 43137 43138 43139 43140 43141 43142 43143 43144 43145 43146 43147 43148 43149 43150 43151 43152 43153 43154 43155 43156 43157 43158 43159 43160 43161 43162 43163 43164 43165 43166 43167 43168 43169 43170 43171 43172 43173 43174 43175 43176 43177 43178 43179 43180 43181 43182 43183 43184 43185 43186 43187 43188 43189 43190 43191 43192 43193 43194 43195 43196 43197 43198 43199 43200 43201 43202 43203 43204 43205 43206 43207 43208 43209 43210 43211 43212 43213 43214 43215 43216 43217 43218 43219 43220 43221 43222 43223 43224 43225 43226 43227 43228 43229 43230 43231 43232 43233 43234 43235 43236 43237 43238 43239 43240 43241 43242 43243 43244 43245 43246 43247 43248 43249 43250 43251 43252 43253 43254 43255 43256 43257 43258 43259 43260 43261 43262 43263 43264 43265 43266 43267 43268 43269 43270 43271 43272 43273 43274 43275 43276 43277 43278 43279 43280 43281 43282 43283 43284 43285 43286 43287 43288 43289 43290 43291 43292 43293 43294 43295 43296 43297 43298 43299 43300 43301 43302 43303 43304 43305 43306 43307 43308 43309 43310 43311 43312 43313 43314 43315 43316 43317 43318 43319 43320 43321 43322 43323 43324 43325 43326 43327 43328 43329 43330 43331 43332 43333 43334 43335 43336 43337 43338 43339 43340 43341 43342 43343 43344 43345 43346 43347 43348 43349 43350 43351 43352 43353 43354 43355 43356 43357 43358 43359 43360 43361 43362 43363 43364 43365 43366 43367 43368 43369 43370 43371 43372 43373 43374 43375 43376 43377 43378 43379 43380 43381 43382 43383 43384 43385 43386 43387 43388 43389 43390 43391 43392 43393 43394 43395 43396 43397 43398 43399 43400 43401 43402 43403 43404 43405 43406 43407 43408 43409 43410 43411 43412 43413 43414 43415 43416 43417 43418 43419 43420 43421 43422 43423 43424 43425 43426 43427 43428 43429 43430 43431 43432 43433 43434 43435 43436 43437 43438 43439 43440 43441 43442 43443 43444 43445 43446 43447 43448 43449 43450 43451 43452 43453 43454 43455 43456 43457 43458 43459 43460 43461 43462 43463 43464 43465 43466 43467 43468 43469 43470 43471 43472 43473 43474 43475 43476 43477 43478 43479 43480 43481 43482 43483 43484 43485 43486 43487 43488 43489 43490 43491 43492 43493 43494 43495 43496 43497 43498 43499 43500 43501 43502 43503 43504 43505 43506 43507 43508 43509 43510 43511 43512 43513 43514 43515 43516 43517 43518 43519 43520 43521 43522 43523 43524 43525 43526 43527 43528 43529 43530 43531 43532 43533 43534 43535 43536 43537 43538 43539 43540 43541 43542 43543 43544 43545 43546 43547 43548 43549 43550 43551 43552 43553 43554 43555 43556 43557 43558 43559 43560 43561 43562 43563 43564 43565 43566 43567 43568 43569 43570 43571 43572 43573 43574 43575 43576 43577 43578 43579 43580 43581 43582 43583 43584 43585 43586 43587 43588 43589 43590 43591 43592 43593 43594 43595 43596 43597 43598 43599 43600 43601 43602 43603 43604 43605 43606 43607 43608 43609 43610 43611 43612 43613 43614 43615 43616 43617 43618 43619 43620 43621 43622 43623 43624 43625 43626 43627 43628 43629 43630 43631 43632 43633 43634 43635 43636 43637 43638 43639 43640 43641 43642 43643 43644 43645 43646 43647 43648 43649 43650 43651 43652 43653 43654 43655 43656 43657 43658 43659 43660 43661 43662 43663 43664 43665 43666 43667 43668 43669 43670 43671 43672 43673 43674 43675 43676 43677 43678 43679 43680 43681 43682 43683 43684 43685 43686 43687 43688 43689 43690 43691 43692 43693 43694 43695 43696 43697 43698 43699 43700 43701 43702 43703 43704 43705 43706 43707 43708 43709 43710 43711 43712 43713 43714 43715 43716 43717 43718 43719 43720 43721 43722 43723 43724 43725 43726 43727 43728 43729 43730 43731 43732 43733 43734 43735 43736 43737 43738 43739 43740 43741 43742 43743 43744 43745 43746 43747 43748 43749 43750 43751 43752 43753 43754 43755 43756 43757 43758 43759 43760 43761 43762 43763 43764 43765 43766 43767 43768 43769 43770 43771 43772 43773 43774 43775 43776 43777 43778 43779 43780 43781 43782 43783 43784 43785 43786 43787 43788 43789 43790 43791 43792 43793 43794 43795 43796 43797 43798 43799 43800 43801 43802 43803 43804 43805 43806 43807 43808 43809 43810 43811 43812 43813 43814 43815 43816 43817 43818 43819 43820 43821 43822 43823 43824 43825 43826 43827 43828 43829 43830 43831 43832 43833 43834 43835 43836 43837 43838 43839 43840 43841 43842 43843 43844 43845 43846 43847 43848 43849 43850 43851 43852 43853 43854 43855 43856 43857 43858 43859 43860 43861 43862 43863 43864 43865 43866 43867 43868 43869 43870 43871 43872 43873 43874 43875 43876 43877 43878 43879 43880 43881 43882 43883 43884 43885 43886 43887 43888 43889 43890 43891 43892 43893 43894 43895 43896 43897 43898 43899 43900 43901 43902 43903 43904 43905 43906 43907 43908 43909 43910 43911 43912 43913 43914 43915 43916 43917 43918 43919 43920 43921 43922 43923 43924 43925 43926 43927 43928 43929 43930 43931 43932 43933 43934 43935 43936 43937 43938 43939 43940 43941 43942 43943 43944 43945 43946 43947 43948 43949 43950 43951 43952 43953 43954 43955 43956 43957 43958 43959 43960 43961 43962 43963 43964 43965 43966 43967 43968 43969 43970 43971 43972 43973 43974 43975 43976 43977 43978 43979 43980 43981 43982 43983 43984 43985 43986 43987 43988 43989 43990 43991 43992 43993 43994 43995 43996 43997 43998 43999 44000 44001 44002 44003 44004 44005 44006 44007 44008 44009 44010 44011 44012 44013 44014 44015 44016 44017 44018 44019 44020 44021 44022 44023 44024 44025 44026 44027 44028 44029 44030 44031 44032 44033 44034 44035 44036 44037 44038 44039 44040 44041 44042 44043 44044 44045 44046 44047 44048 44049 44050 44051 44052 44053 44054 44055 44056 44057 44058 44059 44060 44061 44062 44063 44064 44065 44066 44067 44068 44069 44070 44071 44072 44073 44074 44075 44076 44077 44078 44079 44080 44081 44082 44083 44084 44085 44086 44087 44088 44089 44090 44091 44092 44093 44094 44095 44096 44097 44098 44099 44100 44101 44102 44103 44104 44105 44106 44107 44108 44109 44110 44111 44112 44113 44114 44115 44116 44117 44118 44119 44120 44121 44122 44123 44124 44125 44126 44127 44128 44129 44130 44131 44132 44133 44134 44135 44136 44137 44138 44139 44140 44141 44142 44143 44144 44145 44146 44147 44148 44149 44150 44151 44152 44153 44154 44155 44156 44157 44158 44159 44160 44161 44162 44163 44164 44165 44166 44167 44168 44169 44170 44171 44172 44173 44174 44175 44176 44177 44178 44179 44180 44181 44182 44183 44184 44185 44186 44187 44188 44189 44190 44191 44192 44193 44194 44195 44196 44197 44198 44199 44200 44201 44202 44203 44204 44205 44206 44207 44208 44209 44210 44211 44212 44213 44214 44215 44216 44217 44218 44219 44220 44221 44222 44223 44224 44225 44226 44227 44228 44229 44230 44231 44232 44233 44234 44235 44236 44237 44238 44239 44240 44241 44242 44243 44244 44245 44246 44247 44248 44249 44250 44251 44252 44253 44254 44255 44256 44257 44258 44259 44260 44261 44262 44263 44264 44265 44266 44267 44268 44269 44270 44271 44272 44273 44274 44275 44276 44277 44278 44279 44280 44281 44282 44283 44284 44285 44286 44287 44288 44289 44290 44291 44292 44293 44294 44295 44296 44297 44298 44299 44300 44301 44302 44303 44304 44305 44306 44307 44308 44309 44310 44311 44312 44313 44314 44315 44316 44317 44318 44319 44320 44321 44322 44323 44324 44325 44326 44327 44328 44329 44330 44331 44332 44333 44334 44335 44336 44337 44338 44339 44340 44341 44342 44343 44344 44345 44346 44347 44348 44349 44350 44351 44352 44353 44354 44355 44356 44357 44358 44359 44360 44361 44362 44363 44364 44365 44366 44367 44368 44369 44370 44371 44372 44373 44374 44375 44376 44377 44378 44379 44380 44381 44382 44383 44384 44385 44386 44387 44388 44389 44390 44391 44392 44393 44394 44395 44396 44397 44398 44399 44400 44401 44402 44403 44404 44405 44406 44407 44408 44409 44410 44411 44412 44413 44414 44415 44416 44417 44418 44419 44420 44421 44422 44423 44424 44425 44426 44427 44428 44429 44430 44431 44432 44433 44434 44435 44436 44437 44438 44439 44440 44441 44442 44443 44444 44445 44446 44447 44448 44449 44450 44451 44452 44453 44454 44455 44456 44457 44458 44459 44460 44461 44462 44463 44464 44465 44466 44467 44468 44469 44470 44471 44472 44473 44474 44475 44476 44477 44478 44479 44480 44481 44482 44483 44484 44485 44486 44487 44488 44489 44490 44491 44492 44493 44494 44495 44496 44497 44498 44499 44500 44501 44502 44503 44504 44505 44506 44507 44508 44509 44510 44511 44512 44513 44514 44515 44516 44517 44518 44519 44520 44521 44522 44523 44524 44525 44526 44527 44528 44529 44530 44531 44532 44533 44534 44535 44536 44537 44538 44539 44540 44541 44542 44543 44544 44545 44546 44547 44548 44549 44550 44551 44552 44553 44554 44555 44556 44557 44558 44559 44560 44561 44562 44563 44564 44565 44566 44567 44568 44569 44570 44571 44572 44573 44574 44575 44576 44577 44578 44579 44580 44581 44582 44583 44584 44585 44586 44587 44588 44589 44590 44591 44592 44593 44594 44595 44596 44597 44598 44599 44600 44601 44602 44603 44604 44605 44606 44607 44608 44609 44610 44611 44612 44613 44614 44615 44616 44617 44618 44619 44620 44621 44622 44623 44624 44625 44626 44627 44628 44629 44630 44631 44632 44633 44634 44635 44636 44637 44638 44639 44640 44641 44642 44643 44644 44645 44646 44647 44648 44649 44650 44651 44652 44653 44654 44655 44656 44657 44658 44659 44660 44661 44662 44663 44664 44665 44666 44667 44668 44669 44670 44671 44672 44673 44674 44675 44676 44677 44678 44679 44680 44681 44682 44683 44684 44685 44686 44687 44688 44689 44690 44691 44692 44693 44694 44695 44696 44697 44698 44699 44700 44701 44702 44703 44704 44705 44706 44707 44708 44709 44710 44711 44712 44713 44714 44715 44716 44717 44718 44719 44720 44721 44722 44723 44724 44725 44726 44727 44728 44729 44730 44731 44732 44733 44734 44735 44736 44737 44738 44739 44740 44741 44742 44743 44744 44745 44746 44747 44748 44749 44750 44751 44752 44753 44754 44755 44756 44757 44758 44759 44760 44761 44762 44763 44764 44765 44766 44767 44768 44769 44770 44771 44772 44773 44774 44775 44776 44777 44778 44779 44780 44781 44782 44783 44784 44785 44786 44787 44788 44789 44790 44791 44792 44793 44794 44795 44796 44797 44798 44799 44800 44801 44802 44803 44804 44805 44806 44807 44808 44809 44810 44811 44812 44813 44814 44815 44816 44817 44818 44819 44820 44821 44822 44823 44824 44825 44826 44827 44828 44829 44830 44831 44832 44833 44834 44835 44836 44837 44838 44839 44840 44841 44842 44843 44844 44845 44846 44847 44848 44849 44850 44851 44852 44853 44854 44855 44856 44857 44858 44859 44860 44861 44862 44863 44864 44865 44866 44867 44868 44869 44870 44871 44872 44873 44874 44875 44876 44877 44878 44879 44880 44881 44882 44883 44884 44885 44886 44887 44888 44889 44890 44891 44892 44893 44894 44895 44896 44897 44898 44899 44900 44901 44902 44903 44904 44905 44906 44907 44908 44909 44910 44911 44912 44913 44914 44915 44916 44917 44918 44919 44920 44921 44922 44923 44924 44925 44926 44927 44928 44929 44930 44931 44932 44933 44934 44935 44936 44937 44938 44939 44940 44941 44942 44943 44944 44945 44946 44947 44948 44949 44950 44951 44952 44953 44954 44955 44956 44957 44958 44959 44960 44961 44962 44963 44964 44965 44966 44967 44968 44969 44970 44971 44972 44973 44974 44975 44976 44977 44978 44979 44980 44981 44982 44983 44984 44985 44986 44987 44988 44989 44990 44991 44992 44993 44994 44995 44996 44997 44998 44999 45000 45001 45002 45003 45004 45005 45006 45007 45008 45009 45010 45011 45012 45013 45014 45015 45016 45017 45018 45019 45020 45021 45022 45023 45024 45025 45026 45027 45028 45029 45030 45031 45032 45033 45034 45035 45036 45037 45038 45039 45040 45041 45042 45043 45044 45045 45046 45047 45048 45049 45050 45051 45052 45053 45054 45055 45056 45057 45058 45059 45060 45061 45062 45063 45064 45065 45066 45067 45068 45069 45070 45071 45072 45073 45074 45075 45076 45077 45078 45079 45080 45081 45082 45083 45084 45085 45086 45087 45088 45089 45090 45091 45092 45093 45094 45095 45096 45097 45098 45099 45100 45101 45102 45103 45104 45105 45106 45107 45108 45109 45110 45111 45112 45113 45114 45115 45116 45117 45118 45119 45120 45121 45122 45123 45124 45125 45126 45127 45128 45129 45130 45131 45132 45133 45134 45135 45136 45137 45138 45139 45140 45141 45142 45143 45144 45145 45146 45147 45148 45149 45150 45151 45152 45153 45154 45155 45156 45157 45158 45159 45160 45161 45162 45163 45164 45165 45166 45167 45168 45169 45170 45171 45172 45173 45174 45175 45176 45177 45178 45179 45180 45181 45182 45183 45184 45185 45186 45187 45188 45189 45190 45191 45192 45193 45194 45195 45196 45197 45198 45199 45200 45201 45202 45203 45204 45205 45206 45207 45208 45209 45210 45211 45212 45213 45214 45215 45216 45217 45218 45219 45220 45221 45222 45223 45224 45225 45226 45227 45228 45229 45230 45231 45232 45233 45234 45235 45236 45237 45238 45239 45240 45241 45242 45243 45244 45245 45246 45247 45248 45249 45250 45251 45252 45253 45254 45255 45256 45257 45258 45259 45260 45261 45262 45263 45264 45265 45266 45267 45268 45269 45270 45271 45272 45273 45274 45275 45276 45277 45278 45279 45280 45281 45282 45283 45284 45285 45286 45287 45288 45289 45290 45291 45292 45293 45294 45295 45296 45297 45298 45299 45300 45301 45302 45303 45304 45305 45306 45307 45308 45309 45310 45311 45312 45313 45314 45315 45316 45317 45318 45319 45320 45321 45322 45323 45324 45325 45326 45327 45328 45329 45330 45331 45332 45333 45334 45335 45336 45337 45338 45339 45340 45341 45342 45343 45344 45345 45346 45347 45348 45349 45350 45351 45352 45353 45354 45355 45356 45357 45358 45359 45360 45361 45362 45363 45364 45365 45366 45367 45368 45369 45370 45371 45372 45373 45374 45375 45376 45377 45378 45379 45380 45381 45382 45383 45384 45385 45386 45387 45388 45389 45390 45391 45392 45393 45394 45395 45396 45397 45398 45399 45400 45401 45402 45403 45404 45405 45406 45407 45408 45409 45410 45411 45412 45413 45414 45415 45416 45417 45418 45419 45420 45421 45422 45423 45424 45425 45426 45427 45428 45429 45430 45431 45432 45433 45434 45435 45436 45437 45438 45439 45440 45441 45442 45443 45444 45445 45446 45447 45448 45449 45450 45451 45452 45453 45454 45455 45456 45457 45458 45459 45460 45461 45462 45463 45464 45465 45466 45467 45468 45469 45470 45471 45472 45473 45474 45475 45476 45477 45478 45479 45480 45481 45482 45483 45484 45485 45486 45487 45488 45489 45490 45491 45492 45493 45494 45495 45496 45497 45498 45499 45500 45501 45502 45503 45504 45505 45506 45507 45508 45509 45510 45511 45512 45513 45514 45515 45516 45517 45518 45519 45520 45521 45522 45523 45524 45525 45526 45527 45528 45529 45530 45531 45532 45533 45534 45535 45536 45537 45538 45539 45540 45541 45542 45543 45544 45545 45546 45547 45548 45549 45550 45551 45552 45553 45554 45555 45556 45557 45558 45559 45560 45561 45562 45563 45564 45565 45566 45567 45568 45569 45570 45571 45572 45573 45574 45575 45576 45577 45578 45579 45580 45581 45582 45583 45584 45585 45586 45587 45588 45589 45590 45591 45592 45593 45594 45595 45596 45597 45598 45599 45600 45601 45602 45603 45604 45605 45606 45607 45608 45609 45610 45611 45612 45613 45614 45615 45616 45617 45618 45619 45620 45621 45622 45623 45624 45625 45626 45627 45628 45629 45630 45631 45632 45633 45634 45635 45636 45637 45638 45639 45640 45641 45642 45643 45644 45645 45646 45647 45648 45649 45650 45651 45652 45653 45654 45655 45656 45657 45658 45659 45660 45661 45662 45663 45664 45665 45666 45667 45668 45669 45670 45671 45672 45673 45674 45675 45676 45677 45678 45679 45680 45681 45682 45683 45684 45685 45686 45687 45688 45689 45690 45691 45692 45693 45694 45695 45696 45697 45698 45699 45700 45701 45702 45703 45704 45705 45706 45707 45708 45709 45710 45711 45712 45713 45714 45715 45716 45717 45718 45719 45720 45721 45722 45723 45724 45725 45726 45727 45728 45729 45730 45731 45732 45733 45734 45735 45736 45737 45738 45739 45740 45741 45742 45743 45744 45745 45746 45747 45748 45749 45750 45751 45752 45753 45754 45755 45756 45757 45758 45759 45760 45761 45762 45763 45764 45765 45766 45767 45768 45769 45770 45771 45772 45773 45774 45775 45776 45777 45778 45779 45780 45781 45782 45783 45784 45785 45786 45787 45788 45789 45790 45791 45792 45793 45794 45795 45796 45797 45798 45799 45800 45801 45802 45803 45804 45805 45806 45807 45808 45809 45810 45811 45812 45813 45814 45815 45816 45817 45818 45819 45820 45821 45822 45823 45824 45825 45826 45827 45828 45829 45830 45831 45832 45833 45834 45835 45836 45837 45838 45839 45840 45841 45842 45843 45844 45845 45846 45847 45848 45849 45850 45851 45852 45853 45854 45855 45856 45857 45858 45859 45860 45861 45862 45863 45864 45865 45866 45867 45868 45869 45870 45871 45872 45873 45874 45875 45876 45877 45878 45879 45880 45881 45882 45883 45884 45885 45886 45887 45888 45889 45890 45891 45892 45893 45894 45895 45896 45897 45898 45899 45900 45901 45902 45903 45904 45905 45906 45907 45908 45909 45910 45911 45912 45913 45914 45915 45916 45917 45918 45919 45920 45921 45922 45923 45924 45925 45926 45927 45928 45929 45930 45931 45932 45933 45934 45935 45936 45937 45938 45939 45940 45941 45942 45943 45944 45945 45946 45947 45948 45949 45950 45951 45952 45953 45954 45955 45956 45957 45958 45959 45960 45961 45962 45963 45964 45965 45966 45967 45968 45969 45970 45971 45972 45973 45974 45975 45976 45977 45978 45979 45980 45981 45982 45983 45984 45985 45986 45987 45988 45989 45990 45991 45992 45993 45994 45995 45996 45997 45998 45999 46000 46001 46002 46003 46004 46005 46006 46007 46008 46009 46010 46011 46012 46013 46014 46015 46016 46017 46018 46019 46020 46021 46022 46023 46024 46025 46026 46027 46028 46029 46030 46031 46032 46033 46034 46035 46036 46037 46038 46039 46040 46041 46042 46043 46044 46045 46046 46047 46048 46049 46050 46051 46052 46053 46054 46055 46056 46057 46058 46059 46060 46061 46062 46063 46064 46065 46066 46067 46068 46069 46070 46071 46072 46073 46074 46075 46076 46077 46078 46079 46080 46081 46082 46083 46084 46085 46086 46087 46088 46089 46090 46091 46092 46093 46094 46095 46096 46097 46098 46099 46100 46101 46102 46103 46104 46105 46106 46107 46108 46109 46110 46111 46112 46113 46114 46115 46116 46117 46118 46119 46120 46121 46122 46123 46124 46125 46126 46127 46128 46129 46130 46131 46132 46133 46134 46135 46136 46137 46138 46139 46140 46141 46142 46143 46144 46145 46146 46147 46148 46149 46150 46151 46152 46153 46154 46155 46156 46157 46158 46159 46160 46161 46162 46163 46164 46165 46166 46167 46168 46169 46170 46171 46172 46173 46174 46175 46176 46177 46178 46179 46180 46181 46182 46183 46184 46185 46186 46187 46188 46189 46190 46191 46192 46193 46194 46195 46196 46197 46198 46199 46200 46201 46202 46203 46204 46205 46206 46207 46208 46209 46210 46211 46212 46213 46214 46215 46216 46217 46218 46219 46220 46221 46222 46223 46224 46225 46226 46227 46228 46229 46230 46231 46232 46233 46234 46235 46236 46237 46238 46239 46240 46241 46242 46243 46244 46245 46246 46247 46248 46249 46250 46251 46252 46253 46254 46255 46256 46257 46258 46259 46260 46261 46262 46263 46264 46265 46266 46267 46268 46269 46270 46271 46272 46273 46274 46275 46276 46277 46278 46279 46280 46281 46282 46283 46284 46285 46286 46287 46288 46289 46290 46291 46292 46293 46294 46295 46296 46297 46298 46299 46300 46301 46302 46303 46304 46305 46306 46307 46308 46309 46310 46311 46312 46313 46314 46315 46316 46317 46318 46319 46320 46321 46322 46323 46324 46325 46326 46327 46328 46329 46330 46331 46332 46333 46334 46335 46336 46337 46338 46339 46340 46341 46342 46343 46344 46345 46346 46347 46348 46349 46350 46351 46352 46353 46354 46355 46356 46357 46358 46359 46360 46361 46362 46363 46364 46365 46366 46367 46368 46369 46370 46371 46372 46373 46374 46375 46376 46377 46378 46379 46380 46381 46382 46383 46384 46385 46386 46387 46388 46389 46390 46391 46392 46393 46394 46395 46396 46397 46398 46399 46400 46401 46402 46403 46404 46405 46406 46407 46408 46409 46410 46411 46412 46413 46414 46415 46416 46417 46418 46419 46420 46421 46422 46423 46424 46425 46426 46427 46428 46429 46430 46431 46432 46433 46434 46435 46436 46437 46438 46439 46440 46441 46442 46443 46444 46445 46446 46447 46448 46449 46450 46451 46452 46453 46454 46455 46456 46457 46458 46459 46460 46461 46462 46463 46464 46465 46466 46467 46468 46469 46470 46471 46472 46473 46474 46475 46476 46477 46478 46479 46480 46481 46482 46483 46484 46485 46486 46487 46488 46489 46490 46491 46492 46493 46494 46495 46496 46497 46498 46499 46500 46501 46502 46503 46504 46505 46506 46507 46508 46509 46510 46511 46512 46513 46514 46515 46516 46517 46518 46519 46520 46521 46522 46523 46524 46525 46526 46527 46528 46529 46530 46531 46532 46533 46534 46535 46536 46537 46538 46539 46540 46541 46542 46543 46544 46545 46546 46547 46548 46549 46550 46551 46552 46553 46554 46555 46556 46557 46558 46559 46560 46561 46562 46563 46564 46565 46566 46567 46568 46569 46570 46571 46572 46573 46574 46575 46576 46577 46578 46579 46580 46581 46582 46583 46584 46585 46586 46587 46588 46589 46590 46591 46592 46593 46594 46595 46596 46597 46598 46599 46600 46601 46602 46603 46604 46605 46606 46607 46608 46609 46610 46611 46612 46613 46614 46615 46616 46617 46618 46619 46620 46621 46622 46623 46624 46625 46626 46627 46628 46629 46630 46631 46632 46633 46634 46635 46636 46637 46638 46639 46640 46641 46642 46643 46644 46645 46646 46647 46648 46649 46650 46651 46652 46653 46654 46655 46656 46657 46658 46659 46660 46661 46662 46663 46664 46665 46666 46667 46668 46669 46670 46671 46672 46673 46674 46675 46676 46677 46678 46679 46680 46681 46682 46683 46684 46685 46686 46687 46688 46689 46690 46691 46692 46693 46694 46695 46696 46697 46698 46699 46700 46701 46702 46703 46704 46705 46706 46707 46708 46709 46710 46711 46712 46713 46714 46715 46716 46717 46718 46719 46720 46721 46722 46723 46724 46725 46726 46727 46728 46729 46730 46731 46732 46733 46734 46735 46736 46737 46738 46739 46740 46741 46742 46743 46744 46745 46746 46747 46748 46749 46750 46751 46752 46753 46754 46755 46756 46757 46758 46759 46760 46761 46762 46763 46764 46765 46766 46767 46768 46769 46770 46771 46772 46773 46774 46775 46776 46777 46778 46779 46780 46781 46782 46783 46784 46785 46786 46787 46788 46789 46790 46791 46792 46793 46794 46795 46796 46797 46798 46799 46800 46801 46802 46803 46804 46805 46806 46807 46808 46809 46810 46811 46812 46813 46814 46815 46816 46817 46818 46819 46820 46821 46822 46823 46824 46825 46826 46827 46828 46829 46830 46831 46832 46833 46834 46835 46836 46837 46838 46839 46840 46841 46842 46843 46844 46845 46846 46847 46848 46849 46850 46851 46852 46853 46854 46855 46856 46857 46858 46859 46860 46861 46862 46863 46864 46865 46866 46867 46868 46869 46870 46871 46872 46873 46874 46875 46876 46877 46878 46879 46880 46881 46882 46883 46884 46885 46886 46887 46888 46889 46890 46891 46892 46893 46894 46895 46896 46897 46898 46899 46900 46901 46902 46903 46904 46905 46906 46907 46908 46909 46910 46911 46912 46913 46914 46915 46916 46917 46918 46919 46920 46921 46922 46923 46924 46925 46926 46927 46928 46929 46930 46931 46932 46933 46934 46935 46936 46937 46938 46939 46940 46941 46942 46943 46944 46945 46946 46947 46948 46949 46950 46951 46952 46953 46954 46955 46956 46957 46958 46959 46960 46961 46962 46963 46964 46965 46966 46967 46968 46969 46970 46971 46972 46973 46974 46975 46976 46977 46978 46979 46980 46981 46982 46983 46984 46985 46986 46987 46988 46989 46990 46991 46992 46993 46994 46995 46996 46997 46998 46999 47000 47001 47002 47003 47004 47005 47006 47007 47008 47009 47010 47011 47012 47013 47014 47015 47016 47017 47018 47019 47020 47021 47022 47023 47024 47025 47026 47027 47028 47029 47030 47031 47032 47033 47034 47035 47036 47037 47038 47039 47040 47041 47042 47043 47044 47045 47046 47047 47048 47049 47050 47051 47052 47053 47054 47055 47056 47057 47058 47059 47060 47061 47062 47063 47064 47065 47066 47067 47068 47069 47070 47071 47072 47073 47074 47075 47076 47077 47078 47079 47080 47081 47082 47083 47084 47085 47086 47087 47088 47089 47090 47091 47092 47093 47094 47095 47096 47097 47098 47099 47100 47101 47102 47103 47104 47105 47106 47107 47108 47109 47110 47111 47112 47113 47114 47115 47116 47117 47118 47119 47120 47121 47122 47123 47124 47125 47126 47127 47128 47129 47130 47131 47132 47133 47134 47135 47136 47137 47138 47139 47140 47141 47142 47143 47144 47145 47146 47147 47148 47149 47150 47151 47152 47153 47154 47155 47156 47157 47158 47159 47160 47161 47162 47163 47164 47165 47166 47167 47168 47169 47170 47171 47172 47173 47174 47175 47176 47177 47178 47179 47180 47181 47182 47183 47184 47185 47186 47187 47188 47189 47190 47191 47192 47193 47194 47195 47196 47197 47198 47199 47200 47201 47202 47203 47204 47205 47206 47207 47208 47209 47210 47211 47212 47213 47214 47215 47216 47217 47218 47219 47220 47221 47222 47223 47224 47225 47226 47227 47228 47229 47230 47231 47232 47233 47234 47235 47236 47237 47238 47239 47240 47241 47242 47243 47244 47245 47246 47247 47248 47249 47250 47251 47252 47253 47254 47255 47256 47257 47258 47259 47260 47261 47262 47263 47264 47265 47266 47267 47268 47269 47270 47271 47272 47273 47274 47275 47276 47277 47278 47279 47280 47281 47282 47283 47284 47285 47286 47287 47288 47289 47290 47291 47292 47293 47294 47295 47296 47297 47298 47299 47300 47301 47302 47303 47304 47305 47306 47307 47308 47309 47310 47311 47312 47313 47314 47315 47316 47317 47318 47319 47320 47321 47322 47323 47324 47325 47326 47327 47328 47329 47330 47331 47332 47333 47334 47335 47336 47337 47338 47339 47340 47341 47342 47343 47344 47345 47346 47347 47348 47349 47350 47351 47352 47353 47354 47355 47356 47357 47358 47359 47360 47361 47362 47363 47364 47365 47366 47367 47368 47369 47370 47371 47372 47373 47374 47375 47376 47377 47378 47379 47380 47381 47382 47383 47384 47385 47386 47387 47388 47389 47390 47391 47392 47393 47394 47395 47396 47397 47398 47399 47400 47401 47402 47403 47404 47405 47406 47407 47408 47409 47410 47411 47412 47413 47414 47415 47416 47417 47418 47419 47420 47421 47422 47423 47424 47425 47426 47427 47428 47429 47430 47431 47432 47433 47434 47435 47436 47437 47438 47439 47440 47441 47442 47443 47444 47445 47446 47447 47448 47449 47450 47451 47452 47453 47454 47455 47456 47457 47458 47459 47460 47461 47462 47463 47464 47465 47466 47467 47468 47469 47470 47471 47472 47473 47474 47475 47476 47477 47478 47479 47480 47481 47482 47483 47484 47485 47486 47487 47488 47489 47490 47491 47492 47493 47494 47495 47496 47497 47498 47499 47500 47501 47502 47503 47504 47505 47506 47507 47508 47509 47510 47511 47512 47513 47514 47515 47516 47517 47518 47519 47520 47521 47522 47523 47524 47525 47526 47527 47528 47529 47530 47531 47532 47533 47534 47535 47536 47537 47538 47539 47540 47541 47542 47543 47544 47545 47546 47547 47548 47549 47550 47551 47552 47553 47554 47555 47556 47557 47558 47559 47560 47561 47562 47563 47564 47565 47566 47567 47568 47569 47570 47571 47572 47573 47574 47575 47576 47577 47578 47579 47580 47581 47582 47583 47584 47585 47586 47587 47588 47589 47590 47591 47592 47593 47594 47595 47596 47597 47598 47599 47600 47601 47602 47603 47604 47605 47606 47607 47608 47609 47610 47611 47612 47613 47614 47615 47616 47617 47618 47619 47620 47621 47622 47623 47624 47625 47626 47627 47628 47629 47630 47631 47632 47633 47634 47635 47636 47637 47638 47639 47640 47641 47642 47643 47644 47645 47646 47647 47648 47649 47650 47651 47652 47653 47654 47655 47656 47657 47658 47659 47660 47661 47662 47663 47664 47665 47666 47667 47668 47669 47670 47671 47672 47673 47674 47675 47676 47677 47678 47679 47680 47681 47682 47683 47684 47685 47686 47687 47688 47689 47690 47691 47692 47693 47694 47695 47696 47697 47698 47699 47700 47701 47702 47703 47704 47705 47706 47707 47708 47709 47710 47711 47712 47713 47714 47715 47716 47717 47718 47719 47720 47721 47722 47723 47724 47725 47726 47727 47728 47729 47730 47731 47732 47733 47734 47735 47736 47737 47738 47739 47740 47741 47742 47743 47744 47745 47746 47747 47748 47749 47750 47751 47752 47753 47754 47755 47756 47757 47758 47759 47760 47761 47762 47763 47764 47765 47766 47767 47768 47769 47770 47771 47772 47773 47774 47775 47776 47777 47778 47779 47780 47781 47782 47783 47784 47785 47786 47787 47788 47789 47790 47791 47792 47793 47794 47795 47796 47797 47798 47799 47800 47801 47802 47803 47804 47805 47806 47807 47808 47809 47810 47811 47812 47813 47814 47815 47816 47817 47818 47819 47820 47821 47822 47823 47824 47825 47826 47827 47828 47829 47830 47831 47832 47833 47834 47835 47836 47837 47838 47839 47840 47841 47842 47843 47844 47845 47846 47847 47848 47849 47850 47851 47852 47853 47854 47855 47856 47857 47858 47859 47860 47861 47862 47863 47864 47865 47866 47867 47868 47869 47870 47871 47872 47873 47874 47875 47876 47877 47878 47879 47880 47881 47882 47883 47884 47885 47886 47887 47888 47889 47890 47891 47892 47893 47894 47895 47896 47897 47898 47899 47900 47901 47902 47903 47904 47905 47906 47907 47908 47909 47910 47911 47912 47913 47914 47915 47916 47917 47918 47919 47920 47921 47922 47923 47924 47925 47926 47927 47928 47929 47930 47931 47932 47933 47934 47935 47936 47937 47938 47939 47940 47941 47942 47943 47944 47945 47946 47947 47948 47949 47950 47951 47952 47953 47954 47955 47956 47957 47958 47959 47960 47961 47962 47963 47964 47965 47966 47967 47968 47969 47970 47971 47972 47973 47974 47975 47976 47977 47978 47979 47980 47981 47982 47983 47984 47985 47986 47987 47988 47989 47990 47991 47992 47993 47994 47995 47996 47997 47998 47999 48000 48001 48002 48003 48004 48005 48006 48007 48008 48009 48010 48011 48012 48013 48014 48015 48016 48017 48018 48019 48020 48021 48022 48023 48024 48025 48026 48027 48028 48029 48030 48031 48032 48033 48034 48035 48036 48037 48038 48039 48040 48041 48042 48043 48044 48045 48046 48047 48048 48049 48050 48051 48052 48053 48054 48055 48056 48057 48058 48059 48060 48061 48062 48063 48064 48065 48066 48067 48068 48069 48070 48071 48072 48073 48074 48075 48076 48077 48078 48079 48080 48081 48082 48083 48084 48085 48086 48087 48088 48089 48090 48091 48092 48093 48094 48095 48096 48097 48098 48099 48100 48101 48102 48103 48104 48105 48106 48107 48108 48109 48110 48111 48112 48113 48114 48115 48116 48117 48118 48119 48120 48121 48122 48123 48124 48125 48126 48127 48128 48129 48130 48131 48132 48133 48134 48135 48136 48137 48138 48139 48140 48141 48142 48143 48144 48145 48146 48147 48148 48149 48150 48151 48152 48153 48154 48155 48156 48157 48158 48159 48160 48161 48162 48163 48164 48165 48166 48167 48168 48169 48170 48171 48172 48173 48174 48175 48176 48177 48178 48179 48180 48181 48182 48183 48184 48185 48186 48187 48188 48189 48190 48191 48192 48193 48194 48195 48196 48197 48198 48199 48200 48201 48202 48203 48204 48205 48206 48207 48208 48209 48210 48211 48212 48213 48214 48215 48216 48217 48218 48219 48220 48221 48222 48223 48224 48225 48226 48227 48228 48229 48230 48231 48232 48233 48234 48235 48236 48237 48238 48239 48240 48241 48242 48243 48244 48245 48246 48247 48248 48249 48250 48251 48252 48253 48254 48255 48256 48257 48258 48259 48260 48261 48262 48263 48264 48265 48266 48267 48268 48269 48270 48271 48272 48273 48274 48275 48276 48277 48278 48279 48280 48281 48282 48283 48284 48285 48286 48287 48288 48289 48290 48291 48292 48293 48294 48295 48296 48297 48298 48299 48300 48301 48302 48303 48304 48305 48306 48307 48308 48309 48310 48311 48312 48313 48314 48315 48316 48317 48318 48319 48320 48321 48322 48323 48324 48325 48326 48327 48328 48329 48330 48331 48332 48333 48334 48335 48336 48337 48338 48339 48340 48341 48342 48343 48344 48345 48346 48347 48348 48349 48350 48351 48352 48353 48354 48355 48356 48357 48358 48359 48360 48361 48362 48363 48364 48365 48366 48367 48368 48369 48370 48371 48372 48373 48374 48375 48376 48377 48378 48379 48380 48381 48382 48383 48384 48385 48386 48387 48388 48389 48390 48391 48392 48393 48394 48395 48396 48397 48398 48399 48400 48401 48402 48403 48404 48405 48406 48407 48408 48409 48410 48411 48412 48413 48414 48415 48416 48417 48418 48419 48420 48421 48422 48423 48424 48425 48426 48427 48428 48429 48430 48431 48432 48433 48434 48435 48436 48437 48438 48439 48440 48441 48442 48443 48444 48445 48446 48447 48448 48449 48450 48451 48452 48453 48454 48455 48456 48457 48458 48459 48460 48461 48462 48463 48464 48465 48466 48467 48468 48469 48470 48471 48472 48473 48474 48475 48476 48477 48478 48479 48480 48481 48482 48483 48484 48485 48486 48487 48488 48489 48490 48491 48492 48493 48494 48495 48496 48497 48498 48499 48500 48501 48502 48503 48504 48505 48506 48507 48508 48509 48510 48511 48512 48513 48514 48515 48516 48517 48518 48519 48520 48521 48522 48523 48524 48525 48526 48527 48528 48529 48530 48531 48532 48533 48534 48535 48536 48537 48538 48539 48540 48541 48542 48543 48544 48545 48546 48547 48548 48549 48550 48551 48552 48553 48554 48555 48556 48557 48558 48559 48560 48561 48562 48563 48564 48565 48566 48567 48568 48569 48570 48571 48572 48573 48574 48575 48576 48577 48578 48579 48580 48581 48582 48583 48584 48585 48586 48587 48588 48589 48590 48591 48592 48593 48594 48595 48596 48597 48598 48599 48600 48601 48602 48603 48604 48605 48606 48607 48608 48609 48610 48611 48612 48613 48614 48615 48616 48617 48618 48619 48620 48621 48622 48623 48624 48625 48626 48627 48628 48629 48630 48631 48632 48633 48634 48635 48636 48637 48638 48639 48640 48641 48642 48643 48644 48645 48646 48647 48648 48649 48650 48651 48652 48653 48654 48655 48656 48657 48658 48659 48660 48661 48662 48663 48664 48665 48666 48667 48668 48669 48670 48671 48672 48673 48674 48675 48676 48677 48678 48679 48680 48681 48682 48683 48684 48685 48686 48687 48688 48689 48690 48691 48692 48693 48694 48695 48696 48697 48698 48699 48700 48701 48702 48703 48704 48705 48706 48707 48708 48709 48710 48711 48712 48713 48714 48715 48716 48717 48718 48719 48720 48721 48722 48723 48724 48725 48726 48727 48728 48729 48730 48731 48732 48733 48734 48735 48736 48737 48738 48739 48740 48741 48742 48743 48744 48745 48746 48747 48748 48749 48750 48751 48752 48753 48754 48755 48756 48757 48758 48759 48760 48761 48762 48763 48764 48765 48766 48767 48768 48769 48770 48771 48772 48773 48774 48775 48776 48777 48778 48779 48780 48781 48782 48783 48784 48785 48786 48787 48788 48789 48790 48791 48792 48793 48794 48795 48796 48797 48798 48799 48800 48801 48802 48803 48804 48805 48806 48807 48808 48809 48810 48811 48812 48813 48814 48815 48816 48817 48818 48819 48820 48821 48822 48823 48824 48825 48826 48827 48828 48829 48830 48831 48832 48833 48834 48835 48836 48837 48838 48839 48840 48841 48842 48843 48844 48845 48846 48847 48848 48849 48850 48851 48852 48853 48854 48855 48856 48857 48858 48859 48860 48861 48862 48863 48864 48865 48866 48867 48868 48869 48870 48871 48872 48873 48874 48875 48876 48877 48878 48879 48880 48881 48882 48883 48884 48885 48886 48887 48888 48889 48890 48891 48892 48893 48894 48895 48896 48897 48898 48899 48900 48901 48902 48903 48904 48905 48906 48907 48908 48909 48910 48911 48912 48913 48914 48915 48916 48917 48918 48919 48920 48921 48922 48923 48924 48925 48926 48927 48928 48929 48930 48931 48932 48933 48934 48935 48936 48937 48938 48939 48940 48941 48942 48943 48944 48945 48946 48947 48948 48949 48950 48951 48952 48953 48954 48955 48956 48957 48958 48959 48960 48961 48962 48963 48964 48965 48966 48967 48968 48969 48970 48971 48972 48973 48974 48975 48976 48977 48978 48979 48980 48981 48982 48983 48984 48985 48986 48987 48988 48989 48990 48991 48992 48993 48994 48995 48996 48997 48998 48999 49000 49001 49002 49003 49004 49005 49006 49007 49008 49009 49010 49011 49012 49013 49014 49015 49016 49017 49018 49019 49020 49021 49022 49023 49024 49025 49026 49027 49028 49029 49030 49031 49032 49033 49034 49035 49036 49037 49038 49039 49040 49041 49042 49043 49044 49045 49046 49047 49048 49049 49050 49051 49052 49053 49054 49055 49056 49057 49058 49059 49060 49061 49062 49063 49064 49065 49066 49067 49068 49069 49070 49071 49072 49073 49074 49075 49076 49077 49078 49079 49080 49081 49082 49083 49084 49085 49086 49087 49088 49089 49090 49091 49092 49093 49094 49095 49096 49097 49098 49099 49100 49101 49102 49103 49104 49105 49106 49107 49108 49109 49110 49111 49112 49113 49114 49115 49116 49117 49118 49119 49120 49121 49122 49123 49124 49125 49126 49127 49128 49129 49130 49131 49132 49133 49134 49135 49136 49137 49138 49139 49140 49141 49142 49143 49144 49145 49146 49147 49148 49149 49150 49151 49152 49153 49154 49155 49156 49157 49158 49159 49160 49161 49162 49163 49164 49165 49166 49167 49168 49169 49170 49171 49172 49173 49174 49175 49176 49177 49178 49179 49180 49181 49182 49183 49184 49185 49186 49187 49188 49189 49190 49191 49192 49193 49194 49195 49196 49197 49198 49199 49200 49201 49202 49203 49204 49205 49206 49207 49208 49209 49210 49211 49212 49213 49214 49215 49216 49217 49218 49219 49220 49221 49222 49223 49224 49225 49226 49227 49228 49229 49230 49231 49232 49233 49234 49235 49236 49237 49238 49239 49240 49241 49242 49243 49244 49245 49246 49247 49248 49249 49250 49251 49252 49253 49254 49255 49256 49257 49258 49259 49260 49261 49262 49263 49264 49265 49266 49267 49268 49269 49270 49271 49272 49273 49274 49275 49276 49277 49278 49279 49280 49281 49282 49283 49284 49285 49286 49287 49288 49289 49290 49291 49292 49293 49294 49295 49296 49297 49298 49299 49300 49301 49302 49303 49304 49305 49306 49307 49308 49309 49310 49311 49312 49313 49314 49315 49316 49317 49318 49319 49320 49321 49322 49323 49324 49325 49326 49327 49328 49329 49330 49331 49332 49333 49334 49335 49336 49337 49338 49339 49340 49341 49342 49343 49344 49345 49346 49347 49348 49349 49350 49351 49352 49353 49354 49355 49356 49357 49358 49359 49360 49361 49362 49363 49364 49365 49366 49367 49368 49369 49370 49371 49372 49373 49374 49375 49376 49377 49378 49379 49380 49381 49382 49383 49384 49385 49386 49387 49388 49389 49390 49391 49392 49393 49394 49395 49396 49397 49398 49399 49400 49401 49402 49403 49404 49405 49406 49407 49408 49409 49410 49411 49412 49413 49414 49415 49416 49417 49418 49419 49420 49421 49422 49423 49424 49425 49426 49427 49428 49429 49430 49431 49432 49433 49434 49435 49436 49437 49438 49439 49440 49441 49442 49443 49444 49445 49446 49447 49448 49449 49450 49451 49452 49453 49454 49455 49456 49457 49458 49459 49460 49461 49462 49463 49464 49465 49466 49467 49468 49469 49470 49471 49472 49473 49474 49475 49476 49477 49478 49479 49480 49481 49482 49483 49484 49485 49486 49487 49488 49489 49490 49491 49492 49493 49494 49495 49496 49497 49498 49499 49500 49501 49502 49503 49504 49505 49506 49507 49508 49509 49510 49511 49512 49513 49514 49515 49516 49517 49518 49519 49520 49521 49522 49523 49524 49525 49526 49527 49528 49529 49530 49531 49532 49533 49534 49535 49536 49537 49538 49539 49540 49541 49542 49543 49544 49545 49546 49547 49548 49549 49550 49551 49552 49553 49554 49555 49556 49557 49558 49559 49560 49561 49562 49563 49564 49565 49566 49567 49568 49569 49570 49571 49572 49573 49574 49575 49576 49577 49578 49579 49580 49581 49582 49583 49584 49585 49586 49587 49588 49589 49590 49591 49592 49593 49594 49595 49596 49597 49598 49599 49600 49601 49602 49603 49604 49605 49606 49607 49608 49609 49610 49611 49612 49613 49614 49615 49616 49617 49618 49619 49620 49621 49622 49623 49624 49625 49626 49627 49628 49629 49630 49631 49632 49633 49634 49635 49636 49637 49638 49639 49640 49641 49642 49643 49644 49645 49646 49647 49648 49649 49650 49651 49652 49653 49654 49655 49656 49657 49658 49659 49660 49661 49662 49663 49664 49665 49666 49667 49668 49669 49670 49671 49672 49673 49674 49675 49676 49677 49678 49679 49680 49681 49682 49683 49684 49685 49686 49687 49688 49689 49690 49691 49692 49693 49694 49695 49696 49697 49698 49699 49700 49701 49702 49703 49704 49705 49706 49707 49708 49709 49710 49711 49712 49713 49714 49715 49716 49717 49718 49719 49720 49721 49722 49723 49724 49725 49726 49727 49728 49729 49730 49731 49732 49733 49734 49735 49736 49737 49738 49739 49740 49741 49742 49743 49744 49745 49746 49747 49748 49749 49750 49751 49752 49753 49754 49755 49756 49757 49758 49759 49760 49761 49762 49763 49764 49765 49766 49767 49768 49769 49770 49771 49772 49773 49774 49775 49776 49777 49778 49779 49780 49781 49782 49783 49784 49785 49786 49787 49788 49789 49790 49791 49792 49793 49794 49795 49796 49797 49798 49799 49800 49801 49802 49803 49804 49805 49806 49807 49808 49809 49810 49811 49812 49813 49814 49815 49816 49817 49818 49819 49820 49821 49822 49823 49824 49825 49826 49827 49828 49829 49830 49831 49832 49833 49834 49835 49836 49837 49838 49839 49840 49841 49842 49843 49844 49845 49846 49847 49848 49849 49850 49851 49852 49853 49854 49855 49856 49857 49858 49859 49860 49861 49862 49863 49864 49865 49866 49867 49868 49869 49870 49871 49872 49873 49874 49875 49876 49877 49878 49879 49880 49881 49882 49883 49884 49885 49886 49887 49888 49889 49890 49891 49892 49893 49894 49895 49896 49897 49898 49899 49900 49901 49902 49903 49904 49905 49906 49907 49908 49909 49910 49911 49912 49913 49914 49915 49916 49917 49918 49919 49920 49921 49922 49923 49924 49925 49926 49927 49928 49929 49930 49931 49932 49933 49934 49935 49936 49937 49938 49939 49940 49941 49942 49943 49944 49945 49946 49947 49948 49949 49950 49951 49952 49953 49954 49955 49956 49957 49958 49959 49960 49961 49962 49963 49964 49965 49966 49967 49968 49969 49970 49971 49972 49973 49974 49975 49976 49977 49978 49979 49980 49981 49982 49983 49984 49985 49986 49987 49988 49989 49990 49991 49992 49993 49994 49995 49996 49997 49998 49999 50000 50001 50002 50003 50004 50005 50006 50007 50008 50009 50010 50011 50012 50013 50014 50015 50016 50017 50018 50019 50020 50021 50022 50023 50024 50025 50026 50027 50028 50029 50030 50031 50032 50033 50034 50035 50036 50037 50038 50039 50040 50041 50042 50043 50044 50045 50046 50047 50048 50049 50050 50051 50052 50053 50054 50055 50056 50057 50058 50059 50060 50061 50062 50063 50064 50065 50066 50067 50068 50069 50070 50071 50072 50073 50074 50075 50076 50077 50078 50079 50080 50081 50082 50083 50084 50085 50086 50087 50088 50089 50090 50091 50092 50093 50094 50095 50096 50097 50098 50099 50100 50101 50102 50103 50104 50105 50106 50107 50108 50109 50110 50111 50112 50113 50114 50115 50116 50117 50118 50119 50120 50121 50122 50123 50124 50125 50126 50127 50128 50129 50130 50131 50132 50133 50134 50135 50136 50137 50138 50139 50140 50141 50142 50143 50144 50145 50146 50147 50148 50149 50150 50151 50152 50153 50154 50155 50156 50157 50158 50159 50160 50161 50162 50163 50164 50165 50166 50167 50168 50169 50170 50171 50172 50173 50174 50175 50176 50177 50178 50179 50180 50181 50182 50183 50184 50185 50186 50187 50188 50189 50190 50191 50192 50193 50194 50195 50196 50197 50198 50199 50200 50201 50202 50203 50204 50205 50206 50207 50208 50209 50210 50211 50212 50213 50214 50215 50216 50217 50218 50219 50220 50221 50222 50223 50224 50225 50226 50227 50228 50229 50230 50231 50232 50233 50234 50235 50236 50237 50238 50239 50240 50241 50242 50243 50244 50245 50246 50247 50248 50249 50250 50251 50252 50253 50254 50255 50256 50257 50258 50259 50260 50261 50262 50263 50264 50265 50266 50267 50268 50269 50270 50271 50272 50273 50274 50275 50276 50277 50278 50279 50280 50281 50282 50283 50284 50285 50286 50287 50288 50289 50290 50291 50292 50293 50294 50295 50296 50297 50298 50299 50300 50301 50302 50303 50304 50305 50306 50307 50308 50309 50310 50311 50312 50313 50314 50315 50316 50317 50318 50319 50320 50321 50322 50323 50324 50325 50326 50327 50328 50329 50330 50331 50332 50333 50334 50335 50336 50337 50338 50339 50340 50341 50342 50343 50344 50345 50346 50347 50348 50349 50350 50351 50352 50353 50354 50355 50356 50357 50358 50359 50360 50361 50362 50363 50364 50365 50366 50367 50368 50369 50370 50371 50372 50373 50374 50375 50376 50377 50378 50379 50380 50381 50382 50383 50384 50385 50386 50387 50388 50389 50390 50391 50392 50393 50394 50395 50396 50397 50398 50399 50400 50401 50402 50403 50404 50405 50406 50407 50408 50409 50410 50411 50412 50413 50414 50415 50416 50417 50418 50419 50420 50421 50422 50423 50424 50425 50426 50427 50428 50429 50430 50431 50432 50433 50434 50435 50436 50437 50438 50439 50440 50441 50442 50443 50444 50445 50446 50447 50448 50449 50450 50451 50452 50453 50454 50455 50456 50457 50458 50459 50460 50461 50462 50463 50464 50465 50466 50467 50468 50469 50470 50471 50472 50473 50474 50475 50476 50477 50478 50479 50480 50481 50482 50483 50484 50485 50486 50487 50488 50489 50490 50491 50492 50493 50494 50495 50496 50497 50498 50499 50500 50501 50502 50503 50504 50505 50506 50507 50508 50509 50510 50511 50512 50513 50514 50515 50516 50517 50518 50519 50520 50521 50522 50523 50524 50525 50526 50527 50528 50529 50530 50531 50532 50533 50534 50535 50536 50537 50538 50539 50540 50541 50542 50543 50544 50545 50546 50547 50548 50549 50550 50551 50552 50553 50554 50555 50556 50557 50558 50559 50560 50561 50562 50563 50564 50565 50566 50567 50568 50569 50570 50571 50572 50573 50574 50575 50576 50577 50578 50579 50580 50581 50582 50583 50584 50585 50586 50587 50588 50589 50590 50591 50592 50593 50594 50595 50596 50597 50598 50599 50600 50601 50602 50603 50604 50605 50606 50607 50608 50609 50610 50611 50612 50613 50614 50615 50616 50617 50618 50619 50620 50621 50622 50623 50624 50625 50626 50627 50628 50629 50630 50631 50632 50633 50634 50635 50636 50637 50638 50639 50640 50641 50642 50643 50644 50645 50646 50647 50648 50649 50650 50651 50652 50653 50654 50655 50656 50657 50658 50659 50660 50661 50662 50663 50664 50665 50666 50667 50668 50669 50670 50671 50672 50673 50674 50675 50676 50677 50678 50679 50680 50681 50682 50683 50684 50685 50686 50687 50688 50689 50690 50691 50692 50693 50694 50695 50696 50697 50698 50699 50700 50701 50702 50703 50704 50705 50706 50707 50708 50709 50710 50711 50712 50713 50714 50715 50716 50717 50718 50719 50720 50721 50722 50723 50724 50725 50726 50727 50728 50729 50730 50731 50732 50733 50734 50735 50736 50737 50738 50739 50740 50741 50742 50743 50744 50745 50746 50747 50748 50749 50750 50751 50752 50753 50754 50755 50756 50757 50758 50759 50760 50761 50762 50763 50764 50765 50766 50767 50768 50769 50770 50771 50772 50773 50774 50775 50776 50777 50778 50779 50780 50781 50782 50783 50784 50785 50786 50787 50788 50789 50790 50791 50792 50793 50794 50795 50796 50797 50798 50799 50800 50801 50802 50803 50804 50805 50806 50807 50808 50809 50810 50811 50812 50813 50814 50815 50816 50817 50818 50819 50820 50821 50822 50823 50824 50825 50826 50827 50828 50829 50830 50831 50832 50833 50834 50835 50836 50837 50838 50839 50840 50841 50842 50843 50844 50845 50846 50847 50848 50849 50850 50851 50852 50853 50854 50855 50856 50857 50858 50859 50860 50861 50862 50863 50864 50865 50866 50867 50868 50869 50870 50871 50872 50873 50874 50875 50876 50877 50878 50879 50880 50881 50882 50883 50884 50885 50886 50887 50888 50889 50890 50891 50892 50893 50894 50895 50896 50897 50898 50899 50900 50901 50902 50903 50904 50905 50906 50907 50908 50909 50910 50911 50912 50913 50914 50915 50916 50917 50918 50919 50920 50921 50922 50923 50924 50925 50926 50927 50928 50929 50930 50931 50932 50933 50934 50935 50936 50937 50938 50939 50940 50941 50942 50943 50944 50945 50946 50947 50948 50949 50950 50951 50952 50953 50954 50955 50956 50957 50958 50959 50960 50961 50962 50963 50964 50965 50966 50967 50968 50969 50970 50971 50972 50973 50974 50975 50976 50977 50978 50979 50980 50981 50982 50983 50984 50985 50986 50987 50988 50989 50990 50991 50992 50993 50994 50995 50996 50997 50998 50999 51000 51001 51002 51003 51004 51005 51006 51007 51008 51009 51010 51011 51012 51013 51014 51015 51016 51017 51018 51019 51020 51021 51022 51023 51024 51025 51026 51027 51028 51029 51030 51031 51032 51033 51034 51035 51036 51037 51038 51039 51040 51041 51042 51043 51044 51045 51046 51047 51048 51049 51050 51051 51052 51053 51054 51055 51056 51057 51058 51059 51060 51061 51062 51063 51064 51065 51066 51067 51068 51069 51070 51071 51072 51073 51074 51075 51076 51077 51078 51079 51080 51081 51082 51083 51084 51085 51086 51087 51088 51089 51090 51091 51092 51093 51094 51095 51096 51097 51098 51099 51100 51101 51102 51103 51104 51105 51106 51107 51108 51109 51110 51111 51112 51113 51114 51115 51116 51117 51118 51119 51120 51121 51122 51123 51124 51125 51126 51127 51128 51129 51130 51131 51132 51133 51134 51135 51136 51137 51138 51139 51140 51141 51142 51143 51144 51145 51146 51147 51148 51149 51150 51151 51152 51153 51154 51155 51156 51157 51158 51159 51160 51161 51162 51163 51164 51165 51166 51167 51168 51169 51170 51171 51172 51173 51174 51175 51176 51177 51178 51179 51180 51181 51182 51183 51184 51185 51186 51187 51188 51189 51190 51191 51192 51193 51194 51195 51196 51197 51198 51199 51200 51201 51202 51203 51204 51205 51206 51207 51208 51209 51210 51211 51212 51213 51214 51215 51216 51217 51218 51219 51220 51221 51222 51223 51224 51225 51226 51227 51228 51229 51230 51231 51232 51233 51234 51235 51236 51237 51238 51239 51240 51241 51242 51243 51244 51245 51246 51247 51248 51249 51250 51251 51252 51253 51254 51255 51256 51257 51258 51259 51260 51261 51262 51263 51264 51265 51266 51267 51268 51269 51270 51271 51272 51273 51274 51275 51276 51277 51278 51279 51280 51281 51282 51283 51284 51285 51286 51287 51288 51289 51290 51291 51292 51293 51294 51295 51296 51297 51298 51299 51300 51301 51302 51303 51304 51305 51306 51307 51308 51309 51310 51311 51312 51313 51314 51315 51316 51317 51318 51319 51320 51321 51322 51323 51324 51325 51326 51327 51328 51329 51330 51331 51332 51333 51334 51335 51336 51337 51338 51339 51340 51341 51342 51343 51344 51345 51346 51347 51348 51349 51350 51351 51352 51353 51354 51355 51356 51357 51358 51359 51360 51361 51362 51363 51364 51365 51366 51367 51368 51369 51370 51371 51372 51373 51374 51375 51376 51377 51378 51379 51380 51381 51382 51383 51384 51385 51386 51387 51388 51389 51390 51391 51392 51393 51394 51395 51396 51397 51398 51399 51400 51401 51402 51403 51404 51405 51406 51407 51408 51409 51410 51411 51412 51413 51414 51415 51416 51417 51418 51419 51420 51421 51422 51423 51424 51425 51426 51427 51428 51429 51430 51431 51432 51433 51434 51435 51436 51437 51438 51439 51440 51441 51442 51443 51444 51445 51446 51447 51448 51449 51450 51451 51452 51453 51454 51455 51456 51457 51458 51459 51460 51461 51462 51463 51464 51465 51466 51467 51468 51469 51470 51471 51472 51473 51474 51475 51476 51477 51478 51479 51480 51481 51482 51483 51484 51485 51486 51487 51488 51489 51490 51491 51492 51493 51494 51495 51496 51497 51498 51499 51500 51501 51502 51503 51504 51505 51506 51507 51508 51509 51510 51511 51512 51513 51514 51515 51516 51517 51518 51519 51520 51521 51522 51523 51524 51525 51526 51527 51528 51529 51530 51531 51532 51533 51534 51535 51536 51537 51538 51539 51540 51541 51542 51543 51544 51545 51546 51547 51548 51549 51550 51551 51552 51553 51554 51555 51556 51557 51558 51559 51560 51561 51562 51563 51564 51565 51566 51567 51568 51569 51570 51571 51572 51573 51574 51575 51576 51577 51578 51579 51580 51581 51582 51583 51584 51585 51586 51587 51588 51589 51590 51591 51592 51593 51594 51595 51596 51597 51598 51599 51600 51601 51602 51603 51604 51605 51606 51607 51608 51609 51610 51611 51612 51613 51614 51615 51616 51617 51618 51619 51620 51621 51622 51623 51624 51625 51626 51627 51628 51629 51630 51631 51632 51633 51634 51635 51636 51637 51638 51639 51640 51641 51642 51643 51644 51645 51646 51647 51648 51649 51650 51651 51652 51653 51654 51655 51656 51657 51658 51659 51660 51661 51662 51663 51664 51665 51666 51667 51668 51669 51670 51671 51672 51673 51674 51675 51676 51677 51678 51679 51680 51681 51682 51683 51684 51685 51686 51687 51688 51689 51690 51691 51692 51693 51694 51695 51696 51697 51698 51699 51700 51701 51702 51703 51704 51705 51706 51707 51708 51709 51710 51711 51712 51713 51714 51715 51716 51717 51718 51719 51720 51721 51722 51723 51724 51725 51726 51727 51728 51729 51730 51731 51732 51733 51734 51735 51736 51737 51738 51739 51740 51741 51742 51743 51744 51745 51746 51747 51748 51749 51750 51751 51752 51753 51754 51755 51756 51757 51758 51759 51760 51761 51762 51763 51764 51765 51766 51767 51768 51769 51770 51771 51772 51773 51774 51775 51776 51777 51778 51779 51780 51781 51782 51783 51784 51785 51786 51787 51788 51789 51790 51791 51792 51793 51794 51795 51796 51797 51798 51799 51800 51801 51802 51803 51804 51805 51806 51807 51808 51809 51810 51811 51812 51813 51814 51815 51816 51817 51818 51819 51820 51821 51822 51823 51824 51825 51826 51827 51828 51829 51830 51831 51832 51833 51834 51835 51836 51837 51838 51839 51840 51841 51842 51843 51844 51845 51846 51847 51848 51849 51850 51851 51852 51853 51854 51855 51856 51857 51858 51859 51860 51861 51862 51863 51864 51865 51866 51867 51868 51869 51870 51871 51872 51873 51874 51875 51876 51877 51878 51879 51880 51881 51882 51883 51884 51885 51886 51887 51888 51889 51890 51891 51892 51893 51894 51895 51896 51897 51898 51899 51900 51901 51902 51903 51904 51905 51906 51907 51908 51909 51910 51911 51912 51913 51914 51915 51916 51917 51918 51919 51920 51921 51922 51923 51924 51925 51926 51927 51928 51929 51930 51931 51932 51933 51934 51935 51936 51937 51938 51939 51940 51941 51942 51943 51944 51945 51946 51947 51948 51949 51950 51951 51952 51953 51954 51955 51956 51957 51958 51959 51960 51961 51962 51963 51964 51965 51966 51967 51968 51969 51970 51971 51972 51973 51974 51975 51976 51977 51978 51979 51980 51981 51982 51983 51984 51985 51986 51987 51988 51989 51990 51991 51992 51993 51994 51995 51996 51997 51998 51999 52000 52001 52002 52003 52004 52005 52006 52007 52008 52009 52010 52011 52012 52013 52014 52015 52016 52017 52018 52019 52020 52021 52022 52023 52024 52025 52026 52027 52028 52029 52030 52031 52032 52033 52034 52035 52036 52037 52038 52039 52040 52041 52042 52043 52044 52045 52046 52047 52048 52049 52050 52051 52052 52053 52054 52055 52056 52057 52058 52059 52060 52061 52062 52063 52064 52065 52066 52067 52068 52069 52070 52071 52072 52073 52074 52075 52076 52077 52078 52079 52080 52081 52082 52083 52084 52085 52086 52087 52088 52089 52090 52091 52092 52093 52094 52095 52096 52097 52098 52099 52100 52101 52102 52103 52104 52105 52106 52107 52108 52109 52110 52111 52112 52113 52114 52115 52116 52117 52118 52119 52120 52121 52122 52123 52124 52125 52126 52127 52128 52129 52130 52131 52132 52133 52134 52135 52136 52137 52138 52139 52140 52141 52142 52143 52144 52145 52146 52147 52148 52149 52150 52151 52152 52153 52154 52155 52156 52157 52158 52159 52160 52161 52162 52163 52164 52165 52166 52167 52168 52169 52170 52171 52172 52173 52174 52175 52176 52177 52178 52179 52180 52181 52182 52183 52184 52185 52186 52187 52188 52189 52190 52191 52192 52193 52194 52195 52196 52197 52198 52199 52200 52201 52202 52203 52204 52205 52206 52207 52208 52209 52210 52211 52212 52213 52214 52215 52216 52217 52218 52219 52220 52221 52222 52223 52224 52225 52226 52227 52228 52229 52230 52231 52232 52233 52234 52235 52236 52237 52238 52239 52240 52241 52242 52243 52244 52245 52246 52247 52248 52249 52250 52251 52252 52253 52254 52255 52256 52257 52258 52259 52260 52261 52262 52263 52264 52265 52266 52267 52268 52269 52270 52271 52272 52273 52274 52275 52276 52277 52278 52279 52280 52281 52282 52283 52284 52285 52286 52287 52288 52289 52290 52291 52292 52293 52294 52295 52296 52297 52298 52299 52300 52301 52302 52303 52304 52305 52306 52307 52308 52309 52310 52311 52312 52313 52314 52315 52316 52317 52318 52319 52320 52321 52322 52323 52324 52325 52326 52327 52328 52329 52330 52331 52332 52333 52334 52335 52336 52337 52338 52339 52340 52341 52342 52343 52344 52345 52346 52347 52348 52349 52350 52351 52352 52353 52354 52355 52356 52357 52358 52359 52360 52361 52362 52363 52364 52365 52366 52367 52368 52369 52370 52371 52372 52373 52374 52375 52376 52377 52378 52379 52380 52381 52382 52383 52384 52385 52386 52387 52388 52389 52390 52391 52392 52393 52394 52395 52396 52397 52398 52399 52400 52401 52402 52403 52404 52405 52406 52407 52408 52409 52410 52411 52412 52413 52414 52415 52416 52417 52418 52419 52420 52421 52422 52423 52424 52425 52426 52427 52428 52429 52430 52431 52432 52433 52434 52435 52436 52437 52438 52439 52440 52441 52442 52443 52444 52445 52446 52447 52448 52449 52450 52451 52452 52453 52454 52455 52456 52457 52458 52459 52460 52461 52462 52463 52464 52465 52466 52467 52468 52469 52470 52471 52472 52473 52474 52475 52476 52477 52478 52479 52480 52481 52482 52483 52484 52485 52486 52487 52488 52489 52490 52491 52492 52493 52494 52495 52496 52497 52498 52499 52500 52501 52502 52503 52504 52505 52506 52507 52508 52509 52510 52511 52512 52513 52514 52515 52516 52517 52518 52519 52520 52521 52522 52523 52524 52525 52526 52527 52528 52529 52530 52531 52532 52533 52534 52535 52536 52537 52538 52539 52540 52541 52542 52543 52544 52545 52546 52547 52548 52549 52550 52551 52552 52553 52554 52555 52556 52557 52558 52559 52560 52561 52562 52563 52564 52565 52566 52567 52568 52569 52570 52571 52572 52573 52574 52575 52576 52577 52578 52579 52580 52581 52582 52583 52584 52585 52586 52587 52588 52589 52590 52591 52592 52593 52594 52595 52596 52597 52598 52599 52600 52601 52602 52603 52604 52605 52606 52607 52608 52609 52610 52611 52612 52613 52614 52615 52616 52617 52618 52619 52620 52621 52622 52623 52624 52625 52626 52627 52628 52629 52630 52631 52632 52633 52634 52635 52636 52637 52638 52639 52640 52641 52642 52643 52644 52645 52646 52647 52648 52649 52650 52651 52652 52653 52654 52655 52656 52657 52658 52659 52660 52661 52662 52663 52664 52665 52666 52667 52668 52669 52670 52671 52672 52673 52674 52675 52676 52677 52678 52679 52680 52681 52682 52683 52684 52685 52686 52687 52688 52689 52690 52691 52692 52693 52694 52695 52696 52697 52698 52699 52700 52701 52702 52703 52704 52705 52706 52707 52708 52709 52710 52711 52712 52713 52714 52715 52716 52717 52718 52719 52720 52721 52722 52723 52724 52725 52726 52727 52728 52729 52730 52731 52732 52733 52734 52735 52736 52737 52738 52739 52740 52741 52742 52743 52744 52745 52746 52747 52748 52749 52750 52751 52752 52753 52754 52755 52756 52757 52758 52759 52760 52761 52762 52763 52764 52765 52766 52767 52768 52769 52770 52771 52772 52773 52774 52775 52776 52777 52778 52779 52780 52781 52782 52783 52784 52785 52786 52787 52788 52789 52790 52791 52792 52793 52794 52795 52796 52797 52798 52799 52800 52801 52802 52803 52804 52805 52806 52807 52808 52809 52810 52811 52812 52813 52814 52815 52816 52817 52818 52819 52820 52821 52822 52823 52824 52825 52826 52827 52828 52829 52830 52831 52832 52833 52834 52835 52836 52837 52838 52839 52840 52841 52842 52843 52844 52845 52846 52847 52848 52849 52850 52851 52852 52853 52854 52855 52856 52857 52858 52859 52860 52861 52862 52863 52864 52865 52866 52867 52868 52869 52870 52871 52872 52873 52874 52875 52876 52877 52878 52879 52880 52881 52882 52883 52884 52885 52886 52887 52888 52889 52890 52891 52892 52893 52894 52895 52896 52897 52898 52899 52900 52901 52902 52903 52904 52905 52906 52907 52908 52909 52910 52911 52912 52913 52914 52915 52916 52917 52918 52919 52920 52921 52922 52923 52924 52925 52926 52927 52928 52929 52930 52931 52932 52933 52934 52935 52936 52937 52938 52939 52940 52941 52942 52943 52944 52945 52946 52947 52948 52949 52950 52951 52952 52953 52954 52955 52956 52957 52958 52959 52960 52961 52962 52963 52964 52965 52966 52967 52968 52969 52970 52971 52972 52973 52974 52975 52976 52977 52978 52979 52980 52981 52982 52983 52984 52985 52986 52987 52988 52989 52990 52991 52992 52993 52994 52995 52996 52997 52998 52999 53000 53001 53002 53003 53004 53005 53006 53007 53008 53009 53010 53011 53012 53013 53014 53015 53016 53017 53018 53019 53020 53021 53022 53023 53024 53025 53026 53027 53028 53029 53030 53031 53032 53033 53034 53035 53036 53037 53038 53039 53040 53041 53042 53043 53044 53045 53046 53047 53048 53049 53050 53051 53052 53053 53054 53055 53056 53057 53058 53059 53060 53061 53062 53063 53064 53065 53066 53067 53068 53069 53070 53071 53072 53073 53074 53075 53076 53077 53078 53079 53080 53081 53082 53083 53084 53085 53086 53087 53088 53089 53090 53091 53092 53093 53094 53095 53096 53097 53098 53099 53100 53101 53102 53103 53104 53105 53106 53107 53108 53109 53110 53111 53112 53113 53114 53115 53116 53117 53118 53119 53120 53121 53122 53123 53124 53125 53126 53127 53128 53129 53130 53131 53132 53133 53134 53135 53136 53137 53138 53139 53140 53141 53142 53143 53144 53145 53146 53147 53148 53149 53150 53151 53152 53153 53154 53155 53156 53157 53158 53159 53160 53161 53162 53163 53164 53165 53166 53167 53168 53169 53170 53171 53172 53173 53174 53175 53176 53177 53178 53179 53180 53181 53182 53183 53184 53185 53186 53187 53188 53189 53190 53191 53192 53193 53194 53195 53196 53197 53198 53199 53200 53201 53202 53203 53204 53205 53206 53207 53208 53209 53210 53211 53212 53213 53214 53215 53216 53217 53218 53219 53220 53221 53222 53223 53224 53225 53226 53227 53228 53229 53230 53231 53232 53233 53234 53235 53236 53237 53238 53239 53240 53241 53242 53243 53244 53245 53246 53247 53248 53249 53250 53251 53252 53253 53254 53255 53256 53257 53258 53259 53260 53261 53262 53263 53264 53265 53266 53267 53268 53269 53270 53271 53272 53273 53274 53275 53276 53277 53278 53279 53280 53281 53282 53283 53284 53285 53286 53287 53288 53289 53290 53291 53292 53293 53294 53295 53296 53297 53298 53299 53300 53301 53302 53303 53304 53305 53306 53307 53308 53309 53310 53311 53312 53313 53314 53315 53316 53317 53318 53319 53320 53321 53322 53323 53324 53325 53326 53327 53328 53329 53330 53331 53332 53333 53334 53335 53336 53337 53338 53339 53340 53341 53342 53343 53344 53345 53346 53347 53348 53349 53350 53351 53352 53353 53354 53355 53356 53357 53358 53359 53360 53361 53362 53363 53364 53365 53366 53367 53368 53369 53370 53371 53372 53373 53374 53375 53376 53377 53378 53379 53380 53381 53382 53383 53384 53385 53386 53387 53388 53389 53390 53391 53392 53393 53394 53395 53396 53397 53398 53399 53400 53401 53402 53403 53404 53405 53406 53407 53408 53409 53410 53411 53412 53413 53414 53415 53416 53417 53418 53419 53420 53421 53422 53423 53424 53425 53426 53427 53428 53429 53430 53431 53432 53433 53434 53435 53436 53437 53438 53439 53440 53441 53442 53443 53444 53445 53446 53447 53448 53449 53450 53451 53452 53453 53454 53455 53456 53457 53458 53459 53460 53461 53462 53463 53464 53465 53466 53467 53468 53469 53470 53471 53472 53473 53474 53475 53476 53477 53478 53479 53480 53481 53482 53483 53484 53485 53486 53487 53488 53489 53490 53491 53492 53493 53494 53495 53496 53497 53498 53499 53500 53501 53502 53503 53504 53505 53506 53507 53508 53509 53510 53511 53512 53513 53514 53515 53516 53517 53518 53519 53520 53521 53522 53523 53524 53525 53526 53527 53528 53529 53530 53531 53532 53533 53534 53535 53536 53537 53538 53539 53540 53541 53542 53543 53544 53545 53546 53547 53548 53549 53550 53551 53552 53553 53554 53555 53556 53557 53558 53559 53560 53561 53562 53563 53564 53565 53566 53567 53568 53569 53570 53571 53572 53573 53574 53575 53576 53577 53578 53579 53580 53581 53582 53583 53584 53585 53586 53587 53588 53589 53590 53591 53592 53593 53594 53595 53596 53597 53598 53599 53600 53601 53602 53603 53604 53605 53606 53607 53608 53609 53610 53611 53612 53613 53614 53615 53616 53617 53618 53619 53620 53621 53622 53623 53624 53625 53626 53627 53628 53629 53630 53631 53632 53633 53634 53635 53636 53637 53638 53639 53640 53641 53642 53643 53644 53645 53646 53647 53648 53649 53650 53651 53652 53653 53654 53655 53656 53657 53658 53659 53660 53661 53662 53663 53664 53665 53666 53667 53668 53669 53670 53671 53672 53673 53674 53675 53676 53677 53678 53679 53680 53681 53682 53683 53684 53685 53686 53687 53688 53689 53690 53691 53692 53693 53694 53695 53696 53697 53698 53699 53700 53701 53702 53703 53704 53705 53706 53707 53708 53709 53710 53711 53712 53713 53714 53715 53716 53717 53718 53719 53720 53721 53722 53723 53724 53725 53726 53727 53728 53729 53730 53731 53732 53733 53734 53735 53736 53737 53738 53739 53740 53741 53742 53743 53744 53745 53746 53747 53748 53749 53750 53751 53752 53753 53754 53755 53756 53757 53758 53759 53760 53761 53762 53763 53764 53765 53766 53767 53768 53769 53770 53771 53772 53773 53774 53775 53776 53777 53778 53779 53780 53781 53782 53783 53784 53785 53786 53787 53788 53789 53790 53791 53792 53793 53794 53795 53796 53797 53798 53799 53800 53801 53802 53803 53804 53805 53806 53807 53808 53809 53810 53811 53812 53813 53814 53815 53816 53817 53818 53819 53820 53821 53822 53823 53824 53825 53826 53827 53828 53829 53830 53831 53832 53833 53834 53835 53836 53837 53838 53839 53840 53841 53842 53843 53844 53845 53846 53847 53848 53849 53850 53851 53852 53853 53854 53855 53856 53857 53858 53859 53860 53861 53862 53863 53864 53865 53866 53867 53868 53869 53870 53871 53872 53873 53874 53875 53876 53877 53878 53879 53880 53881 53882 53883 53884 53885 53886 53887 53888 53889 53890 53891 53892 53893 53894 53895 53896 53897 53898 53899 53900 53901 53902 53903 53904 53905 53906 53907 53908 53909 53910 53911 53912 53913 53914 53915 53916 53917 53918 53919 53920 53921 53922 53923 53924 53925 53926 53927 53928 53929 53930 53931 53932 53933 53934 53935 53936 53937 53938 53939 53940 53941 53942 53943 53944 53945 53946 53947 53948 53949 53950 53951 53952 53953 53954 53955 53956 53957 53958 53959 53960 53961 53962 53963 53964 53965 53966 53967 53968 53969 53970 53971 53972 53973 53974 53975 53976 53977 53978 53979 53980 53981 53982 53983 53984 53985 53986 53987 53988 53989 53990 53991 53992 53993 53994 53995 53996 53997 53998 53999 54000 54001 54002 54003 54004 54005 54006 54007 54008 54009 54010 54011 54012 54013 54014 54015 54016 54017 54018 54019 54020 54021 54022 54023 54024 54025 54026 54027 54028 54029 54030 54031 54032 54033 54034 54035 54036 54037 54038 54039 54040 54041 54042 54043 54044 54045 54046 54047 54048 54049 54050 54051 54052 54053 54054 54055 54056 54057 54058 54059 54060 54061 54062 54063 54064 54065 54066 54067 54068 54069 54070 54071 54072 54073 54074 54075 54076 54077 54078 54079 54080 54081 54082 54083 54084 54085 54086 54087 54088 54089 54090 54091 54092 54093 54094 54095 54096 54097 54098 54099 54100 54101 54102 54103 54104 54105 54106 54107 54108 54109 54110 54111 54112 54113 54114 54115 54116 54117 54118 54119 54120 54121 54122 54123 54124 54125 54126 54127 54128 54129 54130 54131 54132 54133 54134 54135 54136 54137 54138 54139 54140 54141 54142 54143 54144 54145 54146 54147 54148 54149 54150 54151 54152 54153 54154 54155 54156 54157 54158 54159 54160 54161 54162 54163 54164 54165 54166 54167 54168 54169 54170 54171 54172 54173 54174 54175 54176 54177 54178 54179 54180 54181 54182 54183 54184 54185 54186 54187 54188 54189 54190 54191 54192 54193 54194 54195 54196 54197 54198 54199 54200 54201 54202 54203 54204 54205 54206 54207 54208 54209 54210 54211 54212 54213 54214 54215 54216 54217 54218 54219 54220 54221 54222 54223 54224 54225 54226 54227 54228 54229 54230 54231 54232 54233 54234 54235 54236 54237 54238 54239 54240 54241 54242 54243 54244 54245 54246 54247 54248 54249 54250 54251 54252 54253 54254 54255 54256 54257 54258 54259 54260 54261 54262 54263 54264 54265 54266 54267 54268 54269 54270 54271 54272 54273 54274 54275 54276 54277 54278 54279 54280 54281 54282 54283 54284 54285 54286 54287 54288 54289 54290 54291 54292 54293 54294 54295 54296 54297 54298 54299 54300 54301 54302 54303 54304 54305 54306 54307 54308 54309 54310 54311 54312 54313 54314 54315 54316 54317 54318 54319 54320 54321 54322 54323 54324 54325 54326 54327 54328 54329 54330 54331 54332 54333 54334 54335 54336 54337 54338 54339 54340 54341 54342 54343 54344 54345 54346 54347 54348 54349 54350 54351 54352 54353 54354 54355 54356 54357 54358 54359 54360 54361 54362 54363 54364 54365 54366 54367 54368 54369 54370 54371 54372 54373 54374 54375 54376 54377 54378 54379 54380 54381 54382 54383 54384 54385 54386 54387 54388 54389 54390 54391 54392 54393 54394 54395 54396 54397 54398 54399 54400 54401 54402 54403 54404 54405 54406 54407 54408 54409 54410 54411 54412 54413 54414 54415 54416 54417 54418 54419 54420 54421 54422 54423 54424 54425 54426 54427 54428 54429 54430 54431 54432 54433 54434 54435 54436 54437 54438 54439 54440 54441 54442 54443 54444 54445 54446 54447 54448 54449 54450 54451 54452 54453 54454 54455 54456 54457 54458 54459 54460 54461 54462 54463 54464 54465 54466 54467 54468 54469 54470 54471 54472 54473 54474 54475 54476 54477 54478 54479 54480 54481 54482 54483 54484 54485 54486 54487 54488 54489 54490 54491 54492 54493 54494 54495 54496 54497 54498 54499 54500 54501 54502 54503 54504 54505 54506 54507 54508 54509 54510 54511 54512 54513 54514 54515 54516 54517 54518 54519 54520 54521 54522 54523 54524 54525 54526 54527 54528 54529 54530 54531 54532 54533 54534 54535 54536 54537 54538 54539 54540 54541 54542 54543 54544 54545 54546 54547 54548 54549 54550 54551 54552 54553 54554 54555 54556 54557 54558 54559 54560 54561 54562 54563 54564 54565 54566 54567 54568 54569 54570 54571 54572 54573 54574 54575 54576 54577 54578 54579 54580 54581 54582 54583 54584 54585 54586 54587 54588 54589 54590 54591 54592 54593 54594 54595 54596 54597 54598 54599 54600 54601 54602 54603 54604 54605 54606 54607 54608 54609 54610 54611 54612 54613 54614 54615 54616 54617 54618 54619 54620 54621 54622 54623 54624 54625 54626 54627 54628 54629 54630 54631 54632 54633 54634 54635 54636 54637 54638 54639 54640 54641 54642 54643 54644 54645 54646 54647 54648 54649 54650 54651 54652 54653 54654 54655 54656 54657 54658 54659 54660 54661 54662 54663 54664 54665 54666 54667 54668 54669 54670 54671 54672 54673 54674 54675 54676 54677 54678 54679 54680 54681 54682 54683 54684 54685 54686 54687 54688 54689 54690 54691 54692 54693 54694 54695 54696 54697 54698 54699 54700 54701 54702 54703 54704 54705 54706 54707 54708 54709 54710 54711 54712 54713 54714 54715 54716 54717 54718 54719 54720 54721 54722 54723 54724 54725 54726 54727 54728 54729 54730 54731 54732 54733 54734 54735 54736 54737 54738 54739 54740 54741 54742 54743 54744 54745 54746 54747 54748 54749 54750 54751 54752 54753 54754 54755 54756 54757 54758 54759 54760 54761 54762 54763 54764 54765 54766 54767 54768 54769 54770 54771 54772 54773 54774 54775 54776 54777 54778 54779 54780 54781 54782 54783 54784 54785 54786 54787 54788 54789 54790 54791 54792 54793 54794 54795 54796 54797 54798 54799 54800 54801 54802 54803 54804 54805 54806 54807 54808 54809 54810 54811 54812 54813 54814 54815 54816 54817 54818 54819 54820 54821 54822 54823 54824 54825 54826 54827 54828 54829 54830 54831 54832 54833 54834 54835 54836 54837 54838 54839 54840 54841 54842 54843 54844 54845 54846 54847 54848 54849 54850 54851 54852 54853 54854 54855 54856 54857 54858 54859 54860 54861 54862 54863 54864 54865 54866 54867 54868 54869 54870 54871 54872 54873 54874 54875 54876 54877 54878 54879 54880 54881 54882 54883 54884 54885 54886 54887 54888 54889 54890 54891 54892 54893 54894 54895 54896 54897 54898 54899 54900 54901 54902 54903 54904 54905 54906 54907 54908 54909 54910 54911 54912 54913 54914 54915 54916 54917 54918 54919 54920 54921 54922 54923 54924 54925 54926 54927 54928 54929 54930 54931 54932 54933 54934 54935 54936 54937 54938 54939 54940 54941 54942 54943 54944 54945 54946 54947 54948 54949 54950 54951 54952 54953 54954 54955 54956 54957 54958 54959 54960 54961 54962 54963 54964 54965 54966 54967 54968 54969 54970 54971 54972 54973 54974 54975 54976 54977 54978 54979 54980 54981 54982 54983 54984 54985 54986 54987 54988 54989 54990 54991 54992 54993 54994 54995 54996 54997 54998 54999 55000 55001 55002 55003 55004 55005 55006 55007 55008 55009 55010 55011 55012 55013 55014 55015 55016 55017 55018 55019 55020 55021 55022 55023 55024 55025 55026 55027 55028 55029 55030 55031 55032 55033 55034 55035 55036 55037 55038 55039 55040 55041 55042 55043 55044 55045 55046 55047 55048 55049 55050 55051 55052 55053 55054 55055 55056 55057 55058 55059 55060 55061 55062 55063 55064 55065 55066 55067 55068 55069 55070 55071 55072 55073 55074 55075 55076 55077 55078 55079 55080 55081 55082 55083 55084 55085 55086 55087 55088 55089 55090 55091 55092 55093 55094 55095 55096 55097 55098 55099 55100 55101 55102 55103 55104 55105 55106 55107 55108 55109 55110 55111 55112 55113 55114 55115 55116 55117 55118 55119 55120 55121 55122 55123 55124 55125 55126 55127 55128 55129 55130 55131 55132 55133 55134 55135 55136 55137 55138 55139 55140 55141 55142 55143 55144 55145 55146 55147 55148 55149 55150 55151 55152 55153 55154 55155 55156 55157 55158 55159 55160 55161 55162 55163 55164 55165 55166 55167 55168 55169 55170 55171 55172 55173 55174 55175 55176 55177 55178 55179 55180 55181 55182 55183 55184 55185 55186 55187 55188 55189 55190 55191 55192 55193 55194 55195 55196 55197 55198 55199 55200 55201 55202 55203 55204 55205 55206 55207 55208 55209 55210 55211 55212 55213 55214 55215 55216 55217 55218 55219 55220 55221 55222 55223 55224 55225 55226 55227 55228 55229 55230 55231 55232 55233 55234 55235 55236 55237 55238 55239 55240 55241 55242 55243 55244 55245 55246 55247 55248 55249 55250 55251 55252 55253 55254 55255 55256 55257 55258 55259 55260 55261 55262 55263 55264 55265 55266 55267 55268 55269 55270 55271 55272 55273 55274 55275 55276 55277 55278 55279 55280 55281 55282 55283 55284 55285 55286 55287 55288 55289 55290 55291 55292 55293 55294 55295 55296 55297 55298 55299 55300 55301 55302 55303 55304 55305 55306 55307 55308 55309 55310 55311 55312 55313 55314 55315 55316 55317 55318 55319 55320 55321 55322 55323 55324 55325 55326 55327 55328 55329 55330 55331 55332 55333 55334 55335 55336 55337 55338 55339 55340 55341 55342 55343 55344 55345 55346 55347 55348 55349 55350 55351 55352 55353 55354 55355 55356 55357 55358 55359 55360 55361 55362 55363 55364 55365 55366 55367 55368 55369 55370 55371 55372 55373 55374 55375 55376 55377 55378 55379 55380 55381 55382 55383 55384 55385 55386 55387 55388 55389 55390 55391 55392 55393 55394 55395 55396 55397 55398 55399 55400 55401 55402 55403 55404 55405 55406 55407 55408 55409 55410 55411 55412 55413 55414 55415 55416 55417 55418 55419 55420 55421 55422 55423 55424 55425 55426 55427 55428 55429 55430 55431 55432 55433 55434 55435 55436 55437 55438 55439 55440 55441 55442 55443 55444 55445 55446 55447 55448 55449 55450 55451 55452 55453 55454 55455 55456 55457 55458 55459 55460 55461 55462 55463 55464 55465 55466 55467 55468 55469 55470 55471 55472 55473 55474 55475 55476 55477 55478 55479 55480 55481 55482 55483 55484 55485 55486 55487 55488 55489 55490 55491 55492 55493 55494 55495 55496 55497 55498 55499 55500 55501 55502 55503 55504 55505 55506 55507 55508 55509 55510 55511 55512 55513 55514 55515 55516 55517 55518 55519 55520 55521 55522 55523 55524 55525 55526 55527 55528 55529 55530 55531 55532 55533 55534 55535 55536 55537 55538 55539 55540 55541 55542 55543 55544 55545 55546 55547 55548 55549 55550 55551 55552 55553 55554 55555 55556 55557 55558 55559 55560 55561 55562 55563 55564 55565 55566 55567 55568 55569 55570 55571 55572 55573 55574 55575 55576 55577 55578 55579 55580 55581 55582 55583 55584 55585 55586 55587 55588 55589 55590 55591 55592 55593 55594 55595 55596 55597 55598 55599 55600 55601 55602 55603 55604 55605 55606 55607 55608 55609 55610 55611 55612 55613 55614 55615 55616 55617 55618 55619 55620 55621 55622 55623 55624 55625 55626 55627 55628 55629 55630 55631 55632 55633 55634 55635 55636 55637 55638 55639 55640 55641 55642 55643 55644 55645 55646 55647 55648 55649 55650 55651 55652 55653 55654 55655 55656 55657 55658 55659 55660 55661 55662 55663 55664 55665 55666 55667 55668 55669 55670 55671 55672 55673 55674 55675 55676 55677 55678 55679 55680 55681 55682 55683 55684 55685 55686 55687 55688 55689 55690 55691 55692 55693 55694 55695 55696 55697 55698 55699 55700 55701 55702 55703 55704 55705 55706 55707 55708 55709 55710 55711 55712 55713 55714 55715 55716 55717 55718 55719 55720 55721 55722 55723 55724 55725 55726 55727 55728 55729 55730 55731 55732 55733 55734 55735 55736 55737 55738 55739 55740 55741 55742 55743 55744 55745 55746 55747 55748 55749 55750 55751 55752 55753 55754 55755 55756 55757 55758 55759 55760 55761 55762 55763 55764 55765 55766 55767 55768 55769 55770 55771 55772 55773 55774 55775 55776 55777 55778 55779 55780 55781 55782 55783 55784 55785 55786 55787 55788 55789 55790 55791 55792 55793 55794 55795 55796 55797 55798 55799 55800 55801 55802 55803 55804 55805 55806 55807 55808 55809 55810 55811 55812 55813 55814 55815 55816 55817 55818 55819 55820 55821 55822 55823 55824 55825 55826 55827 55828 55829 55830 55831 55832 55833 55834 55835 55836 55837 55838 55839 55840 55841 55842 55843 55844 55845 55846 55847 55848 55849 55850 55851 55852 55853 55854 55855 55856 55857 55858 55859 55860 55861 55862 55863 55864 55865 55866 55867 55868 55869 55870 55871 55872 55873 55874 55875 55876 55877 55878 55879 55880 55881 55882 55883 55884 55885 55886 55887 55888 55889 55890 55891 55892 55893 55894 55895 55896 55897 55898 55899 55900 55901 55902 55903 55904 55905 55906 55907 55908 55909 55910 55911 55912 55913 55914 55915 55916 55917 55918 55919 55920 55921 55922 55923 55924 55925 55926 55927 55928 55929 55930 55931 55932 55933 55934 55935 55936 55937 55938 55939 55940 55941 55942 55943 55944 55945 55946 55947 55948 55949 55950 55951 55952 55953 55954 55955 55956 55957 55958 55959 55960 55961 55962 55963 55964 55965 55966 55967 55968 55969 55970 55971 55972 55973 55974 55975 55976 55977 55978 55979 55980 55981 55982 55983 55984 55985 55986 55987 55988 55989 55990 55991 55992 55993 55994 55995 55996 55997 55998 55999 56000 56001 56002 56003 56004 56005 56006 56007 56008 56009 56010 56011 56012 56013 56014 56015 56016 56017 56018 56019 56020 56021 56022 56023 56024 56025 56026 56027 56028 56029 56030 56031 56032 56033 56034 56035 56036 56037 56038 56039 56040 56041 56042 56043 56044 56045 56046 56047 56048 56049 56050 56051 56052 56053 56054 56055 56056 56057 56058 56059 56060 56061 56062 56063 56064 56065 56066 56067 56068 56069 56070 56071 56072 56073 56074 56075 56076 56077 56078 56079 56080 56081 56082 56083 56084 56085 56086 56087 56088 56089 56090 56091 56092 56093 56094 56095 56096 56097 56098 56099 56100 56101 56102 56103 56104 56105 56106 56107 56108 56109 56110 56111 56112 56113 56114 56115 56116 56117 56118 56119 56120 56121 56122 56123 56124 56125 56126 56127 56128 56129 56130 56131 56132 56133 56134 56135 56136 56137 56138 56139 56140 56141 56142 56143 56144 56145 56146 56147 56148 56149 56150 56151 56152 56153 56154 56155 56156 56157 56158 56159 56160 56161 56162 56163 56164 56165 56166 56167 56168 56169 56170 56171 56172 56173 56174 56175 56176 56177 56178 56179 56180 56181 56182 56183 56184 56185 56186 56187 56188 56189 56190 56191 56192 56193 56194 56195 56196 56197 56198 56199 56200 56201 56202 56203 56204 56205 56206 56207 56208 56209 56210 56211 56212 56213 56214 56215 56216 56217 56218 56219 56220 56221 56222 56223 56224 56225 56226 56227 56228 56229 56230 56231 56232 56233 56234 56235 56236 56237 56238 56239 56240 56241 56242 56243 56244 56245 56246 56247 56248 56249 56250 56251 56252 56253 56254 56255 56256 56257 56258 56259 56260 56261 56262 56263 56264 56265 56266 56267 56268 56269 56270 56271 56272 56273 56274 56275 56276 56277 56278 56279 56280 56281 56282 56283 56284 56285 56286 56287 56288 56289 56290 56291 56292 56293 56294 56295 56296 56297 56298 56299 56300 56301 56302 56303 56304 56305 56306 56307 56308 56309 56310 56311 56312 56313 56314 56315 56316 56317 56318 56319 56320 56321 56322 56323 56324 56325 56326 56327 56328 56329 56330 56331 56332 56333 56334 56335 56336 56337 56338 56339 56340 56341 56342 56343 56344 56345 56346 56347 56348 56349 56350 56351 56352 56353 56354 56355 56356 56357 56358 56359 56360 56361 56362 56363 56364 56365 56366 56367 56368 56369 56370 56371 56372 56373 56374 56375 56376 56377 56378 56379 56380 56381 56382 56383 56384 56385 56386 56387 56388 56389 56390 56391 56392 56393 56394 56395 56396 56397 56398 56399 56400 56401 56402 56403 56404 56405 56406 56407 56408 56409 56410 56411 56412 56413 56414 56415 56416 56417 56418 56419 56420 56421 56422 56423 56424 56425 56426 56427 56428 56429 56430 56431 56432 56433 56434 56435 56436 56437 56438 56439 56440 56441 56442 56443 56444 56445 56446 56447 56448 56449 56450 56451 56452 56453 56454 56455 56456 56457 56458 56459 56460 56461 56462 56463 56464 56465 56466 56467 56468 56469 56470 56471 56472 56473 56474 56475 56476 56477 56478 56479 56480 56481 56482 56483 56484 56485 56486 56487 56488 56489 56490 56491 56492 56493 56494 56495 56496 56497 56498 56499 56500 56501 56502 56503 56504 56505 56506 56507 56508 56509 56510 56511 56512 56513 56514 56515 56516 56517 56518 56519 56520 56521 56522 56523 56524 56525 56526 56527 56528 56529 56530 56531 56532 56533 56534 56535 56536 56537 56538 56539 56540 56541 56542 56543 56544 56545 56546 56547 56548 56549 56550 56551 56552 56553 56554 56555 56556 56557 56558 56559 56560 56561 56562 56563 56564 56565 56566 56567 56568 56569 56570 56571 56572 56573 56574 56575 56576 56577 56578 56579 56580 56581 56582 56583 56584 56585 56586 56587 56588 56589 56590 56591 56592 56593 56594 56595 56596 56597 56598 56599 56600 56601 56602 56603 56604 56605 56606 56607 56608 56609 56610 56611 56612 56613 56614 56615 56616 56617 56618 56619 56620 56621 56622 56623 56624 56625 56626 56627 56628 56629 56630 56631 56632 56633 56634 56635 56636 56637 56638 56639 56640 56641 56642 56643 56644 56645 56646 56647 56648 56649 56650 56651 56652 56653 56654 56655 56656 56657 56658 56659 56660 56661 56662 56663 56664 56665 56666 56667 56668 56669 56670 56671 56672 56673 56674 56675 56676 56677 56678 56679 56680 56681 56682 56683 56684 56685 56686 56687 56688 56689 56690 56691 56692 56693 56694 56695 56696 56697 56698 56699 56700 56701 56702 56703 56704 56705 56706 56707 56708 56709 56710 56711 56712 56713 56714 56715 56716 56717 56718 56719 56720 56721 56722 56723 56724 56725 56726 56727 56728 56729 56730 56731 56732 56733 56734 56735 56736 56737 56738 56739 56740 56741 56742 56743 56744 56745 56746 56747 56748 56749 56750 56751 56752 56753 56754 56755 56756 56757 56758 56759 56760 56761 56762 56763 56764 56765 56766 56767 56768 56769 56770 56771 56772 56773 56774 56775 56776 56777 56778 56779 56780 56781 56782 56783 56784 56785 56786 56787 56788 56789 56790 56791 56792 56793 56794 56795 56796 56797 56798 56799 56800 56801 56802 56803 56804 56805 56806 56807 56808 56809 56810 56811 56812 56813 56814 56815 56816 56817 56818 56819 56820 56821 56822 56823 56824 56825 56826 56827 56828 56829 56830 56831 56832 56833 56834 56835 56836 56837 56838 56839 56840 56841 56842 56843 56844 56845 56846 56847 56848 56849 56850 56851 56852 56853 56854 56855 56856 56857 56858 56859 56860 56861 56862 56863 56864 56865 56866 56867 56868 56869 56870 56871 56872 56873 56874 56875 56876 56877 56878 56879 56880 56881 56882 56883 56884 56885 56886 56887 56888 56889 56890 56891 56892 56893 56894 56895 56896 56897 56898 56899 56900 56901 56902 56903 56904 56905 56906 56907 56908 56909 56910 56911 56912 56913 56914 56915 56916 56917 56918 56919 56920 56921 56922 56923 56924 56925 56926 56927 56928 56929 56930 56931 56932 56933 56934 56935 56936 56937 56938 56939 56940 56941 56942 56943 56944 56945 56946 56947 56948 56949 56950 56951 56952 56953 56954 56955 56956 56957 56958 56959 56960 56961 56962 56963 56964 56965 56966 56967 56968 56969 56970 56971 56972 56973 56974 56975 56976 56977 56978 56979 56980 56981 56982 56983 56984 56985 56986 56987 56988 56989 56990 56991 56992 56993 56994 56995 56996 56997 56998 56999 57000 57001 57002 57003 57004 57005 57006 57007 57008 57009 57010 57011 57012 57013 57014 57015 57016 57017 57018 57019 57020 57021 57022 57023 57024 57025 57026 57027 57028 57029 57030 57031 57032 57033 57034 57035 57036 57037 57038 57039 57040 57041 57042 57043 57044 57045 57046 57047 57048 57049 57050 57051 57052 57053 57054 57055 57056 57057 57058 57059 57060 57061 57062 57063 57064 57065 57066 57067 57068 57069 57070 57071 57072 57073 57074 57075 57076 57077 57078 57079 57080 57081 57082 57083 57084 57085 57086 57087 57088 57089 57090 57091 57092 57093 57094 57095 57096 57097 57098 57099 57100 57101 57102 57103 57104 57105 57106 57107 57108 57109 57110 57111 57112 57113 57114 57115 57116 57117 57118 57119 57120 57121 57122 57123 57124 57125 57126 57127 57128 57129 57130 57131 57132 57133 57134 57135 57136 57137 57138 57139 57140 57141 57142 57143 57144 57145 57146 57147 57148 57149 57150 57151 57152 57153 57154 57155 57156 57157 57158 57159 57160 57161 57162 57163 57164 57165 57166 57167 57168 57169 57170 57171 57172 57173 57174 57175 57176 57177 57178 57179 57180 57181 57182 57183 57184 57185 57186 57187 57188 57189 57190 57191 57192 57193 57194 57195 57196 57197 57198 57199 57200 57201 57202 57203 57204 57205 57206 57207 57208 57209 57210 57211 57212 57213 57214 57215 57216 57217 57218 57219 57220 57221 57222 57223 57224 57225 57226 57227 57228 57229 57230 57231 57232 57233 57234 57235 57236 57237 57238 57239 57240 57241 57242 57243 57244 57245 57246 57247 57248 57249 57250 57251 57252 57253 57254 57255 57256 57257 57258 57259 57260 57261 57262 57263 57264 57265 57266 57267 57268 57269 57270 57271 57272 57273 57274 57275 57276 57277 57278 57279 57280 57281 57282 57283 57284 57285 57286 57287 57288 57289 57290 57291 57292 57293 57294 57295 57296 57297 57298 57299 57300 57301 57302 57303 57304 57305 57306 57307 57308 57309 57310 57311 57312 57313 57314 57315 57316 57317 57318 57319 57320 57321 57322 57323 57324 57325 57326 57327 57328 57329 57330 57331 57332 57333 57334 57335 57336 57337 57338 57339 57340 57341 57342 57343 57344 57345 57346 57347 57348 57349 57350 57351 57352 57353 57354 57355 57356 57357 57358 57359 57360 57361 57362 57363 57364 57365 57366 57367 57368 57369 57370 57371 57372 57373 57374 57375 57376 57377 57378 57379 57380 57381 57382 57383 57384 57385 57386 57387 57388 57389 57390 57391 57392 57393 57394 57395 57396 57397 57398 57399 57400 57401 57402 57403 57404 57405 57406 57407 57408 57409 57410 57411 57412 57413 57414 57415 57416 57417 57418 57419 57420 57421 57422 57423 57424 57425 57426 57427 57428 57429 57430 57431 57432 57433 57434 57435 57436 57437 57438 57439 57440 57441 57442 57443 57444 57445 57446 57447 57448 57449 57450 57451 57452 57453 57454 57455 57456 57457 57458 57459 57460 57461 57462 57463 57464 57465 57466 57467 57468 57469 57470 57471 57472 57473 57474 57475 57476 57477 57478 57479 57480 57481 57482 57483 57484 57485 57486 57487 57488 57489 57490 57491 57492 57493 57494 57495 57496 57497 57498 57499 57500 57501 57502 57503 57504 57505 57506 57507 57508 57509 57510 57511 57512 57513 57514 57515 57516 57517 57518 57519 57520 57521 57522 57523 57524 57525 57526 57527 57528 57529 57530 57531 57532 57533 57534 57535 57536 57537 57538 57539 57540 57541 57542 57543 57544 57545 57546 57547 57548 57549 57550 57551 57552 57553 57554 57555 57556 57557 57558 57559 57560 57561 57562 57563 57564 57565 57566 57567 57568 57569 57570 57571 57572 57573 57574 57575 57576 57577 57578 57579 57580 57581 57582 57583 57584 57585 57586 57587 57588 57589 57590 57591 57592 57593 57594 57595 57596 57597 57598 57599 57600 57601 57602 57603 57604 57605 57606 57607 57608 57609 57610 57611 57612 57613 57614 57615 57616 57617 57618 57619 57620 57621 57622 57623 57624 57625 57626 57627 57628 57629 57630 57631 57632 57633 57634 57635 57636 57637 57638 57639 57640 57641 57642 57643 57644 57645 57646 57647 57648 57649 57650 57651 57652 57653 57654 57655 57656 57657 57658 57659 57660 57661 57662 57663 57664 57665 57666 57667 57668 57669 57670 57671 57672 57673 57674 57675 57676 57677 57678 57679 57680 57681 57682 57683 57684 57685 57686 57687 57688 57689 57690 57691 57692 57693 57694 57695 57696 57697 57698 57699 57700 57701 57702 57703 57704 57705 57706 57707 57708 57709 57710 57711 57712 57713 57714 57715 57716 57717 57718 57719 57720 57721 57722 57723 57724 57725 57726 57727 57728 57729 57730 57731 57732 57733 57734 57735 57736 57737 57738 57739 57740 57741 57742 57743 57744 57745 57746 57747 57748 57749 57750 57751 57752 57753 57754 57755 57756 57757 57758 57759 57760 57761 57762 57763 57764 57765 57766 57767 57768 57769 57770 57771 57772 57773 57774 57775 57776 57777 57778 57779 57780 57781 57782 57783 57784 57785 57786 57787 57788 57789 57790 57791 57792 57793 57794 57795 57796 57797 57798 57799 57800 57801 57802 57803 57804 57805 57806 57807 57808 57809 57810 57811 57812 57813 57814 57815 57816 57817 57818 57819 57820 57821 57822 57823 57824 57825 57826 57827 57828 57829 57830 57831 57832 57833 57834 57835 57836 57837 57838 57839 57840 57841 57842 57843 57844 57845 57846 57847 57848 57849 57850 57851 57852 57853 57854 57855 57856 57857 57858 57859 57860 57861 57862 57863 57864 57865 57866 57867 57868 57869 57870 57871 57872 57873 57874 57875 57876 57877 57878 57879 57880 57881 57882 57883 57884 57885 57886 57887 57888 57889 57890 57891 57892 57893 57894 57895 57896 57897 57898 57899 57900 57901 57902 57903 57904 57905 57906 57907 57908 57909 57910 57911 57912 57913 57914 57915 57916 57917 57918 57919 57920 57921 57922 57923 57924 57925 57926 57927 57928 57929 57930 57931 57932 57933 57934 57935 57936 57937 57938 57939 57940 57941 57942 57943 57944 57945 57946 57947 57948 57949 57950 57951 57952 57953 57954 57955 57956 57957 57958 57959 57960 57961 57962 57963 57964 57965 57966 57967 57968 57969 57970 57971 57972 57973 57974 57975 57976 57977 57978 57979 57980 57981 57982 57983 57984 57985 57986 57987 57988 57989 57990 57991 57992 57993 57994 57995 57996 57997 57998 57999 58000 58001 58002 58003 58004 58005 58006 58007 58008 58009 58010 58011 58012 58013 58014 58015 58016 58017 58018 58019 58020 58021 58022 58023 58024 58025 58026 58027 58028 58029 58030 58031 58032 58033 58034 58035 58036 58037 58038 58039 58040 58041 58042 58043 58044 58045 58046 58047 58048 58049 58050 58051 58052 58053 58054 58055 58056 58057 58058 58059 58060 58061 58062 58063 58064 58065 58066 58067 58068 58069 58070 58071 58072 58073 58074 58075 58076 58077 58078 58079 58080 58081 58082 58083 58084 58085 58086 58087 58088 58089 58090 58091 58092 58093 58094 58095 58096 58097 58098 58099 58100 58101 58102 58103 58104 58105 58106 58107 58108 58109 58110 58111 58112 58113 58114 58115 58116 58117 58118 58119 58120 58121 58122 58123 58124 58125 58126 58127 58128 58129 58130 58131 58132 58133 58134 58135 58136 58137 58138 58139 58140 58141 58142 58143 58144 58145 58146 58147 58148 58149 58150 58151 58152 58153 58154 58155 58156 58157 58158 58159 58160 58161 58162 58163 58164 58165 58166 58167 58168 58169 58170 58171 58172 58173 58174 58175 58176 58177 58178 58179 58180 58181 58182 58183 58184 58185 58186 58187 58188 58189 58190 58191 58192 58193 58194 58195 58196 58197 58198 58199 58200 58201 58202 58203 58204 58205 58206 58207 58208 58209 58210 58211 58212 58213 58214 58215 58216 58217 58218 58219 58220 58221 58222 58223 58224 58225 58226 58227 58228 58229 58230 58231 58232 58233 58234 58235 58236 58237 58238 58239 58240 58241 58242 58243 58244 58245 58246 58247 58248 58249 58250 58251 58252 58253 58254 58255 58256 58257 58258 58259 58260 58261 58262 58263 58264 58265 58266 58267 58268 58269 58270 58271 58272 58273 58274 58275 58276 58277 58278 58279 58280 58281 58282 58283 58284 58285 58286 58287 58288 58289 58290 58291 58292 58293 58294 58295 58296 58297 58298 58299 58300 58301 58302 58303 58304 58305 58306 58307 58308 58309 58310 58311 58312 58313 58314 58315 58316 58317 58318 58319 58320 58321 58322 58323 58324 58325 58326 58327 58328 58329 58330 58331 58332 58333 58334 58335 58336 58337 58338 58339 58340 58341 58342 58343 58344 58345 58346 58347 58348 58349 58350 58351 58352 58353 58354 58355 58356 58357 58358 58359 58360 58361 58362 58363 58364 58365 58366 58367 58368 58369 58370 58371 58372 58373 58374 58375 58376 58377 58378 58379 58380 58381 58382 58383 58384 58385 58386 58387 58388 58389 58390 58391 58392 58393 58394 58395 58396 58397 58398 58399 58400 58401 58402 58403 58404 58405 58406 58407 58408 58409 58410 58411 58412 58413 58414 58415 58416 58417 58418 58419 58420 58421 58422 58423 58424 58425 58426 58427 58428 58429 58430 58431 58432 58433 58434 58435 58436 58437 58438 58439 58440 58441 58442 58443 58444 58445 58446 58447 58448 58449 58450 58451 58452 58453 58454 58455 58456 58457 58458 58459 58460 58461 58462 58463 58464 58465 58466 58467 58468 58469 58470 58471 58472 58473 58474 58475 58476 58477 58478 58479 58480 58481 58482 58483 58484 58485 58486 58487 58488 58489 58490 58491 58492 58493 58494 58495 58496 58497 58498 58499 58500 58501 58502 58503 58504 58505 58506 58507 58508 58509 58510 58511 58512 58513 58514 58515 58516 58517 58518 58519 58520 58521 58522 58523 58524 58525 58526 58527 58528 58529 58530 58531 58532 58533 58534 58535 58536 58537 58538 58539 58540 58541 58542 58543 58544 58545 58546 58547 58548 58549 58550 58551 58552 58553 58554 58555 58556 58557 58558 58559 58560 58561 58562 58563 58564 58565 58566 58567 58568 58569 58570 58571 58572 58573 58574 58575 58576 58577 58578 58579 58580 58581 58582 58583 58584 58585 58586 58587 58588 58589 58590 58591 58592 58593 58594 58595 58596 58597 58598 58599 58600 58601 58602 58603 58604 58605 58606 58607 58608 58609 58610 58611 58612 58613 58614 58615 58616 58617 58618 58619 58620 58621 58622 58623 58624 58625 58626 58627 58628 58629 58630 58631 58632 58633 58634 58635 58636 58637 58638 58639 58640 58641 58642 58643 58644 58645 58646 58647 58648 58649 58650 58651 58652 58653 58654 58655 58656 58657 58658 58659 58660 58661 58662 58663 58664 58665 58666 58667 58668 58669 58670 58671 58672 58673 58674 58675 58676 58677 58678 58679 58680 58681 58682 58683 58684 58685 58686 58687 58688 58689 58690 58691 58692 58693 58694 58695 58696 58697 58698 58699 58700 58701 58702 58703 58704 58705 58706 58707 58708 58709 58710 58711 58712 58713 58714 58715 58716 58717 58718 58719 58720 58721 58722 58723 58724 58725 58726 58727 58728 58729 58730 58731 58732 58733 58734 58735 58736 58737 58738 58739 58740 58741 58742 58743 58744 58745 58746 58747 58748 58749 58750 58751 58752 58753 58754 58755 58756 58757 58758 58759 58760 58761 58762 58763 58764 58765 58766 58767 58768 58769 58770 58771 58772 58773 58774 58775 58776 58777 58778 58779 58780 58781 58782 58783 58784 58785 58786 58787 58788 58789 58790 58791 58792 58793 58794 58795 58796 58797 58798 58799 58800 58801 58802 58803 58804 58805 58806 58807 58808 58809 58810 58811 58812 58813 58814 58815 58816 58817 58818 58819 58820 58821 58822 58823 58824 58825 58826 58827 58828 58829 58830 58831 58832 58833 58834 58835 58836 58837 58838 58839 58840 58841 58842 58843 58844 58845 58846 58847 58848 58849 58850 58851 58852 58853 58854 58855 58856 58857 58858 58859 58860 58861 58862 58863 58864 58865 58866 58867 58868 58869 58870 58871 58872 58873 58874 58875 58876 58877 58878 58879 58880 58881 58882 58883 58884 58885 58886 58887 58888 58889 58890 58891 58892 58893 58894 58895 58896 58897 58898 58899 58900 58901 58902 58903 58904 58905 58906 58907 58908 58909 58910 58911 58912 58913 58914 58915 58916 58917 58918 58919 58920 58921 58922 58923 58924 58925 58926 58927 58928 58929 58930 58931 58932 58933 58934 58935 58936 58937 58938 58939 58940 58941 58942 58943 58944 58945 58946 58947 58948 58949 58950 58951 58952 58953 58954 58955 58956 58957 58958 58959 58960 58961 58962 58963 58964 58965 58966 58967 58968 58969 58970 58971 58972 58973 58974 58975 58976 58977 58978 58979 58980 58981 58982 58983 58984 58985 58986 58987 58988 58989 58990 58991 58992 58993 58994 58995 58996 58997 58998 58999 59000 59001 59002 59003 59004 59005 59006 59007 59008 59009 59010 59011 59012 59013 59014 59015 59016 59017 59018 59019 59020 59021 59022 59023 59024 59025 59026 59027 59028 59029 59030 59031 59032 59033 59034 59035 59036 59037 59038 59039 59040 59041 59042 59043 59044 59045 59046 59047 59048 59049 59050 59051 59052 59053 59054 59055 59056 59057 59058 59059 59060 59061 59062 59063 59064 59065 59066 59067 59068 59069 59070 59071 59072 59073 59074 59075 59076 59077 59078 59079 59080 59081 59082 59083 59084 59085 59086 59087 59088 59089 59090 59091 59092 59093 59094 59095 59096 59097 59098 59099 59100 59101 59102 59103 59104 59105 59106 59107 59108 59109 59110 59111 59112 59113 59114 59115 59116 59117 59118 59119 59120 59121 59122 59123 59124 59125 59126 59127 59128 59129 59130 59131 59132 59133 59134 59135 59136 59137 59138 59139 59140 59141 59142 59143 59144 59145 59146 59147 59148 59149 59150 59151 59152 59153 59154 59155 59156 59157 59158 59159 59160 59161 59162 59163 59164 59165 59166 59167 59168 59169 59170 59171 59172 59173 59174 59175 59176 59177 59178 59179 59180 59181 59182 59183 59184 59185 59186 59187 59188 59189 59190 59191 59192 59193 59194 59195 59196 59197 59198 59199 59200 59201 59202 59203 59204 59205 59206 59207 59208 59209 59210 59211 59212 59213 59214 59215 59216 59217 59218 59219 59220 59221 59222 59223 59224 59225 59226 59227 59228 59229 59230 59231 59232 59233 59234 59235 59236 59237 59238 59239 59240 59241 59242 59243 59244 59245 59246 59247 59248 59249 59250 59251 59252 59253 59254 59255 59256 59257 59258 59259 59260 59261 59262 59263 59264 59265 59266 59267 59268 59269 59270 59271 59272 59273 59274 59275 59276 59277 59278 59279 59280 59281 59282 59283 59284 59285 59286 59287 59288 59289 59290 59291 59292 59293 59294 59295 59296 59297 59298 59299 59300 59301 59302 59303 59304 59305 59306 59307 59308 59309 59310 59311 59312 59313 59314 59315 59316 59317 59318 59319 59320 59321 59322 59323 59324 59325 59326 59327 59328 59329 59330 59331 59332 59333 59334 59335 59336 59337 59338 59339 59340 59341 59342 59343 59344 59345 59346 59347 59348 59349 59350 59351 59352 59353 59354 59355 59356 59357 59358 59359 59360 59361 59362 59363 59364 59365 59366 59367 59368 59369 59370 59371 59372 59373 59374 59375 59376 59377 59378 59379 59380 59381 59382 59383 59384 59385 59386 59387 59388 59389 59390 59391 59392 59393 59394 59395 59396 59397 59398 59399 59400 59401 59402 59403 59404 59405 59406 59407 59408 59409 59410 59411 59412 59413 59414 59415 59416 59417 59418 59419 59420 59421 59422 59423 59424 59425 59426 59427 59428 59429 59430 59431 59432 59433 59434 59435 59436 59437 59438 59439 59440 59441 59442 59443 59444 59445 59446 59447 59448 59449 59450 59451 59452 59453 59454 59455 59456 59457 59458 59459 59460 59461 59462 59463 59464 59465 59466 59467 59468 59469 59470 59471 59472 59473 59474 59475 59476 59477 59478 59479 59480 59481 59482 59483 59484 59485 59486 59487 59488 59489 59490 59491 59492 59493 59494 59495 59496 59497 59498 59499 59500 59501 59502 59503 59504 59505 59506 59507 59508 59509 59510 59511 59512 59513 59514 59515 59516 59517 59518 59519 59520 59521 59522 59523 59524 59525 59526 59527 59528 59529 59530 59531 59532 59533 59534 59535 59536 59537 59538 59539 59540 59541 59542 59543 59544 59545 59546 59547 59548 59549 59550 59551 59552 59553 59554 59555 59556 59557 59558 59559 59560 59561 59562 59563 59564 59565 59566 59567 59568 59569 59570 59571 59572 59573 59574 59575 59576 59577 59578 59579 59580 59581 59582 59583 59584 59585 59586 59587 59588 59589 59590 59591 59592 59593 59594 59595 59596 59597 59598 59599 59600 59601 59602 59603 59604 59605 59606 59607 59608 59609 59610 59611 59612 59613 59614 59615 59616 59617 59618 59619 59620 59621 59622 59623 59624 59625 59626 59627 59628 59629 59630 59631 59632 59633 59634 59635 59636 59637 59638 59639 59640 59641 59642 59643 59644 59645 59646 59647 59648 59649 59650 59651 59652 59653 59654 59655 59656 59657 59658 59659 59660 59661 59662 59663 59664 59665 59666 59667 59668 59669 59670 59671 59672 59673 59674 59675 59676 59677 59678 59679 59680 59681 59682 59683 59684 59685 59686 59687 59688 59689 59690 59691 59692 59693 59694 59695 59696 59697 59698 59699 59700 59701 59702 59703 59704 59705 59706 59707 59708 59709 59710 59711 59712 59713 59714 59715 59716 59717 59718 59719 59720 59721 59722 59723 59724 59725 59726 59727 59728 59729 59730 59731 59732 59733 59734 59735 59736 59737 59738 59739 59740 59741 59742 59743 59744 59745 59746 59747 59748 59749 59750 59751 59752 59753 59754 59755 59756 59757 59758 59759 59760 59761 59762 59763 59764 59765 59766 59767 59768 59769 59770 59771 59772 59773 59774 59775 59776 59777 59778 59779 59780 59781 59782 59783 59784 59785 59786 59787 59788 59789 59790 59791 59792 59793 59794 59795 59796 59797 59798 59799 59800 59801 59802 59803 59804 59805 59806 59807 59808 59809 59810 59811 59812 59813 59814 59815 59816 59817 59818 59819 59820 59821 59822 59823 59824 59825 59826 59827 59828 59829 59830 59831 59832 59833 59834 59835 59836 59837 59838 59839 59840 59841 59842 59843 59844 59845 59846 59847 59848 59849 59850 59851 59852 59853 59854 59855 59856 59857 59858 59859 59860 59861 59862 59863 59864 59865 59866 59867 59868 59869 59870 59871 59872 59873 59874 59875 59876 59877 59878 59879 59880 59881 59882 59883 59884 59885 59886 59887 59888 59889 59890 59891 59892 59893 59894 59895 59896 59897 59898 59899 59900 59901 59902 59903 59904 59905 59906 59907 59908 59909 59910 59911 59912 59913 59914 59915 59916 59917 59918 59919 59920 59921 59922 59923 59924 59925 59926 59927 59928 59929 59930 59931 59932 59933 59934 59935 59936 59937 59938 59939 59940 59941 59942 59943 59944 59945 59946 59947 59948 59949 59950 59951 59952 59953 59954 59955 59956 59957 59958 59959 59960 59961 59962 59963 59964 59965 59966 59967 59968 59969 59970 59971 59972 59973 59974 59975 59976 59977 59978 59979 59980 59981 59982 59983 59984 59985 59986 59987 59988 59989 59990 59991 59992 59993 59994 59995 59996 59997 59998 59999 60000 60001 60002 60003 60004 60005 60006 60007 60008 60009 60010 60011 60012 60013 60014 60015 60016 60017 60018 60019 60020 60021 60022 60023 60024 60025 60026 60027 60028 60029 60030 60031 60032 60033 60034 60035 60036 60037 60038 60039 60040 60041 60042 60043 60044 60045 60046 60047 60048 60049 60050 60051 60052 60053 60054 60055 60056 60057 60058 60059 60060 60061 60062 60063 60064 60065 60066 60067 60068 60069 60070 60071 60072 60073 60074 60075 60076 60077 60078 60079 60080 60081 60082 60083 60084 60085 60086 60087 60088 60089 60090 60091 60092 60093 60094 60095 60096 60097 60098 60099 60100 60101 60102 60103 60104 60105 60106 60107 60108 60109 60110 60111 60112 60113 60114 60115 60116 60117 60118 60119 60120 60121 60122 60123 60124 60125 60126 60127 60128 60129 60130 60131 60132 60133 60134 60135 60136 60137 60138 60139 60140 60141 60142 60143 60144 60145 60146 60147 60148 60149 60150 60151 60152 60153 60154 60155 60156 60157 60158 60159 60160 60161 60162 60163 60164 60165 60166 60167 60168 60169 60170 60171 60172 60173 60174 60175 60176 60177 60178 60179 60180 60181 60182 60183 60184 60185 60186 60187 60188 60189 60190 60191 60192 60193 60194 60195 60196 60197 60198 60199 60200 60201 60202 60203 60204 60205 60206 60207 60208 60209 60210 60211 60212 60213 60214 60215 60216 60217 60218 60219 60220 60221 60222 60223 60224 60225 60226 60227 60228 60229 60230 60231 60232 60233 60234 60235 60236 60237 60238 60239 60240 60241 60242 60243 60244 60245 60246 60247 60248 60249 60250 60251 60252 60253 60254 60255 60256 60257 60258 60259 60260 60261 60262 60263 60264 60265 60266 60267 60268 60269 60270 60271 60272 60273 60274 60275 60276 60277 60278 60279 60280 60281 60282 60283 60284 60285 60286 60287 60288 60289 60290 60291 60292 60293 60294 60295 60296 60297 60298 60299 60300 60301 60302 60303 60304 60305 60306 60307 60308 60309 60310 60311 60312 60313 60314 60315 60316 60317 60318 60319 60320 60321 60322 60323 60324 60325 60326 60327 60328 60329 60330 60331 60332 60333 60334 60335 60336 60337 60338 60339 60340 60341 60342 60343 60344 60345 60346 60347 60348 60349 60350 60351 60352 60353 60354 60355 60356 60357 60358 60359 60360 60361 60362 60363 60364 60365 60366 60367 60368 60369 60370 60371 60372 60373 60374 60375 60376 60377 60378 60379 60380 60381 60382 60383 60384 60385 60386 60387 60388 60389 60390 60391 60392 60393 60394 60395 60396 60397 60398 60399 60400 60401 60402 60403 60404 60405 60406 60407 60408 60409 60410 60411 60412 60413 60414 60415 60416 60417 60418 60419 60420 60421 60422 60423 60424 60425 60426 60427 60428 60429 60430 60431 60432 60433 60434 60435 60436 60437 60438 60439 60440 60441 60442 60443 60444 60445 60446 60447 60448 60449 60450 60451 60452 60453 60454 60455 60456 60457 60458 60459 60460 60461 60462 60463 60464 60465 60466 60467 60468 60469 60470 60471 60472 60473 60474 60475 60476 60477 60478 60479 60480 60481 60482 60483 60484 60485 60486 60487 60488 60489 60490 60491 60492 60493 60494 60495 60496 60497 60498 60499 60500 60501 60502 60503 60504 60505 60506 60507 60508 60509 60510 60511 60512 60513 60514 60515 60516 60517 60518 60519 60520 60521 60522 60523 60524 60525 60526 60527 60528 60529 60530 60531 60532 60533 60534 60535 60536 60537 60538 60539 60540 60541 60542 60543 60544 60545 60546 60547 60548 60549 60550 60551 60552 60553 60554 60555 60556 60557 60558 60559 60560 60561 60562 60563 60564 60565 60566 60567 60568 60569 60570 60571 60572 60573 60574 60575 60576 60577 60578 60579 60580 60581 60582 60583 60584 60585 60586 60587 60588 60589 60590 60591 60592 60593 60594 60595 60596 60597 60598 60599 60600 60601 60602 60603 60604 60605 60606 60607 60608 60609 60610 60611 60612 60613 60614 60615 60616 60617 60618 60619 60620 60621 60622 60623 60624 60625 60626 60627 60628 60629 60630 60631 60632 60633 60634 60635 60636 60637 60638 60639 60640 60641 60642 60643 60644 60645 60646 60647 60648 60649 60650 60651 60652 60653 60654 60655 60656 60657 60658 60659 60660 60661 60662 60663 60664 60665 60666 60667 60668 60669 60670 60671 60672 60673 60674 60675 60676 60677 60678 60679 60680 60681 60682 60683 60684 60685 60686 60687 60688 60689 60690 60691 60692 60693 60694 60695 60696 60697 60698 60699 60700 60701 60702 60703 60704 60705 60706 60707 60708 60709 60710 60711 60712 60713 60714 60715 60716 60717 60718 60719 60720 60721 60722 60723 60724 60725 60726 60727 60728 60729 60730 60731 60732 60733 60734 60735 60736 60737 60738 60739 60740 60741 60742 60743 60744 60745 60746 60747 60748 60749 60750 60751 60752 60753 60754 60755 60756 60757 60758 60759 60760 60761 60762 60763 60764 60765 60766 60767 60768 60769 60770 60771 60772 60773 60774 60775 60776 60777 60778 60779 60780 60781 60782 60783 60784 60785 60786 60787 60788 60789 60790 60791 60792 60793 60794 60795 60796 60797 60798 60799 60800 60801 60802 60803 60804 60805 60806 60807 60808 60809 60810 60811 60812 60813 60814 60815 60816 60817 60818 60819 60820 60821 60822 60823 60824 60825 60826 60827 60828 60829 60830 60831 60832 60833 60834 60835 60836 60837 60838 60839 60840 60841 60842 60843 60844 60845 60846 60847 60848 60849 60850 60851 60852 60853 60854 60855 60856 60857 60858 60859 60860 60861 60862 60863 60864 60865 60866 60867 60868 60869 60870 60871 60872 60873 60874 60875 60876 60877 60878 60879 60880 60881 60882 60883 60884 60885 60886 60887 60888 60889 60890 60891 60892 60893 60894 60895 60896 60897 60898 60899 60900 60901 60902 60903 60904 60905 60906 60907 60908 60909 60910 60911 60912 60913 60914 60915 60916 60917 60918 60919 60920 60921 60922 60923 60924 60925 60926 60927 60928 60929 60930 60931 60932 60933 60934 60935 60936 60937 60938 60939 60940 60941 60942 60943 60944 60945 60946 60947 60948 60949 60950 60951 60952 60953 60954 60955 60956 60957 60958 60959 60960 60961 60962 60963 60964 60965 60966 60967 60968 60969 60970 60971 60972 60973 60974 60975 60976 60977 60978 60979 60980 60981 60982 60983 60984 60985 60986 60987 60988 60989 60990 60991 60992 60993 60994 60995 60996 60997 60998 60999 61000 61001 61002 61003 61004 61005 61006 61007 61008 61009 61010 61011 61012 61013 61014 61015 61016 61017 61018 61019 61020 61021 61022 61023 61024 61025 61026 61027 61028 61029 61030 61031 61032 61033 61034 61035 61036 61037 61038 61039 61040 61041 61042 61043 61044 61045 61046 61047 61048 61049 61050 61051 61052 61053 61054 61055 61056 61057 61058 61059 61060 61061 61062 61063 61064 61065 61066 61067 61068 61069 61070 61071 61072 61073 61074 61075 61076 61077 61078 61079 61080 61081 61082 61083 61084 61085 61086 61087 61088 61089 61090 61091 61092 61093 61094 61095 61096 61097 61098 61099 61100 61101 61102 61103 61104 61105 61106 61107 61108 61109 61110 61111 61112 61113 61114 61115 61116 61117 61118 61119 61120 61121 61122 61123 61124 61125 61126 61127 61128 61129 61130 61131 61132 61133 61134 61135 61136 61137 61138 61139 61140 61141 61142 61143 61144 61145 61146 61147 61148 61149 61150 61151 61152 61153 61154 61155 61156 61157 61158 61159 61160 61161 61162 61163 61164 61165 61166 61167 61168 61169 61170 61171 61172 61173 61174 61175 61176 61177 61178 61179 61180 61181 61182 61183 61184 61185 61186 61187 61188 61189 61190 61191 61192 61193 61194 61195 61196 61197 61198 61199 61200 61201 61202 61203 61204 61205 61206 61207 61208 61209 61210 61211 61212 61213 61214 61215 61216 61217 61218 61219 61220 61221 61222 61223 61224 61225 61226 61227 61228 61229 61230 61231 61232 61233 61234 61235 61236 61237 61238 61239 61240 61241 61242 61243 61244 61245 61246 61247 61248 61249 61250 61251 61252 61253 61254 61255 61256 61257 61258 61259 61260 61261 61262 61263 61264 61265 61266 61267 61268 61269 61270 61271 61272 61273 61274 61275 61276 61277 61278 61279 61280 61281 61282 61283 61284 61285 61286 61287 61288 61289 61290 61291 61292 61293 61294 61295 61296 61297 61298 61299 61300 61301 61302 61303 61304 61305 61306 61307 61308 61309 61310 61311 61312 61313 61314 61315 61316 61317 61318 61319 61320 61321 61322 61323 61324 61325 61326 61327 61328 61329 61330 61331 61332 61333 61334 61335 61336 61337 61338 61339 61340 61341 61342 61343 61344 61345 61346 61347 61348 61349 61350 61351 61352 61353 61354 61355 61356 61357 61358 61359 61360 61361 61362 61363 61364 61365 61366 61367 61368 61369 61370 61371 61372 61373 61374 61375 61376 61377 61378 61379 61380 61381 61382 61383 61384 61385 61386 61387 61388 61389 61390 61391 61392 61393 61394 61395 61396 61397 61398 61399 61400 61401 61402 61403 61404 61405 61406 61407 61408 61409 61410 61411 61412 61413 61414 61415 61416 61417 61418 61419 61420 61421 61422 61423 61424 61425 61426 61427 61428 61429 61430 61431 61432 61433 61434 61435 61436 61437 61438 61439 61440 61441 61442 61443 61444 61445 61446 61447 61448 61449 61450 61451 61452 61453 61454 61455 61456 61457 61458 61459 61460 61461 61462 61463 61464 61465 61466 61467 61468 61469 61470 61471 61472 61473 61474 61475 61476 61477 61478 61479 61480 61481 61482 61483 61484 61485 61486 61487 61488 61489 61490 61491 61492 61493 61494 61495 61496 61497 61498 61499 61500 61501 61502 61503 61504 61505 61506 61507 61508 61509 61510 61511 61512 61513 61514 61515 61516 61517 61518 61519 61520 61521 61522 61523 61524 61525 61526 61527 61528 61529 61530 61531 61532 61533 61534 61535 61536 61537 61538 61539 61540 61541 61542 61543 61544 61545 61546 61547 61548 61549 61550 61551 61552 61553 61554 61555 61556 61557 61558 61559 61560 61561 61562 61563 61564 61565 61566 61567 61568 61569 61570 61571 61572 61573 61574 61575 61576 61577 61578 61579 61580 61581 61582 61583 61584 61585 61586 61587 61588 61589 61590 61591 61592 61593 61594 61595 61596 61597 61598 61599 61600 61601 61602 61603 61604 61605 61606 61607 61608 61609 61610 61611 61612 61613 61614 61615 61616 61617 61618 61619 61620 61621 61622 61623 61624 61625 61626 61627 61628 61629 61630 61631 61632 61633 61634 61635 61636 61637 61638 61639 61640 61641 61642 61643 61644 61645 61646 61647 61648 61649 61650 61651 61652 61653 61654 61655 61656 61657 61658 61659 61660 61661 61662 61663 61664 61665 61666 61667 61668 61669 61670 61671 61672 61673 61674 61675 61676 61677 61678 61679 61680 61681 61682 61683 61684 61685 61686 61687 61688 61689 61690 61691 61692 61693 61694 61695 61696 61697 61698 61699 61700 61701 61702 61703 61704 61705 61706 61707 61708 61709 61710 61711 61712 61713 61714 61715 61716 61717 61718 61719 61720 61721 61722 61723 61724 61725 61726 61727 61728 61729 61730 61731 61732 61733 61734 61735 61736 61737 61738 61739 61740 61741 61742 61743 61744 61745 61746 61747 61748 61749 61750 61751 61752 61753 61754 61755 61756 61757 61758 61759 61760 61761 61762 61763 61764 61765 61766 61767 61768 61769 61770 61771 61772 61773 61774 61775 61776 61777 61778 61779 61780 61781 61782 61783 61784 61785 61786 61787 61788 61789 61790 61791 61792 61793 61794 61795 61796 61797 61798 61799 61800 61801 61802 61803 61804 61805 61806 61807 61808 61809 61810 61811 61812 61813 61814 61815 61816 61817 61818 61819 61820 61821 61822 61823 61824 61825 61826 61827 61828 61829 61830 61831 61832 61833 61834 61835 61836 61837 61838 61839 61840 61841 61842 61843 61844 61845 61846 61847 61848 61849 61850 61851 61852 61853 61854 61855 61856 61857 61858 61859 61860 61861 61862 61863 61864 61865 61866 61867 61868 61869 61870 61871 61872 61873 61874 61875 61876 61877 61878 61879 61880 61881 61882 61883 61884 61885 61886 61887 61888 61889 61890 61891 61892 61893 61894 61895 61896 61897 61898 61899 61900 61901 61902 61903 61904 61905 61906 61907 61908 61909 61910 61911 61912 61913 61914 61915 61916 61917 61918 61919 61920 61921 61922 61923 61924 61925 61926 61927 61928 61929 61930 61931 61932 61933 61934 61935 61936 61937 61938 61939 61940 61941 61942 61943 61944 61945 61946 61947 61948 61949 61950 61951 61952 61953 61954 61955 61956 61957 61958 61959 61960 61961 61962 61963 61964 61965 61966 61967 61968 61969 61970 61971 61972 61973 61974 61975 61976 61977 61978 61979 61980 61981 61982 61983 61984 61985 61986 61987 61988 61989 61990 61991 61992 61993 61994 61995 61996 61997 61998 61999 62000 62001 62002 62003 62004 62005 62006 62007 62008 62009 62010 62011 62012 62013 62014 62015 62016 62017 62018 62019 62020 62021 62022 62023 62024 62025 62026 62027 62028 62029 62030 62031 62032 62033 62034 62035 62036 62037 62038 62039 62040 62041 62042 62043 62044 62045 62046 62047 62048 62049 62050 62051 62052 62053 62054 62055 62056 62057 62058 62059 62060 62061 62062 62063 62064 62065 62066 62067 62068 62069 62070 62071 62072 62073 62074 62075 62076 62077 62078 62079 62080 62081 62082 62083 62084 62085 62086 62087 62088 62089 62090 62091 62092 62093 62094 62095 62096 62097 62098 62099 62100 62101 62102 62103 62104 62105 62106 62107 62108 62109 62110 62111 62112 62113 62114 62115 62116 62117 62118 62119 62120 62121 62122 62123 62124 62125 62126 62127 62128 62129 62130 62131 62132 62133 62134 62135 62136 62137 62138 62139 62140 62141 62142 62143 62144 62145 62146 62147 62148 62149 62150 62151 62152 62153 62154 62155 62156 62157 62158 62159 62160 62161 62162 62163 62164 62165 62166 62167 62168 62169 62170 62171 62172 62173 62174 62175 62176 62177 62178 62179 62180 62181 62182 62183 62184 62185 62186 62187 62188 62189 62190 62191 62192 62193 62194 62195 62196 62197 62198 62199 62200 62201 62202 62203 62204 62205 62206 62207 62208 62209 62210 62211 62212 62213 62214 62215 62216 62217 62218 62219 62220 62221 62222 62223 62224 62225 62226 62227 62228 62229 62230 62231 62232 62233 62234 62235 62236 62237 62238 62239 62240 62241 62242 62243 62244 62245 62246 62247 62248 62249 62250 62251 62252 62253 62254 62255 62256 62257 62258 62259 62260 62261 62262 62263 62264 62265 62266 62267 62268 62269 62270 62271 62272 62273 62274 62275 62276 62277 62278 62279 62280 62281 62282 62283 62284 62285 62286 62287 62288 62289 62290 62291 62292 62293 62294 62295 62296 62297 62298 62299 62300 62301 62302 62303 62304 62305 62306 62307 62308 62309 62310 62311 62312 62313 62314 62315 62316 62317 62318 62319 62320 62321 62322 62323 62324 62325 62326 62327 62328 62329 62330 62331 62332 62333 62334 62335 62336 62337 62338 62339 62340 62341 62342 62343 62344 62345 62346 62347 62348 62349 62350 62351 62352 62353 62354 62355 62356 62357 62358 62359 62360 62361 62362 62363 62364 62365 62366 62367 62368 62369 62370 62371 62372 62373 62374 62375 62376 62377 62378 62379 62380 62381 62382 62383 62384 62385 62386 62387 62388 62389 62390 62391 62392 62393 62394 62395 62396 62397 62398 62399 62400 62401 62402 62403 62404 62405 62406 62407 62408 62409 62410 62411 62412 62413 62414 62415 62416 62417 62418 62419 62420 62421 62422 62423 62424 62425 62426 62427 62428 62429 62430 62431 62432 62433 62434 62435 62436 62437 62438 62439 62440 62441 62442 62443 62444 62445 62446 62447 62448 62449 62450 62451 62452 62453 62454 62455 62456 62457 62458 62459 62460 62461 62462 62463 62464 62465 62466 62467 62468 62469 62470 62471 62472 62473 62474 62475 62476 62477 62478 62479 62480 62481 62482 62483 62484 62485 62486 62487 62488 62489 62490 62491 62492 62493 62494 62495 62496 62497 62498 62499 62500 62501 62502 62503 62504 62505 62506 62507 62508 62509 62510 62511 62512 62513 62514 62515 62516 62517 62518 62519 62520 62521 62522 62523 62524 62525 62526 62527 62528 62529 62530 62531 62532 62533 62534 62535 62536 62537 62538 62539 62540 62541 62542 62543 62544 62545 62546 62547 62548 62549 62550 62551 62552 62553 62554 62555 62556 62557 62558 62559 62560 62561 62562 62563 62564 62565 62566 62567 62568 62569 62570 62571 62572 62573 62574 62575 62576 62577 62578 62579 62580 62581 62582 62583 62584 62585 62586 62587 62588 62589 62590 62591 62592 62593 62594 62595 62596 62597 62598 62599 62600 62601 62602 62603 62604 62605 62606 62607 62608 62609 62610 62611 62612 62613 62614 62615 62616 62617 62618 62619 62620 62621 62622 62623 62624 62625 62626 62627 62628 62629 62630 62631 62632 62633 62634 62635 62636 62637 62638 62639 62640 62641 62642 62643 62644 62645 62646 62647 62648 62649 62650 62651 62652 62653 62654 62655 62656 62657 62658 62659 62660 62661 62662 62663 62664 62665 62666 62667 62668 62669 62670 62671 62672 62673 62674 62675 62676 62677 62678 62679 62680 62681 62682 62683 62684 62685 62686 62687 62688 62689 62690 62691 62692 62693 62694 62695 62696 62697 62698 62699 62700 62701 62702 62703 62704 62705 62706 62707 62708 62709 62710 62711 62712 62713 62714 62715 62716 62717 62718 62719 62720 62721 62722 62723 62724 62725 62726 62727 62728 62729 62730 62731 62732 62733 62734 62735 62736 62737 62738 62739 62740 62741 62742 62743 62744 62745 62746 62747 62748 62749 62750 62751 62752 62753 62754 62755 62756 62757 62758 62759 62760 62761 62762 62763 62764 62765 62766 62767 62768 62769 62770 62771 62772 62773 62774 62775 62776 62777 62778 62779 62780 62781 62782 62783 62784 62785 62786 62787 62788 62789 62790 62791 62792 62793 62794 62795 62796 62797 62798 62799 62800 62801 62802 62803 62804 62805 62806 62807 62808 62809 62810 62811 62812 62813 62814 62815 62816 62817 62818 62819 62820 62821 62822 62823 62824 62825 62826 62827 62828 62829 62830 62831 62832 62833 62834 62835 62836 62837 62838 62839 62840 62841 62842 62843 62844 62845 62846 62847 62848 62849 62850 62851 62852 62853 62854 62855 62856 62857 62858 62859 62860 62861 62862 62863 62864 62865 62866 62867 62868 62869 62870 62871 62872 62873 62874 62875 62876 62877 62878 62879 62880 62881 62882 62883 62884 62885 62886 62887 62888 62889 62890 62891 62892 62893 62894 62895 62896 62897 62898 62899 62900 62901 62902 62903 62904 62905 62906 62907 62908 62909 62910 62911 62912 62913 62914 62915 62916 62917 62918 62919 62920 62921 62922 62923 62924 62925 62926 62927 62928 62929 62930 62931 62932 62933 62934 62935 62936 62937 62938 62939 62940 62941 62942 62943 62944 62945 62946 62947 62948 62949 62950 62951 62952 62953 62954 62955 62956 62957 62958 62959 62960 62961 62962 62963 62964 62965 62966 62967 62968 62969 62970 62971 62972 62973 62974 62975 62976 62977 62978 62979 62980 62981 62982 62983 62984 62985 62986 62987 62988 62989 62990 62991 62992 62993 62994 62995 62996 62997 62998 62999 63000 63001 63002 63003 63004 63005 63006 63007 63008 63009 63010 63011 63012 63013 63014 63015 63016 63017 63018 63019 63020 63021 63022 63023 63024 63025 63026 63027 63028 63029 63030 63031 63032 63033 63034 63035 63036 63037 63038 63039 63040 63041 63042 63043 63044 63045 63046 63047 63048 63049 63050 63051 63052 63053 63054 63055 63056 63057 63058 63059 63060 63061 63062 63063 63064 63065 63066 63067 63068 63069 63070 63071 63072 63073 63074 63075 63076 63077 63078 63079 63080 63081 63082 63083 63084 63085 63086 63087 63088 63089 63090 63091 63092 63093 63094 63095 63096 63097 63098 63099 63100 63101 63102 63103 63104 63105 63106 63107 63108 63109 63110 63111 63112 63113 63114 63115 63116 63117 63118 63119 63120 63121 63122 63123 63124 63125 63126 63127 63128 63129 63130 63131 63132 63133 63134 63135 63136 63137 63138 63139 63140 63141 63142 63143 63144 63145 63146 63147 63148 63149 63150 63151 63152 63153 63154 63155 63156 63157 63158 63159 63160 63161 63162 63163 63164 63165 63166 63167 63168 63169 63170 63171 63172 63173 63174 63175 63176 63177 63178 63179 63180 63181 63182 63183 63184 63185 63186 63187 63188 63189 63190 63191 63192 63193 63194 63195 63196 63197 63198 63199 63200 63201 63202 63203 63204 63205 63206 63207 63208 63209 63210 63211 63212 63213 63214 63215 63216 63217 63218 63219 63220 63221 63222 63223 63224 63225 63226 63227 63228 63229 63230 63231 63232 63233 63234 63235 63236 63237 63238 63239 63240 63241 63242 63243 63244 63245 63246 63247 63248 63249 63250 63251 63252 63253 63254 63255 63256 63257 63258 63259 63260 63261 63262 63263 63264 63265 63266 63267 63268 63269 63270 63271 63272 63273 63274 63275 63276 63277 63278 63279 63280 63281 63282 63283 63284 63285 63286 63287 63288 63289 63290 63291 63292 63293 63294 63295 63296 63297 63298 63299 63300 63301 63302 63303 63304 63305 63306 63307 63308 63309 63310 63311 63312 63313 63314 63315 63316 63317 63318 63319 63320 63321 63322 63323 63324 63325 63326 63327 63328 63329 63330 63331 63332 63333 63334 63335 63336 63337 63338 63339 63340 63341 63342 63343 63344 63345 63346 63347 63348 63349 63350 63351 63352 63353 63354 63355 63356 63357 63358 63359 63360 63361 63362 63363 63364 63365 63366 63367 63368 63369 63370 63371 63372 63373 63374 63375 63376 63377 63378 63379 63380 63381 63382 63383 63384 63385 63386 63387 63388 63389 63390 63391 63392 63393 63394 63395 63396 63397 63398 63399 63400 63401 63402 63403 63404 63405 63406 63407 63408 63409 63410 63411 63412 63413 63414 63415 63416 63417 63418 63419 63420 63421 63422 63423 63424 63425 63426 63427 63428 63429 63430 63431 63432 63433 63434 63435 63436 63437 63438 63439 63440 63441 63442 63443 63444 63445 63446 63447 63448 63449 63450 63451 63452 63453 63454 63455 63456 63457 63458 63459 63460 63461 63462 63463 63464 63465 63466 63467 63468 63469 63470 63471 63472 63473 63474 63475 63476 63477 63478 63479 63480 63481 63482 63483 63484 63485 63486 63487 63488 63489 63490 63491 63492 63493 63494 63495 63496 63497 63498 63499 63500 63501 63502 63503 63504 63505 63506 63507 63508 63509 63510 63511 63512 63513 63514 63515 63516 63517 63518 63519 63520 63521 63522 63523 63524 63525 63526 63527 63528 63529 63530 63531 63532 63533 63534 63535 63536 63537 63538 63539 63540 63541 63542 63543 63544 63545 63546 63547 63548 63549 63550 63551 63552 63553 63554 63555 63556 63557 63558 63559 63560 63561 63562 63563 63564 63565 63566 63567 63568 63569 63570 63571 63572 63573 63574 63575 63576 63577 63578 63579 63580 63581 63582 63583 63584 63585 63586 63587 63588 63589 63590 63591 63592 63593 63594 63595 63596 63597 63598 63599 63600 63601 63602 63603 63604 63605 63606 63607 63608 63609 63610 63611 63612 63613 63614 63615 63616 63617 63618 63619 63620 63621 63622 63623 63624 63625 63626 63627 63628 63629 63630 63631 63632 63633 63634 63635 63636 63637 63638 63639 63640 63641 63642 63643 63644 63645 63646 63647 63648 63649 63650 63651 63652 63653 63654 63655 63656 63657 63658 63659 63660 63661 63662 63663 63664 63665 63666 63667 63668 63669 63670 63671 63672 63673 63674 63675 63676 63677 63678 63679 63680 63681 63682 63683 63684 63685 63686 63687 63688 63689 63690 63691 63692 63693 63694 63695 63696 63697 63698 63699 63700 63701 63702 63703 63704 63705 63706 63707 63708 63709 63710 63711 63712 63713 63714 63715 63716 63717 63718 63719 63720 63721 63722 63723 63724 63725 63726 63727 63728 63729 63730 63731 63732 63733 63734 63735 63736 63737 63738 63739 63740 63741 63742 63743 63744 63745 63746 63747 63748 63749 63750 63751 63752 63753 63754 63755 63756 63757 63758 63759 63760 63761 63762 63763 63764 63765 63766 63767 63768 63769 63770 63771 63772 63773 63774 63775 63776 63777 63778 63779 63780 63781 63782 63783 63784 63785 63786 63787 63788 63789 63790 63791 63792 63793 63794 63795 63796 63797 63798 63799 63800 63801 63802 63803 63804 63805 63806 63807 63808 63809 63810 63811 63812 63813 63814 63815 63816 63817 63818 63819 63820 63821 63822 63823 63824 63825 63826 63827 63828 63829 63830 63831 63832 63833 63834 63835 63836 63837 63838 63839 63840 63841 63842 63843 63844 63845 63846 63847 63848 63849 63850 63851 63852 63853 63854 63855 63856 63857 63858 63859 63860 63861 63862 63863 63864 63865 63866 63867 63868 63869 63870 63871 63872 63873 63874 63875 63876 63877 63878 63879 63880 63881 63882 63883 63884 63885 63886 63887 63888 63889 63890 63891 63892 63893 63894 63895 63896 63897 63898 63899 63900 63901 63902 63903 63904 63905 63906 63907 63908 63909 63910 63911 63912 63913 63914 63915 63916 63917 63918 63919 63920 63921 63922 63923 63924 63925 63926 63927 63928 63929 63930 63931 63932 63933 63934 63935 63936 63937 63938 63939 63940 63941 63942 63943 63944 63945 63946 63947 63948 63949 63950 63951 63952 63953 63954 63955 63956 63957 63958 63959 63960 63961 63962 63963 63964 63965 63966 63967 63968 63969 63970 63971 63972 63973 63974 63975 63976 63977 63978 63979 63980 63981 63982 63983 63984 63985 63986 63987 63988 63989 63990 63991 63992 63993 63994 63995 63996 63997 63998 63999 64000 64001 64002 64003 64004 64005 64006 64007 64008 64009 64010 64011 64012 64013 64014 64015 64016 64017 64018 64019 64020 64021 64022 64023 64024 64025 64026 64027 64028 64029 64030 64031 64032 64033 64034 64035 64036 64037 64038 64039 64040 64041 64042 64043 64044 64045 64046 64047 64048 64049 64050 64051 64052 64053 64054 64055 64056 64057 64058 64059 64060 64061 64062 64063 64064 64065 64066 64067 64068 64069 64070 64071 64072 64073 64074 64075 64076 64077 64078 64079 64080 64081 64082 64083 64084 64085 64086 64087 64088 64089 64090 64091 64092 64093 64094 64095 64096 64097 64098 64099 64100 64101 64102 64103 64104 64105 64106 64107 64108 64109 64110 64111 64112 64113 64114 64115 64116 64117 64118 64119 64120 64121 64122 64123 64124 64125 64126 64127 64128 64129 64130 64131 64132 64133 64134 64135 64136 64137 64138 64139 64140 64141 64142 64143 64144 64145 64146 64147 64148 64149 64150 64151 64152 64153 64154 64155 64156 64157 64158 64159 64160 64161 64162 64163 64164 64165 64166 64167 64168 64169 64170 64171 64172 64173 64174 64175 64176 64177 64178 64179 64180 64181 64182 64183 64184 64185 64186 64187 64188 64189 64190 64191 64192 64193 64194 64195 64196 64197 64198 64199 64200 64201 64202 64203 64204 64205 64206 64207 64208 64209 64210 64211 64212 64213 64214 64215 64216 64217 64218 64219 64220 64221 64222 64223 64224 64225 64226 64227 64228 64229 64230 64231 64232 64233 64234 64235 64236 64237 64238 64239 64240 64241 64242 64243 64244 64245 64246 64247 64248 64249 64250 64251 64252 64253 64254 64255 64256 64257 64258 64259 64260 64261 64262 64263 64264 64265 64266 64267 64268 64269 64270 64271 64272 64273 64274 64275 64276 64277 64278 64279 64280 64281 64282 64283 64284 64285 64286 64287 64288 64289 64290 64291 64292 64293 64294 64295 64296 64297 64298 64299 64300 64301 64302 64303 64304 64305 64306 64307 64308 64309 64310 64311 64312 64313 64314 64315 64316 64317 64318 64319 64320 64321 64322 64323 64324 64325 64326 64327 64328 64329 64330 64331 64332 64333 64334 64335 64336 64337 64338 64339 64340 64341 64342 64343 64344 64345 64346 64347 64348 64349 64350 64351 64352 64353 64354 64355 64356 64357 64358 64359 64360 64361 64362 64363 64364 64365 64366 64367 64368 64369 64370 64371 64372 64373 64374 64375 64376 64377 64378 64379 64380 64381 64382 64383 64384 64385 64386 64387 64388 64389 64390 64391 64392 64393 64394 64395 64396 64397 64398 64399 64400 64401 64402 64403 64404 64405 64406 64407 64408 64409 64410 64411 64412 64413 64414 64415 64416 64417 64418 64419 64420 64421 64422 64423 64424 64425 64426 64427 64428 64429 64430 64431 64432 64433 64434 64435 64436 64437 64438 64439 64440 64441 64442 64443 64444 64445 64446 64447 64448 64449 64450 64451 64452 64453 64454 64455 64456 64457 64458 64459 64460 64461 64462 64463 64464 64465 64466 64467 64468 64469 64470 64471 64472 64473 64474 64475 64476 64477 64478 64479 64480 64481 64482 64483 64484 64485 64486 64487 64488 64489 64490 64491 64492 64493 64494 64495 64496 64497 64498 64499 64500 64501 64502 64503 64504 64505 64506 64507 64508 64509 64510 64511 64512 64513 64514 64515 64516 64517 64518 64519 64520 64521 64522 64523 64524 64525 64526 64527 64528 64529 64530 64531 64532 64533 64534 64535 64536 64537 64538 64539 64540 64541 64542 64543 64544 64545 64546 64547 64548 64549 64550 64551 64552 64553 64554 64555 64556 64557 64558 64559 64560 64561 64562 64563 64564 64565 64566 64567 64568 64569 64570 64571 64572 64573 64574 64575 64576 64577 64578 64579 64580 64581 64582 64583 64584 64585 64586 64587 64588 64589 64590 64591 64592 64593 64594 64595 64596 64597 64598 64599 64600 64601 64602 64603 64604 64605 64606 64607 64608 64609 64610 64611 64612 64613 64614 64615 64616 64617 64618 64619 64620 64621 64622 64623 64624 64625 64626 64627 64628 64629 64630 64631 64632 64633 64634 64635 64636 64637 64638 64639 64640 64641 64642 64643 64644 64645 64646 64647 64648 64649 64650 64651 64652 64653 64654 64655 64656 64657 64658 64659 64660 64661 64662 64663 64664 64665 64666 64667 64668 64669 64670 64671 64672 64673 64674 64675 64676 64677 64678 64679 64680 64681 64682 64683 64684 64685 64686 64687 64688 64689 64690 64691 64692 64693 64694 64695 64696 64697 64698 64699 64700 64701 64702 64703 64704 64705 64706 64707 64708 64709 64710 64711 64712 64713 64714 64715 64716 64717 64718 64719 64720 64721 64722 64723 64724 64725 64726 64727 64728 64729 64730 64731 64732 64733 64734 64735 64736 64737 64738 64739 64740 64741 64742 64743 64744 64745 64746 64747 64748 64749 64750 64751 64752 64753 64754 64755 64756 64757 64758 64759 64760 64761 64762 64763 64764 64765 64766 64767 64768 64769 64770 64771 64772 64773 64774 64775 64776 64777 64778 64779 64780 64781 64782 64783 64784 64785 64786 64787 64788 64789 64790 64791 64792 64793 64794 64795 64796 64797 64798 64799 64800 64801 64802 64803 64804 64805 64806 64807 64808 64809 64810 64811 64812 64813 64814 64815 64816 64817 64818 64819 64820 64821 64822 64823 64824 64825 64826 64827 64828 64829 64830 64831 64832 64833 64834 64835 64836 64837 64838 64839 64840 64841 64842 64843 64844 64845 64846 64847 64848 64849 64850 64851 64852 64853 64854 64855 64856 64857 64858 64859 64860 64861 64862 64863 64864 64865 64866 64867 64868 64869 64870 64871 64872 64873 64874 64875 64876 64877 64878 64879 64880 64881 64882 64883 64884 64885 64886 64887 64888 64889 64890 64891 64892 64893 64894 64895 64896 64897 64898 64899 64900 64901 64902 64903 64904 64905 64906 64907 64908 64909 64910 64911 64912 64913 64914 64915 64916 64917 64918 64919 64920 64921 64922 64923 64924 64925 64926 64927 64928 64929 64930 64931 64932 64933 64934 64935 64936 64937 64938 64939 64940 64941 64942 64943 64944 64945 64946 64947 64948 64949 64950 64951 64952 64953 64954 64955 64956 64957 64958 64959 64960 64961 64962 64963 64964 64965 64966 64967 64968 64969 64970 64971 64972 64973 64974 64975 64976 64977 64978 64979 64980 64981 64982 64983 64984 64985 64986 64987 64988 64989 64990 64991 64992 64993 64994 64995 64996 64997 64998 64999 65000 65001 65002 65003 65004 65005 65006 65007 65008 65009 65010 65011 65012 65013 65014 65015 65016 65017 65018 65019 65020 65021 65022 65023 65024 65025 65026 65027 65028 65029 65030 65031 65032 65033 65034 65035 65036 65037 65038 65039 65040 65041 65042 65043 65044 65045 65046 65047 65048 65049 65050 65051 65052 65053 65054 65055 65056 65057 65058 65059 65060 65061 65062 65063 65064 65065 65066 65067 65068 65069 65070 65071 65072 65073 65074 65075 65076 65077 65078 65079 65080 65081 65082 65083 65084 65085 65086 65087 65088 65089 65090 65091 65092 65093 65094 65095 65096 65097 65098 65099 65100 65101 65102 65103 65104 65105 65106 65107 65108 65109 65110 65111 65112 65113 65114 65115 65116 65117 65118 65119 65120 65121 65122 65123 65124 65125 65126 65127 65128 65129 65130 65131 65132 65133 65134 65135 65136 65137 65138 65139 65140 65141 65142 65143 65144 65145 65146 65147 65148 65149 65150 65151 65152 65153 65154 65155 65156 65157 65158 65159 65160 65161 65162 65163 65164 65165 65166 65167 65168 65169 65170 65171 65172 65173 65174 65175 65176 65177 65178 65179 65180 65181 65182 65183 65184 65185 65186 65187 65188 65189 65190 65191 65192 65193 65194 65195 65196 65197 65198 65199 65200 65201 65202 65203 65204 65205 65206 65207 65208 65209 65210 65211 65212 65213 65214 65215 65216 65217 65218 65219 65220 65221 65222 65223 65224 65225 65226 65227 65228 65229 65230 65231 65232 65233 65234 65235 65236 65237 65238 65239 65240 65241 65242 65243 65244 65245 65246 65247 65248 65249 65250 65251 65252 65253 65254 65255 65256 65257 65258 65259 65260 65261 65262 65263 65264 65265 65266 65267 65268 65269 65270 65271 65272 65273 65274 65275 65276 65277 65278 65279 65280 65281 65282 65283 65284 65285 65286 65287 65288 65289 65290 65291 65292 65293 65294 65295 65296 65297 65298 65299 65300 65301 65302 65303 65304 65305 65306 65307 65308 65309 65310 65311 65312 65313 65314 65315 65316 65317 65318 65319 65320 65321 65322 65323 65324 65325 65326 65327 65328 65329 65330 65331 65332 65333 65334 65335 65336 65337 65338 65339 65340 65341 65342 65343 65344 65345 65346 65347 65348 65349 65350 65351 65352 65353 65354 65355 65356 65357 65358 65359 65360 65361 65362 65363 65364 65365 65366 65367 65368 65369 65370 65371 65372 65373 65374 65375 65376 65377 65378 65379 65380 65381 65382 65383 65384 65385 65386 65387 65388 65389 65390 65391 65392 65393 65394 65395 65396 65397 65398 65399 65400 65401 65402 65403 65404 65405 65406 65407 65408 65409 65410 65411 65412 65413 65414 65415 65416 65417 65418 65419 65420 65421 65422 65423 65424 65425 65426 65427 65428 65429 65430 65431 65432 65433 65434 65435 65436 65437 65438 65439 65440 65441 65442 65443 65444 65445 65446 65447 65448 65449 65450 65451 65452 65453 65454 65455 65456 65457 65458 65459 65460 65461 65462 65463 65464 65465 65466 65467 65468 65469 65470 65471 65472 65473 65474 65475 65476 65477 65478 65479 65480 65481 65482 65483 65484 65485 65486 65487 65488 65489 65490 65491 65492 65493 65494 65495 65496 65497 65498 65499 65500 65501 65502 65503 65504 65505 65506 65507 65508 65509 65510 65511 65512 65513 65514 65515 65516 65517 65518 65519 65520 65521 65522 65523 65524 65525 65526 65527 65528 65529 65530 65531 65532 65533 65534 65535 65536 65537 65538 65539 65540 65541 65542 65543 65544 65545 65546 65547 65548 65549 65550 65551 65552 65553 65554 65555 65556 65557 65558 65559 65560 65561 65562 65563 65564 65565 65566 65567 65568 65569 65570 65571 65572 65573 65574 65575 65576 65577 65578 65579 65580 65581 65582 65583 65584 65585 65586 65587 65588 65589 65590 65591 65592 65593 65594 65595 65596 65597 65598 65599 65600 65601 65602 65603 65604 65605 65606 65607 65608 65609 65610 65611 65612 65613 65614 65615 65616 65617 65618 65619 65620 65621 65622 65623 65624 65625 65626 65627 65628 65629 65630 65631 65632 65633 65634 65635 65636 65637 65638 65639 65640 65641 65642 65643 65644 65645 65646 65647 65648 65649 65650 65651 65652 65653 65654 65655 65656 65657 65658 65659 65660 65661 65662 65663 65664 65665 65666 65667 65668 65669 65670 65671 65672 65673 65674 65675 65676 65677 65678 65679 65680 65681 65682 65683 65684 65685 65686 65687 65688 65689 65690 65691 65692 65693 65694 65695 65696 65697 65698 65699 65700 65701 65702 65703 65704 65705 65706 65707 65708 65709 65710 65711 65712 65713 65714 65715 65716 65717 65718 65719 65720 65721 65722 65723 65724 65725 65726 65727 65728 65729 65730 65731 65732 65733 65734 65735 65736 65737 65738 65739 65740 65741 65742 65743 65744 65745 65746 65747 65748 65749 65750 65751 65752 65753 65754 65755 65756 65757 65758 65759 65760 65761 65762 65763 65764 65765 65766 65767 65768 65769 65770 65771 65772 65773 65774 65775 65776 65777 65778 65779 65780 65781 65782 65783 65784 65785 65786 65787 65788 65789 65790 65791 65792 65793 65794 65795 65796 65797 65798 65799 65800 65801 65802 65803 65804 65805 65806 65807 65808 65809 65810 65811 65812 65813 65814 65815 65816 65817 65818 65819 65820 65821 65822 65823 65824 65825 65826 65827 65828 65829 65830 65831 65832 65833 65834 65835 65836 65837 65838 65839 65840 65841 65842 65843 65844 65845 65846 65847 65848 65849 65850 65851 65852 65853 65854 65855 65856 65857 65858 65859 65860 65861 65862 65863 65864 65865 65866 65867 65868 65869 65870 65871 65872 65873 65874 65875 65876 65877 65878 65879 65880 65881 65882 65883 65884 65885 65886 65887 65888 65889 65890 65891 65892 65893 65894 65895 65896 65897 65898 65899 65900 65901 65902 65903 65904 65905 65906 65907 65908 65909 65910 65911 65912 65913 65914 65915 65916 65917 65918 65919 65920 65921 65922 65923 65924 65925 65926 65927 65928 65929 65930 65931 65932 65933 65934 65935 65936 65937 65938 65939 65940 65941 65942 65943 65944 65945 65946 65947 65948 65949 65950 65951 65952 65953 65954 65955 65956 65957 65958 65959 65960 65961 65962 65963 65964 65965 65966 65967 65968 65969 65970 65971 65972 65973 65974 65975 65976 65977 65978 65979 65980 65981 65982 65983 65984 65985 65986 65987 65988 65989 65990 65991 65992 65993 65994 65995 65996 65997 65998 65999 66000 66001 66002 66003 66004 66005 66006 66007 66008 66009 66010 66011 66012 66013 66014 66015 66016 66017 66018 66019 66020 66021 66022 66023 66024 66025 66026 66027 66028 66029 66030 66031 66032 66033 66034 66035 66036 66037 66038 66039 66040 66041 66042 66043 66044 66045 66046 66047 66048 66049 66050 66051 66052 66053 66054 66055 66056 66057 66058 66059 66060 66061 66062 66063 66064 66065 66066 66067 66068 66069 66070 66071 66072 66073 66074 66075 66076 66077 66078 66079 66080 66081 66082 66083 66084 66085 66086 66087 66088 66089 66090 66091 66092 66093 66094 66095 66096 66097 66098 66099 66100 66101 66102 66103 66104 66105 66106 66107 66108 66109 66110 66111 66112 66113 66114 66115 66116 66117 66118 66119 66120 66121 66122 66123 66124 66125 66126 66127 66128 66129 66130 66131 66132 66133 66134 66135 66136 66137 66138 66139 66140 66141 66142 66143 66144 66145 66146 66147 66148 66149 66150 66151 66152 66153 66154 66155 66156 66157 66158 66159 66160 66161 66162 66163 66164 66165 66166 66167 66168 66169 66170 66171 66172 66173 66174 66175 66176 66177 66178 66179 66180 66181 66182 66183 66184 66185 66186 66187 66188 66189 66190 66191 66192 66193 66194 66195 66196 66197 66198 66199 66200 66201 66202 66203 66204 66205 66206 66207 66208 66209 66210 66211 66212 66213 66214 66215 66216 66217 66218 66219 66220 66221 66222 66223 66224 66225 66226 66227 66228 66229 66230 66231 66232 66233 66234 66235 66236 66237 66238 66239 66240 66241 66242 66243 66244 66245 66246 66247 66248 66249 66250 66251 66252 66253 66254 66255 66256 66257 66258 66259 66260 66261 66262 66263 66264 66265 66266 66267 66268 66269 66270 66271 66272 66273 66274 66275 66276 66277 66278 66279 66280 66281 66282 66283 66284 66285 66286 66287 66288 66289 66290 66291 66292 66293 66294 66295 66296 66297 66298 66299 66300 66301 66302 66303 66304 66305 66306 66307 66308 66309 66310 66311 66312 66313 66314 66315 66316 66317 66318 66319 66320 66321 66322 66323 66324 66325 66326 66327 66328 66329 66330 66331 66332 66333 66334 66335 66336 66337 66338 66339 66340 66341 66342 66343 66344 66345 66346 66347 66348 66349 66350 66351 66352 66353 66354 66355 66356 66357 66358 66359 66360 66361 66362 66363 66364 66365 66366 66367 66368 66369 66370 66371 66372 66373 66374 66375 66376 66377 66378 66379 66380 66381 66382 66383 66384 66385 66386 66387 66388 66389 66390 66391 66392 66393 66394 66395 66396 66397 66398 66399 66400 66401 66402 66403 66404 66405 66406 66407 66408 66409 66410 66411 66412 66413 66414 66415 66416 66417 66418 66419 66420 66421 66422 66423 66424 66425 66426 66427 66428 66429 66430 66431 66432 66433 66434 66435 66436 66437 66438 66439 66440 66441 66442 66443 66444 66445 66446 66447 66448 66449 66450 66451 66452 66453 66454 66455 66456 66457 66458 66459 66460 66461 66462 66463 66464 66465 66466 66467 66468 66469 66470 66471 66472 66473 66474 66475 66476 66477 66478 66479 66480 66481 66482 66483 66484 66485 66486 66487 66488 66489 66490 66491 66492 66493 66494 66495 66496 66497 66498 66499 66500 66501 66502 66503 66504 66505 66506 66507 66508 66509 66510 66511 66512 66513 66514 66515 66516 66517 66518 66519 66520 66521 66522 66523 66524 66525 66526 66527 66528 66529 66530 66531 66532 66533 66534 66535 66536 66537 66538 66539 66540 66541 66542 66543 66544 66545 66546 66547 66548 66549 66550 66551 66552 66553 66554 66555 66556 66557 66558 66559 66560 66561 66562 66563 66564 66565 66566 66567 66568 66569 66570 66571 66572 66573 66574 66575 66576 66577 66578 66579 66580 66581 66582 66583 66584 66585 66586 66587 66588 66589 66590 66591 66592 66593 66594 66595 66596 66597 66598 66599 66600 66601 66602 66603 66604 66605 66606 66607 66608 66609 66610 66611 66612 66613 66614 66615 66616 66617 66618 66619 66620 66621 66622 66623 66624 66625 66626 66627 66628 66629 66630 66631 66632 66633 66634 66635 66636 66637 66638 66639 66640 66641 66642 66643 66644 66645 66646 66647 66648 66649 66650 66651 66652 66653 66654 66655 66656 66657 66658 66659 66660 66661 66662 66663 66664 66665 66666 66667 66668 66669 66670 66671 66672 66673 66674 66675 66676 66677 66678 66679 66680 66681 66682 66683 66684 66685 66686 66687 66688 66689 66690 66691 66692 66693 66694 66695 66696 66697 66698 66699 66700 66701 66702 66703 66704 66705 66706 66707 66708 66709 66710 66711 66712 66713 66714 66715 66716 66717 66718 66719 66720 66721 66722 66723 66724 66725 66726 66727 66728 66729 66730 66731 66732 66733 66734 66735 66736 66737 66738 66739 66740 66741 66742 66743 66744 66745 66746 66747 66748 66749 66750 66751 66752 66753 66754 66755 66756 66757 66758 66759 66760 66761 66762 66763 66764 66765 66766 66767 66768 66769 66770 66771 66772 66773 66774 66775 66776 66777 66778 66779 66780 66781 66782 66783 66784 66785 66786 66787 66788 66789 66790 66791 66792 66793 66794 66795 66796 66797 66798 66799 66800 66801 66802 66803 66804 66805 66806 66807 66808 66809 66810 66811 66812 66813 66814 66815 66816 66817 66818 66819 66820 66821 66822 66823 66824 66825 66826 66827 66828 66829 66830 66831 66832 66833 66834 66835 66836 66837 66838 66839 66840 66841 66842 66843 66844 66845 66846 66847 66848 66849 66850 66851 66852 66853 66854 66855 66856 66857 66858 66859 66860 66861 66862 66863 66864 66865 66866 66867 66868 66869 66870 66871 66872 66873 66874 66875 66876 66877 66878 66879 66880 66881 66882 66883 66884 66885 66886 66887 66888 66889 66890 66891 66892 66893 66894 66895 66896 66897 66898 66899 66900 66901 66902 66903 66904 66905 66906 66907 66908 66909 66910 66911 66912 66913 66914 66915 66916 66917 66918 66919 66920 66921 66922 66923 66924 66925 66926 66927 66928 66929 66930 66931 66932 66933 66934 66935 66936 66937 66938 66939 66940 66941 66942 66943 66944 66945 66946 66947 66948 66949 66950 66951 66952 66953 66954 66955 66956 66957 66958 66959 66960 66961 66962 66963 66964 66965 66966 66967 66968 66969 66970 66971 66972 66973 66974 66975 66976 66977 66978 66979 66980 66981 66982 66983 66984 66985 66986 66987 66988 66989 66990 66991 66992 66993 66994 66995 66996 66997 66998 66999 67000 67001 67002 67003 67004 67005 67006 67007 67008 67009 67010 67011 67012 67013 67014 67015 67016 67017 67018 67019 67020 67021 67022 67023 67024 67025 67026 67027 67028 67029 67030 67031 67032 67033 67034 67035 67036 67037 67038 67039 67040 67041 67042 67043 67044 67045 67046 67047 67048 67049 67050 67051 67052 67053 67054 67055 67056 67057 67058 67059 67060 67061 67062 67063 67064 67065 67066 67067 67068 67069 67070 67071 67072 67073 67074 67075 67076 67077 67078 67079 67080 67081 67082 67083 67084 67085 67086 67087 67088 67089 67090 67091 67092 67093 67094 67095 67096 67097 67098 67099 67100 67101 67102 67103 67104 67105 67106 67107 67108 67109 67110 67111 67112 67113 67114 67115 67116 67117 67118 67119 67120 67121 67122 67123 67124 67125 67126 67127 67128 67129 67130 67131 67132 67133 67134 67135 67136 67137 67138 67139 67140 67141 67142 67143 67144 67145 67146 67147 67148 67149 67150 67151 67152 67153 67154 67155 67156 67157 67158 67159 67160 67161 67162 67163 67164 67165 67166 67167 67168 67169 67170 67171 67172 67173 67174 67175 67176 67177 67178 67179 67180 67181 67182 67183 67184 67185 67186 67187 67188 67189 67190 67191 67192 67193 67194 67195 67196 67197 67198 67199 67200 67201 67202 67203 67204 67205 67206 67207 67208 67209 67210 67211 67212 67213 67214 67215 67216 67217 67218 67219 67220 67221 67222 67223 67224 67225 67226 67227 67228 67229 67230 67231 67232 67233 67234 67235 67236 67237 67238 67239 67240 67241 67242 67243 67244 67245 67246 67247 67248 67249 67250 67251 67252 67253 67254 67255 67256 67257 67258 67259 67260 67261 67262 67263 67264 67265 67266 67267 67268 67269 67270 67271 67272 67273 67274 67275 67276 67277 67278 67279 67280 67281 67282 67283 67284 67285 67286 67287 67288 67289 67290 67291 67292 67293 67294 67295 67296 67297 67298 67299 67300 67301 67302 67303 67304 67305 67306 67307 67308 67309 67310 67311 67312 67313 67314 67315 67316 67317 67318 67319 67320 67321 67322 67323 67324 67325 67326 67327 67328 67329 67330 67331 67332 67333 67334 67335 67336 67337 67338 67339 67340 67341 67342 67343 67344 67345 67346 67347 67348 67349 67350 67351 67352 67353 67354 67355 67356 67357 67358 67359 67360 67361 67362 67363 67364 67365 67366 67367 67368 67369 67370 67371 67372 67373 67374 67375 67376 67377 67378 67379 67380 67381 67382 67383 67384 67385 67386 67387 67388 67389 67390 67391 67392 67393 67394 67395 67396 67397 67398 67399 67400 67401 67402 67403 67404 67405 67406 67407 67408 67409 67410 67411 67412 67413 67414 67415 67416 67417 67418 67419 67420 67421 67422 67423 67424 67425 67426 67427 67428 67429 67430 67431 67432 67433 67434 67435 67436 67437 67438 67439 67440 67441 67442 67443 67444 67445 67446 67447 67448 67449 67450 67451 67452 67453 67454 67455 67456 67457 67458 67459 67460 67461 67462 67463 67464 67465 67466 67467 67468 67469 67470 67471 67472 67473 67474 67475 67476 67477 67478 67479 67480 67481 67482 67483 67484 67485 67486 67487 67488 67489 67490 67491 67492 67493 67494 67495 67496 67497 67498 67499 67500 67501 67502 67503 67504 67505 67506 67507 67508 67509 67510 67511 67512 67513 67514 67515 67516 67517 67518 67519 67520 67521 67522 67523 67524 67525 67526 67527 67528 67529 67530 67531 67532 67533 67534 67535 67536 67537 67538 67539 67540 67541 67542 67543 67544 67545 67546 67547 67548 67549 67550 67551 67552 67553 67554 67555 67556 67557 67558 67559 67560 67561 67562 67563 67564 67565 67566 67567 67568 67569 67570 67571 67572 67573 67574 67575 67576 67577 67578 67579 67580 67581 67582 67583 67584 67585 67586 67587 67588 67589 67590 67591 67592 67593 67594 67595 67596 67597 67598 67599 67600 67601 67602 67603 67604 67605 67606 67607 67608 67609 67610 67611 67612 67613 67614 67615 67616 67617 67618 67619 67620 67621 67622 67623 67624 67625 67626 67627 67628 67629 67630 67631 67632 67633 67634 67635 67636 67637 67638 67639 67640 67641 67642 67643 67644 67645 67646 67647 67648 67649 67650 67651 67652 67653 67654 67655 67656 67657 67658 67659 67660 67661 67662 67663 67664 67665 67666 67667 67668 67669 67670 67671 67672 67673 67674 67675 67676 67677 67678 67679 67680 67681 67682 67683 67684 67685 67686 67687 67688 67689 67690 67691 67692 67693 67694 67695 67696 67697 67698 67699 67700 67701 67702 67703 67704 67705 67706 67707 67708 67709 67710 67711 67712 67713 67714 67715 67716 67717 67718 67719 67720 67721 67722 67723 67724 67725 67726 67727 67728 67729 67730 67731 67732 67733 67734 67735 67736 67737 67738 67739 67740 67741 67742 67743 67744 67745 67746 67747 67748 67749 67750 67751 67752 67753 67754 67755 67756 67757 67758 67759 67760 67761 67762 67763 67764 67765 67766 67767 67768 67769 67770 67771 67772 67773 67774 67775 67776 67777 67778 67779 67780 67781 67782 67783 67784 67785 67786 67787 67788 67789 67790 67791 67792 67793 67794 67795 67796 67797 67798 67799 67800 67801 67802 67803 67804 67805 67806 67807 67808 67809 67810 67811 67812 67813 67814 67815 67816 67817 67818 67819 67820 67821 67822 67823 67824 67825 67826 67827 67828 67829 67830 67831 67832 67833 67834 67835 67836 67837 67838 67839 67840 67841 67842 67843 67844 67845 67846 67847 67848 67849 67850 67851 67852 67853 67854 67855 67856 67857 67858 67859 67860 67861 67862 67863 67864 67865 67866 67867 67868 67869 67870 67871 67872 67873 67874 67875 67876 67877 67878 67879 67880 67881 67882 67883 67884 67885 67886 67887 67888 67889 67890 67891 67892 67893 67894 67895 67896 67897 67898 67899 67900 67901 67902 67903 67904 67905 67906 67907 67908 67909 67910 67911 67912 67913 67914 67915 67916 67917 67918 67919 67920 67921 67922 67923 67924 67925 67926 67927 67928 67929 67930 67931 67932 67933 67934 67935 67936 67937 67938 67939 67940 67941 67942 67943 67944 67945 67946 67947 67948 67949 67950 67951 67952 67953 67954 67955 67956 67957 67958 67959 67960 67961 67962 67963 67964 67965 67966 67967 67968 67969 67970 67971 67972 67973 67974 67975 67976 67977 67978 67979 67980 67981 67982 67983 67984 67985 67986 67987 67988 67989 67990 67991 67992 67993 67994 67995 67996 67997 67998 67999 68000 68001 68002 68003 68004 68005 68006 68007 68008 68009 68010 68011 68012 68013 68014 68015 68016 68017 68018 68019 68020 68021 68022 68023 68024 68025 68026 68027 68028 68029 68030 68031 68032 68033 68034 68035 68036 68037 68038 68039 68040 68041 68042 68043 68044 68045 68046 68047 68048 68049 68050 68051 68052 68053 68054 68055 68056 68057 68058 68059 68060 68061 68062 68063 68064 68065 68066 68067 68068 68069 68070 68071 68072 68073 68074 68075 68076 68077 68078 68079 68080 68081 68082 68083 68084 68085 68086 68087 68088 68089 68090 68091 68092 68093 68094 68095 68096 68097 68098 68099 68100 68101 68102 68103 68104 68105 68106 68107 68108 68109 68110 68111 68112 68113 68114 68115 68116 68117 68118 68119 68120 68121 68122 68123 68124 68125 68126 68127 68128 68129 68130 68131 68132 68133 68134 68135 68136 68137 68138 68139 68140 68141 68142 68143 68144 68145 68146 68147 68148 68149 68150 68151 68152 68153 68154 68155 68156 68157 68158 68159 68160 68161 68162 68163 68164 68165 68166 68167 68168 68169 68170 68171 68172 68173 68174 68175 68176 68177 68178 68179 68180 68181 68182 68183 68184 68185 68186 68187 68188 68189 68190 68191 68192 68193 68194 68195 68196 68197 68198 68199 68200 68201 68202 68203 68204 68205 68206 68207 68208 68209 68210 68211 68212 68213 68214 68215 68216 68217 68218 68219 68220 68221 68222 68223 68224 68225 68226 68227 68228 68229 68230 68231 68232 68233 68234 68235 68236 68237 68238 68239 68240 68241 68242 68243 68244 68245 68246 68247 68248 68249 68250 68251 68252 68253 68254 68255 68256 68257 68258 68259 68260 68261 68262 68263 68264 68265 68266 68267 68268 68269 68270 68271 68272 68273 68274 68275 68276 68277 68278 68279 68280 68281 68282 68283 68284 68285 68286 68287 68288 68289 68290 68291 68292 68293 68294 68295 68296 68297 68298 68299 68300 68301 68302 68303 68304 68305 68306 68307 68308 68309 68310 68311 68312 68313 68314 68315 68316 68317 68318 68319 68320 68321 68322 68323 68324 68325 68326 68327 68328 68329 68330 68331 68332 68333 68334 68335 68336 68337 68338 68339 68340 68341 68342 68343 68344 68345 68346 68347 68348 68349 68350 68351 68352 68353 68354 68355 68356 68357 68358 68359 68360 68361 68362 68363 68364 68365 68366 68367 68368 68369 68370 68371 68372 68373 68374 68375 68376 68377 68378 68379 68380 68381 68382 68383 68384 68385 68386 68387 68388 68389 68390 68391 68392 68393 68394 68395 68396 68397 68398 68399 68400 68401 68402 68403 68404 68405 68406 68407 68408 68409 68410 68411 68412 68413 68414 68415 68416 68417 68418 68419 68420 68421 68422 68423 68424 68425 68426 68427 68428 68429 68430 68431 68432 68433 68434 68435 68436 68437 68438 68439 68440 68441 68442 68443 68444 68445 68446 68447 68448 68449 68450 68451 68452 68453 68454 68455 68456 68457 68458 68459 68460 68461 68462 68463 68464 68465 68466 68467 68468 68469 68470 68471 68472 68473 68474 68475 68476 68477 68478 68479 68480 68481 68482 68483 68484 68485 68486 68487 68488 68489 68490 68491 68492 68493 68494 68495 68496 68497 68498 68499 68500 68501 68502 68503 68504 68505 68506 68507 68508 68509 68510 68511 68512 68513 68514 68515 68516 68517 68518 68519 68520 68521 68522 68523 68524 68525 68526 68527 68528 68529 68530 68531 68532 68533 68534 68535 68536 68537 68538 68539 68540 68541 68542 68543 68544 68545 68546 68547 68548 68549 68550 68551 68552 68553 68554 68555 68556 68557 68558 68559 68560 68561 68562 68563 68564 68565 68566 68567 68568 68569 68570 68571 68572 68573 68574 68575 68576 68577 68578 68579 68580 68581 68582 68583 68584 68585 68586 68587 68588 68589 68590 68591 68592 68593 68594 68595 68596 68597 68598 68599 68600 68601 68602 68603 68604 68605 68606 68607 68608 68609 68610 68611 68612 68613 68614 68615 68616 68617 68618 68619 68620 68621 68622 68623 68624 68625 68626 68627 68628 68629 68630 68631 68632 68633 68634 68635 68636 68637 68638 68639 68640 68641 68642 68643 68644 68645 68646 68647 68648 68649 68650 68651 68652 68653 68654 68655 68656 68657 68658 68659 68660 68661 68662 68663 68664 68665 68666 68667 68668 68669 68670 68671 68672 68673 68674 68675 68676 68677 68678 68679 68680 68681 68682 68683 68684 68685 68686 68687 68688 68689 68690 68691 68692 68693 68694 68695 68696 68697 68698 68699 68700 68701 68702 68703 68704 68705 68706 68707 68708 68709 68710 68711 68712 68713 68714 68715 68716 68717 68718 68719 68720 68721 68722 68723 68724 68725 68726 68727 68728 68729 68730 68731 68732 68733 68734 68735 68736 68737 68738 68739 68740 68741 68742 68743 68744 68745 68746 68747 68748 68749 68750 68751 68752 68753 68754 68755 68756 68757 68758 68759 68760 68761 68762 68763 68764 68765 68766 68767 68768 68769 68770 68771 68772 68773 68774 68775 68776 68777 68778 68779 68780 68781 68782 68783 68784 68785 68786 68787 68788 68789 68790 68791 68792 68793 68794 68795 68796 68797 68798 68799 68800 68801 68802 68803 68804 68805 68806 68807 68808 68809 68810 68811 68812 68813 68814 68815 68816 68817 68818 68819 68820 68821 68822 68823 68824 68825 68826 68827 68828 68829 68830 68831 68832 68833 68834 68835 68836 68837 68838 68839 68840 68841 68842 68843 68844 68845 68846 68847 68848 68849 68850 68851 68852 68853 68854 68855 68856 68857 68858 68859 68860 68861 68862 68863 68864 68865 68866 68867 68868 68869 68870 68871 68872 68873 68874 68875 68876 68877 68878 68879 68880 68881 68882 68883 68884 68885 68886 68887 68888 68889 68890 68891 68892 68893 68894 68895 68896 68897 68898 68899 68900 68901 68902 68903 68904 68905 68906 68907 68908 68909 68910 68911 68912 68913 68914 68915 68916 68917 68918 68919 68920 68921 68922 68923 68924 68925 68926 68927 68928 68929 68930 68931 68932 68933 68934 68935 68936 68937 68938 68939 68940 68941 68942 68943 68944 68945 68946 68947 68948 68949 68950 68951 68952 68953 68954 68955 68956 68957 68958 68959 68960 68961 68962 68963 68964 68965 68966 68967 68968 68969 68970 68971 68972 68973 68974 68975 68976 68977 68978 68979 68980 68981 68982 68983 68984 68985 68986 68987 68988 68989 68990 68991 68992 68993 68994 68995 68996 68997 68998 68999 69000 69001 69002 69003 69004 69005 69006 69007 69008 69009 69010 69011 69012 69013 69014 69015 69016 69017 69018 69019 69020 69021 69022 69023 69024 69025 69026 69027 69028 69029 69030 69031 69032 69033 69034 69035 69036 69037 69038 69039 69040 69041 69042 69043 69044 69045 69046 69047 69048 69049 69050 69051 69052 69053 69054 69055 69056 69057 69058 69059 69060 69061 69062 69063 69064 69065 69066 69067 69068 69069 69070 69071 69072 69073 69074 69075 69076 69077 69078 69079 69080 69081 69082 69083 69084 69085 69086 69087 69088 69089 69090 69091 69092 69093 69094 69095 69096 69097 69098 69099 69100 69101 69102 69103 69104 69105 69106 69107 69108 69109 69110 69111 69112 69113 69114 69115 69116 69117 69118 69119 69120 69121 69122 69123 69124 69125 69126 69127 69128 69129 69130 69131 69132 69133 69134 69135 69136 69137 69138 69139 69140 69141 69142 69143 69144 69145 69146 69147 69148 69149 69150 69151 69152 69153 69154 69155 69156 69157 69158 69159 69160 69161 69162 69163 69164 69165 69166 69167 69168 69169 69170 69171 69172 69173 69174 69175 69176 69177 69178 69179 69180 69181 69182 69183 69184 69185 69186 69187 69188 69189 69190 69191 69192 69193 69194 69195 69196 69197 69198 69199 69200 69201 69202 69203 69204 69205 69206 69207 69208 69209 69210 69211 69212 69213 69214 69215 69216 69217 69218 69219 69220 69221 69222 69223 69224 69225 69226 69227 69228 69229 69230 69231 69232 69233 69234 69235 69236 69237 69238 69239 69240 69241 69242 69243 69244 69245 69246 69247 69248 69249 69250 69251 69252 69253 69254 69255 69256 69257 69258 69259 69260 69261 69262 69263 69264 69265 69266 69267 69268 69269 69270 69271 69272 69273 69274 69275 69276 69277 69278 69279 69280 69281 69282 69283 69284 69285 69286 69287 69288 69289 69290 69291 69292 69293 69294 69295 69296 69297 69298 69299 69300 69301 69302 69303 69304 69305 69306 69307 69308 69309 69310 69311 69312 69313 69314 69315 69316 69317 69318 69319 69320 69321 69322 69323 69324 69325 69326 69327 69328 69329 69330 69331 69332 69333 69334 69335 69336 69337 69338 69339 69340 69341 69342 69343 69344 69345 69346 69347 69348 69349 69350 69351 69352 69353 69354 69355 69356 69357 69358 69359 69360 69361 69362 69363 69364 69365 69366 69367 69368 69369 69370 69371 69372 69373 69374 69375 69376 69377 69378 69379 69380 69381 69382 69383 69384 69385 69386 69387 69388 69389 69390 69391 69392 69393 69394 69395 69396 69397 69398 69399 69400 69401 69402 69403 69404 69405 69406 69407 69408 69409 69410 69411 69412 69413 69414 69415 69416 69417 69418 69419 69420 69421 69422 69423 69424 69425 69426 69427 69428 69429 69430 69431 69432 69433 69434 69435 69436 69437 69438 69439 69440 69441 69442 69443 69444 69445 69446 69447 69448 69449 69450 69451 69452 69453 69454 69455 69456 69457 69458 69459 69460 69461 69462 69463 69464 69465 69466 69467 69468 69469 69470 69471 69472 69473 69474 69475 69476 69477 69478 69479 69480 69481 69482 69483 69484 69485 69486 69487 69488 69489 69490 69491 69492 69493 69494 69495 69496 69497 69498 69499 69500 69501 69502 69503 69504 69505 69506 69507 69508 69509 69510 69511 69512 69513 69514 69515 69516 69517 69518 69519 69520 69521 69522 69523 69524 69525 69526 69527 69528 69529 69530 69531 69532 69533 69534 69535 69536 69537 69538 69539 69540 69541 69542 69543 69544 69545 69546 69547 69548 69549 69550 69551 69552 69553 69554 69555 69556 69557 69558 69559 69560 69561 69562 69563 69564 69565 69566 69567 69568 69569 69570 69571 69572 69573 69574 69575 69576 69577 69578 69579 69580 69581 69582 69583 69584 69585 69586 69587 69588 69589 69590 69591 69592 69593 69594 69595 69596 69597 69598 69599 69600 69601 69602 69603 69604 69605 69606 69607 69608 69609 69610 69611 69612 69613 69614 69615 69616 69617 69618 69619 69620 69621 69622 69623 69624 69625 69626 69627 69628 69629 69630 69631 69632 69633 69634 69635 69636 69637 69638 69639 69640 69641 69642 69643 69644 69645 69646 69647 69648 69649 69650 69651 69652 69653 69654 69655 69656 69657 69658 69659 69660 69661 69662 69663 69664 69665 69666 69667 69668 69669 69670 69671 69672 69673 69674 69675 69676 69677 69678 69679 69680 69681 69682 69683 69684 69685 69686 69687 69688 69689 69690 69691 69692 69693 69694 69695 69696 69697 69698 69699 69700 69701 69702 69703 69704 69705 69706 69707 69708 69709 69710 69711 69712 69713 69714 69715 69716 69717 69718 69719 69720 69721 69722 69723 69724 69725 69726 69727 69728 69729 69730 69731 69732 69733 69734 69735 69736 69737 69738 69739 69740 69741 69742 69743 69744 69745 69746 69747 69748 69749 69750 69751 69752 69753 69754 69755 69756 69757 69758 69759 69760 69761 69762 69763 69764 69765 69766 69767 69768 69769 69770 69771 69772 69773 69774 69775 69776 69777 69778 69779 69780 69781 69782 69783 69784 69785 69786 69787 69788 69789 69790 69791 69792 69793 69794 69795 69796 69797 69798 69799 69800 69801 69802 69803 69804 69805 69806 69807 69808 69809 69810 69811 69812 69813 69814 69815 69816 69817 69818 69819 69820 69821 69822 69823 69824 69825 69826 69827 69828 69829 69830 69831 69832 69833 69834 69835 69836 69837 69838 69839 69840 69841 69842 69843 69844 69845 69846 69847 69848 69849 69850 69851 69852 69853 69854 69855 69856 69857 69858 69859 69860 69861 69862 69863 69864 69865 69866 69867 69868 69869 69870 69871 69872 69873 69874 69875 69876 69877 69878 69879 69880 69881 69882 69883 69884 69885 69886 69887 69888 69889 69890 69891 69892 69893 69894 69895 69896 69897 69898 69899 69900 69901 69902 69903 69904 69905 69906 69907 69908 69909 69910 69911 69912 69913 69914 69915 69916 69917 69918 69919 69920 69921 69922 69923 69924 69925 69926 69927 69928 69929 69930 69931 69932 69933 69934 69935 69936 69937 69938 69939 69940 69941 69942 69943 69944 69945 69946 69947 69948 69949 69950 69951 69952 69953 69954 69955 69956 69957 69958 69959 69960 69961 69962 69963 69964 69965 69966 69967 69968 69969 69970 69971 69972 69973 69974 69975 69976 69977 69978 69979 69980 69981 69982 69983 69984 69985 69986 69987 69988 69989 69990 69991 69992 69993 69994 69995 69996 69997 69998 69999 70000 70001 70002 70003 70004 70005 70006 70007 70008 70009 70010 70011 70012 70013 70014 70015 70016 70017 70018 70019 70020 70021 70022 70023 70024 70025 70026 70027 70028 70029 70030 70031 70032 70033 70034 70035 70036 70037 70038 70039 70040 70041 70042 70043 70044 70045 70046 70047 70048 70049 70050 70051 70052 70053 70054 70055 70056 70057 70058 70059 70060 70061 70062 70063 70064 70065 70066 70067 70068 70069 70070 70071 70072 70073 70074 70075 70076 70077 70078 70079 70080 70081 70082 70083 70084 70085 70086 70087 70088 70089 70090 70091 70092 70093 70094 70095 70096 70097 70098 70099 70100 70101 70102 70103 70104 70105 70106 70107 70108 70109 70110 70111 70112 70113 70114 70115 70116 70117 70118 70119 70120 70121 70122 70123 70124 70125 70126 70127 70128 70129 70130 70131 70132 70133 70134 70135 70136 70137 70138 70139 70140 70141 70142 70143 70144 70145 70146 70147 70148 70149 70150 70151 70152 70153 70154 70155 70156 70157 70158 70159 70160 70161 70162 70163 70164 70165 70166 70167 70168 70169 70170 70171 70172 70173 70174 70175 70176 70177 70178 70179 70180 70181 70182 70183 70184 70185 70186 70187 70188 70189 70190 70191 70192 70193 70194 70195 70196 70197 70198 70199 70200 70201 70202 70203 70204 70205 70206 70207 70208 70209 70210 70211 70212 70213 70214 70215 70216 70217 70218 70219 70220 70221 70222 70223 70224 70225 70226 70227 70228 70229 70230 70231 70232 70233 70234 70235 70236 70237 70238 70239 70240 70241 70242 70243 70244 70245 70246 70247 70248 70249 70250 70251 70252 70253 70254 70255 70256 70257 70258 70259 70260 70261 70262 70263 70264 70265 70266 70267 70268 70269 70270 70271 70272 70273 70274 70275 70276 70277 70278 70279 70280 70281 70282 70283 70284 70285 70286 70287 70288 70289 70290 70291 70292 70293 70294 70295 70296 70297 70298 70299 70300 70301 70302 70303 70304 70305 70306 70307 70308 70309 70310 70311 70312 70313 70314 70315 70316 70317 70318 70319 70320 70321 70322 70323 70324 70325 70326 70327 70328 70329 70330 70331 70332 70333 70334 70335 70336 70337 70338 70339 70340 70341 70342 70343 70344 70345 70346 70347 70348 70349 70350 70351 70352 70353 70354 70355 70356 70357 70358 70359 70360 70361 70362 70363 70364 70365 70366 70367 70368 70369 70370 70371 70372 70373 70374 70375 70376 70377 70378 70379 70380 70381 70382 70383 70384 70385 70386 70387 70388 70389 70390 70391 70392 70393 70394 70395 70396 70397 70398 70399 70400 70401 70402 70403 70404 70405 70406 70407 70408 70409 70410 70411 70412 70413 70414 70415 70416 70417 70418 70419 70420 70421 70422 70423 70424 70425 70426 70427 70428 70429 70430 70431 70432 70433 70434 70435 70436 70437 70438 70439 70440 70441 70442 70443 70444 70445 70446 70447 70448 70449 70450 70451 70452 70453 70454 70455 70456 70457 70458 70459 70460 70461 70462 70463 70464 70465 70466 70467 70468 70469 70470 70471 70472 70473 70474 70475 70476 70477 70478 70479 70480 70481 70482 70483 70484 70485 70486 70487 70488 70489 70490 70491 70492 70493 70494 70495 70496 70497 70498 70499 70500 70501 70502 70503 70504 70505 70506 70507 70508 70509 70510 70511 70512 70513 70514 70515 70516 70517 70518 70519 70520 70521 70522 70523 70524 70525 70526 70527 70528 70529 70530 70531 70532 70533 70534 70535 70536 70537 70538 70539 70540 70541 70542 70543 70544 70545 70546 70547 70548 70549 70550 70551 70552 70553 70554 70555 70556 70557 70558 70559 70560 70561 70562 70563 70564 70565 70566 70567 70568 70569 70570 70571 70572 70573 70574 70575 70576 70577 70578 70579 70580 70581 70582 70583 70584 70585 70586 70587 70588 70589 70590 70591 70592 70593 70594 70595 70596 70597 70598 70599 70600 70601 70602 70603 70604 70605 70606 70607 70608 70609 70610 70611 70612 70613 70614 70615 70616 70617 70618 70619 70620 70621 70622 70623 70624 70625 70626 70627 70628 70629 70630 70631 70632 70633 70634 70635 70636 70637 70638 70639 70640 70641 70642 70643 70644 70645 70646 70647 70648 70649 70650 70651 70652 70653 70654 70655 70656 70657 70658 70659 70660 70661 70662 70663 70664 70665 70666 70667 70668 70669 70670 70671 70672 70673 70674 70675 70676 70677 70678 70679 70680 70681 70682 70683 70684 70685 70686 70687 70688 70689 70690 70691 70692 70693 70694 70695 70696 70697 70698 70699 70700 70701 70702 70703 70704 70705 70706 70707 70708 70709 70710 70711 70712 70713 70714 70715 70716 70717 70718 70719 70720 70721 70722 70723 70724 70725 70726 70727 70728 70729 70730 70731 70732 70733 70734 70735 70736 70737 70738 70739 70740 70741 70742 70743 70744 70745 70746 70747 70748 70749 70750 70751 70752 70753 70754 70755 70756 70757 70758 70759 70760 70761 70762 70763 70764 70765 70766 70767 70768 70769 70770 70771 70772 70773 70774 70775 70776 70777 70778 70779 70780 70781 70782 70783 70784 70785 70786 70787 70788 70789 70790 70791 70792 70793 70794 70795 70796 70797 70798 70799 70800 70801 70802 70803 70804 70805 70806 70807 70808 70809 70810 70811 70812 70813 70814 70815 70816 70817 70818 70819 70820 70821 70822 70823 70824 70825 70826 70827 70828 70829 70830 70831 70832 70833 70834 70835 70836 70837 70838 70839 70840 70841 70842 70843 70844 70845 70846 70847 70848 70849 70850 70851 70852 70853 70854 70855 70856 70857 70858 70859 70860 70861 70862 70863 70864 70865 70866 70867 70868 70869 70870 70871 70872 70873 70874 70875 70876 70877 70878 70879 70880 70881 70882 70883 70884 70885 70886 70887 70888 70889 70890 70891 70892 70893 70894 70895 70896 70897 70898 70899 70900 70901 70902 70903 70904 70905 70906 70907 70908 70909 70910 70911 70912 70913 70914 70915 70916 70917 70918 70919 70920 70921 70922 70923 70924 70925 70926 70927 70928 70929 70930 70931 70932 70933 70934 70935 70936 70937 70938 70939 70940 70941 70942 70943 70944 70945 70946 70947 70948 70949 70950 70951 70952 70953 70954 70955 70956 70957 70958 70959 70960 70961 70962 70963 70964 70965 70966 70967 70968 70969 70970 70971 70972 70973 70974 70975 70976 70977 70978 70979 70980 70981 70982 70983 70984 70985 70986 70987 70988 70989 70990 70991 70992 70993 70994 70995 70996 70997 70998 70999 71000 71001 71002 71003 71004 71005 71006 71007 71008 71009 71010 71011 71012 71013 71014 71015 71016 71017 71018 71019 71020 71021 71022 71023 71024 71025 71026 71027 71028 71029 71030 71031 71032 71033 71034 71035 71036 71037 71038 71039 71040 71041 71042 71043 71044 71045 71046 71047 71048 71049 71050 71051 71052 71053 71054 71055 71056 71057 71058 71059 71060 71061 71062 71063 71064 71065 71066 71067 71068 71069 71070 71071 71072 71073 71074 71075 71076 71077 71078 71079 71080 71081 71082 71083 71084 71085 71086 71087 71088 71089 71090 71091 71092 71093 71094 71095 71096 71097 71098 71099 71100 71101 71102 71103 71104 71105 71106 71107 71108 71109 71110 71111 71112 71113 71114 71115 71116 71117 71118 71119 71120 71121 71122 71123 71124 71125 71126 71127 71128 71129 71130 71131 71132 71133 71134 71135 71136 71137 71138 71139 71140 71141 71142 71143 71144 71145 71146 71147 71148 71149 71150 71151 71152 71153 71154 71155 71156 71157 71158 71159 71160 71161 71162 71163 71164 71165 71166 71167 71168 71169 71170 71171 71172 71173 71174 71175 71176 71177 71178 71179 71180 71181 71182 71183 71184 71185 71186 71187 71188 71189 71190 71191 71192 71193 71194 71195 71196 71197 71198 71199 71200 71201 71202 71203 71204 71205 71206 71207 71208 71209 71210 71211 71212 71213 71214 71215 71216 71217 71218 71219 71220 71221 71222 71223 71224 71225 71226 71227 71228 71229 71230 71231 71232 71233 71234 71235 71236 71237 71238 71239 71240 71241 71242 71243 71244 71245 71246 71247 71248 71249 71250 71251 71252 71253 71254 71255 71256 71257 71258 71259 71260 71261 71262 71263 71264 71265 71266 71267 71268 71269 71270 71271 71272 71273 71274 71275 71276 71277 71278 71279 71280 71281 71282 71283 71284 71285 71286 71287 71288 71289 71290 71291 71292 71293 71294 71295 71296 71297 71298 71299 71300 71301 71302 71303 71304 71305 71306 71307 71308 71309 71310 71311 71312 71313 71314 71315 71316 71317 71318 71319 71320 71321 71322 71323 71324 71325 71326 71327 71328 71329 71330 71331 71332 71333 71334 71335 71336 71337 71338 71339 71340 71341 71342 71343 71344 71345 71346 71347 71348 71349 71350 71351 71352 71353 71354 71355 71356 71357 71358 71359 71360 71361 71362 71363 71364 71365 71366 71367 71368 71369 71370 71371 71372 71373 71374 71375 71376 71377 71378 71379 71380 71381 71382 71383 71384 71385 71386 71387 71388 71389 71390 71391 71392 71393 71394 71395 71396 71397 71398 71399 71400 71401 71402 71403 71404 71405 71406 71407 71408 71409 71410 71411 71412 71413 71414 71415 71416 71417 71418 71419 71420 71421 71422 71423 71424 71425 71426 71427 71428 71429 71430 71431 71432 71433 71434 71435 71436 71437 71438 71439 71440 71441 71442 71443 71444 71445 71446 71447 71448 71449 71450 71451 71452 71453 71454 71455 71456 71457 71458 71459 71460 71461 71462 71463 71464 71465 71466 71467 71468 71469 71470 71471 71472 71473 71474 71475 71476 71477 71478 71479 71480 71481 71482 71483 71484 71485 71486 71487 71488 71489 71490 71491 71492 71493 71494 71495 71496 71497 71498 71499 71500 71501 71502 71503 71504 71505 71506 71507 71508 71509 71510 71511 71512 71513 71514 71515 71516 71517 71518 71519 71520 71521 71522 71523 71524 71525 71526 71527 71528 71529 71530 71531 71532 71533 71534 71535 71536 71537 71538 71539 71540 71541 71542 71543 71544 71545 71546 71547 71548 71549 71550 71551 71552 71553 71554 71555 71556 71557 71558 71559 71560 71561 71562 71563 71564 71565 71566 71567 71568 71569 71570 71571 71572 71573 71574 71575 71576 71577 71578 71579 71580 71581 71582 71583 71584 71585 71586 71587 71588 71589 71590 71591 71592 71593 71594 71595 71596 71597 71598 71599 71600 71601 71602 71603 71604 71605 71606 71607 71608 71609 71610 71611 71612 71613 71614 71615 71616 71617 71618 71619 71620 71621 71622 71623 71624 71625 71626 71627 71628 71629 71630 71631 71632 71633 71634 71635 71636 71637 71638 71639 71640 71641 71642 71643 71644 71645 71646 71647 71648 71649 71650 71651 71652 71653 71654 71655 71656 71657 71658 71659 71660 71661 71662 71663 71664 71665 71666 71667 71668 71669 71670 71671 71672 71673 71674 71675 71676 71677 71678 71679 71680 71681 71682 71683 71684 71685 71686 71687 71688 71689 71690 71691 71692 71693 71694 71695 71696 71697 71698 71699 71700 71701 71702 71703 71704 71705 71706 71707 71708 71709 71710 71711 71712 71713 71714 71715 71716 71717 71718 71719 71720 71721 71722 71723 71724 71725 71726 71727 71728 71729 71730 71731 71732 71733 71734 71735 71736 71737 71738 71739 71740 71741 71742 71743 71744 71745 71746 71747 71748 71749 71750 71751 71752 71753 71754 71755 71756 71757 71758 71759 71760 71761 71762 71763 71764 71765 71766 71767 71768 71769 71770 71771 71772 71773 71774 71775 71776 71777 71778 71779 71780 71781 71782 71783 71784 71785 71786 71787 71788 71789 71790 71791 71792 71793 71794 71795 71796 71797 71798 71799 71800 71801 71802 71803 71804 71805 71806 71807 71808 71809 71810 71811 71812 71813 71814 71815 71816 71817 71818 71819 71820 71821 71822 71823 71824 71825 71826 71827 71828 71829 71830 71831 71832 71833 71834 71835 71836 71837 71838 71839 71840 71841 71842 71843 71844 71845 71846 71847 71848 71849 71850 71851 71852 71853 71854 71855 71856 71857 71858 71859 71860 71861 71862 71863 71864 71865 71866 71867 71868 71869 71870 71871 71872 71873 71874 71875 71876 71877 71878 71879 71880 71881 71882 71883 71884 71885 71886 71887 71888 71889 71890 71891 71892 71893 71894 71895 71896 71897 71898 71899 71900 71901 71902 71903 71904 71905 71906 71907 71908 71909 71910 71911 71912 71913 71914 71915 71916 71917 71918 71919 71920 71921 71922 71923 71924 71925 71926 71927 71928 71929 71930 71931 71932 71933 71934 71935 71936 71937 71938 71939 71940 71941 71942 71943 71944 71945 71946 71947 71948 71949 71950 71951 71952 71953 71954 71955 71956 71957 71958 71959 71960 71961 71962 71963 71964 71965 71966 71967 71968 71969 71970 71971 71972 71973 71974 71975 71976 71977 71978 71979 71980 71981 71982 71983 71984 71985 71986 71987 71988 71989 71990 71991 71992 71993 71994 71995 71996 71997 71998 71999 72000 72001 72002 72003 72004 72005 72006 72007 72008 72009 72010 72011 72012 72013 72014 72015 72016 72017 72018 72019 72020 72021 72022 72023 72024 72025 72026 72027 72028 72029 72030 72031 72032 72033 72034 72035 72036 72037 72038 72039 72040 72041 72042 72043 72044 72045 72046 72047 72048 72049 72050 72051 72052 72053 72054 72055 72056 72057 72058 72059 72060 72061 72062 72063 72064 72065 72066 72067 72068 72069 72070 72071 72072 72073 72074 72075 72076 72077 72078 72079 72080 72081 72082 72083 72084 72085 72086 72087 72088 72089 72090 72091 72092 72093 72094 72095 72096 72097 72098 72099 72100 72101 72102 72103 72104 72105 72106 72107 72108 72109 72110 72111 72112 72113 72114 72115 72116 72117 72118 72119 72120 72121 72122 72123 72124 72125 72126 72127 72128 72129 72130 72131 72132 72133 72134 72135 72136 72137 72138 72139 72140 72141 72142 72143 72144 72145 72146 72147 72148 72149 72150 72151 72152 72153 72154 72155 72156 72157 72158 72159 72160 72161 72162 72163 72164 72165 72166 72167 72168 72169 72170 72171 72172 72173 72174 72175 72176 72177 72178 72179 72180 72181 72182 72183 72184 72185 72186 72187 72188 72189 72190 72191 72192 72193 72194 72195 72196 72197 72198 72199 72200 72201 72202 72203 72204 72205 72206 72207 72208 72209 72210 72211 72212 72213 72214 72215 72216 72217 72218 72219 72220 72221 72222 72223 72224 72225 72226 72227 72228 72229 72230 72231 72232 72233 72234 72235 72236 72237 72238 72239 72240 72241 72242 72243 72244 72245 72246 72247 72248 72249 72250 72251 72252 72253 72254 72255 72256 72257 72258 72259 72260 72261 72262 72263 72264 72265 72266 72267 72268 72269 72270 72271 72272 72273 72274 72275 72276 72277 72278 72279 72280 72281 72282 72283 72284 72285 72286 72287 72288 72289 72290 72291 72292 72293 72294 72295 72296 72297 72298 72299 72300 72301 72302 72303 72304 72305 72306 72307 72308 72309 72310 72311 72312 72313 72314 72315 72316 72317 72318 72319 72320 72321 72322 72323 72324 72325 72326 72327 72328 72329 72330 72331 72332 72333 72334 72335 72336 72337 72338 72339 72340 72341 72342 72343 72344 72345 72346 72347 72348 72349 72350 72351 72352 72353 72354 72355 72356 72357 72358 72359 72360 72361 72362 72363 72364 72365 72366 72367 72368 72369 72370 72371 72372 72373 72374 72375 72376 72377 72378 72379 72380 72381 72382 72383 72384 72385 72386 72387 72388 72389 72390 72391 72392 72393 72394 72395 72396 72397 72398 72399 72400 72401 72402 72403 72404 72405 72406 72407 72408 72409 72410 72411 72412 72413 72414 72415 72416 72417 72418 72419 72420 72421 72422 72423 72424 72425 72426 72427 72428 72429 72430 72431 72432 72433 72434 72435 72436 72437 72438 72439 72440 72441 72442 72443 72444 72445 72446 72447 72448 72449 72450 72451 72452 72453 72454 72455 72456 72457 72458 72459 72460 72461 72462 72463 72464 72465 72466 72467 72468 72469 72470 72471 72472 72473 72474 72475 72476 72477 72478 72479 72480 72481 72482 72483 72484 72485 72486 72487 72488 72489 72490 72491 72492 72493 72494 72495 72496 72497 72498 72499 72500 72501 72502 72503 72504 72505 72506 72507 72508 72509 72510 72511 72512 72513 72514 72515 72516 72517 72518 72519 72520 72521 72522 72523 72524 72525 72526 72527 72528 72529 72530 72531 72532 72533 72534 72535 72536 72537 72538 72539 72540 72541 72542 72543 72544 72545 72546 72547 72548 72549 72550 72551 72552 72553 72554 72555 72556 72557 72558 72559 72560 72561 72562 72563 72564 72565 72566 72567 72568 72569 72570 72571 72572 72573 72574 72575 72576 72577 72578 72579 72580 72581 72582 72583 72584 72585 72586 72587 72588 72589 72590 72591 72592 72593 72594 72595 72596 72597 72598 72599 72600 72601 72602 72603 72604 72605 72606 72607 72608 72609 72610 72611 72612 72613 72614 72615 72616 72617 72618 72619 72620 72621 72622 72623 72624 72625 72626 72627 72628 72629 72630 72631 72632 72633 72634 72635 72636 72637 72638 72639 72640 72641 72642 72643 72644 72645 72646 72647 72648 72649 72650 72651 72652 72653 72654 72655 72656 72657 72658 72659 72660 72661 72662 72663 72664 72665 72666 72667 72668 72669 72670 72671 72672 72673 72674 72675 72676 72677 72678 72679 72680 72681 72682 72683 72684 72685 72686 72687 72688 72689 72690 72691 72692 72693 72694 72695 72696 72697 72698 72699 72700 72701 72702 72703 72704 72705 72706 72707 72708 72709 72710 72711 72712 72713 72714 72715 72716 72717 72718 72719 72720 72721 72722 72723 72724 72725 72726 72727 72728 72729 72730 72731 72732 72733 72734 72735 72736 72737 72738 72739 72740 72741 72742 72743 72744 72745 72746 72747 72748 72749 72750 72751 72752 72753 72754 72755 72756 72757 72758 72759 72760 72761 72762 72763 72764 72765 72766 72767 72768 72769 72770 72771 72772 72773 72774 72775 72776 72777 72778 72779 72780 72781 72782 72783 72784 72785 72786 72787 72788 72789 72790 72791 72792 72793 72794 72795 72796 72797 72798 72799 72800 72801 72802 72803 72804 72805 72806 72807 72808 72809 72810 72811 72812 72813 72814 72815 72816 72817 72818 72819 72820 72821 72822 72823 72824 72825 72826 72827 72828 72829 72830 72831 72832 72833 72834 72835 72836 72837 72838 72839 72840 72841 72842 72843 72844 72845 72846 72847 72848 72849 72850 72851 72852 72853 72854 72855 72856 72857 72858 72859 72860 72861 72862 72863 72864 72865 72866 72867 72868 72869 72870 72871 72872 72873 72874 72875 72876 72877 72878 72879 72880 72881 72882 72883 72884 72885 72886 72887 72888 72889 72890 72891 72892 72893 72894 72895 72896 72897 72898 72899 72900 72901 72902 72903 72904 72905 72906 72907 72908 72909 72910 72911 72912 72913 72914 72915 72916 72917 72918 72919 72920 72921 72922 72923 72924 72925 72926 72927 72928 72929 72930 72931 72932 72933 72934 72935 72936 72937 72938 72939 72940 72941 72942 72943 72944 72945 72946 72947 72948 72949 72950 72951 72952 72953 72954 72955 72956 72957 72958 72959 72960 72961 72962 72963 72964 72965 72966 72967 72968 72969 72970 72971 72972 72973 72974 72975 72976 72977 72978 72979 72980 72981 72982 72983 72984 72985 72986 72987 72988 72989 72990 72991 72992 72993 72994 72995 72996 72997 72998 72999 73000 73001 73002 73003 73004 73005 73006 73007 73008 73009 73010 73011 73012 73013 73014 73015 73016 73017 73018 73019 73020 73021 73022 73023 73024 73025 73026 73027 73028 73029 73030 73031 73032 73033 73034 73035 73036 73037 73038 73039 73040 73041 73042 73043 73044 73045 73046 73047 73048 73049 73050 73051 73052 73053 73054 73055 73056 73057 73058 73059 73060 73061 73062 73063 73064 73065 73066 73067 73068 73069 73070 73071 73072 73073 73074 73075 73076 73077 73078 73079 73080 73081 73082 73083 73084 73085 73086 73087 73088 73089 73090 73091 73092 73093 73094 73095 73096 73097 73098 73099 73100 73101 73102 73103 73104 73105 73106 73107 73108 73109 73110 73111 73112 73113 73114 73115 73116 73117 73118 73119 73120 73121 73122 73123 73124 73125 73126 73127 73128 73129 73130 73131 73132 73133 73134 73135 73136 73137 73138 73139 73140 73141 73142 73143 73144 73145 73146 73147 73148 73149 73150 73151 73152 73153 73154 73155 73156 73157 73158 73159 73160 73161 73162 73163 73164 73165 73166 73167 73168 73169 73170 73171 73172 73173 73174 73175 73176 73177 73178 73179 73180 73181 73182 73183 73184 73185 73186 73187 73188 73189 73190 73191 73192 73193 73194 73195 73196 73197 73198 73199 73200 73201 73202 73203 73204 73205 73206 73207 73208 73209 73210 73211 73212 73213 73214 73215 73216 73217 73218 73219 73220 73221 73222 73223 73224 73225 73226 73227 73228 73229 73230 73231 73232 73233 73234 73235 73236 73237 73238 73239 73240 73241 73242 73243 73244 73245 73246 73247 73248 73249 73250 73251 73252 73253 73254 73255 73256 73257 73258 73259 73260 73261 73262 73263 73264 73265 73266 73267 73268 73269 73270 73271 73272 73273 73274 73275 73276 73277 73278 73279 73280 73281 73282 73283 73284 73285 73286 73287 73288 73289 73290 73291 73292 73293 73294 73295 73296 73297 73298 73299 73300 73301 73302 73303 73304 73305 73306 73307 73308 73309 73310 73311 73312 73313 73314 73315 73316 73317 73318 73319 73320 73321 73322 73323 73324 73325 73326 73327 73328 73329 73330 73331 73332 73333 73334 73335 73336 73337 73338 73339 73340 73341 73342 73343 73344 73345 73346 73347 73348 73349 73350 73351 73352 73353 73354 73355 73356 73357 73358 73359 73360 73361 73362 73363 73364 73365 73366 73367 73368 73369 73370 73371 73372 73373 73374 73375 73376 73377 73378 73379 73380 73381 73382 73383 73384 73385 73386 73387 73388 73389 73390 73391 73392 73393 73394 73395 73396 73397 73398 73399 73400 73401 73402 73403 73404 73405 73406 73407 73408 73409 73410 73411 73412 73413 73414 73415 73416 73417 73418 73419 73420 73421 73422 73423 73424 73425 73426 73427 73428 73429 73430 73431 73432 73433 73434 73435 73436 73437 73438 73439 73440 73441 73442 73443 73444 73445 73446 73447 73448 73449 73450 73451 73452 73453 73454 73455 73456 73457 73458 73459 73460 73461 73462 73463 73464 73465 73466 73467 73468 73469 73470 73471 73472 73473 73474 73475 73476 73477 73478 73479 73480 73481 73482 73483 73484 73485 73486 73487 73488 73489 73490 73491 73492 73493 73494 73495 73496 73497 73498 73499 73500 73501 73502 73503 73504 73505 73506 73507 73508 73509 73510 73511 73512 73513 73514 73515 73516 73517 73518 73519 73520 73521 73522 73523 73524 73525 73526 73527 73528 73529 73530 73531 73532 73533 73534 73535 73536 73537 73538 73539 73540 73541 73542 73543 73544 73545 73546 73547 73548 73549 73550 73551 73552 73553 73554 73555 73556 73557 73558 73559 73560 73561 73562 73563 73564 73565 73566 73567 73568 73569 73570 73571 73572 73573 73574 73575 73576 73577 73578 73579 73580 73581 73582 73583 73584 73585 73586 73587 73588 73589 73590 73591 73592 73593 73594 73595 73596 73597 73598 73599 73600 73601 73602 73603 73604 73605 73606 73607 73608 73609 73610 73611 73612 73613 73614 73615 73616 73617 73618 73619 73620 73621 73622 73623 73624 73625 73626 73627 73628 73629 73630 73631 73632 73633 73634 73635 73636 73637 73638 73639 73640 73641 73642 73643 73644 73645 73646 73647 73648 73649 73650 73651 73652 73653 73654 73655 73656 73657 73658 73659 73660 73661 73662 73663 73664 73665 73666 73667 73668 73669 73670 73671 73672 73673 73674 73675 73676 73677 73678 73679 73680 73681 73682 73683 73684 73685 73686 73687 73688 73689 73690 73691 73692 73693 73694 73695 73696 73697 73698 73699 73700 73701 73702 73703 73704 73705 73706 73707 73708 73709 73710 73711 73712 73713 73714 73715 73716 73717 73718 73719 73720 73721 73722 73723 73724 73725 73726 73727 73728 73729 73730 73731 73732 73733 73734 73735 73736 73737 73738 73739 73740 73741 73742 73743 73744 73745 73746 73747 73748 73749 73750 73751 73752 73753 73754 73755 73756 73757 73758 73759 73760 73761 73762 73763 73764 73765 73766 73767 73768 73769 73770 73771 73772 73773 73774 73775 73776 73777 73778 73779 73780 73781 73782 73783 73784 73785 73786 73787 73788 73789 73790 73791 73792 73793 73794 73795 73796 73797 73798 73799 73800 73801 73802 73803 73804 73805 73806 73807 73808 73809 73810 73811 73812 73813 73814 73815 73816 73817 73818 73819 73820 73821 73822 73823 73824 73825 73826 73827 73828 73829 73830 73831 73832 73833 73834 73835 73836 73837 73838 73839 73840 73841 73842 73843 73844 73845 73846 73847 73848 73849 73850 73851 73852 73853 73854 73855 73856 73857 73858 73859 73860 73861 73862 73863 73864 73865 73866 73867 73868 73869 73870 73871 73872 73873 73874 73875 73876 73877 73878 73879 73880 73881 73882 73883 73884 73885 73886 73887 73888 73889 73890 73891 73892 73893 73894 73895 73896 73897 73898 73899 73900 73901 73902 73903 73904 73905 73906 73907 73908 73909 73910 73911 73912 73913 73914 73915 73916 73917 73918 73919 73920 73921 73922 73923 73924 73925 73926 73927 73928 73929 73930 73931 73932 73933 73934 73935 73936 73937 73938 73939 73940 73941 73942 73943 73944 73945 73946 73947 73948 73949 73950 73951 73952 73953 73954 73955 73956 73957 73958 73959 73960 73961 73962 73963 73964 73965 73966 73967 73968 73969 73970 73971 73972 73973 73974 73975 73976 73977 73978 73979 73980 73981 73982 73983 73984 73985 73986 73987 73988 73989 73990 73991 73992 73993 73994 73995 73996 73997 73998 73999 74000 74001 74002 74003 74004 74005 74006 74007 74008 74009 74010 74011 74012 74013 74014 74015 74016 74017 74018 74019 74020 74021 74022 74023 74024 74025 74026 74027 74028 74029 74030 74031 74032 74033 74034 74035 74036 74037 74038 74039 74040 74041 74042 74043 74044 74045 74046 74047 74048 74049 74050 74051 74052 74053 74054 74055 74056 74057 74058 74059 74060 74061 74062 74063 74064 74065 74066 74067 74068 74069 74070 74071 74072 74073 74074 74075 74076 74077 74078 74079 74080 74081 74082 74083 74084 74085 74086 74087 74088 74089 74090 74091 74092 74093 74094 74095 74096 74097 74098 74099 74100 74101 74102 74103 74104 74105 74106 74107 74108 74109 74110 74111 74112 74113 74114 74115 74116 74117 74118 74119 74120 74121 74122 74123 74124 74125 74126 74127 74128 74129 74130 74131 74132 74133 74134 74135 74136 74137 74138 74139 74140 74141 74142 74143 74144 74145 74146 74147 74148 74149 74150 74151 74152 74153 74154 74155 74156 74157 74158 74159 74160 74161 74162 74163 74164 74165 74166 74167 74168 74169 74170 74171 74172 74173 74174 74175 74176 74177 74178 74179 74180 74181 74182 74183 74184 74185 74186 74187 74188 74189 74190 74191 74192 74193 74194 74195 74196 74197 74198 74199 74200 74201 74202 74203 74204 74205 74206 74207 74208 74209 74210 74211 74212 74213 74214 74215 74216 74217 74218 74219 74220 74221 74222 74223 74224 74225 74226 74227 74228 74229 74230 74231 74232 74233 74234 74235 74236 74237 74238 74239 74240 74241 74242 74243 74244 74245 74246 74247 74248 74249 74250 74251 74252 74253 74254 74255 74256 74257 74258 74259 74260 74261 74262 74263 74264 74265 74266 74267 74268 74269 74270 74271 74272 74273 74274 74275 74276 74277 74278 74279 74280 74281 74282 74283 74284 74285 74286 74287 74288 74289 74290 74291 74292 74293 74294 74295 74296 74297 74298 74299 74300 74301 74302 74303 74304 74305 74306 74307 74308 74309 74310 74311 74312 74313 74314 74315 74316 74317 74318 74319 74320 74321 74322 74323 74324 74325 74326 74327 74328 74329 74330 74331 74332 74333 74334 74335 74336 74337 74338 74339 74340 74341 74342 74343 74344 74345 74346 74347 74348 74349 74350 74351 74352 74353 74354 74355 74356 74357 74358 74359 74360 74361 74362 74363 74364 74365 74366 74367 74368 74369 74370 74371 74372 74373 74374 74375 74376 74377 74378 74379 74380 74381 74382 74383 74384 74385 74386 74387 74388 74389 74390 74391 74392 74393 74394 74395 74396 74397 74398 74399 74400 74401 74402 74403 74404 74405 74406 74407 74408 74409 74410 74411 74412 74413 74414 74415 74416 74417 74418 74419 74420 74421 74422 74423 74424 74425 74426 74427 74428 74429 74430 74431 74432 74433 74434 74435 74436 74437 74438 74439 74440 74441 74442 74443 74444 74445 74446 74447 74448 74449 74450 74451 74452 74453 74454 74455 74456 74457 74458 74459 74460 74461 74462 74463 74464 74465 74466 74467 74468 74469 74470 74471 74472 74473 74474 74475 74476 74477 74478 74479 74480 74481 74482 74483 74484 74485 74486 74487 74488 74489 74490 74491 74492 74493 74494 74495 74496 74497 74498 74499 74500 74501 74502 74503 74504 74505 74506 74507 74508 74509 74510 74511 74512 74513 74514 74515 74516 74517 74518 74519 74520 74521 74522 74523 74524 74525 74526 74527 74528 74529 74530 74531 74532 74533 74534 74535 74536 74537 74538 74539 74540 74541 74542 74543 74544 74545 74546 74547 74548 74549 74550 74551 74552 74553 74554 74555 74556 74557 74558 74559 74560 74561 74562 74563 74564 74565 74566 74567 74568 74569 74570 74571 74572 74573 74574 74575 74576 74577 74578 74579 74580 74581 74582 74583 74584 74585 74586 74587 74588 74589 74590 74591 74592 74593 74594 74595 74596 74597 74598 74599 74600 74601 74602 74603 74604 74605 74606 74607 74608 74609 74610 74611 74612 74613 74614 74615 74616 74617 74618 74619 74620 74621 74622 74623 74624 74625 74626 74627 74628 74629 74630 74631 74632 74633 74634 74635 74636 74637 74638 74639 74640 74641 74642 74643 74644 74645 74646 74647 74648 74649 74650 74651 74652 74653 74654 74655 74656 74657 74658 74659 74660 74661 74662 74663 74664 74665 74666 74667 74668 74669 74670 74671 74672 74673 74674 74675 74676 74677 74678 74679 74680 74681 74682 74683 74684 74685 74686 74687 74688 74689 74690 74691 74692 74693 74694 74695 74696 74697 74698 74699 74700 74701 74702 74703 74704 74705 74706 74707 74708 74709 74710 74711 74712 74713 74714 74715 74716 74717 74718 74719 74720 74721 74722 74723 74724 74725 74726 74727 74728 74729 74730 74731 74732 74733 74734 74735 74736 74737 74738 74739 74740 74741 74742 74743 74744 74745 74746 74747 74748 74749 74750 74751 74752 74753 74754 74755 74756 74757 74758 74759 74760 74761 74762 74763 74764 74765 74766 74767 74768 74769 74770 74771 74772 74773 74774 74775 74776 74777 74778 74779 74780 74781 74782 74783 74784 74785 74786 74787 74788 74789 74790 74791 74792 74793 74794 74795 74796 74797 74798 74799 74800 74801 74802 74803 74804 74805 74806 74807 74808 74809 74810 74811 74812 74813 74814 74815 74816 74817 74818 74819 74820 74821 74822 74823 74824 74825 74826 74827 74828 74829 74830 74831 74832 74833 74834 74835 74836 74837 74838 74839 74840 74841 74842 74843 74844 74845 74846 74847 74848 74849 74850 74851 74852 74853 74854 74855 74856 74857 74858 74859 74860 74861 74862 74863 74864 74865 74866 74867 74868 74869 74870 74871 74872 74873 74874 74875 74876 74877 74878 74879 74880 74881 74882 74883 74884 74885 74886 74887 74888 74889 74890 74891 74892 74893 74894 74895 74896 74897 74898 74899 74900 74901 74902 74903 74904 74905 74906 74907 74908 74909 74910 74911 74912 74913 74914 74915 74916 74917 74918 74919 74920 74921 74922 74923 74924 74925 74926 74927 74928 74929 74930 74931 74932 74933 74934 74935 74936 74937 74938 74939 74940 74941 74942 74943 74944 74945 74946 74947 74948 74949 74950 74951 74952 74953 74954 74955 74956 74957 74958 74959 74960 74961 74962 74963 74964 74965 74966 74967 74968 74969 74970 74971 74972 74973 74974 74975 74976 74977 74978 74979 74980 74981 74982 74983 74984 74985 74986 74987 74988 74989 74990 74991 74992 74993 74994 74995 74996 74997 74998 74999 75000 75001 75002 75003 75004 75005 75006 75007 75008 75009 75010 75011 75012 75013 75014 75015 75016 75017 75018 75019 75020 75021 75022 75023 75024 75025 75026 75027 75028 75029 75030 75031 75032 75033 75034 75035 75036 75037 75038 75039 75040 75041 75042 75043 75044 75045 75046 75047 75048 75049 75050 75051 75052 75053 75054 75055 75056 75057 75058 75059 75060 75061 75062 75063 75064 75065 75066 75067 75068 75069 75070 75071 75072 75073 75074 75075 75076 75077 75078 75079 75080 75081 75082 75083 75084 75085 75086 75087 75088 75089 75090 75091 75092 75093 75094 75095 75096 75097 75098 75099 75100 75101 75102 75103 75104 75105 75106 75107 75108 75109 75110 75111 75112 75113 75114 75115 75116 75117 75118 75119 75120 75121 75122 75123 75124 75125 75126 75127 75128 75129 75130 75131 75132 75133 75134 75135 75136 75137 75138 75139 75140 75141 75142 75143 75144 75145 75146 75147 75148 75149 75150 75151 75152 75153 75154 75155 75156 75157 75158 75159 75160 75161 75162 75163 75164 75165 75166 75167 75168 75169 75170 75171 75172 75173 75174 75175 75176 75177 75178 75179 75180 75181 75182 75183 75184 75185 75186 75187 75188 75189 75190 75191 75192 75193 75194 75195 75196 75197 75198 75199 75200 75201 75202 75203 75204 75205 75206 75207 75208 75209 75210 75211 75212 75213 75214 75215 75216 75217 75218 75219 75220 75221 75222 75223 75224 75225 75226 75227 75228 75229 75230 75231 75232 75233 75234 75235 75236 75237 75238 75239 75240 75241 75242 75243 75244 75245 75246 75247 75248 75249 75250 75251 75252 75253 75254 75255 75256 75257 75258 75259 75260 75261 75262 75263 75264 75265 75266 75267 75268 75269 75270 75271 75272 75273 75274 75275 75276 75277 75278 75279 75280 75281 75282 75283 75284 75285 75286 75287 75288 75289 75290 75291 75292 75293 75294 75295 75296 75297 75298 75299 75300 75301 75302 75303 75304 75305 75306 75307 75308 75309 75310 75311 75312 75313 75314 75315 75316 75317 75318 75319 75320 75321 75322 75323 75324 75325 75326 75327 75328 75329 75330 75331 75332 75333 75334 75335 75336 75337 75338 75339 75340 75341 75342 75343 75344 75345 75346 75347 75348 75349 75350 75351 75352 75353 75354 75355 75356 75357 75358 75359 75360 75361 75362 75363 75364 75365 75366 75367 75368 75369 75370 75371 75372 75373 75374 75375 75376 75377 75378 75379 75380 75381 75382 75383 75384 75385 75386 75387 75388 75389 75390 75391 75392 75393 75394 75395 75396 75397 75398 75399 75400 75401 75402 75403 75404 75405 75406 75407 75408 75409 75410 75411 75412 75413 75414 75415 75416 75417 75418 75419 75420 75421 75422 75423 75424 75425 75426 75427 75428 75429 75430 75431 75432 75433 75434 75435 75436 75437 75438 75439 75440 75441 75442 75443 75444 75445 75446 75447 75448 75449 75450 75451 75452 75453 75454 75455 75456 75457 75458 75459 75460 75461 75462 75463 75464 75465 75466 75467 75468 75469 75470 75471 75472 75473 75474 75475 75476 75477 75478 75479 75480 75481 75482 75483 75484 75485 75486 75487 75488 75489 75490 75491 75492 75493 75494 75495 75496 75497 75498 75499 75500 75501 75502 75503 75504 75505 75506 75507 75508 75509 75510 75511 75512 75513 75514 75515 75516 75517 75518 75519 75520 75521 75522 75523 75524 75525 75526 75527 75528 75529 75530 75531 75532 75533 75534 75535 75536 75537 75538 75539 75540 75541 75542 75543 75544 75545 75546 75547 75548 75549 75550 75551 75552 75553 75554 75555 75556 75557 75558 75559 75560 75561 75562 75563 75564 75565 75566 75567 75568 75569 75570 75571 75572 75573 75574 75575 75576 75577 75578 75579 75580 75581 75582 75583 75584 75585 75586 75587 75588 75589 75590 75591 75592 75593 75594 75595 75596 75597 75598 75599 75600 75601 75602 75603 75604 75605 75606 75607 75608 75609 75610 75611 75612 75613 75614 75615 75616 75617 75618 75619 75620 75621 75622 75623 75624 75625 75626 75627 75628 75629 75630 75631 75632 75633 75634 75635 75636 75637 75638 75639 75640 75641 75642 75643 75644 75645 75646 75647 75648 75649 75650 75651 75652 75653 75654 75655 75656 75657 75658 75659 75660 75661 75662 75663 75664 75665 75666 75667 75668 75669 75670 75671 75672 75673 75674 75675 75676 75677 75678 75679 75680 75681 75682 75683 75684 75685 75686 75687 75688 75689 75690 75691 75692 75693 75694 75695 75696 75697 75698 75699 75700 75701 75702 75703 75704 75705 75706 75707 75708 75709 75710 75711 75712 75713 75714 75715 75716 75717 75718 75719 75720 75721 75722 75723 75724 75725 75726 75727 75728 75729 75730 75731 75732 75733 75734 75735 75736 75737 75738 75739 75740 75741 75742 75743 75744 75745 75746 75747 75748 75749 75750 75751 75752 75753 75754 75755 75756 75757 75758 75759 75760 75761 75762 75763 75764 75765 75766 75767 75768 75769 75770 75771 75772 75773 75774 75775 75776 75777 75778 75779 75780 75781 75782 75783 75784 75785 75786 75787 75788 75789 75790 75791 75792 75793 75794 75795 75796 75797 75798 75799 75800 75801 75802 75803 75804 75805 75806 75807 75808 75809 75810 75811 75812 75813 75814 75815 75816 75817 75818 75819 75820 75821 75822 75823 75824 75825 75826 75827 75828 75829 75830 75831 75832 75833 75834 75835 75836 75837 75838 75839 75840 75841 75842 75843 75844 75845 75846 75847 75848 75849 75850 75851 75852 75853 75854 75855 75856 75857 75858 75859 75860 75861 75862 75863 75864 75865 75866 75867 75868 75869 75870 75871 75872 75873 75874 75875 75876 75877 75878 75879 75880 75881 75882 75883 75884 75885 75886 75887 75888 75889 75890 75891 75892 75893 75894 75895 75896 75897 75898 75899 75900 75901 75902 75903 75904 75905 75906 75907 75908 75909 75910 75911 75912 75913 75914 75915 75916 75917 75918 75919 75920 75921 75922 75923 75924 75925 75926 75927 75928 75929 75930 75931 75932 75933 75934 75935 75936 75937 75938 75939 75940 75941 75942 75943 75944 75945 75946 75947 75948 75949 75950 75951 75952 75953 75954 75955 75956 75957 75958 75959 75960 75961 75962 75963 75964 75965 75966 75967 75968 75969 75970 75971 75972 75973 75974 75975 75976 75977 75978 75979 75980 75981 75982 75983 75984 75985 75986 75987 75988 75989 75990 75991 75992 75993 75994 75995 75996 75997 75998 75999 76000 76001 76002 76003 76004 76005 76006 76007 76008 76009 76010 76011 76012 76013 76014 76015 76016 76017 76018 76019 76020 76021 76022 76023 76024 76025 76026 76027 76028 76029 76030 76031 76032 76033 76034 76035 76036 76037 76038 76039 76040 76041 76042 76043 76044 76045 76046 76047 76048 76049 76050 76051 76052 76053 76054 76055 76056 76057 76058 76059 76060 76061 76062 76063 76064 76065 76066 76067 76068 76069 76070 76071 76072 76073 76074 76075 76076 76077 76078 76079 76080 76081 76082 76083 76084 76085 76086 76087 76088 76089 76090 76091 76092 76093 76094 76095 76096 76097 76098 76099 76100 76101 76102 76103 76104 76105 76106 76107 76108 76109 76110 76111 76112 76113 76114 76115 76116 76117 76118 76119 76120 76121 76122 76123 76124 76125 76126 76127 76128 76129 76130 76131 76132 76133 76134 76135 76136 76137 76138 76139 76140 76141 76142 76143 76144 76145 76146 76147 76148 76149 76150 76151 76152 76153 76154 76155 76156 76157 76158 76159 76160 76161 76162 76163 76164 76165 76166 76167 76168 76169 76170 76171 76172 76173 76174 76175 76176 76177 76178 76179 76180 76181 76182 76183 76184 76185 76186 76187 76188 76189 76190 76191 76192 76193 76194 76195 76196 76197 76198 76199 76200 76201 76202 76203 76204 76205 76206 76207 76208 76209 76210 76211 76212 76213 76214 76215 76216 76217 76218 76219 76220 76221 76222 76223 76224 76225 76226 76227 76228 76229 76230 76231 76232 76233 76234 76235 76236 76237 76238 76239 76240 76241 76242 76243 76244 76245 76246 76247 76248 76249 76250 76251 76252 76253 76254 76255 76256 76257 76258 76259 76260 76261 76262 76263 76264 76265 76266 76267 76268 76269 76270 76271 76272 76273 76274 76275 76276 76277 76278 76279 76280 76281 76282 76283 76284 76285 76286 76287 76288 76289 76290 76291 76292 76293 76294 76295 76296 76297 76298 76299 76300 76301 76302 76303 76304 76305 76306 76307 76308 76309 76310 76311 76312 76313 76314 76315 76316 76317 76318 76319 76320 76321 76322 76323 76324 76325 76326 76327 76328 76329 76330 76331 76332 76333 76334 76335 76336 76337 76338 76339 76340 76341 76342 76343 76344 76345 76346 76347 76348 76349 76350 76351 76352 76353 76354 76355 76356 76357 76358 76359 76360 76361 76362 76363 76364 76365 76366 76367 76368 76369 76370 76371 76372 76373 76374 76375 76376 76377 76378 76379 76380 76381 76382 76383 76384 76385 76386 76387 76388 76389 76390 76391 76392 76393 76394 76395 76396 76397 76398 76399 76400 76401 76402 76403 76404 76405 76406 76407 76408 76409 76410 76411 76412 76413 76414 76415 76416 76417 76418 76419 76420 76421 76422 76423 76424 76425 76426 76427 76428 76429 76430 76431 76432 76433 76434 76435 76436 76437 76438 76439 76440 76441 76442 76443 76444 76445 76446 76447 76448 76449 76450 76451 76452 76453 76454 76455 76456 76457 76458 76459 76460 76461 76462 76463 76464 76465 76466 76467 76468 76469 76470 76471 76472 76473 76474 76475 76476 76477 76478 76479 76480 76481 76482 76483 76484 76485 76486 76487 76488 76489 76490 76491 76492 76493 76494 76495 76496 76497 76498 76499 76500 76501 76502 76503 76504 76505 76506 76507 76508 76509 76510 76511 76512 76513 76514 76515 76516 76517 76518 76519 76520 76521 76522 76523 76524 76525 76526 76527 76528 76529 76530 76531 76532 76533 76534 76535 76536 76537 76538 76539 76540 76541 76542 76543 76544 76545 76546 76547 76548 76549 76550 76551 76552 76553 76554 76555 76556 76557 76558 76559 76560 76561 76562 76563 76564 76565 76566 76567 76568 76569 76570 76571 76572 76573 76574 76575 76576 76577 76578 76579 76580 76581 76582 76583 76584 76585 76586 76587 76588 76589 76590 76591 76592 76593 76594 76595 76596 76597 76598 76599 76600 76601 76602 76603 76604 76605 76606 76607 76608 76609 76610 76611 76612 76613 76614 76615 76616 76617 76618 76619 76620 76621 76622 76623 76624 76625 76626 76627 76628 76629 76630 76631 76632 76633 76634 76635 76636 76637 76638 76639 76640 76641 76642 76643 76644 76645 76646 76647 76648 76649 76650 76651 76652 76653 76654 76655 76656 76657 76658 76659 76660 76661 76662 76663 76664 76665 76666 76667 76668 76669 76670 76671 76672 76673 76674 76675 76676 76677 76678 76679 76680 76681 76682 76683 76684 76685 76686 76687 76688 76689 76690 76691 76692 76693 76694 76695 76696 76697 76698 76699 76700 76701 76702 76703 76704 76705 76706 76707 76708 76709 76710 76711 76712 76713 76714 76715 76716 76717 76718 76719 76720 76721 76722 76723 76724 76725 76726 76727 76728 76729 76730 76731 76732 76733 76734 76735 76736 76737 76738 76739 76740 76741 76742 76743 76744 76745 76746 76747 76748 76749 76750 76751 76752 76753 76754 76755 76756 76757 76758 76759 76760 76761 76762 76763 76764 76765 76766 76767 76768 76769 76770 76771 76772 76773 76774 76775 76776 76777 76778 76779 76780 76781 76782 76783 76784 76785 76786 76787 76788 76789 76790 76791 76792 76793 76794 76795 76796 76797 76798 76799 76800 76801 76802 76803 76804 76805 76806 76807 76808 76809 76810 76811 76812 76813 76814 76815 76816 76817 76818 76819 76820 76821 76822 76823 76824 76825 76826 76827 76828 76829 76830 76831 76832 76833 76834 76835 76836 76837 76838 76839 76840 76841 76842 76843 76844 76845 76846 76847 76848 76849 76850 76851 76852 76853 76854 76855 76856 76857 76858 76859 76860 76861 76862 76863 76864 76865 76866 76867 76868 76869 76870 76871 76872 76873 76874 76875 76876 76877 76878 76879 76880 76881 76882 76883 76884 76885 76886 76887 76888 76889 76890 76891 76892 76893 76894 76895 76896 76897 76898 76899 76900 76901 76902 76903 76904 76905 76906 76907 76908 76909 76910 76911 76912 76913 76914 76915 76916 76917 76918 76919 76920 76921 76922 76923 76924 76925 76926 76927 76928 76929 76930 76931 76932 76933 76934 76935 76936 76937 76938 76939 76940 76941 76942 76943 76944 76945 76946 76947 76948 76949 76950 76951 76952 76953 76954 76955 76956 76957 76958 76959 76960 76961 76962 76963 76964 76965 76966 76967 76968 76969 76970 76971 76972 76973 76974 76975 76976 76977 76978 76979 76980 76981 76982 76983 76984 76985 76986 76987 76988 76989 76990 76991 76992 76993 76994 76995 76996 76997 76998 76999 77000 77001 77002 77003 77004 77005 77006 77007 77008 77009 77010 77011 77012 77013 77014 77015 77016 77017 77018 77019 77020 77021 77022 77023 77024 77025 77026 77027 77028 77029 77030 77031 77032 77033 77034 77035 77036 77037 77038 77039 77040 77041 77042 77043 77044 77045 77046 77047 77048 77049 77050 77051 77052 77053 77054 77055 77056 77057 77058 77059 77060 77061 77062 77063 77064 77065 77066 77067 77068 77069 77070 77071 77072 77073 77074 77075 77076 77077 77078 77079 77080 77081 77082 77083 77084 77085 77086 77087 77088 77089 77090 77091 77092 77093 77094 77095 77096 77097 77098 77099 77100 77101 77102 77103 77104 77105 77106 77107 77108 77109 77110 77111 77112 77113 77114 77115 77116 77117 77118 77119 77120 77121 77122 77123 77124 77125 77126 77127 77128 77129 77130 77131 77132 77133 77134 77135 77136 77137 77138 77139 77140 77141 77142 77143 77144 77145 77146 77147 77148 77149 77150 77151 77152 77153 77154 77155 77156 77157 77158 77159 77160 77161 77162 77163 77164 77165 77166 77167 77168 77169 77170 77171 77172 77173 77174 77175 77176 77177 77178 77179 77180 77181 77182 77183 77184 77185 77186 77187 77188 77189 77190 77191 77192 77193 77194 77195 77196 77197 77198 77199 77200 77201 77202 77203 77204 77205 77206 77207 77208 77209 77210 77211 77212 77213 77214 77215 77216 77217 77218 77219 77220 77221 77222 77223 77224 77225 77226 77227 77228 77229 77230 77231 77232 77233 77234 77235 77236 77237 77238 77239 77240 77241 77242 77243 77244 77245 77246 77247 77248 77249 77250 77251 77252 77253 77254 77255 77256 77257 77258 77259 77260 77261 77262 77263 77264 77265 77266 77267 77268 77269 77270 77271 77272 77273 77274 77275 77276 77277 77278 77279 77280 77281 77282 77283 77284 77285 77286 77287 77288 77289 77290 77291 77292 77293 77294 77295 77296 77297 77298 77299 77300 77301 77302 77303 77304 77305 77306 77307 77308 77309 77310 77311 77312 77313 77314 77315 77316 77317 77318 77319 77320 77321 77322 77323 77324 77325 77326 77327 77328 77329 77330 77331 77332 77333 77334 77335 77336 77337 77338 77339 77340 77341 77342 77343 77344 77345 77346 77347 77348 77349 77350 77351 77352 77353 77354 77355 77356 77357 77358 77359 77360 77361 77362 77363 77364 77365 77366 77367 77368 77369 77370 77371 77372 77373 77374 77375 77376 77377 77378 77379 77380 77381 77382 77383 77384 77385 77386 77387 77388 77389 77390 77391 77392 77393 77394 77395 77396 77397 77398 77399 77400 77401 77402 77403 77404 77405 77406 77407 77408 77409 77410 77411 77412 77413 77414 77415 77416 77417 77418 77419 77420 77421 77422 77423 77424 77425 77426 77427 77428 77429 77430 77431 77432 77433 77434 77435 77436 77437 77438 77439 77440 77441 77442 77443 77444 77445 77446 77447 77448 77449 77450 77451 77452 77453 77454 77455 77456 77457 77458 77459 77460 77461 77462 77463 77464 77465 77466 77467 77468 77469 77470 77471 77472 77473 77474 77475 77476 77477 77478 77479 77480 77481 77482 77483 77484 77485 77486 77487 77488 77489 77490 77491 77492 77493 77494 77495 77496 77497 77498 77499 77500 77501 77502 77503 77504 77505 77506 77507 77508 77509 77510 77511 77512 77513 77514 77515 77516 77517 77518 77519 77520 77521 77522 77523 77524 77525 77526 77527 77528 77529 77530 77531 77532 77533 77534 77535 77536 77537 77538 77539 77540 77541 77542 77543 77544 77545 77546 77547 77548 77549 77550 77551 77552 77553 77554 77555 77556 77557 77558 77559 77560 77561 77562 77563 77564 77565 77566 77567 77568 77569 77570 77571 77572 77573 77574 77575 77576 77577 77578 77579 77580 77581 77582 77583 77584 77585 77586 77587 77588 77589 77590 77591 77592 77593 77594 77595 77596 77597 77598 77599 77600 77601 77602 77603 77604 77605 77606 77607 77608 77609 77610 77611 77612 77613 77614 77615 77616 77617 77618 77619 77620 77621 77622 77623 77624 77625 77626 77627 77628 77629 77630 77631 77632 77633 77634 77635 77636 77637 77638 77639 77640 77641 77642 77643 77644 77645 77646 77647 77648 77649 77650 77651 77652 77653 77654 77655 77656 77657 77658 77659 77660 77661 77662 77663 77664 77665 77666 77667 77668 77669 77670 77671 77672 77673 77674 77675 77676 77677 77678 77679 77680 77681 77682 77683 77684 77685 77686 77687 77688 77689 77690 77691 77692 77693 77694 77695 77696 77697 77698 77699 77700 77701 77702 77703 77704 77705 77706 77707 77708 77709 77710 77711 77712 77713 77714 77715 77716 77717 77718 77719 77720 77721 77722 77723 77724 77725 77726 77727 77728 77729 77730 77731 77732 77733 77734 77735 77736 77737 77738 77739 77740 77741 77742 77743 77744 77745 77746 77747 77748 77749 77750 77751 77752 77753 77754 77755 77756 77757 77758 77759 77760 77761 77762 77763 77764 77765 77766 77767 77768 77769 77770 77771 77772 77773 77774 77775 77776 77777 77778 77779 77780 77781 77782 77783 77784 77785 77786 77787 77788 77789 77790 77791 77792 77793 77794 77795 77796 77797 77798 77799 77800 77801 77802 77803 77804 77805 77806 77807 77808 77809 77810 77811 77812 77813 77814 77815 77816 77817 77818 77819 77820 77821 77822 77823 77824 77825 77826 77827 77828 77829 77830 77831 77832 77833 77834 77835 77836 77837 77838 77839 77840 77841 77842 77843 77844 77845 77846 77847 77848 77849 77850 77851 77852 77853 77854 77855 77856 77857 77858 77859 77860 77861 77862 77863 77864 77865 77866 77867 77868 77869 77870 77871 77872 77873 77874 77875 77876 77877 77878 77879 77880 77881 77882 77883 77884 77885 77886 77887 77888 77889 77890 77891 77892 77893 77894 77895 77896 77897 77898 77899 77900 77901 77902 77903 77904 77905 77906 77907 77908 77909 77910 77911 77912 77913 77914 77915 77916 77917 77918 77919 77920 77921 77922 77923 77924 77925 77926 77927 77928 77929 77930 77931 77932 77933 77934 77935 77936 77937 77938 77939 77940 77941 77942 77943 77944 77945 77946 77947 77948 77949 77950 77951 77952 77953 77954 77955 77956 77957 77958 77959 77960 77961 77962 77963 77964 77965 77966 77967 77968 77969 77970 77971 77972 77973 77974 77975 77976 77977 77978 77979 77980 77981 77982 77983 77984 77985 77986 77987 77988 77989 77990 77991 77992 77993 77994 77995 77996 77997 77998 77999 78000 78001 78002 78003 78004 78005 78006 78007 78008 78009 78010 78011 78012 78013 78014 78015 78016 78017 78018 78019 78020 78021 78022 78023 78024 78025 78026 78027 78028 78029 78030 78031 78032 78033 78034 78035 78036 78037 78038 78039 78040 78041 78042 78043 78044 78045 78046 78047 78048 78049 78050 78051 78052 78053 78054 78055 78056 78057 78058 78059 78060 78061 78062 78063 78064 78065 78066 78067 78068 78069 78070 78071 78072 78073 78074 78075 78076 78077 78078 78079 78080 78081 78082 78083 78084 78085 78086 78087 78088 78089 78090 78091 78092 78093 78094 78095 78096 78097 78098 78099 78100 78101 78102 78103 78104 78105 78106 78107 78108 78109 78110 78111 78112 78113 78114 78115 78116 78117 78118 78119 78120 78121 78122 78123 78124 78125 78126 78127 78128 78129 78130 78131 78132 78133 78134 78135 78136 78137 78138 78139 78140 78141 78142 78143 78144 78145 78146 78147 78148 78149 78150 78151 78152 78153 78154 78155 78156 78157 78158 78159 78160 78161 78162 78163 78164 78165 78166 78167 78168 78169 78170 78171 78172 78173 78174 78175 78176 78177 78178 78179 78180 78181 78182 78183 78184 78185 78186 78187 78188 78189 78190 78191 78192 78193 78194 78195 78196 78197 78198 78199 78200 78201 78202 78203 78204 78205 78206 78207 78208 78209 78210 78211 78212 78213 78214 78215 78216 78217 78218 78219 78220 78221 78222 78223 78224 78225 78226 78227 78228 78229 78230 78231 78232 78233 78234 78235 78236 78237 78238 78239 78240 78241 78242 78243 78244 78245 78246 78247 78248 78249 78250 78251 78252 78253 78254 78255 78256 78257 78258 78259 78260 78261 78262 78263 78264 78265 78266 78267 78268 78269 78270 78271 78272 78273 78274 78275 78276 78277 78278 78279 78280 78281 78282 78283 78284 78285 78286 78287 78288 78289 78290 78291 78292 78293 78294 78295 78296 78297 78298 78299 78300 78301 78302 78303 78304 78305 78306 78307 78308 78309 78310 78311 78312 78313 78314 78315 78316 78317 78318 78319 78320 78321 78322 78323 78324 78325 78326 78327 78328 78329 78330 78331 78332 78333 78334 78335 78336 78337 78338 78339 78340 78341 78342 78343 78344 78345 78346 78347 78348 78349 78350 78351 78352 78353 78354 78355 78356 78357 78358 78359 78360 78361 78362 78363 78364 78365 78366 78367 78368 78369 78370 78371 78372 78373 78374 78375 78376 78377 78378 78379 78380 78381 78382 78383 78384 78385 78386 78387 78388 78389 78390 78391 78392 78393 78394 78395 78396 78397 78398 78399 78400 78401 78402 78403 78404 78405 78406 78407 78408 78409 78410 78411 78412 78413 78414 78415 78416 78417 78418 78419 78420 78421 78422 78423 78424 78425 78426 78427 78428 78429 78430 78431 78432 78433 78434 78435 78436 78437 78438 78439 78440 78441 78442 78443 78444 78445 78446 78447 78448 78449 78450 78451 78452 78453 78454 78455 78456 78457 78458 78459 78460 78461 78462 78463 78464 78465 78466 78467 78468 78469 78470 78471 78472 78473 78474 78475 78476 78477 78478 78479 78480 78481 78482 78483 78484 78485 78486 78487 78488 78489 78490 78491 78492 78493 78494 78495 78496 78497 78498 78499 78500 78501 78502 78503 78504 78505 78506 78507 78508 78509 78510 78511 78512 78513 78514 78515 78516 78517 78518 78519 78520 78521 78522 78523 78524 78525 78526 78527 78528 78529 78530 78531 78532 78533 78534 78535 78536 78537 78538 78539 78540 78541 78542 78543 78544 78545 78546 78547 78548 78549 78550 78551 78552 78553 78554 78555 78556 78557 78558 78559 78560 78561 78562 78563 78564 78565 78566 78567 78568 78569 78570 78571 78572 78573 78574 78575 78576 78577 78578 78579 78580 78581 78582 78583 78584 78585 78586 78587 78588 78589 78590 78591 78592 78593 78594 78595 78596 78597 78598 78599 78600 78601 78602 78603 78604 78605 78606 78607 78608 78609 78610 78611 78612 78613 78614 78615 78616 78617 78618 78619 78620 78621 78622 78623 78624 78625 78626 78627 78628 78629 78630 78631 78632 78633 78634 78635 78636 78637 78638 78639 78640 78641 78642 78643 78644 78645 78646 78647 78648 78649 78650 78651 78652 78653 78654 78655 78656 78657 78658 78659 78660 78661 78662 78663 78664 78665 78666 78667 78668 78669 78670 78671 78672 78673 78674 78675 78676 78677 78678 78679 78680 78681 78682 78683 78684 78685 78686 78687 78688 78689 78690 78691 78692 78693 78694 78695 78696 78697 78698 78699 78700 78701 78702 78703 78704 78705 78706 78707 78708 78709 78710 78711 78712 78713 78714 78715 78716 78717 78718 78719 78720 78721 78722 78723 78724 78725 78726 78727 78728 78729 78730 78731 78732 78733 78734 78735 78736 78737 78738 78739 78740 78741 78742 78743 78744 78745 78746 78747 78748 78749 78750 78751 78752 78753 78754 78755 78756 78757 78758 78759 78760 78761 78762 78763 78764 78765 78766 78767 78768 78769 78770 78771 78772 78773 78774 78775 78776 78777 78778 78779 78780 78781 78782 78783 78784 78785 78786 78787 78788 78789 78790 78791 78792 78793 78794 78795 78796 78797 78798 78799 78800 78801 78802 78803 78804 78805 78806 78807 78808 78809 78810 78811 78812 78813 78814 78815 78816 78817 78818 78819 78820 78821 78822 78823 78824 78825 78826 78827 78828 78829 78830 78831 78832 78833 78834 78835 78836 78837 78838 78839 78840 78841 78842 78843 78844 78845 78846 78847 78848 78849 78850 78851 78852 78853 78854 78855 78856 78857 78858 78859 78860 78861 78862 78863 78864 78865 78866 78867 78868 78869 78870 78871 78872 78873 78874 78875 78876 78877 78878 78879 78880 78881 78882 78883 78884 78885 78886 78887 78888 78889 78890 78891 78892 78893 78894 78895 78896 78897 78898 78899 78900 78901 78902 78903 78904 78905 78906 78907 78908 78909 78910 78911 78912 78913 78914 78915 78916 78917 78918 78919 78920 78921 78922 78923 78924 78925 78926 78927 78928 78929 78930 78931 78932 78933 78934 78935 78936 78937 78938 78939 78940 78941 78942 78943 78944 78945 78946 78947 78948 78949 78950 78951 78952 78953 78954 78955 78956 78957 78958 78959 78960 78961 78962 78963 78964 78965 78966 78967 78968 78969 78970 78971 78972 78973 78974 78975 78976 78977 78978 78979 78980 78981 78982 78983 78984 78985 78986 78987 78988 78989 78990 78991 78992 78993 78994 78995 78996 78997 78998 78999 79000 79001 79002 79003 79004 79005 79006 79007 79008 79009 79010 79011 79012 79013 79014 79015 79016 79017 79018 79019 79020 79021 79022 79023 79024 79025 79026 79027 79028 79029 79030 79031 79032 79033 79034 79035 79036 79037 79038 79039 79040 79041 79042 79043 79044 79045 79046 79047 79048 79049 79050 79051 79052 79053 79054 79055 79056 79057 79058 79059 79060 79061 79062 79063 79064 79065 79066 79067 79068 79069 79070 79071 79072 79073 79074 79075 79076 79077 79078 79079 79080 79081 79082 79083 79084 79085 79086 79087 79088 79089 79090 79091 79092 79093 79094 79095 79096 79097 79098 79099 79100 79101 79102 79103 79104 79105 79106 79107 79108 79109 79110 79111 79112 79113 79114 79115 79116 79117 79118 79119 79120 79121 79122 79123 79124 79125 79126 79127 79128 79129 79130 79131 79132 79133 79134 79135 79136 79137 79138 79139 79140 79141 79142 79143 79144 79145 79146 79147 79148 79149 79150 79151 79152 79153 79154 79155 79156 79157 79158 79159 79160 79161 79162 79163 79164 79165 79166 79167 79168 79169 79170 79171 79172 79173 79174 79175 79176 79177 79178 79179 79180 79181 79182 79183 79184 79185 79186 79187 79188 79189 79190 79191 79192 79193 79194 79195 79196 79197 79198 79199 79200 79201 79202 79203 79204 79205 79206 79207 79208 79209 79210 79211 79212 79213 79214 79215 79216 79217 79218 79219 79220 79221 79222 79223 79224 79225 79226 79227 79228 79229 79230 79231 79232 79233 79234 79235 79236 79237 79238 79239 79240 79241 79242 79243 79244 79245 79246 79247 79248 79249 79250 79251 79252 79253 79254 79255 79256 79257 79258 79259 79260 79261 79262 79263 79264 79265 79266 79267 79268 79269 79270 79271 79272 79273 79274 79275 79276 79277 79278 79279 79280 79281 79282 79283 79284 79285 79286 79287 79288 79289 79290 79291 79292 79293 79294 79295 79296 79297 79298 79299 79300 79301 79302 79303 79304 79305 79306 79307 79308 79309 79310 79311 79312 79313 79314 79315 79316 79317 79318 79319 79320 79321 79322 79323 79324 79325 79326 79327 79328 79329 79330 79331 79332 79333 79334 79335 79336 79337 79338 79339 79340 79341 79342 79343 79344 79345 79346 79347 79348 79349 79350 79351 79352 79353 79354 79355 79356 79357 79358 79359 79360 79361 79362 79363 79364 79365 79366 79367 79368 79369 79370 79371 79372 79373 79374 79375 79376 79377 79378 79379 79380 79381 79382 79383 79384 79385 79386 79387 79388 79389 79390 79391 79392 79393 79394 79395 79396 79397 79398 79399 79400 79401 79402 79403 79404 79405 79406 79407 79408 79409 79410 79411 79412 79413 79414 79415 79416 79417 79418 79419 79420 79421 79422 79423 79424 79425 79426 79427 79428 79429 79430 79431 79432 79433 79434 79435 79436 79437 79438 79439 79440 79441 79442 79443 79444 79445 79446 79447 79448 79449 79450 79451 79452 79453 79454 79455 79456 79457 79458 79459 79460 79461 79462 79463 79464 79465 79466 79467 79468 79469 79470 79471 79472 79473 79474 79475 79476 79477 79478 79479 79480 79481 79482 79483 79484 79485 79486 79487 79488 79489 79490 79491 79492 79493 79494 79495 79496 79497 79498 79499 79500 79501 79502 79503 79504 79505 79506 79507 79508 79509 79510 79511 79512 79513 79514 79515 79516 79517 79518 79519 79520 79521 79522 79523 79524 79525 79526 79527 79528 79529 79530 79531 79532 79533 79534 79535 79536 79537 79538 79539 79540 79541 79542 79543 79544 79545 79546 79547 79548 79549 79550 79551 79552 79553 79554 79555 79556 79557 79558 79559 79560 79561 79562 79563 79564 79565 79566 79567 79568 79569 79570 79571 79572 79573 79574 79575 79576 79577 79578 79579 79580 79581 79582 79583 79584 79585 79586 79587 79588 79589 79590 79591 79592 79593 79594 79595 79596 79597 79598 79599 79600 79601 79602 79603 79604 79605 79606 79607 79608 79609 79610 79611 79612 79613 79614 79615 79616 79617 79618 79619 79620 79621 79622 79623 79624 79625 79626 79627 79628 79629 79630 79631 79632 79633 79634 79635 79636 79637 79638 79639 79640 79641 79642 79643 79644 79645 79646 79647 79648 79649 79650 79651 79652 79653 79654 79655 79656 79657 79658 79659 79660 79661 79662 79663 79664 79665 79666 79667 79668 79669 79670 79671 79672 79673 79674 79675 79676 79677 79678 79679 79680 79681 79682 79683 79684 79685 79686 79687 79688 79689 79690 79691 79692 79693 79694 79695 79696 79697 79698 79699 79700 79701 79702 79703 79704 79705 79706 79707 79708 79709 79710 79711 79712 79713 79714 79715 79716 79717 79718 79719 79720 79721 79722 79723 79724 79725 79726 79727 79728 79729 79730 79731 79732 79733 79734 79735 79736 79737 79738 79739 79740 79741 79742 79743 79744 79745 79746 79747 79748 79749 79750 79751 79752 79753 79754 79755 79756 79757 79758 79759 79760 79761 79762 79763 79764 79765 79766 79767 79768 79769 79770 79771 79772 79773 79774 79775 79776 79777 79778 79779 79780 79781 79782 79783 79784 79785 79786 79787 79788 79789 79790 79791 79792 79793 79794 79795 79796 79797 79798 79799 79800 79801 79802 79803 79804 79805 79806 79807 79808 79809 79810 79811 79812 79813 79814 79815 79816 79817 79818 79819 79820 79821 79822 79823 79824 79825 79826 79827 79828 79829 79830 79831 79832 79833 79834 79835 79836 79837 79838 79839 79840 79841 79842 79843 79844 79845 79846 79847 79848 79849 79850 79851 79852 79853 79854 79855 79856 79857 79858 79859 79860 79861 79862 79863 79864 79865 79866 79867 79868 79869 79870 79871 79872 79873 79874 79875 79876 79877 79878 79879 79880 79881 79882 79883 79884 79885 79886 79887 79888 79889 79890 79891 79892 79893 79894 79895 79896 79897 79898 79899 79900 79901 79902 79903 79904 79905 79906 79907 79908 79909 79910 79911 79912 79913 79914 79915 79916 79917 79918 79919 79920 79921 79922 79923 79924 79925 79926 79927 79928 79929 79930 79931 79932 79933 79934 79935 79936 79937 79938 79939 79940 79941 79942 79943 79944 79945 79946 79947 79948 79949 79950 79951 79952 79953 79954 79955 79956 79957 79958 79959 79960 79961 79962 79963 79964 79965 79966 79967 79968 79969 79970 79971 79972 79973 79974 79975 79976 79977 79978 79979 79980 79981 79982 79983 79984 79985 79986 79987 79988 79989 79990 79991 79992 79993 79994 79995 79996 79997 79998 79999 80000 zimpl-3.3.6/check/subto.lp.ref0000644001417200060250000001104213301553023016067 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set A := { 1 to 5 }; \ set B := { 1 to 5 }; \ var x[A]; \ var y[B]; \ param a[A] := <1> 1, <2> 2, <3> 3, <4> 4, <5> 5 ; \ minimize cost: x[1] + x[2] + 17; \ subto c01: x[1] <= 5; \ subto c02: x[1] + x[2] <= 5; \ subto c03: 3 * x[1] <= 5; \ subto c04: x[1] * 3 <= 5; \ subto c05: 3 * x[1] + x[2] <= 5; \ subto c06: x[1] + 3 * x[2] <= 5; \ subto c07: 3 * (x[1] + x[2]) <= 5; \ subto c08: (x[1] + x[2]) * 3 <= 5; \ subto c10: sum in A do x[i] <= 5; \ subto c11: sum in A do 3 * x[i] <= 5; \ subto c12: sum in A do (x[i] * 4) <= 5; \ subto c13: (sum in A do x[i]) * 4 <= 5; \ subto c14: sum in A do x[i] * 4 <= 5; \ subto c15: 5 * sum in A do x[i] <= 5; \ subto c16: - x[5] - 2 * sum in A with i < 3 do x[i] + x[4] * 3 <= 5; \ subto c17: + x[5] - 2 * sum in A with i < 3 do 7 * x[i] + 3 * x[4] <= 5; \ subto c18: + x[5] - 1.5 * (2 * sum in A with i < 3 do 7 * x[i] + 3 * x[4]) <= 5; \ subto c20: sum in A : x[i] + sum in B : y[j] >= 2; \ subto c21: 6 * (sum in A : x[i] + sum in B : y[j]) >= 2; \ subto c22: sum in A : sum in B with j > i : (x[i] + y[j]) >= 2; \ subto c23: 3 * sum in A : 2 * sum in B with j > i : (x[i] + y[j]) + 77 * x[5] <= 88; \ subto c24: forall in A : sum in B : 3 * x[j] * 4 <= 17; \ subto c25: y[1] + sum in A : x[i] + y[2] <= 15; \ subto c26: y[1] + sum in A : (x[i] + y[2]) <= 15; \ subto c27: y[1] + (sum in A : x[i] + y[2]) <= 15; \ subto c30: x[1] <= y[2]; \ subto c31: sum in A : x[i] -5 <= sum in B : y[j] + 12; \ subto c32: x[1] + 5 >= x[2]; \ subto c33: 5 <= x[1]; \ subto c34: x[1] >= 5 + x[2]; \ subto c35: 5 + x[1] >= x[2]; \ subto c36: 5 <= 6; \ subto c37: -5 + x[1] >= x[2]; \ subto c38: x[1] == a[1] + sum in A do a[i]*x[i]; \ subto c39: x[1] == a[1] + sum in A do x[i]*a[i]; \ subto c40: x[1] == a[1] + 2 * sum in A do 2*a[i]*x[i]*3 + 4; \ subto c41: x[1] == a[1] + 2 * sum in A do 2*x[i]*a[i]*3 + 4; \ subto c42: 17 <= x[1] + x[2] <= 23; \ subto c43: 13 * a[1] / 2 >= sum in A do a[i]*x[i] + 6 >= a[2]; \ subto c44: sum in A with i < 5: 10^-i * x[i] >= 5, scale; \ subto c45: sum in A : 0.0001 * x[i] >= 6, scale; \Problem name: subto.zpl Minimize cost: + x#1 + x#2 +17 __ObjOffset@a Subject to c01_1: + x#1 <= 5 c02_1: + x#2 + x#1 <= 5 c03_1: +3 x#1 <= 5 c04_1: +3 x#1 <= 5 c05_1: + x#2 +3 x#1 <= 5 c06_1: +3 x#2 + x#1 <= 5 c07_1: +3 x#2 +3 x#1 <= 5 c08_1: +3 x#2 +3 x#1 <= 5 c10_1: + x#5 + x#4 + x#3 + x#2 + x#1 <= 5 c11_1: +3 x#5 +3 x#4 +3 x#3 +3 x#2 +3 x#1 <= 5 c12_1: +4 x#5 +4 x#4 +4 x#3 +4 x#2 +4 x#1 <= 5 c13_1: +4 x#5 +4 x#4 +4 x#3 +4 x#2 +4 x#1 <= 5 c14_1: +4 x#5 +4 x#4 +4 x#3 +4 x#2 +4 x#1 <= 5 c15_1: +5 x#5 +5 x#4 +5 x#3 +5 x#2 +5 x#1 <= 5 c16_1: +3 x#4 -2 x#2 -2 x#1 - x#5 <= 5 c17_1: +3 x#4 -14 x#2 -14 x#1 + x#5 <= 5 c18_1: -4.5 x#4 -21 x#2 -21 x#1 + x#5 <= 5 c20_1: + y#5 + y#4 + y#3 + y#2 + y#1 + x#5 + x#4 + x#3 + x#2 + x#1 >= 2 c21_1: +6 y#5 +6 y#4 +6 y#3 +6 y#2 +6 y#1 +6 x#5 +6 x#4 +6 x#3 +6 x#2 +6 x#1 >= 2 c22_1: + x#4 +2 x#3 +3 x#2 +4 y#5 +3 y#4 +2 y#3 + y#2 +4 x#1 >= 2 c23_1: +77 x#5 +6 x#4 +12 x#3 +18 x#2 +24 y#5 +18 y#4 +12 y#3 +6 y#2 +24 x#1 <= 88 c24_1: +12 x#5 +12 x#4 +12 x#3 +12 x#2 +12 x#1 <= 17 c24_2: +12 x#5 +12 x#4 +12 x#3 +12 x#2 +12 x#1 <= 17 c24_3: +12 x#5 +12 x#4 +12 x#3 +12 x#2 +12 x#1 <= 17 c24_4: +12 x#5 +12 x#4 +12 x#3 +12 x#2 +12 x#1 <= 17 c24_5: +12 x#5 +12 x#4 +12 x#3 +12 x#2 +12 x#1 <= 17 c25_1: + y#2 + x#5 + x#4 + x#3 + x#2 + x#1 + y#1 <= 15 c26_1: + x#5 + x#4 + x#3 + x#2 +5 y#2 + x#1 + y#1 <= 15 c27_1: + y#2 + x#5 + x#4 + x#3 + x#2 + x#1 + y#1 <= 15 c30_1: - y#2 + x#1 <= 0 c31_1: - y#5 - y#4 - y#3 - y#2 - y#1 + x#5 + x#4 + x#3 + x#2 + x#1 <= 17 c32_1: - x#2 + x#1 >= -5 c33_1: - x#1 <= -5 c34_1: - x#2 + x#1 >= 5 c35_1: - x#2 + x#1 >= -5 c37_1: - x#2 + x#1 >= 5 c38_1: -4 x#4 -3 x#3 -2 x#2 -5 x#5 = 1 c39_1: -4 x#4 -3 x#3 -2 x#2 -5 x#5 = 1 c40_1: -60 x#5 -48 x#4 -36 x#3 -24 x#2 -11 x#1 = 5 c41_1: -60 x#5 -48 x#4 -36 x#3 -24 x#2 -11 x#1 = 5 c42_1R: + x#2 + x#1 <= 23 c42_1L: + x#2 + x#1 >= 17 c43_1R: +5 x#5 +4 x#4 +3 x#3 +2 x#2 + x#1 <= 0.5 c43_1L: +5 x#5 +4 x#4 +3 x#3 +2 x#2 + x#1 >= -4 c44_1: +0.001 x#4 +0.01 x#3 +0.1 x#2 + x#1 >= 50 c45_1: + x#5 + x#4 + x#3 + x#2 + x#1 >= 60000 Bounds 0 <= x#1 <= +inf 0 <= x#2 <= +inf 0 <= x#3 <= +inf 0 <= x#4 <= +inf 0 <= x#5 <= +inf 0 <= y#1 <= +inf 0 <= y#2 <= +inf 0 <= y#3 <= +inf 0 <= y#4 <= +inf 0 <= y#5 <= +inf __ObjOffset@a = 1 End zimpl-3.3.6/check/vinst.zpl0000644001417200060250000000433313301553023015522 0ustar bzfschlooptimi# $Id: vinst.zpl,v 1.7 2014/01/12 12:21:25 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: vinst.zpl */ #* Name....: Variable Instruction Test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2003-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1..10 }; var x[I] integer >= -10 <= 10; subto c1: vif x[1] < 0 then x[2] == 9 end; subto c2: vif x[1] <= 0 then x[2] == 8 end; subto c3: vif x[1] == 0 then x[2] == 7 end; subto c4: vif x[1] != 0 then x[2] == 6 end; subto c5: vif x[1] >= 0 then x[2] == 5 end; subto c6: vif x[1] > 0 then x[2] == 4 end; subto c7: forall in I with i < 4 : vif vabs(x[1] + x[2]) <= 5 then x[3] + x[4] >= 5 else x[5] + x[6] >= 8 end; subto c8: vif 3 * x[1] + x[2] != 7 then sum in I : x[i] <= 17 else sum in I : x[i] >= 5 end; subto c9: vif x[1] == 1 and x[2] > 5 or x[1] == 2 and x[2] < 8 then x[3] == 7 end; subto c10: vif x[1] != 1 xor not x[2] == 5 then x[3] <= 2 end; subto c11: vif x[1] == 1 then x[2] == 0 else x[3] == 0 end, indicator; zimpl-3.3.6/check/param.zpl0000644001417200060250000000447013301553023015461 0ustar bzfschlooptimi# $Id: param.zpl,v 1.8 2010/06/10 19:42:40 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: param.zpl */ #* Name....: Param test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2001-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1 .. 10 }; set J := { "a", "b", "c", "x", "y", "z" }; param a := 5; param b := "hallo"; param c[I] := <1> "a", <2> "b", <3> "c"; param d[I] := <2> "x", <3> "y" default "z"; param e[ in I with i > 5] := i + 2; param f[<5,j> in I * { "a", "b" }] := j; param g[J] := <"a"> 1, <"b"> 2, <"c"> 3, <"x"> 4, <"y"> 5, <"z"> 9; param h[I*J] := | "a", "c", "x", "z" | |1| 12, 17, 99, 23 | |3| 4, 3,-17, 66*5.5 | |5| 2/3, -.4, 3, abs(-4)| |9| 1, 2, 0, 3 | default -99; var x[I]; subto a1: a * x[1] >= 0; subto b2: if b == "hallo" then 5 else 3 end * x[1] >= 0; subto c1 : sum in I with i < 4: g[c[i]] * x[i] >= 0; subto d1 : sum in I : g[d[i]] * x[i] >= 0; subto e1 : sum in I with i > 5: e[i] * x[i] >= 0; subto f1 : g[f[5,"a"]] * x[1] + g[f[5,"b"]] * x[2] >= 0; subto h1 : sum in I*J with h[i,j] != -99: h[i,j] * x[i] >= 0; zimpl-3.3.6/check/warnings/0000755001417200060250000000000013301553023015455 5ustar bzfschlooptimizimpl-3.3.6/check/warnings/w205.zpl0000644001417200060250000000014513301553023016701 0ustar bzfschlooptimi# $Id: w205.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x[{1..3}] := read "w205.dat" as "n+"; zimpl-3.3.6/check/warnings/w165.zpl0000644001417200060250000000020413301553023016702 0ustar bzfschlooptimi# $Id: w165.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set A:={1,2}; set B:={<1,1>,<2,2>}; param x := if A == B then 1 else 2 end;zimpl-3.3.6/check/warnings/w215-m.warn.ref0000644001417200060250000000102313301553023020045 0ustar bzfschlooptimi--- Warning 215: Startvals violate constraint, sum of LHS (6) <= RHS (5) *** File: w215 Line 4 *** subto c1: sum in I : x[i] <= 5; *** ^^^ --- Warning 215: Startvals violate constraint, sum of LHS (6) >= RHS (7) *** File: w215 Line 5 *** subto c2: sum in I : x[i] >= 7; *** ^^^ --- Warning 215: Startvals violate constraint, sum of LHS (6) == RHS (8) *** File: w215 Line 6 *** subto c3: sum in I : x[i] == 8; *** ^^^ zimpl-3.3.6/check/warnings/w164_2.zpl0000644001417200060250000000012513301553023017124 0ustar bzfschlooptimi# $Id: w164_2.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set A:={<1,"a">,<1,"a">}; zimpl-3.3.6/check/warnings/w223.warn.ref0000644001417200060250000000025013301553023017613 0ustar bzfschlooptimi--- Warning 223: Objective function value overwrites existing one *** File: w223.zpl Line 5 *** maximize value: 2 * x2 - 3 * x1; *** ^^^ zimpl-3.3.6/check/warnings/w166.zpl0000644001417200060250000000014213301553023016704 0ustar bzfschlooptimi# $Id: w166.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x[{1}] := <1> "hallo", <1> "moin"; zimpl-3.3.6/check/warnings/w206.warn.ref0000644001417200060250000000026613301553023017623 0ustar bzfschlooptimi--- Warning 206: argmin/argmax over empty set *** File: w206.zpl Line 2 *** set B := argmax in { 1..10 } with i > 11 : i; *** ^^^ zimpl-3.3.6/check/warnings/w206.zpl0000644001417200060250000000015313301553023016701 0ustar bzfschlooptimi# $Id: w206.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set B := argmax in { 1..10 } with i > 11 : i; zimpl-3.3.6/check/warnings/w215.warn.ref0000644001417200060250000000000013301553023017605 0ustar bzfschlooptimizimpl-3.3.6/check/warnings/w186_1.warn.ref0000644001417200060250000000026613301553023020052 0ustar bzfschlooptimi--- Warning 186: Minimizing over empty set -- zero assumed *** File: w186_1.zpl Line 2 *** param x := min in {1..2} with i > 3: 1; *** ^^^ zimpl-3.3.6/check/warnings/w139.warn.ref0000644001417200060250000000010013301553023017613 0ustar bzfschlooptimi--- Warning 139: Lower bound for integral var x truncated to 13 zimpl-3.3.6/check/warnings/w213.dat.gz0000644001417200060250000000025713301553023017266 0ustar bzfschlooptimi‹’S°Fw213.datíÂ1  *V°9kx0h œĉĴ ' zimpl-3.3.6/check/warnings/w165.warn.ref0000644001417200060250000000014413301553023017622 0ustar bzfschlooptimi--- Warning 165: Comparison of different dimension sets. List: |1|{<1>,<2>} Multi: |2|{<1,1>,<2,2>} zimpl-3.3.6/check/warnings/w195.warn.ref0000644001417200060250000000015313301553023017625 0ustar bzfschlooptimi--- Warning 195: Genuine empty index as index set *** File: w195.zpl Line 2 *** var x[{}]; *** ^^^ zimpl-3.3.6/check/warnings/w301.zpl0000644001417200060250000000012413301553023016673 0ustar bzfschlooptimi# $Id: w301.zpl,v 1.1 2011/09/16 09:11:50 bzfkocht Exp $ var x binary priority 5.5; zimpl-3.3.6/check/warnings/w166.warn.ref0000644001417200060250000000007513301553023017626 0ustar bzfschlooptimi--- Warning 166: Duplicate element <1> for symbol x rejected zimpl-3.3.6/check/warnings/w187_2.zpl0000644001417200060250000000014513301553023017133 0ustar bzfschlooptimi# $Id: w187_2.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x := max( in {1..2} with i > 3); zimpl-3.3.6/check/warnings/w187_1.zpl0000644001417200060250000000015013301553023017126 0ustar bzfschlooptimi# $Id: w187_1.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x := max in {1..2} with i > 3 : 1; zimpl-3.3.6/check/warnings/w223.zpl0000644001417200060250000000012113301553023016673 0ustar bzfschlooptimi# w223 var x1; var x2; minimize cost: x1 + x2; maximize value: 2 * x2 - 3 * x1; zimpl-3.3.6/check/warnings/w164_1.warn.ref0000644001417200060250000000006613301553023020044 0ustar bzfschlooptimi--- Warning 164: Duplicate element 1 for set rejected zimpl-3.3.6/check/warnings/w139.zpl0000644001417200060250000000012013301553023016700 0ustar bzfschlooptimi# $Id: w139.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ var x integer >= 12.5; zimpl-3.3.6/check/warnings/w164_2.warn.ref0000644001417200060250000000007413301553023020044 0ustar bzfschlooptimi--- Warning 164: Duplicate element <1,"a"> for set rejected zimpl-3.3.6/check/warnings/w213.warn.ref0000644001417200060250000000043213301553023017614 0ustar bzfschlooptimi--- Warning 213: More than 65536 input fields in line 1 of w213.dat *** File: w213.zpl Line 2 *** set A:={read "w213.dat" as ""}; *** ^^^ --- Warning 164: Duplicate element 1 for set rejected --- Warning 164: suppressed 65534 further message(s) zimpl-3.3.6/check/warnings/w202_2.zpl0000644001417200060250000000021013301553023017110 0ustar bzfschlooptimi# $Id: w202_2.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set E := { 1..3 } * { 4..5 }; set X := { in { 1 .. 5 } with i > 10: i }; zimpl-3.3.6/check/warnings/w302.warn.ref0000644001417200060250000000026613301553023017620 0ustar bzfschlooptimi--- Warning 302: Priority has to be integral for SOS c1_1 *** File: w302.zpl Line 4 *** sos c1: type1 priority 1.5 : 3 * x + 2 * y; *** ^^^ zimpl-3.3.6/check/warnings/w162.warn.ref0000644001417200060250000000007113301553023017616 0ustar bzfschlooptimi--- Warning 162: Line 4: Trailing "param x = 5 " ignored zimpl-3.3.6/check/warnings/w187_2.warn.ref0000644001417200060250000000026413301553023020052 0ustar bzfschlooptimi--- Warning 187: Maximizing over empty set -- zero assumed *** File: w187_2.zpl Line 2 *** param x := max( in {1..2} with i > 3); *** ^^^ zimpl-3.3.6/check/warnings/w215.mst.ref0000644001417200060250000000030213301553023017446 0ustar bzfschlooptimi* This file was automatically generated by Zimpl NAME w215 x#1 1.0000000000e+00 x#2 2.0000000000e+00 x#3 3.0000000000e+00 ENDATA zimpl-3.3.6/check/warnings/w186_2.zpl0000644001417200060250000000014513301553023017132 0ustar bzfschlooptimi# $Id: w186_2.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x := min( in {1..2} with i > 3); zimpl-3.3.6/check/warnings/w195.zpl0000644001417200060250000000010413301553023016704 0ustar bzfschlooptimi# $Id: w195.zpl,v 1.1 2011/09/16 09:11:50 bzfkocht Exp $ var x[{}]; zimpl-3.3.6/check/warnings/w202_1.warn.ref0000644001417200060250000000024313301553023020032 0ustar bzfschlooptimi--- Warning 202: Indexing over empty set *** File: w202_1.zpl Line 3 *** set X := { in E with i > 10: }; *** ^^^ zimpl-3.3.6/check/warnings/w162.zpl0000644001417200060250000000012713301553023016703 0ustar bzfschlooptimi# $Id: w162.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ set I := { 1..4}; param x = 5 zimpl-3.3.6/check/warnings/w205.dat0000644001417200060250000000001713301553023016642 0ustar bzfschlooptimi1 2 3 4 5 6 7 8zimpl-3.3.6/check/warnings/w302.zpl0000644001417200060250000000020113301553023016670 0ustar bzfschlooptimi# $Id: w302.zpl,v 1.1 2011/09/16 09:11:50 bzfkocht Exp $ var x binary; var y binary; sos c1: type1 priority 1.5 : 3 * x + 2 * y; zimpl-3.3.6/check/warnings/w600.warn.ref0000644001417200060250000000020513301553023017612 0ustar bzfschlooptimi--- Warning 600: File format can only handle linear and quadratic constraints Constraint c1_1 with degree 3 ignored zimpl-3.3.6/check/warnings/w164_1.zpl0000644001417200060250000000011113301553023017116 0ustar bzfschlooptimi# $Id: w164_1.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set A:={1,1}; zimpl-3.3.6/check/warnings/w215.zpl0000644001417200060250000000035213301553023016702 0ustar bzfschlooptimi# $Id: w215.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set I := { 1, 2, 3 }; var x[ in I] integer >= 0 <= 10 startval i; subto c1: sum in I : x[i] <= 5; subto c2: sum in I : x[i] >= 7; subto c3: sum in I : x[i] == 8; zimpl-3.3.6/check/warnings/w203_1.zpl0000644001417200060250000000030213301553023017112 0ustar bzfschlooptimi# $Id: w203_1.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param p := 3; set V := { 1 .. 3 }; set P := { 1 .. p }; var x[V * P] binary; subto cap: forall

in P do sum in V : x[v,p] <= 2; zimpl-3.3.6/check/warnings/w200.warn.ref0000644001417200060250000000027513301553023017615 0ustar bzfschlooptimi--- Warning 200: Weights are not unique for SOS c1_1 *** File: w200.zpl Line 3 *** sos c1: type1 priority 100 : 5 * x[1] + 5 * x[2]; *** ^^^ zimpl-3.3.6/check/warnings/w200.zpl0000644001417200060250000000020313301553023016667 0ustar bzfschlooptimi# $Id: w200.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ var x[{1 .. 2}] binary; sos c1: type1 priority 100 : 5 * x[1] + 5 * x[2]; zimpl-3.3.6/check/warnings/w186_2.warn.ref0000644001417200060250000000026413301553023020051 0ustar bzfschlooptimi--- Warning 186: Minimizing over empty set -- zero assumed *** File: w186_2.zpl Line 2 *** param x := min( in {1..2} with i > 3); *** ^^^ zimpl-3.3.6/check/warnings/w202_2.warn.ref0000644001417200060250000000025013301553023020031 0ustar bzfschlooptimi--- Warning 202: Indexing over empty set *** File: w202_2.zpl Line 3 *** set X := { in { 1 .. 5 } with i > 10: i }; *** ^^^ zimpl-3.3.6/check/warnings/w600.zpl0000644001417200060250000000006513301553023016701 0ustar bzfschlooptimivar x[{1..3}]; subto c1: x[1] * x[2] * x[3] <= 17; zimpl-3.3.6/check/warnings/w140.warn.ref0000644001417200060250000000010013301553023017603 0ustar bzfschlooptimi--- Warning 140: Upper bound for integral var x truncated to 12 zimpl-3.3.6/check/warnings/w213.zpl0000644001417200060250000000013513301553023016677 0ustar bzfschlooptimi# $Id: w213.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set A:={read "w213.dat" as ""}; zimpl-3.3.6/check/warnings/w187_1.warn.ref0000644001417200060250000000027013301553023020046 0ustar bzfschlooptimi--- Warning 187: Maximizing over empty set -- zero assumed *** File: w187_1.zpl Line 2 *** param x := max in {1..2} with i > 3 : 1; *** ^^^ zimpl-3.3.6/check/warnings/w205.warn.ref0000644001417200060250000000026313301553023017617 0ustar bzfschlooptimi--- Warning 205: 5 excess entries for symbol x ignored *** File: w205.zpl Line 2 *** param x[{1..3}] := read "w205.dat" as "n+"; *** ^^^ zimpl-3.3.6/check/warnings/w202_1.zpl0000644001417200060250000000021213301553023017111 0ustar bzfschlooptimi# $Id: w202_1.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ set E := { 1..3 } * { 4..5 }; set X := { in E with i > 10: }; zimpl-3.3.6/check/warnings/w187.zpl0000644001417200060250000000014613301553023016713 0ustar bzfschlooptimi# $Id: w187.zpl,v 1.5 2010/06/10 19:42:42 bzfkocht Exp $ param x := max in {1..2} with i > 3 : 1; zimpl-3.3.6/check/warnings/w186_1.zpl0000644001417200060250000000014713301553023017133 0ustar bzfschlooptimi# $Id: w186_1.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ param x := min in {1..2} with i > 3: 1; zimpl-3.3.6/check/warnings/w301.warn.ref0000644001417200060250000000006613301553023017615 0ustar bzfschlooptimi--- Warning 301: variable priority has to be integral zimpl-3.3.6/check/warnings/w187.warn.ref0000644001417200060250000000026613301553023017633 0ustar bzfschlooptimi--- Warning 187: Maximizing over empty set -- zero assumed *** File: w187.zpl Line 2 *** param x := max in {1..2} with i > 3 : 1; *** ^^^ zimpl-3.3.6/check/warnings/w203_1.warn.ref0000644001417200060250000000024713301553023020037 0ustar bzfschlooptimi--- Warning 203: Indexing tuple is fixed *** File: w203_1.zpl Line 6 *** subto cap: forall

in PLANTS : building[p] * z[p] + sum in PS : transport[p,s] * x[p,s]; # Each store is supplied by exactly one plant # subto assign: forall in STORES : sum

in PLANTS : x[p,s] == 1; # To be able to supply a store, a plant must be build # subto build: forall in PS : x[p,s] <= z[p]; # The plant must be able to meet the demands from all stores # that are connected to it # subto limit: forall

in PLANTS : sum in STORES : demand[s] * x[p,s] <= capacity[p]; zimpl-3.3.6/example/queens1.zpl0000644001417200060250000000133613301553023016316 0ustar bzfschlooptimi# $Id: queens1.zpl,v 1.5 2009/09/13 16:15:53 bzfkocht Exp $ # # This is a formulation of the n queens problem using general integer # variables. Please note that this particular formulation only works, # if a queen can be placed in each row, so queens should be greater # equal to 4 # param queens := 8; set I := { 1 .. queens }; set P := { in I * I with i < j }; var x[I] integer >= 1 <= queens; # All x have to be different # subto c1: forall in P do vabs(x[i] - x[j]) >= 1; # Block diagonals => # never the same distance between two queens in x and y direction => # abs(x[i] - x[j]) != abs(i - j) => # a != b modeled as abs(a - b) >= 1 # subto c2: forall in P do vabs(vabs(x[i] - x[j]) - abs(i - j)) >= 1; zimpl-3.3.6/example/queens2.zpl0000644001417200060250000000112413301553023016312 0ustar bzfschlooptimi# $Id: queens2.zpl,v 1.4 2009/09/13 16:15:53 bzfkocht Exp $ # # This is a formulation of the n queens problem using binary variables. # variables. Since the number of queens is maximized, the size of the # board can be set arbitrarily. # param columns := 8; set I := { 1 .. columns }; set IxI := I * I; set TABU[ in IxI] := { in IxI with (m != i or n != j) and (m == i or n == j or abs(m - i) == abs(n - j)) }; var x[IxI] binary; maximize queens: sum in IxI : x[i,j]; subto c1: forall in IxI do vif x[i,j] == 1 then sum in TABU[i,j] : x[m,n] <= 0 end; zimpl-3.3.6/example/queens3.zpl0000644001417200060250000000114713301553023016320 0ustar bzfschlooptimi# $Id: queens3.zpl,v 1.3 2009/09/13 16:15:53 bzfkocht Exp $ # # This is a formulation of the n queens problem using binary variables. # variables. Since the number of queens is maximized, the size of the # board can be set arbitrarily. # param columns := 8; set I := { 1 .. columns }; set IxI := I * I; set TABU[ in IxI] := { in IxI with (m != i or n != j) and (m == i or n == j or abs(m - i) == abs(n - j)) }; var x[IxI] binary; maximize queens: sum in IxI : x[i,j]; subto c1: forall in IxI do card(TABU[i,j]) - card(TABU[i,j]) * x[i,j] >= sum in TABU[i,j] : x[m,n]; zimpl-3.3.6/example/queens4.zpl0000644001417200060250000000111413301553023016313 0ustar bzfschlooptimi# $Id: queens4.zpl,v 1.3 2009/09/13 16:15:53 bzfkocht Exp $ # # This is a formulation of the n queens problem using binary variables. # variables. Since the number of queens is maximized, the size of the # board can be set arbitrarily. # param columns := 8; set I := { 1 .. columns }; set IxI := I * I; set TABU[ in IxI] := { in IxI with (m != i or n != j) and (m == i or n == j or abs(m - i) == abs(n - j)) }; var x[IxI] binary; maximize queens: sum in IxI : x[i,j]; subto c1: forall in IxI do forall in TABU[i,j] do x[i,j] + x[m,n] <= 1; zimpl-3.3.6/example/queens5.zpl0000644001417200060250000000172513301553023016324 0ustar bzfschlooptimi# $Id: queens5.zpl,v 1.5 2009/09/13 16:15:53 bzfkocht Exp $ # # This is a formulation of the n queens problem using binary variables. # variables. Since the number of queens is maximized, the size of the # board can be set arbitrarily. # # set packing formulation # param columns := 8; set I := { 1 .. columns }; set IxI := I * I; var x[IxI] binary; maximize queens: sum in IxI : x[i,j]; # one in a row subto row: forall in I do sum in IxI : x[i,j] <= 1; # one in a column subto col: forall in I do sum in IxI : x[i,j] <= 1; # rowwise down subto drd: forall in I do sum in IxI with m - i == n - 1: x[m,n] <= 1; # rowwise up subto dru: forall in I do sum in IxI with m - i == 1 - n: x[m,n] <= 1; # colwise down subto dcd: forall in I do sum in IxI with m - 1 == n - j: x[m,n] <= 1; # colwise up subto dcu: forall in I do sum in IxI with columns - m == n - j: x[m,n] <= 1; zimpl-3.3.6/example/steinerbaum.zpl0000644001417200060250000000152613301553023017254 0ustar bzfschlooptimi# $Id: steinerbaum.zpl,v 1.4 2009/09/13 16:15:54 bzfkocht Exp $ # # This is a classical Steiner-Tree Problem in Networks formulation. # BEWARE: This grows exponentially # set V := { 1 .. 5 }; set E := { <1,2>, <1,4>, <2,3>, <2,4>, <3,4>, <3,5>, <4,5> }; set T := { 1, 3, 5 }; param c[E] := <1,2> 1, <1,4> 2, <2,3> 3, <2,4> 4, <3,4> 5, <3,5> 6, <4,5> 7; var x[E] binary; minimize cost: sum in E : c[a,b] * x[a,b]; set P[] := powerset(V); set I := indexset(P); # If we partition V and there is a Terminal in both parts, there has # to be at least one edge to connect them. subto partition: forall in I with P[i] inter T != {} and (V \ P[i]) inter T != {} do sum in E with ( in P[i] and not in P[i]) or ( in P[i] and not in P[i]) : x[a,b] >= 1; # That's it. zimpl-3.3.6/example/tsp.zpl0000644001417200060250000000147713301553023015551 0ustar bzfschlooptimi# $Id: tsp.zpl,v 1.9 2009/09/13 16:15:54 bzfkocht Exp $ # # Generic formulation of the Travelling Salesmen Problem # set V := { read "tsp.dat" as "<1s>" comment "#" }; set E := { in V * V with i < j }; set P[] := powerset(V \ { ord(V,1,1) }); set K := indexset(P) \ { 0 }; param px[V] := read "tsp.dat" as "<1s> 2n" comment "#"; param py[V] := read "tsp.dat" as "<1s> 3n" comment "#"; defnumb dist(a,b) := sqrt((px[a] - px[b])^2 + (py[a] - py[b])^2); var x[E] binary; minimize cost: sum in E : dist(i,j) * x[i, j]; subto two_connected: forall in V do (sum in E : x[v,j]) + (sum in E : x[i,v]) == 2; subto no_subtour: forall in K with card(P[k]) > 2 and card(P[k]) < card(V) - 2 do sum in E with in P[k] and in P[k] : x[i,j] <= card(P[k]) - 1; zimpl-3.3.6/example/tsp.dat0000644001417200060250000000034113301553023015501 0ustar bzfschlooptimi# $Id: tsp.dat,v 1.5 2009/09/13 16:15:54 bzfkocht Exp $ "Sylt" 1 1 "Flensburg" 3 1 "Neumünster" 2 2 "Husum" 1 3 "Schleswig" 3 3 "Ausacker" 2 4 "Rendsburg" 1 4 "Lübeck" 4 4 "Westerland" 0 1 "Segeberg" 2 3zimpl-3.3.6/CMakeLists.txt0000644001417200060250000000407013371051600015312 0ustar bzfschlooptimicmake_minimum_required(VERSION 3.0.0) project(ZIMPL VERSION 3.3.6 LANGUAGES C) # use C99 standard set(CMAKE_C_STANDARD 99) option(ZLIB "use ZLIB" ON) set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin) set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/lib) set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/lib) add_definitions(-DVERSION=\"${ZIMPL_VERSION_MAJOR}.${ZIMPL_VERSION_MINOR}.${ZIMPL_VERSION_PATCH}\") # path to e.g. findGMP module set(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake/Modules) find_package(BISON REQUIRED) find_package(FLEX REQUIRED) find_package(GMP REQUIRED) # make 'Release' the default build type if(CMAKE_BUILD_TYPE STREQUAL "") set(CMAKE_BUILD_TYPE Release) endif() message(STATUS "Build type: ${CMAKE_BUILD_TYPE}") # filter /MD and /MDd from C and CXX flags if(MSVC) set(variables CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELEASE CMAKE_C_FLAGS_RELWITHDEBINFO CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELEASE CMAKE_CXX_FLAGS_RELWITHDEBINFO ) foreach(variable ${variables}) string(REGEX REPLACE "/M[T,D][ d]" "" ${variable} "${${variable}}") # message("${variable} = ${${variable}}") endforeach() endif() include_directories(${GMP_INCLUDE_DIRS}) set(libs ${libs} ${GMP_LIBRARIES}) if(ZLIB) find_package(ZLIB) endif() if(ZLIB_FOUND) set(libs ${libs} ${ZLIB_LIBRARIES}) include_directories(${ZLIB_INCLUDE_DIRS}) else() add_definitions(-DWITHOUT_ZLIB) # look for pcre if ZLIB could not be found find_package(PCRE) if(PCRE_FOUND) add_definitions(-DWITH_PCRE=1) set(libs ${libs} ${PCRE_LIBRARIES}) include_directories(${PCRE_INCLUDE_DIRS}) endif() endif() if(MSVC) add_definitions(-Dpopen=_popen) add_definitions(-Dpclose=_pclose) add_definitions(-Dinline=_inline) endif() include(CheckSymbolExists) # link to math library if it is available find_library(libm m) if(NOT libm) set(libm "") endif() set(libs ${libs} ${libm}) add_subdirectory(src) zimpl-3.3.6/zimpl-config.cmake.in0000644001417200060250000000034513303265236016567 0ustar bzfschlooptimiif(NOT TARGET libzimpl) include("${CMAKE_CURRENT_LIST_DIR}/zimpl-targets.cmake") endif() set(ZIMPL_LIBRARIES libzimpl) set(ZIMPL_PIC_LIBRARIES libzimpl-pic) set(ZIMPL_INCLUDE_DIRS "@CONF_INCLUDE_DIRS@") set(ZIMPL_FOUND TRUE) zimpl-3.3.6/cmake/Modules/FindGMP.cmake0000644001417200060250000000170213303265236017476 0ustar bzfschlooptimi# ${GMP_INCLUDE_DIRS} contains the paths to gmp.h (and gmpxx.h) if GMP is found. # ${GMP_LIBRARIES} contains libgmp and libgmpxx if GMP is found. find_path(GMP_INCLUDE_DIRS NAMES gmp.h gmpxx.h HINTS ${GMP_DIR} PATH_SUFFIXES include) # todo: enable recursive search find_library(GMP_LIBRARY NAMES gmp HINTS ${GMP_DIR} PATH_SUFFIXES lib) find_library(GMPXX_LIBRARY NAMES gmpxx HINTS ${GMP_DIR} PATH_SUFFIXES lib) SET(GMP_LIBRARIES ${GMP_LIBRARY} ${GMPXX_LIBRARY}) # look for mpir library and include files when gmp could not be found if(NOT GMP_LIBRARIES) find_path(GMP_INCLUDE_DIRS NAMES mpir.h HINTS ${GMP_DIR} PATH_SUFFIXES include) find_library(GMP_LIBRARY NAMES mpir HINTS ${GMP_DIR} PATH_SUFFIXES lib) SET(GMP_LIBRARIES ${GMP_LIBRARY}) endif() include(FindPackageHandleStandardArgs) find_package_handle_standard_args(GMP DEFAULT_MSG GMP_INCLUDE_DIRS GMP_LIBRARIES) zimpl-3.3.6/cmake/Modules/FindPCRE.cmake0000644001417200060250000000140513303265236017604 0ustar bzfschlooptimi# check whether we compile for x86 or x64 if(${CMAKE_SIZEOF_VOID_P} EQUAL 8) set(PCRE_ARCH_DIR "x64") else() set(PCRE_ARCH_DIR "x86") endif() # check whether we compile for opt or debug if (CMAKE_BUILD_TYPE STREQUAL "Debug") set(PCRE_BUILD_TYPE "debug") else() set(PCRE_BUILD_TYPE "release") endif() find_path(PCRE_INCLUDE_DIRS NAMES pcre.h HINTS ${PCRE_DIR}) find_library(PCRE_LIBRARY NAMES libpcre HINTS ${PCRE_DIR} PATH_SUFFIXES lib/${PCRE_ARCH_DIR}/${PCRE_BUILD_TYPE}) SET(PCRE_LIBRARIES ${PCRE_LIBRARY}) if(${PCRE_LIBRARY} AND ${PCRE_INCLUDE_DIRS}) set(PCRE_FOUND true) else() set(PCRE_FOUND false) endif() include(FindPackageHandleStandardArgs) find_package_handle_standard_args(PCRE DEFAULT_MSG PCRE_INCLUDE_DIRS PCRE_LIBRARIES)

in P do sum in V : x[v,p] <= 2; *** ^^^ zimpl-3.3.6/check/warnings/w140.zpl0000644001417200060250000000012013301553023016670 0ustar bzfschlooptimi# $Id: w140.zpl,v 1.4 2010/06/10 19:42:42 bzfkocht Exp $ var x integer <= 12.5; zimpl-3.3.6/check/minlp.pip.ref0000644001417200060250000001334713301553023016241 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1 to 9 }; \ var x[I] binary; \ var y binary; \ var z binary; \ var a; \ var b; \ subto c1: x[1]^2 == x[1]^1 + x[1]^0; \ subto c2: 2 * x[1] * 3 * x[2] * 5 * x[3] <= 77; \ subto c3: y * z == y^2 * z^3 * 4; \ subto c4: sum in I : i*x[i]^i == 8; \ subto c5: (y + 5) * (z + 2) == 3; \ subto c6: (4/2 * x[1] + 2/3 * x[2])^2 == 9; \ subto c7: log(a) == 5; \ subto c8: sqrt(a) == 2; \ subto c9: exp(a) == 3; \ subto c10: ln(a) <= 7; \ subto c11: sin(a) <= 8; \ subto c12: cos(a) <= 9; \ subto c13: tan(a) >= 2; \ subto c14: abs(a) >= 6; \ subto c15: sgn(a) == z; \ subto c16: pow(a, 2/3) >= 7; \ subto c17: sgnpow(a, 12^2) <= 200; \ subto c18: 16 * log(sqrt(exp(ln(sin(cos(tan(abs(sgn(pow(sgnpow(a, -2), -3)))))))))) == 99; \ subto c19: (2-exp(3*a-5))^2 == b; \Problem name: minlp.zpl Minimize Objective: Subject to c1_1: - x#1 + x#1^2 = 1 c2_1: +30 x#1 * x#2 * x#3 <= 77 c3_1: + y * z -4 y^2 * z^3 = 0 c4_1: + x#1 +2 x#2^2 +3 x#3^3 +4 x#4^4 +5 x#5^5 +6 x#6^6 +7 x#7^7 +8 x#8^8 +9 x#9^9 = 8 c5_1: +5 z +2 y + y * z = -7 c6_1: +0.444444444444444 x#2^2 +2.66666666666667 x#1 * x#2 +4 x#1^2 = 9 c7_1_a_0: - __c7_1_t_0@d + a = 0 c7_1_b_1: -1 __c7_1_r_1@e + log(__c7_1_t_0@d) = 0 c7_1: + __c7_1_r_1@e = 5 c8_1_a_2: - __c8_1_t_2@f + a = 0 c8_1_b_3: -1 __c8_1_r_3@10 + sqrt(__c8_1_t_2@f) = 0 c8_1: + __c8_1_r_3@10 = 2 c9_1_a_4: - __c9_1_t_4@11 + a = 0 c9_1_b_5: -1 __c9_1_r_5@12 + exp(__c9_1_t_4@11) = 0 c9_1: + __c9_1_r_5@12 = 3 c10_1_a_6: - __c10_1_t_6@13 + a = 0 c10_1_b_7: -1 __c10_1_r_7@14 + ln(__c10_1_t_6@13) = 0 c10_1: + __c10_1_r_7@14 <= 7 c11_1_a_8: - __c11_1_t_8@15 + a = 0 c11_1_b_9: -1 __c11_1_r_9@16 + sin(__c11_1_t_8@15) = 0 c11_1: + __c11_1_r_9@16 <= 8 c12_1_a_10: - __c12_1_t_10@17 + a = 0 c12_1_b_11: -1 __c12_1_r_11@18 + cos(__c12_1_t_10@17) = 0 c12_1: + __c12_1_r_11@18 <= 9 c13_1_a_12: - __c13_1_t_12@19 + a = 0 c13_1_b_13: -1 __c13_1_r_13@1a + tan(__c13_1_t_12@19) = 0 c13_1: + __c13_1_r_13@1a >= 2 c14_1_a_14: - __c14_1_t_14@1b + a = 0 c14_1_b_15: -1 __c14_1_r_15@1c + abs(__c14_1_t_14@1b) = 0 c14_1: + __c14_1_r_15@1c >= 6 c15_1_a_16: - __c15_1_t_16@1d + a = 0 c15_1_b_17: -1 __c15_1_r_17@1e + sgn(__c15_1_t_16@1d) = 0 c15_1: - z + __c15_1_r_17@1e = 0 c16_1_a_18: - __c16_1_t_18@1f + a = 0 c16_1_b_19: -1 __c16_1_r_19@20 + pow(__c16_1_t_18@1f ,0.666666666666667) = 0 c16_1: + __c16_1_r_19@20 >= 7 c17_1_a_20: - __c17_1_t_20@21 + a = 0 c17_1_b_21: -1 __c17_1_r_21@22 + sgnpow(__c17_1_t_20@21 ,144) = 0 c17_1: + __c17_1_r_21@22 <= 200 c18_1_a_22: - __c18_1_t_22@23 + a = 0 c18_1_b_23: -1 __c18_1_r_23@24 + sgnpow(__c18_1_t_22@23 ,-2) = 0 c18_1_a_24: - __c18_1_t_24@25 + __c18_1_r_23@24 = 0 c18_1_b_25: -1 __c18_1_r_25@26 + pow(__c18_1_t_24@25 ,-3) = 0 c18_1_a_26: - __c18_1_t_26@27 + __c18_1_r_25@26 = 0 c18_1_b_27: -1 __c18_1_r_27@28 + sgn(__c18_1_t_26@27) = 0 c18_1_a_28: - __c18_1_t_28@29 + __c18_1_r_27@28 = 0 c18_1_b_29: -1 __c18_1_r_29@2a + abs(__c18_1_t_28@29) = 0 c18_1_a_30: - __c18_1_t_30@2b + __c18_1_r_29@2a = 0 c18_1_b_31: -1 __c18_1_r_31@2c + tan(__c18_1_t_30@2b) = 0 c18_1_a_32: - __c18_1_t_32@2d + __c18_1_r_31@2c = 0 c18_1_b_33: -1 __c18_1_r_33@2e + cos(__c18_1_t_32@2d) = 0 c18_1_a_34: - __c18_1_t_34@2f + __c18_1_r_33@2e = 0 c18_1_b_35: -1 __c18_1_r_35@30 + sin(__c18_1_t_34@2f) = 0 c18_1_a_36: - __c18_1_t_36@31 + __c18_1_r_35@30 = 0 c18_1_b_37: -1 __c18_1_r_37@32 + ln(__c18_1_t_36@31) = 0 c18_1_a_38: - __c18_1_t_38@33 + __c18_1_r_37@32 = 0 c18_1_b_39: -1 __c18_1_r_39@34 + exp(__c18_1_t_38@33) = 0 c18_1_a_40: - __c18_1_t_40@35 + __c18_1_r_39@34 = 0 c18_1_b_41: -1 __c18_1_r_41@36 + sqrt(__c18_1_t_40@35) = 0 c18_1_a_42: - __c18_1_t_42@37 + __c18_1_r_41@36 = 0 c18_1_b_43: -1 __c18_1_r_43@38 + log(__c18_1_t_42@37) = 0 c18_1: +16 __c18_1_r_43@38 = 99 c19_1_a_44: - __c19_1_t_44@39 +3 a = 5 c19_1_b_45: -1 __c19_1_r_45@3a + exp(__c19_1_t_44@39) = 0 c19_1: - b -4 __c19_1_r_45@3a + __c19_1_r_45@3a^2 = -4 Bounds 0 <= x#1 <= 1 0 <= x#2 <= 1 0 <= x#3 <= 1 0 <= x#4 <= 1 0 <= x#5 <= 1 0 <= x#6 <= 1 0 <= x#7 <= 1 0 <= x#8 <= 1 0 <= x#9 <= 1 0 <= y <= 1 0 <= z <= 1 0 <= a <= +inf 0 <= b <= +inf 0 <= __c7_1_t_0@d <= +inf -inf <= __c7_1_r_1@e <= +inf 0 <= __c8_1_t_2@f <= +inf 0 <= __c8_1_r_3@10 <= +inf -inf <= __c9_1_t_4@11 <= +inf -inf <= __c9_1_r_5@12 <= +inf 0 <= __c10_1_t_6@13 <= +inf -inf <= __c10_1_r_7@14 <= +inf -inf <= __c11_1_t_8@15 <= +inf -1 <= __c11_1_r_9@16 <= 1 -inf <= __c12_1_t_10@17 <= +inf -1 <= __c12_1_r_11@18 <= 1 -inf <= __c13_1_t_12@19 <= +inf -inf <= __c13_1_r_13@1a <= +inf -inf <= __c14_1_t_14@1b <= +inf 0 <= __c14_1_r_15@1c <= +inf -inf <= __c15_1_t_16@1d <= +inf -1 <= __c15_1_r_17@1e <= 1 -inf <= __c16_1_t_18@1f <= +inf -inf <= __c16_1_r_19@20 <= +inf -inf <= __c17_1_t_20@21 <= +inf -inf <= __c17_1_r_21@22 <= +inf -inf <= __c18_1_t_22@23 <= +inf -inf <= __c18_1_r_23@24 <= +inf -inf <= __c18_1_t_24@25 <= +inf -inf <= __c18_1_r_25@26 <= +inf -inf <= __c18_1_t_26@27 <= +inf -1 <= __c18_1_r_27@28 <= 1 -inf <= __c18_1_t_28@29 <= +inf 0 <= __c18_1_r_29@2a <= +inf -inf <= __c18_1_t_30@2b <= +inf -inf <= __c18_1_r_31@2c <= +inf -inf <= __c18_1_t_32@2d <= +inf -1 <= __c18_1_r_33@2e <= 1 -inf <= __c18_1_t_34@2f <= +inf -1 <= __c18_1_r_35@30 <= 1 0 <= __c18_1_t_36@31 <= +inf -inf <= __c18_1_r_37@32 <= +inf -inf <= __c18_1_t_38@33 <= +inf -inf <= __c18_1_r_39@34 <= +inf 0 <= __c18_1_t_40@35 <= +inf 0 <= __c18_1_r_41@36 <= +inf 0 <= __c18_1_t_42@37 <= +inf -inf <= __c18_1_r_43@38 <= +inf -inf <= __c19_1_t_44@39 <= +inf -inf <= __c19_1_r_45@3a <= +inf General x#1 x#2 x#3 x#4 x#5 x#6 x#7 x#8 x#9 y z __c15_1_r_17@1e __c18_1_r_27@28 End zimpl-3.3.6/check/subto.tbl.ref0000644001417200060250000000631413301553023016243 0ustar bzfschlooptimizimpl v 0 x#1 "x#1" zimpl v 1 x#2 "x#2" zimpl v 2 x#3 "x#3" zimpl v 3 x#4 "x#4" zimpl v 4 x#5 "x#5" zimpl v 5 y#1 "y#1" zimpl v 6 y#2 "y#2" zimpl v 7 y#3 "y#3" zimpl v 8 y#4 "y#4" zimpl v 9 y#5 "y#5" zimpl v 10 __ObjOffset@a "@@ObjOffset" 1.0000000000000000e+00 zimpl c 0 c01_1 "c01_1" 0.0000000000000000e+00 zimpl c 1 c02_1 "c02_1" 0.0000000000000000e+00 zimpl c 2 c03_1 "c03_1" 0.0000000000000000e+00 zimpl c 3 c04_1 "c04_1" 0.0000000000000000e+00 zimpl c 4 c05_1 "c05_1" 0.0000000000000000e+00 zimpl c 5 c06_1 "c06_1" 0.0000000000000000e+00 zimpl c 6 c07_1 "c07_1" 0.0000000000000000e+00 zimpl c 7 c08_1 "c08_1" 0.0000000000000000e+00 zimpl c 8 c10_1 "c10_1" 0.0000000000000000e+00 zimpl c 9 c11_1 "c11_1" 0.0000000000000000e+00 zimpl c 10 c12_1 "c12_1" 0.0000000000000000e+00 zimpl c 11 c13_1 "c13_1" 0.0000000000000000e+00 zimpl c 12 c14_1 "c14_1" 0.0000000000000000e+00 zimpl c 13 c15_1 "c15_1" 0.0000000000000000e+00 zimpl c 14 c16_1 "c16_1" 0.0000000000000000e+00 zimpl c 15 c17_1 "c17_1" 0.0000000000000000e+00 zimpl c 16 c18_1 "c18_1" 0.0000000000000000e+00 zimpl c 17 c20_1 "c20_1" 0.0000000000000000e+00 zimpl c 18 c21_1 "c21_1" 0.0000000000000000e+00 zimpl c 19 c22_1 "c22_1" 0.0000000000000000e+00 zimpl c 20 c23_1 "c23_1" 0.0000000000000000e+00 zimpl c 21 c24_1 "c24_1" 0.0000000000000000e+00 zimpl c 22 c24_2 "c24_2" 0.0000000000000000e+00 zimpl c 23 c24_3 "c24_3" 0.0000000000000000e+00 zimpl c 24 c24_4 "c24_4" 0.0000000000000000e+00 zimpl c 25 c24_5 "c24_5" 0.0000000000000000e+00 zimpl c 26 c25_1 "c25_1" 0.0000000000000000e+00 zimpl c 27 c26_1 "c26_1" 0.0000000000000000e+00 zimpl c 28 c27_1 "c27_1" 0.0000000000000000e+00 zimpl c 29 c30_1 "c30_1" 0.0000000000000000e+00 zimpl c 30 c31_1 "c31_1" 0.0000000000000000e+00 zimpl c 31 c32_1 "c32_1" 0.0000000000000000e+00 zimpl c 32 c33_1 "c33_1" 0.0000000000000000e+00 zimpl c 33 c34_1 "c34_1" 0.0000000000000000e+00 zimpl c 34 c35_1 "c35_1" 0.0000000000000000e+00 zimpl c 35 c37_1 "c37_1" 0.0000000000000000e+00 zimpl c 36 c38_1 "c38_1" 0.0000000000000000e+00 zimpl c 37 c39_1 "c39_1" 0.0000000000000000e+00 zimpl c 38 c40_1 "c40_1" 0.0000000000000000e+00 zimpl c 39 c41_1 "c41_1" 0.0000000000000000e+00 zimpl c 40 c42_1 "c42_1" 0.0000000000000000e+00 zimpl c 41 c43_1 "c43_1" 0.0000000000000000e+00 zimpl c 42 c44_1 "c44_1" 1.0000000000000000e+01 zimpl c 43 c45_1 "c45_1" 1.0000000000000000e+04 zimpl-3.3.6/check/condit.tbl.ref0000644001417200060250000000327413301553023016371 0ustar bzfschlooptimizimpl v 0 x "x" zimpl v 1 y "y" zimpl v 2 z#1 "z#1" zimpl v 3 z#2 "z#2" zimpl v 4 z#3 "z#3" zimpl v 5 z#4 "z#4" zimpl v 6 z#5 "z#5" zimpl c 0 c1_1 "c1_1" 0.0000000000000000e+00 zimpl c 1 c1_2 "c1_2" 0.0000000000000000e+00 zimpl c 2 c1_3 "c1_3" 0.0000000000000000e+00 zimpl c 3 c1_4 "c1_4" 0.0000000000000000e+00 zimpl c 4 c2_1 "c2_1" 0.0000000000000000e+00 zimpl c 5 c2_2 "c2_2" 0.0000000000000000e+00 zimpl c 6 c2_3 "c2_3" 0.0000000000000000e+00 zimpl c 7 c2_4 "c2_4" 0.0000000000000000e+00 zimpl c 8 c3_1 "c3_1" 0.0000000000000000e+00 zimpl c 9 c3_2 "c3_2" 0.0000000000000000e+00 zimpl c 10 c3_3 "c3_3" 0.0000000000000000e+00 zimpl c 11 c3_4 "c3_4" 0.0000000000000000e+00 zimpl c 12 c3_5 "c3_5" 0.0000000000000000e+00 zimpl c 13 c3_6 "c3_6" 0.0000000000000000e+00 zimpl c 14 c3_7 "c3_7" 0.0000000000000000e+00 zimpl c 15 c3_8 "c3_8" 0.0000000000000000e+00 zimpl c 16 c3_9 "c3_9" 0.0000000000000000e+00 zimpl c 17 c3_10 "c3_10" 0.0000000000000000e+00 zimpl c 18 c3_11 "c3_11" 0.0000000000000000e+00 zimpl c 19 c3_12 "c3_12" 0.0000000000000000e+00 zimpl c 20 c3_13 "c3_13" 0.0000000000000000e+00 zimpl c 21 c3_14 "c3_14" 0.0000000000000000e+00 zimpl c 22 c3_15 "c3_15" 0.0000000000000000e+00 zimpl-3.3.6/check/print.zpl0000644001417200060250000000074113301553023015512 0ustar bzfschlooptimi# $Id: print.zpl,v 1.8 2011/07/31 15:10:45 bzfkocht Exp $ # 2 "" set A := { 1 .. 5 }; set B := { "a", "b", "c" }; # var x[ in A] >= if a < 3 then -infinity else 6 end <= if a mod 2 == 1 then infinity else 20 end; var y binary; var z integer >= -5 <= 7; var w implicit integer >= 8; # do check card(A) > card(B); do print "Test: ", 13 mod 7 div 2; do print A*B; do forall in A*B do print ; do print x; do print y; do print z; do print w; do print unknown; zimpl-3.3.6/check/condit.zpl0000644001417200060250000000433713301553023015643 0ustar bzfschlooptimi# $Id: condit.zpl,v 1.2 2011/09/16 09:11:49 bzfkocht Exp $ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* */ #* File....: condit.zpl */ #* Name....: Condition test */ #* Author..: Thorsten Koch */ #* Copyright by Author, All rights reserved */ #* */ #* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */ #* #* Copyright (C) 2011-2018 by Thorsten Koch #* #* This program is free software; you can redistribute it and/or #* modify it under the terms of the GNU General Public License #* as published by the Free Software Foundation; either version 2 #* of the License, or (at your option) any later version. #* #* This program is distributed in the hope that it will be useful, #* but WITHOUT ANY WARRANTY; without even the implied warranty of #* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #* GNU General Public License for more details. #* #* You should have received a copy of the GNU General Public License #* along with this program; if not, write to the Free Software #* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. #* set I := { 1 to 5 }; var x; var y; var z[ in I] >= if (i >= 3) then -infinity else 10 end <= 100 ; subto c1: forall in I do if i > 2 then if i > 4 then i * x <= 5 and i * 2 * y <= 10 else i * z[i] <= 7 end end; subto c2: forall in I do if i > 2 then if i > 4 then i * x <= 5 and i * 2 * y <= 10 end else i * z[i] <= 7 end; subto c3: forall in I: if (i > 3) then if (i == 4) then z[1] + z[2] == i else z[2] + z[3] == i end and z[3] + z[4] == i and z[4] + z[5] == i else if (i == 2) then z[1] + z[2] == i + 10 else z[2] + z[3] == i + 10 end and z[3] + z[4] == i + 10 and z[4] + z[5] == i + 10 end; zimpl-3.3.6/check/presol.hum.ref0000644001417200060250000000364513301553023016427 0ustar bzfschlooptimi\ This file was automatically generated by Zimpl \ set I := { 1..5 }; \ var x[ in I] binary startval i mod 2; \ var y[ in I] integer <= 2 * i priority i * 10 startval istart; \ var z[ in I] <= 4 * i; \ var w[ in I] integer >= 1 <= if i mod 2 == 1 then 1 else 2 end; \ minimize cost: sum in I : -(x[i] + y[i]); \ subto c1: forall in I: x[i] <= 1; \ subto c2: y[1] + y[2] == 6; \ subto c3: sum in I: x[i] <= 3; \ subto c4: sum in I: y[i] == 15; \ subto c5: forall in I: y[i] >= z[i]; \ subto c6: forall in I with i < 3: x[i] <= z[i]; \ subto c7: forall in I with i >= 3: 1 <= x[i] + y[i] <= 100; \ subto c8: forall in I with i mod 2 == 1: -3 * w[i] == -3; \ subto c9: w[2] >= 2; \ subto c10: w[4] <= 2; \Problem name: presol.zpl Minimize cost: - x[1] - x[2] - x[3] - x[4] - x[5] - y[1] - y[2] - y[3] - y[4] - y[5] Subject to c1_;1;: + x[1] <= 1 c1_;2;: + x[2] <= 1 c1_;3;: + x[3] <= 1 c1_;4;: + x[4] <= 1 c1_;5;: + x[5] <= 1 c2_: + y[2] + y[1] = 6 c3_: + x[5] + x[4] + x[3] + x[2] + x[1] <= 3 c4_: + y[5] + y[4] + y[3] + y[2] + y[1] = 15 c5_;1;: - z[1] + y[1] >= 0 c5_;2;: - z[2] + y[2] >= 0 c5_;3;: - z[3] + y[3] >= 0 c5_;4;: - z[4] + y[4] >= 0 c5_;5;: - z[5] + y[5] >= 0 c6_;1;: - z[1] + x[1] <= 0 c6_;2;: - z[2] + x[2] <= 0 c7_;3;: 1 <= + y[3] + x[3] <= 100 c7_;4;: 1 <= + y[4] + x[4] <= 100 c7_;5;: 1 <= + y[5] + x[5] <= 100 c8_;1;: -3 w[1] = -3 c8_;3;: -3 w[3] = -3 c8_;5;: -3 w[5] = -3 c9_: + w[2] >= 2 c10_: + w[4] <= 2 Bounds 0 <= x[1] <= 1 0 <= x[2] <= 1 0 <= x[3] <= 1 0 <= x[4] <= 1 0 <= x[5] <= 1 0 <= y[1] <= 2 0 <= y[2] <= 4 0 <= y[3] <= 6 0 <= y[4] <= 8 0 <= y[5] <= 10 0 <= z[1] <= 4 0 <= z[2] <= 8 0 <= z[3] <= 12 0 <= z[4] <= 16 0 <= z[5] <= 20 w[1] = 1 1 <= w[2] <= 2 w[3] = 1 1 <= w[4] <= 2 w[5] = 1 General x[1] x[2] x[3] x[4] x[5] y[1] y[2] y[3] y[4] y[5] w[1] w[2] w[3] w[4] w[5] End zimpl-3.3.6/example/chvatal_diet.zpl0000644001417200060250000000225213301553023017362 0ustar bzfschlooptimi# $Id: chvatal_diet.zpl,v 1.4 2009/09/13 16:15:53 bzfkocht Exp $ # # From V. Chvatal: Linear Programming # Chapter 1, Page 3ff. # # A diet problem # set Food := { "Oatmeal", "Chicken", "Eggs", "Milk", "Pie", "Pork" }; set Nutrients := { "Energy", "Protein", "Calcium" }; set Attr := Nutrients + {"Servings", "Price"}; param needed[Nutrients] := <"Energy"> 2000, <"Protein"> 55, <"Calcium"> 800; param data[Food * Attr] := | "Servings", "Energy", "Protein", "Calcium", "Price" | |"Oatmeal" | 4 , 110 , 4 , 2 , 3 | |"Chicken" | 3 , 205 , 32 , 12 , 24 | |"Eggs" | 2 , 160 , 13 , 54 , 13 | |"Milk" | 8 , 160 , 8 , 284 , 9 | |"Pie" | 2 , 420 , 4 , 22 , 20 | |"Pork" | 2 , 260 , 14 , 80 , 19 |; # (kcal) (g) (mg) (cents) var x[ in Food] integer >= 0 <= data[f, "Servings"]; minimize cost: sum in Food : data[f, "Price"] * x[f]; subto need : forall in Nutrients do sum in Food : data[f, n] * x[f] >= needed[n]; zimpl-3.3.6/example/facility_location.zpl0000644001417200060250000000330213301553023020424 0ustar bzfschlooptimi# $Id: facility_location.zpl,v 1.4 2009/09/13 16:15:53 bzfkocht Exp $ # # Generic formulation for the Capacitated Facility Location Problem # # Of course this is also kind of a bin packing problem with packing costs # and variable sized bins, or a cutting stock problem with cutting costs. # set PLANTS := { "A", "B", "C", "D" }; set STORES := { 1 .. 9 }; set PS := PLANTS * STORES; # How much does it cost to build a plant and what capacity will # it then have? # param building[PLANTS] := <"A"> 500, <"B"> 600, <"C"> 700, <"D"> 800; param capacity[PLANTS] := <"A"> 40, <"B"> 55, <"C"> 73, <"D"> 90; # Here is the demand of each store # param demand [STORES] := <1> 10, <2> 14, <3> 17, <4> 8, <5> 9, <6> 12, <7> 11, <8> 15, <9> 16; # Transportation cost from each plant to each store # param transport[PS] := | 1, 2, 3, 4, 5, 6, 7, 8, 9 | |"A"| 55, 4, 17, 33, 47, 98, 19, 10, 6 | |"B"| 42, 12, 4, 23, 16, 78, 47, 9, 82 | |"C"| 17, 34, 65, 25, 7, 67, 45, 13, 54 | |"D"| 60, 8, 79, 24, 28, 19, 62, 18, 45 |; var x[PS] binary; # Is plant p suppling store s ? var z[PLANTS] binary; # Is plant p build ? # We want it cheap # minimize cost: sum