backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-03 01:14:02 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures::circular_linked_list::Node Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -115,20 +115,20 @@ Collaboration diagram for operations_on_datastructures::circular_linked_list::No
<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:a005dc56b0c58350a13f4796b9b30b6c5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">Node</a> (int64_t _data)</td></tr>
<tr class="memitem:a005dc56b0c58350a13f4796b9b30b6c5" id="r_a005dc56b0c58350a13f4796b9b30b6c5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">Node</a> (int64_t _data)</td></tr>
<tr class="memdesc:a005dc56b0c58350a13f4796b9b30b6c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates a new <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> with some initial data. <br /></td></tr>
<tr class="separator:a005dc56b0c58350a13f4796b9b30b6c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a12a06eef5ccaf667f319506eee655d95"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95">Node</a> (int64_t _data, <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *_next)</td></tr>
<tr class="memitem:a12a06eef5ccaf667f319506eee655d95" id="r_a12a06eef5ccaf667f319506eee655d95"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95">Node</a> (int64_t _data, <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *_next)</td></tr>
<tr class="memdesc:a12a06eef5ccaf667f319506eee655d95"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates a new <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> with initial data and a successor. <br /></td></tr>
<tr class="separator:a12a06eef5ccaf667f319506eee655d95"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a7461292b8b91aed86404d0ab019dfdd1"><td class="memItemLeft" align="right" valign="top"><a id="a7461292b8b91aed86404d0ab019dfdd1" name="a7461292b8b91aed86404d0ab019dfdd1"></a>
<tr class="memitem:a7461292b8b91aed86404d0ab019dfdd1" id="r_a7461292b8b91aed86404d0ab019dfdd1"><td class="memItemLeft" align="right" valign="top"><a id="a7461292b8b91aed86404d0ab019dfdd1" name="a7461292b8b91aed86404d0ab019dfdd1"></a>
int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<tr class="memdesc:a7461292b8b91aed86404d0ab019dfdd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:a7461292b8b91aed86404d0ab019dfdd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memItemLeft" align="right" valign="top"><a id="a7c867b8e1034a6f5da490c8b8c09cb77" name="a7c867b8e1034a6f5da490c8b8c09cb77"></a>
<tr class="memitem:a7c867b8e1034a6f5da490c8b8c09cb77" id="r_a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memItemLeft" align="right" valign="top"><a id="a7c867b8e1034a6f5da490c8b8c09cb77" name="a7c867b8e1034a6f5da490c8b8c09cb77"></a>
<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
<tr class="memdesc:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>'s successor. <br /></td></tr>
<tr class="separator:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -238,7 +238,7 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>circular_linked_list</b></li><li class="navelem"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>