libstdc++
tree_policy/order_statistics_imp.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2019 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 tree_policy/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  node_iterator it = node_begin();
47  node_iterator end_it = node_end();
48 
49  while (it != end_it)
50  {
51  node_iterator l_it = it.get_l_child();
52  const size_type o = (l_it == end_it)? 0 : l_it.get_metadata();
53 
54  if (order == o)
55  return *it;
56  else if (order < o)
57  it = l_it;
58  else
59  {
60  order -= o + 1;
61  it = it.get_r_child();
62  }
63  }
64 
65  return base_type::end_iterator();
66 }
67 
68 PB_DS_CLASS_T_DEC
69 inline typename PB_DS_CLASS_C_DEC::const_iterator
70 PB_DS_CLASS_C_DEC::
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
73 
74 PB_DS_CLASS_T_DEC
75 inline typename PB_DS_CLASS_C_DEC::size_type
76 PB_DS_CLASS_C_DEC::
77 order_of_key(key_const_reference r_key) const
78 {
79  node_const_iterator it = node_begin();
80  node_const_iterator end_it = node_end();
81 
82  const cmp_fn& r_cmp_fn = const_cast<PB_DS_CLASS_C_DEC*>(this)->get_cmp_fn();
83  size_type ord = 0;
84  while (it != end_it)
85  {
86  node_const_iterator l_it = it.get_l_child();
87 
88  if (r_cmp_fn(r_key, this->extract_key(*(*it))))
89  it = l_it;
90  else if (r_cmp_fn(this->extract_key(*(*it)), r_key))
91  {
92  ord += (l_it == end_it)? 1 : 1 + l_it.get_metadata();
93  it = it.get_r_child();
94  }
95  else
96  {
97  ord += (l_it == end_it)? 0 : l_it.get_metadata();
98  it = end_it;
99  }
100  }
101  return ord;
102 }
103 
104 PB_DS_CLASS_T_DEC
105 inline void
106 PB_DS_CLASS_C_DEC::
107 operator()(node_iterator node_it, node_const_iterator end_nd_it) const
108 {
109  node_iterator l_it = node_it.get_l_child();
110  const size_type l_rank = (l_it == end_nd_it) ? 0 : l_it.get_metadata();
111 
112  node_iterator r_it = node_it.get_r_child();
113  const size_type r_rank = (r_it == end_nd_it) ? 0 : r_it.get_metadata();
114 
115  const_cast<metadata_reference>(node_it.get_metadata())= 1 + l_rank + r_rank;
116 }
117 
118 PB_DS_CLASS_T_DEC
119 PB_DS_CLASS_C_DEC::
120 ~tree_order_statistics_node_update()
121 { }