mingw/lib/gcc/mingw32/4.3.3/include/c++/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp

   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 splay_tree_.
  45  */
  46
  47 PB_DS_CLASS_T_DEC
  48 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
  49 PB_DS_CLASS_C_DEC::
  50 insert(const_reference r_value)
  51 {
  52   _GLIBCXX_DEBUG_ONLY(assert_valid();)
  53   std::pair<point_iterator, bool> ins_pair = insert_leaf_imp(r_value);
  54   ins_pair.first.m_p_nd->m_special = false;
  55   _GLIBCXX_DEBUG_ONLY(assert_valid());
  56   splay(ins_pair.first.m_p_nd);
  57   _GLIBCXX_DEBUG_ONLY(assert_valid());
  58   return ins_pair;
  59 }
  60
  61 PB_DS_CLASS_T_DEC
  62 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
  63 PB_DS_CLASS_C_DEC::
  64 insert_leaf_imp(const_reference r_value)
  65 {
  66   _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid();)
  67   if (base_type::m_size == 0)
  68     return std::make_pair(base_type::insert_imp_empty(r_value), true);
  69
  70   node_pointer p_nd = base_type::m_p_head->m_p_parent;
  71   node_pointer p_pot = base_type::m_p_head;
  72
  73   while (p_nd != NULL)
  74     if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value)))
  75       {
  76         if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value)))
  77           {
  78             return std::make_pair(point_iterator(p_nd), false);
  79           }
  80         p_pot = p_nd;
  81         p_nd = p_nd->m_p_left;
  82       }
  83     else
  84       p_nd = p_nd->m_p_right;
  85
  86   if (p_pot == base_type::m_p_head)
  87     return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
  88
  89   _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value)));
  90
  91   p_nd = p_pot->m_p_left;
  92   if (p_nd == NULL)
  93     return (std::make_pair(base_type::insert_leaf_new(r_value, p_pot, true), true));
  94
  95   while (p_nd->m_p_right != NULL)
  96     p_nd = p_nd->m_p_right;
  97
  98   return std::make_pair(insert_leaf_new(r_value, p_nd, false), true);
  99 }