3 // Copyright (C) 2005, 2006, 2009, 2010 Free Software Foundation, Inc.
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
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.
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.
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/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
37 * @file order_statistics_imp.hpp
38 * Contains forward declarations for order_statistics_key
42 inline typename PB_DS_CLASS_C_DEC::iterator
44 find_by_order(size_type order)
51 node_iterator nd_it = node_begin();
55 if (order > nd_it.get_metadata())
56 return (++base_type::rightmost_it(nd_it));
58 const size_type num_children = nd_it.num_children();
60 if (num_children == 0)
63 for (size_type i = 0; i < num_children; ++i)
65 node_iterator child_nd_it = nd_it.get_child(i);
67 if (order <= child_nd_it.get_metadata())
74 order -= child_nd_it.get_metadata();
80 inline typename PB_DS_CLASS_C_DEC::const_iterator
82 find_by_order(size_type order) const
84 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
88 inline typename PB_DS_CLASS_C_DEC::size_type
90 order_of_key(const_key_reference r_key) const
92 const E_Access_Traits& r_traits =
93 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
95 return (order_of_prefix(
96 r_traits.begin(r_key),
97 r_traits.end(r_key)));
101 inline typename PB_DS_CLASS_C_DEC::size_type
103 order_of_prefix(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e) const
108 const E_Access_Traits& r_traits =
109 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
111 const_node_iterator nd_it = node_begin();
113 const_node_iterator end_nd_it = node_end();
119 const size_type num_children = nd_it.num_children();
121 if (num_children == 0)
123 const_key_reference r_key =
124 base_type::extract_key(*(*nd_it));
126 typename e_access_traits::const_iterator key_b =
127 r_traits.begin(r_key);
129 typename e_access_traits::const_iterator key_e =
132 return ((base_type::less( key_b, key_e, b, e, r_traits))?
137 const_node_iterator next_nd_it = end_nd_it;
139 size_type i = num_children - 1;
143 const_node_iterator child_nd_it = nd_it.get_child(i);
145 if (next_nd_it != end_nd_it)
146 ord += child_nd_it.get_metadata();
147 else if (!base_type::less(
149 child_nd_it.valid_prefix().first,
150 child_nd_it.valid_prefix().second,
152 next_nd_it = child_nd_it;
156 if (next_nd_it == end_nd_it)
166 operator()(node_iterator nd_it, const_node_iterator /*end_nd_it*/) const
168 const size_type num_children = nd_it.num_children();
170 size_type children_rank = 0;
172 for (size_type i = 0; i < num_children; ++i)
173 children_rank += nd_it.get_child(i).get_metadata();
175 const_cast<size_type& >(nd_it.get_metadata()) =(num_children == 0)? 1 : children_rank;
180 ~trie_order_statistics_node_update()