old-autovect-branch/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  19 // USA.
  20
  21 // As a special exception, you may use this file as part of a free software
  22 // library without restriction.  Specifically, if other files instantiate
  23 // templates or use macros or inline functions from this file, or you compile
  24 // this file and link it with other files to produce an executable, this
  25 // file does not by itself cause the resulting executable to be covered by
  26 // the GNU General Public License.  This exception does not however
  27 // invalidate any other reasons why the executable file might be covered by
  28 // the GNU General Public License.
  29
  30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  31
  32 // Permission to use, copy, modify, sell, and distribute this software
  33 // is hereby granted without fee, provided that the above copyright
  34 // notice appears in all copies, and that both that copyright notice and
  35 // this permission notice appear in supporting documentation. None of
  36 // the above authors, nor IBM Haifa Research Laboratories, make any
  37 // representation about the suitability of this software for any
  38 // purpose. It is provided "as is" without express or implied warranty.
  39
  40 /**
  41  * @file node_iterators.hpp
  42  * Contains an implementation class for ov_tree_.
  43  */
  44
  45 class const_node_iterator
  46 {
  47
  48 public:
  49
  50   typedef trivial_iterator_tag iterator_category;
  51
  52   typedef trivial_iterator_difference_type difference_type;
  53
  54   typedef const_iterator value_type;
  55
  56   typedef const_iterator*  pointer;
  57
  58   typedef const_iterator*  const_pointer;
  59
  60   typedef const_iterator&  reference;
  61
  62   typedef const iterator&  const_reference;
  63
  64 public:
  65   inline
  66   const_node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : m_p_value(p_nd),
  67                                                                                                                    m_p_begin_value(p_begin_nd),
  68                                                                                                                    m_p_end_value(p_end_nd)
  69   { }
  70
  71   inline const_iterator
  72   operator*() const
  73   {
  74     return (m_p_value);
  75   }
  76
  77   inline const_node_iterator
  78   l_child() const
  79   {
  80     if (m_p_begin_value == m_p_value)
  81       return (const_node_iterator(m_p_begin_value, m_p_begin_value, m_p_begin_value));
  82
  83     return (const_node_iterator(
  84                                 mid_pointer(m_p_begin_value, m_p_value),
  85                                 m_p_begin_value,
  86                                 m_p_value));
  87   }
  88
  89   inline const_node_iterator
  90   r_child() const
  91   {
  92     if (m_p_value == m_p_end_value)
  93       return (const_node_iterator(m_p_end_value, m_p_end_value, m_p_end_value));
  94
  95     return (const_node_iterator(
  96                                 mid_pointer(m_p_value + 1, m_p_end_value),
  97                                 m_p_value + 1,
  98                                 m_p_end_value));
  99   }
 100
 101   inline bool
 102   operator==(const const_node_iterator& r_other) const
 103   {
 104     const bool is_end = m_p_begin_value == m_p_end_value;
 105     const bool is_other_end = r_other.m_p_begin_value == r_other.m_p_end_value;
 106
 107     if (is_end)
 108       return (is_other_end);
 109
 110     if (is_other_end)
 111       return (is_end);
 112
 113     if (r_other.m_p_begin_value == r_other.m_p_end_value)
 114       return (m_p_begin_value == m_p_end_value);
 115
 116     return (m_p_value == r_other.m_p_value);
 117   }
 118
 119   inline bool
 120   operator!=(const const_node_iterator& r_other) const
 121   {
 122     return (!operator==(r_other));
 123   }
 124
 125 private:
 126   friend class PB_ASSOC_CLASS_C_DEC;
 127
 128 public:
 129   value_pointer m_p_value;
 130   value_pointer m_p_begin_value;
 131   value_pointer m_p_end_value;
 132 };
 133
 134 class node_iterator :
 135   public const_node_iterator
 136
 137 {
 138
 139 public:
 140   inline
 141   node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : const_node_iterator(p_nd, p_begin_nd, p_end_nd)
 142   { }
 143
 144   inline iterator
 145   operator*() const
 146   {
 147     return (iterator(const_node_iterator::m_p_value));
 148   }
 149
 150   inline node_iterator
 151   l_child() const
 152   {
 153     if (const_node_iterator::m_p_begin_value == const_node_iterator::m_p_value)
 154       return (node_iterator(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value));
 155
 156     return (node_iterator(
 157                           mid_pointer(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_value),
 158                           const_node_iterator::m_p_begin_value,
 159                           const_node_iterator::m_p_value));
 160   }
 161
 162   inline node_iterator
 163   r_child() const
 164   {
 165     if (const_node_iterator::m_p_value == const_node_iterator::m_p_end_value)
 166       return (node_iterator(const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value));
 167
 168     return (node_iterator(
 169                           mid_pointer(const_node_iterator::m_p_value + 1, const_node_iterator::m_p_end_value),
 170                           const_node_iterator::m_p_value + 1,
 171                           const_node_iterator::m_p_end_value));
 172   }
 173
 174 private:
 175
 176   friend class PB_ASSOC_CLASS_C_DEC;
 177 };
 178