ACE/ACEXML/parser/debug_validator/Element_Tree.inl

   1 ACEXML_INLINE
   2 ACEXML_Element_Tree_Node::ACEXML_Element_Tree_Node ()
   3   : next_ (0)
   4 {
   5 }
   6
   7 ACEXML_INLINE ACEXML_Element_Tree_Node *
   8 ACEXML_Element_Tree_Node::next ()
   9 {
  10   return this->next_;
  11 }
  12
  13 ACEXML_INLINE void
  14 ACEXML_Element_Tree_Node::next (ACEXML_Element_Tree_Node * n)
  15 {
  16   this->next_ = n;
  17 }
  18
  19 ACEXML_INLINE
  20 ACEXML_Element_Tree_Name_Node::ACEXML_Element_Tree_Name_Node (const ACEXML_Char *name,
  21                                                               int release)
  22   : name_ (name, 0, release)
  23 {
  24 }
  25
  26 ACEXML_INLINE void
  27 ACEXML_Element_Tree_Name_Node::set (const ACEXML_Char *name,
  28                                     int release)
  29 {
  30   this->name_.set (name, release);
  31 }
  32
  33 ACEXML_INLINE
  34 ACEXML_Element_Tree_List_Node::ACEXML_Element_Tree_List_Node (void)
  35   : type_ (SEQUENCE),
  36     head_ (0),
  37     tail_ (0),
  38     pop_next_ (0)
  39 {
  40 }
  41
  42 ACEXML_INLINE ACEXML_Element_Tree_List_Node::LIST_TYPE
  43 ACEXML_Element_Tree_List_Node::get (void)
  44 {
  45   return this->type_;
  46 }
  47
  48 ACEXML_INLINE int
  49 ACEXML_Element_Tree_List_Node::set (ACEXML_Element_Tree_List_Node::LIST_TYPE type)
  50 {
  51   this->type_ = type;
  52   return 0;
  53 }
  54
  55 ACEXML_INLINE
  56 ACEXML_Element_Tree_List_Stack::ACEXML_Element_Tree_List_Stack (void)
  57   : top_ (0)
  58 {
  59 }
  60
  61 ACEXML_INLINE ACEXML_Element_Tree_List_Node *
  62 ACEXML_Element_Tree_List_Stack::top ()
  63 {
  64   return this->top_;
  65 }
  66
  67 ACEXML_INLINE  void
  68 ACEXML_Element_Tree_List_Stack::push (ACEXML_Element_Tree_List_Node *n)
  69 {
  70   n->pop_next_ = this->top_;
  71   this->top_ = n;
  72 }
  73
  74 ACEXML_INLINE ACEXML_Element_Tree_List_Node *
  75 ACEXML_Element_Tree_List_Stack::pop ()
  76 {
  77   if (this->top_ != 0)
  78     {
  79       ACEXML_Element_Tree_List_Node *ptr = this->top_;
  80       this->top_ = this->top_->pop_next_;
  81       return ptr;
  82     }
  83   return 0;
  84 }
  85
  86 ACEXML_INLINE int
  87 ACEXML_Element_Tree_List_Stack::empty ()
  88 {
  89   return this->top_ == 0;
  90 }