JCombinatorics.cc File Reference

Example program to test combinatorics of pairs of indices (class JTOOLS::JCombinatorics). More...

#include <string>
#include <iostream>
#include <iomanip>
#include "JTools/JCombinatorics.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

Functions
int	main (int argc, char **argv)

Detailed Description

Example program to test combinatorics of pairs of indices (class JTOOLS::JCombinatorics).

Author

mdejong

Definition in file JCombinatorics.cc.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 15 of file JCombinatorics.cc.

{
  using namespace std;
 
  int     numberOfElements;
  int     debug;
 
  try { 
 
    JParser<> zap("Example program to test combinatorics of pairs of indices.");
    
    zap['n'] = make_field(numberOfElements);
    zap['d'] = make_field(debug)           = 1;
 
    zap(argc, argv);
  }
  catch(const exception &error) {
    FATAL(error.what() << endl);
  }
 
 
  using namespace JPP;
 
  if (numberOfElements <= 0) {
    FATAL("Number of elements " << numberOfElements << " <= 0" << endl);
  }
 
 
  JCombinatorics combinatorics(numberOfElements);
 
  int n = 0;
 
  for (int i = 0; i != (int) combinatorics.getNumberOfPairs(); ++i) {
 
    const JCombinatorics::pair_type pair = combinatorics.getPair(i);
 
    STATUS("pair[" << setw(4) << i << "] => (" << setw(3) << pair.first << "," << setw(3) << pair.second << ")" << endl);
 
    if (i != combinatorics.getIndex(pair.first, pair.second)) {
 
      ++n;
 
      ERROR(endl                   << ' ' << 
            setw(3) << pair.first  << ' ' <<
            setw(3) << pair.second << ' ' <<
            setw(4) << combinatorics.getIndex(pair.first, pair.second) << endl);
    }
  }
  DEBUG(endl); 
 
  NOTICE("Number of elements " << setw(8) << right << numberOfElements                 << endl);
  NOTICE("Number of pairs    " << setw(8) << right << combinatorics.getNumberOfPairs() << endl);
  NOTICE("Number of errors   " << setw(8) << right << n                                << endl);
 
  ASSERT(n == 0);
}