gomp-20050608-branch/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005 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
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  19 // USA.
  20
  21 // As a special exception, you may use this file as part of a free software
  22 // library without restriction.  Specifically, if other files instantiate
  23 // templates or use macros or inline functions from this file, or you compile
  24 // this file and link it with other files to produce an executable, this
  25 // file does not by itself cause the resulting executable to be covered by
  26 // the GNU General Public License.  This exception does not however
  27 // invalidate any other reasons why the executable file might be covered by
  28 // the GNU General Public License.
  29
  30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  31
  32 // Permission to use, copy, modify, sell, and distribute this software
  33 // is hereby granted without fee, provided that the above copyright
  34 // notice appears in all copies, and that both that copyright notice and
  35 // this permission notice appear in supporting documentation. None of
  36 // the above authors, nor IBM Haifa Research Laboratories, make any
  37 // representation about the suitability of this software for any
  38 // purpose. It is provided "as is" without express or implied warranty.
  39
  40 /**
  41  * @file split_join_fn_imps.hpp
  42  * Contains an implementation class for splay_tree_.
  43  */
  44
  45 PB_ASSOC_CLASS_T_DEC
  46 inline void
  47 PB_ASSOC_CLASS_C_DEC::
  48 join(PB_ASSOC_CLASS_C_DEC& r_other)
  49 {
  50   PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
  51     PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
  52
  53     if (PB_ASSOC_BASE_C_DEC::join_prep(r_other) == false)
  54       {
  55         PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
  56           PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
  57
  58           return;
  59       }
  60
  61   node_pointer p_target_r = r_other.leftmost(r_other.m_p_head);
  62
  63   PB_ASSOC_DBG_ASSERT(p_target_r != NULL);
  64
  65   r_other.splay(p_target_r);
  66
  67   PB_ASSOC_DBG_ASSERT(p_target_r == r_other.m_p_head->m_p_parent);
  68   PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left == NULL);
  69
  70   p_target_r->m_p_left = PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
  71
  72   PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left != NULL);
  73   p_target_r->m_p_left->m_p_parent = p_target_r;
  74
  75   PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_target_r;
  76   p_target_r->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
  77
  78   apply_update(p_target_r, (Node_Updator* )this);
  79
  80   PB_ASSOC_BASE_C_DEC::join_finish(r_other);
  81
  82   PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
  83     PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
  84     }
  85
  86 PB_ASSOC_CLASS_T_DEC
  87 void
  88 PB_ASSOC_CLASS_C_DEC::
  89 split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
  90 {
  91   PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
  92   PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
  93
  94   if (PB_ASSOC_BASE_C_DEC::split_prep(r_key, r_other) == false)
  95     {
  96       PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
  97       PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
  98
  99       return;
 100     }
 101
 102   node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
 103   PB_ASSOC_DBG_ASSERT(p_upper_bound != NULL);
 104
 105   PB_ASSOC_DBG_ASSERT(p_upper_bound->m_p_parent ==
 106                       PB_ASSOC_BASE_C_DEC::m_p_head);
 107
 108   node_pointer p_new_root = p_upper_bound->m_p_left;
 109   PB_ASSOC_DBG_ASSERT(p_new_root != NULL);
 110
 111   PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_new_root;
 112   p_new_root->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
 113
 114   r_other.m_p_head->m_p_parent = p_upper_bound;
 115   p_upper_bound->m_p_parent = r_other.m_p_head;
 116   p_upper_bound->m_p_left = NULL;
 117
 118   apply_update(p_upper_bound, (Node_Updator* )this);
 119
 120   PB_ASSOC_BASE_C_DEC::split_finish(r_other);
 121
 122   PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
 123   PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
 124 }
 125