GiNaC 1.8.7
|
Base class for generating all bounded combinatorial partitions of an integer n with exactly m parts in non-decreasing order. More...
#include <utils.h>
Classes | |
struct | mpartition2 |
Protected Member Functions | |
basic_partition_generator (unsigned n_, unsigned m_) | |
Protected Attributes | |
mpartition2 | mpgen |
Base class for generating all bounded combinatorial partitions of an integer n with exactly m parts in non-decreasing order.
|
inlineprotected |
|
protected |
Definition at line 318 of file utils.h.
Referenced by GiNaC::partition_with_zero_parts_generator::get(), GiNaC::partition_generator::get(), GiNaC::partition_with_zero_parts_generator::next(), and GiNaC::partition_generator::next().