[singular] 02/19: tag gfan using examples

felix salfelder felix-guest at moszumanska.debian.org
Mon May 26 13:18:10 UTC 2014


This is an automated email from the git hooks/post-receive script.

felix-guest pushed a commit to branch master
in repository singular.

commit 6bf72e4723ccf1164988280237cef5ea7f8e5705
Author: Bernhard R. Link <brlink at debian.org>
Date:   Sat Mar 3 10:17:51 2012 +0100

    tag gfan using examples
    
    Tag all examples in cones.doc, so that the manual can be built even if
    compiled without gfan support. if the tag is not given to doc2tex.pl,
    it skips the tagged examples
    
    Forwarded: not-needed
---
 doc/cones.doc | 110 +++++++++++++++++++++++++++++-----------------------------
 1 file changed, 55 insertions(+), 55 deletions(-)

diff --git a/doc/cones.doc b/doc/cones.doc
index da2a600..d03c68a 100644
--- a/doc/cones.doc
+++ b/doc/cones.doc
@@ -56,7 +56,7 @@ vectors of L is the lineality space of the cone,
 if either bit is 0, then program computes the information itself.
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 // Let's define a cone in R^3 generated by the following half lines:
 intmat HL[5][3]= 
  1,0, 0,
@@ -121,7 +121,7 @@ if lower bit is 1, then program assumes the kernel of E is the span of the cone,
 if either bit is 0, then program computes the information itself. 
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 // Let's define a cone in R^3 given by the following inequalities:
 intmat IE[6][3]=  
 1,3,5,
@@ -217,7 +217,7 @@ int
 ambient dimension of the cone;
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -245,7 +245,7 @@ cone
 canonicalized version of the cone, no more redundant inequalities and equations
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[11][3]=
 0,-1,1,
 -1,1,0,
@@ -280,7 +280,7 @@ int
 codimension of the cone;
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[1][2]=
 1,0;
 cone c1=coneViaPoints(M1);
@@ -306,7 +306,7 @@ cone
 local version of the given cone around the given point of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][3]=
 1,0,0,
 0,1,0,
@@ -337,7 +337,7 @@ int
 1 iff c1 contains c2 as a face; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=
 1,0,
 0,1;
@@ -368,7 +368,7 @@ int
 1 iff c1 entirely contains c2 resp. iff c contains the given point, possibly on one of its facets; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=
 1,0,
 0,1;
@@ -405,7 +405,7 @@ int
 1 iff the cone contains a point with positive coordinates in its relative interior; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,1,
 1,-1;
@@ -433,7 +433,7 @@ int
 1 iff the given cone contains the given point in its relative interior; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=
 1,0,
 0,1;
@@ -462,7 +462,7 @@ cone if both input arguments are cones, else polytope
 the hull of the two objects
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -504,7 +504,7 @@ cone if both input arguments are cones, else polytope
 the intersection of the two objects
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -545,7 +545,7 @@ int
 dimension of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[1][2]=
 1,0;
 cone c1=coneViaPoints(M1);
@@ -571,7 +571,7 @@ cone
 the dual of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -604,7 +604,7 @@ bigintmat
 equations given by the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -634,7 +634,7 @@ bigintmat
 inner normal vectors of the facets of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -664,7 +664,7 @@ bigintmat
 generating vectors of the lineality space of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[5][3]=
 1,0,0,
 0,1,0,
@@ -691,7 +691,7 @@ bigintmat
 generating vectors of the span of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][5]=
 1,0,0,0,0,
 0,1,0,0,0,
@@ -717,7 +717,7 @@ intvec
 linear forms of the cone (can be set by setLinearForms); returns empty intmat if not set
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][3]=
 -1,0,0,
 0,-1,0;
@@ -744,7 +744,7 @@ int
 getMultiplicity of the cone (can be set by setMultiplicity); returns 1 if not set
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][3]=
 -1,0,0,
 0,-1,0;
@@ -769,7 +769,7 @@ bigintmat
 inequalities given by the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -798,7 +798,7 @@ int
 1 iff the cone is the entire ambient space; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 cone c1;
 isFullSpace(c1);
 intmat M2[2][2]=
@@ -830,7 +830,7 @@ int
 1 iff the cone is just the origin of the ambient space; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 cone c1; // full cone in zero-dimensional ambient space
 isOrigin(c1);
 intmat M2[2][2]=
@@ -863,7 +863,7 @@ int
 1 iff the cone resp. fan is simplicial; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[3][3]=
 1,0,0,
 0,1,0,
@@ -913,7 +913,7 @@ int
 dimension of the lineality space of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[3][3]=
 1,0,0,
 0,1,0,
@@ -944,7 +944,7 @@ cone
 the lineality space of the cone as a new cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[3][3]=
 1,0,0,
 0,1,0,
@@ -977,7 +977,7 @@ cone
 the negated (or negative) of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=
 1,0,
 0,1;
@@ -1002,7 +1002,7 @@ bigintmat
 quotient of Z^n intersected with the span of the cone with Z^n intersected with its lineality space
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][2]=
 1,0,
 0,1,
@@ -1027,7 +1027,7 @@ bigintmat
 random point in the relative interior in c
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][2]=
 1,0,
 0,1,
@@ -1052,7 +1052,7 @@ bigintmat
 rays of the cone outside the lineality space, rays inside the lineality space will be ignored
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -1083,7 +1083,7 @@ intvec
 point in the relative interior of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -1111,7 +1111,7 @@ intvec
 if dimension(c)=linealityDimension(c)+1, then the quotient lattice of Z^n intersected with the span and Z^n intersected with the lineality space is Z^1 and the class of the cone is a semigroup. returns a generator of that semigroup. (like quotientLatticeBasis(cone c), but as intvec)
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][2]=
 1,0,
 0,1,
@@ -1135,7 +1135,7 @@ semigroupGenerator(c);
 adds the information of a linear form to the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][3]=
 -1,0,0,
 0,-1,0;
@@ -1161,7 +1161,7 @@ getLinearForms(c);
 adds the information of a multiplicity to the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][3]=
 -1,0,0,
 0,-1,0;
@@ -1186,7 +1186,7 @@ bigintmat
 generating vectors of the orthogonal complement of the span of the cone
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][5]=
 1,0,0,0,0,
 0,1,0,0,0,
@@ -1211,7 +1211,7 @@ intvec
 special-purpose interior point which supports recognition of symmetries among non-intersecting cones (used in implementation of fans)
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M1[2][2]=
 1,0,
 0,1;
@@ -1305,7 +1305,7 @@ cone
 1 iff c is contained in the collection of cones that is f; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(2);
 intmat M[2][2]=
 1,0,
@@ -1331,7 +1331,7 @@ fan
 empty fan in ambient dimension d
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(2);
 f;
 @c example
@@ -1352,7 +1352,7 @@ fan
 fan generated by the cones supplied, either via a list or via single arguments
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=1,0,0,1;
 cone c=coneViaPoints(M);
 intmat N[2][2]=1,0,0,-1;
@@ -1379,7 +1379,7 @@ fan
 full fan in ambient dimension d
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=fullFan(2);
 f;
 @c example
@@ -1399,7 +1399,7 @@ intvec
 F-Vector of the fan
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(2);
 fVector(f);
 intmat M[2][2]=1,0,0,1;
@@ -1425,7 +1425,7 @@ cone
 cone (orbit=0) or orbit (orbit=1) of a certain index (ranges from 1 to numberOfConesOfDimension(f,*,*,*)) in a given dimension; if maximal=0, all cones and orbits are considered, if maximal=1, only maximal cones and orbits are considered; the default flags for orbit and maximal is 0.
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[3][3]=
 1,0,0,
 0,1,0,
@@ -1454,7 +1454,7 @@ none
 inserts the cone into the fan; checks for compatibility beforehand unless check is passed and equal 0
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(3);
 f;
 intmat M[3][3]=
@@ -1482,7 +1482,7 @@ int
 1 iff cone is compatible with the fan; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(3);
 intmat M1[3][3]=
 1,0,0,
@@ -1520,7 +1520,7 @@ isCompatible(f,c3);
 @c 1 iff the fan is complete; 0 otherwise
 @c @item @strong{Example:}
 @c @smallexample
- at c @c example
+ at c @c example tag:gfan
 @c fan f=fullFan(2);
 @c isComplete(f);
 @c fan g=emptyFan(2);
@@ -1560,7 +1560,7 @@ int
 1 iff the fan is pure; 0 otherwise
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=fullFan(2);
 isPure(f);
 fan g=emptyFan(2);
@@ -1592,7 +1592,7 @@ int
 number of maximal cones in f
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(3);
 nmaxcones(f);
 intmat M1[3][3]=
@@ -1625,7 +1625,7 @@ int
 number of cones in f
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(3);
 ncones(f);
 intmat M1[3][3]=
@@ -1658,7 +1658,7 @@ int
 number of cones (orbit=0) or orbits (orbit=1) of a given dimension; if maximal=0, then all cones are considered, if maximal=1, only maximal cones are considered
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 fan f=emptyFan(3);
 ncones(f);
 intmat M[3][3]=
@@ -1693,7 +1693,7 @@ none
 removes the cone from the fan; checks for compatibility beforehand unless check is passed and equal 0
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[2][2]=1,0,0,1;
 intmat N[2][2]=1,0,1,-1;
 cone c=coneViaPoints(M);
@@ -1744,7 +1744,7 @@ if flags is 1, then program assumes that each row vector of M generates a ray in
 if flags is 0, then program computes that information itself.
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 // This is a polytope in R^2 generated by (0,0), (1,0), (0,1), (0,0);
 intmat V[4][3]= 
 1,0,0,
@@ -1792,7 +1792,7 @@ if lower bit is 1, then program assumes the kernel of E is the span of the cone,
 if either bit is 0, then program computes the information itself. 
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat IE[2][3]=
 1,0,0,
 0,1,0;
@@ -1839,7 +1839,7 @@ polytope
 Newton polytope of f 
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[4][2]=
 0,0,
 1,0,
@@ -1864,7 +1864,7 @@ polytope
 Newton polytope of f 
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 ring r;
 poly f=x+y+z;
 polytope p=newtonPolytope(f);
@@ -1886,7 +1886,7 @@ intmat
 vertices of p 
 @item @strong{Example:}
 @smallexample
- at c example
+ at c example tag:gfan
 intmat M[4][3]=
 1,0,0,
 1,2,0,

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/singular.git



More information about the debian-science-commits mailing list