cleaned up specializations of swap()/iter_swap()

[ginac.git] / ginsh / ginsh.1.in

diff --git a/ginsh/ginsh.1.in b/ginsh/ginsh.1.in
index e8c24a5040bb29a61c83c856fa3553bd25edc682..bc560dbcb51a62b344e55ba452aa7efadb8eed08 100644 (file)
--- a/ginsh/ginsh.1.in
+++ b/ginsh/ginsh.1.in
@@ -110,8 +110,8 @@ symbol that controls the numeric precision of calculations with inexact numbers.
 Assigning an integer value to digits will change the precision to the given
 number of decimal places.
 .SS WILDCARDS
 Assigning an integer value to digits will change the precision to the given
 number of decimal places.
 .SS WILDCARDS

-The has(), match() and subs() functions accept wildcards as placeholders for
-expressions. These have the syntax
+The has(), find(), match() and subs() functions accept wildcards as placeholders
+for expressions. These have the syntax

 .RS
 .BI $ number
 .RE
 .RS
 .BI $ number
 .RE


@@ -119,7 +119,7 @@ for example $0, $1 etc.
 .SS LAST PRINTED EXPRESSIONS
 ginsh provides the three special symbols
 .RS
 .SS LAST PRINTED EXPRESSIONS
 ginsh provides the three special symbols
 .RS

-", "" and """
+%, %% and %%%

 .RE
 that refer to the last, second last, and third last printed expression, respectively.
 These are handy if you want to use the results of previous computations in a new
 .RE
 that refer to the last, second last, and third last printed expression, respectively.
 These are handy if you want to use the results of previous computations in a new


@@ -144,9 +144,6 @@ unary minus
 .B *
 multiplication
 .TP
 .B *
 multiplication
 .TP

-.B %
-non-commutative multiplication
-.TP

 .B /
 division
 .TP
 .B /
 division
 .TP


@@ -243,6 +240,9 @@ detail here. Please refer to the GiNaC documentation.
 .BI collect_distributed( expression ", " list )
 \- collects coefficients of like powers (result in distributed form)
 .br
 .BI collect_distributed( expression ", " list )
 \- collects coefficients of like powers (result in distributed form)
 .br

+.BI collect_common_factors( expression )
+\- collects common factors from the terms of sums
+.br

 .BI content( expression ", " symbol )
 \- content part of a polynomial
 .br
 .BI content( expression ", " symbol )
 \- content part of a polynomial
 .br


@@ -279,11 +279,14 @@ detail here. Please refer to the GiNaC documentation.
 .BI expand( expression )
 \- expands an expression
 .br
 .BI expand( expression )
 \- expands an expression
 .br

+.BI find( expression ", " pattern )
+\- returns a list of all occurrences of a pattern in an expression
+.br

 .BI gcd( expression ", " expression )
 \- greatest common divisor
 .br
 .BI gcd( expression ", " expression )
 \- greatest common divisor
 .br

-.BI has( expression ", " expression )
-\- returns "1" if the first expression contains the second (which may contain wildcards) as a subexpression, "0" otherwise
+.BI has( expression ", " pattern )
+\- returns "1" if the first expression contains the pattern as a subexpression, "0" otherwise

 .br
 .BI inverse( matrix )
 \- inverse of a matrix
 .br
 .BI inverse( matrix )
 \- inverse of a matrix


@@ -303,6 +306,9 @@ detail here. Please refer to the GiNaC documentation.
 .BI lsolve( equation-list ", " symbol-list )
 \- solve system of linear equations
 .br
 .BI lsolve( equation-list ", " symbol-list )
 \- solve system of linear equations
 .br

+.BI map( expression ", " pattern )
+\- apply function to each operand; the function to be applied is specified as a pattern with the "$0" wildcard standing for the operands
+.br

 .BI match( expression ", " pattern )
 \- check whether expression matches a pattern; returns a list of wildcard substitutions or "FAIL" if there is no match
 .br
 .BI match( expression ", " pattern )
 \- check whether expression matches a pattern; returns a list of wildcard substitutions or "FAIL" if there is no match
 .br


@@ -339,6 +345,9 @@ detail here. Please refer to the GiNaC documentation.
 .BI series( expression ", " relation-or-symbol ", " order )
 \- series expansion
 .br
 .BI series( expression ", " relation-or-symbol ", " order )
 \- series expansion
 .br

+.BI sprem( expression ", " expression ", " symbol )
+\- sparse pseudo-remainder of polynomials
+.br

 .BI sqrfree( "expression [" ", " symbol-list] )
 \- square-free factorization of a polynomial
 .br
 .BI sqrfree( "expression [" ", " symbol-list] )
 \- square-free factorization of a polynomial
 .br


@@ -401,6 +410,21 @@ This is useful for debugging and for learning about GiNaC internals.
 .PP
 The command
 .RS
 .PP
 The command
 .RS

+.BI print_latex( expression );
+.RE
+prints a LaTeX representation of the given
+.IR expression .
+.PP
+The command
+.RS
+.BI print_csrc( expression );
+.RE
+prints the given
+.I expression
+in a way that can be used in a C or C++ program.
+.PP
+The command
+.RS

 .BI iprint( expression );
 .RE
 prints the given
 .BI iprint( expression );
 .RE
 prints the given


@@ -452,7 +476,7 @@ x
 [[\-x+x^2\-2,(x+1)^2],[c,d]]
 > determinant(M);
 \-2*d\-2*x*c\-x^2*c\-x*d+x^2*d\-c
 [[\-x+x^2\-2,(x+1)^2],[c,d]]
 > determinant(M);
 \-2*d\-2*x*c\-x^2*c\-x*d+x^2*d\-c

-> collect(", x);
+> collect(%, x);

 (\-d\-2*c)*x+(d\-c)*x^2\-2*d\-c
 > solve quantum field theory;
 parse error at quantum
 (\-d\-2*c)*x+(d\-c)*x^2\-2*d\-c
 > solve quantum field theory;
 parse error at quantum


@@ -486,7 +510,7 @@ C++ programming language
 .PP
 CLN \- A Class Library for Numbers, Bruno Haible
 .SH COPYRIGHT
 .PP
 CLN \- A Class Library for Numbers, Bruno Haible
 .SH COPYRIGHT

-Copyright \(co 1999-2001 Johannes Gutenberg Universit\(:at Mainz, Germany
+Copyright \(co 1999-2003 Johannes Gutenberg Universit\(:at Mainz, Germany

 
 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 
 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by