Home | History | Annotate | Download | only in bin_search_tree_ 
      1 // -*- C++ -*-
      2 
      3 // Copyright (C) 2005, 2006, 2009, 2010 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 3, 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 // Under Section 7 of GPL version 3, you are granted additional
     17 // permissions described in the GCC Runtime Library Exception, version
     18 // 3.1, as published by the Free Software Foundation.
     19 
     20 // You should have received a copy of the GNU General Public License and
     21 // a copy of the GCC Runtime Library Exception along with this program;
     22 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
     23 // <http://www.gnu.org/licenses/>.
     24 
     25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
     26 
     27 // Permission to use, copy, modify, sell, and distribute this software
     28 // is hereby granted without fee, provided that the above copyright
     29 // notice appears in all copies, and that both that copyright notice
     30 // and this permission notice appear in supporting documentation. None
     31 // of the above authors, nor IBM Haifa Research Laboratories, make any
     32 // representation about the suitability of this software for any
     33 // purpose. It is provided "as is" without express or implied
     34 // warranty.
     35 
     36 /**
     37  * @file split_join_fn_imps.hpp
     38  * Contains an implementation class for bin_search_tree_.
     39  */
     40 
     41 PB_DS_CLASS_T_DEC
     42 bool
     43 PB_DS_CLASS_C_DEC::
     44 join_prep(PB_DS_CLASS_C_DEC& other)
     45 {
     46   _GLIBCXX_DEBUG_ONLY(assert_valid();)
     47   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
     48   if (other.m_size == 0)
     49     return false;
     50 
     51   if (m_size == 0)
     52     {
     53       value_swap(other);
     54       return false;
     55     }
     56 
     57   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));
     58 
     59   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));
     60 
     61   if (!greater && !lesser)
     62     __throw_join_error();
     63 
     64   if (lesser)
     65     value_swap(other);
     66 
     67   m_size += other.m_size;
     68   _GLIBCXX_DEBUG_ONLY(debug_base::join(other);)
     69   return true;
     70 }
     71 
     72 PB_DS_CLASS_T_DEC
     73 void
     74 PB_DS_CLASS_C_DEC::
     75 join_finish(PB_DS_CLASS_C_DEC& other)
     76 {
     77   initialize_min_max();
     78   other.initialize();
     79 }
     80 
     81 PB_DS_CLASS_T_DEC
     82 bool
     83 PB_DS_CLASS_C_DEC::
     84 split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
     85 {
     86   _GLIBCXX_DEBUG_ONLY(assert_valid();)
     87   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
     88   other.clear();
     89 
     90   if (m_size == 0)
     91     {
     92       _GLIBCXX_DEBUG_ONLY(assert_valid();)
     93       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
     94       return false;
     95     }
     96 
     97   if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
     98     {
     99       value_swap(other);
    100       _GLIBCXX_DEBUG_ONLY(assert_valid();)
    101       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
    102       return false;
    103     }
    104 
    105   if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))
    106     {
    107       _GLIBCXX_DEBUG_ONLY(assert_valid();)
    108       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
    109       return false;
    110     }
    111 
    112   if (m_size == 1)
    113     {
    114       value_swap(other);
    115       _GLIBCXX_DEBUG_ONLY(assert_valid();)
    116       _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
    117       return false;
    118     }
    119 
    120   _GLIBCXX_DEBUG_ONLY(debug_base::split(r_key,(Cmp_Fn& )(*this), other);)
    121   return true;
    122 }
    123 
    124 PB_DS_CLASS_T_DEC
    125 void
    126 PB_DS_CLASS_C_DEC::
    127 split_finish(PB_DS_CLASS_C_DEC& other)
    128 {
    129   other.initialize_min_max();
    130   other.m_size = std::distance(other.begin(), other.end());
    131   m_size -= other.m_size;
    132   initialize_min_max();
    133   _GLIBCXX_DEBUG_ONLY(assert_valid();)
    134   _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
    135 }
    136 
    137 PB_DS_CLASS_T_DEC
    138 typename PB_DS_CLASS_C_DEC::size_type
    139 PB_DS_CLASS_C_DEC::
    140 recursive_count(node_pointer p) const
    141 {
    142   if (p == 0)
    143     return 0;
    144   return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right);
    145 }
    146 
    147