MADARA  3.1.8
CompositeInequalityNode.cpp
Go to the documentation of this file.
1 /* -*- C++ -*- */
2 
3 #ifndef _INEQUALITY_NODE_CPP_
4 #define _INEQUALITY_NODE_CPP_
5 
6 #ifndef _MADARA_NO_KARL_
7 
8 #include <iostream>
9 
14 
15 // Ctor
18 : madara::expression::CompositeBinaryNode (logger, left, right)
19 {
20 }
21 
24 {
26  record.set_value ("!=");
27  return record;
28 }
29 
30 
36 {
37  bool left_child_can_change = false;
38  bool right_child_can_change = false;
41 
42  if (this->left_)
43  {
44  left_value = this->left_->prune (left_child_can_change);
45  if (!left_child_can_change && dynamic_cast <LeafNode *> (left_) == 0)
46  {
47  delete this->left_;
48  this->left_ = new LeafNode (*(this->logger_), left_value);
49  }
50  }
51  else
52  {
54  "KARL COMPILE ERROR: Inequality has no left expression\n");
55 
56  exit (-1);
57  }
58 
59  if (this->right_)
60  {
61  right_value = this->right_->prune (right_child_can_change);
62  if (!right_child_can_change && dynamic_cast <LeafNode *> (right_) == 0)
63  {
64  delete this->right_;
65  this->right_ = new LeafNode (*(this->logger_), right_value);
66  }
67  }
68  else
69  {
71  "KARL COMPILE ERROR: Inequality has no right expression\n");
72 
73  exit (-1);
74  }
75 
76  can_change = left_child_can_change || right_child_can_change;
77 
78  return knowledge::KnowledgeRecord (left_value != right_value);
79 }
80 
86 {
88  left_->evaluate (settings) != right_->evaluate (settings));
89 }
90 
91 
92 // accept a visitor
93 void
95 {
96  visitor.visit (*this);
97 }
98 
99 #endif // _MADARA_NO_KARL_
100 
101 #endif /* _INEQUALITY_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 void accept(Visitor &visitor) const
Accepts a visitor subclassed from the Visitor class.
ComponentNode * right_
Right expression.
madara::knowledge::KnowledgeRecord KnowledgeRecord
logger::Logger * logger_
handle the context
Definition: ComponentNode.h:96
virtual madara::knowledge::KnowledgeRecord evaluate(const madara::knowledge::KnowledgeUpdateSettings &settings)
Evaluates the expression tree.
virtual madara::knowledge::KnowledgeRecord evaluate(const madara::knowledge::KnowledgeUpdateSettings &settings)=0
Evaluates the expression tree.
CompositeInequalityNode(logger::Logger &logger, ComponentNode *left, ComponentNode *right)
Constructor.
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.
virtual madara::knowledge::KnowledgeRecord prune(bool &can_change)
Prunes the expression tree of unnecessary nodes.
virtual madara::knowledge::KnowledgeRecord item(void) const
Returns the printable character of the node.
#define madara_logger_ptr_log(logger, level,...)
Fast version of the madara::logger::log method for Logger pointers.
Definition: Logger.h:32
An abstract base class defines a simple abstract implementation of an expression tree node...
Definition: ComponentNode.h:35
Abstract base class for all visitors to all classes that derive from ComponentNode.
Definition: Visitor.h:90
Settings for applying knowledge updates.
virtual void visit(const LeafNode &node)=0
Visit a LeafNode.
Copyright (c) 2015 Carnegie Mellon University.