backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 8df7a884f5

Browse Source
This commit is contained in:
realstealthninja
2024-09-13 23:40:36 +00:00
parent c375b9a1ae
commit 5afa9cbbe9
2 changed files with 93 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
d0/d62/struct_queue-members.html
View File

@@ -110,16 +110,19 @@ $(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(tru
<p>This is the complete list of members for <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>createNode</b>(int val) (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>createNode</b>(int val) (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>dequeue</b>() (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>enqueue</b>(int val) (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>front</b> (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>front</b> (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>operator=</b>(const Queue &amp;)=delete (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>Queue</b>(const Queue &amp;)=delete (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>Queue</b>()=default (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>rear</b> (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>rear</b> (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>t</b> (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>traverse</b>() (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>~Queue</b>() (defined in <a class="el" href="../../dc/db5/struct_queue.html">Queue</a>)</td><td class="entry"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

134
dc/db5/struct_queue.html
View File

@@ -107,6 +107,7 @@ $(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(tru
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d0/d62/struct_queue-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">Queue Class Reference</div></div>
@@ -120,8 +121,6 @@ Collaboration diagram for Queue:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a7df5a5794b817bccb0d288e3e7893326" id="r_a7df5a5794b817bccb0d288e3e7893326"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7df5a5794b817bccb0d288e3e7893326">createNode</a> (int val)</td></tr>
<tr class="separator:a7df5a5794b817bccb0d288e3e7893326"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8e9326b15e162c2d7d663c5cfbdd4405" id="r_a8e9326b15e162c2d7d663c5cfbdd4405"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e9326b15e162c2d7d663c5cfbdd4405">enqueue</a> (int val)</td></tr>
<tr class="separator:a8e9326b15e162c2d7d663c5cfbdd4405"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa01ff898c2bdab7e804bf243eb5bfb31" id="r_aa01ff898c2bdab7e804bf243eb5bfb31"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa01ff898c2bdab7e804bf243eb5bfb31">dequeue</a> ()</td></tr>
@@ -141,15 +140,57 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>front</b></td></tr>
int&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b></td></tr>
<tr class="separator:a8303807ce298d63d958f7e5765034d70"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a7a63a6fa59a5522f5a4798a17382ebe7" id="r_a7a63a6fa59a5522f5a4798a17382ebe7"><td class="memItemLeft" align="right" valign="top"><a id="a7a63a6fa59a5522f5a4798a17382ebe7" name="a7a63a6fa59a5522f5a4798a17382ebe7"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Queue</b> (const <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> &amp;)=delete</td></tr>
<tr class="separator:a7a63a6fa59a5522f5a4798a17382ebe7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a489e02505707a98e0f562651a9132bc0" id="r_a489e02505707a98e0f562651a9132bc0"><td class="memItemLeft" align="right" valign="top"><a id="a489e02505707a98e0f562651a9132bc0" name="a489e02505707a98e0f562651a9132bc0"></a>
<a class="el" href="../../dc/db5/struct_queue.html">Queue</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (const <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> &amp;)=delete</td></tr>
<tr class="separator:a489e02505707a98e0f562651a9132bc0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7df5a5794b817bccb0d288e3e7893326" id="r_a7df5a5794b817bccb0d288e3e7893326"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7df5a5794b817bccb0d288e3e7893326">createNode</a> (int val)</td></tr>
<tr class="separator:a7df5a5794b817bccb0d288e3e7893326"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a31b892ad81d0e915c20c8f6a88e75f02" id="r_a31b892ad81d0e915c20c8f6a88e75f02"><td class="memItemLeft" align="right" valign="top"><a id="a31b892ad81d0e915c20c8f6a88e75f02" name="a31b892ad81d0e915c20c8f6a88e75f02"></a>
<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>front</b> =nullptr</td></tr>
<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>front</b> = nullptr</td></tr>
<tr class="separator:a31b892ad81d0e915c20c8f6a88e75f02"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3ed9e95fefd0c13071d192c1512c8db3" id="r_a3ed9e95fefd0c13071d192c1512c8db3"><td class="memItemLeft" align="right" valign="top"><a id="a3ed9e95fefd0c13071d192c1512c8db3" name="a3ed9e95fefd0c13071d192c1512c8db3"></a>
<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b> =nullptr</td></tr>
<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b> = nullptr</td></tr>
<tr class="separator:a3ed9e95fefd0c13071d192c1512c8db3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a00d119db8fa3050da37746e82cbcf94f" name="a00d119db8fa3050da37746e82cbcf94f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a00d119db8fa3050da37746e82cbcf94f">&#9670;&#160;</a></span>~Queue()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Queue::~Queue </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 16</span> {</div>
<div class="line"><span class="lineno"> 17</span> <span class="keywordflow">while</span> (front) {</div>
<div class="line"><span class="lineno"> 18</span> dequeue();</div>
<div class="line"><span class="lineno"> 19</span> }</div>
<div class="line"><span class="lineno"> 20</span> }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a7df5a5794b817bccb0d288e3e7893326" name="a7df5a5794b817bccb0d288e3e7893326"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7df5a5794b817bccb0d288e3e7893326">&#9670;&#160;</a></span>createNode()</h2>
@@ -169,17 +210,17 @@ Private Attributes</h2></td></tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 13</span> {</div>
<div class="line"><span class="lineno"> 14</span> <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 15</span> nn-&gt;data = val;</div>
<div class="line"><span class="lineno"> 16</span> nn-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 17</span> front = nn;</div>
<div class="line"><span class="lineno"> 18</span> rear = nn;</div>
<div class="line"><span class="lineno"> 19</span> }</div>
<div class="fragment"><div class="line"><span class="lineno"> 23</span> {</div>
<div class="line"><span class="lineno"> 24</span> <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 25</span> nn-&gt;data = val;</div>
<div class="line"><span class="lineno"> 26</span> nn-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 27</span> front = nn;</div>
<div class="line"><span class="lineno"> 28</span> rear = nn;</div>
<div class="line"><span class="lineno"> 29</span> }</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
</div><!-- fragment -->
</div>
@@ -206,14 +247,20 @@ Private Attributes</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 33</span> {</div>
<div class="line"><span class="lineno"> 34</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* n;</div>
<div class="line"><span class="lineno"> 35</span> n = front;</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">if</span> (n) {</div>
<div class="line"><span class="lineno"> 37</span> front = front-&gt;next;</div>
<div class="line"><span class="lineno"> 38</span> <span class="keyword">delete</span> n;</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="line"><span class="lineno"> 40</span> }</div>
<div class="fragment"><div class="line"><span class="lineno"> 43</span> {</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 46</span> }</div>
<div class="line"><span class="lineno"> 47</span> <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* <span class="keyword">const</span> n = front;</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">if</span> (front == rear) {</div>
<div class="line"><span class="lineno"> 49</span> front = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 50</span> rear = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 51</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 52</span> front = front-&gt;next;</div>
<div class="line"><span class="lineno"> 53</span> rear-&gt;next = front;</div>
<div class="line"><span class="lineno"> 54</span> }</div>
<div class="line"><span class="lineno"> 55</span> <span class="keyword">delete</span> n;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
</div><!-- fragment -->
</div>
@@ -240,19 +287,17 @@ Private Attributes</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 20</span> {</div>
<div class="line"><span class="lineno"> 21</span> <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span> || rear == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 22</span> createNode(val);</div>
<div class="line"><span class="lineno"> 23</span> }</div>
<div class="line"><span class="lineno"> 24</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 25</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* nn;</div>
<div class="line"><span class="lineno"> 26</span> nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 27</span> nn-&gt;data = val;</div>
<div class="line"><span class="lineno"> 28</span> rear-&gt;next = nn;</div>
<div class="line"><span class="lineno"> 29</span> nn-&gt;next = front;</div>
<div class="line"><span class="lineno"> 30</span> rear = nn;</div>
<div class="line"><span class="lineno"> 31</span> }</div>
<div class="line"><span class="lineno"> 32</span> }</div>
<div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span> || rear == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 34</span> createNode(val);</div>
<div class="line"><span class="lineno"> 35</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 36</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 37</span> nn-&gt;data = val;</div>
<div class="line"><span class="lineno"> 38</span> rear-&gt;next = nn;</div>
<div class="line"><span class="lineno"> 39</span> nn-&gt;next = front;</div>
<div class="line"><span class="lineno"> 40</span> rear = nn;</div>
<div class="line"><span class="lineno"> 41</span> }</div>
<div class="line"><span class="lineno"> 42</span> }</div>
</div><!-- fragment -->
</div>
</div>
@@ -278,19 +323,18 @@ Private Attributes</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 41</span> {</div>
<div class="line"><span class="lineno"> 42</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* ptr;</div>
<div class="line"><span class="lineno"> 43</span> ptr = front;</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">if</span> (ptr) {</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 46</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; ptr-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 47</span> ptr = ptr-&gt;next;</div>
<div class="line"><span class="lineno"> 48</span> } <span class="keywordflow">while</span> (ptr != rear-&gt;next);</div>
<div class="line"><span class="lineno"> 49</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; front-&gt;data &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="fragment"><div class="line"><span class="lineno"> 57</span> {</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* ptr = front;</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; ptr-&gt;data &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
<div class="line"><span class="lineno"> 64</span> ptr = ptr-&gt;next;</div>
<div class="line"><span class="lineno"> 65</span> } <span class="keywordflow">while</span> (ptr != front);</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><span class="lineno"> 67</span> }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>