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 splay_tree_.
45169691Skan */
46169691Skan
47169691SkanPB_DS_CLASS_T_DEC
48169691Skaninline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
49169691SkanPB_DS_CLASS_C_DEC::
50169691Skaninsert(const_reference r_value)
51169691Skan{
52169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid();)
53169691Skan  std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value);
54169691Skan  ins_pair.first.m_p_nd->m_special = false;
55169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid());
56169691Skan  splay(ins_pair.first.m_p_nd);
57169691Skan  _GLIBCXX_DEBUG_ONLY(assert_valid());
58169691Skan  return ins_pair;
59169691Skan}
60169691Skan
61169691SkanPB_DS_CLASS_T_DEC
62169691Skaninline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
63169691SkanPB_DS_CLASS_C_DEC::
64169691Skaninsert_leaf_imp(const_reference r_value)
65169691Skan{
66169691Skan  _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid();)
67169691Skan  if (base_type::m_size == 0)
68169691Skan    return std::make_pair(base_type::insert_imp_empty(r_value), true);
69169691Skan
70169691Skan  node_pointer p_nd = base_type::m_p_head->m_p_parent;
71169691Skan  node_pointer p_pot = base_type::m_p_head;
72169691Skan
73169691Skan  while (p_nd != NULL)
74169691Skan    if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value)))
75169691Skan      {
76169691Skan	if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value)))
77169691Skan	  {
78169691Skan	    return std::make_pair(point_iterator(p_nd), false);
79169691Skan	  }
80169691Skan	p_pot = p_nd;
81169691Skan	p_nd = p_nd->m_p_left;
82169691Skan      }
83169691Skan    else
84169691Skan      p_nd = p_nd->m_p_right;
85169691Skan
86169691Skan  if (p_pot == base_type::m_p_head)
87169691Skan    return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
88169691Skan
89169691Skan  _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value)));
90169691Skan
91169691Skan  p_nd = p_pot->m_p_left;
92169691Skan  if (p_nd == NULL)
93169691Skan    return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true));
94169691Skan
95169691Skan  while (p_nd->m_p_right != NULL)
96169691Skan    p_nd = p_nd->m_p_right;
97169691Skan
98169691Skan  return std::make_pair(insert_leaf_new(r_value, p_nd, false), true);
99169691Skan}
100