1169691Skan// -*- C++ -*-
2169691Skan
3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
4169691Skan//
5169691Skan// This file is part of the GNU ISO C++ Library.  This library is free
6169691Skan// software; you can redistribute it and/or modify it under the terms
7169691Skan// of the GNU General Public License as published by the Free Software
8169691Skan// Foundation; either version 2, or (at your option) any later
9169691Skan// version.
10169691Skan
11169691Skan// This library is distributed in the hope that it will be useful, but
12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of
13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14169691Skan// General Public License for more details.
15169691Skan
16169691Skan// You should have received a copy of the GNU General Public License
17169691Skan// along with this library; see the file COPYING.  If not, write to
18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19169691Skan// MA 02111-1307, USA.
20169691Skan
21169691Skan// As a special exception, you may use this file as part of a free
22169691Skan// software library without restriction.  Specifically, if other files
23169691Skan// instantiate templates or use macros or inline functions from this
24169691Skan// file, or you compile this file and link it with other files to
25169691Skan// produce an executable, this file does not by itself cause the
26169691Skan// resulting executable to be covered by the GNU General Public
27169691Skan// License.  This exception does not however invalidate any other
28169691Skan// reasons why the executable file might be covered by the GNU General
29169691Skan// Public License.
30169691Skan
31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32169691Skan
33169691Skan// Permission to use, copy, modify, sell, and distribute this software
34169691Skan// is hereby granted without fee, provided that the above copyright
35169691Skan// notice appears in all copies, and that both that copyright notice
36169691Skan// and this permission notice appear in supporting documentation. None
37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any
38169691Skan// representation about the suitability of this software for any
39169691Skan// purpose. It is provided "as is" without express or implied
40169691Skan// warranty.
41169691Skan
42169691Skan/**
43169691Skan * @file split_join_fn_imps.hpp
44169691Skan * Contains an implementation class for bin_search_tree_.
45169691Skan */
46169691Skan
47169691SkanPB_DS_CLASS_T_DEC
48169691Skanbool
49169691SkanPB_DS_CLASS_C_DEC::
50169691Skanjoin_prep(PB_DS_CLASS_C_DEC& other)
51169691Skan{
52169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid();)
53169691Skan  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
54169691Skan  if (other.m_size == 0)
55169691Skan    return false;
56169691Skan
57169691Skan  if (m_size == 0)
58169691Skan    {
59169691Skan      value_swap(other);
60169691Skan      return false;
61169691Skan    }
62169691Skan
63169691Skan  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));
64169691Skan
65169691Skan  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));
66169691Skan
67169691Skan  if (!greater && !lesser)
68169691Skan    __throw_join_error();
69169691Skan
70169691Skan  if (lesser)
71169691Skan    value_swap(other);
72169691Skan
73169691Skan  m_size += other.m_size;
74169691Skan  _GLIBCXX_DEBUG_ONLY(map_debug_base::join(other);)
75169691Skan  return true;
76169691Skan}
77169691Skan
78169691SkanPB_DS_CLASS_T_DEC
79169691Skanvoid
80169691SkanPB_DS_CLASS_C_DEC::
81169691Skanjoin_finish(PB_DS_CLASS_C_DEC& other)
82169691Skan{
83169691Skan  initialize_min_max();
84169691Skan  other.initialize();
85169691Skan}
86169691Skan
87169691SkanPB_DS_CLASS_T_DEC
88169691Skanbool
89169691SkanPB_DS_CLASS_C_DEC::
90169691Skansplit_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
91169691Skan{
92169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid();)
93169691Skan  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
94169691Skan  other.clear();
95169691Skan
96169691Skan  if (m_size == 0)
97169691Skan    {
98169691Skan      _GLIBCXX_DEBUG_ONLY(assert_valid();)
99169691Skan      _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
100169691Skan      return false;
101169691Skan    }
102169691Skan
103169691Skan  if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
104169691Skan    {
105169691Skan      value_swap(other);
106169691Skan      _GLIBCXX_DEBUG_ONLY(assert_valid();)
107169691Skan      _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
108169691Skan      return false;
109169691Skan    }
110169691Skan
111169691Skan  if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))
112169691Skan    {
113169691Skan      _GLIBCXX_DEBUG_ONLY(assert_valid();)
114169691Skan      _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
115169691Skan      return false;
116169691Skan    }
117169691Skan
118169691Skan  if (m_size == 1)
119169691Skan    {
120169691Skan      value_swap(other);
121169691Skan      _GLIBCXX_DEBUG_ONLY(assert_valid();)
122169691Skan      _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
123169691Skan      return false;
124169691Skan    }
125169691Skan
126169691Skan  _GLIBCXX_DEBUG_ONLY(map_debug_base::split(r_key,(Cmp_Fn& )(*this), other);)
127169691Skan  return true;
128169691Skan}
129169691Skan
130169691SkanPB_DS_CLASS_T_DEC
131169691Skanvoid
132169691SkanPB_DS_CLASS_C_DEC::
133169691Skansplit_finish(PB_DS_CLASS_C_DEC& other)
134169691Skan{
135169691Skan  other.initialize_min_max();
136169691Skan  other.m_size = std::distance(other.begin(), other.end());
137169691Skan  m_size -= other.m_size;
138169691Skan  initialize_min_max();
139169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid();)
140169691Skan  _GLIBCXX_DEBUG_ONLY(other.assert_valid();)
141169691Skan}
142169691Skan
143169691SkanPB_DS_CLASS_T_DEC
144169691Skantypename PB_DS_CLASS_C_DEC::size_type
145169691SkanPB_DS_CLASS_C_DEC::
146169691Skanrecursive_count(node_pointer p) const
147169691Skan{
148169691Skan  if (p == NULL)
149169691Skan    return 0;
150169691Skan  return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right);
151169691Skan}
152169691Skan
153