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 insert_fn_imps.hpp
44169691Skan * Contains an implementation class for left_child_next_sibling_heap_.
45169691Skan */
46169691Skan
47169691SkanPB_DS_CLASS_T_DEC
48169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer
49169691SkanPB_DS_CLASS_C_DEC::
50169691Skanget_new_node_for_insert(const_reference r_val)
51169691Skan{
52169691Skan  return get_new_node_for_insert(r_val, s_no_throw_copies_ind);
53169691Skan}
54169691Skan
55169691SkanPB_DS_CLASS_T_DEC
56169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer
57169691SkanPB_DS_CLASS_C_DEC::
58169691Skanget_new_node_for_insert(const_reference r_val, false_type)
59169691Skan{
60169691Skan  node_pointer p_new_nd = s_node_allocator.allocate(1);
61169691Skan
62169691Skan  cond_dealtor_t cond(p_new_nd);
63169691Skan
64169691Skan  new (const_cast<void* >(
65169691Skan			  static_cast<const void* >(&p_new_nd->m_value)))
66169691Skan    typename node::value_type(r_val);
67169691Skan
68169691Skan  cond.set_no_action();
69169691Skan
70169691Skan  ++m_size;
71169691Skan
72169691Skan  return (p_new_nd);
73169691Skan}
74169691Skan
75169691SkanPB_DS_CLASS_T_DEC
76169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer
77169691SkanPB_DS_CLASS_C_DEC::
78169691Skanget_new_node_for_insert(const_reference r_val, true_type)
79169691Skan{
80169691Skan  node_pointer p_new_nd = s_node_allocator.allocate(1);
81169691Skan
82169691Skan  new (const_cast<void* >(
83169691Skan			  static_cast<const void* >(&p_new_nd->m_value)))
84169691Skan    typename node::value_type(r_val);
85169691Skan
86169691Skan  ++m_size;
87169691Skan
88169691Skan  return (p_new_nd);
89169691Skan}
90169691Skan
91169691SkanPB_DS_CLASS_T_DEC
92169691Skaninline void
93169691SkanPB_DS_CLASS_C_DEC::
94169691Skanmake_child_of(node_pointer p_nd, node_pointer p_new_parent)
95169691Skan{
96169691Skan  _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
97169691Skan  _GLIBCXX_DEBUG_ASSERT(p_new_parent != NULL);
98169691Skan
99169691Skan  p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
100169691Skan
101169691Skan  if (p_new_parent->m_p_l_child != NULL)
102169691Skan    p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
103169691Skan
104169691Skan  p_nd->m_p_prev_or_parent = p_new_parent;
105169691Skan
106169691Skan  p_new_parent->m_p_l_child = p_nd;
107169691Skan}
108169691Skan
109169691SkanPB_DS_CLASS_T_DEC
110169691Skaninline typename PB_DS_CLASS_C_DEC::node_pointer
111169691SkanPB_DS_CLASS_C_DEC::
112169691Skanparent(node_pointer p_nd)
113169691Skan{
114169691Skan  while (true)
115169691Skan    {
116169691Skan      node_pointer p_pot = p_nd->m_p_prev_or_parent;
117169691Skan
118169691Skan      if (p_pot == NULL || p_pot->m_p_l_child == p_nd)
119169691Skan	return p_pot;
120169691Skan
121169691Skan      p_nd = p_pot;
122169691Skan    }
123169691Skan}
124169691Skan
125169691SkanPB_DS_CLASS_T_DEC
126169691Skaninline void
127169691SkanPB_DS_CLASS_C_DEC::
128169691Skanswap_with_parent(node_pointer p_nd, node_pointer p_parent)
129169691Skan{
130169691Skan  if (p_parent == m_p_root)
131169691Skan    m_p_root = p_nd;
132169691Skan
133169691Skan  _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
134169691Skan  _GLIBCXX_DEBUG_ASSERT(p_parent != NULL);
135169691Skan  _GLIBCXX_DEBUG_ASSERT(parent(p_nd) == p_parent);
136169691Skan
137169691Skan  const bool nd_direct_child = p_parent->m_p_l_child == p_nd;
138169691Skan  const bool parent_root = p_parent->m_p_prev_or_parent == NULL;
139169691Skan  const bool parent_direct_child =
140169691Skan    !parent_root&&  p_parent->m_p_prev_or_parent->m_p_l_child == p_parent;
141169691Skan
142169691Skan  std::swap(p_parent->m_p_prev_or_parent, p_nd->m_p_prev_or_parent);
143169691Skan  std::swap(p_parent->m_p_next_sibling, p_nd->m_p_next_sibling);
144169691Skan  std::swap(p_parent->m_p_l_child, p_nd->m_p_l_child);
145169691Skan  std::swap(p_parent->m_metadata, p_nd->m_metadata);
146169691Skan
147169691Skan  _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child != NULL);
148169691Skan  _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_prev_or_parent != NULL);
149169691Skan
150169691Skan  if (p_nd->m_p_next_sibling != NULL)
151169691Skan    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
152169691Skan
153169691Skan  if (p_parent->m_p_next_sibling != NULL)
154169691Skan    p_parent->m_p_next_sibling->m_p_prev_or_parent = p_parent;
155169691Skan
156169691Skan  if (p_parent->m_p_l_child != NULL)
157169691Skan    p_parent->m_p_l_child->m_p_prev_or_parent = p_parent;
158169691Skan
159169691Skan  if (parent_direct_child)
160169691Skan    p_nd->m_p_prev_or_parent->m_p_l_child = p_nd;
161169691Skan  else if (!parent_root)
162169691Skan    p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd;
163169691Skan
164169691Skan  if (!nd_direct_child)
165169691Skan    {
166169691Skan      p_nd->m_p_l_child->m_p_prev_or_parent = p_nd;
167169691Skan
168169691Skan      p_parent->m_p_prev_or_parent->m_p_next_sibling = p_parent;
169169691Skan    }
170169691Skan  else
171169691Skan    {
172169691Skan      _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child == p_nd);
173169691Skan      _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_prev_or_parent == p_parent);
174169691Skan
175169691Skan      p_nd->m_p_l_child = p_parent;
176169691Skan      p_parent->m_p_prev_or_parent = p_nd;
177169691Skan    }
178169691Skan
179169691Skan  _GLIBCXX_DEBUG_ASSERT(parent(p_parent) == p_nd);
180169691Skan}
181169691Skan
182