class TGeoTorus: public TGeoBBox

 Default constructor

 Constructor without name.

 Constructor with name.

 Constructor based on an array of parameters.
 param[0] = R
 param[1] = Rmin
 param[2] = Rmax
 param[3] = Phi1
 param[4] = Dphi

 Computes capacity of the shape in [length^3]

 Compute bounding box of the torus.

 Compute normal to closest surface from POINT.

 Test if point is inside the torus.
 check phi range

 Compute closest distance from point px,py to each vertex.

 Computes distance to axis of the torus from point pt + t*dir;

 Computes derivative w.r.t. t of the distance to axis of the torus from point pt + t*dir;

 Second derivative of distance to torus axis w.r.t t.

 Compute distance from inside point to surface of the torus.

 Compute distance from outside point to surface of the torus.

--- Divide this torus shape belonging to volume "voldiv" into ndiv volumes
 called divname, from start position with the given step.

 Returns name of axis IAXIS.

 Get range of shape for a given axis.

--- Fill vector param[4] with the bounding cylinder parameters. The order
 is the following : Rmin, Rmax, Phi1, Phi2, dZ

 Create a shape fitting the mother.

 print shape parameters

 Creates a TBuffer3D describing *this* shape.
 Coordinates are in local reference frame.

 Fill TBuffer3D structure for segments and polygons.

 computes the closest distance from given point to this shape, according
 to option. The matching point on the shape is stored in spoint.

 Save a primitive as a C++ statement(s) on output stream "out".

 Set torus dimensions.

 Set torus dimensions starting from a list.

 Create torus mesh points

 Create torus mesh points

 Return number of vertices of the mesh representation

 fill size of this 3-D object
   TVirtualGeoPainter *painter = gGeoManager->GetGeomPainter();
   if (!painter) return;
   Int_t n = gGeoManager->GetNsegments()+1;
   Int_t numPoints = n*(n-1);
   Int_t numSegs   = (2*n-1)*(n-1);
   Int_t numPolys  = (n-1)*(n-1);

   Bool_t hasrmin = (fRmin>0)?kTRUE:kFALSE;
   Bool_t hasphi  = (fDphi<360)?kTRUE:kFALSE;
   if (hasrmin) numPoints *= 2;
   else if (hasphi) numPoints += 2;
   if (hasrmin) {
      numSegs   += (2*n-1)*(n-1);
      numPolys  += (n-1)*(n-1);
   }
   if (hasphi) {
      numSegs   += 2*(n-1);
      numPolys  += 2*(n-1);
   }

   painter->AddSize3D(numPoints, numSegs, numPolys);

 Find real solutions of the cubic equation : x^3 + a*x^2 + b*x + c = 0
 Input: a,b,c
 Output: x[3] real solutions
 Returns number of real solutions (1 or 3)

 Find real solutions of the quartic equation : x^4 + a*x^3 + b*x^2 + c*x + d = 0
 Input: a,b,c,d
 Output: x[4] - real solutions
 Returns number of real solutions (0 to 3)

 Returns distance to the surface or the torus (fR,r) from a point, along
 a direction. Point is close enough to the boundary so that the distance
 to the torus is decreasing while moving along the given direction.

 Returns numbers of vertices, segments and polygons composing the shape mesh.

 Fills a static 3D buffer and returns a reference.

 Check the inside status for each of the points in the array.
 Input: Array of point coordinates + vector size
 Output: Array of Booleans for the inside of each point

 Compute the normal for an array o points so that norm.dot.dir is positive
 Input: Arrays of point coordinates and directions + vector size
 Output: Array of normal directions

 Compute distance from array of input points having directions specisied by dirs. Store output in dists

 Compute distance from array of input points having directions specisied by dirs. Store output in dists

 Compute safe distance from each of the points in the input array.
 Input: Array of point coordinates, array of statuses for these points, size of the arrays
 Output: Safety values

 constructors

 destructor