| ►Nregina | Contains the entire Regina calculation engine |
| ►Nalias | Contains helper classes that provide dimension-specific aliases for generic functions |
| CFaceNumber | Helper class that provides a dimension-specific alias for face(), where reasonable |
| CFaceNumber< Derived, 0 > | Helper class that provides a dimension-specific alias for face() |
| CFaceNumber< Derived, 1 > | Helper class that provides a dimension-specific alias for face() |
| CFaceNumber< Derived, 2 > | Helper class that provides a dimension-specific alias for face() |
| CFaceNumber< Derived, 3 > | Helper class that provides a dimension-specific alias for face() |
| CFaceNumber< Derived, 4 > | Helper class that provides a dimension-specific alias for face() |
| CIsomorphismImage | Helper class that provides dimension-specific aliases for both const and non-const versions of simpImage(size_t) and facetPerm(size_t), where reasonable, for isomorphisms in dimension dim |
| CIsomorphismImage< Derived, 2 > | Helper class that provides dimension-specific aliases for both const and non-const versions of simpImage(size_t) and facetPerm(size_t) |
| CIsomorphismImage< Derived, 3 > | Helper class that provides dimension-specific aliases for both const and non-const versions of simpImage(size_t) and facetPerm(size_t) |
| CIsomorphismImage< Derived, 4 > | Helper class that provides dimension-specific aliases for both const and non-const versions of simpImage(size_t) |
| CSimplexVoid | Helper class that provides a dimension-specific alias for simplex(), where reasonable |
| CSimplexVoid< Derived, 2 > | Helper class that provides a dimension-specific alias for simplex() |
| CSimplexVoid< Derived, 3 > | Helper class that provides a dimension-specific alias for simplex() |
| CSimplexVoid< Derived, 4 > | Helper class that provides a dimension-specific alias for simplex() |
| ►Ndetail | Contains implementation details and common functionality for Regina's dimension-agnostic classes |
| CBoundaryComponentBase | Helper class that provides core functionality for a boundary component of a dim-dimensional triangulation |
| CComponentBase | Helper class that provides core functionality for a connected component of a dim-manifold triangulation |
| CConstArrayOf | Provides some implementation details for TableView |
| CExampleBase | Provides core functionality for constructing example dim-dimensional triangulations |
| CExampleFromLowDim | Helper class that builds various dim-dimensional triangulations from (dim-1)-dimensional triangulations |
| CExampleFromLowDim< dim, false > | Helper class that builds various dim-dimensional triangulations from (dim-1)-dimensional triangulations |
| CFaceBase | Helper class that provides core functionality for a subdim-face in the skeleton of a dim-dimensional triangulation |
| CFaceEmbeddingBase | Helper class that provides core functionality for describing how a subdim-face of a dim-dimensional triangulation appears within each top-dimensional simplex |
| CFaceNumberingAPI | Placeholder class that outlines the functions provided by FaceNumbering<dim, subdim> |
| CFaceNumberingImpl | Implementation details for numbering subdim-faces of a dim-dimensional simplex |
| CFaceNumberingImpl< 1, 0, 0 > | |
| CFaceNumberingImpl< 2, 1, 0 > | |
| CFaceNumberingImpl< 3, 1, 1 > | |
| CFaceNumberingImpl< 3, 2, 0 > | |
| CFaceNumberingImpl< 4, 1, 2 > | |
| CFaceNumberingImpl< 4, 2, 1 > | |
| CFaceNumberingImpl< 4, 3, 0 > | |
| CFaceNumberingImpl< dim, 0, codim > | |
| CFaceNumberingImpl< dim, subdim, 0 > | |
| CFacetPairingBase | Provides core functionality for facet pairings (that is, dual graphs) of dim-dimensional triangulations |
| CRetriangulateActionTraits | A traits class that analyses callable objects that are passed to retriangulation or link rewriting functions |
| CSimplexBase | Helper class that provides core functionality for a top-dimensional simplex in a dim-manifold triangulation |
| CStrings | Contains a collection of compile-time constant strings that describe features of the dimension dim |
| ►CTriangulationBase | Provides core functionality for dim-dimensional triangulations |
| CTopologyLock | Creates a temporary lock on the topological properties of the given triangulation |
| ►Ni18n | Various classes and routines for working with internationalisation and character encodings |
| CIConvStream | An output stream that converts between character encodings |
| CIConvStreamBuffer | An output stream buffer that translates between character encodings |
| CLocale | A simple class with static routines for querying information about the current locale |
| CAbelianGroup | Represents a finitely generated abelian group |
| CAngleStructure | Represents an angle structure on a triangulation |
| CAngleStructures | A collection of angle structures on a 3-manifold triangulation |
| CAttachment | A packet that can hold an arbitrary file attachment |
| CAugTriSolidTorus | Represents an augmented triangular solid torus component of a triangulation |
| CBanBoundary | A class that bans normal disc types that meet the boundary of the underlying triangulation |
| CBanConstraintBase | A base class for additional banning and marking constraints that we can place on tree traversal algorithms |
| CBanEdge | A class that bans normal disc types that meet a particular edge of the underlying triangulation |
| CBanNone | A do-nothing class that bans no coordinates and marks no coordinates |
| CBanTorusBoundary | A class that bans and marks disc types associated with torus boundary components |
| CBase64SigEncoding | General helper tools for signatures that use base64 encodings |
| CBitManipulator | An optimised class for bitwise analysis and manipulation of native data types |
| CBitManipulatorBySize | Contains implementation details for BitManipulator where we optimise according to the size of the underlying data type |
| CBitManipulatorByType | Contains implementation details for BitManipulator where we optimise according to the underlying data type |
| CBitmask | A bitmask that can store arbitrarily many true-or-false bits |
| CBitmask1 | A small but extremely fast bitmask class that can store up to 8 * sizeof(T) true-or-false bits |
| CBitmask2 | A small but extremely fast bitmask class that can store up to 8 * sizeof(T) + 8 * sizeof(U) true-or-false bits |
| CBlockedSFS | Represents a blocked Seifert fibred space (possibly with boundary) |
| CBlockedSFSLoop | Represents a blocked Seifert fibred space with two boundary tori that are joined together |
| CBlockedSFSPair | Represents a blocked pair of Seifert fibred spaces joined along a single connecting torus |
| CBlockedSFSTriple | Represents a blocked sequence of three Seifert fibred spaces joined along connecting tori |
| CBoolSet | A set of booleans |
| CBoundaryComponent | A component of the boundary of a dim-manifold triangulation |
| CCallableArg | A traits class that deduces the type of the argument in a given position for a callable object |
| CCensus | A utility class used to search for triangulations across one or more 3-manifold census databases |
| CCensusDB | Stores the location and description of one of Regina's in-built census databases |
| CCensusHit | Stores a single "hit" indicating that some given triangulation has been located in one of Regina's in-built census databases |
| CChildIterator | A forward iterator for iterating through all immediate children of a given packet |
| CClosedPrimeMinSearcher | 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 |
| ►CCompactSearcher | A gluing permutation search class that offers a specialised search algorithm for when only compact (finite) 3-manifold triangulations are required |
| CTetEdgeState | A structure used to track equivalence classes of tetrahedron edges as the gluing permutation set is constructed |
| CTetVertexState | A structure used to track equivalence classes of tetrahedron vertices as the gluing permutation set is constructed |
| CComponent | A connected component of a dim-manifold triangulation |
| CComponent< 2 > | Represents a connected component of a 2-manifold triangulation |
| CComponent< 3 > | Represents a connected component of a 3-manifold triangulation |
| CComponent< 4 > | Represents a connected component of a 4-manifold triangulation |
| CContainer | A packet that simply contains other packets |
| CCrossing | Represents a single crossing in a link diagram |
| CCusp | Used to return information about a single cusp of a SnapPea triangulation |
| CCut | A cut that separates a triangulation or facet pairing into two pieces |
| CCyclotomic | Represents an element of a cyclotomic field |
| CDegreeGreaterThan | Deprecated function object used for sorting faces of triangulations by decreasing degree |
| CDegreeLessThan | Deprecated function object used for sorting faces of triangulations by increasing degree |
| CDiscSetSurfaceDataImpl | Stores a piece of data alongside every normal disc within a particular normal surface |
| CDiscSetTet | Represents a set of normal discs inside a single tetrahedron |
| CDiscSetTetData | Stores data of type T for every normal disc inside a single tetrahedron |
| CDiscSpec | Specifies a single normal disc in a normal surface |
| CDiscSpecIterator | A forward iterator used for running through all normal discs in a normal surface |
| CDiscType | Identifies a single normal or almost normal disc type within a triangulation |
| CDoubleDescription | Implements a modified double description method for polytope vertex enumeration |
| CEnableIf | A struct that holds either a single value of type T or nothing at all, depending on whether the given compile-time condition holds |
| ►CEulerSearcher | A gluing permutation search class that offers a specialised search algorithm for when all vertex links must all have a given fixed Euler characteristic |
| CTetEdgeState | A structure used to track equivalence classes of tetrahedron edges as the gluing permutation set is constructed |
| CTetVertexState | A structure used to track equivalence classes of tetrahedron vertices as the gluing permutation set is constructed |
| CExample | This class offers static routines for constructing a variety of sample dim-dimensional triangulations |
| CExample< 2 > | Offers routines for constructing a variety of sample 2-dimensional triangulations |
| CExample< 3 > | Offers routines for constructing a variety of sample 3-dimensional triangulations |
| CExample< 4 > | Offers routines for constructing a variety of sample 4-dimensional triangulations |
| CExampleLink | This class offers routines for constructing ready-made examples of knots and links |
| CExampleSnapPea | This class offers routines for constructing various example SnapPea triangulations |
| CFace | Represents a subdim-face in the skeleton of a dim-dimensional triangulation |
| CFace< 2, 2 > | Represents a triangle within a 2-manifold triangulation |
| CFace< 3, 0 > | Represents a vertex in the skeleton of a 3-manifold triangulation |
| CFace< 3, 1 > | Represents an edge in the skeleton of a 3-manifold triangulation |
| CFace< 3, 2 > | Represents a triangle in the skeleton of a 3-manifold triangulation |
| CFace< 3, 3 > | Represents a tetrahedron within a 3-manifold triangulation |
| CFace< 4, 0 > | Represents a vertex in the skeleton of a 4-manifold triangulation |
| CFace< 4, 1 > | Represents an edge in the skeleton of a 4-manifold triangulation |
| CFace< 4, 2 > | Represents a triangle in the skeleton of a 4-manifold triangulation |
| CFace< 4, 3 > | Represents a tetrahedron in the skeleton of a 4-manifold triangulation |
| CFace< 4, 4 > | Represents a pentachoron (a 4-dimensional simplex) within a 4-manifold triangulation |
| CFace< dim, dim > | Represents a top-dimensional simplex in a dim-manifold triangulation |
| CFaceEmbedding | Details how a subdim-face of a dim-dimensional triangulation appears within each top-dimensional simplex |
| CFaceNumbering | Specifies how subdim-faces are numbered within a dim-dimensional simplex |
| CFacePair | Represents a pair of tetrahedron face numbers |
| CFacetPairing | Represents the dual graph of a dim-manifold triangulation; that is, the pairwise matching of facets of dim-dimensional simplices |
| CFacetPairing< 3 > | Represents the dual graph of a 3-manifold triangulation |
| CFacetSpec | A lightweight class used to refer to a particular facet of a particular top-dimensional simplex in a dim-dimensional triangulation |
| CFailedPrecondition | An exception thrown when a function detects that its preconditions have been violated |
| CFaithfulAssignment | Determines if an integer of type From can always be assigned to an integer of type To with no loss of information |
| CFileError | An exception thrown when trying to access data from the filesystem |
| CFileInfo | Stores information about a Regina data file, including file format and version |
| CFlags | A class representing a bitwise combination of flags defined by an enumeration type |
| CGlobalDirs | Provides global routines that return directories in which various components of Regina are installed on the system |
| CGluingPerms | Represents a specific set of gluing permutations to complement a particular pairwise matching of simplex facets |
| CGluingPermSearcher | A utility class used to build a census of triangulations, by searching through all possible sets of gluing permutations to match a given facet pairing |
| CGluingPermSearcher< 2 > | A utility class for searching through all possible gluing permutation sets that correspond to a given triangle edge pairing |
| CGluingPermSearcher< 3 > | A utility class for searching through all possible gluing permutation sets that correspond to a given tetrahedron face pairing |
| ►CGluingPermSearcher< 4 > | A utility class for searching through all possible gluing permutation sets that correspond to a given pentachoron facet pairing |
| CPentEdgeState | A structure used to track equivalence classes of pentachoron edges as the gluing permutation set is constructed |
| CPentTriangleState | A structure used to track equivalence classes of pentachoron triangles as the gluing permutation set is constructed |
| CGraphLoop | Represents a closed graph manifold formed by joining a single bounded Seifert fibred space to itself along a torus |
| CGraphPair | Represents a closed graph manifold formed by joining two bounded Seifert fibred spaces along a common torus |
| CGraphTriple | Represents a closed graph manifold formed by joining three bounded Seifert fibred spaces along their torus boundaries |
| CGroupExpression | Represents an expression involving generators from a group presentation or a free group |
| CGroupExpressionTerm | Represents a power of a generator in a group presentation |
| CGroupPresentation | Represents a finite presentation of a group |
| CHandlebody | Represents an orientable handlebody |
| CHilbertCD | Implements a modified Contejean-Devie algorithm for enumerating Hilbert bases |
| CHilbertDual | Implements a modified dual algorithm for enumerating Hilbert bases |
| CHilbertPrimal | Implements a modified primal algorithm for enumerating Hilbert bases |
| CHomGroupPresentation | Represents a homomorphism between groups which are described via finite presentations |
| CHomMarkedAbelianGroup | Represents a homomorphism of finitely generated abelian groups |
| CHomologicalData | A specialised class that computes a large amount of detailed homological information for a 3-manifold triangulation |
| CHyperbolicMinSearcher | A gluing permutation search class that offers a specialised search algorithm for when only minimal ideal triangulations of cusped finite-volume hyperbolic 3-manifolds are required |
| CHyperEncoding | Indicates precisely how a normal hypersurface within a 4-manifold triangulation is encoded by an integer vector |
| CHyperInfo | A class used to query general information about different normal hypersurface coordinate systems |
| CInfinityBase | Internal base classes for use with IntegerBase, templated on whether we should support infinity as an allowed value |
| CIntegerBase | Represents an arbitrary precision integer |
| CIntersectionForm | Represents a symmetric bilinear integral form, which for Regina is typically the intersection form of a 4-manifold |
| CIntOfMinSize | Gives access to native integer types that hold at least k bytes, where k may be any compile-time constant |
| CIntOfSize | Gives access to native integer types that hold exactly k bytes, where k may be any compile-time constant |
| CInvalidArgument | An exception thrown when invalid or unsupported arguments are passed into a function |
| CInvalidInput | An exception thrown when a function reads unexpected or incomplete data from an input stream |
| CIsomorphism | Represents a combinatorial isomorphism from one dim-manifold triangulation into another |
| CIsoSigClassic | The default signature type to use for isomorphism signatures |
| CIsoSigDegrees | Defines an alternate type of isomorphism signature based on degree sequences of subdim-faces |
| CIsoSigPrintable | The default encoding to use for isomorphism signatures |
| CIsReginaArbitraryPrecisionInteger | Determines if the type T is one of Regina's arbitrary precision integer types |
| CIsReginaInteger | Determines if the type T is one of Regina's own integer types (either arbitrary precision or fixed size) |
| CLaurent | Represents a single-variable Laurent polynomial with coefficients of type T |
| CLaurent2 | Represents a Laurent polynomial in the two variables x, y with coefficients of type T |
| CLayeredChain | Represents a layered chain in a triangulation |
| CLayeredChainPair | Represents a layered chain pair component of a triangulation |
| CLayeredLensSpace | Represents a layered lens space component of a triangulation |
| CLayeredLoop | Represents a layered loop component of a triangulation |
| CLayeredSolidTorus | Represents a layered solid torus in a triangulation |
| CLayeredTorusBundle | Describes a layered torus bundle |
| CLayering | Represents a layering of zero or more tetrahedra upon a torus boundary |
| CLensSpace | Represents a general lens space |
| ►CLightweightSequence | A lightweight class for storing a random-access sequence of objects |
| CSubsequenceCompareFirst | A binary function object for comparing subsequences, for use in associative containers whose keys are sequences |
| CLink | Represents a directed knot or link in the 3-sphere |
| CListView | A lightweight object that can be used for iteration and random access to all elements of a given list |
| CListView< Element * > | A specialisation of ListView for working with lists stored in a C-style array whose size is not known at compile-time |
| CListView< Element[n]> | A specialisation of ListView for working with lists stored in a C-style array whose size is fixed at compile-time |
| CLPCol | Used by LPInitialTableaux<LPConstraint> to store a single column of the adjusted matching equation matrix in sparse form |
| CLPConstraintBase | A base class for additional linear constraints that we can add to the tableaux of normal surface or angle structure matching equations |
| CLPConstraintEulerPositive | A class that constraints the tableaux of normal surface matching equations to ensure that Euler characteristic is strictly positive |
| CLPConstraintEulerZero | A class that constraints the tableaux of normal surface matching equations to ensure that Euler characteristic is zero |
| CLPConstraintNone | A do-nothing class that imposes no additional linear constraints on the tableaux of normal surface or angle structure matching equations |
| CLPConstraintNonSpun | A class that constraints the tableaux of normal surface matching equations to ensure that normal surfaces in an ideal triangulation are compact (thereby avoiding spun normal surfaces with infinitely many triangles) |
| CLPConstraintSubspace | A subclass of LPConstraintBase used for constraints defined entirely by homogeneous linear equations |
| CLPData | Stores an intermediate tableaux for the dual simplex method, and contains all of the core machinery for using the dual simplex method |
| CLPInitialTableaux | Stores an adjusted matrix of homogeneous linear matching equations based on a given triangulation, in sparse form |
| CLPMatrix | A matrix class for use with linear programming |
| CLPSystem | Indicates which broad class of vector encodings a particular tableaux is designed to work with |
| CManifold | Represents a particular 3-manifold, independent of how it might be triangulated |
| CMarkedAbelianGroup | Represents a finitely generated abelian group given by a chain complex |
| CMarkedElement | A base class for elements of MarkedVector |
| CMarkedVector | A vector of objects with fast, space-efficient reverse lookup of array indices |
| CMatrix | Represents a matrix of elements of the given type T |
| CMatrix2 | Represents a 2-by-2 integer matrix |
| CMaxAdmissible | Used to enumerate all maximal admissible faces of a polyhedral cone under a given set of admissibility constraints |
| Cmem_istream | An input stream that reads an array of characters in memory |
| Cmem_streambuf | A stream buffer that provides the implementation details for mem_istream |
| CModelLinkGraph | Represents an undirected 4-valent planar graph with a specific planar embedding |
| CModelLinkGraphArc | A reference to an outgoing edge from a node of a model graph for a knot or link |
| CModelLinkGraphCells | Describes the cellular decomposition of the sphere that is induced by a given planar 4-valent graph |
| CModelLinkGraphNode | Represents a single node in a model graph for a knot or link |
| CNativeInteger | A wrapper class for a native, fixed-precision integer type of the given size |
| CNormalEncoding | Indicates precisely how a normal surface is encoded by an integer vector |
| CNormalHypersurface | Represents a single normal hypersurface in a 4-manifold triangulation |
| ►CNormalHypersurfaces | A collection of normal hypersurfaces in a 4-manifold triangulation |
| CVectorIterator | A bidirectional iterator that runs through the raw vectors for hypersurfaces in this list |
| CNormalInfo | A class used to query general information about different normal coordinate systems |
| CNormalSurface | Represents a single normal surface in a 3-manifold triangulation |
| ►CNormalSurfaces | A collection of normal surfaces in a 3-manifold triangulation |
| CVectorIterator | A bidirectional iterator that runs through the raw vectors for surfaces in this list |
| CNoSolution | An exception thrown when Regina has certified that a mathematical problem has no solution |
| CNotImplemented | An exception thrown when some functionality is not yet implemented |
| COutput | A common base class for objects that write human-readable text output |
| COutputBase | Provides a type alias to help identify where in the class hierarchy the output functions T::str() and T::detail() are implemented |
| ►CPacket | Represents a packet of information that may be individually edited or operated upon |
| CChangeEventSpan | An object that facilitates firing packetToBeChanged() and packetWasChanged() events |
| CPacketChildren | A lightweight object that gives access to all immediate children of a given packet |
| ►CPacketData | A lightweight helper class that allows an object of type Held to connect with the wrapped packet class that contains it |
| CChangeEventSpan | An object that facilitates firing packetToBeChanged() and packetWasChanged() events |
| CPacketDescendants | A lightweight object that gives access to all strict descendants of a given packet |
| CPacketInfo | A class used to query general information about different packet types |
| CPacketListener | An object that can be registered to listen for packet events |
| CPacketOf | A packet that stores a mathematical object of type Held |
| CPacketShell | Gives access to the final remains of a packet that is in the process of being destroyed |
| CPerm | Represents a permutation of {0,1,...,n-1} |
| CPerm< 2 > | Represents a permutation of {0,1} |
| CPerm< 3 > | Represents a permutation of {0,1,2} |
| CPerm< 4 > | Represents a permutation of {0,1,2,3} |
| CPerm< 5 > | Represents a permutation of {0,1,2,3,4} |
| CPerm< 6 > | Represents a permutation of {0,1,2,3,4,5} |
| CPerm< 7 > | Represents a permutation of {0,1,2,3,4,5,6} |
| CPermClass | Represents a conjugacy class of permutations on n elements |
| ►CPermGroup | Represents a group of permutations on n elements |
| Citerator | The iterator type for this group |
| CPillowTwoSphere | Represents a 2-sphere made from two triangles glued together along their three edges |
| CPluggedTorusBundle | Describes a triangulation of a graph manifold formed by joining a bounded saturated region with a thin I-bundle over the torus, possibly with layerings in between |
| CPlugTriSolidTorus | Represents a plugged triangular solid torus component of a triangulation |
| CPolynomial | Represents a single-variable polynomial with coefficients of type T |
| CPosOrder | A comparison object that sorts hyperplanes by position vectors |
| CPrimes | A helper class for finding primes and factorising integers |
| CPrismSpec | Specifies a single triangular prism in a tetrahedron |
| CProgressTracker | Manages percentage-based progress tracking and cancellation polling for long operations |
| CProgressTrackerBase | The base class for Regina's progress tracking classes |
| CProgressTrackerOpen | Manages percentage-based progress tracking and cancellation polling for open-ended operations |
| CQitmask1 | A small but extremely fast "base 4 bitmask" class that can store up to 8 * sizeof(T) "qits", each equal to 0, 1, 2 or 3 |
| CQitmask2 | A small but extremely fast "base 4 bitmask" class that can store up to 8 * sizeof(T) + 8 * sizeof(U) "qits", each equal to 0, 1, 2 or 3 |
| CRandomEngine | Offers threadsafe access to Regina's global uniform random bit generator |
| CRational | Represents an arbitrary precision rational number |
| CReginaException | A base class for all of the exceptions that are thrown by Regina's native mathematical code |
| CSatAnnulus | Represents an annulus formed from a pair of triangles in a Seifert fibred space |
| CSatBlock | Represents a saturated block in a Seifert fibred space |
| CSatBlockModel | Contains an explicit triangulation of a saturated block along with the accompanying saturated block description |
| CSatBlockSpec | Describes how a single saturated block forms a part of a larger saturated region |
| CSatCube | A saturated block that is a six-tetrahedron cube |
| CSatLayering | A degenerate saturated block that is a single tetrahedron wrapped around so that two opposite edges touch |
| CSatLST | A saturated block that is a layered solid torus |
| CSatMobius | A degenerate zero-tetrahedron saturated block that corresponds to attaching a Mobius band to a single annulus boundary |
| CSatReflectorStrip | A saturated block that is a reflector strip |
| CSatRegion | A large saturated region in a Seifert fibred space formed by joining together saturated blocks |
| CSatTriPrism | A saturated block that is a three-tetrahedron triangular prism |
| CScript | A packet representing a Python script that can be run |
| CSFSAlt | Provides an alternative representation of a single bounded Seifert fibred space |
| CSFSFibre | Represents an exceptional (alpha, beta) fibre in a Seifert fibred space |
| CSFSpace | Represents a general Seifert fibred space, which may be orientable or non-orientable |
| CShortArray | A short stack-based array of bounded size |
| CShortOutput | A common base class for objects that provide short text output only |
| CSigCensus | A class responsible for building censuses of splitting surface signatures |
| CSignature | Represents a signature of a splitting surface in a closed 3-manifold triangulation |
| CSigPartialIsomorphism | Represents a partial isomorphism between two splitting surface signatures |
| CSimpleSurfaceBundle | Represents a particularly simple closed surface bundle over the circle |
| CSnapPeaCensusManifold | Represents a 3-manifold from the SnapPea cusped census |
| CSnapPeaCensusTri | Represents a 3-manifold triangulation from the SnapPea cusped census |
| CSnapPeaFatalError | An exception that is thrown when the SnapPea kernel encounters a fatal error |
| CSnapPeaIsNull | An exception thrown when the SnapPea kernel is asked to work with a null SnapPea triangulation |
| CSnapPeaMemoryFull | An exception that is thrown when the SnapPea kernel finds that all available memory has been exhausted |
| CSnapPeaTriangulation | Offers direct access to the SnapPea kernel from within Regina |
| CSnapPeaUnsolvedCase | An exception thrown when the SnapPea kernel is not able to perform some computation |
| CSnappedBall | Represents a snapped 3-ball in a triangulation |
| CSnappedTwoSphere | Represents a 2-sphere made from two snapped 3-balls in a triangulation |
| CSnapshot | Keeps a snapshot of an object of type T as it was at a particular moment in time |
| CSnapshotRef | A reference to an image of type T that has been snapshotted at a particular moment in time |
| CSnapshottable | A base class for images of type T that can be snapshotted at a particular moment in time |
| CSnapshotWriteError | An exception thrown when someone tries to modify the read-only deep copy taken by a snapshot |
| CSpiralSolidTorus | Represents a spiralled solid torus in a triangulation |
| CStandardTriangulation | Describes a triangulation or subcomplex of a triangulation whose structure is well-understood |
| CStrandRef | A reference to one of the two strands of a link that pass each other at a crossing |
| CSubtreeIterator | A forward iterator for iterating through the entire packet subtree rooted at a given packet |
| CSurfaceFilter | A packet that accepts or rejects normal surfaces |
| CSurfaceFilterCombination | A normal surface filter that simply combines other filters |
| CSurfaceFilterProperties | A normal surface filter that filters by basic properties of the normal surface |
| ►CTableView | A lightweight object that can be used for random access to all elements of a given multi-dimensional table |
| Citerator | The iterator type for this table view |
| CTangle | Represents a 2-tangle in the 3-ball |
| CTautEnumeration | The main entry point for the tree traversal algorithm to enumerate all taut angle structures in a 3-manifold triangulation |
| CText | A packet representing a text string |
| CTightEncodable | A base class that assists with support for tight encodings and corresponding decodings |
| CTorusBundle | Represents a torus bundle over the circle |
| CTreeBag | Represents a single bag in a tree decomposition |
| ►CTreeDecomposition | Represents a tree decomposition of a graph |
| CGraph | Represents a graph, which may be directed or undirected |
| CTreeEnumeration | The main entry point for the tree traversal algorithm to enumerate all vertex normal or almost normal surfaces in a 3-manifold triangulation |
| CTreeSingleSoln | The main entry point for the tree traversal / branching algorithm to locate a single non-trivial normal surface satisfying given constraints within a 3-manifold triangulation |
| CTreeTraversal | A base class for searches that employ the tree traversal algorithm for enumerating and locating vertex normal surfaces and taut angle structures |
| CTriangulation | A dim-dimensional triangulation, built by gluing together dim-dimensional simplices along their (dim-1)-dimensional facets |
| CTriangulation< 2 > | Represents a 2-manifold triangulation |
| CTriangulation< 3 > | Represents a 3-dimensional triangulation, typically of a 3-manifold |
| CTriangulation< 4 > | Represents a 4-dimensional triangulation, typically of a 4-manifold |
| CTrieSet | A trie-like data structure for storing and retriving sets |
| CTriSolidTorus | Represents a three-tetrahedron triangular solid torus in a triangulation |
| CTrivialTri | Represents one of a few particular hard-coded trivial triangulations that do not belong to any of the other larger families |
| CTxICore | Provides a triangulation of the product T x I (the product of the torus and the interval) |
| CTxIDiagonalCore | One of a family of thin T x I triangulations that typically appear at the centres of layered torus bundles |
| CTxIParallelCore | A specific six-tetrahedron TxICore triangulation that does not fit neatly into other families |
| CTypeTrie | A trie that stores a set of type vectors of a fixed length |
| CUnsolvedCase | An exception thrown when a mathematical function is not able to solve a particular instance of a problem |
| CValidityConstraints | Represents a set of combinatorial validity constraints for use with polytope vertex enumeration |
| CVector | An optimised vector class of elements from a given ring T |
| CXMLTriangulationReader | |
| CXMLWriter | |