Cat::DecomposableClass – the category of decomposable combinatorial classes
Cat::DecomposableClass represents the category of decomposable combinatorial classes.
Categories
Details:
A Cat::DecomposableClass is a graded combinatorial class which is decomposable; that is it can be defined using a recursive specification (or grammar) that can be fed to combinat::decomposableObjects.
The purpose of this category is mostly technical: it makes it easy for a decomposable combinatorial class to use the machinery of combinat::decomposableObjects, without having to inherit from this domain. Indeed, such a class may typically want to inherit from another domain to specify the data structure of its elements.
Entries
|
"specification" |
Must contain the specification to be fed to combinat::decomposableObjects. |
|
"decomposableClassOptions" |
List of options to be fed to combinat::decomposableObjects. Set by default to the empty list. |
Method count is inherited from Cat::CombinatorialClass.
Method generator is inherited from Cat::CombinatorialClass.
Method list is inherited from Cat::CombinatorialClass.
Method unrank is inherited from Cat::CombinatorialClass.
Method random is inherited from Cat::CombinatorialClass.
fromGrammar – raw object
Cat::DecomposableClass::fromGrammar(raw object x)
Constructs an element of this combinatorial class from its raw representation given by the recursive specification.
This is set by default to id, assuming that the specification readily describes the objects of this class, without further transformation required. This often can be achieved using the Alias feature of combinat::decomposableObjects.
Changes in MuPAD 3.1
New Function.