roadrunner
2.6.0
Fast simulator for SBML models
|
Similar to a symbol table, except instead of a name / value, we have a name / tree, where the tree is the root of an ASTNode tree. More...
#include <SymbolForest.h>
Classes | |
class | ConstIterator |
syntatically the same as a std::map<std::string, const libsbml::ASTNode*>::const_iterator More... | |
Public Types | |
typedef std::map< std::string, const libsbml::ASTNode * > | Map |
typedef std::map< std::string, const libsbml::ASTNode * >::const_iterator | _const_iterator |
Public Member Functions | |
const ConstIterator | find (const std::map< std::string, const libsbml::ASTNode * >::key_type &x) const |
find and end are designed to work identically to the std::map::find. More... | |
const ConstIterator & | end () const |
Similar to a symbol table, except instead of a name / value, we have a name / tree, where the tree is the root of an ASTNode tree.
The rationality behind this will be covered in the paper, but briefly its required because we are dealing with a declarative language in which the rules can be defined in any order.
This class does not own anything, it just has const pointers to a set of ASTNodes which are owned either by the sbml model, or some containing class.
This class basically stores the name / value of all the re-write rules (assigment or initial assigment).
|
inline |
find and end are designed to work identically to the std::map::find.
Note that the resulting iterator is not iteratable, it is only suitable for comparing with end() and getting the value out of it.