---

PartitionGenerator Class Reference

Class to compute the possible partitions of a collection of 'collectionSize' elements. More...

#include <CommonTools/Statistics/interface/PartitionGenerator.h>

List of all members.

Public Types
typedef std::vector< int >	Partition
Public Member Functions
std::vector< Partition >	partitions (int collectionSize, int minCollectionSize=1) const
	Return partitions in a row.
std::vector< std::vector < Partition > >	sortedPartitions (int collectionSize, int minCollectionSize=1) const
	Return partitions ordered according to the number of subcollections they have.
Classes
class	LessCollections
	a private class just defining the () operator More...

---

Detailed Description

Class to compute the possible partitions of a collection of 'collectionSize' elements.

A Partition is a list of subcollection sizes that add up to 'collectionSize', ordered in decreasing order of subcollection size. No subcollection size is less than 'minCollectionSize'.

Definition at line 13 of file PartitionGenerator.h.

---

Member Typedef Documentation

typedef std::vector<int> PartitionGenerator::Partition

Definition at line 17 of file PartitionGenerator.h.

---

Member Function Documentation

vector< PartitionGenerator::Partition > PartitionGenerator::partitions	(	int	collectionSize,
		int	minCollectionSize = 1
	)			const

Return partitions in a row.

Definition at line 8 of file PartitionGenerator.cc.

References edmNew::copy(), first, and edm::second().

Referenced by CombinationGenerator< T >::combinations(), and sortedPartitions().

      {

  vector<Partition> partitions;

  // at the very least, we have a single bag of size 'collectionSize'
  partitions.push_back( Partition(1, collectionSize) );

  int first = collectionSize - minCollectionSize, second = minCollectionSize;
  while( first >= second ) {
    // try to further divide the first
    vector<Partition> subPartitions = this->partitions(first, second);
    vector<Partition>::iterator isub;
    for( isub = subPartitions.begin(); isub != subPartitions.end(); isub++ ) {
      const Partition& sub = *isub;
      // reject subPartitions of first with a last element smaller than second
      if( sub.back() < second ) continue;
      Partition partition( sub.size()+1 );
      copy( sub.begin(), sub.end(), partition.begin() );
      partition[ partition.size()-1 ] = second;
      partitions.push_back( partition );
    }
    first--; second++;
  }

  return partitions;
}

vector< vector< PartitionGenerator::Partition > > PartitionGenerator::sortedPartitions	(	int	collectionSize,
		int	minCollectionSize = 1
	)			const

Return partitions ordered according to the number of subcollections they have.

'sortedPartitions[N]' = list of partitions with N subcollections.

Definition at line 38 of file PartitionGenerator.cc.

References i, partitions(), and python::multivaluedict::sort().

Referenced by CombinationGenerator< T >::combinations().

                                                                  {

  vector<Partition> partitions 
    = this->partitions(collectionSize, minCollectionSize);
  sort (partitions.begin(), partitions.end(), LessCollections());
  
  vector< vector<Partition> > sortedPartitions;
  sortedPartitions.resize(partitions.rbegin()->size());

  for (vector<Partition>::const_iterator i = partitions.begin();
       i != partitions.end(); i++) {
    sortedPartitions[(*i).size() - 1].push_back(*i);
  }

  return sortedPartitions;
}

---

The documentation for this class was generated from the following files:

• CommonTools/Statistics/interface/PartitionGenerator.h
• CommonTools/Statistics/src/PartitionGenerator.cc

---