Ring-size census of a polyhedral cage: size -> number of faces. More...
#include <cage.hpp>
Public Types | |
| enum class | Kind { Kind::Census , Kind::HexC , Kind::DoubleDiaC } |
Public Member Functions | |
| std::string | str () const |
| int | faceCount () const |
| int | maxRingSize () const |
| bool | containsSize (int size) const |
| bool | operator== (const Signature &other) const |
| bool | operator!= (const Signature &other) const |
Static Public Member Functions | |
| static Signature | parse (std::string_view spec) |
Public Attributes | |
| std::map< int, int > | counts |
| Kind | kind = Kind::Census |
Ring-size census of a polyhedral cage: size -> number of faces.
Parse a comma list (4:6,6:8) or a named table entry (sodalite, alpha, 512, 51262, 51264, 51268, sh, sH, hc, ddc). Counts of a repeated size add. Every size and count must be positive. The names hc and ddc keep the TUM ice finders (five hexagons and seven hexagons); a raw list 4:6,6:2 is the hexagonal prism.