debianization: documentation -- prefix

Origin: debian
Forwarded: not-needed
Last-Update: 2015-01-28

Address Debian Policy requirements for documentation.
Consistency requirement: prepend in the documentation
4ti2- to the names of the 4ti2 tools with respect
to the Debian package approach for preventing from
possible collisions.
This is a Debian centric patch.

Gbp-Pq: Name debianization-documentation-prefix.patch

2 files changed, 23 insertions, 23 deletions

diff --git a/doc/4ti2_manual_advanced.tex b/doc/4ti2_manual_advanced.tex
index 49bb8e4..0acf531 100644
--- a/doc/4ti2_manual_advanced.tex
+++ b/doc/4ti2_manual_advanced.tex
@@ -58,7 +58,7 @@ $x\in a+\Lattice_{\Z}$.
 % Currently, only homogeneous affine systems can be solved in
 % \FourTiTwo{} over $\R$ and over $\Z$ using the functions
 % \File{qsolve} and \File{zsolve}, respectively. In order to call
-% these functions, 
+% these functions,
 %% One needs to specify an affine system to
 %% \FourTiTwo.
 
@@ -94,15 +94,15 @@ affine system:
 \end{center}
 and then call
 %% \begin{center}
-%% {\tt ./qsolve affine}
+%% {\tt 4ti2-qsolve affine}
 %% \end{center}
 %% %%%%%%%%%%%%%%%%% This doesn't work in 4ti2 1.6.2
 %% and
 \begin{center}
-{\tt ./zsolve affine}
+{\tt 4ti2-zsolve affine}
 \end{center}
 %% In the continuous case, this creates the files \File{affine.qhom}
-%% and \File{affine.qfree}, and in the integer case 
+%% and \File{affine.qfree}, and in the integer case
 This creates the
 files \File{affine.zhom} and \File{affine.zinhom}. %% and \File{affine.zfree}.
 
diff --git a/doc/4ti2_manual_beginner.tex b/doc/4ti2_manual_beginner.tex
index e39be4c..9d3e02d 100644
--- a/doc/4ti2_manual_beginner.tex
+++ b/doc/4ti2_manual_beginner.tex
@@ -267,7 +267,7 @@ input files look as follows:
 Then % , however,
 we call
 \begin{center}
-{\tt ./zsolve system}
+{\tt 4ti2-zsolve system}
 \end{center}
 This call creates two files
 \begin{center}
@@ -312,7 +312,7 @@ supports homogeneous linear systems, that is, systems with $b=0$.
 %%% We should have an example here.
 
 \begin{center}
-{\tt ./qsolve system}
+{\tt 4ti2-qsolve system}
 \end{center}
 This call creates files
 \begin{center}
@@ -327,11 +327,11 @@ To solve an inhomogeneous system $Ax=b$, $x\geq0$, you (still) need to do some w
 yourself:
 
 \begin{enumerate}
-\item Solve system $Ax-bu=0$, $x\geq 0$, $u\geq 0$ using \File{qsolve}.  
+\item Solve system $Ax-bu=0$, $x\geq 0$, $u\geq 0$ using \File{qsolve}.
 \item Keep those solutions with
-  $u=0$. (These generate the recession cone (of unbounded directions).  
+  $u=0$. (These generate the recession cone (of unbounded directions).
 \item Normalize those solutions with $u>0$ to have $u=1$ (by dividing the
-  vector by~$u$). Be aware that this could create rational numbers.  
+  vector by~$u$). Be aware that this could create rational numbers.
 \item Drop the $u$-component.
 \end{enumerate}
 Any solution to $Ax=b$, $x\geq 0$ can then be obtained by adding one solution
@@ -415,7 +415,7 @@ non-negative". Note that we are allowed to change these defaults
 \end{center}
 Now we call
 \begin{center}
-{\tt ./rays magic3x3}
+{\tt 4ti2-rays magic3x3}
 \end{center}
 which creates the single file
 \begin{center}
@@ -463,7 +463,7 @@ use the same input file
 \end{center}
 for this computation. However, to compute the Hilbert basis, we call
 \begin{center}
-{\tt ./hilbert magic3x3}
+{\tt 4ti2-hilbert magic3x3}
 \end{center}
 which creates the single output file
 \begin{center}
@@ -547,7 +547,7 @@ Let us finally do the computation for $n=3$. We create an input file
 \end{center}
 and call
 \begin{myverbatim}
-./graver ppi3
+4ti2-graver ppi3
 \end{myverbatim}
 This call will create an output file \File{ppi3.gra} that looks
 like:
@@ -587,14 +587,14 @@ The currently fastest algorithm to compute primitive partition
 identities is implemented in the function \File{ppi} of
 \FourTiTwo{}. Try running
 \begin{myverbatim}
-./ppi 17
+4ti2-ppi 17
 \end{myverbatim}
 which creates two files \File{ppi17.mat} (so we do not really have
 to create this file ourselves) and the file \File{ppi17.gra}
 containing the desired identities. Compare this running time with
 the time taken by
 \begin{myverbatim}
-./graver ppi17
+4ti2-graver ppi17
 \end{myverbatim}
 Do you notice the speed-up?
 
@@ -623,7 +623,7 @@ We use the same input file
 \end{center}
 as above and call
 \begin{myverbatim}
-./circuits ppi3
+4ti2-circuits ppi3
 \end{myverbatim}
 This call will create an output file \File{ppi3.cir} that looks
 like:
@@ -693,7 +693,7 @@ Note that we do not have to specify a relations file
 \File{4coins.rel}, since already by default all relations are
 assumed to be equations. Now we simply call
 \begin{center}
-{\tt ./minimize 4coins}
+{\tt 4ti2-minimize 4coins}
 \end{center}
 which creates the single output file
 \begin{center}
@@ -718,7 +718,7 @@ quarters.
 {\bf Remark.} %% We could also specify a list of right-hand sides in
 %% \File{4coins.rhs}. The call
 %% \begin{center}
-%% {\tt ./minimize 4coins}
+%% {\tt 4ti2-minimize 4coins}
 %% \end{center}
 %% then creates a file \File{4coins.min} containing minima to the
 %% corresponding integer programs.
@@ -728,7 +728,7 @@ of giving a solution in \File{4coins.zsol}.  This is no longer supported.
 \eoproof
 
 Since we already know a feasible solution, there is another way we
-might attack this problem, namely via toric Gr\"obner bases. 
+might attack this problem, namely via toric Gr\"obner bases.
 (See \cite[Chapter 11]{deloera-hemmecke-koeppe:book} for an introduction to
 toric ideals and their Gr\"obner bases, and also their generalizations,
 lattice ideals.)
@@ -754,7 +754,7 @@ with respect to a term ordering $\prec$ compatible with $c$, that
 is, $c^\intercal v < c^\intercal u$ implies $x^v\prec x^u$. This
 toric Gr\"obner basis is computed by
 \begin{center}
-{\tt ./groebner 4coins}
+{\tt 4ti2-groebner 4coins}
 \end{center}
 and gives the output file
 \begin{center}
@@ -798,7 +798,7 @@ Then we specify our feasible solution in
 \end{center}
 and call
 \begin{center}
-{\tt ./normalform 4coins}
+{\tt 4ti2-normalform 4coins}
 \end{center}
 to produce the file
 \begin{center}
@@ -818,7 +818,7 @@ that also contains the desired optimal solution.
 {\bf Remark.} We could also specify a list of feasible solutions in
 \File{4coins.feas}. Then the call
 \begin{center}
-{\tt ./normalform 4coins}
+{\tt 4ti2-normalform 4coins}
 \end{center}
 creates a file \File{4coins.nf} containing the minima to the
 corresponding integer programs. (If $z_0$ is a feasible solution,
@@ -912,7 +912,7 @@ matrix that defines our toric ideal in the file \File{4x4.mat}:
 \end{center}
 Let us compute the Markov basis via the call
 \begin{center}
-{\tt ./markov 4x4}
+{\tt 4ti2-markov 4x4}
 \end{center}
 which creates a single output file \File{4x4.mar} containing the
 $36$ Markov basis elements. Up to symmetry (swapping rows or
@@ -958,7 +958,7 @@ $1$-marginals (row and column sums) in \File{3x6.mod}.
 \end{center}
 and call
 \begin{center}
-{\tt ./genmodel 3x6}
+{\tt 4ti2-genmodel 3x6}
 \end{center}
 to produce the desired matrix file \File{3x6.mat}.