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   _GLIBCXX_DEBUG_ONLY(assert_valid();)
  53   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
  54   if (other.m_size == 0)
  55     return false;
  56
  57   if (m_size == 0)
  58     {
  59       value_swap(other);
  60       return false;
  61     }
  62
  63   const bool greater = Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), PB_DS_V2F(other.m_p_head->m_p_left->m_value));
  64
  65   const bool lesser = Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value), PB_DS_V2F(m_p_head->m_p_left->m_value));
  66
  67   if (!greater && !lesser)
  68     __throw_join_error();
  69
  70   if (lesser)
  71     value_swap(other);
  72
  73   m_size += other.m_size;
  74   _GLIBCXX_DEBUG_ONLY(map_debug_base::join(other);)
  75   return true;
  76 }
  77
  78 PB_DS_CLASS_T_DEC
  79 void
  80 PB_DS_CLASS_C_DEC::
  81 join_finish(PB_DS_CLASS_C_DEC& other)
  82 {
  83   initialize_min_max();
  84   other.initialize();
  85 }
  86
  87 PB_DS_CLASS_T_DEC
  88 bool
  89 PB_DS_CLASS_C_DEC::
  90 split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
  91 {
  92   _GLIBCXX_DEBUG_ONLY(assert_valid();)
  93   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
  94   other.clear();
  95
  96   if (m_size == 0)
  97     {
  98       _GLIBCXX_DEBUG_ONLY(assert_valid();)
  99       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
 100       return false;
 101     }
 102
 103   if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
 104     {
 105       value_swap(other);
 106       _GLIBCXX_DEBUG_ONLY(assert_valid();)
 107       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
 108       return false;
 109     }
 110
 111   if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))
 112     {
 113       _GLIBCXX_DEBUG_ONLY(assert_valid();)
 114       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
 115       return false;
 116     }
 117
 118   if (m_size == 1)
 119     {
 120       value_swap(other);
 121       _GLIBCXX_DEBUG_ONLY(assert_valid();)
 122       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
 123       return false;
 124     }
 125
 126   _GLIBCXX_DEBUG_ONLY(map_debug_base::split(r_key,(Cmp_Fn& )(*this), other);)
 127   return true;
 128 }
 129
 130 PB_DS_CLASS_T_DEC
 131 void
 132 PB_DS_CLASS_C_DEC::
 133 split_finish(PB_DS_CLASS_C_DEC& other)
 134 {
 135   other.initialize_min_max();
 136   other.m_size = std::distance(other.begin(), other.end());
 137   m_size -= other.m_size;
 138   initialize_min_max();
 139   _GLIBCXX_DEBUG_ONLY(assert_valid();)
 140   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
 141 }
 142
 143 PB_DS_CLASS_T_DEC
 144 typename PB_DS_CLASS_C_DEC::size_type
 145 PB_DS_CLASS_C_DEC::
 146 recursive_count(node_pointer p) const
 147 {
 148   if (p == NULL)
 149     return 0;
 150   return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right);
 151 }
 152