GiNaC 1.8.7

Generate all bounded combinatorial partitions of an integer n with exactly m parts (not including zero parts) in nondecreasing 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  
Protected Member Functions inherited from GiNaC::basic_partition_generator  
basic_partition_generator (unsigned n_, unsigned m_)  
Protected Attributes inherited from GiNaC::basic_partition_generator  
mpartition2  mpgen 
Generate all bounded combinatorial partitions of an integer n with exactly m parts (not including zero parts) in nondecreasing order.

inline 

inline 
Definition at line 375 of file utils.h.
References current_updated, GiNaC::basic_partition_generator::mpartition2::m, GiNaC::basic_partition_generator::mpgen, partition, and GiNaC::basic_partition_generator::mpartition2::x.

inline 
Definition at line 385 of file utils.h.
References current_updated, GiNaC::basic_partition_generator::mpgen, and GiNaC::basic_partition_generator::mpartition2::next_partition().

mutableprivate 

mutableprivate 