GiNaC 1.8.9
|
Generate all bounded combinatorial partitions of an integer n with exactly m parts (not including zero parts) in non-decreasing order. More...
#include <utils.h>
Public Member Functions | |
partition_generator (unsigned n_, unsigned m_) | |
const std::vector< unsigned > & | get () const |
bool | next () |
Private Attributes | |
std::vector< unsigned > | partition |
bool | current_updated |
Additional Inherited Members | |
![]() | |
basic_partition_generator (unsigned n_, unsigned m_) | |
![]() | |
mpartition2 | mpgen |
Generate all bounded combinatorial partitions of an integer n with exactly m parts (not including zero parts) in non-decreasing order.
|
inline |
Definition at line 371 of file utils.h.
References GiNaC::basic_partition_generator::basic_partition_generator(), current_updated, and partition.
|
inline |
Definition at line 375 of file utils.h.
References current_updated, GiNaC::basic_partition_generator::mpgen, and partition.
|
inline |
Definition at line 385 of file utils.h.
References current_updated, and GiNaC::basic_partition_generator::mpgen.
|
mutableprivate |
Definition at line 368 of file utils.h.
Referenced by get(), and partition_generator().
|
mutableprivate |
Definition at line 369 of file utils.h.
Referenced by get(), next(), and partition_generator().