MINT2
AllPossibleSij.h
Go to the documentation of this file.
1 #ifndef ALLPOSSIBLESIJ_HH
2 #define ALLPOSSIBLESIJ_HH
3 // author: Jonas Rademacker (Jonas.Rademacker@bristol.ac.uk)
4 // status: Mon 9 Feb 2009 19:17:59 GMT
5 
6 #include <vector>
7 #include <map>
8 #include <string>
9 #include <iostream>
10 
11 //#include "Mint/Utils.h"
12 
13 
14 typedef std::map<std::string, std::vector<int> > namedVMap;
15 
16 class AllPossibleSij : public namedVMap{
17 
18  bool nextLevel(namedVMap& nextMap);
19  int _nd;
20  public:
21  AllPossibleSij(int nDaughters)
22  : _nd(nDaughters)
23  {
24  std::vector<int> dummy;
25  namedVMap mapA;
26  while(nextLevel(mapA)){
27  this->insert(mapA.begin(), mapA.end());
28  }
29  }
30  void print(std::ostream& os = std::cout) const;
31 };
32 
33 #endif
34 //
void print(std::ostream &os=std::cout) const
bool nextLevel(namedVMap &nextMap)
std::map< std::string, std::vector< int > > namedVMap
AllPossibleSij(int nDaughters)