find_fn_imps.hpp revision 1.1.1.1
1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006, 2009 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 find_fn_imps.hpp 38 * Contains an implementation class for splay_tree_. 39 */ 40 41PB_DS_CLASS_T_DEC 42inline typename PB_DS_CLASS_C_DEC::point_iterator 43PB_DS_CLASS_C_DEC:: 44find(const_key_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 52PB_DS_CLASS_T_DEC 53inline typename PB_DS_CLASS_C_DEC::const_point_iterator 54PB_DS_CLASS_C_DEC:: 55find(const_key_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 63PB_DS_CLASS_T_DEC 64inline typename PB_DS_CLASS_C_DEC::node_pointer 65PB_DS_CLASS_C_DEC:: 66find_imp(const_key_reference r_key) 67{ 68 _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid();) 69 node_pointer p_nd = base_type::m_p_head->m_p_parent; 70 while (p_nd != NULL) 71 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key)) 72 { 73 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value))) 74 return p_nd; 75 p_nd = p_nd->m_p_left; 76 } 77 else 78 p_nd = p_nd->m_p_right; 79 return base_type::m_p_head; 80} 81 82PB_DS_CLASS_T_DEC 83inline const typename PB_DS_CLASS_C_DEC::node_pointer 84PB_DS_CLASS_C_DEC:: 85find_imp(const_key_reference r_key) const 86{ 87 _GLIBCXX_DEBUG_ONLY(assert_valid();) 88 node_pointer p_nd = base_type::m_p_head->m_p_parent; 89 while (p_nd != NULL) 90 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key)) 91 { 92 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value))) 93 return p_nd; 94 p_nd = p_nd->m_p_left; 95 } 96 else 97 p_nd = p_nd->m_p_right; 98 return base_type::m_p_head; 99} 100