1169691Skan// -*- C++ -*- 2169691Skan 3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc. 4169691Skan// 5169691Skan// This file is part of the GNU ISO C++ Library. This library is free 6169691Skan// software; you can redistribute it and/or modify it under the terms 7169691Skan// of the GNU General Public License as published by the Free Software 8169691Skan// Foundation; either version 2, or (at your option) any later 9169691Skan// version. 10169691Skan 11169691Skan// This library is distributed in the hope that it will be useful, but 12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of 13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14169691Skan// General Public License for more details. 15169691Skan 16169691Skan// You should have received a copy of the GNU General Public License 17169691Skan// along with this library; see the file COPYING. If not, write to 18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19169691Skan// MA 02111-1307, USA. 20169691Skan 21169691Skan// As a special exception, you may use this file as part of a free 22169691Skan// software library without restriction. Specifically, if other files 23169691Skan// instantiate templates or use macros or inline functions from this 24169691Skan// file, or you compile this file and link it with other files to 25169691Skan// produce an executable, this file does not by itself cause the 26169691Skan// resulting executable to be covered by the GNU General Public 27169691Skan// License. This exception does not however invalidate any other 28169691Skan// reasons why the executable file might be covered by the GNU General 29169691Skan// Public License. 30169691Skan 31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32169691Skan 33169691Skan// Permission to use, copy, modify, sell, and distribute this software 34169691Skan// is hereby granted without fee, provided that the above copyright 35169691Skan// notice appears in all copies, and that both that copyright notice 36169691Skan// and this permission notice appear in supporting documentation. None 37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any 38169691Skan// representation about the suitability of this software for any 39169691Skan// purpose. It is provided "as is" without express or implied 40169691Skan// warranty. 41169691Skan 42169691Skan/** 43169691Skan * @file order_statistics_imp.hpp 44169691Skan * Contains forward declarations for order_statistics_key 45169691Skan */ 46169691Skan 47169691SkanPB_DS_CLASS_T_DEC 48169691Skaninline typename PB_DS_CLASS_C_DEC::iterator 49169691SkanPB_DS_CLASS_C_DEC:: 50169691Skanfind_by_order(size_type order) 51169691Skan{ 52169691Skan node_iterator it = node_begin(); 53169691Skan 54169691Skan node_iterator end_it = node_end(); 55169691Skan 56169691Skan while (it != end_it) 57169691Skan { 58169691Skan node_iterator l_it = it.get_l_child(); 59169691Skan 60169691Skan const size_type o = (l_it == end_it)? 61169691Skan 0 : 62169691Skan l_it.get_metadata(); 63169691Skan 64169691Skan if (order == o) 65169691Skan return (*it); 66169691Skan else if (order < o) 67169691Skan it = l_it; 68169691Skan else 69169691Skan { 70169691Skan order -= o + 1; 71169691Skan 72169691Skan it = it.get_r_child(); 73169691Skan } 74169691Skan } 75169691Skan 76169691Skan return (PB_DS_BASE_C_DEC::end_iterator()); 77169691Skan} 78169691Skan 79169691SkanPB_DS_CLASS_T_DEC 80169691Skaninline typename PB_DS_CLASS_C_DEC::const_iterator 81169691SkanPB_DS_CLASS_C_DEC:: 82169691Skanfind_by_order(size_type order) const 83169691Skan{ 84169691Skan return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order)); 85169691Skan} 86169691Skan 87169691SkanPB_DS_CLASS_T_DEC 88169691Skaninline typename PB_DS_CLASS_C_DEC::size_type 89169691SkanPB_DS_CLASS_C_DEC:: 90169691Skanorder_of_key(const_key_reference r_key) const 91169691Skan{ 92169691Skan const_node_iterator it = node_begin(); 93169691Skan 94169691Skan const_node_iterator end_it = node_end(); 95169691Skan 96169691Skan const cmp_fn& r_cmp_fn = 97169691Skan const_cast<PB_DS_CLASS_C_DEC* >(this)->get_cmp_fn(); 98169691Skan 99169691Skan size_type ord = 0; 100169691Skan 101169691Skan while (it != end_it) 102169691Skan { 103169691Skan const_node_iterator l_it = it.get_l_child(); 104169691Skan 105169691Skan if (r_cmp_fn(r_key, extract_key(*(*it)))) 106169691Skan it = l_it; 107169691Skan else if (r_cmp_fn(extract_key(*(*it)), r_key)) 108169691Skan { 109169691Skan 110169691Skan ord += (l_it == end_it)? 111169691Skan 1 : 112169691Skan 1 + l_it.get_metadata(); 113169691Skan 114169691Skan it = it.get_r_child(); 115169691Skan } 116169691Skan else 117169691Skan { 118169691Skan ord += (l_it == end_it)? 119169691Skan 0 : 120169691Skan l_it.get_metadata(); 121169691Skan 122169691Skan it = end_it; 123169691Skan } 124169691Skan } 125169691Skan 126169691Skan return (ord); 127169691Skan} 128169691Skan 129169691SkanPB_DS_CLASS_T_DEC 130169691Skaninline void 131169691SkanPB_DS_CLASS_C_DEC:: 132169691Skanoperator()(node_iterator node_it, const_node_iterator end_nd_it) const 133169691Skan{ 134169691Skan node_iterator l_child_it = node_it.get_l_child(); 135169691Skan const size_type l_rank =(l_child_it == end_nd_it)? 0 : l_child_it.get_metadata(); 136169691Skan 137169691Skan node_iterator r_child_it = node_it.get_r_child(); 138169691Skan const size_type r_rank =(r_child_it == end_nd_it)? 0 : r_child_it.get_metadata(); 139169691Skan 140169691Skan const_cast<metadata_reference>(node_it.get_metadata())= 141169691Skan 1 + l_rank + r_rank; 142169691Skan} 143169691Skan 144169691SkanPB_DS_CLASS_T_DEC 145169691SkanPB_DS_CLASS_C_DEC:: 146169691Skan~tree_order_statistics_node_update() 147169691Skan{ } 148