Regina 7.3 Calculation Engine
|
Represents a layered loop component of a triangulation. More...
#include <subcomplex/layeredloop.h>
Public Member Functions | |
LayeredLoop (const LayeredLoop &)=default | |
Creates a new copy of the given structure. More... | |
LayeredLoop & | operator= (const LayeredLoop &)=default |
Sets this to be a copy of the given structure. More... | |
void | swap (LayeredLoop &other) noexcept |
Swaps the contents of this and the given structure. More... | |
unsigned long | length () const |
Returns the length of this layered loop. More... | |
bool | isTwisted () const |
Determines if this layered loop contains a twist. More... | |
Edge< 3 > * | hinge (int which) const |
Returns the requested hinge edge of this layered loop. More... | |
bool | operator== (const LayeredLoop &other) const |
Determines whether this and the given structure represent the same type of layered loop. More... | |
bool | operator!= (const LayeredLoop &other) const |
Determines whether this and the given structure represent different types of layered loop. More... | |
std::unique_ptr< Manifold > | manifold () const override |
Returns the 3-manifold represented by this triangulation, if such a recognition routine has been implemented. More... | |
AbelianGroup | homology () const override |
Returns the expected first homology group of this triangulation, if such a routine has been implemented. More... | |
std::ostream & | writeName (std::ostream &out) const override |
Writes the name of this triangulation as a human-readable string to the given output stream. More... | |
std::ostream & | writeTeXName (std::ostream &out) const override |
Writes the name of this triangulation in TeX format to the given output stream. More... | |
void | writeTextLong (std::ostream &out) const override |
Writes a detailed text representation of this object to the given output stream. More... | |
std::string | name () const |
Returns the name of this specific triangulation as a human-readable string. More... | |
std::string | texName () const |
Returns the name of this specific triangulation in TeX format. More... | |
virtual void | writeTextShort (std::ostream &out) const |
Writes a short text representation of this object to the given output stream. More... | |
std::string | str () const |
Returns a short text representation of this object. More... | |
std::string | utf8 () const |
Returns a short text representation of this object using unicode characters. More... | |
std::string | detail () const |
Returns a detailed text representation of this object. More... | |
Static Public Member Functions | |
static std::unique_ptr< LayeredLoop > | recognise (const Component< 3 > *comp) |
Determines if the given triangulation component is a layered loop. More... | |
static std::unique_ptr< StandardTriangulation > | recognise (Component< 3 > *component) |
Determines whether the given component represents one of the standard triangulations understood by Regina. More... | |
static std::unique_ptr< StandardTriangulation > | recognise (const Triangulation< 3 > &tri) |
Determines whether the given triangulation represents one of the standard triangulations understood by Regina. More... | |
Represents a layered loop component of a triangulation.
A layered loop is a layered chain of n tetrahedra whose bottom tetrahedron is layered onto its top tetrahedron to form a complete loop. See the LayeredChain class notes for a description of a layered chain.
To make a layered chain into a layered loop, the bottom faces of the first tetrahedron will be layered upon the top faces of the last tetrahedron, completing the loop. At this stage there is a choice. The layering can be done in the usual fashion, or there may be a twist in which the upper square (the bottom faces of the first tetrahedron) is rotated 180 degrees before being layered on the lower annulus (the top faces of the last tetrahedron).
If there is a twist, the two hinge edges become identified and the entire component has a single vertex. If there is no twist, the two hinge edges remain distinct (and disjoint) and the entire component has two vertices.
The length of the layered loop is the number of tetrahedra it contains. A layered loop must contain at least one tetrahedron.
All optional StandardTriangulation routines are implemented for this class.
This class supports copying but does not implement separate move operations, since its internal data is so small that copying is just as efficient. It implements the C++ Swappable requirement via its own member and global swap() functions, for consistency with the other StandardTriangulation subclasses. Note that the only way to create these objects (aside from copying or moving) is via the static member function recognise().
|
default |
Creates a new copy of the given structure.
|
inherited |
Returns a detailed text representation of this object.
This text may span many lines, and should provide the user with all the information they could want. It should be human-readable, should not contain extremely long lines (which cause problems for users reading the output in a terminal), and should end with a final newline. There are no restrictions on the underlying character set.
|
inline |
Returns the requested hinge edge of this layered loop.
See the general class notes for further details. If there is only one hinge but parameter which is 1, null
will be returned.
which | specifies which hinge to return; this must be 0 or 1. |
|
overridevirtual |
Returns the expected first homology group of this triangulation, if such a routine has been implemented.
This routine does not work by calling Triangulation<3>::homology() on the associated real triangulation. Instead the homology is calculated directly from the known properties of this standard triangulation.
This means that homology() needs to be implemented separately for each class of standard triangulation. See the class notes for each subclass of StandardTriangulation for details on whether homology has been implemented for that particular subclass. The default implementation of this routine just throws a NotImplemented exception.
Most users will not need this routine, since presumably you already have an explicit Triangulation<3> available and so you can just call Triangulation<3>::homology() instead (which, unlike this routine, is always implemented). This StandardTriangulation::homology() routine should be seen as more of a verification/validation tool for the Regina developers.
If this StandardTriangulation describes an entire Triangulation<3> (and not just a part thereof) then the results of this routine should be identical to the homology group obtained by calling Triangulation<3>::homology() upon the associated real triangulation.
NotImplemented | Homology calculation has not yet been implemented for this particular type of standard triangulation. |
FileError | The homology needs to be read from file (as opposed to computed), but the file is inaccessible or its contents cannot be read and parsed correctly. Currently this can only happen for the subclass SnapPeaCensusTri, which reads its results from the SnapPea census databases that are installed with Regina. |
Reimplemented from regina::StandardTriangulation.
|
inline |
Determines if this layered loop contains a twist.
See the general class notes for further details.
true
if and only if this layered loop contains a twist.
|
inline |
Returns the length of this layered loop.
See the general class notes for further details.
|
overridevirtual |
Returns the 3-manifold represented by this triangulation, if such a recognition routine has been implemented.
If the 3-manifold cannot be recognised then this routine will return null
.
The details of which standard triangulations have 3-manifold recognition routines can be found in the notes for the corresponding subclasses of StandardTriangulation. The default implementation of this routine returns null
.
It is expected that the number of triangulations whose underlying 3-manifolds can be recognised will grow between releases.
Reimplemented from regina::StandardTriangulation.
|
inherited |
Returns the name of this specific triangulation as a human-readable string.
|
inline |
Determines whether this and the given structure represent different types of layered loop.
Specifically, two layered loops will compare as equal if they have the same length and either both are twisted or both are untwisted.
This test follows the general rule for most subclasses of StandardTriangulation (excluding fixed structures such as SnappedBall and TriSolidTorus): two objects compare as equal if and only if they have the same combinatorial parameters (which for this subclass means they describe isomorphic structures).
other | the structure with which this will be compared. |
true
if and only if this and the given structure represent different types of layered loop.
|
default |
Sets this to be a copy of the given structure.
|
inline |
Determines whether this and the given structure represent the same type of layered loop.
Specifically, two layered loops will compare as equal if they have the same length and either both are twisted or both are untwisted.
This test follows the general rule for most subclasses of StandardTriangulation (excluding fixed structures such as SnappedBall and TriSolidTorus): two objects compare as equal if and only if they have the same combinatorial parameters (which for this subclass means they describe isomorphic structures).
other | the structure with which this will be compared. |
true
if and only if this and the given structure represent the same type of layered loop.
|
staticinherited |
Determines whether the given component represents one of the standard triangulations understood by Regina.
The list of recognised triangulations is expected to grow between releases.
If the standard triangulation returned has boundary triangles then the given component must have the same corresponding boundary triangles, i.e., the component cannot have any further identifications of these boundary triangles with each other.
Note that the triangulation-based routine recognise(const Triangulation<3>&) may recognise more triangulations than this routine, since passing an entire triangulation allows access to more information.
component | the triangulation component under examination. |
null
otherwise.
|
static |
Determines if the given triangulation component is a layered loop.
This function returns by (smart) pointer for consistency with StandardTriangulation::recognise(), which makes use of the polymorphic nature of the StandardTriangulation class hierarchy.
comp | the triangulation component to examine. |
null
if the given component is not a layered loop.
|
staticinherited |
Determines whether the given triangulation represents one of the standard triangulations understood by Regina.
The list of recognised triangulations is expected to grow between releases.
If the standard triangulation returned has boundary triangles then the given triangulation must have the same corresponding boundary triangles, i.e., the triangulation cannot have any further identifications of these boundary triangles with each other.
This routine may recognise more triangulations than the component-based recognise(Component<3>*), since passing an entire triangulation allows access to more information.
tri | the triangulation under examination. |
null
otherwise.
|
inherited |
Returns a short text representation of this object.
This text should be human-readable, should use plain ASCII characters where possible, and should not contain any newlines.
Within these limits, this short text ouptut should be as information-rich as possible, since in most cases this forms the basis for the Python __str__()
and __repr__()
functions.
__str__()
will use precisely this function, and for most classes the Python __repr__()
function will incorporate this into its output.
|
inlinenoexcept |
Swaps the contents of this and the given structure.
other | the structure whose contents should be swapped with this. |
|
inherited |
Returns the name of this specific triangulation in TeX format.
No leading or trailing dollar signs will be included.
|
inherited |
Returns a short text representation of this object using unicode characters.
Like str(), this text should be human-readable, should not contain any newlines, and (within these constraints) should be as information-rich as is reasonable.
Unlike str(), this function may use unicode characters to make the output more pleasant to read. The string that is returned will be encoded in UTF-8.
|
inlineoverridevirtual |
Writes the name of this triangulation as a human-readable string to the given output stream.
out | the output stream to which to write. |
Implements regina::StandardTriangulation.
|
inlineoverridevirtual |
Writes the name of this triangulation in TeX format to the given output stream.
No leading or trailing dollar signs will be included.
out | the output stream to which to write. |
Implements regina::StandardTriangulation.
|
inlineoverridevirtual |
Writes a detailed text representation of this object to the given output stream.
This may be reimplemented by subclasses, but the parent StandardTriangulation class offers a reasonable default implementation based on writeTextShort().
out | the output stream to which to write. |
Reimplemented from regina::StandardTriangulation.
|
inlinevirtualinherited |
Writes a short text representation of this object to the given output stream.
This may be reimplemented by subclasses, but the parent StandardTriangulation class offers a reasonable default implementation based on writeName().
out | the output stream to which to write. |
Reimplemented in regina::LayeredChain, regina::LayeredSolidTorus, regina::SnappedBall, regina::SpiralSolidTorus, and regina::TriSolidTorus.