<!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"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.3"/> <title>libstdc++: debug_fn_imps.hpp Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> $(document).ready(initResizable); $(window).load(resizeHeight); </script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <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> <!-- end header part --> <!-- Generated by Doxygen 1.8.3 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> $(document).ready(function(){initNavTree('a01121_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">pat_trie_/debug_fn_imps.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a01121.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div> <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div> <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc.</span></div> <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div> <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div> <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div> <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div> <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div> <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div> <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div> <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div> <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div> <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div> <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div> <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div> <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div> <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div> <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div> <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div> <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div> <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div> <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div> <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div> <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div> <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span></div> <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div> <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span></div> <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// is hereby granted without fee, provided that the above copyright</span></div> <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// notice appears in all copies, and that both that copyright notice</span></div> <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// and this permission notice appear in supporting documentation. None</span></div> <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span></div> <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// representation about the suitability of this software for any</span></div> <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// purpose. It is provided "as is" without express or implied</span></div> <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warranty.</span></div> <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div> <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/**</span></div> <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * @file pat_trie_/debug_fn_imps.hpp</span></div> <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation class for pat_trie_.</span></div> <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div> <div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div> <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div> <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor"></span></div> <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> PB_DS_CLASS_T_DEC</div> <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="keywordtype">void</span></div> <div class="line"><a name="l00045"></a><span class="lineno"> 45</span> PB_DS_CLASS_C_DEC::</div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> assert_valid(<span class="keyword">const</span> <span class="keywordtype">char</span>* __file, <span class="keywordtype">int</span> __line)<span class="keyword"> const</span></div> <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword"></span>{</div> <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent != 0)</div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  m_p_head->m_p_parent->assert_valid(<span class="keyword">this</span>, __file, __line);</div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  assert_iterators(__file, __line);</div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  assert_reverse_iterators(__file, __line);</div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent == 0)</div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  PB_DS_DEBUG_VERIFY(m_p_head->m_p_min == m_p_head);</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  PB_DS_DEBUG_VERIFY(m_p_head->m_p_max == m_p_head);</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  PB_DS_DEBUG_VERIFY(empty());</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span>;</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node);</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node);</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  PB_DS_DEBUG_VERIFY(!empty());</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span> }</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> PB_DS_CLASS_T_DEC</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keywordtype">void</span></div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span> PB_DS_CLASS_C_DEC::</div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span> assert_iterators(<span class="keyword">const</span> <span class="keywordtype">char</span>* __file, <span class="keywordtype">int</span> __line)<span class="keyword"> const</span></div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="keyword"></span>{</div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  size_type calc_size = 0;</div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">for</span> (const_iterator it = <a class="code" href="a01604.html#a549ebac15bcc03ae83f87b89796d89fc" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>(); it != <a class="code" href="a01604.html#a579ff3807b61f57bda29d023b3918504" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(); ++it)</div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  ++calc_size;</div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line);</div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it);</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  PB_DS_DEBUG_VERIFY(calc_size == m_size);</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span> }</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> PB_DS_CLASS_T_DEC</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keywordtype">void</span></div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span> PB_DS_CLASS_C_DEC::</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span> assert_reverse_iterators(<span class="keyword">const</span> <span class="keywordtype">char</span>* __file, <span class="keywordtype">int</span> __line)<span class="keyword"> const</span></div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="keyword"></span>{</div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  size_type calc_size = 0;</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (const_reverse_iterator it = rbegin(); it != rend(); ++it)</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  {</div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  ++calc_size;</div> <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  node_const_pointer p_nd =</div> <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">const_cast<</span>PB_DS_CLASS_C_DEC*<span class="keyword">></span>(<span class="keyword">this</span>)->find_imp(PB_DS_V2F(*it));</div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  PB_DS_DEBUG_VERIFY(calc_size == m_size);</div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span> }</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> PB_DS_CLASS_T_DEC</div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::size_type</div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span> PB_DS_CLASS_C_DEC::</div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> recursive_count_leafs(node_const_pointer p_nd, <span class="keyword">const</span> <span class="keywordtype">char</span>* __file, <span class="keywordtype">int</span> __line)</div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> {</div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span> (p_nd == 0)</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">return</span> (0);</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (p_nd->m_type == leaf_node)</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> (1);</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  size_type ret = 0;</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">for</span> (<span class="keyword">typename</span> inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)-><a class="code" href="a01604.html#a549ebac15bcc03ae83f87b89796d89fc" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>();</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  it != <span class="keyword">static_cast<</span>inode_const_pointer<span class="keyword">></span>(p_nd)-><a class="code" href="a01604.html#a579ff3807b61f57bda29d023b3918504" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>();</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  ++it)</div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  ret += recursive_count_leafs(*it, __file, __line);</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> ret;</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span> }</div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor">#endif</span></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_9fd2c24bcafa2f71ff52c79e6ae82b6c.html">include</a></li><li class="navelem"><a class="el" href="dir_e51975699086833cfe90d160770f5392.html">ext</a></li><li class="navelem"><a class="el" href="dir_da28a64a1ef7c57199de0c285d0328f8.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_147257d41c2aadf20db3311bee93c89c.html">detail</a></li><li class="navelem"><a class="el" href="dir_b79581e35f2a87c9d1b117579f8f5c2b.html">pat_trie_</a></li><li class="navelem"><a class="el" href="a01121.html">debug_fn_imps.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.8.3 </li> </ul> </div> </body> </html>