symbol.cpp

   1 #include <fridh/symbol_tree_node.hpp>
   2 #include <boost/foreach.hpp>
   3
   4 namespace fridh
   5 {
   6         symbol_tree_node::symbol_tree_node():
   7                 parent(0)
   8         {
   9         }
  10
  11         symbol_tree_node::symbol_tree_node(symbol::type type):
  12                 type(type),
  13                 parent(0)
  14         {
  15                 switch(type)
  16                 {
  17                         case variable::variable:
  18                                 variable_pointer = new variable;
  19                                 break;
  20
  21                         case variable::function:
  22                                 function_pointer = new function;
  23                                 break;
  24
  25                         case variable::class_symbol:
  26                                 class_pointer = new class_type;
  27                                 break;
  28                 }
  29         }
  30
  31         symbol_tree_node::~symbol_tree_node()
  32         {
  33                 BOOST_FOREACH(symbol_tree_node * i, children)
  34                         delete i;
  35
  36                 switch(type)
  37                 {
  38                         case variable::variable:
  39                                 delete variable_pointer;
  40                                 break;
  41
  42                         case variable::function:
  43                                 delete function_pointer;
  44                                 break;
  45
  46                         case variable::class_symbol:
  47                                 delete class_pointer;
  48                                 break;
  49
  50                         case variable::module:
  51                                 delete module_pointer;
  52                                 break;
  53                 }
  54         }
  55
  56         bool symbol_tree_node::exists(std::string const & name)
  57         {
  58                 node_children::iterator iterator = children.find(name);
  59                 return iterator != children.end();
  60         }
  61
  62         bool symbol_tree_node::find_entity(std::string const & name, symbol_tree_node * & output)
  63         {
  64                 node_children::iterator iterator = children.find(name);
  65                 if(iterator == children.end())
  66                 {
  67                         if(parent == 0)
  68                                 return false;
  69                         return parent->find_entity(name, output);
  70                 }
  71
  72                 output = &iterator->second;
  73                 return true;
  74         }
  75 }