<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: debug_map_base.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a00853.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">debug_map_base.hpp</div> </div>
</div>
<div class="contents">
<a href="a00853.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010</span>
<a name="l00004"></a>00004 <span class="comment">// Free Software Foundation, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00007"></a>00007 <span class="comment">// software; you can redistribute it and/or modify it under the terms</span>
<a name="l00008"></a>00008 <span class="comment">// of the GNU General Public License as published by the Free Software</span>
<a name="l00009"></a>00009 <span class="comment">// Foundation; either version 3, or (at your option) any later</span>
<a name="l00010"></a>00010 <span class="comment">// version.</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment">// This library is distributed in the hope that it will be useful, but</span>
<a name="l00013"></a>00013 <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00015"></a>00015 <span class="comment">// General Public License for more details.</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00018"></a>00018 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00019"></a>00019 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00022"></a>00022 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00023"></a>00023 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00024"></a>00024 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="comment">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span>
<a name="l00029"></a>00029 <span class="comment">// is hereby granted without fee, provided that the above copyright</span>
<a name="l00030"></a>00030 <span class="comment">// notice appears in all copies, and that both that copyright notice</span>
<a name="l00031"></a>00031 <span class="comment">// and this permission notice appear in supporting documentation. None</span>
<a name="l00032"></a>00032 <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span>
<a name="l00033"></a>00033 <span class="comment">// representation about the suitability of this software for any</span>
<a name="l00034"></a>00034 <span class="comment">// purpose. It is provided "as is" without express or implied</span>
<a name="l00035"></a>00035 <span class="comment">// warranty.</span>
<a name="l00036"></a>00036 <span class="comment"></span>
<a name="l00037"></a>00037 <span class="comment">/**</span>
<a name="l00038"></a>00038 <span class="comment"> * @file debug_map_base.hpp</span>
<a name="l00039"></a>00039 <span class="comment"> * Contains a debug-mode base for all maps.</span>
<a name="l00040"></a>00040 <span class="comment"> */</span>
<a name="l00041"></a>00041
<a name="l00042"></a>00042 <span class="preprocessor">#ifndef PB_DS_DEBUG_MAP_BASE_HPP</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span><span class="preprocessor">#define PB_DS_DEBUG_MAP_BASE_HPP</span>
<a name="l00044"></a>00044 <span class="preprocessor"></span>
<a name="l00045"></a>00045 <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span>
<a name="l00047"></a>00047 <span class="preprocessor">#include <list></span>
<a name="l00048"></a>00048 <span class="preprocessor">#include <<a class="code" href="a01108.html">utility</a>></span>
<a name="l00049"></a>00049 <span class="preprocessor">#include <cstdlib></span>
<a name="l00050"></a>00050 <span class="preprocessor">#include <<a class="code" href="a00911.html">iostream</a>></span>
<a name="l00051"></a>00051 <span class="preprocessor">#include <<a class="code" href="a01084.html">ext/throw_allocator.h</a>></span>
<a name="l00052"></a>00052 <span class="preprocessor">#include <<a class="code" href="a00851.html">debug/debug.h</a>></span>
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="keyword">namespace </span>__gnu_pbds
<a name="l00055"></a>00055 {
<a name="l00056"></a>00056 <span class="keyword">namespace </span>detail
<a name="l00057"></a>00057 {
<a name="l00058"></a>00058 <span class="comment">// Need std::pair ostream extractor.</span>
<a name="l00059"></a>00059 <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits, <span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Tp2>
<a name="l00060"></a>00060 <span class="keyword">inline</span> <a class="code" href="a00251.html" title="Controlling output.This is the base class for all output streams. It provides text formatting of all ...">std::basic_ostream<_CharT, _Traits></a>&
<a name="l00061"></a>00061 operator<<(std::basic_ostream<_CharT, _Traits>& __out,
<a name="l00062"></a>00062 <span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_Tp1, _Tp2></a>& p)
<a name="l00063"></a>00063 { <span class="keywordflow">return</span> (__out << <span class="charliteral">'('</span> << p.first << <span class="charliteral">','</span> << p.second << <span class="charliteral">')'</span>); }
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="preprocessor">#define PB_DS_CLASS_T_DEC \</span>
<a name="l00066"></a>00066 <span class="preprocessor"> template<typename Key, class Eq_Fn, typename Const_Key_Reference></span>
<a name="l00067"></a>00067 <span class="preprocessor"></span>
<a name="l00068"></a>00068 <span class="preprocessor">#define PB_DS_CLASS_C_DEC \</span>
<a name="l00069"></a>00069 <span class="preprocessor"> debug_map_base<Key, Eq_Fn, Const_Key_Reference></span>
<a name="l00070"></a>00070 <span class="preprocessor"></span>
<a name="l00071"></a>00071 <span class="keyword">template</span><<span class="keyword">typename</span> Key, <span class="keyword">class</span> Eq_Fn, <span class="keyword">typename</span> Const_Key_Reference>
<a name="l00072"></a>00072 <span class="keyword">class </span>debug_map_base
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074 <span class="keyword">private</span>:
<a name="l00075"></a>00075 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<Key></a> key_allocator;
<a name="l00076"></a>00076 <span class="keyword">typedef</span> <span class="keyword">typename</span> key_allocator::size_type size_type;
<a name="l00077"></a>00077 <span class="keyword">typedef</span> Const_Key_Reference const_key_reference;
<a name="l00078"></a>00078 <span class="keyword">typedef</span> std::_GLIBCXX_STD_C::list<Key> key_set;
<a name="l00079"></a>00079 <span class="keyword">typedef</span> <span class="keyword">typename</span> key_set::iterator key_set_iterator;
<a name="l00080"></a>00080 <span class="keyword">typedef</span> <span class="keyword">typename</span> key_set::const_iterator const_key_set_iterator;
<a name="l00081"></a>00081 <span class="keyword">typedef</span> <a class="code" href="a00074.html" title="Allocator throwing via random condition.">__gnu_cxx::throw_allocator_random<Key></a> key_db_allocator;
<a name="l00082"></a>00082 <span class="keyword">typedef</span> <span class="keyword">typename</span> key_db_allocator::never_adjustor never_adjustor;
<a name="l00083"></a>00083
<a name="l00084"></a>00084 <span class="keyword">protected</span>:
<a name="l00085"></a>00085 debug_map_base();
<a name="l00086"></a>00086
<a name="l00087"></a>00087 debug_map_base(<span class="keyword">const</span> PB_DS_CLASS_C_DEC& other);
<a name="l00088"></a>00088
<a name="l00089"></a>00089 ~debug_map_base();
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00092"></a>00092 insert_new(const_key_reference r_key);
<a name="l00093"></a>00093
<a name="l00094"></a>00094 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00095"></a>00095 erase_existing(const_key_reference r_key);
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keywordtype">void</span>
<a name="l00098"></a>00098 clear();
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00101"></a>00101 check_key_exists(const_key_reference r_key) <span class="keyword">const</span>;
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00104"></a>00104 check_key_does_not_exist(const_key_reference r_key) <span class="keyword">const</span>;
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00107"></a>00107 check_size(size_type <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>) <span class="keyword">const</span>;
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <span class="keywordtype">void</span>
<a name="l00110"></a>00110 swap(PB_DS_CLASS_C_DEC& other);
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="keyword">template</span><<span class="keyword">typename</span> Cmp_Fn>
<a name="l00113"></a>00113 <span class="keywordtype">void</span>
<a name="l00114"></a>00114 split(const_key_reference, Cmp_Fn, PB_DS_CLASS_C_DEC&);
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="keywordtype">void</span>
<a name="l00117"></a>00117 join(PB_DS_CLASS_C_DEC& other);
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keyword">private</span>:
<a name="l00120"></a>00120 <span class="keywordtype">void</span>
<a name="l00121"></a>00121 assert_valid() <span class="keyword">const</span>;
<a name="l00122"></a>00122
<a name="l00123"></a>00123 const_key_set_iterator
<a name="l00124"></a>00124 find(const_key_reference r_key) <span class="keyword">const</span>;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 key_set_iterator
<a name="l00127"></a>00127 find(const_key_reference r_key);
<a name="l00128"></a>00128
<a name="l00129"></a>00129 key_set m_key_set;
<a name="l00130"></a>00130 Eq_Fn m_eq;
<a name="l00131"></a>00131 };
<a name="l00132"></a>00132
<a name="l00133"></a>00133 PB_DS_CLASS_T_DEC
<a name="l00134"></a>00134 PB_DS_CLASS_C_DEC::
<a name="l00135"></a>00135 debug_map_base()
<a name="l00136"></a>00136 { _GLIBCXX_DEBUG_ONLY(assert_valid();) }
<a name="l00137"></a>00137
<a name="l00138"></a>00138 PB_DS_CLASS_T_DEC
<a name="l00139"></a>00139 PB_DS_CLASS_C_DEC::
<a name="l00140"></a>00140 debug_map_base(<span class="keyword">const</span> PB_DS_CLASS_C_DEC& other) : m_key_set(other.m_key_set)
<a name="l00141"></a>00141 { _GLIBCXX_DEBUG_ONLY(assert_valid();) }
<a name="l00142"></a>00142
<a name="l00143"></a>00143 PB_DS_CLASS_T_DEC
<a name="l00144"></a>00144 PB_DS_CLASS_C_DEC::
<a name="l00145"></a>00145 ~debug_map_base()
<a name="l00146"></a>00146 { _GLIBCXX_DEBUG_ONLY(assert_valid();) }
<a name="l00147"></a>00147
<a name="l00148"></a>00148 PB_DS_CLASS_T_DEC
<a name="l00149"></a>00149 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00150"></a>00150 PB_DS_CLASS_C_DEC::
<a name="l00151"></a>00151 insert_new(const_key_reference r_key)
<a name="l00152"></a>00152 {
<a name="l00153"></a>00153 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <span class="keywordflow">if</span> (find(r_key) != m_key_set.end())
<a name="l00156"></a>00156 {
<a name="l00157"></a>00157 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a> << <span class="stringliteral">"insert_new key already present "</span> << r_key << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00158"></a>00158 std::abort;
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00161"></a>00161 never_adjustor never;
<a name="l00162"></a>00162 __try
<a name="l00163"></a>00163 {
<a name="l00164"></a>00164 m_key_set.push_back(r_key);
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166 __catch(...)
<a name="l00167"></a>00167 {
<a name="l00168"></a>00168 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a> << <span class="stringliteral">"insert_new "</span> << r_key << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00169"></a>00169 std::abort();
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171
<a name="l00172"></a>00172 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174
<a name="l00175"></a>00175 PB_DS_CLASS_T_DEC
<a name="l00176"></a>00176 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00177"></a>00177 PB_DS_CLASS_C_DEC::
<a name="l00178"></a>00178 erase_existing(const_key_reference r_key)
<a name="l00179"></a>00179 {
<a name="l00180"></a>00180 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00181"></a>00181 key_set_iterator it = find(r_key);
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (it == m_key_set.end())
<a name="l00183"></a>00183 {
<a name="l00184"></a>00184 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a> << <span class="stringliteral">"erase_existing"</span> << r_key << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00185"></a>00185 std::abort();
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187 m_key_set.erase(it);
<a name="l00188"></a>00188 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00189"></a>00189 }
<a name="l00190"></a>00190
<a name="l00191"></a>00191 PB_DS_CLASS_T_DEC
<a name="l00192"></a>00192 <span class="keywordtype">void</span>
<a name="l00193"></a>00193 PB_DS_CLASS_C_DEC::
<a name="l00194"></a>00194 clear()
<a name="l00195"></a>00195 {
<a name="l00196"></a>00196 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00197"></a>00197 m_key_set.clear();
<a name="l00198"></a>00198 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00199"></a>00199 }
<a name="l00200"></a>00200
<a name="l00201"></a>00201 PB_DS_CLASS_T_DEC
<a name="l00202"></a>00202 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00203"></a>00203 PB_DS_CLASS_C_DEC::
<a name="l00204"></a>00204 check_key_exists(const_key_reference r_key)<span class="keyword"> const</span>
<a name="l00205"></a>00205 <span class="keyword"> </span>{
<a name="l00206"></a>00206 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00207"></a>00207 <span class="keywordflow">if</span> (find(r_key) == m_key_set.end())
<a name="l00208"></a>00208 {
<a name="l00209"></a>00209 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a> << <span class="stringliteral">"check_key_exists "</span> << r_key << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00210"></a>00210 std::abort();
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214
<a name="l00215"></a>00215 PB_DS_CLASS_T_DEC
<a name="l00216"></a>00216 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00217"></a>00217 PB_DS_CLASS_C_DEC::
<a name="l00218"></a>00218 check_key_does_not_exist(const_key_reference r_key)<span class="keyword"> const</span>
<a name="l00219"></a>00219 <span class="keyword"> </span>{
<a name="l00220"></a>00220 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00221"></a>00221 <span class="keywordflow">if</span> (find(r_key) != m_key_set.end())
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 <span class="keyword">using</span> <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a>;
<a name="l00224"></a>00224 <span class="keyword">using</span> <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00225"></a>00225 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">cerr</a> << <span class="stringliteral">"check_key_does_not_exist "</span> << r_key << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">endl</a>;
<a name="l00226"></a>00226 std::abort();
<a name="l00227"></a>00227 }
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229
<a name="l00230"></a>00230 PB_DS_CLASS_T_DEC
<a name="l00231"></a>00231 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00232"></a>00232 PB_DS_CLASS_C_DEC::
<a name="l00233"></a>00233 check_size(size_type <a class="code" href="a01137.html#a81db22849646eea82e81721417ad49cf" title="Returns the total number of bits.">size</a>)<span class="keyword"> const</span>
<a name="l00234"></a>00234 <span class="keyword"> </span>{
<a name="l00235"></a>00235 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00236"></a>00236 <span class="keyword">const</span> size_type key_set_size = m_key_set.size();
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (size != key_set_size)
<a name="l00238"></a>00238 {
<a name="l00239"></a>00239 <a class="code" href="a01137.html#a7431d56d1e8cd7a9b854171294bd71c7" title="Linked to standard output.">std::cerr</a> << <span class="stringliteral">"check_size "</span> << size
<a name="l00240"></a>00240 << <span class="stringliteral">" "</span> << key_set_size << <a class="code" href="a01137.html#a9e2ba1ed9813a1f03adc9a87dbf491a5" title="Write a newline and flush the stream.">std::endl</a>;
<a name="l00241"></a>00241 std::abort();
<a name="l00242"></a>00242 }
<a name="l00243"></a>00243 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00244"></a>00244 }
<a name="l00245"></a>00245
<a name="l00246"></a>00246 PB_DS_CLASS_T_DEC
<a name="l00247"></a>00247 <span class="keywordtype">void</span>
<a name="l00248"></a>00248 PB_DS_CLASS_C_DEC::
<a name="l00249"></a>00249 swap(PB_DS_CLASS_C_DEC& other)
<a name="l00250"></a>00250 {
<a name="l00251"></a>00251 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00252"></a>00252 m_key_set.swap(other.m_key_set);
<a name="l00253"></a>00253 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256 PB_DS_CLASS_T_DEC
<a name="l00257"></a>00257 <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::const_key_set_iterator
<a name="l00258"></a>00258 PB_DS_CLASS_C_DEC::
<a name="l00259"></a>00259 find(const_key_reference r_key)<span class="keyword"> const</span>
<a name="l00260"></a>00260 <span class="keyword"> </span>{
<a name="l00261"></a>00261 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00262"></a>00262 <span class="keyword">typedef</span> const_key_set_iterator iterator_type;
<a name="l00263"></a>00263 <span class="keywordflow">for</span> (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it)
<a name="l00264"></a>00264 <span class="keywordflow">if</span> (m_eq(*it, r_key))
<a name="l00265"></a>00265 <span class="keywordflow">return</span> it;
<a name="l00266"></a>00266 <span class="keywordflow">return</span> m_key_set.end();
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269 PB_DS_CLASS_T_DEC
<a name="l00270"></a>00270 <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::key_set_iterator
<a name="l00271"></a>00271 PB_DS_CLASS_C_DEC::
<a name="l00272"></a>00272 find(const_key_reference r_key)
<a name="l00273"></a>00273 {
<a name="l00274"></a>00274 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00275"></a>00275 key_set_iterator it = m_key_set.begin();
<a name="l00276"></a>00276 <span class="keywordflow">while</span> (it != m_key_set.end())
<a name="l00277"></a>00277 {
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (m_eq(*it, r_key))
<a name="l00279"></a>00279 <span class="keywordflow">return</span> it;
<a name="l00280"></a>00280 ++it;
<a name="l00281"></a>00281 }
<a name="l00282"></a>00282 <span class="keywordflow">return</span> it;
<a name="l00283"></a>00283 _GLIBCXX_DEBUG_ONLY(assert_valid();)
<a name="l00284"></a>00284 }
<a name="l00285"></a>00285
<a name="l00286"></a>00286 PB_DS_CLASS_T_DEC
<a name="l00287"></a>00287 <span class="keywordtype">void</span>
<a name="l00288"></a>00288 PB_DS_CLASS_C_DEC::
<a name="l00289"></a>00289 assert_valid()<span class="keyword"> const</span>
<a name="l00290"></a>00290 <span class="keyword"> </span>{
<a name="l00291"></a>00291 const_key_set_iterator prime_it = m_key_set.begin();
<a name="l00292"></a>00292 <span class="keywordflow">while</span> (prime_it != m_key_set.end())
<a name="l00293"></a>00293 {
<a name="l00294"></a>00294 const_key_set_iterator sec_it = prime_it;
<a name="l00295"></a>00295 ++sec_it;
<a name="l00296"></a>00296 <span class="keywordflow">while</span> (sec_it != m_key_set.end())
<a name="l00297"></a>00297 {
<a name="l00298"></a>00298 _GLIBCXX_DEBUG_ASSERT(!m_eq(*sec_it, *prime_it));
<a name="l00299"></a>00299 _GLIBCXX_DEBUG_ASSERT(!m_eq(*prime_it, *sec_it));
<a name="l00300"></a>00300 ++sec_it;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 ++prime_it;
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 PB_DS_CLASS_T_DEC
<a name="l00307"></a>00307 <span class="keyword">template</span><<span class="keyword">typename</span> Cmp_Fn>
<a name="l00308"></a>00308 <span class="keywordtype">void</span>
<a name="l00309"></a>00309 PB_DS_CLASS_C_DEC::
<a name="l00310"></a>00310 split(const_key_reference r_key, Cmp_Fn cmp_fn, PB_DS_CLASS_C_DEC& other)
<a name="l00311"></a>00311 {
<a name="l00312"></a>00312 other.clear();
<a name="l00313"></a>00313 key_set_iterator it = m_key_set.begin();
<a name="l00314"></a>00314 <span class="keywordflow">while</span> (it != m_key_set.end())
<a name="l00315"></a>00315 <span class="keywordflow">if</span> (cmp_fn(r_key, * it))
<a name="l00316"></a>00316 {
<a name="l00317"></a>00317 other.insert_new(*it);
<a name="l00318"></a>00318 it = m_key_set.erase(it);
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320 <span class="keywordflow">else</span>
<a name="l00321"></a>00321 ++it;
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323
<a name="l00324"></a>00324 PB_DS_CLASS_T_DEC
<a name="l00325"></a>00325 <span class="keywordtype">void</span>
<a name="l00326"></a>00326 PB_DS_CLASS_C_DEC::
<a name="l00327"></a>00327 join(PB_DS_CLASS_C_DEC& other)
<a name="l00328"></a>00328 {
<a name="l00329"></a>00329 key_set_iterator it = other.m_key_set.begin();
<a name="l00330"></a>00330 <span class="keywordflow">while</span> (it != other.m_key_set.end())
<a name="l00331"></a>00331 {
<a name="l00332"></a>00332 insert_new(*it);
<a name="l00333"></a>00333 it = other.m_key_set.erase(it);
<a name="l00334"></a>00334 }
<a name="l00335"></a>00335 _GLIBCXX_DEBUG_ASSERT(other.m_key_set.empty());
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337
<a name="l00338"></a>00338 <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span>
<a name="l00339"></a>00339 <span class="preprocessor"></span><span class="preprocessor">#undef PB_DS_CLASS_C_DEC</span>
<a name="l00340"></a>00340 <span class="preprocessor"></span>
<a name="l00341"></a>00341 } <span class="comment">// namespace detail</span>
<a name="l00342"></a>00342 } <span class="comment">// namespace __gnu_pbds</span>
<a name="l00343"></a>00343
<a name="l00344"></a>00344 <span class="preprocessor">#endif</span>
<a name="l00345"></a>00345 <span class="preprocessor"></span>
<a name="l00346"></a>00346 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00853.html">debug_map_base.hpp</a> </li>
<li class="footer">Generated by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
</ul>
</div>
</body>
</html>
