Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Blame | Last modification | View Log | RSS feed

  1. // -*- C++ -*-
  2.  
  3. // Copyright (C) 2005-2013 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 rb_tree_map_/insert_fn_imps.hpp
  38.  * Contains an implementation for rb_tree_.
  39.  */
  40.  
  41. PB_DS_CLASS_T_DEC
  42. inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
  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 = base_type::insert_leaf(r_value);
  48.   if (ins_pair.second == true)
  49.     {
  50.       ins_pair.first.m_p_nd->m_red = true;
  51.       PB_DS_STRUCT_ONLY_ASSERT_VALID((*this))
  52.       insert_fixup(ins_pair.first.m_p_nd);
  53.     }
  54.  
  55.   PB_DS_ASSERT_VALID((*this))
  56.   return ins_pair;
  57. }
  58.  
  59. PB_DS_CLASS_T_DEC
  60. inline void
  61. PB_DS_CLASS_C_DEC::
  62. insert_fixup(node_pointer p_nd)
  63. {
  64.   _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
  65.   while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
  66.     {
  67.       if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
  68.         {
  69.           node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
  70.           if (p_y != 0 && p_y->m_red)
  71.             {
  72.               p_nd->m_p_parent->m_red = false;
  73.               p_y->m_red = false;
  74.               p_nd->m_p_parent->m_p_parent->m_red = true;
  75.               p_nd = p_nd->m_p_parent->m_p_parent;
  76.             }
  77.           else
  78.             {
  79.               if (p_nd == p_nd->m_p_parent->m_p_right)
  80.                 {
  81.                   p_nd = p_nd->m_p_parent;
  82.                   base_type::rotate_left(p_nd);
  83.                 }
  84.               p_nd->m_p_parent->m_red = false;
  85.               p_nd->m_p_parent->m_p_parent->m_red = true;
  86.               base_type::rotate_right(p_nd->m_p_parent->m_p_parent);
  87.             }
  88.         }
  89.       else
  90.         {
  91.           node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
  92.           if (p_y != 0 && p_y->m_red)
  93.             {
  94.               p_nd->m_p_parent->m_red = false;
  95.               p_y->m_red = false;
  96.               p_nd->m_p_parent->m_p_parent->m_red = true;
  97.               p_nd = p_nd->m_p_parent->m_p_parent;
  98.             }
  99.           else
  100.             {
  101.               if (p_nd == p_nd->m_p_parent->m_p_left)
  102.                 {
  103.                   p_nd = p_nd->m_p_parent;
  104.                   base_type::rotate_right(p_nd);
  105.                 }
  106.               p_nd->m_p_parent->m_red = false;
  107.               p_nd->m_p_parent->m_p_parent->m_red = true;
  108.               base_type::rotate_left(p_nd->m_p_parent->m_p_parent);
  109.             }
  110.         }
  111.     }
  112.  
  113.   base_type::update_to_top(p_nd, (node_update* )this);
  114.   base_type::m_p_head->m_p_parent->m_red = false;
  115. }
  116.