MADARA  3.2.3
CompositeLessThanNode.cpp
Go to the documentation of this file.
1 /* -*- C++ -*- */
2 
3 #ifndef _COMPOSITE_LESS_THAN_NODE_CPP_
4 #define _COMPOSITE_LESS_THAN_NODE_CPP_
5 
6 #ifndef _MADARA_NO_KARL_
7 
8 #include <iostream>
9 
14 
17 : madara::expression::CompositeBinaryNode (logger, left, right)
18 {
19 }
20 
23 {
25  record.set_value ("<");
26  return record;
27 }
28 
29 
35 {
36  bool left_child_can_change = false;
37  bool right_child_can_change = false;
40 
41  if (this->left_)
42  {
43  left_value = this->left_->prune (left_child_can_change);
44  if (!left_child_can_change && dynamic_cast <LeafNode *> (left_) == 0)
45  {
46  delete this->left_;
47  this->left_ = new LeafNode (*(this->logger_), left_value);
48  }
49  }
50  else
51  {
53  "madara::expression::CompositeLessThanNode: "
54  "KARL COMPILE ERROR: Less-than has no left expression\n");
55 
56  throw KarlException ("madara::expression::CompositeLessThanNode: "
57  "KARL COMPILE ERROR: "
58  "Node has no right expression\n");
59  }
60 
61  if (this->right_)
62  {
63  right_value = this->right_->prune (right_child_can_change);
64  if (!right_child_can_change && dynamic_cast <LeafNode *> (right_) == 0)
65  {
66  delete this->right_;
67  this->right_ = new LeafNode (*(this->logger_), right_value);
68  }
69  }
70  else
71  {
73  "madara::expression::CompositeLessThanNode: "
74  "KARL COMPILE ERROR: Less-than has no right expression\n");
75 
76  throw KarlException ("madara::expression::CompositeLessThanNode: "
77  "KARL COMPILE ERROR: "
78  "Node has no right expression\n");
79  }
80 
81  can_change = left_child_can_change || right_child_can_change;
82 
84  left_value < right_value);
85 }
86 
92 {
94  left_->evaluate (settings) < right_->evaluate (settings));
95 }
96 
97 
98 // accept a visitor
99 void
101 {
102  visitor.visit (*this);
103 }
104 
105 #endif // _MADARA_NO_KARL_
106 
107 #endif /* _COMPOSITE_LESS_THAN_NODE_CPP_ */
This class encapsulates an entry in a KnowledgeBase.
virtual madara::knowledge::KnowledgeRecord prune(bool &can_change)=0
Prunes the expression tree of unnecessary nodes.
virtual madara::knowledge::KnowledgeRecord item(void) const
Returns the printable character of the node.
virtual madara::knowledge::KnowledgeRecord prune(bool &can_change)
Prunes the expression tree of unnecessary nodes.
ComponentNode * right_
Right expression.
madara::knowledge::KnowledgeRecord KnowledgeRecord
CompositeLessThanNode(logger::Logger &logger, ComponentNode *left, ComponentNode *right)
Constructor.
logger::Logger * logger_
handle the context
Definition: ComponentNode.h:97
virtual madara::knowledge::KnowledgeRecord evaluate(const madara::knowledge::KnowledgeUpdateSettings &settings)=0
Evaluates the expression tree.
Defines a left and right node (via inheritance from CompositeUnaryNode).
Defines a node that contains a madara::knowledge::KnowledgeRecord::Integer value. ...
Definition: LeafNode.h:23
Provides knowledge logging services to files and terminals.
Definition: GlobalLogger.h:11
ComponentNode * left_
left expression
A multi-threaded logger for logging to one or more destinations.
Definition: Logger.h:88
void set_value(const KnowledgeRecord &new_value)
Sets the value from another KnowledgeRecord, does not copy clock and write_quality.
#define madara_logger_ptr_log(logger, level,...)
Fast version of the madara::logger::log method for Logger pointers.
Definition: Logger.h:32
virtual void accept(Visitor &visitor) const
Accepts a visitor subclassed from the Visitor class.
An abstract base class defines a simple abstract implementation of an expression tree node...
Definition: ComponentNode.h:36
Abstract base class for all visitors to all classes that derive from ComponentNode.
Definition: Visitor.h:91
An exception for unrecoverable KaRL compilation issues.
Definition: KarlException.h:18
Settings for applying knowledge updates.
virtual void visit(const LeafNode &node)=0
Visit a LeafNode.
Copyright (c) 2015 Carnegie Mellon University.
virtual madara::knowledge::KnowledgeRecord evaluate(const madara::knowledge::KnowledgeUpdateSettings &settings)
Evaluates the expression tree.