libstdc++
splay_tree_/insert_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2014 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 splay_tree_/insert_fn_imps.hpp
38  * Contains an implementation class for splay_tree_.
39  */
40 
41 PB_DS_CLASS_T_DEC
43 PB_DS_CLASS_C_DEC::
44 insert(const_reference r_value)
45 {
46  PB_DS_ASSERT_VALID((*this))
47  std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value);
48  ins_pair.first.m_p_nd->m_special = false;
49  PB_DS_ASSERT_VALID((*this))
50  splay(ins_pair.first.m_p_nd);
51  PB_DS_ASSERT_VALID((*this))
52  return ins_pair;
53 }
54 
55 PB_DS_CLASS_T_DEC
56 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
57 PB_DS_CLASS_C_DEC::
58 insert_leaf_imp(const_reference r_value)
59 {
60  _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid(__FILE__,
61  __LINE__);)
62  if (base_type::m_size == 0)
63  return std::make_pair(base_type::insert_imp_empty(r_value), true);
64 
65  node_pointer p_nd = base_type::m_p_head->m_p_parent;
66  node_pointer p_pot = base_type::m_p_head;
67 
68  while (p_nd != 0)
69  if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value)))
70  {
71  if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value)))
72  {
73  return std::make_pair(point_iterator(p_nd), false);
74  }
75  p_pot = p_nd;
76  p_nd = p_nd->m_p_left;
77  }
78  else
79  p_nd = p_nd->m_p_right;
80 
81  if (p_pot == base_type::m_p_head)
82  return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
83 
84  PB_DS_CHECK_KEY_DOES_NOT_EXIST(PB_DS_V2F(r_value))
85 
86  p_nd = p_pot->m_p_left;
87  if (p_nd == 0)
88  return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true));
89 
90  while (p_nd->m_p_right != 0)
91  p_nd = p_nd->m_p_right;
92 
93  return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true);
94 }
constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
Definition: stl_pair.h:276
Struct holding two objects of arbitrary type.
Definition: stl_pair.h:96