X-Git-Url: http://git.treefish.org/~alex/phys/latlib.git/blobdiff_plain/d3e332b13eccd2fa7e467770f6d973b4f34904cf..d39c90a61334fa4c953842483bb79f3a86d319d0:/paraq.cpp diff --git a/paraq.cpp b/paraq.cpp index 3f7eb29..b1e3292 100644 --- a/paraq.cpp +++ b/paraq.cpp @@ -1,41 +1,121 @@ #include "paraq.h" +#include +#include +#include +#include +#include + +using namespace std; + paraq::paraq(int _nprocs, const int _rank) { - lastjob = -1; + thisjob = -1; nprocs = _nprocs; rank = _rank; + masterdefault = 0; + jobListInitialized = false; +} + +void paraq::addRange(const string& paraid, char *range) +{ + int nargs=0; + double goodrange[3]; + + for( int pos=0; pos >::iterator paraIt = rangeMap.begin(); paraIt != rangeMap.end(); ++paraIt ) + if( paraIt->second.size() > 0 ) + for( vector::iterator rangeIt = paraIt->second.begin(); rangeIt != paraIt->second.end(); ++rangeIt) + rangestring << "-" << paraIt->first << (*rangeIt)[0] << "_" << (*rangeIt)[1] << "_" << (*rangeIt)[2]; + + for( map::iterator defIt = defaultPara.begin(); defIt != defaultPara.end(); ++defIt ) + if( rangeMap.find(defIt->first) == rangeMap.end() ) + rangestring << "-" << defIt->first << defIt->second; + + return rangestring.str(); } void paraq::addRange(const string& paraid, double min, double max, double step) { - double *range = new double[3]; - range[0] = min; - range[1] = max; - range[2] = step; + double *newrange = new double[3]; + newrange[0] = min; + newrange[1] = max; + newrange[2] = step; + rangeMap[paraid].push_back( newrange ); + + for( double paraval = min; paraval <= max+0.5*step; paraval += step+(step==0) ) + if( ! inParas(paraMap[paraid], paraval) ) paraMap[paraid].push_back( paraval ); +} - paraMap[paraid].push_back( range ); +bool paraq::inParas( vector& paraVec, double& tofind ) +{ + for( vector::iterator it = paraVec.begin(); it < paraVec.end(); ++it) + if( fabs(*it - tofind) < 0.0000000001 ) return true; + return false; } -map* paraq::nextParas() +void paraq::initJobList() { - if( lastjob == -1 ) { - lastjob = 0; + if( ! jobListInitialized ) { + map jobZero; + jobList.push_back( jobZero ); - for( map< string, vector< double* > >::iterator paraIt = paraMap.begin(); paraIt != paraMap.end(); ++paraIt ) { - for( vector< map >::iterator jobIt = jobList.begin(); jobIt != jobList.end(); ++jobIt) { - for( vector::iterator rangeIt = paraIt->second.begin(); rangeIt != paraIt->second.end(); ++rangeIt ) { - - for( double paraval = *rangeIt[0]; paraval < *rangeIt[1]; paraval += *rangeIt[2] ) { + for( map< string, vector< double > >::iterator paraIt = paraMap.begin(); paraIt != paraMap.end(); ++paraIt ) + while( jobList.begin()->find(paraIt->first) == jobList.begin()->end() ) { + for( vector::iterator valIt = paraIt->second.begin(); valIt != paraIt->second.end(); ++valIt ) { + jobList.push_back( *jobList.begin() ); + jobList.back()[paraIt->first] = *valIt; + } + jobList.erase( jobList.begin() ); + } + jobListInitialized = true; + } +} - //if( paraval == *rangeIt[0] ) - //else +int paraq::nextParas() +{ + if( thisjob == -1 ) { + initJobList(); + thisjob = rank; + } + else + thisjob += nprocs; - } + if( jobList.begin()->size() == 0 ) return 0; - } + if( thisjob < jobList.size() ) return 1; + else + return 0; +} - } - } +double& paraq::operator[] (string paraid) { + if( jobList[thisjob].find(paraid) != jobList[thisjob].end() ) { + return jobList[thisjob][paraid]; + } + + if( defaultPara.find(paraid) != defaultPara.end() ) { + return defaultPara[paraid]; } + + return masterdefault; +} + +int paraq::getTotalJobs() { + initJobList(); + return jobList.size(); }