<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: trace_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="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</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 id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</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">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a17178_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">pat_trie_/trace_fn_imps.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a17178.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-2018 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_/trace_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 PB_DS_PAT_TRIE_TRACE_</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</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> trace()<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>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <a class="code" href="a01538.html#a8b3758bb8f17c440c7963363f42f69f3">std::endl</a>;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (m_p_head->m_p_parent == 0)</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  trace_node(m_p_head->m_p_parent, 0);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <a class="code" href="a01538.html#a8b3758bb8f17c440c7963363f42f69f3">std::endl</a>;</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> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> trace_node(node_const_pointer p_nd, size_type level)</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>  <span class="keywordflow">for</span> (size_type i = 0; i < level; ++i)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <span class="charliteral">' '</span>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << p_nd << <span class="stringliteral">" "</span>;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << ((p_nd->m_type == pat_trie_leaf_node_type) ? <span class="stringliteral">"l "</span> : <span class="stringliteral">"i "</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>  trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>());</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">typename</span> access_traits::const_iterator el_it = pref_begin(p_nd);</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">while</span> (el_it != pref_end(p_nd))</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> <<* el_it;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  ++el_it;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</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>  <span class="keywordflow">if</span> (p_nd->m_type == pat_trie_leaf_node_type)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <a class="code" href="a01538.html#a8b3758bb8f17c440c7963363f42f69f3">std::endl</a>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">return</span>;</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> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  inode_const_pointer p_internal = static_cast<inode_const_pointer>(p_nd);</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>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <span class="stringliteral">" "</span> <<</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  static_cast<unsigned long>(p_internal->get_e_ind()) << <a class="code" href="a01538.html#a8b3758bb8f17c440c7963363f42f69f3">std::endl</a>;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">const</span> size_type num_children = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(p_internal->begin(),</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  p_internal->end());</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (size_type child_i = 0; child_i < num_children; ++child_i)</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>  <span class="keyword">typename</span> inode::const_iterator child_it = p_internal->begin();</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="a01538.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(child_it, num_children - child_i - 1);</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  trace_node(*child_it, level + 1);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</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> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">template</span><<span class="keyword">typename</span> Metadata_></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a> << <span class="stringliteral">"("</span> << static_cast<unsigned long>(p_nd->get_metadata()) << <span class="stringliteral">") "</span>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> trace_node_metadata(node_const_pointer, type_to_type<null_type>)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> { }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor">#endif </span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="ttc" id="a01538_html_a8b3758bb8f17c440c7963363f42f69f3"><div class="ttname"><a href="a01538.html#a8b3758bb8f17c440c7963363f42f69f3">std::endl</a></div><div class="ttdeci">basic_ostream< _CharT, _Traits > & endl(basic_ostream< _CharT, _Traits > &__os)</div><div class="ttdoc">Write a newline and flush the stream.</div><div class="ttdef"><b>Definition:</b> <a href="a00116_source.html#l00593">ostream:593</a></div></div>
<div class="ttc" id="a01538_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a01538_html_a7431d56d1e8cd7a9b854171294bd71c7"><div class="ttname"><a href="a01538.html#a7431d56d1e8cd7a9b854171294bd71c7">std::cerr</a></div><div class="ttdeci">ostream cerr</div><div class="ttdoc">Linked to standard output.</div></div>
<div class="ttc" id="a01538_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01538.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></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_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="dir_afaff2f5b61f44d50c9875b428318082.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_f37d910f5ba825954160494085256009.html">detail</a></li><li class="navelem"><a class="el" href="dir_09cd9b3d747c5003a266aeaaa2ec69e9.html">pat_trie_</a></li><li class="navelem"><a class="el" href="a17178.html">trace_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.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
6752
