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 splay_tree_/find_fn_imps.hpp
  38.  * Contains an implementation class for splay_tree_.
  39.  */
  40.  
  41. PB_DS_CLASS_T_DEC
  42. inline typename PB_DS_CLASS_C_DEC::point_iterator
  43. PB_DS_CLASS_C_DEC::
  44. find(key_const_reference r_key)
  45. {
  46.   node_pointer p_found = find_imp(r_key);
  47.   if (p_found != base_type::m_p_head)
  48.     splay(p_found);
  49.   return point_iterator(p_found);
  50. }
  51.  
  52. PB_DS_CLASS_T_DEC
  53. inline typename PB_DS_CLASS_C_DEC::point_const_iterator
  54. PB_DS_CLASS_C_DEC::
  55. find(key_const_reference r_key) const
  56. {
  57.   const node_pointer p_found = find_imp(r_key);
  58.   if (p_found != base_type::m_p_head)
  59.     const_cast<PB_DS_CLASS_C_DEC* >(this)->splay(p_found);
  60.   return point_iterator(p_found);
  61. }
  62.  
  63. PB_DS_CLASS_T_DEC
  64. inline typename PB_DS_CLASS_C_DEC::node_pointer
  65. PB_DS_CLASS_C_DEC::
  66. find_imp(key_const_reference r_key)
  67. {
  68.   _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid(__FILE__,
  69.                                                              __LINE__);)
  70.   node_pointer p_nd = base_type::m_p_head->m_p_parent;
  71.   while (p_nd != 0)
  72.     if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
  73.       {
  74.         if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
  75.           return p_nd;
  76.         p_nd = p_nd->m_p_left;
  77.       }
  78.     else
  79.       p_nd = p_nd->m_p_right;
  80.   return base_type::m_p_head;
  81. }
  82.  
  83. PB_DS_CLASS_T_DEC
  84. inline const typename PB_DS_CLASS_C_DEC::node_pointer
  85. PB_DS_CLASS_C_DEC::
  86. find_imp(key_const_reference r_key) const
  87. {
  88.   PB_DS_ASSERT_VALID((*this))
  89.   node_pointer p_nd = base_type::m_p_head->m_p_parent;
  90.   while (p_nd != 0)
  91.     if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
  92.       {
  93.         if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
  94.           return p_nd;
  95.         p_nd = p_nd->m_p_left;
  96.       }
  97.     else
  98.       p_nd = p_nd->m_p_right;
  99.   return base_type::m_p_head;
  100. }
  101.