Sandbox Class Reference

#include <Sandbox.h>

Inheritance diagram for Sandbox:

Collaboration diagram for Sandbox:

Public Member Functions
	Sandbox (ThreadManager *MTHREAD_h)
	Sandbox ()
	~Sandbox ()
template<class T >
T	getSetting (string name_h, int type)
template<class T >
vector< T >	getVectorSetting (string name_h, int type)
template<class T >
T	test2 (const std::string &s)
void	printAString (string what)
vector< TestStructure * >	getTestStructure ()
void	testThreads ()
void	basicTest ()
	Simple tests that doesn't require anything else (are encapsulated) and so they can be run at the beginning of the program. Normally empty. More...
void	fullTest ()
	Tests that require a full sandbox object including MTHREAD. Normally empty. More...
void	testIpopt ()
int	testAdolc ()
void	testPartMatching ()
	How to partial matching the key of a map. More...
void	testPartMatching2 ()
	How to partial matching the key of a map. More...
Public Member Functions inherited from BaseClass
	BaseClass ()
	~BaseClass ()
void	msgOut (const int &msgCode_h, const string &msg_h, const bool &refreshGUI_h=true) const
	Overloaded function to print the output log. More...
void	msgOut (const int &msgCode_h, const int &msg_h, const bool &refreshGUI_h=true) const
	Overloaded function to print the output log. More...
void	msgOut (const int &msgCode_h, const double &msg_h, const bool &refreshGUI_h=true) const
	Overloaded function to print the output log. More...
int	s2i (const string &string_h) const
	string to integer conversion More...
double	s2d (const string &string_h) const
	string to double conversion More...
double	s2d (const string &string_h, const bool &replaceComma) const
	string to double conversion More...
bool	s2b (const string &string_h) const
	string to bool conversion More...
string	i2s (const int &int_h) const
	integer to string conversion More...
string	d2s (const double &double_h) const
	double to string conversion More...
string	b2s (const bool &bool_h) const
	bool to string conversion More...
vector< int >	s2i (const vector< string > &string_h) const
	string to integer conversion (vector) More...
vector< double >	s2d (const vector< string > &string_h, const bool &replaceComma=false) const
	string to double conversion (vector) More...
vector< bool >	s2b (const vector< string > &string_h) const
	string to bool conversion (vector) More...
vector< string >	i2s (const vector< int > &int_h) const
	integer to string conversion (vector) More...
vector< string >	d2s (const vector< double > &double_h) const
	double to string conversion (vector) More...
vector< string >	b2s (const vector< bool > &bool_h) const
	bool to string conversion (vector) More...
int	getType (const string &type_h) const
	Return a type according to enum TYPE_* from a string (eg: "string" -> TYPE_STRING (2)) More...
void	refreshGUI () const
	Ping to periodically return the control to the GUI. More...
template<typename T >
string	toString (const T &x) const
template<typename T >
T	stringTo (const std::string &s) const
int	vSum (const vector< int > &vector_h) const
double	vSum (const vector< double > &vector_h) const
int	vSum (const vector< vector< int > > &vector_h) const
double	vSum (const vector< vector< double > > &vector_h) const
void	tokenize (const string &str, vector< string > &tokens, const string &delimiter=" ") const
	Tokenize a string using a delimiter (default is space) More...
void	untokenize (string &str, vector< string > &tokens, const string &delimiter=" ") const
template<typename K , typename V >
V	findMap (const map< K, V > &mymap, const K &key, const int &error_level=MSG_CRITICAL_ERROR, const V &notFoundValue=numeric_limits< V >::min()) const
	Lookup a map for a value. Return the value starting from the key. More...
template<typename K , typename V >
void	changeMapValue (map< K, V > &mymap, const K &key, const V &value, const int &error_level=MSG_CRITICAL_ERROR)
	Change the value stored in a map given the key and the new value. More...
template<typename K , typename V >
void	incrMapValue (map< K, V > &mymap, const K &key, const V &value, const int &error_level=MSG_CRITICAL_ERROR)
	Increments a value stored in a map of the specified value, given the key. More...
template<typename K , typename V >
void	incrOrAddMapValue (map< K, V > &mymap, const K &key, const V &value)
	Increments a value stored in a map of the specified value, given the key. More...
template<typename K , typename V >
void	resetMapValues (map< K, V > &mymap, const V &value)
	Reset all values stored in a map to the specified one. More...
template<typename K , typename V >
map< K, V >	vectorToMap (const vector< K > &keys, const V &value=0.0)
	Returns a map built using the given vector and the given (scalar) value as keys/values pairs. More...
template<typename T >
vector< T >	positionsToContent (const vector< T > &vector_h, const vector< int > &positions)
	Return a vector of content from a vector and a vector of positions (int) More...
template<typename V >
void	debugMap (const map< iisskey, V > &mymap)
	Debug a map. More...
template<typename K , typename V >
void	debugMap (const map< K, V > &mymap, const K &key)
template<typename K >
int	getMaxPos (const vector< K > &v)
	Returns the position of the maximum element in the vector (the last one in case of multiple equivalent maxima) More...
template<typename K >
int	getMinPos (const vector< K > &v)
	Returns the position of the minimum element in the vector (the first one in case of multiple equivalent minima) More...
template<typename K >
K	getMax (const vector< K > &v)
	Returns the value of the maximum element in the vector (the last one in case of multiple equivalent maxima) More...
template<typename K >
K	getMin (const vector< K > &v)
	Returns the value of the minimum element in the vector (the first one in case of multiple equivalent minima) More...
template<typename K >
double	getAvg (const vector< K > &v)
	Returns the average of the elements in the vector. More...
template<typename K >
double	getSd (const vector< K > &v, bool sample=true)
template<typename K >
int	getPos (const K &element, const vector< K > &v, const int &msgCode_h=MSG_CRITICAL_ERROR)
template<typename K >
bool	inVector (const K &element, const vector< K > &v)
double	normSample (const double &avg, const double &stdev, const double &minval=NULL, const double &maxval=NULL) const
	Sample from a normal distribution with bounds. Slower (double time, but still you see the diff only after milion of loops). More...
template<typename K >
K	normSample (normal_distribution< K > &d, std::mt19937 &gen, const K &minval=NULL, const K &maxval=NULL) const
	Sample from a normal distribution with bounds. Faster (half time) as the normal_distribution is made only once. More...
template<typename T >
std::string	toString (const T &x) const

Private Member Functions
void	testSearchMap (const map< string, string > &map, const string &search_for)
void	testSearchMap2 (const map< string, string > &map_h, const string &search_for)

Private Attributes
vector< TestStructure >	testVector

Additional Inherited Members
Protected Attributes inherited from BaseClass
ThreadManager *	MTHREAD
	Pointer to the Thread manager. More...

Detailed Description

Definition at line 40 of file Sandbox.h.

Constructor & Destructor Documentation

Sandbox

(

ThreadManager *

MTHREAD_h

)

Definition at line 81 of file Sandbox.cpp.

                                        {
  MTHREAD=MTHREAD_h;
}

Sandbox

(

)

Definition at line 85 of file Sandbox.cpp.

                {

}

~Sandbox

(

)

Definition at line 90 of file Sandbox.cpp.

                 {

}

Member Function Documentation

void basicTest

(

)

Simple tests that doesn't require anything else (are encapsulated) and so they can be run at the beginning of the program. Normally empty.

Definition at line 132 of file Sandbox.cpp.

Referenced by main(), and printAString().

                  {

    /*
    // Checking integer division

    int a = 19;
    int b = 5;
    int c = a/b;
    int d = a%b;
    cout << a << " - " << b << " - "  << c  << " - " << d << endl;
    exit(0);
    */

   /*
    // Testing initializating a matrix with fixed values in C++11
    //vector< vector<double> > deltaAreas(fTypes.size()+1, vector<double>(fTypes.size()+1,5));
    vector< vector<double> > deltaAreas(3, vector<double>(5,4));
    for (uint i=0;i<3;i++){
       for (uint j=0;j<5;j++){
         cout << deltaAreas.at(i).at(j) << "\t";
       }
       cout << endl;
    }
    exit(1);
    */

   /*
    // Testing map of generic vector of strings
    //map<vector<string>,double>  testMap;
    map<tr1::array<string, 3>,double> testMap;

    //vector<string> k1 = {"aa","aa","aa"};
    tr1::array<string, 3> k1 = {"aa","aa","aa"};
    double v1 = 1;
    double v1b = 3;
    //vector<string> k2 = {"aa","bb","aa"};
    tr1::array<string, 3> k2 = {"aa","bb","aa"};
    double v2 = 2;
    incrOrAddMapValue(testMap, k1, v1);
    incrOrAddMapValue(testMap, k2, v2);
    incrOrAddMapValue(testMap, k1, v1b);
    double debug = findMap(testMap, k1);
    cout << debug << endl;
    double debug2 = findMap(testMap, k2);
    cout << debug2 << endl;
    exit(1);
   */


    /*
    // Testing debugging a map
    iisskey k1(2007,11021,"broadL_HighF","15");
    iisskey k2(2007,11021,"broadL_HighF","30");
    iisskey k3(2007,11021,"con_HighF","15");
    iisskey k4(2007,11022,"broadL_HighF","15");
    iisskey k5(2008,11021,"broadL_HighF","15");

    // Testing the new changeMapValue(), incrMapValue(), resetMapValues(), incrOrAddMapValue(map, key, value) and vectorToMap() funcions
    map<iisskey,double> testMap;
    pair<iisskey,double> pair1(k1,1.1);
    pair<iisskey,double> pair2(k2,1.2);
    pair<iisskey,double> pair3(k3,1.3);
    pair<iisskey,double> pair4(k4,1.4);
    pair<iisskey,double> pair5(k5,1.5);
    testMap.insert(pair1);
    testMap.insert(pair2);
    testMap.insert(pair3);
    testMap.insert(pair4);
    testMap.insert(pair5);
    debugMap(testMap,iisskey(NULL,NULL,"",""));
    debugMap(testMap,iisskey(2007,NULL,"con_HighF",""));
    exit(0);
    */




  /*
  // Testing standard deviation algorithm, as from http://stackoverflow.com/questions/7616511/calculate-mean-and-standard-deviation-from-a-vector-of-samples-in-c-using-boos
  vector<double> v;
  v.push_back(3.0);
  v.push_back(2.0);
  v.push_back(5.0);
  v.push_back(4.0);
  double sum = std::accumulate(std::begin(v), std::end(v), 0.0);
  double m =  sum / v.size();
  double accum = 0.0;
  std::for_each (std::begin(v), std::end(v), [&](const double d) {
      accum += (d - m) * (d - m);
  });
  double stdev = sqrt(accum / (v.size()-1));
  cout << stdev << endl;
  double sd2 = getSd(v);
  double sd3 = getSd(v,false);
  cout << sd2 << endl;
  cout << sd3 << endl;
  exit(0);
  */

  /*
  // Testing tokenize, untokenize functions
  vector<string> istrings;
  istrings.push_back("Questo");
  istrings.push_back("cielo");
  istrings.push_back("è");
  istrings.push_back("sempre");
  istrings.push_back("più");
  istrings.push_back("blu.");
  string delimiter = " . ";

  string fullstring="";
  vector<string> ostrings;
  untokenize(fullstring, istrings, delimiter);
  cout << fullstring << endl;

  fullstring += delimiter;
  cout << fullstring << endl;

  tokenize(fullstring, ostrings, delimiter);
  for (uint i=0;i<ostrings.size();i++){
    cout << ostrings[i] << endl;
  }
  exit(0);
  */


  /*
  // Testing FlopC++
  // For a single file compile as:
  // -- two passages:
  // g++ -O3 -I /usr/include/coin -DFLOPCPP_BUILD `PKG_CONFIG_PATH=/usr/lib64/pkgconfig:/usr/lib/pkgconfig:/usr/share/pkgconfig: pkg-config --libs flopcpp osi-cbc osi-clp` transport.cpp -c -o  transport.o
  // g++ -o transport2 transport.o -Wl,-rpath,'$ORIGIN' -L . -DFLOPCPP_BUILD `PKG_CONFIG_PATH=/usr/lib64/pkgconfig:/usr/lib/pkgconfig:/usr/share/pkgconfig: pkg-config --libs flopcpp osi-cbc osi-clp`
  // -- single passage:
  // g++ -O3 -I /usr/include/coin transport.cpp -DFLOPCPP_BUILD `PKG_CONFIG_PATH=/usr/lib64/pkgconfig:/usr/lib/pkgconfig:/usr/share/pkgconfig: pkg-config --libs flopcpp osi-cbc osi-clp`  -o  transport3

  MP_model::getDefaultModel().setSolver(new OsiClpSolverInterface);
  //MP_model::getDefaultModel().setSolver(new OsiCbcSolverInterface);
  enum  {seattle, sandiego, numS};
  enum  {newyork, chicago, topeka,numD};

  MP_set S(numS);          // Sources
  MP_set D(numD);          // Destinations
  MP_subset<2> Link(S,D);  // Transportation links (sparse subset of S*D)

  Link.insert(seattle,newyork);
  Link.insert(seattle,chicago);
  Link.insert(sandiego,chicago);
  Link.insert(sandiego,topeka);

  MP_data SUPPLY(S);
  MP_data DEMAND(D);

  SUPPLY(seattle)=350;  SUPPLY(sandiego)=600;
  DEMAND(newyork)=325;  DEMAND(chicago)=300;  DEMAND(topeka)=275;

  MP_data COST(Link);

  COST(Link(seattle,newyork)) = 2.5;
  COST(Link(seattle,chicago)) = 1.7;
  COST(Link(sandiego,chicago))= 1.8;
  COST(Link(sandiego,topeka)) = 1.4;

  COST(Link) = 90 * COST(Link) / 1000.0;

  MP_variable x(Link);
  x.display("...");

  MP_constraint supply(S);
  MP_constraint demand(D);

  supply.display("...");

  supply(S) =  sum( Link(S,D), x(Link) ) <= SUPPLY(S);
  demand(D) =  sum( Link(S,D), x(Link) ) >= DEMAND(D);

  cout<<"Here"<<endl;

  minimize( sum(Link, COST(Link)*x(Link)) );
  assert(MP_model::getDefaultModel()->getNumRows()==5);
  assert(MP_model::getDefaultModel()->getNumCols()==4);
  assert(MP_model::getDefaultModel()->getNumElements()==8);
  assert(MP_model::getDefaultModel()->getObjValue()>=156.14 && MP_model::getDefaultModel()->getObjValue()<=156.16);

  x.display("Optimal solution:");
  supply.display("Supply dual solution");
  cout<<"Test transport passed."<<endl;
  */



  /*
  // Testing limits for 0
  double test = DBL_MIN;
  cout << test << endl;
  test = numeric_limits<double>::min();
  cout << test << endl;
  exit(0);
  */


  /*
  // Testing getMaxPos()
  vector<double> test {7,2,6,4,7,2,5,7,2};
  double maxpos   = getMaxPos(test);
  double maxvalue = getMax(test);
  double minpos   = getMinPos(test);
  double minvalue = getMin(test);
  //double maxpos = testB();
  cout << "maxpos: " << maxpos << endl;
  cout << "maxvalue: " << maxvalue << endl;
  cout << "minpos: " << minpos << endl;
  cout << "minvalue: " << minvalue << endl;
  exit(0);
  */


  /*
  //This was in ModelData::debug():
  // ********** START DEBUG CODE....... ************
  double ddebuga=0; //20080209
  uint idebuga=0;
  double ddebugb=0; //20080209
  uint idebugb=0;
  double ddebugc=0; //20080209
  uint idebugc=0;
  double debugmin = 0;
  double debugmax = 1000;
  for (uint q=0;q<10000;q++){
    ddebuga += debugmin + ( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(debugmax-debugmin+1);
    ddebugb += debugmin + ( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(debugmax-debugmin+1);
    ddebugc += debugmin + ( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(debugmax-debugmin+1);
  }
  idebuga = ddebuga;
  idebugb = ddebugb;
  idebugc = ddebugc;
  cout << "idebuga: "<<idebuga<<endl;
  cout << "idebugb: "<<idebugb<<endl;
  cout << "idebugc: "<<idebugc<<endl;
  throw 2;
  // ******** .....END DEBUG CODE *******************
  */

    /*
    // Testing the new iskey class
    iskey op1(2100,"test");
    iskey op2(2100,"test");
    iskey op3(2101,"test");
    iskey op4(2101,"tgst");
    iskey op5(2101,"tb");
    iskey op6(2101,"testa");
    if(op1 == op2){
      cout << "op1 and op2 are equal" << endl;
    }
    if(op1 == op3){
      cout << "op1 and op3 are equal" << endl;
    }
    if(op6 > op3) cout << "test3 passed" << endl;
    if(op5 < op3) cout << "test4 passed" << endl;
    if(op6 >= op3) cout << "test5 passed" << endl;
    if(op6 != op3) cout << "test6 passed" << endl;
    if(op4 <= op3) cout << "test7 passed that it shoudn't" << endl;
    exit(0);
    */

    /*
    // Testing the new changeMapValue(), incrMapValue(), resetMapValues(), incrOrAddMapValue(map, key, value) and vectorToMap() funcions
    map<int,double> testMap;
    for (uint i=0;i<5;i++){
        pair<int,double> mypair(i,i*2.5);
        testMap.insert(mypair);
    }
    double result = findMap(testMap,3,MSG_NO_MSG);
    double result2 = findMap(testMap,1,MSG_ERROR);
    double result3 = findMap(testMap,7,MSG_DEBUG);
    cout << findMap(testMap,3,MSG_NO_MSG)<< endl;
    changeMapValue(testMap,3,200.0,MSG_ERROR);
    cout << findMap(testMap,3,MSG_NO_MSG)<< endl;
    incrMapValue(testMap,3,5.0,MSG_ERROR);
    cout << findMap(testMap,3,MSG_NO_MSG)<< endl;
    incrOrAddMapValue(testMap, 3, 200.0);
    cout << findMap(testMap,3,MSG_NO_MSG)<< endl;
    incrOrAddMapValue(testMap, 10, 100.0);
    cout << findMap(testMap,10,MSG_NO_MSG)<< endl;
    cout << "done" << endl;

    vector<string> mykeys;
    mykeys.push_back("andrea");
    mykeys.push_back("antonello");
    mykeys.push_back("paolo");
    map<string,double> mymap = vectorToMap(mykeys,15.0);
    string searchkey;
    searchkey = "andrea";
    cout << findMap(mymap,searchkey,MSG_DEBUG)<< endl;
    resetMapValues(mymap,32.0);
    cout << findMap(mymap,searchkey,MSG_DEBUG)<< endl;
    exit(0);
    */



    /*
    // -------------------------------------------------------------------
    // Sampling from uniform distribution with local random seed
    // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    //this code sample from a uniform distribution. In this case also the seed is reinitialisated, but it it valid only locally: the rest of the program run with the same seed

    std::random_device rd;
    std::mt19937 gen(rd());
    std::uniform_int_distribution<> dis(1, 6);

    for (int n=0; n<10; ++n)
        std::cout << dis(gen) << ' ';
    std::cout << '\n';
    exit(0);
   */



  /*
  // -------------------------------------------------------------------
  // Testing how to get all elements in a map by substrings
  // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
  map <string,double> values;
  pair <string,double> val1("AAAAAA",1);
  pair <string,double> val2("AAABBB",2);
  pair <string,double> val3("BBBAAA",3);
  pair <string,double> val4("BBBBBB",4);
  pair <string,double> val5("CCCAAA",5);
  pair <string,double> val6("C",6);
  pair <string,double> val7("BBB",7);

  values.insert(val1);
  values.insert(val2);
  values.insert(val3);
  values.insert(val4);
  values.insert(val5);
  values.insert(val6);
  values.insert(val7);

  cout << "Printing whole map" << endl;
  for (std::map<string,double>::iterator it=values.begin(); it!=values.end(); ++it)
      std::cout << it->first << " => " << it->second << '\n';

  string search_for = "BBB";

  cout << "Using lower bound " << endl;
  for (std::map<string,double>::iterator it=values.lower_bound(search_for); it!=values.end(); ++it)
      std::cout << it->first << " => " << it->second << '\n';
  cout << "Using upper bound " << endl;
  for (std::map<string,double>::iterator it=values.upper_bound(search_for); it!=values.end(); ++it)
      std::cout << it->first << " => " << it->second << '\n';

  cout << "Printing only substrings " << endl;
  for (std::map<string,double>::iterator it=values.lower_bound(search_for); it!=values.end(); ++it){
    string key = it->first;
    if (key.compare(0, search_for.size(), search_for) == 0){
      std::cout << it->first << " => " << it->second << '\n';
    }
  }


  exit(0);
  */

  /*
  // testing findMap
  map<int,double> testMap;
  for (uint i=0;i<5;i++){
    pair<int,double> mypair(i,i*2.5);
    testMap.insert(mypair);
  }
  double result = findMap(testMap,3,MSG_NO_MSG);
  double result2 = findMap(testMap,1,MSG_ERROR);
  double result3 = findMap(testMap,7,MSG_DEBUG);
  cout << "Done" << endl;
  map<int, vector <double> > testMap2;
  for (uint i=0;i<5;i++){
    vector <double> myvector;
    for(uint j=0;j<10;j++) {
      myvector.push_back(i*100+j);
    }
    pair<int,vector <double> > mypair2(i,myvector);
    testMap2.insert(mypair2);
  }
  vector <double> resultb = findMap(testMap2,3,MSG_NO_MSG);
  vector <double> resultb2 = findMap(testMap2,1,MSG_ERROR);
  vector <double> resultb3 = findMap(testMap2,7);
  cout << "Done2" << endl;
  exit(1);
  */



  /*
  // Testing vSum
  vector <int> ivector(5,5);
  vector <double> dvector(5,1.5);
  vector < vector <int> > ivector2;
  vector <vector <double > > dvector2;


  for(uint i=0;i<5;i++){
    ivector2.push_back(ivector);
    dvector2.push_back(dvector);
  }

  int iSum = vSum(ivector);
  int iSum2 = vSum(ivector2[2]);
  double dSum = vSum(dvector);
  double dSum2 = vSum(dvector2[1]);
  int iSum3 = vSum(ivector2);
  double dSum3 = vSum(dvector2);

  cout << "hi there" << endl;
  */

  /*
  // Testing Eigen
  using Eigen::MatrixXd;
  MatrixXd m(2,2);
  m(0,0) = 4;
  m(1,0) = 2.5;
  m(0,1) = -1;
  m(1,1) = m(1,0) + m(0,1);
  std::cout << m << std::endl;
  exit(0);
  */

  /*
  // Test on two different type of partial matching over map values
  testPartMatching2();
  testPartMatching();
  */

  /*
  // -------------------------------------------------------------------
  // Testing how to erase elements from a vector according to conditions
  // - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

  vector<string> myvector;
  myvector.push_back("a");
  myvector.push_back("b");
  myvector.push_back("c");
  myvector.push_back("d");
  myvector.push_back("e");

  for (uint i=0; i<myvector.size();i++){
    cout << "i:" << i << " myvector[i]: " << myvector[i] << endl;
    if(myvector[i]== "c" || myvector[i]=="d"){
      cout << " -- TBR: " << "i:" << i << " myvector[i]: " << myvector[i] << endl;
      myvector.erase (myvector.begin()+i);
      i--;
    }
  }

  cout << "Myvector now contains:" << endl;
  for (int i=0; i<myvector.size(); i++) {
    cout << "i: " << i << " myvector[i]: " << myvector[i] << endl;
  }
  exit (0);
  */


}

Here is the caller graph for this function:

void fullTest

(

)

Tests that require a full sandbox object including MTHREAD. Normally empty.

Definition at line 599 of file Sandbox.cpp.

Referenced by printAString(), and Init::setInitLevel1().

                 {

  /*
  // Testing adfditional Mortality..
  Pixel* px = MTHREAD->GIS->getPixel(8967);
  double myAddMortality =  px->getSTData("additionalMortality", "", 2013, "", 0.0);
  cout << "Additional mortality: " << myAddMortality <<endl;
  exit(0);
  */

    /*
    Pixel* px = MTHREAD->GIS->getPixel(8967);
    double myAddMortality;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2012, "50", 0.0);
    cout << "test 2012: " << myAddMortality <<endl;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2013, "50", 0.0);
    cout << "test 2013: " << myAddMortality <<endl;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2014, "50", 0.0);
    cout << "test 2014: " << myAddMortality <<endl;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2015, "50", 0.0);
    cout << "test 2015: " << myAddMortality <<endl;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2016, "50", 0.0);
    cout << "test 2016: " << myAddMortality <<endl;
    myAddMortality =  px->getSTData("test", "broadL_highF", 2017, "50", 0.0);
    cout << "test 2017: " << myAddMortality <<endl;
    exit(0);
   */

  /*
  // checking that the overriding works also for secondary dimension
  // yep, it works!! ;-)
  //ct  11003 beechRoundW 11001 69.71 100
  double ct_11003_11002_beech = MTHREAD->MD->getProdData("ct",11003,"beechRoundW",2013,"11002");
  double ct_11003_11001_beech = MTHREAD->MD->getProdData("ct",11003,"beechRoundW",2013,"11001");
  double ct_11003_11002_hardW = MTHREAD->MD->getProdData("ct",11003,"hardWRoundW",2013,"11002");
  double ct_11003_11001_hardW = MTHREAD->MD->getProdData("ct",11003,"hardWRoundW",2013,"11001");
  exit(1);
  */

  /*
  // getting x,y of the pixel with sawmill in the TIGA project
  Pixel* px = MTHREAD->GIS->getPixel(8967);
  int x = px->getX();
  int y = px->getY();
  cout << "(X,Y) of pixel 8967: " << x << "\t" << y << endl;
  px = MTHREAD->GIS->getPixel(0);
  x = px->getX();
  y = px->getY();
  cout << "(X,Y) of pixel 0: " << x << "\t" << y <<endl;
  exit(1);
  */

/*
  // Testing overriding of just a product/region if it works
  // Perfect.. the override works even just setting one specific ft/region value !! :-)
  double ad = MTHREAD->MD->getProdData("additionalDemand",11000,"fuelW",2014); // this should be 0.004
  double adt = MTHREAD->MD->getProdData("additionalDemand",11001,"fuelW",2014);
  double adr = MTHREAD->MD->getProdData("additionalDemand",11002,"fuelW",2014);
  double adp = MTHREAD->MD->getProdData("additionalDemand",11002,"hardWSawnW",2014);
  cout << "additional demand test:" << endl;
  cout << ad << "\t" << adt << "\t" << adr << "\t" << adp << endl;
  //exit(1);
  */

/*
  // Testing (again, for the TIGA project) the availalibily coefficient of Hetre
  Pixel* px = MTHREAD->GIS->getPixel(32,30);
  double ac =  px->getSTData("avalCoef","Fut_Hetre",2013);
  double act1 =  px->getSTData("avalCoef","Fut_Hetre",2010);
  double act2 =  px->getSTData("avalCoef","Fut_Hetre",2014);
  double act3 =  px->getSTData("avalCoef","Fut_Hetre",2020);
  double acft =  px->getSTData("avalCoef","Fut_Feu",2013);
  cout << "availability coefficient test:" << endl;
  cout << ac << "\t" << act1 << "\t" << act2 << "\t" << act3 << "\t" << acft << endl;
  exit(1);
  */

  /*
  // Testing picking up a national level variable defined only at national level. This may raise a segfault ?
  //double debug  = MTHREAD->MD->getProdData("carbonPrice",11000,"",2007);
  cout << debug << endl;
  exit(1);
  */

  /*
  // Testing getTableFromFile() function
  LLData debug = MTHREAD->MD->getTableFromFile("debug", "scenarios/debug.csv");
  exit(1);
  */


  /*
  // Testing regional overriding in the new getBaseData() function
  double mr11061 = MTHREAD->MD->getDoubleSetting("mr",DATA_NOW,11061);
  double mr11042 = MTHREAD->MD->getDoubleSetting("mr",DATA_NOW,11042);
  double mr      = MTHREAD->MD->getDoubleSetting("mr",DATA_NOW);
  // this should give critical error:
  double mr5     = MTHREAD->MD->getDoubleSetting("mr",DATA_NOW,5);
  exit(1);
  */

  /*
  // Testing the new getSTData() function
  cout << "Starting test" << endl;
  Pixel* px = MTHREAD->GIS->getPixel(32,30);
  cout << "got pixel" << endl;
  //double avalCoef = px->getMultiplier("avalCoefTest", "con_highF", 2007);
  double avalCoef =  px->getSTData("avalCoef","broadL_highF",2008);
  cout << avalCoef << endl;
  exit(1);
  */


  /*
  // Testing shareMortalityUsableTimber call for a specific forest type and at the opposite with a null forest type
  // to see if gfd() expands as expected

  double test1 = MTHREAD->MD->getForData("shareMortalityUsableTimber",11041,"","",2016);
  cout << "test1: " << test1 << endl;
  exit(1);
  */

  /*
  //testing supply_fromForestShare
  double test = MTHREAD->MD->getProdData("supply_fromForestShare",11042,"hardWRoundW",2006);
  cout << test << endl;
  exit(1);
  */

  /*
  // Testing getSiblings() ok
  ModelRegion* reg1 = MTHREAD->MD->getRegion(11042);
  vector <ModelRegion*> siblings = reg1->getSiblings();
  for(uint i=0;i<siblings.size();i++){
    cout << siblings[i]->getRegId() << endl;
  }
  exit(1);
  */

 /*
 // Testing if after not found gpd(.) or gfd(.) we always have a negative tempBool.. yes
 bool debug = true;
 MTHREAD->MD->setTempBool(true);
 double test1 = MTHREAD->MD->getForData("vol",11042,"broadL_highF","15");
 debug = MTHREAD->MD->getTempBool();
 double test2 = MTHREAD->MD->getForData("fgdfgdfhdfhdfhuk",11042,"broadL_highF","");
 debug = MTHREAD->MD->getTempBool();
 debug = true;
 exit(1);
 */

 /*
 // Testing if asking a value from freeDim when this is not efined what returns
 // no, if the freeDim is either null or 11000 I can't ask for e.g. 11042, I didn't developed expansion in the freeDim
  double debug =   MTHREAD->MD->getProdData("pol_ctSub",11042,"fuelW",DATA_NOW);
  cout << debug << endl;
  exit(1);
  */

 /*
  // Getting forest area by each forest type
  vector<int> regIds2 = MTHREAD->MD->getRegionIds(2);
  for(uint r=0;r<regIds2.size();r++){
    int rId = regIds2[r];
    ModelRegion* reg = MTHREAD->MD->getRegion(regIds2[r]);
    vector <string> fTypes= MTHREAD->MD->getForTypeIds();
    for(uint f=0;f<fTypes.size();f++){
      string ft = fTypes[f];
      forType* FT = MTHREAD->MD->getForType(ft);
      double totalArea = 0.0;
      vector <Pixel*> rpx = MTHREAD->GIS->getAllPlotsByRegion(regIds2[r]);
      for (uint p=0;p<rpx.size();p++){
        Pixel* px = rpx[p];
        totalArea +=  px->getDoubleValue (FT->forLayer, true);
      }
      cout << rId << "\t" << ft << "\t" << totalArea << endl;
    }
  }
  exit(1);
 */

  /*
  // Testing the new getForTypeParents()function
  vector<string>  parents = MTHREAD->MD->getForTypeParents();
  for(uint i=0;i<parents.size();i++){
    vector <string> childIds = MTHREAD->MD->getForTypeChilds(parents[i]);
    vector <int> childPos = MTHREAD->MD->getForTypeChilds_pos(parents[i]);
    double debug = 0.0;
  }
  */

  /*
  // Testing the reg->getArea() functions
  // Actually this need to be run further later, as pixels doesn't yet have area information
  vector <string> dClasses = MTHREAD->MD->getStringVectorSetting("dClasses");
  vector <string> fTypes= MTHREAD->MD->getForTypeIds();
  ModelRegion* REG = MTHREAD->MD->getRegion(11041);
  cout << "Total ft area: "<< REG->getArea()<< endl;

  for(uint j=0;j<fTypes.size();j++){
    cout << fTypes[j] << "\t" << REG->getArea(fTypes[j]) << "\t" << REG->getArea(j) << endl;
  }
  for(uint j=0;j<fTypes.size();j++){
    cout << fTypes[j] << "\t" << REG->getArea(fTypes[j]) << "\t";
    for(uint u=0;u<dClasses.size();u++){
      cout << REG->getArea(j,u) << " ";
    }
    cout << endl;
  }
  */

  /*
  // Testing getForData() function with no forest id specified
  double vartest= MTHREAD->MD->getForData("forestChangeAreaIncrementsRel",11061,"","",2009);
  cout << vartest << endl;
  exit(0);
  */


  /*
  // Testing the decay model  - ok, passed
  double initialValue = 100;
  double halfLife = 2;
  double years = 0;
  double remStock = MTHREAD->CBAL->getRemainingStock(initialValue, halfLife, years); ///< Apply a single exponential decay model to retrieve the remining stock given the initial stock, the half life and the time passed from stock formation.
  cout << "Remaining stock: " << remStock << endl;
  years = 1;
  remStock = MTHREAD->CBAL->getRemainingStock(initialValue, halfLife, years);
  cout << "Remaining stock: " << remStock << endl;
  years = 5;
  remStock = MTHREAD->CBAL->getRemainingStock(initialValue, halfLife, years);
  cout << "Remaining stock: " << remStock << endl;
  years =10;
  remStock = MTHREAD->CBAL->getRemainingStock(initialValue, halfLife, years);
  cout << "Remaining stock: " << remStock << endl;
  years = 200;
  remStock = MTHREAD->CBAL->getRemainingStock(initialValue, halfLife, years);
  cout << "Remaining stock: " << remStock << endl;
  */

  /*
  // Testing normSample
  // template <typename K> K normSample (const K& avg, const K& stdev, const K& minval=NULL, const K& maxval=NULL)
  // template <typename K> K normSample (const normal_distribution<K>& d, const std::mt19937& gen, const K& minval=NULL, const K& maxval=NULL)
  double avg = 0.8;
  double stdev = 0.2;
  double minval = 0.0;
  double maxval = 1.0;
  double result;

  cout << "Starting first method.." << endl;
  normal_distribution<double> d(avg,stdev);
  std::mt19937 gen = *MTHREAD->gen;
  for (uint i=0;i<1000;i++){
    result = normSample(d, gen, minval, maxval);
    cout << "Result1: " << result << endl;
  }
  cout << "Finished first method and starting second one.." << endl;
  for (uint i=0;i<1000;i++){
    result = normSample(avg, stdev, minval, maxval);
    cout << "Result2: " << result << endl;
  }
  cout << "Finished second method."<< endl;

  exit(0);
  */


   //double disttest = MTHREAD->MD->getProdData("dist",11042,"",DATA_NOW,i2s(11061));
   //cout << disttest << endl;
   //exit(0);


   /*double test = MTHREAD->CBAL->getStock(11061, STOCK_INV);
   //STOCK_INV  -> from inventary source and death trees
   //STOCK_EXTRA  -> from inventary source and death trees
   //STOCK_PRODUCTS -> from products
   cout << "DONE" << endl;
   exit(0);
   */

    /*
    // Testing if forestData can uses other arbitrary elements in the diameter field in order to generalise it
    double test = MTHREAD->MD->getForData("covar",11082,"con_highF","con_highF");
    MTHREAD->MD->setForData(0.1,"covar",11082,"con_highF","con_highF");
    MTHREAD->MD->setForData(0.1,"covar",11061,"con_highF","con_highF",DATA_NOW,true);
    test = MTHREAD->MD->getForData("covar",11082,"con_highF","con_highF");
    test = MTHREAD->MD->getForData("covar",11061,"con_highF","con_highF");
    test = MTHREAD->MD->getForData("covar",11082,"con_highF","");
    cout << test << endl;
    exit(0);
    */

    /*
    // Testing getProdData for the freeDimension
    MTHREAD->MD->setProdData(0.4,"rt",11041,"hardWSawnW",DATA_NOW,true,"11061");
    MTHREAD->MD->setProdData(0.3,"rt",11041,"hardWSawnW",DATA_NOW,true,"11030");
    MTHREAD->MD->setProdData(0.2,"rt",11041,"hardWSawnX",DATA_NOW,true,"11030");
    double debug = MTHREAD->MD->getProdData("rt",11041,"hardWSawnW",DATA_NOW,"11061");
    double debug2 = MTHREAD->MD->getProdData("rt",11041,"hardWSawnW",DATA_NOW);
    cout << debug << "    " << debug2 << endl;
    exit(0);
    */

    /*
    // Testing api to call generic forest type data, parent/child
    cout << "Hello world " << endl;
    cout << MTHREAD->MD->getForData("freq_norm",11041,"broadL","",2040) << endl;
    MTHREAD->MD->setForData(100,"freq_norm",11041,"broadL","",2040);
    cout << MTHREAD->MD->getForData("freq_norm",11041,"broadL","",2040) << endl;
    cout << MTHREAD->MD->getForTypeParentId("broadL_highF")<< endl;
    cout << MTHREAD->MD->getForTypeParentId("con_highF")<< endl;
    exit(0);
    */

    /*
    // Testing for each region how far is the average of the multipliers from 1
    vector<int>  regIds  =    MTHREAD->MD->getRegionIds(2);
    vector <string> ftypes = MTHREAD->MD->getForTypeIds();

    cout << "*** Checking how far is the tpMultiplier far from 1 in each region:" << endl;
    for (int i=0;i< regIds.size();i++){
        ModelRegion* region = MTHREAD->MD->getRegion(regIds[i]);
        vector <Pixel*>  regpixels =   MTHREAD->GIS->getAllPlotsByRegion(regIds[i]);
        if(regpixels.size()==0) continue;
        cout << "*** " << region->getRegLName() << ":  "<< endl;
        for(int ft = 0;ft<ftypes.size();ft++){
            double tot = 0;
            double avg = 0;
            for(int j=0;j<regpixels.size();j++){
              tot += regpixels[j]->getSpModifier(ftypes[ft]);
            }
            avg = tot/regpixels.size();
            cout << ftypes[ft] << ":  " << avg << endl;
        }
    }
    exit(0);
    */

    /*
    // Testing the number of plots in the model
    vector <ModelRegion*> regions = MTHREAD->MD->getAllRegions();
    int total = 0;
    cout << "*** Pixels by region:" << endl;
    for (int i=0;i< regions.size();i++){
        vector <Pixel*>  regpixels =   MTHREAD->GIS->getAllPlotsByRegion(*regions[i]);
        cout << regions[i]->getRegLName() << ":  " << regpixels.size() << endl;
        total += regpixels.size() ;
    }
    cout << "** Total:  " << total << endl;
    exit(0);
    */

  /*
  // Testing the new random distributions. Requires the pointer MTHREAD->gen to be initialised,
  // so this test can't run in basic test.
  std::normal_distribution<double> d(100000,3); // default any how to double
  for(int n=0; n<20; ++n) {
    double x = d(*MTHREAD->gen);
    int i = round(d(*MTHREAD->gen));
    cout << i << ';' << 1 << endl;
  }
  exit (0);
  */

  /*
  // Testing I have correctly the info about world price !!!
  // yes, it seems ok here !!!
  int firstYear = MTHREAD->MD->getIntSetting("initialYear");
  int initialOptYear= MTHREAD->MD->getIntSetting("initialOptYear");
  int simulationYears = MTHREAD->MD->getIntSetting("simulationYears");
  int WL2 = MTHREAD->MD->getIntSetting("worldCodeLev2");
  vector <string> priProducts = MTHREAD->MD->getStringVectorSetting("priProducts");
  vector <string> secProducts = MTHREAD->MD->getStringVectorSetting("secProducts");
  vector <string> allProducts = priProducts;
  allProducts.insert( allProducts.end(), secProducts.begin(), secProducts.end() );

  for(uint i=0;i<allProducts.size();i++){
    for(int y=firstYear; y<initialOptYear+simulationYears; y++){
      double pw = MTHREAD->MD->getProdData("pl",WL2,allProducts[i],y);
      cout << allProducts[i] << "  " << y << "  " << pw << endl;
    }
  }
  exit (0);
  */

  /*
  // testing Pixel::getMultiplier (const string& multiplierName, const string& forName, int year)
  Pixel* px = MTHREAD->GIS->getPixel(0);
  double debug1 = px->getMultiplier("tp_multiplier","broadL_highF",2012);
  double debug2 = px->getMultiplier("tp_multiplier","broadL_highF",2008);
  double debug3 = px->getMultiplier("tp_multiplier","broadL_highF",2009);
  double debug4 = px->getMultiplier("tp_multiplier","broadL_highF",2010);
  double debug5 = px->getMultiplier("mortCoeff_multiplier","broadL_highF",2012);
  double debug6 = px->getMultiplier("mortCoeff_multiplier","con_copp",2012);
  double debug7 = px->getMultiplier("blaaaa","broadL_highF",2012);

  double debug10 = debug1;
*/

  /*
  // testing reading a directory
  string dir = MTHREAD->MD->getBaseDirectory()+MTHREAD->MD->getStringSetting("spatialDataSubfolder");
  vector<string> files = vector<string>();

  MTHREAD->MD->getFilenamesByDir (dir,files, ".grd");

  for (unsigned int i = 0;i < files.size();i++) {
    cout << files[i] << endl;
  }
  */

  /*
  // testing ModelData:: ModelData::calculateAnnualisedEquivalent(double amount_h, int years_h)
  cout << "Value:" << MTHREAD->MD->calculateAnnualisedEquivalent(500.,4) << endl;
  cout << "Value:" << MTHREAD->MD->calculateAnnualisedEquivalent(500.,30) << endl;
  cout << "Value:" << MTHREAD->MD->calculateAnnualisedEquivalent(107.035040105,10) << endl;
  cout << "Value:" << MTHREAD->MD->calculateAnnualisedEquivalent(8.91507,1) << endl;
  cout << "Done" << endl;
  exit(0);
  */

  /*
  // testing snprintf
  vector <int> myintegers;
  vector <double> mydoubles;
  char  szResult[24];

  myintegers.push_back(1);
  myintegers.push_back(202);
  myintegers.push_back(3003);
  myintegers.push_back(400004);
  myintegers.push_back(50000005);
  myintegers.push_back(6000000006);
  mydoubles.push_back(1.1234567890);
  mydoubles.push_back(12345678.9);
  mydoubles.push_back(12345678.90123456);
  mydoubles.push_back(6000000006.123456789012);
  for(uint i=0;i<myintegers.size();i++){
    snprintf ( szResult, sizeof(szResult), "%d", myintegers[i] );  // "safe" version
    cout << "int/string: " << myintegers[i] << "  /  " << szResult << endl;
  }
  for(uint i=0;i<mydoubles.size();i++){
      snprintf ( szResult, sizeof(szResult), "%f", mydoubles[i] );  // "safe" version
    cout << "double/string: " << mydoubles[i] << "  /  " << szResult << endl;
  }
  exit(0);
  */

  /*
  // testing stod() ..
  // this is giving different results if gui or console mode !!
  vector<string> numbers;
  numbers.push_back("123.1234567890");
  numbers.push_back("123.1234");
  numbers.push_back("123,1234567890");
  numbers.push_back("123,1234");
  double outd;
  for(uint i=0;i<numbers.size();i++){
    try {
      outd =  stod(numbers[i]);
      cout << "Conversion passed: " << numbers[i] << "  -  " << outd << endl;
    } catch (...) {
      cout << "Conversion DID NOT passed: " << numbers[i] << "  -  " <<endl;
    }
  }
  exit(0);
  */

/*
// ------------------------------------
// Testing makeKeyProdData() and unpackKeyProdData()
  string parName = "za";
  int regId = 20000;
  string prod = "wood";
  string freeDim = "";
  string key = MTHREAD->MD->makeKeyProdData(parName,i2s(regId),prod,freeDim);
  cout << "key: " << key << endl;
  MTHREAD->MD->unpackKeyProdData(key,parName,regId,prod,freeDim);
  cout << "parName: " << parName << endl;
  cout << "regId: " << regId << endl;
  cout << "prod: " << prod << endl;
  cout << "freeDim: " << freeDim << endl;
  exit(0);
*/

/*
// ---------------------------------------------
// checking the functions dataMapCheckExist() and dataMapGetValue() works well
typedef map<string, vector <double> > DataMap;
typedef pair<string, vector <double> > DataPair;

vector <double> abaa (5, 1.);
vector <double> abcc (5,10);
vector <double> anbb (5,100);
vector <double> andd (5,5);
vector <double> anff (5,3);
vector <double> ag (5,2);
vector <double> agii (5,7);



DataMap dM;
dM.insert(DataPair("abaa", abaa));
dM.insert(DataPair("abcc", abcc));
dM.insert(DataPair("anbb", anbb));
dM.insert(DataPair("andd", andd));
dM.insert(DataPair("anff", anff));
dM.insert(DataPair("ag", ag));
dM.insert(DataPair("agii", agii));

vector<string> tests;
tests.push_back("ab");
tests.push_back("anbb");
tests.push_back("ane");
tests.push_back("an");
tests.push_back("ac");
tests.push_back("ag");
tests.push_back("agii");
tests.push_back("al");


bool found;
double value;

for(uint i=0;i<tests.size();i++){
  found = MTHREAD->MD->dataMapCheckExist(dM, tests[i]);
  value = MTHREAD->MD->dataMapGetValue(dM, tests[i],2010);
  cout << tests[i] << ": " << b2s(found) << " value: "<< value << endl;
}

exit(0);
*/


  /*
  // testing how to search on a vector using the find algorithm

  vector<string> names;
  names.push_back("pippo");
  names.push_back("topolino");
  names.push_back("minni");
  names.push_back("paperino");

  string toSearch1 = "minni";
  string toSearch2 = "zio paperone";

  if( find(names.begin(), names.end(), toSearch1)!= names.end() ){
    cout << "minni trovata" << endl;
  }
    if( find(names.begin(), names.end(), toSearch2)!= names.end() ){
    cout << "zio paperone trovato" << endl;
  }
  cout << "test on find ended." << endl;
  exit(0);
  */

// ------------------------------------------------------------------


  /*
  int a;
  a = getSetting<int>("myIntData", TYPE_INT);

  string b;
  b = getSetting<string>("myStringData", TYPE_STRING);

  bool c;
  c = getSetting<bool>("myBoolData", TYPE_BOOL);


  cout << "A is: " << a << endl;

  cout << "B is: " << b << endl;

  cout << "C is: " << c << endl;

  //vector<string> getVectorSetting <string> ("test", TYPE_STRING);
  //template <class T> vector <T> getVectorSetting(string name_h, int type);

  //vector <string> myStrings = getVectorSetting <vector<string> > ("test", TYPE_STRING);

  string s = GccTest("test");
  int i = GccTest("test");
  vector <int> iVector = GccTest("test");

  for (int i=0; i< iVector.size(); i++){
    cout << "iVector: " << iVector.at(i) << endl;
  }
  */
  
  // ------------------------------------------------------------------

  /* // I learned: how to access elements - both objects and pointers - of a vector using pointers
  // testing how to operate with iterators over a pointer element in an array:

  cout << "Starting iterator test..." << endl;

  TestStructure a,b,c,d;
  a.i=0; b.i=1; c.i=2; d.i=3;
  TestStructure* ap;
  TestStructure* bp;
  TestStructure* cp;
  TestStructure* dp;

  ap = &a;
  bp = &b;
  cp = &c;
  dp = &d;

  vector <TestStructure>  objects;
  vector <TestStructure*> pointers;

  objects.push_back(a);
  objects.push_back(b);
  objects.push_back(c);
  objects.push_back(d);

  pointers.push_back(ap);
  pointers.push_back(bp);
  pointers.push_back(cp);
  pointers.push_back(dp);
  
  vector<TestStructure>::iterator pi;
  vector<TestStructure*>::iterator pp;

   //ok it works
  //for ( pi = objects.begin() ; pi != objects.end();){
  //  if(pi->i==2){
  //    objects.erase(pi);
  //  }
  //  else {
  //    ++pi;
  //  }
  //}

  //for (int j=0;j<objects.size();j++){
  //  cout << j << " object is: " << objects[j].i << endl;
  //}
  

  // works as well ;-))
  for ( pp = pointers.begin() ; pp != pointers.end();){
    if( (*pp)->i==2){
      //delete (*pp);
      pointers.erase(pp);
    }
    else {
      ++pp;
    }
  }

  for (int j=0;j<pointers.size();j++){
    cout << j << " pointers is: " << pointers[j]->i << endl;
  }

  // c is not destructed if we don't explicitelly call delete over the pointer...
  cout << c.i << endl; // this go in seg-frag if we call delete (*pp)..
  */

  // ------------------------------------------------------------------
  /* test on how to remove from a map.. deletable
  map <int, string> test;
  test.insert(pair<int, string>(2, "pippo"));
  test.insert(pair<int, string>(1, "pluto"));
  test.insert(pair<int, string>(5, "minni"));
  test.insert(pair<int, string>(3, "topolino"));


  map <int, string>::iterator p;
  p=test.find(3);
  if(p != test.end()){
    cout << p->second <<endl;
    test.erase(p);
  }
  else {
    cout << "not found " << endl;
  }

  map <int, string>::iterator p2;
  p2=test.find(3);
  if(p2 != test.end()){
    cout << p2->second <<endl;
    test.erase(p2);
  }
  else {
    cout << "not found " << endl;
  }
  */

   /*vector<int> test;
   for (int i=0;i<5;i++) test.push_back(i);
   cout << "test.." << endl;
  for (uint i=0;i<test.size();i++){
     cout << "Test "<<i<<": "<<test.at(i) << endl;
  }
  //test.erase(2);

  vector<int>::iterator p;
  for ( p = test.begin() ; p != test.end();){
    if(*p == 1 || *p == 2 || *p==4){
      test.erase(p);
    }
    else {
      ++p;
    }
  }
  

  for (uint i=0;i<test.size();i++){
     cout << "Test "<<i<<": "<<test.at(i) << endl;
  }

//  test.erase(remove_if(test.begin(), test.end(), FindMatchingString(&fs))

//  for (int i=0;i<test.size();i++) cout << "TEST: "<<i<< " " << test.at(i) << endl;
  */

  /*
  // On this test I am showing how to "move" one pointer from a vector of pointers to an other one. The real case is used to move Agent_farmer* pointers from the managedAgents vector to the removedVector.

  double* myDouble1 = new double(1);
  double* myDouble2 = new double(2);
  double* myDouble3 = new double(3);
  
  vector <double*> origin;
  vector <double*> destination;

  origin.push_back(myDouble1);
  origin.push_back(myDouble2);
  origin.push_back(myDouble3);

  cout << "MyDouble2: "<< *myDouble2 << endl;
  vector<double*>::iterator doublePIterator;

  for (int i=0;i<origin.size();i++){
    cout << i << " origin is: " << *origin[i] << endl;
  }

  for ( doublePIterator = origin.begin() ; doublePIterator !=origin.end();){
    if(*doublePIterator == myDouble2){
      destination.push_back(myDouble2);
      origin.erase(doublePIterator);
    }
    else {
      ++doublePIterator;
    }
  }

  for (int i=0;i<origin.size();i++){
    cout << i << " origin is now: " << *origin[i] << endl;
  }

  for (int i=0;i<destination.size();i++){
    cout << i << " destination is: " << *destination[i] << endl;
  } */
  
  // ------------------------------------------------------------------
  /*
  // Test on how to return a vector of pointers from a member vector of data
  TestStructure a,b,c,d;
  a.i=0; b.i=1; c.i=2; d.i=3;
  testVector.push_back(a);
  testVector.push_back(b);
  testVector.push_back(c);
  testVector.push_back(d);

  vector<TestStructure*>  myVector=getTestStructure();

  for(uint i=0;i<myVector.size();i++){
    msgOut(MSG_DEBUG, i2s(myVector[i]->i));
  }  
  */

  /*
  // Deleting an object and inserting a new one on a vector of objects.. it doesn't works.. problems with the last element..
  vector<BasicData>::iterator p;
  for(p=programSettingsVector.begin();p!=programSettingsVector.end();p++){
    if(p->name == SETT.name){
      programSettingsVector.erase(p);
      programSettingsVector.insert(p,1,SETT);
      cout << SETT.name <<endl;
      break;
    }
  }
  */

  /*double test = -987654321.987654321;
  double result;
  result = fabs(test);
  cout << "Test: "<< result << endl;*/


  /*
  // Testing the zip library:

  cout <<"Hello world Zip!" << endl;

  QString file = "data/testInput.ods";
  QString out = "data/tempInput";
  QString pwd = "";
  if (!QFile::exists(file))
  {
    cout << "File does not exist." << endl << endl;
    //return false;
  }

  UnZip::ErrorCode ec;
  UnZip uz;

  if (!pwd.isEmpty())
    uz.setPassword(pwd);

  ec = uz.openArchive(file);
  if (ec != UnZip::Ok)
  {
        //cout << "Failed to open archive: " << uz.formatError(ec).toAscii().data() << endl << endl; // Qt4
        cout << "Failed to open archive: " << uz.formatError(ec).toLatin1().data() << endl << endl;  // Qt5
    //return false;
  }

  ec = uz.extractAll(out);
  if (ec != UnZip::Ok)
  {
        //cout << "Extraction failed: " << uz.formatError(ec).toAscii().data() << endl << endl; // Qt4
        cout << "Extraction failed: " << uz.formatError(ec).toLatin1().data() << endl << endl;  // Qt5
    uz.closeArchive();
    //return false;
  }
  */

  /*
  // How to : delete an element from an array from its position
  cout << "How to : delete an element from an array from its position" << endl;

  vector <string> headers;
  vector < vector <string> > records;
  vector <string> firstrecord;
  vector <string> secondrecord;
  records.push_back(firstrecord);
  records.push_back(secondrecord);

  headers.push_back("a");
  headers.push_back("b");
  headers.push_back("");
  headers.push_back("d");
  headers.push_back("e");
  headers.push_back("");
  
  records[0].push_back("0");
  records[0].push_back("1");
  records[0].push_back("2");
  records[0].push_back("3");
  records[0].push_back("4");
  records[0].push_back("5");
  records[1].push_back("00");
  records[1].push_back("11");
  records[1].push_back("22");
  records[1].push_back("33");
  records[1].push_back("44");
  records[1].push_back("55");

  for (int i=headers.size()-1;i>=0;i--){
    if(headers[i] == ""){
      headers.erase(headers.begin()+i);
      for (int j=0;j<records.size();j++){
        records[j].erase(records[j].begin()+i);
      }
    }
  }
  for(uint i=0;i<headers.size();i++){
    cout << headers.at(i) << " - " << records[0].at(i) << " - " << records[1].at(i) << endl;
  }
  cout << "done!" << endl;
  */

  //testThreads();
  /*vector<double> numbers;
  double cumNumbers = 0.00;
  numbers.push_back(0.40);
  numbers.push_back(0.10);
  numbers.push_back(0.20);
  numbers.push_back(0.08);
  numbers.push_back(0.22);
  
  for (uint i=0;i<numbers.size();i++){
    cumNumbers += numbers[i];
  }
  
  if (cumNumbers <= 0.99999999 || cumNumbers >= 1.00000001) {
    cout <<"Bastardo!"<<endl;
  } else {
    cout <<"qui funzia!"<<endl;
  }*/

}

Here is the caller graph for this function:

T getSetting	(	string	name_h,
		int	type
	)

Definition at line 1518 of file Sandbox.cpp.

                                          {

  string myIntData;
  myIntData = "34";
  string myStringData;
  myStringData = "abcdefg";

  string myBoolData;
  myBoolData = "false";
  
  if(type==TYPE_INT){
    istringstream iss(myIntData);
    T x;
    iss >> x;
    return x;
  }

  if(type==TYPE_STRING){
    istringstream iss(myStringData);
    T x;
    iss >> x;
    return x;
  }

  if(type==TYPE_BOOL){
    string tempBoolString;
    if (myBoolData == "1" || myBoolData == "true" || myBoolData == "True" || myBoolData == "TRUE" || myBoolData == "vero" || myBoolData == "Vero"|| myBoolData == "VERO"){
      tempBoolString = "1";
    }
    else if (myBoolData == "0" || myBoolData == "false" || myBoolData == "False" || myBoolData == "FALSE" || myBoolData == "falso" || myBoolData == "falso"|| myBoolData == "FALSO"){
      tempBoolString = "0";
    }
    else {
      msgOut(MSG_CRITICAL_ERROR, "Impossible conversion of "+myBoolData+" to bool!. Aborted.");
    }
    istringstream iss(tempBoolString);
    T x;
    iss >> x;
    return x;
  }


}

vector< TestStructure * > getTestStructure

(

)

Definition at line 1572 of file Sandbox.cpp.

Referenced by printAString().

                         {
  vector <TestStructure*> toReturn;
  for (uint i=0;i<testVector.size();i++){
    //TestStructure* tempTest = new TestStructure;
    toReturn.push_back(&testVector[i]);
  }
  return toReturn;

}

Here is the caller graph for this function:

vector<T> getVectorSetting	(	string	name_h,
		int	type
	)

void printAString ( string  what )

inline

Definition at line 50 of file Sandbox.h.

{cout << "You printed: "<< what << endl;};

Here is the call graph for this function:

T test2

(

const std::string &

s

)

Definition at line 1563 of file Sandbox.cpp.

                                 {
  std::istringstream iss(s);
  T x;
  iss >> x;
  return x;
}

int testAdolc

(

)

Definition at line 1758 of file Sandbox.cpp.

Referenced by printAString().

                  {

  using namespace Ipopt;
 // Create an instance of your nlp...
   SmartPtr<TNLP> myadolc_nlp = new MyADOLC_NLP();
  //SmartPtr<TNLP> myadolc_nlp = new MyADOLC_sparseNLP();

  // Create an instance of the IpoptApplication
  SmartPtr<IpoptApplication> app = new IpoptApplication();

  // Initialize the IpoptApplication and process the options
  ApplicationReturnStatus status;
  status = app->Initialize();
  if (status != Solve_Succeeded) {
    printf("\n\n*** Error during initialization!\n");
    return (int) status;
  }

  status = app->OptimizeTNLP(myadolc_nlp);

  if (status == Solve_Succeeded) {
    // Retrieve some statistics about the solve
    Index iter_count = app->Statistics()->IterationCount();
    printf("\n\n*** The problem solved in %d iterations!\n", iter_count);

    Number final_obj = app->Statistics()->FinalObjective();
    printf("\n\n*** The final value of the objective function is %e.\n", final_obj);
  }

  return (int) status;
}

Here is the caller graph for this function:

void testIpopt

(

)

Definition at line 1707 of file Sandbox.cpp.

Referenced by printAString().

                  {


    using namespace Ipopt;

      // Create a new instance of your nlp
      //  (use a SmartPtr, not raw)
      SmartPtr<TNLP> mynlp = new Ipopt_nlp_problem_debugtest();

      // Create a new instance of IpoptApplication
      //  (use a SmartPtr, not raw)
      // We are using the factory, since this allows us to compile this
      // example with an Ipopt Windows DLL
      SmartPtr<IpoptApplication> app = IpoptApplicationFactory();

      // Change some options
      // Note: The following choices are only examples, they might not be
      //       suitable for your optimization problem.
      app->Options()->SetNumericValue("tol", 1e-7);
      app->Options()->SetStringValue("mu_strategy", "adaptive");
      app->Options()->SetStringValue("output_file", "ipopt.out");
      //app->Options()->SetStringValue("hessian_approximation", "limited-memory");
      //app->Options()->SetStringValue("derivative_test", "second-order");
      //app->Options()->SetStringValue("derivative_test_print_all", "yes");


      // The following overwrites the default name (ipopt.opt) of the
      // options file
      // app->Options()->SetStringValue("option_file_name", "hs071.opt");

      // Intialize the IpoptApplication and process the options
      ApplicationReturnStatus status;
      status = app->Initialize();
      if (status != Solve_Succeeded) {
        std::cout << std::endl << std::endl << "*** Error during initialization!" << std::endl;
        //return (int) status; // here the abort
      }

      // Ask Ipopt to solve the problem
      status = app->OptimizeTNLP(mynlp);

      if (status == Solve_Succeeded) {
        std::cout << std::endl << std::endl << "*** The problem solved!" << std::endl;
      }
      else {
        std::cout << std::endl << std::endl << "*** The problem FAILED!" << std::endl;
      }

}

Here is the caller graph for this function:

void testPartMatching

(

)

How to partial matching the key of a map.

Definition at line 1833 of file Sandbox.cpp.

Referenced by printAString().

                         {

    TStrStrMap tMap;

    tMap.insert(TStrStrPair("John", "AA"));
    tMap.insert(TStrStrPair("Mary", "BBB"));
    tMap.insert(TStrStrPair("Mother", "A"));
    tMap.insert(TStrStrPair("Moliere", "D"));
    tMap.insert(TStrStrPair("Marlon", "C"));

    testSearchMap(tMap, "Marl");
    testSearchMap(tMap, "Mo");
    testSearchMap(tMap, "ther");
    testSearchMap(tMap, "Mad");
    testSearchMap(tMap, "Mom");
    testSearchMap(tMap, "Perr");
    testSearchMap(tMap, "Jo");

  exit(0);
    return;
}

Here is the caller graph for this function:

void testPartMatching2

(

)

How to partial matching the key of a map.

Definition at line 1870 of file Sandbox.cpp.

Referenced by printAString().

                          {

    TStrStrMap tMap;


  tMap.insert(TStrStrPair("mortCoeff_multiplier#broadL_highF##2005", "2005"));
  tMap.insert(TStrStrPair("regLev_1", "-9999"));
  tMap.insert(TStrStrPair("regLev_2", "-9999"));
  tMap.insert(TStrStrPair("tp_multiplier#broadL_copp##2005", "-9999"));
  tMap.insert(TStrStrPair("tp_multiplier#broadL_highF##2005", "50"));
  tMap.insert(TStrStrPair("tp_multiplier#broadL_highF##2010", "2010"));
  tMap.insert(TStrStrPair("tp_multiplier#broadL_mixedF##2005", "-9999"));
  tMap.insert(TStrStrPair("tp_multiplier#con_copp##2005", "-9999"));
  tMap.insert(TStrStrPair("tp_multiplier#con_highF##2005", "-9999"));
  tMap.insert(TStrStrPair("tp_multiplier#con_mixedF##2005", "aa"));

  TStrStrMap::const_iterator i;

  for(i=tMap.begin();i!=tMap.end();i++){
    cout << i->first << ", " << i->second << endl;
  }
  cout << endl;

    testSearchMap2(tMap, "mortCoeff_multiplier#broadL_highF##2006");
    testSearchMap2(tMap, "tp_multiplier#broadL_highF##2008");
    testSearchMap2(tMap, "aaaaaa");
    testSearchMap2(tMap, "zzzzzz");

  exit(0);
    return;
}

Here is the caller graph for this function:

void testSearchMap ( const map< string, string > &  map, const string &  search_for  )

private

Definition at line 1818 of file Sandbox.cpp.

                                                                      {
  TStrStrMap::const_iterator i = map.lower_bound(search_for);
  for(;i != map.end();i++){
    const string& key = i->first;
    if (key.compare(0, search_for.size(), search_for) == 0) {// Really a prefix?
        cout << i->first << ", " << i->second << endl;
    } else {
      break;
    }
  }

}

void testSearchMap2 ( const map< string, string > &  map_h, const string &  search_for  )

private

Definition at line 1856 of file Sandbox.cpp.

                                                                         {
  TStrStrMap::const_iterator i = map_h.upper_bound(search_for);
  if(i!= map_h.begin())  i--;
  const string& key = i->first;
  string search_base = search_for.substr(0,search_for.size()-4);
  if (key.compare(0, search_base.size(), search_base) == 0){
    cout << "MATCH: " << search_for <<", "<< i->first << ", " << i->second << endl;
  } else {
    cout << "NOTM:  " << search_for <<", "<< i->first << endl;
  }

}

void testThreads

(

)

Definition at line 1585 of file Sandbox.cpp.

Referenced by printAString().

                    {

        /*
        PSEUDOCODE
        - attivo i vari thread
        - per ogni closestAgent itero fra i vari thread e se "è libero" gli assegno il closestAgent
        - quando ho finito i closestAgent aspetto che tutti i threads abbiano finito il lavoro
        - chiudo i threads
        - vado avanti
        */
        int nAgents= 50;
        vector<TestStructure*> myAgents;
        vector<double> myResults (nAgents, (double) 0);
        //int nThreads = MTHREAD->MD->getIntSetting("nThreads");
        int nThreads= 5;

        for (int i=0; i < nAgents; i++){
          TestStructure* myAgent = new TestStructure;
          myAgent->i = i;
          myAgent->random =  (0+( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(10-0+1))/ (double)100;
          myAgents.push_back(myAgent);
        }

        vector <testThread*> myThreads ;

        for (int i=0; i < nThreads; i++){
          testThread* myThread = new testThread;
          myThreads.push_back(myThread);
        }

        for (uint i=0;i<myAgents.size();i++){
          bool assigned = false;
          while(!assigned) {
            for (uint j=0;j<myThreads.size();j++){
              if (!myThreads[j]->isRunning()){
                cout << "Assigning agent " << i << " to thread " << j << endl;
                myThreads[j]->assignJob(myAgents[i]);
                myThreads[j]->start();
                assigned = true;
                break;
              }
              else {
                cout << "Thread " << j << " is busy" << endl;
              }
            }    
          }  
        }
        /*
        volatile bool somethingStopping = true;
        while (somethingStopping){
          somethingStopping = false;
          for (uint i=0;i<myThreads.size();i++){
            if(myThreads[i]->isRunning()){
              somethingStopping = true;
              //cout << "somethingStopping is true" << endl;
            }
          }
        }

        if (somethingStopping) {
          cout << "somethingStopping is true" << endl;
        }
        else {
          cout << "somethingStopping is false" << endl;
        }
        cout << "pinco pallo sono nel mezzo dei threads..."<<endl;
        */
        for (int i=0; i < nThreads; i++){
          myThreads[i]->wait();
        }


        for (int i=0; i < nThreads; i++){
          delete myThreads[i];
        }

        for (uint i=0;i<myAgents.size();i++){
          //cout <<myAgents[i]->cachedOffer<<endl;

          double random =  (0+( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(10-0+1))/ (double)100;

          // important !
          // for random integer see also std::uniform_int_distribution :
          // http://stackoverflow.com/questions/7780918/stduniform-int-distributionint-range-in-g-and-msvc
          // in regmas:
          // int randomRed = int (50+( (double)rand() / ((double)(RAND_MAX)+(double)(1)) )*(255-50+1)); // randomRed is [50,255] Don't use "randomNumber % range" !!

          //cout <<random<<endl;
        }

        //thread1.stop();
        cout << "FINITO"<<endl;
        

}

Here is the caller graph for this function:

Member Data Documentation

vector<TestStructure> testVector

private

Definition at line 61 of file Sandbox.h.

---

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

• /srv/datadisk03/home/ffsm/code/ffsm_pp/src/Sandbox.h
• /srv/datadisk03/home/ffsm/code/ffsm_pp/src/Sandbox.cpp