diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.html b/d1/def/classdata__structures_1_1linked__list_1_1list.html index c2f82db15..63d8720d1 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list.html +++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html @@ -99,6 +99,7 @@ $(document).ready(function(){initNavTree('d1/def/classdata__structures_1_1linked
+Private Member Functions | |
| void | delete_all_nodes () |
| calls delete operator on every node in the represented list | |
| void | copy_all_nodes_from_list (const list &other) |
Private Attributes | |
| last link on the list | |
| -Node * | head | head = nullptr |
| list::~list | +( | +) | ++ |
| list::list | +( | +const list & | +other | ) | ++ |
copy constructor creating a deep copy of every node of the input
+| data_structures::linked_list::list::list | +void list::copy_all_nodes_from_list | +( | +const list & | +other | ) | ++ |
+
|
-inline | +private
List constructor. Initializes the first link.
-calls delete operator on every node in the represented list
+Utility function that checks if the list is empty.
function checks if list is empty
| bool list::isEmpty | +( | +) | +const | +
Utility function that checks if the list is empty.
+assignment operator creating a deep copy of every node of the input
+Utility function for reversing a list.
Using the current, previous, and next pointer.
Utility function to find the top element of the list.
Utility function to find the i th element of the list.
Data Structures algorithms
for io operations for std::array
Algorithms with data structures
-for assert for I/O operations for dynamic memory
+for assert for I/O operations
Data Structures algorithms
for std::array for assert
Data Structures algorithms
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html index ca4550dc1..8dfee3503 100644 --- a/d6/d05/reverse__a__linked__list_8cpp.html +++ b/d6/d05/reverse__a__linked__list_8cpp.html @@ -109,12 +109,11 @@ $(document).ready(function(){initNavTree('d6/d05/reverse__a__linked__list_8cpp.h More...#include <cassert>#include <iostream>#include <memory>#include <new>