symbol.cpp

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