libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006 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 terms
   7 // of the GNU General Public License as published by the Free Software
   8 // Foundation; either version 2, or (at your option) any later
   9 // version.
  10
  11 // This library is distributed in the hope that it will be useful, but
  12 // WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 // General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License
  17 // along with this library; see the file COPYING.  If not, write to
  18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
  19 // MA 02111-1307, USA.
  20
  21 // As a special exception, you may use this file as part of a free
  22 // software library without restriction.  Specifically, if other files
  23 // instantiate templates or use macros or inline functions from this
  24 // file, or you compile this file and link it with other files to
  25 // produce an executable, this file does not by itself cause the
  26 // resulting executable to be covered by the GNU General Public
  27 // License.  This exception does not however invalidate any other
  28 // reasons why the executable file might be covered by the GNU General
  29 // Public License.
  30
  31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  32
  33 // Permission to use, copy, modify, sell, and distribute this software
  34 // is hereby granted without fee, provided that the above copyright
  35 // notice appears in all copies, and that both that copyright notice
  36 // and this permission notice appear in supporting documentation. None
  37 // of the above authors, nor IBM Haifa Research Laboratories, make any
  38 // representation about the suitability of this software for any
  39 // purpose. It is provided "as is" without express or implied
  40 // warranty.
  41
  42 /**
  43  * @file split_join_fn_imps.hpp
  44  * Contains an implementation class for bin_search_tree_.
  45  */
  46
  47 PB_DS_CLASS_T_DEC
  48 bool
  49 PB_DS_CLASS_C_DEC::
  50 join_prep(PB_DS_CLASS_C_DEC& other)
  51 {
  52   PB_DS_DBG_ONLY(assert_valid();)
  53     PB_DS_DBG_ONLY(other.assert_valid();)
  54
  55     if (other.m_size == 0)
  56       return (false);
  57
  58   if (m_size == 0)
  59     {
  60       value_swap(other);
  61
  62       return (false);
  63     }
  64
  65   const bool greater = Cmp_Fn::operator()(
  66                                           PB_DS_V2F(m_p_head->m_p_right->m_value),
  67                                           PB_DS_V2F(other.m_p_head->m_p_left->m_value));
  68
  69   const bool lesser = Cmp_Fn::operator()(
  70                                          PB_DS_V2F(other.m_p_head->m_p_right->m_value),
  71                                          PB_DS_V2F(m_p_head->m_p_left->m_value));
  72
  73   if (!greater&&  !lesser)
  74     throw join_error();
  75
  76   if (lesser)
  77     value_swap(other);
  78
  79   m_size += other.m_size;
  80
  81   PB_DS_DBG_ONLY(map_debug_base::join(other);)
  82
  83     return (true);
  84 }
  85
  86 PB_DS_CLASS_T_DEC
  87 void
  88 PB_DS_CLASS_C_DEC::
  89 join_finish(PB_DS_CLASS_C_DEC& other)
  90 {
  91   initialize_min_max();
  92
  93   other.initialize();
  94 }
  95
  96 PB_DS_CLASS_T_DEC
  97 bool
  98 PB_DS_CLASS_C_DEC::
  99 split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
 100 {
 101   PB_DS_DBG_ONLY(assert_valid();)
 102     PB_DS_DBG_ONLY(other.assert_valid();)
 103
 104     other.clear();
 105
 106   if (m_size == 0)
 107     {
 108       PB_DS_DBG_ONLY(assert_valid();)
 109         PB_DS_DBG_ONLY(other.assert_valid();)
 110
 111         return (false);
 112     }
 113
 114   if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
 115     {
 116       value_swap(other);
 117
 118       PB_DS_DBG_ONLY(assert_valid();)
 119         PB_DS_DBG_ONLY(other.assert_valid();)
 120
 121         return (false);
 122     }
 123
 124   if (!Cmp_Fn::operator()(
 125                           r_key,
 126                           PB_DS_V2F(m_p_head->m_p_right->m_value)))
 127     {
 128       PB_DS_DBG_ONLY(assert_valid();)
 129         PB_DS_DBG_ONLY(other.assert_valid();)
 130
 131         return (false);
 132     }
 133
 134   if (m_size == 1)
 135     {
 136       value_swap(other);
 137
 138       PB_DS_DBG_ONLY(assert_valid();)
 139         PB_DS_DBG_ONLY(other.assert_valid();)
 140
 141         return (false);
 142     }
 143
 144   PB_DS_DBG_ONLY(map_debug_base::split(
 145                                        r_key,(Cmp_Fn& )(*this),
 146                                        other);)
 147
 148     return (true);
 149 }
 150
 151 PB_DS_CLASS_T_DEC
 152 void
 153 PB_DS_CLASS_C_DEC::
 154 split_finish(PB_DS_CLASS_C_DEC& other)
 155 {
 156   other.initialize_min_max();
 157
 158   other.m_size =
 159     std::distance(other.begin(), other.end());
 160
 161   m_size -= other.m_size;
 162
 163   initialize_min_max();
 164
 165   PB_DS_DBG_ONLY(assert_valid();)
 166     PB_DS_DBG_ONLY(other.assert_valid();)
 167     }
 168
 169 PB_DS_CLASS_T_DEC
 170 typename PB_DS_CLASS_C_DEC::size_type
 171 PB_DS_CLASS_C_DEC::
 172 recursive_count(node_pointer p_nd) const
 173 {
 174   if (p_nd == NULL)
 175     return (0);
 176
 177   return (1 +
 178           recursive_count(p_nd->m_p_left) +
 179           recursive_count(p_nd->m_p_right));
 180 }
 181