NodeFactory Class Reference

Wrapper class for static node compile functions. More...

#include <NodeFactory.h>

Static Public Member Functions
template<class AVariableManager >
static std::unique_ptr< const AbstractBooleanNode< AVariableManager > >	compile_boolean_node (Nodetuple tuple)
	This template function creates a boolean node from a boost::python::tuple The Python Parser encodes the node type as int as the first argument of each tuple.
template<class AVariableManager >
static std::unique_ptr< const AbstractExpressionNode< AVariableManager > >	compile_expression_node (Nodetuple tuple)
	This template function creates a ExpressionNode from a boost::python::tuple The Python Parser encodes the node type as int in the first argument of each tuple.

Detailed Description

Wrapper class for static node compile functions.

Definition at line 64 of file NodeFactory.h.

Member Function Documentation

compile_boolean_node()

static std::unique_ptr< const AbstractBooleanNode< AVariableManager > > compile_boolean_node ( Nodetuple  tuple )

inlinestatic

This template function creates a boolean node from a boost::python::tuple The Python Parser encodes the node type as int as the first argument of each tuple.

Node types are decoded via the NodeType enum defined in framework/utilities/include/AbstractNodes.h e.g (2, (11, True)) is a UnaryRelationalNode (nodetype value 2), which has a BooleanNode(nodetype value 11) as a child. List of Nodes:

• UnaryBooleanNode
• BinaryBooleanNode
• UnaryRelationalNode
• BinaryRelationalNode
• TernaryRelationalNode

  Parameters

  tuple

  (const boost::python::tuple&): python tuple generated from the parser

Definition at line 80 of file NodeFactory.h.

    {
      if (py::len(tuple) == 0) B2FATAL("BooleanNode tuple is empty, this is invalid.");
      // First argument of every NodeTuple is an integer indicating the NodeType
      NodeType node_type = static_cast<NodeType>(static_cast<int>(py::extract<int>(tuple[0])));
 
      if (node_type == NodeType::UnaryBooleanNode) {
        // Extract first child tuple
        if (py::len(tuple) != 4) B2FATAL("UnaryBooleanNode tuple has to have length 4." << LogVar("actual length", py::len(tuple)));
        Nodetuple child = static_cast<const py::tuple>(tuple[1]);
        bool negation = py::extract<bool>(tuple[2]);
        bool bracketized = py::extract<bool>(tuple[3]);
        return std::unique_ptr<const AbstractBooleanNode<AVariableManager>>(new UnaryBooleanNode<AVariableManager>(child, negation,
               bracketized));
 
      } else if (node_type == NodeType::BinaryBooleanNode) {
        if (py::len(tuple) != 4) B2FATAL("BinaryBooleanNode tuple has to have length 4." << LogVar("actual length", py::len(tuple)));
        Nodetuple left_node = static_cast<const py::tuple>(tuple[1]);
        Nodetuple right_node = static_cast<const py::tuple>(tuple[2]);
        BooleanOperator boperator = static_cast<BooleanOperator>(static_cast<int>(py::extract<int>(tuple[3])));
        return std::unique_ptr<const AbstractBooleanNode<AVariableManager>>(new BinaryBooleanNode<AVariableManager>(left_node, right_node,
               boperator));
      } else if (node_type == NodeType::UnaryRelationalNode) {
        if (py::len(tuple) != 2) B2FATAL("UnaryRelationalNode tuple has to have length 2." << LogVar("actual length", py::len(tuple)));
        Nodetuple node = static_cast<const py::tuple>(tuple[1]);
        return std::unique_ptr<const AbstractBooleanNode<AVariableManager>>(new UnaryRelationalNode<AVariableManager>(node));
      } else if (node_type == NodeType::BinaryRelationalNode) {
        if (py::len(tuple) != 4) B2FATAL("BinaryRelationalNode tuple has to have length 4." << LogVar("actual length", py::len(tuple)));
        Nodetuple left_node = static_cast<const py::tuple>(tuple[1]);
        Nodetuple right_node = static_cast<const py::tuple>(tuple[2]);
        ComparisonOperator coperator = static_cast<ComparisonOperator>(static_cast<int>(py::extract<int>(tuple[3])));
        return std::unique_ptr<const AbstractBooleanNode<AVariableManager>>(new BinaryRelationalNode<AVariableManager>(left_node,
               right_node, coperator));
      } else if (node_type == NodeType::TernaryRelationalNode) {
        if (py::len(tuple) != 6) B2FATAL("TernaryRelationalNode tuple has to have length 6." << LogVar("actual length", py::len(tuple)));
        Nodetuple left_node = static_cast<const py::tuple>(tuple[1]);
        Nodetuple center_node = static_cast<const py::tuple>(tuple[2]);
        Nodetuple right_node = static_cast<const py::tuple>(tuple[3]);
        ComparisonOperator lc_coperator = static_cast<ComparisonOperator>(static_cast<int>(py::extract<int>(tuple[4])));
        ComparisonOperator cr_coperator = static_cast<ComparisonOperator>(static_cast<int>(py::extract<int>(tuple[5])));
 
        return std::unique_ptr<const AbstractBooleanNode<AVariableManager>>(new TernaryRelationalNode<AVariableManager>(left_node,
               center_node, right_node,
               lc_coperator, cr_coperator));
      } else {
        throw std::runtime_error("error NodeFactory::compile_boolean_node: got invalid boolean NodeType.");
      }
    }

compile_expression_node()

static std::unique_ptr< const AbstractExpressionNode< AVariableManager > > compile_expression_node ( Nodetuple  tuple )

inlinestatic

This template function creates a ExpressionNode from a boost::python::tuple The Python Parser encodes the node type as int in the first argument of each tuple.

Node types are decoded via the NodeType enum defined in framework/utilities/include/AbstractNodes.h e.g (9, 1.2) is a DataNode<double> with value 1.2 List of Nodes:

• UnaryExpressionNode
• BinaryExpressionNode
• DataNode<double>
• DataNode<int>
• DataNode<bool>

Definition at line 141 of file NodeFactory.h.

    {
      if (py::len(tuple) == 0) B2FATAL("ExpressionNode tuple is empty, this is invalid.");
 
      // int is extracted from the py::tuple and cast as NodeTuple enum
      NodeType node_type = static_cast<NodeType>(static_cast<int>(py::extract<int>(tuple[0])));
      if (node_type == NodeType::UnaryExpressionNode) {
        if (py::len(tuple) != 4) B2FATAL("UnaryExpression nodetuple has to have length 4." << LogVar("actual length", py::len(tuple)));
        Nodetuple node = static_cast<const py::tuple>(tuple[1]);
        bool unary_minus = py::extract<bool>(tuple[2]);
        bool parenthesized = py::extract<bool>(tuple[3]);
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new UnaryExpressionNode<AVariableManager>(node,
               unary_minus, parenthesized));
      } else if (node_type == NodeType::BinaryExpressionNode) {
        if (py::len(tuple) != 4) B2FATAL("BinaryExpression nodetuple has to have length 4." << LogVar("actual length", py::len(tuple)));
        Nodetuple left_node = static_cast<const py::tuple>(tuple[1]);
        Nodetuple right_node = static_cast<const py::tuple>(tuple[2]);
        ArithmeticOperation aoperation = static_cast<ArithmeticOperation>(static_cast<int>(py::extract<int>(tuple[3])));
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new BinaryExpressionNode<AVariableManager>(left_node,
               right_node,
               aoperation));
      } else if (node_type == NodeType::IntegerNode) {
        if (py::len(tuple) != 2) B2FATAL("IntegerNode nodetuple has to have length 2." << LogVar("actual length", py::len(tuple)));
        double d = py::extract<double>(tuple[1]);
        if (std::numeric_limits<int>::min() <= d && d <= std::numeric_limits<int>::max()) {
          int i = py::extract<int>(tuple[1]);
          return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, int>(i));
        } else {
          B2WARNING("Overflow for integer constant in cut detected. Create Double Node instead.");
          return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, double>(d));
        }
      } else if (node_type == NodeType::DoubleNode) {
        if (py::len(tuple) != 2) B2FATAL("DoubleNode nodetuple has to have length 2." << LogVar("actual length", py::len(tuple)));
        // We have to check for inf and nan values.
        // use python math functions to check
        py::object math = py::import("math");
        // Get tuple item as object
        py::object data = static_cast<py::object>(tuple[1]);
        if (py::extract<bool>(math.attr("isinf")(data))) {
          // Extract sign of inf float object
          double inf_sign = py::extract<double>(math.attr("copysign")(1.0, data));
          double inf;
          if (inf_sign > 0) {
            inf = std::numeric_limits<double>::infinity();
          } else {
            inf = -1 * std::numeric_limits<double>::infinity();
          }
          return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, double>(inf));
        }
        if (py::extract<bool>(math.attr("isnan")(data))) {
          double nan = std::nan("");
          return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, double>(nan));
        }
        double d = py::extract<double>(tuple[1]);
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, double>(d));
      } else if (node_type == NodeType::BooleanNode) {
        if (py::len(tuple) != 2) B2FATAL("BooleanNode nodetuple has to have length 2." << LogVar("actual length", py::len(tuple)));
        bool b = py::extract<bool>(tuple[1]);
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new DataNode<AVariableManager, bool>(b));
      } else if (node_type == NodeType::IdentifierNode) {
        if (py::len(tuple) != 2) B2FATAL("IdentifierNode nodetuple has to have length 2." << LogVar("actual length", py::len(tuple)));
        std::string identifier = py::extract<std::string>(tuple[1]);
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new IdentifierNode<AVariableManager>(identifier));
      } else if (node_type == NodeType::FunctionNode) {
        if (py::len(tuple) != 3) B2FATAL("FunctionNode nodetuple has to have length 3." << LogVar("actual length", py::len(tuple)));
 
        // Extract functionName as second argument of the tuple
        std::string functionName = py::extract<std::string>(tuple[1]);
 
        // Extract argument tuple
        std::string argument = py::extract<std::string>(tuple[2]);
        boost::algorithm::trim(argument);
        // Define vector for function arguments
        std::vector<std::string> functionArguments = splitOnDelimiterAndConserveParenthesis(argument, ',', '(', ')');
        for (auto& str : functionArguments) {
          boost::algorithm::trim(str);
          if (str.empty()) {
            B2WARNING("Empty parameter for metavariable '" << functionName << "' in cut.");
          }
        }
 
        return std::unique_ptr<const AbstractExpressionNode<AVariableManager>>(new FunctionNode<AVariableManager>(functionName,
               functionArguments));
      } else {
        throw std::runtime_error("error NodeFactory::compile_expression_node: got invalid expression NodeType.");
      }
    }

---

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

• framework/utilities/include/NodeFactory.h