Namespace List

Here is a list of all namespaces with brief descriptions:

[detail level 123]

▼Nmackey	Everything in this library is under this namespace
▼Ninternal	Namespace for internal use withing the library
CIDGeneratorCompute	Computes homology and identification data
CGreenCompute	Computes the product of generators in a Green functor
CChainsLevelGen	Computes the homology at given level, the generators and their restrictions
CProductGen	Computes the product of generators at the bottom level
CMasseyCompute	Computes Massey products and their indeterminacy
NSFINAE	Contains typedefs used to detect types and existence of methods
CTensor	Tensor product of chain complexes and more
CArrow	A differential with domain and range
CChains	A chain complex
CJunction	Consisting of an entering and an exiting differential
CChangeBasis	Change of basis matrices needed for the equivariant tensor product
CAMT	Performs algebraic Morse theory reduction
CEquivariantAMT	Performs algebraic Morse theory reduction preserving equivariance
CZ_mod	The class of Z/N coefficients where N is prime
CFactorization	Factorizes generators into the given basic irreducibles and sources
CMultConnectivity	Finds the connectivity of the multiplication graph
▼CMultGraph	The Multiplication Graph created from the Multiplication Table
CProduct_Element_Irreducible	Stores the product of an element and a basic irreducible
CMultIdentify	Provides extra identification methods using triple box products
CMultTableData	The data of the multiplication table
CMultTable	Forms the multiplication table
▼CNeighborhood	The adjecency list of a node in a graph
Cconst_iterator	Constant iterator traversing edges with fixed start
CGraph	A directed graph
CShortestPaths	The shortest paths from a collection of sources to all points in a graph
Cbicolored_edge_with_id	An edge with two possible colors and a numerical id
CMinLength	ShortestPaths policy that minimizes the length of each path
CMinColorsLength	Dijkstra policy that minimizes the color alterations and length
CC2Power	Template for groups \(C_{2^n}\)
CC2Power< N, _rank, _diff >	Groups \(C_{2^n}\) given rank and differential types
CC2Power< N, coeff >	Groups \(C_{2^n}\) given coefficient type
CC_4	Quick and easy implementation of group \(C_4\)
CAbelianGroup	A finitely generated abelian group
CHomology	The Homology of a Junction
CSmithNormalForm	The Smith Normal Form and its coefficient matrices
CAdditiveStructure	The additive structure of the RO(G) homology of a point
CIDGenerators	Two levels of a Mackey functor, used for identification
CLevels	Storage of various levels of Junction/Chains
CMackeyFunctor	A Mackey Functor
CGreen	The result of multiplying generators in a Green functor
CMassey	Stores Massey products and their indeterminacy
CBC4S2	The space \(B_{C_4}\Sigma_2\) up to given dimension
▼CSpace	An equivariant space with an equivariant cellular decomposition
Ccell_coefficient_pair	A pair of a cell and a coefficient
Cequivariant_index	The equivariant index of a cell
Cnonequivariant_index	The nonequivariant index of a cell
▼CInterpolatingVectorGenerator	Generates all vectors interpolating between given min and max vectors
Cconst_iterator	Constant iterator through generated vectors
CHash	General template class for hashing vectors
CHash<>	Hashes vectors with collisions
CHash< T >	Perfect hashes vectors between 0 and given max
CHash< T, T >	Perfect hashes vectors between given min and max
CIteratorNNZ	Iterator over nonzero entries of Eigen matrices
CFactoryGenerator	Prototype for coroutine-like iterators that generate elements such as combinations
▼CPermutationGenerator	Generates all permutations on a number of letters
CConstIterator	Constant iterator that is used in a ranged for loop to generate the permutations
▼CCombinationGenerator	Generates all combinations on a number of letters making a number of choices
CConstIterator	Constant iterator that is used in a ranged for loop to generate the combinations