Regina Calculation Engine
Classes | Typedefs
Census of Triangulations

Census building for triangulations of various dimensions. More...

Classes

class  regina::Dim2Census
 A utility class used to form a complete census of 2-manifold triangulations satisfying certain constraints. More...
 
class  regina::Dim2EdgePairing
 Represents a specific pairwise matching of edges of triangles. More...
 
class  regina::Dim2GluingPerms
 Represents a specific set of gluing permutations to complement a particular pairwise matching of triangle edges. More...
 
class  regina::Dim2GluingPermSearcher
 A utility class for searching through all possible gluing permutation sets that correspond to a given triangle edge pairing. More...
 
class  regina::NCensus
 A utility class used to form a complete census of 3-manifold triangulations satisfying certain constraints. More...
 
class  regina::NFacePairing
 Represents a specific pairwise matching of tetrahedron faces. More...
 
class  regina::NGenericFacetPairing< dim >
 A dimension-agnostic base class that represents a pairwise matching of facets of dim-dimensional simplices. More...
 
class  regina::NGenericGluingPerms< dim >
 A dimension-agnostic base class that represents a specific set of gluing permutations to complement a particular pairwise matching of simplex facets. More...
 
class  regina::NGluingPerms
 Represents a specific set of gluing permutations to complement a particular pairwise matching of tetrahedron faces. More...
 
class  regina::NGluingPermSearcher
 A utility class for searching through all possible gluing permutation sets that correspond to a given tetrahedron face pairing. More...
 
class  regina::NEulerSearcher
 A gluing permutation search class that offers a specialised search algorithm for when all vertex links must all have a given fixed Euler characteristic. More...
 
class  regina::NCompactSearcher
 A gluing permutation search class that offers a specialised search algorithm for when only compact (finite) 3-manifold triangulations are required. More...
 
class  regina::NClosedPrimeMinSearcher
 A gluing permutation search class that offers a specialised search algorithm for when (i) only closed prime minimal P2-irreducible triangulations are required, and (ii) the given face pairing has order at least three. More...
 

Typedefs

typedef void(* regina::UseDim2GluingPerms )(const Dim2GluingPermSearcher *, void *)
 A routine used to do arbitrary processing upon a particular set of triangle gluing permutations. More...
 
typedef bool(* regina::AcceptTriangulation )(NTriangulation *, void *)
 A legacy typedef that is identical to NCensus::AcceptTriangulation. More...
 
typedef std::list< NIsomorphism * > regina::NFacePairingIsoList
 A legacy typedef provided for backward compatibility only. More...
 
typedef void(* regina::UseFacePairing )(const NFacePairing *, const NFacePairingIsoList *, void *)
 A legacy typedef provided for backward compatibility only. More...
 
typedef void(* regina::UseGluingPerms )(const NGluingPermSearcher *, void *)
 A routine used to do arbitrary processing upon a particular set of tetrahedron gluing permutations. More...
 

Detailed Description

Census building for triangulations of various dimensions.

Typedef Documentation

typedef bool(* regina::AcceptTriangulation)(NTriangulation *, void *)

A legacy typedef that is identical to NCensus::AcceptTriangulation.

See NCensus::AcceptTriangulation for further details.

Deprecated:
This global typedef is now deprecated. Please use the identical class typedef NCensus::AcceptTriangulation instead.
typedef std::list<NIsomorphism*> regina::NFacePairingIsoList

A legacy typedef provided for backward compatibility only.

Deprecated:
As of Regina 4.94, this typedef is now available as NFacePairing::IsoList. The old typedef NFacePairingIsoList is provided for backward compatibility, but will be removed in some future version of Regina.
typedef void(* regina::UseDim2GluingPerms)(const Dim2GluingPermSearcher *, void *)

A routine used to do arbitrary processing upon a particular set of triangle gluing permutations.

Such routines are used to process permutation sets found when running Dim2GluingPermSearcher::findAllPerms().

The first parameter passed will be a set of gluing permutations (in fact it will be of the subclass Dim2GluingPermSearcher in order to support partial searches as well as full searches). This set of gluing permutations must not be deallocated by this routine, since it may be used again later by the caller. The second parameter may contain arbitrary data as passed to either Dim2GluingPerms::findAllPerms() or the Dim2GluingPermSearcher class constructor.

Note that the first parameter passed might be null to signal that gluing permutation generation has finished.

typedef void(* regina::UseFacePairing)(const NFacePairing *, const NFacePairingIsoList *, void *)

A legacy typedef provided for backward compatibility only.

Deprecated:
As of Regina 4.94, this typedef is now available as NFacePairing::Use. The old typedef UseFacePairing is provided for backward compatibility, but will be removed in some future version of Regina.
typedef void(* regina::UseGluingPerms)(const NGluingPermSearcher *, void *)

A routine used to do arbitrary processing upon a particular set of tetrahedron gluing permutations.

Such routines are used to process permutation sets found when running NGluingPermSearcher::findAllPerms().

The first parameter passed will be a set of gluing permutations (in fact it will be of the subclass NGluingPermSearcher in order to support partial searches as well as full searches). This set of gluing permutations must not be deallocated by this routine, since it may be used again later by the caller. The second parameter may contain arbitrary data as passed to either NGluingPerms::findAllPerms() or the NGluingPermSearcher class constructor.

Note that the first parameter passed might be null to signal that gluing permutation generation has finished.


Copyright © 1999-2013, The Regina development team
This software is released under the GNU General Public License, with some additional permissions; see the source code for details.
For further information, or to submit a bug or other problem, please contact Ben Burton (bab@debian.org).