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 insert_fn_imps.hpp
44 * Contains an implementation class for left_child_next_sibling_heap_.
45 */
46
47PB_DS_CLASS_T_DEC
48inline typename PB_DS_CLASS_C_DEC::node_pointer
49PB_DS_CLASS_C_DEC::
50get_new_node_for_insert(const_reference r_val)
51{
52  return get_new_node_for_insert(r_val, s_no_throw_copies_ind);
53}
54
55PB_DS_CLASS_T_DEC
56inline typename PB_DS_CLASS_C_DEC::node_pointer
57PB_DS_CLASS_C_DEC::
58get_new_node_for_insert(const_reference r_val, false_type)
59{
60  node_pointer p_new_nd = s_node_allocator.allocate(1);
61
62  cond_dealtor_t cond(p_new_nd);
63
64  new (const_cast<void* >(
65			  static_cast<const void* >(&p_new_nd->m_value)))
66    typename node::value_type(r_val);
67
68  cond.set_no_action();
69
70  ++m_size;
71
72  return (p_new_nd);
73}
74
75PB_DS_CLASS_T_DEC
76inline typename PB_DS_CLASS_C_DEC::node_pointer
77PB_DS_CLASS_C_DEC::
78get_new_node_for_insert(const_reference r_val, true_type)
79{
80  node_pointer p_new_nd = s_node_allocator.allocate(1);
81
82  new (const_cast<void* >(
83			  static_cast<const void* >(&p_new_nd->m_value)))
84    typename node::value_type(r_val);
85
86  ++m_size;
87
88  return (p_new_nd);
89}
90
91PB_DS_CLASS_T_DEC
92inline void
93PB_DS_CLASS_C_DEC::
94make_child_of(node_pointer p_nd, node_pointer p_new_parent)
95{
96  _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
97  _GLIBCXX_DEBUG_ASSERT(p_new_parent != NULL);
98
99  p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
100
101  if (p_new_parent->m_p_l_child != NULL)
102    p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
103
104  p_nd->m_p_prev_or_parent = p_new_parent;
105
106  p_new_parent->m_p_l_child = p_nd;
107}
108
109PB_DS_CLASS_T_DEC
110inline typename PB_DS_CLASS_C_DEC::node_pointer
111PB_DS_CLASS_C_DEC::
112parent(node_pointer p_nd)
113{
114  while (true)
115    {
116      node_pointer p_pot = p_nd->m_p_prev_or_parent;
117
118      if (p_pot == NULL || p_pot->m_p_l_child == p_nd)
119	return p_pot;
120
121      p_nd = p_pot;
122    }
123}
124
125PB_DS_CLASS_T_DEC
126inline void
127PB_DS_CLASS_C_DEC::
128swap_with_parent(node_pointer p_nd, node_pointer p_parent)
129{
130  if (p_parent == m_p_root)
131    m_p_root = p_nd;
132
133  _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
134  _GLIBCXX_DEBUG_ASSERT(p_parent != NULL);
135  _GLIBCXX_DEBUG_ASSERT(parent(p_nd) == p_parent);
136
137  const bool nd_direct_child = p_parent->m_p_l_child == p_nd;
138  const bool parent_root = p_parent->m_p_prev_or_parent == NULL;
139  const bool parent_direct_child =
140    !parent_root&&  p_parent->m_p_prev_or_parent->m_p_l_child == p_parent;
141
142  std::swap(p_parent->m_p_prev_or_parent, p_nd->m_p_prev_or_parent);
143  std::swap(p_parent->m_p_next_sibling, p_nd->m_p_next_sibling);
144  std::swap(p_parent->m_p_l_child, p_nd->m_p_l_child);
145  std::swap(p_parent->m_metadata, p_nd->m_metadata);
146
147  _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child != NULL);
148  _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_prev_or_parent != NULL);
149
150  if (p_nd->m_p_next_sibling != NULL)
151    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
152
153  if (p_parent->m_p_next_sibling != NULL)
154    p_parent->m_p_next_sibling->m_p_prev_or_parent = p_parent;
155
156  if (p_parent->m_p_l_child != NULL)
157    p_parent->m_p_l_child->m_p_prev_or_parent = p_parent;
158
159  if (parent_direct_child)
160    p_nd->m_p_prev_or_parent->m_p_l_child = p_nd;
161  else if (!parent_root)
162    p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd;
163
164  if (!nd_direct_child)
165    {
166      p_nd->m_p_l_child->m_p_prev_or_parent = p_nd;
167
168      p_parent->m_p_prev_or_parent->m_p_next_sibling = p_parent;
169    }
170  else
171    {
172      _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child == p_nd);
173      _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_prev_or_parent == p_parent);
174
175      p_nd->m_p_l_child = p_parent;
176      p_parent->m_p_prev_or_parent = p_nd;
177    }
178
179  _GLIBCXX_DEBUG_ASSERT(parent(p_parent) == p_nd);
180}
181
182