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 order_statistics_imp.hpp 38 * Contains forward declarations for order_statistics_key 39 */ 40 41 PB_DS_CLASS_T_DEC 42 inline typename PB_DS_CLASS_C_DEC::iterator 43 PB_DS_CLASS_C_DEC:: 44 find_by_order(size_type order) 45 { 46 if (empty()) 47 return (end()); 48 49 ++order; 50 51 node_iterator nd_it = node_begin(); 52 53 node_iterator end_nd_it = node_end(); 54 55 while (true) 56 { 57 if (order > nd_it.get_metadata()) 58 return (++base_type::rightmost_it(nd_it)); 59 60 const size_type num_children = nd_it.num_children(); 61 62 if (num_children == 0) 63 return (*nd_it); 64 65 for (size_type i = 0; i < num_children; ++i) 66 { 67 node_iterator child_nd_it = nd_it.get_child(i); 68 69 if (order <= child_nd_it.get_metadata()) 70 { 71 i = num_children; 72 73 nd_it = child_nd_it; 74 } 75 else 76 order -= child_nd_it.get_metadata(); 77 } 78 } 79 } 80 81 PB_DS_CLASS_T_DEC 82 inline typename PB_DS_CLASS_C_DEC::const_iterator 83 PB_DS_CLASS_C_DEC:: 84 find_by_order(size_type order) const 85 { 86 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order)); 87 } 88 89 PB_DS_CLASS_T_DEC 90 inline typename PB_DS_CLASS_C_DEC::size_type 91 PB_DS_CLASS_C_DEC:: 92 order_of_key(const_key_reference r_key) const 93 { 94 const E_Access_Traits& r_traits = 95 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits(); 96 97 return (order_of_prefix( 98 r_traits.begin(r_key), 99 r_traits.end(r_key))); 100 } 101 102 PB_DS_CLASS_T_DEC 103 inline typename PB_DS_CLASS_C_DEC::size_type 104 PB_DS_CLASS_C_DEC:: 105 order_of_prefix(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e) const 106 { 107 if (empty()) 108 return (0); 109 110 const E_Access_Traits& r_traits = 111 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits(); 112 113 const_node_iterator nd_it = node_begin(); 114 115 const_node_iterator end_nd_it = node_end(); 116 117 size_type ord = 0; 118 119 while (true) 120 { 121 const size_type num_children = nd_it.num_children(); 122 123 if (num_children == 0) 124 { 125 const_key_reference r_key = 126 base_type::extract_key(*(*nd_it)); 127 128 typename e_access_traits::const_iterator key_b = 129 r_traits.begin(r_key); 130 131 typename e_access_traits::const_iterator key_e = 132 r_traits.end(r_key); 133 134 return ((base_type::less( key_b, key_e, b, e, r_traits))? 135 ord + 1 : 136 ord); 137 } 138 139 const_node_iterator next_nd_it = end_nd_it; 140 141 size_type i = num_children - 1; 142 143 do 144 { 145 const_node_iterator child_nd_it = nd_it.get_child(i); 146 147 if (next_nd_it != end_nd_it) 148 ord += child_nd_it.get_metadata(); 149 else if (!base_type::less( 150 b, e, 151 child_nd_it.valid_prefix().first, 152 child_nd_it.valid_prefix().second, 153 r_traits)) 154 next_nd_it = child_nd_it; 155 } 156 while (i-- > 0); 157 158 if (next_nd_it == end_nd_it) 159 return (ord); 160 161 nd_it = next_nd_it; 162 } 163 } 164 165 PB_DS_CLASS_T_DEC 166 inline void 167 PB_DS_CLASS_C_DEC:: 168 operator()(node_iterator nd_it, const_node_iterator /*end_nd_it*/) const 169 { 170 const size_type num_children = nd_it.num_children(); 171 172 size_type children_rank = 0; 173 174 for (size_type i = 0; i < num_children; ++i) 175 children_rank += nd_it.get_child(i).get_metadata(); 176 177 const_cast<size_type& >(nd_it.get_metadata()) =(num_children == 0)? 1 : children_rank; 178 } 179 180 PB_DS_CLASS_T_DEC 181 PB_DS_CLASS_C_DEC:: 182 ~trie_order_statistics_node_update() 183 { } 184
