/usr/include/sbml/SBMLTransforms.h is in libsbml5-dev 5.13.0+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 | /**
* @cond doxygenLibsbmlInternal
*
* @file SBMLTransforms.h
* @brief Transform functions
* @author Sarah Keating
*
* <!--------------------------------------------------------------------------
* This file is part of libSBML. Please visit http://sbml.org for more
* information about SBML, and the latest version of libSBML.
*
* Copyright (C) 2013-2016 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. EMBL European Bioinformatics Institute (EMBL-EBI), Hinxton, UK
* 3. University of Heidelberg, Heidelberg, Germany
*
* Copyright (C) 2009-2013 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. EMBL European Bioinformatics Institute (EMBL-EBI), Hinxton, UK
*
* Copyright (C) 2006-2008 by the California Institute of Technology,
* Pasadena, CA, USA
*
* Copyright (C) 2002-2005 jointly by the following organizations:
* 1. California Institute of Technology, Pasadena, CA, USA
* 2. Japan Science and Technology Agency, Japan
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation. A copy of the license agreement is provided
* in the file named "LICENSE.txt" included with this software distribution
* and also available online as http://sbml.org/software/libsbml/license.html
* ---------------------------------------------------------------------- -->
*
* @class SBMLTransforms
* @sbmlbrief{core} Methods for transform elements of SBML
*
*/
#ifndef SBMLTransforms_h
#define SBMLTransforms_h
#include <sbml/common/extern.h>
#include <sbml/SBase.h>
#include <sbml/util/util.h>
#include <sbml/math/ASTNode.h>
#include <sbml/FunctionDefinition.h>
#include <sbml/InitialAssignment.h>
#ifndef LIBSBML_USE_STRICT_INCLUDES
#include <sbml/SBMLTypes.h>
#endif
#include <sbml/SpeciesReference.h>
#ifdef __cplusplus
#include <string>
LIBSBML_CPP_NAMESPACE_BEGIN
class IdList;
#ifdef LIBSBML_USE_STRICT_INCLUDES
class ASTNode;
class FunctionDefinition;
class InitialAssignment;
class Model;
class Species;
class SpeciesReference;
class Compartment;
class Parameter;
#endif
class LIBSBML_EXTERN SBMLTransforms
{
public:
#ifndef SWIG
typedef std::pair<double, bool> ValueSet;
typedef std::map<const std::string, ValueSet> IdValueMap;
typedef IdValueMap::iterator IdValueIter;
#endif
/**
* Expands the math represented by the ASTNode to implement the functionality
* of the FunctionDefinition, if it occurs within the original
* math.
*
* For example, an ASTNode represents the math expression: f(s, p) where
* f is the id of a FunctionDefinition representing f(x, y) = x * y.
* The outcome of the function is that the ASTNode now represents
* the math expression: s * p
*
* @param math ASTNode representing the math to be transformed
*
* @param fd the FunctionDefinition to be expanded
*
* @param idsToExclude an optional list of function definition ids to exclude.
*
* @copydetails doc_note_static_methods
*/
static void replaceFD(ASTNode * math, const FunctionDefinition * fd,
const IdList* idsToExclude = NULL);
/**
* Expands the math represented by the ASTNode to implement the functionality
* of all the FunctionDefinitions in the list, if they occur within the
* original math.
*
* For example, an ASTNode represents the math expression: f(s, g(p, q)) where
* f is the id of a FunctionDefinition representing f(x, y) = x * y
* and g is the id of a FunctionDefinition representing f(x, y) = x/y
* The outcome of the function is that the ASTNode now represents
* the math expression: s * p/q
*
* @param math ASTNode representing the math to be transformed
*
* @param lofd the ListOfFunctionDefinitions to be expanded
*
* @param idsToExclude an optional list of function definition ids to exclude.
*
* @copydetails doc_note_static_methods
*/
static void replaceFD(ASTNode * math, const ListOfFunctionDefinitions * lofd,
const IdList* idsToExclude = NULL);
static bool expandInitialAssignments(Model * m);
static double evaluateASTNode(const ASTNode * node, const Model * m = NULL);
#ifndef SWIG
static double evaluateASTNode(const ASTNode * node, const IdValueMap& values, const Model * m = NULL);
static double evaluateASTNode(const ASTNode * node, const std::map<std::string, double>& values, const Model * m = NULL);
static IdList getComponentValuesForModel(const Model * m, IdValueMap& values);
#endif
static IdList mapComponentValues(const Model * m);
static void clearComponentValues();
protected:
static void replaceBvars(ASTNode * math, const FunctionDefinition * fd);
static bool checkFunctionNodeForIds(ASTNode * node, IdList& ids);
static bool nodeContainsId(const ASTNode * node, IdList& ids);
static bool nodeContainsNameNotInList(const ASTNode * node, IdList& ids);
static bool expandInitialAssignment(Parameter * p,
const InitialAssignment *ia);
static bool expandInitialAssignment(Compartment * c,
const InitialAssignment *ia);
static bool expandInitialAssignment(SpeciesReference * sr,
const InitialAssignment *ia);
static bool expandInitialAssignment(Species * s,
const InitialAssignment *ia);
static void recurseReplaceFD(ASTNode * math, const FunctionDefinition * fd,
const IdList* idsToExclude);
static IdValueMap mValues;
};
LIBSBML_CPP_NAMESPACE_END
#endif /* __cplusplus */
#endif /* SBMLTransforms_h */
/** @endcond */
|