gambit is hosted by Hepforge, IPPP Durham
GAMBIT  v1.5.0-2191-ga4742ac
a Global And Modular Bsm Inference Tool
depresolver.cpp File Reference

Dependency resolution with boost graph library. More...

#include "gambit/Core/depresolver.hpp"
#include "gambit/Models/models.hpp"
#include "gambit/Utils/stream_overloads.hpp"
#include "gambit/Utils/util_functions.hpp"
#include "gambit/Logs/logger.hpp"
#include "gambit/Backends/backend_singleton.hpp"
#include "gambit/cmake/cmake_variables.hpp"
#include <sstream>
#include <fstream>
#include <iomanip>
#include <regex>
#include <boost/format.hpp>
#include <boost/algorithm/string/replace.hpp>
Include dependency graph for depresolver.cpp:

Go to the source code of this file.

Namespaces

 Gambit
 TODO: see if we can use this one:
 
 Gambit::DRes
 

Macros

#define OBSLIKE_VERTEXID   58915032
 
#define NORMAL_DEPENDENCY   1
 
#define LOOP_MANAGER_DEPENDENCY   2
 

Functions

void Gambit::DRes::getParentVertices (const VertexID &vertex, const DRes::MasterGraphType &graph, std::set< VertexID > &myVertexList)
 
std::vector< VertexID > Gambit::DRes::sortVertices (const std::set< VertexID > &set, const std::list< VertexID > &topoOrder)
 
std::vector< VertexID > Gambit::DRes::getSortedParentVertices (const VertexID &vertex, const DRes::MasterGraphType &graph, const std::list< VertexID > &topoOrder)
 
bool Gambit::DRes::quantityMatchesIniEntry (const sspair &quantity, const IniParser::ObservableType &observable, const Utils::type_equivalency &eq)
 
bool Gambit::DRes::capabilityMatchesIniEntry (const sspair &quantity, const IniParser::ObservableType &observable)
 
bool Gambit::DRes::moduleFuncMatchesIniEntry (functor *f, const IniParser::ObservableType &e, const Utils::type_equivalency &eq)
 
bool Gambit::DRes::backendFuncMatchesIniEntry (functor *f, const IniParser::ObservableType &e, const Utils::type_equivalency &eq)
 
int Gambit::DRes::getEntryLevelForOptions (const IniParser::ObservableType &e)
 
bool Gambit::DRes::matchesRules (functor *f, const Rule &rule)
 
double Gambit::DRes::getTimeEstimate (const std::set< VertexID > &vertexList, const DRes::MasterGraphType &graph)
 
bool Gambit::DRes::stringComp (const str &s1, const str &s2, bool with_regex=true)
 Check whether s1 (wildcard + regex allowed) matches s2. More...
 
bool Gambit::DRes::typeComp (str, str, const Utils::type_equivalency &, bool with_regex=true)
 Type comparison taking into account equivalence classes. More...
 

Variables

bool Gambit::DRes::use_regex
 Global flag for regex use. More...
 

Detailed Description

Dependency resolution with boost graph library.

unravels the un-unravelable


Authors (add name and date if you modify):

Author
Christoph Weniger (c.wen.nosp@m.iger.nosp@m.@uva..nosp@m.nl)
Date
2013 May, Jun, Jul, Sep
2014 Feb, Mar, Apr
Author
Pat Scott (patsc.nosp@m.ott@.nosp@m.physi.nosp@m.cs.m.nosp@m.cgill.nosp@m..ca)
Date
2013 May, Jul, Aug, Nov 2014 Jan, Mar, Apr, Dec 2018 Sep, Nov
Author
Ben Farmer (benja.nosp@m.min..nosp@m.farme.nosp@m.r@mo.nosp@m.nash..nosp@m.edu)
Date
2013 Sep
Author
Tomas Gonzalo (t.e.g.nosp@m.onza.nosp@m.lo@fy.nosp@m.s.ui.nosp@m.o.no)
Date
2017 June 2019 May
Author
Patrick Stoecker (stoec.nosp@m.ker@.nosp@m.physi.nosp@m.k.rw.nosp@m.th-aa.nosp@m.chen.nosp@m..de)
Date
2020 May

Definition in file depresolver.cpp.

Macro Definition Documentation

◆ LOOP_MANAGER_DEPENDENCY

#define LOOP_MANAGER_DEPENDENCY   2

◆ NORMAL_DEPENDENCY

#define NORMAL_DEPENDENCY   1

Definition at line 63 of file depresolver.cpp.

Referenced by Gambit::DRes::DependencyResolver::fillParQueue().

◆ OBSLIKE_VERTEXID