Regina 7.3 Calculation Engine
Classes | Namespaces | Macros
gluingpermsearcher3.h File Reference

Supports searching through all possible sets of tetrahedron gluing permutations for a given tetrahedron face pairing. More...

#include <functional>
#include <memory>
#include "core/output.h"
#include "census/gluingperms.h"
#include "census/gluingpermsearcher.h"
#include "census/purgeflags.h"
#include "triangulation/facetpairing3.h"
#include "utilities/exception.h"
#include "utilities/qitmask.h"

Classes

class  regina::GluingPermSearcher< 3 >
 A utility class for searching through all possible gluing permutation sets that correspond to a given tetrahedron face pairing. More...
 
class  regina::EulerSearcher
 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...
 
struct  regina::EulerSearcher::TetVertexState
 A structure used to track equivalence classes of tetrahedron vertices as the gluing permutation set is constructed. More...
 
struct  regina::EulerSearcher::TetEdgeState
 A structure used to track equivalence classes of tetrahedron edges as the gluing permutation set is constructed. More...
 
class  regina::CompactSearcher
 A gluing permutation search class that offers a specialised search algorithm for when only compact (finite) 3-manifold triangulations are required. More...
 
struct  regina::CompactSearcher::TetVertexState
 A structure used to track equivalence classes of tetrahedron vertices as the gluing permutation set is constructed. More...
 
struct  regina::CompactSearcher::TetEdgeState
 A structure used to track equivalence classes of tetrahedron edges as the gluing permutation set is constructed. More...
 
class  regina::ClosedPrimeMinSearcher
 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...
 
class  regina::HyperbolicMinSearcher
 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. More...
 

Namespaces

namespace  regina
 Contains the entire Regina calculation engine.
 

Macros

#define PRUNE_HIGH_DEG_EDGE_SET   1
 Specifies whether the ClosedPrimeMinSearcher census generation code should prune on high-degree edges. More...
 

Detailed Description

Supports searching through all possible sets of tetrahedron gluing permutations for a given tetrahedron face pairing.


Copyright © 1999-2023, 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@maths.uq.edu.au).