Regina 7.0 Calculation Engine
regina::TreeEnumeration< LPConstraint, BanConstraint, IntType > Member List

This is the complete list of members for regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >, including all inherited members.

ban_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
buildStructure() constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >
buildSurface() constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >
detail() constregina::Output< T, false >
dumpTypes(std::ostream &out) constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >inline
enc_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
feasibleBranches(int quadType)regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
level_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
lp_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
lpSlot_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
next(ProgressTracker *tracker=nullptr)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >
nextSlot_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
nextUnmarkedTriangleType(int startFrom)regina::TreeTraversal< LPConstraintNone, BanNone, Integer >inlineprotected
nTableaux_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
nTets_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
nTypes_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
nVisited_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
octLevel_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
operator=(const TreeEnumeration &)=delete (defined in regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >
origTableaux_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
percent() constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
run(Action &&action, Args &&... args)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >inline
setNext(int nextType)regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
solutions() constregina::TreeEnumeration< LPConstraint, BanConstraint, IntType >inline
str() constregina::Output< T, false >
supported(NormalEncoding enc)regina::TreeTraversal< LPConstraintNone, BanNone, Integer >inlinestatic
tmpLP_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
TreeEnumeration(const Triangulation< 3 > &tri, NormalEncoding enc)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >inline
TreeEnumeration(const TreeEnumeration &)=delete (defined in regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >
TreeTraversal(const Triangulation< 3 > &tri, NormalEncoding enc, int branchesPerQuad, int branchesPerTri, bool enumeration)regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
type_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
typeOrder_regina::TreeTraversal< LPConstraintNone, BanNone, Integer >protected
typeString() constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >inline
utf8() constregina::Output< T, false >
visited() constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >inline
writeSurface(const TreeEnumeration &tree)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >inlinestatic
writeTextLong(std::ostream &out) constregina::ShortOutput< T, supportsUtf8 >inline
writeTextShort(std::ostream &out) constregina::TreeTraversal< LPConstraintNone, BanNone, Integer >
writeTypes(const TreeEnumeration &tree)regina::TreeEnumeration< LPConstraint, BanConstraint, IntType >inlinestatic
~TreeTraversal()regina::TreeTraversal< LPConstraintNone, BanNone, Integer >

Copyright © 1999-2021, 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).