debian/0000755000000000000000000000000011750521765007177 5ustar debian/rules0000755000000000000000000000016411515341700010244 0ustar #!/usr/bin/make -f # Uncomment this to turn on verbose mode. #export DH_VERBOSE=1 %: dh --with autotools-dev $@ debian/control0000644000000000000000000000136611515341613010577 0ustar Source: gambit Section: math Priority: optional Maintainer: Ruben Molina Build-Depends: debhelper (>= 7.0.50~), autotools-dev, libwxgtk2.8-dev Standards-Version: 3.9.1 Homepage: http://www.gambit-project.org/ Package: gambit Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends} Description: game theory software and tools Gambit is a set of software tools for doing computation on finite, noncooperative games. These comprise a graphical interface for interactively building and analyzing general games in extensive or strategy form; a number of command-line tools for computing Nash equilibria and other solution concepts in games; and, a set of file formats for storing and communicating games to external tools. debian/gambit.manpages0000644000000000000000000000002411531545616012151 0ustar debian/manpages/*.1 debian/source/0000755000000000000000000000000011515341613010466 5ustar debian/source/format0000644000000000000000000000001411515341613011674 0ustar 3.0 (quilt) debian/changelog0000644000000000000000000000632411750521737011055 0ustar gambit (0.2010.09.01-1.1) unstable; urgency=low * Non-maintainer upload. * Fix "ftbfs with GCC-4.7": add patch gcc-4.7.patch ("this->" qualifiers). (Closes: #667172) -- gregor herrmann Thu, 03 May 2012 17:27:11 +0200 gambit (0.2010.09.01-1) unstable; urgency=low * New maintainer (Closes: #561254) * New upstream version (Closes: #519780) * Fix debian/watch (Closes: #450298). Thanks Yan Morin. -- Ruben Molina Sun, 16 Jan 2011 21:07:01 -0500 gambit (0.2006.01.20-3) unstable; urgency=low * QA upload. * Set Maintainer to QA Group (see #561254) * Import patch from Martin Michlmayr to build with gcc4.4 (Closes: #505074) * Kick dh_desktop (no longer needed) * Move config.* renewal from clean to configure * Move dh_installdeb to proper location * Fix Section in Menu and Desktop file -- Christoph Egger Mon, 21 Dec 2009 16:35:22 +0100 gambit (0.2006.01.20-2.2) unstable; urgency=medium * Non-maintainer upload. * Fix FTBFS with new GCC 4.3 (Closes: #417201). -- Luk Claes Tue, 25 Mar 2008 23:07:32 +0000 gambit (0.2006.01.20-2.1) unstable; urgency=medium * Non-maintainer upload. * Fix FTBFS with GCC 4.3 (Closes: #417201). -- Luk Claes Sun, 09 Mar 2008 13:39:52 +0000 gambit (0.2006.01.20-2) unstable; urgency=low * Acknowledge fixes in NMU: (Closes: #361389 on missing include, Closes: #315214 on stupid pointer casts, Closes: #369708 on NULL assignment to iterator, Closes: #370743 on removal of extra qualifications). * Include .desktop file (Closes: #375766). * Updated standards version. -- Peter van Rossum Sun, 10 Sep 2006 20:36:37 +0200 gambit (0.2006.01.20-1.2) unstable; urgency=low * NMU as part of the GCC 4.1 transition. * Remove extra qualifications from C++ file (Closes: #370743). * Don't assign NULL to an iterator (Closes: #369708). -- Martin Michlmayr Thu, 08 Jun 2006 21:55:07 +0200 gambit (0.2006.01.20-1.1) unstable; urgency=low * Non-maintainer upload. * Fix build for 64 bits arch due to stupid pointer casts into int. rather uses the dedicated %p format. (Closes: #315214). * Add missing #include . (Closes: #361389). -- Pierre Habouzit Mon, 10 Apr 2006 21:49:26 +0200 gambit (0.2006.01.20-1) unstable; urgency=low * New upstream release, released 20 Jan 2006. (Closes: #323525 on FTBFS because of missing forward class declarations). -- Peter van Rossum Thu, 6 Apr 2006 07:36:28 +0200 gambit (0.97.0.7-1) unstable; urgency=low * New upstream release, released 15 Oct 2004. (Closes: #227262 on edit game segfault; closes #268445 on FTBFS with gcc 3.4) -- Peter van Rossum Wed, 4 May 2005 18:28:16 +0200 gambit (0.97.0.4-1) unstable; urgency=low * New upstream version; includes backported code from development version to export extensive form games to graphical files. -- Peter van Rossum Wed, 24 Sep 2003 18:30:25 -0700 gambit (0.97.0.3-1) unstable; urgency=low * Initial Release. (Closes: #186539) -- Peter van Rossum Wed, 26 Mar 2003 13:09:11 -0700 debian/compat0000644000000000000000000000000211515341613010364 0ustar 7 debian/manpages/0000755000000000000000000000000011531545525010767 5ustar debian/manpages/gambit-simpdiv.10000644000000000000000000000260311515341613013760 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-SIMPDIV 1 "January 2011" "gambit-simpdiv: 0.2010.09.01" "User Commands" .SH NAME gambit-simpdiv \- Compute Nash equilibria using simplicial subdivision .SH SYNOPSIS .B gambit-simpdiv [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria using simplicial subdivision .PP Accepts game on standard input. With no options, computes one approximate Nash equilibrium. .SH OPTIONS .TP \fB\-d\fR DECIMALS show equilibria as floating point, with DECIMALS digits (default is to show as rational numbers) .TP \fB\-g\fR MULT granularity of grid refinement at each step (default is 2) .TP \fB\-h\fR print this help message .TP \fB\-r\fR DENOM generate random starting points with denominator DENOM .TP \fB\-n\fR COUNT number of starting points to generate (requires \fB\-r\fR) .TP \fB\-s\fR FILE file containing starting points .TP \fB\-q\fR quiet mode (suppresses banner) .TP \fB\-v\fR verbose mode (shows intermediate output) (default is to only show equilibria) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit.10000644000000000000000000000113311525654633012316 0ustar .TH gambit 1 2011\-02\-12 .SH NAME gambit \- game theory software .SH SYNOPSIS \fBgambit\fR .SH "DESCRIPTION" Gambit is a tool for the construction and analysis of finite extensive and strategic games. .SH "OPTIONS" Gambit has no application specific command line options. .SH "SEE ALSO" \fBgambit-enumpoly\fR(1), \fBgambit-gnm\fR(1), \fBgambit-lcp\fR(1), \fBgambit-logit\fR(1), \fBgambit-nfg2html\fR(1), \fBgambit-nfg-logitdyn\fR(1), \fBgambit-enummixed\fR(1), \fBgambit-enumpure\fR(1), \fBgambit-ipa\fR(1), \fBgambit-liap\fR(1), \fBgambit-lp\fR(1), \fBgambit-nfg2tex\fR(1), \fBgambit-simpdiv\fR(1). debian/manpages/gambit-lp.10000644000000000000000000000177511515341613012731 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-LP 1 "January 2011" "gambit-lp: 0.2010.09.01" "User Commands" .SH NAME gambit-lp \- Compute Nash equilibria by solving a linear program .SH SYNOPSIS .B gambit-lp [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria by solving a linear program .PP Accepts game on standard input. With no options, reports all Nash equilibria found. .SH OPTIONS .TP \fB\-d\fR DECIMALS compute using floating\-point arithmetic; display results with DECIMALS digits .TP \fB\-S\fR use strategic game .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-nfg2tex.10000644000000000000000000000177311515341613013671 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-NFG2TEX 1 "January 2011" "gambit-nfg2tex: 0.2010.09.01" "User Commands" .SH NAME gambit-nfg2tex \- Convert a Gambit .nfg file to LaTeX tables .SH SYNOPSIS .B gambit-nfg2tex [\fIOPTIONS\fR] .SH DESCRIPTION Convert a Gambit .nfg file to LaTeX tables .PP Accepts strategic game on standard input. Converts a Gambit .nfg file to LaTeX tables .SH OPTIONS .TP \fB\-c\fR PLAYER the player to show on columns (default is 2) .TP \fB\-r\fR PLAYER the player to show on rows (default is 1) .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Convert is maintained as a Texinfo manual. If the .B info and .B Convert programs are properly installed at your site, the command .IP .B info Convert .PP should give you access to the complete manual. debian/manpages/gambit-lcp.10000644000000000000000000000232211515341613013061 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-LCP 1 "January 2011" "gambit-lcp: 0.2010.09.01" "User Commands" .SH NAME gambit-lcp \- Compute Nash equilibria by solving a linear complementarity program .SH SYNOPSIS .B gambit-lcp [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria by solving a linear complementarity program .PP Accepts game on standard input. With no options, reports all Nash equilibria found. .SH OPTIONS .TP \fB\-d\fR DECIMALS compute using floating\-point arithmetic; display results with DECIMALS digits .TP \fB\-S\fR use strategic game .TP \fB\-P\fR find only subgame\-perfect equilibria .TP \fB\-e\fR EQA terminate after finding EQA equilibria (default is to find all accessible equilbria .TP \fB\-r\fR DEPTH terminate recursion at DEPTH (only if number of equilibria sought is not 1) .TP \fB\-D\fR print detailed information about equilibria .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-gnm.10000644000000000000000000000174611515341613013075 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-GNM 1 "January 2011" "gambit-gnm: 0.2010.09.01" "User Commands" .SH NAME gambit-gnm \- Compute Nash equilibria using a global Newton method .SH SYNOPSIS .B gambit-gnm [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria using a global Newton method .PP Accepts game on standard input. .SH OPTIONS .TP \fB\-d\fR DECIMALS show equilibria as floating point with DECIMALS digits .TP \fB\-h\fR print this help message .TP \fB\-n\fR COUNT number of perturbation vectors to generate .TP \fB\-s\fR FILE file containing perturbation vectors .TP \fB\-q\fR quiet mode (suppresses banner) .TP \fB\-v\fR verbose mode (shows intermediate output) (default is to only show equilibria) .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-ipa.10000644000000000000000000000145111515341613013056 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-IPA 1 "January 2011" "gambit-ipa: 0.2010.09.01" "User Commands" .SH NAME gambit-ipa \- Compute Nash equilibria using iterated polymatrix approximation .SH SYNOPSIS .B gambit-ipa [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria using iterated polymatrix approximation .PP Accepts game on standard input. .SH OPTIONS .TP \fB\-d\fR DECIMALS show equilibria as floating point with DECIMALS digits .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-logit.10000644000000000000000000000251611515341613013426 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-LOGIT 1 "January 2011" "gambit-logit: 0.2010.09.01" "User Commands" .SH NAME gambit-logit \- Compute a branch of the logit equilibrium correspondence .SH SYNOPSIS .B gambit-logit [\fIOPTIONS\fR] .SH DESCRIPTION Compute a branch of the logit equilibrium correspondence .PP Accepts game on standard input. .SH OPTIONS .TP \fB\-d\fR DECIMALS show equilibria as floating point with DECIMALS digits .TP \fB\-s\fR STEP initial stepsize (default is .03) .TP \fB\-a\fR ACCEL maximum acceleration (default is 1.1) .TP \fB\-m\fR MAXLAMBDA stop when reaching MAXLAMBDA (default is 1000000) .TP \fB\-l\fR LAMBDA compute QRE at `lambda` accurately .TP \fB\-L\fR FILE compute maximum likelihood estimates; read strategy frequencies from FILE .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .TP \fB\-e\fR print only the terminal equilibrium (default is to print the entire branch) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-enumpoly.10000644000000000000000000000210511515341613014152 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-ENUMPOLY 1 "January 2011" "gambit-enumpoly: 0.2010.09.01" "User Commands" .SH NAME gambit-enumpoly \- compute Nash equilibria by solving polynomial systems .SH SYNOPSIS .B gambit-enumpoly [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria by solving polynomial systems .PP Accepts game on standard input. With no options, reports all Nash equilibria found. .SH OPTIONS .TP \fB\-d\fR DECIMALS show equilibrium probabilities with DECIMALS digits .TP \fB\-h\fR print this help message .TP \fB\-S\fR use strategic game .TP \fB\-H\fR use heuristic search method to optimize time to find first equilibrium (strategic games only) .TP \fB\-q\fR quiet mode (suppresses banner) .TP \fB\-v\fR verbose mode (shows supports investigated) (default is only to show equilibria) .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-enummixed.10000644000000000000000000000203211515341613014274 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-ENUMMIXED 1 "January 2011" "gambit-enummixed: 0.2010.09.01" "User Commands" .SH NAME gambit-enummixed \- compute Nash equilibria by enumerating extreme points .SH SYNOPSIS .B gambit-enummixed [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria by enumerating extreme points .PP Accepts game on standard input. With no options, reports all Nash equilibria found. .SH OPTIONS .TP \fB\-d\fR DECIMALS compute using floating\-point arithmetic; display results with DECIMALS digits .TP \fB\-D\fR don't eliminate dominated strategies first .TP \fB\-L\fR use lrslib for enumeration (experimental!) .TP \fB\-c\fR output connectedness information .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/manpages/gambit-enumpure.10000644000000000000000000000153611515341613014151 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-ENUMPURE 1 "January 2011" "gambit-enumpure: 0.2010.09.01" "User Commands" .SH NAME gambit-enumpure \- Search for Nash equilibria in pure strategies .SH SYNOPSIS .B gambit-enumpure [\fIOPTIONS\fR] .SH DESCRIPTION Search for Nash equilibria in pure strategies .PP Accepts game on standard input. With no options, locates all Nash equilibria in pure strategies. .SH OPTIONS .TP \fB\-S\fR use strategic game .TP \fB\-P\fR find only subgame\-perfect equilibria .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .SH "SEE ALSO" The full documentation for .B Search is maintained as a Texinfo manual. If the .B info and .B Search programs are properly installed at your site, the command .IP .B info Search .PP should give you access to the complete manual. debian/manpages/gambit-nfg-logitdyn.10000644000000000000000000000214411525645306014715 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-NFG-LOGITDYN 1 "January 2011" "gambit-nfg-logitdyn: 0.2010.09.01" "User Commands" .SH NAME gambit-nfg-logitdyn \- Identifies quantal response equilibria .SH DESCRIPTION This program attempts to identify the quantal response equilibria which are stable under the perturbed best-reply dynamics for a given value of the logit precision parameter 'lambda'. .PP The program takes a normal form game on standard input. .SH OPTIONS .TP \fB\-f\fR PLAYER Number of decimal places to display in outputting profiles (Default is 6) .TP \fB\-n\fR PLAYER Number of random starting points to generate (default is 100) .TP \fB\-l\fR PLAYER Value of lambda (required) .TP \fB\-t\fR PLAYER Tolerance for stopping criterion (parameter is exponent to 10^(\-k), default is 6). .SH "SEE ALSO" The full documentation for .B gambit-nfg-logitdyn: is maintained as a Texinfo manual. If the .B info and .B gambit-nfg-logitdyn: programs are properly installed at your site, the command .IP .B info gambit-nfg-logitdyn: .PP should give you access to the complete manual. debian/manpages/gambit-nfg2html.10000644000000000000000000000177411515341613014036 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-NFG2HTML 1 "January 2011" "gambit-nfg2html: 0.2010.09.01" "User Commands" .SH NAME gambit-nfg2html \- Convert a Gambit .nfg file to HTML tables .SH SYNOPSIS .B gambit-nfg2html [\fIOPTIONS\fR] .SH DESCRIPTION Convert a Gambit .nfg file to HTML tables .PP Accepts strategic game on standard input. Converts a Gambit .nfg file to HTML tables .SH OPTIONS .TP \fB\-c\fR PLAYER the player to show on columns (default is 2) .TP \fB\-r\fR PLAYER the player to show on rows (default is 1) .TP \fB\-h\fR print this help message .TP \fB\-q\fR quiet mode (suppresses banner) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Convert is maintained as a Texinfo manual. If the .B info and .B Convert programs are properly installed at your site, the command .IP .B info Convert .PP should give you access to the complete manual. debian/manpages/gambit-liap.10000644000000000000000000000225611515341613013236 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.38.2. .TH GAMBIT-LIAP 1 "January 2011" "gambit-liap: 0.2010.09.01" "User Commands" .SH NAME gambit-liap \- Compute Nash equilibria by minimizing the Lyapunov function .SH SYNOPSIS .B gambit-liap [\fIOPTIONS\fR] .SH DESCRIPTION Compute Nash equilibria by minimizing the Lyapunov function .PP Accepts game on standard input. With no options, attempts to compute one equilibrium starting at centroid. .SH OPTIONS .TP \fB\-d\fR DECIMALS print probabilities with DECIMALS digits .TP \fB\-h\fR print this help message .TP \fB\-n\fR COUNT number of starting points to generate .TP \fB\-s\fR FILE file containing starting points .TP \fB\-q\fR quiet mode (suppresses banner) .TP \fB\-v\fR verbose mode (shows intermediate output) (default is to only show equilibria) .PP Gambit version 0.2010.09.01, Copyright (C) 1994\-2010, The Gambit Project This is free software, distributed under the GNU GPL .SH "SEE ALSO" The full documentation for .B Compute is maintained as a Texinfo manual. If the .B info and .B Compute programs are properly installed at your site, the command .IP .B info Compute .PP should give you access to the complete manual. debian/patches/0000755000000000000000000000000011750521712010616 5ustar debian/patches/integer_overflow_in_expression.diff0000644000000000000000000000175611525650167020015 0ustar Description: solves some integer overflows Author: Ruben Molina Forwarded: no Last-Update: 2011-02-12 Index: gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelqhull.cc 2011-01-17 14:41:25.102481452 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.cc 2011-01-17 14:41:38.491490599 -0500 @@ -2319,7 +2319,7 @@ *(rowi++)= coord; for (k=0; k Forwarded: no Last-Update: 2011-02-12 Index: gambit-0.2010.09.01/src/tools/enumpoly/pelgmatr.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelgmatr.cc 2011-01-17 14:41:19.331481656 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelgmatr.cc 2011-01-17 14:41:35.211482469 -0500 @@ -186,7 +186,7 @@ if (M1 == 0||M2 == 0||Mrows(M1)!=Mrows(M2)|| Mcols(M1)!= Mcols(M2)) { - bad_error("matrix_add: dimensions dont match\n"); + bad_error("matrix_add: dimensions don't match\n"); } R=Gmatrix_new(Mrows(M1), Mcols(M1)); for (i = 1; i <= Mrows(M1); i++) Index: gambit-0.2010.09.01/src/tools/enumpoly/pelutils.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelutils.cc 2011-01-17 14:41:25.122481970 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelutils.cc 2011-01-17 14:41:35.211482469 -0500 @@ -776,7 +776,7 @@ if (M1 == 0 || M2 == 0 || Mrows(M1) != Mrows(M2) || Mcols(M1) != Mcols(M2)) { #ifdef LOG_PRINT - fprintf(stderr, "matrix_add: dimensions dont match\n") + fprintf(stderr, "matrix_add: dimensions don't match\n") #endif ; return 0; @@ -1187,7 +1187,7 @@ if (M1 == 0 || M2 == 0 || ImatrixMrows(M1) != ImatrixMrows(M2) || ImatrixMcols(M1) != ImatrixMcols(M2)) { #ifdef LOG_PRINT - fprintf(stderr, "matrix_add: dimensions dont match\n") + fprintf(stderr, "matrix_add: dimensions don't match\n") #endif ; return 0; @@ -1455,7 +1455,7 @@ n=ImatrixMrows(S); if (S==0 || U==0 || ImatrixMrows(U)!=n || ImatrixMrows(U)!=n) - bad_error("Incompatable matrices in Imatrix_hermite"); + bad_error("Incompatible matrices in Imatrix_hermite"); /* Initialize U to nxn identity */ U=Imatrix_resize(U,n,n); Index: gambit-0.2010.09.01/src/tools/enumpoly/pelproc.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelproc.cc 2011-01-17 14:41:19.355481912 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelproc.cc 2011-01-17 14:41:35.211482469 -0500 @@ -32,7 +32,7 @@ case Mtx_T: if ((Gen_type(g1)==Sys_T || Gen_type(g1)==Mtx_T)&& (Gen_type(g2)==Sys_T || Gen_type(g2)==Mtx_T)) M=Gmatrix_Dop(Gen_Mtx(g1),Gen_Mtx(g2),PROC_ADD); - if (M==0) return Rerror("Matrices not compatable",g); + if (M==0) return Rerror("Matrices not compatible",g); if (rt==Sys_T) res=SYSND(M); else res=GMND(M); break; @@ -71,7 +71,7 @@ case Mtx_T: if ((Gen_type(g1)==Sys_T || Gen_type(g1)==Mtx_T)&& (Gen_type(g2)==Sys_T || Gen_type(g2)==Mtx_T)) M=Gmatrix_Dop(Gen_Mtx(g1),Gen_Mtx(g2),PROC_SUB); - if (M==0) return Rerror("Matrices not compatable",g); + if (M==0) return Rerror("Matrices not compatible",g); if (rt==Sys_T) res=SYSND(M); else res=GMND(M); break; debian/patches/series0000644000000000000000000000026711750515620012041 0ustar deprecated_conversion_from_string_constant_to_char_.diff spelling-error-in-binary.diff integer_overflow_in_expression.diff getopt_long_for_help_and_version_options.diff gcc-4.7.patch debian/patches/getopt_long_for_help_and_version_options.diff0000644000000000000000000003111211525650433022012 0ustar Description: enables the --help and --version options Author: Ruben Molina Forwarded: no Last-Update: 2011-02-12 Index: gambit-0.2010.09.01/src/tools/convert/nfg2html.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/convert/nfg2html.cc 2011-01-17 14:42:30.135490401 -0500 +++ gambit-0.2010.09.01/src/tools/convert/nfg2html.cc 2011-01-17 14:43:28.294481769 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include @@ -122,8 +123,16 @@ int rowPlayer = 1, colPlayer = 2; bool quiet = false; - while ((c = getopt(argc, argv, "r:c:hq")) != -1) { + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; + while ((c = getopt_long(argc, argv, "r:c:hq", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'r': rowPlayer = atoi(optarg); break; Index: gambit-0.2010.09.01/src/tools/convert/nfg2tex.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/convert/nfg2tex.cc 2011-01-17 14:42:30.151482450 -0500 +++ gambit-0.2010.09.01/src/tools/convert/nfg2tex.cc 2011-01-17 14:43:28.294481769 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include @@ -136,8 +137,16 @@ int rowPlayer = 1, colPlayer = 2; bool quiet = false; - while ((c = getopt(argc, argv, "r:c:hq")) != -1) { + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; + while ((c = getopt_long(argc, argv, "r:c:hq", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'r': rowPlayer = atoi(optarg); break; Index: gambit-0.2010.09.01/src/tools/enummixed/enummixed.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/enummixed.cc 2011-01-17 14:42:30.075481933 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/enummixed.cc 2011-01-17 14:43:28.294481769 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include @@ -317,8 +318,16 @@ int c; bool useFloat = false, uselrs = false, quiet = false, eliminate = true; - while ((c = getopt(argc, argv, "d:DhqcS")) != -1) { + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; + while ((c = getopt_long(argc, argv, "d:DhqcS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': useFloat = true; g_numDecimals = atoi(optarg); Index: gambit-0.2010.09.01/src/tools/enumpoly/enumpoly.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/enumpoly.cc 2011-01-17 14:42:30.123482449 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/enumpoly.cc 2011-01-17 14:43:28.294481769 -0500 @@ -23,6 +23,7 @@ #include #include #include +#include #include "libgambit/libgambit.h" #include "nfghs.h" @@ -66,9 +67,18 @@ bool quiet = false; bool useHeuristic = false, useStrategic = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { "verbose", 0, NULL, 'V' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "d:hHSqv")) != -1) { + while ((c = getopt_long(argc, argv, "d:hHSqv", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': g_numDecimals = atoi(optarg); break; @@ -84,7 +94,7 @@ case 'q': quiet = true; break; - case 'v': + case 'V': g_verbose = true; break; case '?': Index: gambit-0.2010.09.01/src/tools/enumpure/enumpure.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpure/enumpure.cc 2011-01-17 14:42:30.191491171 -0500 +++ gambit-0.2010.09.01/src/tools/enumpure/enumpure.cc 2011-01-17 14:43:28.294481769 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include "libgambit/libgambit.h" #include "libgambit/subgame.h" @@ -174,9 +175,17 @@ opterr = 0; bool quiet = false, useStrategic = false, bySubgames = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "hqSP")) != -1) { + while ((c = getopt_long(argc, argv, "hqSP", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'S': useStrategic = true; break; Index: gambit-0.2010.09.01/src/tools/gt/nfggnm.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/gt/nfggnm.cc 2011-01-17 14:42:30.059481365 -0500 +++ gambit-0.2010.09.01/src/tools/gt/nfggnm.cc 2011-01-17 14:43:28.298481650 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include #include "libgambit/libgambit.h" @@ -175,13 +176,22 @@ opterr = 0; bool quiet = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { "verbose", 0, NULL, 'V' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "d:n:s:qvhS")) != -1) { + while ((c = getopt_long(argc, argv, "d:n:s:qvhS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'q': quiet = true; break; - case 'v': + case 'V': g_verbose = true; break; case 'd': Index: gambit-0.2010.09.01/src/tools/gt/nfgipa.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/gt/nfgipa.cc 2011-01-17 14:42:30.043490785 -0500 +++ gambit-0.2010.09.01/src/tools/gt/nfgipa.cc 2011-01-17 14:43:28.298481650 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include #include "libgambit/libgambit.h" @@ -116,9 +117,17 @@ opterr = 0; bool quiet = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "d:qhS")) != -1) { + while ((c = getopt_long(argc, argv, "d:qhS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'q': quiet = true; break; Index: gambit-0.2010.09.01/src/tools/lcp/lcp.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/lcp/lcp.cc 2011-01-17 14:42:30.163481393 -0500 +++ gambit-0.2010.09.01/src/tools/lcp/lcp.cc 2011-01-17 14:43:28.298481650 -0500 @@ -23,6 +23,7 @@ #include #include #include +#include #include "libgambit/libgambit.h" #include "libgambit/subgame.h" @@ -79,8 +80,16 @@ int c; bool useFloat = false, useStrategic = false, bySubgames = false, quiet = false; - while ((c = getopt(argc, argv, "d:DhqSPe:r:")) != -1) { + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; + while ((c = getopt_long(argc, argv, "d:DhqSPe:r:", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': useFloat = true; g_numDecimals = atoi(optarg); Index: gambit-0.2010.09.01/src/tools/liap/liap.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/liap/liap.cc 2011-01-17 14:42:30.099482610 -0500 +++ gambit-0.2010.09.01/src/tools/liap/liap.cc 2011-01-17 14:43:28.298481650 -0500 @@ -23,6 +23,7 @@ #include #include #include +#include #include "libgambit/libgambit.h" void PrintBanner(std::ostream &p_stream) @@ -69,9 +70,18 @@ opterr = 0; bool quiet = false, useStrategic = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { "verbose", 0, NULL, 'V' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "d:n:s:hqvS")) != -1) { + while ((c = getopt_long(argc, argv, "d:n:s:hqvS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': g_numDecimals = atoi(optarg); break; @@ -90,7 +100,7 @@ case 'q': quiet = true; break; - case 'v': + case 'V': verbose = true; break; case '?': Index: gambit-0.2010.09.01/src/tools/logit/logit.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/logit/logit.cc 2011-01-17 14:42:30.111491260 -0500 +++ gambit-0.2010.09.01/src/tools/logit/logit.cc 2011-01-17 14:43:28.298481650 -0500 @@ -25,6 +25,7 @@ #include #include #include +#include #include "libgambit/libgambit.h" #include "efglogit.h" #include "nfglogit.h" @@ -95,9 +96,17 @@ bool fullGraph = true; int decimals = 6; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "d:s:a:m:qehSL:p:l:")) != -1) { + while ((c = getopt_long(argc, argv, "d:s:a:m:qehSL:p:l:", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'q': quiet = true; break; Index: gambit-0.2010.09.01/src/tools/lp/lp.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/lp/lp.cc 2011-01-17 14:42:30.175482082 -0500 +++ gambit-0.2010.09.01/src/tools/lp/lp.cc 2011-01-17 14:43:28.298481650 -0500 @@ -24,6 +24,7 @@ #include #include #include +#include #include "libgambit/libgambit.h" template void SolveExtensive(const Gambit::Game &p_game); @@ -59,8 +60,16 @@ int c; bool useFloat = false, useStrategic = false, quiet = false; - while ((c = getopt(argc, argv, "d:hqS")) != -1) { + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { 0, 0, 0, 0 } + }; + while ((c = getopt_long(argc, argv, "d:qhS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': useFloat = true; g_numDecimals = atoi(optarg); Index: gambit-0.2010.09.01/src/tools/simpdiv/nfgsimpdiv.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/simpdiv/nfgsimpdiv.cc 2011-01-17 14:42:30.087482272 -0500 +++ gambit-0.2010.09.01/src/tools/simpdiv/nfgsimpdiv.cc 2011-01-17 14:43:28.298481650 -0500 @@ -22,6 +22,7 @@ #include #include +#include #include #include #include @@ -619,9 +620,18 @@ int randDenom = 1, stopAfter = 1; bool quiet = false; + int long_opt_index = 0; + struct option long_options[] = { + { "help", 0, NULL, 'h' }, + { "version", 0, NULL, 'v' }, + { "verbose", 0, NULL, 'V' }, + { 0, 0, 0, 0 } + }; int c; - while ((c = getopt(argc, argv, "g:hvn:r:s:d:qS")) != -1) { + while ((c = getopt_long(argc, argv, "g:hvn:r:s:d:qS", long_options, &long_opt_index)) != -1) { switch (c) { + case 'v': + PrintBanner(std::cerr); exit(1); case 'd': g_numDecimals = atoi(optarg); g_useFloat = true; @@ -645,7 +655,7 @@ case 'q': quiet = true; break; - case 'v': + case 'V': g_verbose = true; break; case 'S': debian/patches/deprecated_conversion_from_string_constant_to_char_.diff0000644000000000000000000010156511525650377024217 0ustar Description: solves some 'deprecated conversion' warnings Author: Ruben Molina Forwarded: no Last-Update: 2011-02-12 Index: gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelqhull.cc 2011-01-17 14:41:20.534482323 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.cc 2011-01-17 14:41:25.102481452 -0500 @@ -437,7 +437,7 @@ /*---------------------------------------- -setcheck- check set for validity */ -void qh_setcheck(setT *set, char *typenameNEW, int id) { +void qh_setcheck(setT *set, const char *typenameNEW, int id) { int maxsize, size; int waserr= 0; @@ -931,7 +931,7 @@ notes: never errors */ -void qh_setprint(FILE *fp, char* string, setT *set) { +void qh_setprint(FILE *fp, const char* string, setT *set) { int size, k; if (!set) @@ -2117,7 +2117,7 @@ -printmatrix- print matrix given by row vectors print a vector by (fp, "", &vect, 1, len) */ -void qh_printmatrix (FILE *fp, char *string, realT **rows, int numrow, int numcol) { +void qh_printmatrix (FILE *fp, const char *string, realT **rows, int numrow, int numcol) { realT *rowp; int i,k; @@ -2135,7 +2135,7 @@ -printpoints- print pointids for a set of points starting at index prints string and 'p' if defined */ -void qh_printpoints (FILE *fp, char *string, setT *points) { +void qh_printpoints (FILE *fp, const char *string, setT *points) { pointT *point, **pointp; if (string) { @@ -3133,7 +3133,7 @@ /*------------------------------------------- -qh_printallstatistics- print all statistics to a file */ -void qh_printallstatistics (FILE *fp, char *string) { +void qh_printallstatistics (FILE *fp, const char *string) { int i; for (i=ZEND; i--; ) @@ -3145,7 +3145,7 @@ /*------------------------------------------- -printstatistics- print statistics to a file */ -void qh_printstatistics (FILE *fp, char *string) { +void qh_printstatistics (FILE *fp, const char *string) { int i, k; realT ave; @@ -3256,8 +3256,8 @@ #if !qh_KEEPstatistics void qh_collectstatistics (void) {} -void qh_printallstatistics (FILE *fp, char *string) {} -void qh_printstatistics (FILE *fp, char *string) {} +void qh_printallstatistics (FILE *fp, const char *string) {} +void qh_printstatistics (FILE *fp, const char *string) {} #endif @@ -7270,7 +7270,7 @@ /*------------------------------------------ -tracemerging- print trace message if active */ -void qh_tracemerging (char *string) { +void qh_tracemerging (const char *string) { realT cpu; time_t timedata; struct tm *tp; Index: gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelqhull.h 2011-01-17 14:41:20.546482103 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelqhull.h 2011-01-17 14:41:25.102481452 -0500 @@ -623,8 +623,8 @@ void qh_collectstatistics (void); void qh_freestatistics (void); void qh_initstatistics (void); -void qh_printallstatistics (FILE *fp, char *string); -void qh_printstatistics (FILE *fp, char *string); +void qh_printallstatistics (FILE *fp, const char *string); +void qh_printstatistics (FILE *fp, const char *string); /* ======= -constants- ====================== @@ -1145,8 +1145,8 @@ void qh_normalize (coordT *normal, int dim, boolT toporient); boolT qh_orientoutside (facetT *facet); coordT qh_pointdist(pointT *point1, pointT *point2, int dim); -void qh_printmatrix (FILE *fp, char *string, realT **rows, int numrow, int numcol); -void qh_printpoints (FILE *fp, char *string, setT *points); +void qh_printmatrix (FILE *fp, const char *string, realT **rows, int numrow, int numcol); +void qh_printpoints (FILE *fp, const char *string, setT *points); void qh_projectinput (void); pointT *qh_projectpoint(pointT *point, facetT *facet, realT dist); void qh_projectpoints (signed char *project, int n, realT *points, @@ -1314,7 +1314,7 @@ void qh_renamevertex(vertexT *oldvertex, vertexT *newvertex, setT *ridges, facetT *oldfacet, facetT *neighborA); boolT qh_test_appendmerge (facetT *facet, facetT *neighbor); -void qh_tracemerging (char *string); +void qh_tracemerging (const char *string); setT *qh_vertexridges (vertexT *vertex); void qh_vertexridges_facet (vertexT *vertex, facetT *facet, setT **ridges); @@ -1812,8 +1812,8 @@ void qh_initstatistics (void); boolT qh_newstats (int index, int *nextindex); boolT qh_nostatistic (int i); -void qh_printallstatistics (FILE *fp, char *string); -void qh_printstatistics (FILE *fp, char *string); +void qh_printallstatistics (FILE *fp, const char *string); +void qh_printstatistics (FILE *fp, const char *string); void qh_printstatlevel (FILE *fp, int id, int start); void qh_printstats (FILE *fp, int index, int *nextindex); realT qh_stddev (int num, realT tot, realT tot2, realT *ave); Index: gambit-0.2010.09.01/src/gui/bitmaps/newtable.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/newtable.xpm 2011-01-17 14:41:19.942482070 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/newtable.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * newtable_xpm[] = { +static const char * newtable_xpm[] = { "24 24 51 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/zoomout.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/zoomout.xpm 2011-01-17 14:41:19.958482148 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/zoomout.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * zoomout_xpm[] = { +static const char * zoomout_xpm[] = { "24 24 131 2", " c None", ". c #343434", Index: gambit-0.2010.09.01/src/gui/bitmaps/datasrc.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/datasrc.xpm 2011-01-17 14:41:19.970481717 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/datasrc.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * datasrc_xpm[] = { +static const char * datasrc_xpm[] = { "24 24 87 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/zoom1.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/zoom1.xpm 2011-01-17 14:41:19.986480470 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/zoom1.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * zoom1_xpm[] = { +static const char * zoom1_xpm[] = { "24 24 136 2", " c None", ". c #343434", Index: gambit-0.2010.09.01/src/gui/bitmaps/prev.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/prev.xpm 2011-01-17 14:41:19.998492193 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/prev.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * prev_xpm[] = { +static const char * prev_xpm[] = { "24 24 34 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/dice.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/dice.xpm 2011-01-17 14:41:20.010494697 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/dice.xpm 2011-01-17 14:41:25.102481452 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * dice_xpm[] = { +static const char * dice_xpm[] = { "24 24 257 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/toend.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/toend.xpm 2011-01-17 14:41:20.022481836 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/toend.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * toend_xpm[] = { +static const char * toend_xpm[] = { "24 24 43 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/gambit.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/gambit.xpm 2011-01-17 14:41:20.034482384 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/gambit.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * gambit_xpm[] = { +static const char * gambit_xpm[] = { "32 32 7 1", " c #800000", ". c Gray100", Index: gambit-0.2010.09.01/src/gui/bitmaps/zoomin.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/zoomin.xpm 2011-01-17 14:41:20.050492380 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/zoomin.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * zoomin_xpm[] = { +static const char * zoomin_xpm[] = { "24 24 132 2", " c None", ". c #343434", Index: gambit-0.2010.09.01/src/gui/bitmaps/close.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/close.xpm 2011-01-17 14:41:20.058481664 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/close.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * close_xpm[] = { +static const char * close_xpm[] = { "24 24 2 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/adddecimal.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/adddecimal.xpm 2011-01-17 14:41:20.070482771 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/adddecimal.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * adddecimal_xpm[] = { +static const char * adddecimal_xpm[] = { "24 24 3 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/newplayer.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/newplayer.xpm 2011-01-17 14:41:20.082493027 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/newplayer.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * newplayer_xpm[] = { +static const char * newplayer_xpm[] = { "24 24 204 2", " c None", ". c #E5D087", Index: gambit-0.2010.09.01/src/gui/bitmaps/newcol.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/newcol.xpm 2011-01-17 14:41:20.090481612 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/newcol.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * newcol_xpm[] = { +static const char * newcol_xpm[] = { "24 24 50 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/newtree.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/newtree.xpm 2011-01-17 14:41:20.102482230 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/newtree.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * newtree_xpm[] = { +static const char * newtree_xpm[] = { "24 24 94 2", " c None", ". c #E5D087", Index: gambit-0.2010.09.01/src/gui/bitmaps/tree.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/tree.xpm 2011-01-17 14:41:20.114482708 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/tree.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * tree_xpm[] = { +static const char * tree_xpm[] = { "24 24 73 1", " c None", ". c #FF0000", Index: gambit-0.2010.09.01/src/gui/bitmaps/new.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/new.xpm 2011-01-17 14:41:20.126481650 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/new.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * new_xpm[] = { +static const char * new_xpm[] = { "24 24 127 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/undo.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/undo.xpm 2011-01-17 14:41:20.134482249 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/undo.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * undo_xpm[] = { +static const char * undo_xpm[] = { "24 24 31 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/saveas.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/saveas.xpm 2011-01-17 14:41:20.146481821 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/saveas.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * saveas_xpm[] = { +static const char * saveas_xpm[] = { "24 24 262 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/gambitbig.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/gambitbig.xpm 2011-01-17 14:41:20.158491798 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/gambitbig.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * gambitbig_xpm[] = { +static const char * gambitbig_xpm[] = { "300 150 257 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/person.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/person.xpm 2011-01-17 14:41:20.170482639 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/person.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * person_xpm[] = { +static const char * person_xpm[] = { "24 24 182 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/calc.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/calc.xpm 2011-01-17 14:41:20.182481512 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/calc.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * calc_xpm[] = { +static const char * calc_xpm[] = { "24 24 142 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/label.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/label.xpm 2011-01-17 14:41:20.194481991 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/label.xpm 2011-01-17 14:41:25.106482101 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * label_xpm[] = { +static const char * label_xpm[] = { "24 24 59 1", " c None", ". c #FAFAFA", Index: gambit-0.2010.09.01/src/gui/bitmaps/print.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/print.xpm 2011-01-17 14:41:20.202492157 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/print.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * print_xpm[] = { +static const char * print_xpm[] = { "24 24 175 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/exit.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/exit.xpm 2011-01-17 14:41:20.214490610 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/exit.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * exit_xpm[] = { +static const char * exit_xpm[] = { "24 24 140 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/open.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/open.xpm 2011-01-17 14:41:20.226482499 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/open.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * open_xpm[] = { +static const char * open_xpm[] = { "24 24 173 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/next.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/next.xpm 2011-01-17 14:41:20.238491916 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/next.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * next_xpm[] = { +static const char * next_xpm[] = { "24 24 32 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/color.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/color.xpm 2011-01-17 14:41:20.246482248 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/color.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * color_xpm[] = { +static const char * color_xpm[] = { "24 24 60 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/table.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/table.xpm 2011-01-17 14:41:20.258490548 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/table.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * table_xpm[] = { +static const char * table_xpm[] = { "24 24 26 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/save.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/save.xpm 2011-01-17 14:41:20.270482156 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/save.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * save_xpm[] = { +static const char * save_xpm[] = { "24 24 220 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/tobegin.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/tobegin.xpm 2011-01-17 14:41:20.282482145 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/tobegin.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * tobegin_xpm[] = { +static const char * tobegin_xpm[] = { "24 24 51 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/about.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/about.xpm 2011-01-17 14:41:20.290492870 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/about.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * about_xpm[] = { +static const char * about_xpm[] = { "24 24 15 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/move.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/move.xpm 2011-01-17 14:41:20.302482313 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/move.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * move_xpm[] = { +static const char * move_xpm[] = { "24 24 3 1", " c None", ". c #1F1F1F", Index: gambit-0.2010.09.01/src/gui/bitmaps/redo.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/redo.xpm 2011-01-17 14:41:20.314482231 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/redo.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * redo_xpm[] = { +static const char * redo_xpm[] = { "24 24 42 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/deldecimal.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/deldecimal.xpm 2011-01-17 14:41:20.326484454 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/deldecimal.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * deldecimal_xpm[] = { +static const char * deldecimal_xpm[] = { "24 24 3 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/layout.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/layout.xpm 2011-01-17 14:41:20.334482467 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/layout.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * layout_xpm[] = { +static const char * layout_xpm[] = { "24 24 143 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/newrow.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/newrow.xpm 2011-01-17 14:41:20.346482944 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/newrow.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * newrow_xpm[] = { +static const char * newrow_xpm[] = { "24 24 49 1", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/profiles.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/profiles.xpm 2011-01-17 14:41:20.358490754 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/profiles.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * profiles_xpm[] = { +static const char * profiles_xpm[] = { "24 24 21 1", " c None", ". c #889088", Index: gambit-0.2010.09.01/src/gui/bitmaps/stop.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/stop.xpm 2011-01-17 14:41:20.370482990 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/stop.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * stop_xpm[] = { +static const char * stop_xpm[] = { "24 24 258 2", " c None", ". c #010000", Index: gambit-0.2010.09.01/src/gui/bitmaps/preview.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/preview.xpm 2011-01-17 14:41:20.382490660 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/preview.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * preview_xpm[] = { +static const char * preview_xpm[] = { "24 24 196 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/zoomfit.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/zoomfit.xpm 2011-01-17 14:41:20.390481549 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/zoomfit.xpm 2011-01-17 14:41:25.110481422 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * zoomfit_xpm[] = { +static const char * zoomfit_xpm[] = { "24 24 172 2", " c None", ". c #343434", Index: gambit-0.2010.09.01/src/gui/bitmaps/savedata.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/savedata.xpm 2011-01-17 14:41:20.402481816 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/savedata.xpm 2011-01-17 14:41:25.114481721 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * savedata_xpm[] = { +static const char * savedata_xpm[] = { "24 24 211 2", " c None", ". c #000000", Index: gambit-0.2010.09.01/src/gui/bitmaps/font.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/gui/bitmaps/font.xpm 2011-01-17 14:41:20.418491671 -0500 +++ gambit-0.2010.09.01/src/gui/bitmaps/font.xpm 2011-01-17 14:41:25.114481721 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * font_xpm[] = { +static const char * font_xpm[] = { "24 24 61 1", " c None", ". c #8F814C", Index: gambit-0.2010.09.01/src/labenski/art/ledgreen.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/labenski/art/ledgreen.xpm 2011-01-17 14:41:20.426482421 -0500 +++ gambit-0.2010.09.01/src/labenski/art/ledgreen.xpm 2011-01-17 14:41:25.114481721 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char * ledgreen_xpm[] = { +static const char * ledgreen_xpm[] = { "15 15 99 2", " c None", ". c #012B00", Index: gambit-0.2010.09.01/src/labenski/art/ledgrey.xpm =================================================================== --- gambit-0.2010.09.01.orig/src/labenski/art/ledgrey.xpm 2011-01-17 14:41:20.442490251 -0500 +++ gambit-0.2010.09.01/src/labenski/art/ledgrey.xpm 2011-01-17 14:41:25.114481721 -0500 @@ -1,5 +1,5 @@ /* XPM */ -static char *ledgrey_xpm[]={ +static const char *ledgrey_xpm[]={ "15 15 75 2", "Qt c None", ".# c #000000", Index: gambit-0.2010.09.01/src/tools/enummixed/lrslib.c =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/lrslib.c 2011-01-17 14:41:20.454491008 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/lrslib.c 2011-01-17 14:41:25.114481721 -0500 @@ -514,7 +514,7 @@ long -lrs_init (char *name) /* returns TRUE if successful, else FALSE */ +lrs_init (const char *name) /* returns TRUE if successful, else FALSE */ { #ifdef UNUSED_BY_GAMBIT printf ("%s", name); @@ -539,7 +539,7 @@ } void -lrs_close (char *name) +lrs_close (const char *name) { #ifdef UNUSED_BY_GAMBIT fprintf (lrs_ofp, "\n*%s", name); @@ -570,7 +570,7 @@ /* allocate and initialize lrs_dat */ /***********************************/ lrs_dat * -lrs_alloc_dat (char *name) +lrs_alloc_dat (const char *name) { lrs_dat *Q; long i; Index: gambit-0.2010.09.01/src/tools/enummixed/lrsnash.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/lrsnash.cc 2011-01-17 14:41:20.466482685 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/lrsnash.cc 2011-01-17 14:41:25.114481721 -0500 @@ -954,7 +954,7 @@ // This is just a modified 'prat' from lrsmp.c void -printrat (char name[], lrs_mp Nin, lrs_mp Din) /*reduce and print Nin/Din */ +printrat (const char name[], lrs_mp Nin, lrs_mp Din) /*reduce and print Nin/Din */ { lrs_mp Nt, Dt; long i; Index: gambit-0.2010.09.01/src/tools/enummixed/lrslib.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/lrslib.h 2011-01-17 14:41:20.474481538 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/lrslib.h 2011-01-17 14:41:25.114481721 -0500 @@ -217,7 +217,7 @@ long lrs_main (int argc, char *argv[]); /* lrs driver, argv[1]=input file, [argc-1]=output file */ long redund_main (int argc, char *argv[]); /* redund driver, argv[1]=input file, [2]=output file */ -lrs_dat *lrs_alloc_dat (char *name); /* allocate for lrs_dat structure "name" */ +lrs_dat *lrs_alloc_dat (const char *name); /* allocate for lrs_dat structure "name" */ lrs_dic *lrs_alloc_dic (lrs_dat * Q); /* allocate for lrs_dic structure corr. to Q */ void lrs_estimate (lrs_dic * P, lrs_dat * Q); /* get estimates only */ @@ -241,8 +241,8 @@ long lrs_getray (lrs_dic * P, lrs_dat * Q, long col, long comment, lrs_mp_vector output); long lrs_getvertex (lrs_dic * P, lrs_dat * Q, lrs_mp_vector output); -void lrs_close (char *name); /* close lrs lib program "name" */ -long lrs_init (char *name); /* initialize lrslib and arithmetic package for prog "name" */ +void lrs_close (const char *name); /* close lrs lib program "name" */ +long lrs_init (const char *name); /* initialize lrslib and arithmetic package for prog "name" */ void lrs_lpoutput(lrs_dic * P,lrs_dat * Q, lrs_mp_vector output); /* print LP primal and dual solutions */ Index: gambit-0.2010.09.01/src/tools/enummixed/lrsmp.c =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/lrsmp.c 2011-01-17 14:41:20.486482505 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/lrsmp.c 2011-01-17 14:41:25.118482509 -0500 @@ -599,7 +599,7 @@ } void -pmp (char name[], lrs_mp a) /*print the long precision integer a */ +pmp (const char name[], lrs_mp a) /*print the long precision integer a */ { long i; fprintf (lrs_ofp, "%s", name); @@ -615,7 +615,7 @@ void -prat (char name[], lrs_mp Nin, lrs_mp Din) /*reduce and print Nin/Din */ +prat (const char name[], lrs_mp Nin, lrs_mp Din) /*reduce and print Nin/Din */ { lrs_mp Nt, Dt; long i; Index: gambit-0.2010.09.01/src/tools/enummixed/lrsmp.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enummixed/lrsmp.h 2011-01-17 14:41:20.498492202 -0500 +++ gambit-0.2010.09.01/src/tools/enummixed/lrsmp.h 2011-01-17 14:41:25.118482509 -0500 @@ -176,8 +176,8 @@ long mptoi (lrs_mp a); /* convert lrs_mp to long integer */ void mulint (lrs_mp a, lrs_mp b, lrs_mp c); /* multiply two integers a*b --> c */ void normalize (lrs_mp a); /* normalize lrs_mp after computation */ -void pmp (char name[], lrs_mp a); /* print the long precision integer a */ -void prat (char name[], lrs_mp Nt, lrs_mp Dt); /* reduce and print Nt/Dt */ +void pmp (const char name[], lrs_mp a); /* print the long precision integer a */ +void prat (const char name[], lrs_mp Nt, lrs_mp Dt); /* reduce and print Nt/Dt */ void readmp (lrs_mp a); /* read an integer and convert to lrs_mp */ long readrat (lrs_mp Na, lrs_mp Da); /* read a rational or int and convert to lrs_mp */ void reduce (lrs_mp Na, lrs_mp Da); /* reduces Na Da by gcd(Na,Da) */ Index: gambit-0.2010.09.01/src/tools/enumpoly/pelgennd.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelgennd.h 2011-01-17 14:41:20.522482124 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelgennd.h 2011-01-17 14:41:25.118482509 -0500 @@ -87,6 +87,6 @@ Gen_node PLYND(polynomial1 p); -Gen_node Rerror(char *s,Gen_node g); +Gen_node Rerror(const char *s,Gen_node g); Gen_node G_Print(Gen_node g); Index: gambit-0.2010.09.01/src/tools/enumpoly/pelgennd.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelgennd.cc 2011-01-17 14:41:20.558481673 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelgennd.cc 2011-01-17 14:41:25.118482509 -0500 @@ -452,7 +452,7 @@ return a; } -Gen_node Rerror(char *s,Gen_node g) +Gen_node Rerror(const char *s,Gen_node g) { bad_error("We had an Rerror"); Index: gambit-0.2010.09.01/src/tools/enumpoly/pelgntyp.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelgntyp.h 2011-01-17 14:41:20.578482539 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelgntyp.h 2011-01-17 14:41:25.118482509 -0500 @@ -98,7 +98,7 @@ Gen_node XPLND(); Gen_node IDND(char *s); Gen_node PND(Gen_node p(Gen_node)); -Gen_node Rerror(char *s, Gen_node g); +Gen_node Rerror(const char *s, Gen_node g); /* accessors for Gen_nodes*/ Gen_node Gen_next(Gen_node); Index: gambit-0.2010.09.01/src/tools/enumpoly/pelutils.h =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelutils.h 2011-01-17 14:41:20.510481855 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelutils.h 2011-01-17 14:41:25.118482509 -0500 @@ -190,8 +190,8 @@ /************************ definitions from error.h ************************/ /**************************************************************************/ -void bad_error(char *); -void warning(char *); +void bad_error(const char *); +void warning(const char *); /**************************************************************************/ Index: gambit-0.2010.09.01/src/tools/enumpoly/pelhomot.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelhomot.cc 2011-01-17 14:41:20.566490582 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelhomot.cc 2011-01-17 14:41:25.118482509 -0500 @@ -3094,7 +3094,7 @@ ** mem_alloc, ** mem_free -- call malloc and free with some extra book-keeping. */ -void bad_error(char *); +void bad_error(const char *); /* WEIRD - The first pair of declarations below are the global one, Index: gambit-0.2010.09.01/src/tools/enumpoly/pelutils.cc =================================================================== --- gambit-0.2010.09.01.orig/src/tools/enumpoly/pelutils.cc 2011-01-17 14:41:20.594482129 -0500 +++ gambit-0.2010.09.01/src/tools/enumpoly/pelutils.cc 2011-01-17 14:41:25.122481970 -0500 @@ -481,7 +481,7 @@ } #endif -void bad_error(char *m) /* generates an error message and aborts*/ +void bad_error(const char *m) /* generates an error message and aborts*/ { #ifdef GAMBIT_EXCEPTIONS throw ErrorInPelican(); @@ -494,7 +494,7 @@ exit(1); } -void warning(char *m){ +void warning(const char *m){ #ifdef LOG_PRINT fprintf(stderr /* was Pel_Err */,"Warning:%s\n",m) #endif @@ -1544,7 +1544,7 @@ /********************** implementations from Lists.c **********************/ /**************************************************************************/ -void bad_error(char *); +void bad_error(const char *); void mem_free(void *); node list_push(node item,node *stack){ @@ -2279,7 +2279,7 @@ /*********************** implementations from Poly.c **********************/ /**************************************************************************/ -void bad_error(char *); +void bad_error(const char *); int *poly_exp(monomial m, int i){ if (m==0 || i<1 || m->R->n < i ) { debian/patches/gcc-4.7.patch0000644000000000000000000006523411750521712012713 0ustar Description: add this-> qualifiers all over the place to avoid FTBFS with gcc 4.7 Origin: vendor Bug-Debian: http://bugs.debian.org/667172 Forwarded: no Author: gregor herrmann Last-Update: 2012-05-03 --- a/src/libgambit/matrix.imp +++ b/src/libgambit/matrix.imp @@ -81,7 +81,7 @@ template Matrix Matrix::operator+(const Matrix &M) const { - if (!CheckBounds(M)) { + if (!this->CheckBounds(M)) { throw DimensionException(); } @@ -100,7 +100,7 @@ template Matrix Matrix::operator-(const Matrix &M) const { - if (!CheckBounds(M)) { + if (!this->CheckBounds(M)) { throw DimensionException(); } @@ -119,7 +119,7 @@ template Matrix &Matrix::operator+=(const Matrix &M) { - if (!CheckBounds(M)) { + if (!this->CheckBounds(M)) { throw DimensionException(); } @@ -135,7 +135,7 @@ template Matrix &Matrix::operator-=(const Matrix &M) { - if (!CheckBounds(M)) { + if (!this->CheckBounds(M)) { throw DimensionException(); } @@ -157,7 +157,7 @@ template void Matrix::CMultiply(const Vector &in, Vector &out) const { - if (!CheckRow(in) || !CheckColumn(out)) { + if (!this->CheckRow(in) || !this->CheckColumn(out)) { throw DimensionException(); } @@ -192,7 +192,7 @@ template Vector Matrix::operator*(const Vector &v) const { - if (!CheckRow(v)) { + if (!this->CheckRow(v)) { throw DimensionException(); } @@ -204,7 +204,7 @@ template void Matrix::RMultiply(const Vector &in, Vector &out) const { - if (!CheckColumn(in) || !CheckRow(out)) { + if (!this->CheckColumn(in) || !this->CheckRow(out)) { throw DimensionException(); } @@ -261,9 +261,9 @@ Vector row(this->mincol, this->maxcol); Vector result(this->mincol, this->maxcol); for (int i = this->minrow; i <= this->maxrow; i++) { - GetRow(i, row); + this->GetRow(i, row); M.RMultiply(row, result); - SetRow(i, result); + this->SetRow(i, result); } return (*this); } @@ -351,7 +351,7 @@ template bool Matrix::operator==(const Matrix &M) const { - if (!CheckBounds(M)) { + if (!this->CheckBounds(M)) { throw DimensionException(); } --- a/src/libgambit/map.h +++ b/src/libgambit/map.h @@ -365,7 +365,7 @@ int where = Locate(key); if (this->length > 0 && this->keys[where] == key) return this->values[where]; - else return Insert(key, ((key < this->keys[where]) ? where : where + 1), + else return this->Insert(key, ((key < this->keys[where]) ? where : where + 1), this->_default); } @@ -374,7 +374,7 @@ int where = Locate(key); if (this->length > 0 && this->keys[where] == key) return this->values[where]; - else return Insert(key, ((key < this->keys[where]) ? where : where + 1), + else return this->Insert(key, ((key < this->keys[where]) ? where : where + 1), this->_default); } @@ -396,14 +396,14 @@ void Map::Define(const K &key, const T &value) { if (this->length == 0) { - Insert(key, 0, value); + this->Insert(key, 0, value); return; } int where = Locate(key); if (this->keys[where] == key) this->values[where] = value; - else Insert(key, ((key < this->keys[where]) ? where : where + 1), value); + else this->Insert(key, ((key < this->keys[where]) ? where : where + 1), value); } template T Map::Remove(const K &key) --- a/src/tools/enummixed/lptab.imp +++ b/src/tools/enummixed/lptab.imp @@ -188,7 +188,7 @@ return unitcost[-col] - dual[-col]; } else { - GetColumn(col, (Gambit::Vector &)tmpcol); + this->GetColumn(col, (Gambit::Vector &)tmpcol); return cost[col] - dual*tmpcol; } } @@ -214,7 +214,7 @@ { Gambit::Vector tmpcol1(this->MinRow(),this->MaxRow()); BasisSelect(unitcost,cost,tmpcol1); - SolveT(tmpcol1,dual); + this->SolveT(tmpcol1,dual); } // Redefined functions @@ -250,7 +250,7 @@ Gambit::Vector tmpdual(this->MinRow(),this->MaxRow()); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // BigDump(gout); // gout << "\ncost: " << GetCost(); @@ -259,7 +259,7 @@ // for(i=MinRow();i<=MaxRow();i++) gout << " " << RelativeCost(-i); for(j=-this->MaxRow();j<=this->MaxCol();j++) if(j && !this->Member(j) && !this->IsBlocked(j)) { - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); // gout << "\nColumn " << j; // gout << "\nPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; @@ -268,18 +268,18 @@ BestSet = Gambit::List(); for(i=this->MinRow();i<=this->MaxRow();i++) - if(GtZero(tmpcol[i])) BestSet.Append(i); + if(this->GtZero(tmpcol[i])) BestSet.Append(i); if(BestSet.Length()>0) { ratio = solution[BestSet[1]]/tmpcol[BestSet[1]]; // find max ratio for(i=2;i<=BestSet.Length();i++) { x = solution[BestSet[i]]/tmpcol[BestSet[i]]; - if(GtZero(x-ratio)) ratio = x; + if(this->GtZero(x-ratio)) ratio = x; } // eliminate nonmaximizers for(i=BestSet.Length();i>=1;i--) { x = solution[BestSet[i]]/tmpcol[BestSet[i]]; - if(LtZero(x-ratio)) BestSet.Remove(i); + if(this->LtZero(x-ratio)) BestSet.Remove(i); } // check that j would be the row to exit in prior tableau @@ -287,7 +287,7 @@ // first check that prior pivot entry > 0 for(i=BestSet.Length();i>=1;i--) { a_ij = (T)1/tmpcol[BestSet[i]]; - if(LeZero(a_ij)) { + if(this->LeZero(a_ij)) { // gout << "\nj not row to exit in prior tableau: a_ij <= 0"; BestSet.Remove(i); } @@ -301,13 +301,13 @@ if(k!=BestSet[i]) { a_ik = - a_ij * tmpcol[k]; b_k = solution[k] - b_i*tmpcol[k]; - if(GtZero(a_ik) && GtZero(b_k/a_ik -ratio)) { + if(this->GtZero(a_ik) && this->GtZero(b_k/a_ik -ratio)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "higher ratio at row= " << k; BestSet.Remove(i); flag = 1; } - else if(GtZero(a_ik) && EqZero(b_k/a_ik-ratio) && this->Label(k)GtZero(a_ik) && this->EqZero(b_k/a_ik-ratio) && this->Label(k)SolveT(tmpcol,tmpdual); // gout << "\ntmpcol, loc 2: " << tmpcol; // gout << "\ntmpdual, loc 1: " << tmpdual; @@ -338,11 +338,11 @@ else A->GetColumn(j,tmpcol); */ - GetColumn(j,tmpcol); + this->GetColumn(j,tmpcol); // gout << "\ncol " << j << ": " << tmpcol; a_ij = tmpdual*tmpcol; c_j = RelativeCost(j); - if(EqZero(a_ij)) { + if(this->EqZero(a_ij)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "a_ij=0"; BestSet.Remove(i); @@ -353,7 +353,7 @@ if(enter<0) a_ik = tmpdual[-enter]; else { - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); // A->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } @@ -365,7 +365,7 @@ // gout << " c_jo:" << c_jo; // gout << " a_ij:" << a_ij; // gout << " a_ik:" << a_ik; - if(GeZero(c_jo)) { + if(this->GeZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo<0"; BestSet.Remove(i); @@ -377,13 +377,13 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); c_jo = c_k - a_ik * ratio; - if(LtZero(c_jo)) { + if(this->LtZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo < 0 for k = " << k; BestSet.Remove(i); @@ -413,12 +413,12 @@ // first check that pivot preserves primal feasibility // gout << "\nin IsReversePivot, i= " << i << " j = "<< j; - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; - if(LeZero(tmpcol[i])) { + if(this->LeZero(tmpcol[i])) { // gout << "\nPrior tableau not primal feasible: currentPivCol[i] <= 0"; return 0; } @@ -427,7 +427,7 @@ // gout << "\nratio = " << ratio; for(k=tmpcol.First();k<=tmpcol.Last();k++) - if(GtZero(tmpcol[k]) && GtZero(solution[k]/tmpcol[k]-ratio)) { + if(this->GtZero(tmpcol[k]) && this->GtZero(solution[k]/tmpcol[k]-ratio)) { // gout << "\nPrior tableau not primal feasible: i not min ratio"; return 0; } @@ -436,7 +436,7 @@ T a_ij,a_ik,b_i,b_k,c_j,c_k,c_jo; a_ij = (T)1/tmpcol[i]; - if(LeZero(a_ij)) { + if(this->LeZero(a_ij)) { // gout << "\nj not row to exit in prior tableau: a_ij <= 0"; return 0; } @@ -447,12 +447,12 @@ if(k!=i) { a_ik = - a_ij * tmpcol[k]; b_k = solution[k] - b_i*tmpcol[k]; - if(GtZero(a_ik) && GtZero(b_k/a_ik -ratio)) { + if(this->GtZero(a_ik) && this->GtZero(b_k/a_ik -ratio)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "higher ratio at row= " << k; return 0; } - if(GtZero(a_ik) && EqZero(b_k/a_ik-ratio) && this->Label(k)GtZero(a_ik) && this->EqZero(b_k/a_ik-ratio) && this->Label(k)GetColumn(enter,tmpcol); - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(enter); c_jo = c_k - a_ik * ratio; - if(GeZero(c_jo)) { + if(this->GeZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo<0"; return 0; @@ -507,13 +507,13 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); c_jo = c_k - a_ik * ratio; - if(LtZero(c_jo)) { + if(this->LtZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo < 0 for k = " << k; return 0; @@ -541,10 +541,10 @@ Gambit::Vector tmpdual(this->MinRow(),this->MaxRow()); tmpcol = (T)0; tmpcol[i]=(T)1; - SolveT(tmpcol,tmpdual); + this->SolveT(tmpcol,tmpdual); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; @@ -557,11 +557,11 @@ A->GetColumn(j,tmpcol); */ - GetColumn(j,tmpcol); + this->GetColumn(j,tmpcol); a_ij = tmpdual*tmpcol; c_j = RelativeCost(j); - if(GeZero(a_ij)) { + if(this->GeZero(a_ij)) { // gout << "\nPrior tableau not dual feasible: "; // gout << "a_ij>=0"; return 0; @@ -573,12 +573,12 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); - if(LtZero(a_ik) && GtZero(c_k/a_ik-ratio)) { + if(this->LtZero(a_ik) && this->GtZero(c_k/a_ik-ratio)) { // gout << "\nPrior tableau not dual feasible: "; // gout << "\nhigher ratio for k = " << k; return 0; @@ -594,14 +594,14 @@ a_ik = tmpdual[-enter]; else { // A->GetColumn(enter,tmpcol); - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } a_ik = a_ik/a_ij; c_k = RelativeCost(enter); c_k -= a_ik * c_j; - if(GeZero(a_ik)) { + if(this->GeZero(a_ik)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "a_ik>=0"; return 0; @@ -613,19 +613,19 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } a_ik = a_ik/a_ij; c_k = RelativeCost(k); c_k -= a_ik * c_j; - if(LtZero(a_ik) && GtZero(c_k/a_ik- ratio)) { + if(this->LtZero(a_ik) && this->GtZero(c_k/a_ik- ratio)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "\nhigher ratio for k = " << k; return 0; } - if(kLtZero(a_ik) && this->EqZero(c_k/a_ik - ratio)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "\nsame ratio and lower lex for k = " << k; return 0; @@ -634,13 +634,13 @@ // check that j would be the row to exit in prior tableau - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; T b_k,b_i; b_i= solution[i]/tmpcol[i]; - if(LeZero(b_i)) { + if(this->LeZero(b_i)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "b_i<=0"; return 0; @@ -650,7 +650,7 @@ for(k=this->b->First();k<=this->b->Last();k++) if(k!=i) { b_k = solution[k] - b_i * tmpcol[k]; - if(GtZero(b_k) && this->Label(k)GtZero(b_k) && this->Label(k) 1) { if(c > this->MaxRow()) throw BadExitIndex(); if(c>=this->MinRow()) { - SolveColumn(-c,col); + this->SolveColumn(-c,col); // gout << "\n-c = " << -c << " col = " << col; } // Initialize tempmax. @@ -153,7 +153,7 @@ Gambit::Vector incol(this->MinRow(), this->MaxRow()); Gambit::Vector col(this->MinRow(), this->MaxRow()); - SolveColumn(inlabel,incol); + this->SolveColumn(inlabel,incol); // gout << "\nincol = " << incol; // Find all row indices for which column col has positive entries. for (i = this->MinRow(); i <= this->MaxRow(); i++) @@ -172,14 +172,14 @@ // eliminating nonmaximizers of // a similar ratio, until only one candidate remains. c = this->MinRow()-1; - BasisVector(col); + this->BasisVector(col); // gout << "\nLength = " << BestSet.Length(); // gout << "\n x = " << col << "\n"; while (BestSet.Length() > 1) { // this is where ITEM 001 is failing if(c > this->MaxRow()) throw BadExitIndex(); if(c>=this->MinRow()) { - SolveColumn(-c,col); + this->SolveColumn(-c,col); // gout << "\n-c = " << -c << " col = " << col; } // Initialize tempmax. --- a/src/tools/lp/lptab.imp +++ b/src/tools/lp/lptab.imp @@ -188,7 +188,7 @@ return unitcost[-col] - dual[-col]; } else { - GetColumn(col, (Gambit::Vector &)tmpcol); + this->GetColumn(col, (Gambit::Vector &)tmpcol); return cost[col] - dual*tmpcol; } } @@ -214,7 +214,7 @@ { Gambit::Vector tmpcol1(this->MinRow(),this->MaxRow()); BasisSelect(unitcost,cost,tmpcol1); - SolveT(tmpcol1,dual); + this->SolveT(tmpcol1,dual); } // Redefined functions @@ -250,7 +250,7 @@ Gambit::Vector tmpdual(this->MinRow(),this->MaxRow()); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // BigDump(gout); // gout << "\ncost: " << GetCost(); @@ -259,7 +259,7 @@ // for(i=MinRow();i<=MaxRow();i++) gout << " " << RelativeCost(-i); for(j=-this->MaxRow();j<=this->MaxCol();j++) if(j && !this->Member(j) && !this->IsBlocked(j)) { - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); // gout << "\nColumn " << j; // gout << "\nPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; @@ -268,18 +268,18 @@ BestSet = Gambit::List(); for(i=this->MinRow();i<=this->MaxRow();i++) - if(GtZero(tmpcol[i])) BestSet.Append(i); + if(this->GtZero(tmpcol[i])) BestSet.Append(i); if(BestSet.Length()>0) { ratio = solution[BestSet[1]]/tmpcol[BestSet[1]]; // find max ratio for(i=2;i<=BestSet.Length();i++) { x = solution[BestSet[i]]/tmpcol[BestSet[i]]; - if(GtZero(x-ratio)) ratio = x; + if(this->GtZero(x-ratio)) ratio = x; } // eliminate nonmaximizers for(i=BestSet.Length();i>=1;i--) { x = solution[BestSet[i]]/tmpcol[BestSet[i]]; - if(LtZero(x-ratio)) BestSet.Remove(i); + if(this->LtZero(x-ratio)) BestSet.Remove(i); } // check that j would be the row to exit in prior tableau @@ -287,7 +287,7 @@ // first check that prior pivot entry > 0 for(i=BestSet.Length();i>=1;i--) { a_ij = (T)1/tmpcol[BestSet[i]]; - if(LeZero(a_ij)) { + if(this->LeZero(a_ij)) { // gout << "\nj not row to exit in prior tableau: a_ij <= 0"; BestSet.Remove(i); } @@ -301,13 +301,13 @@ if(k!=BestSet[i]) { a_ik = - a_ij * tmpcol[k]; b_k = solution[k] - b_i*tmpcol[k]; - if(GtZero(a_ik) && GtZero(b_k/a_ik -ratio)) { + if(this->GtZero(a_ik) && this->GtZero(b_k/a_ik -ratio)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "higher ratio at row= " << k; BestSet.Remove(i); flag = 1; } - else if(GtZero(a_ik) && EqZero(b_k/a_ik-ratio) && this->Label(k)GtZero(a_ik) && this->EqZero(b_k/a_ik-ratio) && this->Label(k)SolveT(tmpcol,tmpdual); // gout << "\ntmpcol, loc 2: " << tmpcol; // gout << "\ntmpdual, loc 1: " << tmpdual; @@ -338,11 +338,11 @@ else A->GetColumn(j,tmpcol); */ - GetColumn(j,tmpcol); + this->GetColumn(j,tmpcol); // gout << "\ncol " << j << ": " << tmpcol; a_ij = tmpdual*tmpcol; c_j = RelativeCost(j); - if(EqZero(a_ij)) { + if(this->EqZero(a_ij)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "a_ij=0"; BestSet.Remove(i); @@ -353,7 +353,7 @@ if(enter<0) a_ik = tmpdual[-enter]; else { - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); // A->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } @@ -365,7 +365,7 @@ // gout << " c_jo:" << c_jo; // gout << " a_ij:" << a_ij; // gout << " a_ik:" << a_ik; - if(GeZero(c_jo)) { + if(this->GeZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo<0"; BestSet.Remove(i); @@ -377,13 +377,13 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); c_jo = c_k - a_ik * ratio; - if(LtZero(c_jo)) { + if(this->LtZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo < 0 for k = " << k; BestSet.Remove(i); @@ -413,12 +413,12 @@ // first check that pivot preserves primal feasibility // gout << "\nin IsReversePivot, i= " << i << " j = "<< j; - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; - if(LeZero(tmpcol[i])) { + if(this->LeZero(tmpcol[i])) { // gout << "\nPrior tableau not primal feasible: currentPivCol[i] <= 0"; return 0; } @@ -427,7 +427,7 @@ // gout << "\nratio = " << ratio; for(k=tmpcol.First();k<=tmpcol.Last();k++) - if(GtZero(tmpcol[k]) && GtZero(solution[k]/tmpcol[k]-ratio)) { + if(this->GtZero(tmpcol[k]) && this->GtZero(solution[k]/tmpcol[k]-ratio)) { // gout << "\nPrior tableau not primal feasible: i not min ratio"; return 0; } @@ -436,7 +436,7 @@ T a_ij,a_ik,b_i,b_k,c_j,c_k,c_jo; a_ij = (T)1/tmpcol[i]; - if(LeZero(a_ij)) { + if(this->LeZero(a_ij)) { // gout << "\nj not row to exit in prior tableau: a_ij <= 0"; return 0; } @@ -447,12 +447,12 @@ if(k!=i) { a_ik = - a_ij * tmpcol[k]; b_k = solution[k] - b_i*tmpcol[k]; - if(GtZero(a_ik) && GtZero(b_k/a_ik -ratio)) { + if(this->GtZero(a_ik) && this->GtZero(b_k/a_ik -ratio)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "higher ratio at row= " << k; return 0; } - if(GtZero(a_ik) && EqZero(b_k/a_ik-ratio) && this->Label(k)GtZero(a_ik) && this->EqZero(b_k/a_ik-ratio) && this->Label(k)GetColumn(enter,tmpcol); - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(enter); c_jo = c_k - a_ik * ratio; - if(GeZero(c_jo)) { + if(this->GeZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo<0"; return 0; @@ -507,13 +507,13 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); c_jo = c_k - a_ik * ratio; - if(LtZero(c_jo)) { + if(this->LtZero(c_jo)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "c_jo < 0 for k = " << k; return 0; @@ -541,10 +541,10 @@ Gambit::Vector tmpdual(this->MinRow(),this->MaxRow()); tmpcol = (T)0; tmpcol[i]=(T)1; - SolveT(tmpcol,tmpdual); + this->SolveT(tmpcol,tmpdual); Gambit::Vector solution(tmpcol); //$$ - BasisVector(solution); //$$ + this->BasisVector(solution); //$$ // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; @@ -557,11 +557,11 @@ A->GetColumn(j,tmpcol); */ - GetColumn(j,tmpcol); + this->GetColumn(j,tmpcol); a_ij = tmpdual*tmpcol; c_j = RelativeCost(j); - if(GeZero(a_ij)) { + if(this->GeZero(a_ij)) { // gout << "\nPrior tableau not dual feasible: "; // gout << "a_ij>=0"; return 0; @@ -573,12 +573,12 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } c_k = RelativeCost(k); - if(LtZero(a_ik) && GtZero(c_k/a_ik-ratio)) { + if(this->LtZero(a_ik) && this->GtZero(c_k/a_ik-ratio)) { // gout << "\nPrior tableau not dual feasible: "; // gout << "\nhigher ratio for k = " << k; return 0; @@ -594,14 +594,14 @@ a_ik = tmpdual[-enter]; else { // A->GetColumn(enter,tmpcol); - GetColumn(enter,tmpcol); + this->GetColumn(enter,tmpcol); a_ik = tmpdual*tmpcol; } a_ik = a_ik/a_ij; c_k = RelativeCost(enter); c_k -= a_ik * c_j; - if(GeZero(a_ik)) { + if(this->GeZero(a_ik)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "a_ik>=0"; return 0; @@ -613,19 +613,19 @@ a_ik=tmpdual[-k]; else { // A->GetColumn(k,tmpcol); - GetColumn(k,tmpcol); + this->GetColumn(k,tmpcol); a_ik = tmpdual*tmpcol; } a_ik = a_ik/a_ij; c_k = RelativeCost(k); c_k -= a_ik * c_j; - if(LtZero(a_ik) && GtZero(c_k/a_ik- ratio)) { + if(this->LtZero(a_ik) && this->GtZero(c_k/a_ik- ratio)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "\nhigher ratio for k = " << k; return 0; } - if(kLtZero(a_ik) && this->EqZero(c_k/a_ik - ratio)) { // gout << "\ni not col to enter in prior tableau: "; // gout << "\nsame ratio and lower lex for k = " << k; return 0; @@ -634,13 +634,13 @@ // check that j would be the row to exit in prior tableau - SolveColumn(j,tmpcol); + this->SolveColumn(j,tmpcol); // gout << "\ncurrentPivCol = " << tmpcol; // gout << "\ncurrentSolCol = " << solution; T b_k,b_i; b_i= solution[i]/tmpcol[i]; - if(LeZero(b_i)) { + if(this->LeZero(b_i)) { // gout << "\nj not row to exit in prior tableau: "; // gout << "b_i<=0"; return 0; @@ -650,7 +650,7 @@ for(k=this->b->First();k<=this->b->Last();k++) if(k!=i) { b_k = solution[k] - b_i * tmpcol[k]; - if(GtZero(b_k) && this->Label(k)GtZero(b_k) && this->Label(k) License: GPL-2+ Files: src/tools/enumpoly/pel*.h src/tools/enumpoly/pel*.cc Copyright: © 1995, Birk Huber License: Qhull Qhull is copyrighted as noted above. Qhull is free software and may be obtained via http from www.qhull.org. It may be freely copied, modified, and redistributed under the following conditions: . 1. All copyright notices must remain intact in all files. . 2. A copy of this text file must be distributed along with any copies of Qhull that you redistribute; this includes copies that you have modified, or copies of programs or other software products that include Qhull. . 3. If you modify Qhull, you must include a notice giving the name of the person performing the modification, the date of modification, and the reason for such modification. . 4. When distributing modified versions of Qhull, or other software products that include Qhull, you must provide notice that the original source code may be obtained as noted above. . 5. There is no warranty or other guarantee of fitness for Qhull, it is provided solely "as is". Bug reports or fixes may be sent to qhull_bug@qhull.org; the authors may or may not act on them as they desire. Comment: http://www.qhull.org/COPYING.txt Files: src/tools/enumpoly/pelqhull.* Copyright: © 1993-1994, The Geometry Center License: Qhull Files: src/tools/enumpoly/nfgcpoly.* src/tools/enumpoly/nfghs.* Copyright: © 1994-2010, Litao Wei and The Gambit Project (http://www.gambit-project.org) License: GPL-2+ Files: src/tools/gt/* Copyright: © 2002, Ben Blum and Christian Shelton License: GPL-2+ Files: src/tools/liap/funcmin.cc Copyright: © 1996-2000, Fabrice Rossi License: GPL-2+ Files: src/libgambit/integer.* Copyright: © 1988, Free Software Foundation © 1987, Massachusetts Institute of Technology © 1994-2010, The Gambit Project (http://www.gambit-project.org) License: LGPL-2+ This 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 of the License, or (at your option) any later version. . This 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 General Public License along with this program. If not, see . . On Debian systems, the complete text of the GNU Lesser General Public License can be found in "/usr/share/common-licenses/LGPL-2". Files: src/libgambit/rational.* Copyright: © 1988, Free Software Foundation © 1994-2010, The Gambit Project (http://www.gambit-project.org) License: LGPL-2+ Files: debian/* Copyright: © 2011, Ruben Molina © 2009, Christoph Egger © 2008, Luk Claes © 2006, Martin Michlmayr © 2006, Pierre Habouzit © 2003-2006, Peter van Rossum License: GPL-2+ Files: src/labenski/include/wx/plotctrl/fourier.h src/labenski/include/wx/plotctrl/lm_lsqr.h src/labenski/include/wx/wxthings/medsort.h src/labenski/src/fourier.c src/labenski/src/genergdi.cpp src/labenski/src/lm_lsqr.cpp Copyright: no copyright License: public-domain debian/docs0000644000000000000000000000001411515341613010034 0ustar NEWS README debian/menu0000644000000000000000000000016411525650760010065 0ustar ?package(gambit):needs="X11" section="Applications/Science/Mathematics"\ title="gambit" command="/usr/bin/gambit" debian/watch0000644000000000000000000000007011515341613010214 0ustar version=3 http://sf.net/gambit/gambit-(\d.*.*)\.tar\.gz