diff --git a/annotated.html b/annotated.html index c86c6b941..257a39f03 100644 --- a/annotated.html +++ b/annotated.html @@ -236,7 +236,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CMinHeapNode  Cmst  CNode - Cnode + CnodeFor std::vector  CPoint  Cquery  CQueue diff --git a/d0/d1f/structnode__coll__graph.map b/d0/d1f/structnode__coll__graph.map index 2ad5dbbdc..05d8b400d 100644 --- a/d0/d1f/structnode__coll__graph.map +++ b/d0/d1f/structnode__coll__graph.map @@ -1,4 +1,6 @@ - - + + + + diff --git a/d0/d1f/structnode__coll__graph.md5 b/d0/d1f/structnode__coll__graph.md5 index 3d950c478..73aa9af3f 100644 --- a/d0/d1f/structnode__coll__graph.md5 +++ b/d0/d1f/structnode__coll__graph.md5 @@ -1 +1 @@ -74e13185cf6274cf15716da13dde9a2c \ No newline at end of file +64be8d600bf9338baa941a9418a943cb \ No newline at end of file diff --git a/d0/d1f/structnode__coll__graph.svg b/d0/d1f/structnode__coll__graph.svg index 61027b20f..7d82520b8 100644 --- a/d0/d1f/structnode__coll__graph.svg +++ b/d0/d1f/structnode__coll__graph.svg @@ -4,14 +4,14 @@ - - + + node< Kind > Node1 - + node< Kind > @@ -20,35 +20,101 @@ Node2 - - -node< Kind > + + +node< Kind > Node2->Node1 - - - left -link -next -parent -prev -right + + + left +link +next +parent +prev +right Node2->Node2 - - - left -link -next -parent -prev -right + + + left +link +next +parent +prev +right + + + +Node4 + + +node< ValueType > + + + + + +Node2->Node4 + + + left +link +next +parent +prev +right + + + +Node3 + + +std::shared_ptr< node +< ValueType > > + + + + + +Node3->Node1 + + + next + + + +Node3->Node2 + + + next + + + +Node3->Node4 + + + next + + + +Node4->Node3 + + + ptr + + + +Node4->Node4 + + + next diff --git a/d0/d2c/class_r_btree__coll__graph.map b/d0/d2c/class_r_btree__coll__graph.map index e5beb2fa5..86762b019 100644 --- a/d0/d2c/class_r_btree__coll__graph.map +++ b/d0/d2c/class_r_btree__coll__graph.map @@ -1,4 +1,6 @@ - - + + + + diff --git a/d0/d2c/class_r_btree__coll__graph.md5 b/d0/d2c/class_r_btree__coll__graph.md5 index 41287f5c9..3e23616dc 100644 --- a/d0/d2c/class_r_btree__coll__graph.md5 +++ b/d0/d2c/class_r_btree__coll__graph.md5 @@ -1 +1 @@ -732f51478a30d6337d77940fb8e7207b \ No newline at end of file +1fb0a2fe48eda261e9d0e48b43c32ec7 \ No newline at end of file diff --git a/d0/d2c/class_r_btree__coll__graph.svg b/d0/d2c/class_r_btree__coll__graph.svg index 364f73b18..736e382b3 100644 --- a/d0/d2c/class_r_btree__coll__graph.svg +++ b/d0/d2c/class_r_btree__coll__graph.svg @@ -4,47 +4,106 @@ - - + + RBtree Node1 - -RBtree + +RBtree Node2 - - -node< Kind > + + +node< Kind > Node2->Node1 - - - q -root + + + q +root Node2->Node2 - - - left -link -next -parent -prev -right + + + left +link +next +parent +prev +right + + + +Node4 + + +node< ValueType > + + + + + +Node2->Node4 + + + left +link +next +parent +prev +right + + + +Node3 + + +std::shared_ptr< node +< ValueType > > + + + + + +Node3->Node2 + + + next + + + +Node3->Node4 + + + next + + + +Node4->Node3 + + + ptr + + + +Node4->Node4 + + + next diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html index e5e4d7da8..b633c5e50 100644 --- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html +++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html @@ -238,7 +238,7 @@ static constexpr uint8_t E
55 endOfWord = node.endOfWord;
56 frequency = node.frequency;
57 }
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
diff --git a/d1/d57/classcll__coll__graph.map b/d1/d57/classcll__coll__graph.map index 22d48e211..b9a00c0bc 100644 --- a/d1/d57/classcll__coll__graph.map +++ b/d1/d57/classcll__coll__graph.map @@ -1,4 +1,6 @@ - - + + + + diff --git a/d1/d57/classcll__coll__graph.md5 b/d1/d57/classcll__coll__graph.md5 index 62ff524be..089621689 100644 --- a/d1/d57/classcll__coll__graph.md5 +++ b/d1/d57/classcll__coll__graph.md5 @@ -1 +1 @@ -bfe5114981176deeb79ea31360182928 \ No newline at end of file +3d94224c85cedfbc0da72d474e11aa3e \ No newline at end of file diff --git a/d1/d57/classcll__coll__graph.svg b/d1/d57/classcll__coll__graph.svg index 80f865f0e..7151d3b65 100644 --- a/d1/d57/classcll__coll__graph.svg +++ b/d1/d57/classcll__coll__graph.svg @@ -4,46 +4,105 @@ - - + + cll Node1 - -cll + +cll Node2 - - -node< Kind > + + +node< Kind > Node2->Node1 - - - head + + + head Node2->Node2 - - - left -link -next -parent -prev -right + + + left +link +next +parent +prev +right + + + +Node4 + + +node< ValueType > + + + + + +Node2->Node4 + + + left +link +next +parent +prev +right + + + +Node3 + + +std::shared_ptr< node +< ValueType > > + + + + + +Node3->Node2 + + + next + + + +Node3->Node4 + + + next + + + +Node4->Node3 + + + ptr + + + +Node4->Node4 + + + next diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html index f770100e2..86241c592 100644 --- a/d1/dc2/classstack.html +++ b/d1/dc2/classstack.html @@ -5,7 +5,7 @@ -Algorithms_in_C++: stack< Type > Class Template Reference +Algorithms_in_C++: stack< ValueType > Class Template Reference @@ -98,197 +98,82 @@ $(document).ready(function(){initNavTree('d1/dc2/classstack.html','../../'); ini
+Public Types | Public Member Functions | +Private Member Functions | Private Attributes | List of all members
-
stack< Type > Class Template Reference
+
stack< ValueType > Class Template Reference
-

#include <stack.h>

+

#include <stack.hpp>

-Collaboration diagram for stack< Type >:
+Collaboration diagram for stack< ValueType >:
-
+
[legend]
+ + + +

+Public Types

+using value_type = ValueType
 
- - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + +

Public Member Functions

void display ()
 
 stack ()
 
 stack (const stack< Type > &otherStack)
 
 ~stack ()
 
bool isEmptyStack ()
 
void push (Type item)
 
Type top ()
 
void pop ()
 
void clear ()
 
stack< Type > & operator= (const stack< Type > &otherStack)
 
void display () const
 
std::vector< value_type > toVector () const
 
bool isEmptyStack () const
 
void push (const value_type &item)
 
value_type top () const
 
void pop ()
 
void clear ()
 
+ + +

+Private Member Functions

void ensureNotEmpty () const
 
- - - - - + + + + +

Private Attributes

node< Type > * stackTop
 
-int size
 size of stack
 
std::shared_ptr< node< value_type > > stackTop
 
+std::size_t size = 0
 size of stack
 

Detailed Description

-
template<class Type>
-class stack< Type >

Definition of the stack class

Template Parameters
+
template<class ValueType>
+class stack< ValueType >

Definition of the stack class

Template Parameters
- +
Typetype of data nodes of the linked list in the stack should contain
value_typetype of data nodes of the linked list in the stack should contain
-

Constructor & Destructor Documentation

- -

◆ stack() [1/2]

+

Member Function Documentation

+ +

◆ clear()

-template<class Type >
+template<class ValueType >
- - -
- - - - - -
stack< Type >::stack ()
- 		-inline
-
-

Default constructor

-
41 {
-
42 stackTop = nullptr;
-
43 size = 0;
-
44 }
-
stack::stackTop
node< Type > * stackTop
Definition: stack.h:146
-
stack::size
int size
size of stack
Definition: stack.h:147
-
-
-
- -

◆ stack() [2/2]

- -
-
-
-template<class Type >
- - - - - -
- - - - - - - - -
stack< Type >::stack (const stack< Type > & otherStack)
- 		-inlineexplicit
-
-

Copy constructor

-
47 {
-
48 node<Type> *newNode, *current, *last;
-
49
-
50 /* If stack is no empty, make it empty */
-
51 if (stackTop != nullptr) {
-
52 stackTop = nullptr;
-
53 }
-
54 if (otherStack.stackTop == nullptr) {
-
55 stackTop = nullptr;
-
56 } else {
-
57 current = otherStack.stackTop;
-
58 stackTop = new node<Type>;
-
59 stackTop->data = current->data;
-
60 stackTop->next = nullptr;
-
61 last = stackTop;
-
62 current = current->next;
-
63 /* Copy the remaining stack */
-
64 while (current != nullptr) {
-
65 newNode = new node<Type>;
-
66 newNode->data = current->data;
-
67 newNode->next = nullptr;
-
68 last->next = newNode;
-
69 last = newNode;
-
70 current = current->next;
-
71 }
-
72 }
-
73 size = otherStack.size;
-
74 }
-
node
Definition: avltree.cpp:13
-
-
-
- -

◆ ~stack()

- -
-
-
-template<class Type >
- - - - - -
- - - - - - - -
stack< Type >::~stack ()
- 		-inline
-
-

Destructor

-
77{}
-
-
-
-

Member Function Documentation

- -

◆ clear()

- -
-
-
-template<class Type >
- - -
- - - + @@ -301,26 +186,31 @@ template<class Type >
void stack< Type >::clear void stack< ValueType >::clear ( )

Clear stack

-
112{ stackTop = nullptr; }
+
95 {
+
96 stackTop = nullptr;
+
97 size = 0;
+
98 }
+
stack::size
std::size_t size
size of stack
Definition: stack.hpp:103
+
stack::stackTop
std::shared_ptr< node< value_type > > stackTop
Definition: stack.hpp:101
- -

◆ display()

+ +

◆ display()

-template<class Type >
+template<class ValueType >
@@ -330,43 +220,77 @@ template<class Type >
- + - +
void stack< Type >::display void stack< ValueType >::display ( ) const

Show stack

-
29 {
-
30 node<Type> *current = stackTop;
-
31 std::cout << "Top --> ";
-
32 while (current != nullptr) {
-
33 std::cout << current->data << " ";
-
34 current = current->next;
-
35 }
-
36 std::cout << std::endl;
-
37 std::cout << "Size of stack: " << size << std::endl;
-
38 }
+
43 {
+
44 std::cout << "Top --> ";
+
45 traverse(stackTop.get(), [](const node<value_type>& inNode) {
+
46 std::cout << inNode.data << " ";
+
47 });
+
48 std::cout << std::endl;
+
49 std::cout << "Size of stack: " << size << std::endl;
+
50 }
std::endl
T endl(T... args)
+
std::shared_ptr::get
T get(T... args)
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
-
+
- -

◆ isEmptyStack()

+ +

◆ ensureNotEmpty()

-template<class Type >
+template<class ValueType >
+ + +
- + - + + +
bool stack< Type >::isEmptyStack void stack< ValueType >::ensureNotEmpty ( ) const
+ 		+inlineprivate
+
+
62 {
+
63 if (isEmptyStack()) {
+
64 throw std::invalid_argument("Stack is empty.");
+
65 }
+
66 }
+
stack::isEmptyStack
bool isEmptyStack() const
Definition: stack.hpp:70
+ +
+
+
+ +

◆ isEmptyStack()

+ +
+
+
+template<class ValueType >
+ + + @@ -376,81 +300,23 @@ template<class Type >
+ + + + + +
bool stack< ValueType >::isEmptyStack () const

Determine whether the stack is empty

-
80{ return (stackTop == nullptr); }
+
70{ return (stackTop == nullptr); }
- -

◆ operator=()

+ +

◆ pop()

-template<class Type >
+template<class ValueType >
- - -
- - - - - - -
stack< Type > & stack< Type >::operator= (const stack< Type > & otherStack)
- 		-inline
-
-

Overload "=" the assignment operator

-
115 {
-
116 node<Type> *newNode, *current, *last;
-
117
-
118 /* If stack is no empty, make it empty */
-
119 if (stackTop != nullptr) {
-
120 stackTop = nullptr;
-
121 }
-
122 if (otherStack.stackTop == nullptr) {
-
123 stackTop = nullptr;
-
124 } else {
-
125 current = otherStack.stackTop;
-
126 stackTop = new node<Type>;
-
127 stackTop->data = current->data;
-
128 stackTop->next = nullptr;
-
129 last = stackTop;
-
130 current = current->next;
-
131 /* Copy the remaining stack */
-
132 while (current != nullptr) {
-
133 newNode = new node<Type>;
-
134 newNode->data = current->data;
-
135 newNode->next = nullptr;
-
136 last->next = newNode;
-
137 last = newNode;
-
138 current = current->next;
-
139 }
-
140 }
-
141 size = otherStack.size;
-
142 return *this;
-
143 }
-
-
-
- -

◆ pop()

- -
-
-
-template<class Type >
- - -
105}
std::string::c_str
T c_str(T... args)
-
stack
Definition: stack.h:26
+
stack
Definition: stack.hpp:38
others::postfix_expression::push
void push(float operand, Stack *stack)
Pushing operand, also called the number in the array to the stack.
Definition: postfix_evaluation.cpp:44
Here is the call graph for this function:
-
+
@@ -360,19 +360,12 @@ Here is the call graph for this function:
Returns
operand float on top of stack
54 {
-
55 float operand = stack->stack[stack->stackTop];
-
56 stack->stackTop--;
+
55 float operand = stack->stack[stack->stackTop];
+
56 stack->stackTop--;
57 return operand;
58}
-
stack::stack
stack()
Definition: stack.h:41
-
stack::stackTop
node< Type > * stackTop
Definition: stack.h:146
-
-Here is the call graph for this function:
-
-
-
-
- +
stack::stackTop
std::shared_ptr< node< value_type > > stackTop
Definition: stack.hpp:101
+ @@ -425,9 +418,9 @@ template< 130 j++;
131 }
132
-
133 std::cout << stack.stack[stack.stackTop] << "\n";
+
133 std::cout << stack.stack[stack.stackTop] << "\n";
134
-
135 return stack.stack[stack.stackTop];
+
135 return stack.stack[stack.stackTop];
136}
others::postfix_expression::is_number
bool is_number(const std::string &s)
Checks if scanned string is a number.
Definition: postfix_evaluation.cpp:65
@@ -436,7 +429,7 @@ template< Here is the call graph for this function:
-
+
@@ -478,16 +471,10 @@ Here is the call graph for this function:
Returns
none
44 {
-
45 stack->stackTop++;
-
46 stack->stack[stack->stackTop] = operand;
+
45 stack->stackTop++;
+
46 stack->stack[stack->stackTop] = operand;
47}
-
-Here is the call graph for this function:
-
-
-
-
- + diff --git a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.map b/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.map deleted file mode 100644 index 9d8e10571..000000000 --- a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.md5 deleted file mode 100644 index e1fa24217..000000000 --- a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -b6770de2054c98ee21dfe3ba3bbc2494 \ No newline at end of file diff --git a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.svg deleted file mode 100644 index 49b5b4200..000000000 --- a/d7/d75/postfix__evaluation_8cpp_a421baa2002a64bc0bfc3e1b64800d734_cgraph.svg +++ /dev/null @@ -1,36 +0,0 @@ - - - - - - -others::postfix_expression::pop - - -Node1 - - -others::postfix_expression::pop - - - - - -Node2 - - -stack::stack - - - - - -Node1->Node2 - - - - - diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map index c04388696..abcf77e0c 100644 --- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map +++ b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map @@ -2,5 +2,4 @@ - diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5 index 6a1424305..bf405518e 100644 --- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5 +++ b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5 @@ -1 +1 @@ -58be95fe5ec35365e4a484053833b58a \ No newline at end of file +d6b70ec65398291405c2964f21cfcf75 \ No newline at end of file diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg index 7c0ebb4b0..e9f5e3a88 100644 --- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg +++ b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg @@ -4,8 +4,8 @@ - + others::postfix_expression::evaluate @@ -55,20 +55,5 @@ - - -Node4 - - -stack::stack - - - - - -Node3->Node4 - - - diff --git a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.map b/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.map deleted file mode 100644 index 66eb197c0..000000000 --- a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.md5 deleted file mode 100644 index 8b5b09a21..000000000 --- a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -74322c7b55bb5a1101eb7b682e4d4918 \ No newline at end of file diff --git a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.svg deleted file mode 100644 index 83b352ba1..000000000 --- a/d7/d75/postfix__evaluation_8cpp_ad77f8c9cc594975756838d498c237cea_cgraph.svg +++ /dev/null @@ -1,37 +0,0 @@ - - - - - - -others::postfix_expression::push - - -Node1 - - -others::postfix_expression -::push - - - - - -Node2 - - -stack::stack - - - - - -Node1->Node2 - - - - - diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map index cde0ad9df..7f667af0c 100644 --- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map +++ b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map @@ -1,13 +1,12 @@ - + - - - + + - - - - + + + + diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5 index 9abfed5c9..e2ac0168b 100644 --- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5 +++ b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5 @@ -1 +1 @@ -8e145b47fc84ceb62b3223f47e497fce \ No newline at end of file +6ad7d8bdeae3d1373c0ce5efc043bdaa \ No newline at end of file diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg index dc7309aac..72e57ceab 100644 --- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg +++ b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg @@ -4,284 +4,175 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + others::postfix_expression::postfix_evaluation Node1 - -others::postfix_expression -::postfix_evaluation + +others::postfix_expression +::postfix_evaluation - + Node1->Node1 - - + + Node2 - -others::postfix_expression -::evaluate + +others::postfix_expression +::evaluate Node1->Node2 - - + + Node5 - - -stack::stack + + +others::postfix_expression +::is_number - + Node1->Node5 - - + + - - -Node6 - - -others::postfix_expression -::is_number + + +Node10 + + +std::stof - - -Node1->Node6 - - - - - -Node11 - - -std::stof - - - - - -Node1->Node11 - - + + +Node1->Node10 + + Node2->Node2 - - + + Node3 - -std::string::c_str + +std::string::c_str Node2->Node3 - - + + Node4 - -others::postfix_expression -::push + +others::postfix_expression +::push Node2->Node4 - - + + - - -Node4->Node5 - - + + +Node5->Node5 + + - - -Node6->Node6 - - - - - -Node7 - + + +Node6 + std::all_of - - -Node6->Node7 - - + + +Node5->Node6 + + - - -Node8 - + + +Node7 + std::string::begin - - -Node6->Node8 - - + + +Node5->Node7 + + - - -Node9 - + + +Node8 + std::string::empty - - -Node6->Node9 - - + + +Node5->Node8 + + - - -Node10 - + + +Node9 + std::string::end - - -Node6->Node10 - - + + +Node5->Node9 + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg deleted file mode 100644 index 9fb44bf85..000000000 --- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg +++ /dev/null @@ -1,199 +0,0 @@ - - - - - - -others::postfix_expression::postfix_evaluation - - -Node1 - - -others::postfix_expression -::postfix_evaluation - - - - - -Node1->Node1 - - - - - -Node2 - - -others::postfix_expression -::evaluate - - - - - -Node1->Node2 - - - - - -Node5 - - -stack::stack - - - - - -Node1->Node5 - - - - - -Node6 - - -others::postfix_expression -::is_number - - - - - -Node1->Node6 - - - - - -Node11 - - -std::stof - - - - - -Node1->Node11 - - - - - -Node2->Node2 - - - - - -Node3 - - -std::string::c_str - - - - - -Node2->Node3 - - - - - -Node4 - - -others::postfix_expression -::push - - - - - -Node2->Node4 - - - - - -Node4->Node5 - - - - - -Node6->Node6 - - - - - -Node7 - - -std::all_of - - - - - -Node6->Node7 - - - - - -Node8 - - -std::string::begin - - - - - -Node6->Node8 - - - - - -Node9 - - -std::string::empty - - - - - -Node6->Node9 - - - - - -Node10 - - -std::string::end - - - - - -Node6->Node10 - - - - - diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index 2941dd766..9a3c1bf2f 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -144,7 +144,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
42};
43#endif
cll
Definition: cll.h:17
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
diff --git a/d7/de0/stack_8h.js b/d7/de0/stack_8h.js deleted file mode 100644 index 0ad7a057d..000000000 --- a/d7/de0/stack_8h.js +++ /dev/null @@ -1,5 +0,0 @@ -var stack_8h = -[ - [ "node< Kind >", "d5/da1/structnode.html", "d5/da1/structnode" ], - [ "stack< Type >", "d1/dc2/classstack.html", "d1/dc2/classstack" ] -]; \ No newline at end of file diff --git a/d7/de0/stack_8h_source.html b/d7/de0/stack_8h_source.html deleted file mode 100644 index 1119c9c0c..000000000 --- a/d7/de0/stack_8h_source.html +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - -Algorithms_in_C++: data_structures/stack.h Source File - - - - - - - - - - - - - - - -
-
-
- - - + @@ -463,42 +329,29 @@ template<class Type >
void stack< Type >::pop void stack< ValueType >::pop ( )

Remove the top element of the stack

-
99 {
-
100 node<Type> *temp;
-
101 if (!isEmptyStack()) {
-
102 temp = stackTop;
-
103 stackTop = stackTop->next;
-
104 delete temp;
-
105 size--;
-
106 } else {
-
107 std::cout << "Stack is empty !" << std::endl;
-
108 }
-
109 }
-
stack::isEmptyStack
bool isEmptyStack()
Definition: stack.h:80
-
-Here is the call graph for this function:
-
-
+
88 {
+
89 ensureNotEmpty();
+
90 stackTop = stackTop->next;
+
91 size--;
+
92 }
+
- -
- - -

◆ push()

+ +

◆ push()

-template<class Type >
+template<class ValueType >
- + @@ -115,7 +115,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini - + diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html index bb0f7f1fc..9791fb081 100644 --- a/d1/df3/hash__search_8cpp.html +++ b/d1/df3/hash__search_8cpp.html @@ -231,7 +231,7 @@ int  + @@ -319,7 +320,7 @@ Variables
49 }
50 }
51}
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html index ace9d90ae..d27babeda 100644 --- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html +++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html @@ -631,7 +631,7 @@ Here is the call graph for this function:
631}
data_structures::tree_234::Tree234::SplitNode
Node * SplitNode(Node *node)
Split a 4-node to 1 parent and 2 children, and return the parent node.
Definition: tree_234.cpp:745
data_structures::tree_234::Tree234::MergeNodeNotFull
void MergeNodeNotFull(Node *dst_node, Node *node)
Merge node to a not-full target node.
Definition: tree_234.cpp:730
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index ad19b734c..c95c6ab0c 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -247,7 +247,7 @@ Static Private Member Functions
std::queue::pop
T pop(T... args)
list
Definition: hash_search.cpp:29
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html index 933704e30..e4d473796 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.html +++ b/d4/d32/inorder__successor__of__bst_8cpp.html @@ -642,7 +642,7 @@ Here is the call graph for this function:
72 node->right = nullptr; ///< setting right child as null
73 return node;
74}
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html index 714b72f79..356e670c1 100644 --- a/d4/d90/classdata__structures_1_1_skip_list.html +++ b/d4/d90/classdata__structures_1_1_skip_list.html @@ -284,7 +284,7 @@ Here is the call graph for this function:
200 std::cout << std::endl;
201 }
202 }
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map index 5c4746436..525caf919 100644 --- a/d4/dcb/classstack__coll__graph.map +++ b/d4/dcb/classstack__coll__graph.map @@ -1,5 +1,9 @@ - - - - + + + + + + + + diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5 index 3f5772350..2aeaba743 100644 --- a/d4/dcb/classstack__coll__graph.md5 +++ b/d4/dcb/classstack__coll__graph.md5 @@ -1 +1 @@ -809615577faea99522eef2f260b535f3 \ No newline at end of file +ccffd0d050b87a22e0741b24f1706a38 \ No newline at end of file diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg index e99c58d7f..d33753668 100644 --- a/d4/dcb/classstack__coll__graph.svg +++ b/d4/dcb/classstack__coll__graph.svg @@ -3,75 +3,262 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - - -stack< Type > + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +stack< ValueType > Node1 - -stack< Type > + +stack< ValueType > Node2 - - -node< Type > + + +std::shared_ptr< node +< value_type > > Node2->Node1 - - - stackTop - - - -Node2->Node2 - - - next + + + stackTop Node3 - -node< Kind > + +node< value_type > Node3->Node2 - - - left -link -next -parent -prev -right + + + ptr - + Node3->Node3 - - - left -link -next -parent -prev -right + + + next + + + +Node4 + + +node< Kind > + + + + + +Node4->Node3 + + + left +link +next +parent +prev +right + + + +Node4->Node4 + + + left +link +next +parent +prev +right + + + +Node6 + + +node< ValueType > + + + + + +Node4->Node6 + + + left +link +next +parent +prev +right + + + +Node5 + + +std::shared_ptr< node +< ValueType > > + + + + + +Node5->Node3 + + + next + + + +Node5->Node4 + + + next + + + +Node5->Node6 + + + next + + + +Node6->Node5 + + + ptr + + + +Node6->Node6 + + + next + + + +Node7 + + +std::size_t + + + + + +Node7->Node1 + + + size + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/dcb/classstack__coll__graph_org.svg b/d4/dcb/classstack__coll__graph_org.svg new file mode 100644 index 000000000..78ce00ac5 --- /dev/null +++ b/d4/dcb/classstack__coll__graph_org.svg @@ -0,0 +1,176 @@ + + + + + + +stack< ValueType > + + +Node1 + + +stack< ValueType > + + + + + +Node2 + + +std::shared_ptr< node +< value_type > > + + + + + +Node2->Node1 + + + stackTop + + + +Node3 + + +node< value_type > + + + + + +Node3->Node2 + + + ptr + + + +Node3->Node3 + + + next + + + +Node4 + + +node< Kind > + + + + + +Node4->Node3 + + + left +link +next +parent +prev +right + + + +Node4->Node4 + + + left +link +next +parent +prev +right + + + +Node6 + + +node< ValueType > + + + + + +Node4->Node6 + + + left +link +next +parent +prev +right + + + +Node5 + + +std::shared_ptr< node +< ValueType > > + + + + + +Node5->Node3 + + + next + + + +Node5->Node4 + + + next + + + +Node5->Node6 + + + next + + + +Node6->Node5 + + + ptr + + + +Node6->Node6 + + + next + + + +Node7 + + +std::size_t + + + + + +Node7->Node1 + + + size + + + diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html index 07b34d979..948a2cd0e 100644 --- a/d5/d15/classcll.html +++ b/d5/d15/classcll.html @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d15/classcll.html','../../'); initR
Collaboration diagram for cll:
-
+
[legend]
- + - + @@ -510,33 +363,32 @@ template<class Type >
void stack< Type >::push void stack< ValueType >::push (Type const value_type &  item)

Add new item to the stack

-
83 {
-
84 node<Type> *newNode;
-
85 newNode = new node<Type>;
-
86 newNode->data = item;
-
87 newNode->next = stackTop;
-
88 stackTop = newNode;
-
89 size++;
-
90 }
+
73 {
+
74 auto newNode = std::make_shared<node<value_type>>();
+
75 newNode->data = item;
+
76 newNode->next = stackTop;
+
77 stackTop = newNode;
+
78 size++;
+
79 }
- -

◆ top()

+ +

◆ top()

-template<class Type >
+template<class ValueType >
@@ -546,27 +398,64 @@ template<class Type >
- + - +
Type stack< Type >::top value_type stack< ValueType >::top ( ) const

Return the top element of the stack

-
93 {
-
94 assert(stackTop != nullptr);
-
95 return stackTop->data;
-
96 }
+
82 {
+
83 ensureNotEmpty();
+
84 return stackTop->data;
+
85 }
-

Member Data Documentation

- -

◆ stackTop

+ +

◆ toVector()

-template<class Type >
+template<class ValueType >
+ + +
- + + + + + +
node<Type>* stack< Type >::stackTopstd::vector< value_type > stack< ValueType >::toVector () const
+ 		+inline
+
+
52 {
+
53 std::vector<value_type> res;
+
54 res.reserve(this->size);
+
55 traverse(stackTop.get(), [&res](const node<value_type>& inNode) {
+
56 res.push_back(inNode.data);
+
57 });
+
58 return res;
+
59 }
+
std::vector::reserve
T reserve(T... args)
+ +
+
+ +

Member Data Documentation

+ +

◆ stackTop

+ +
+
+
+template<class ValueType >
+ + + @@ -575,12 +464,14 @@ template<class Type >
+ + +
std::shared_ptr<node<value_type> > stack< ValueType >::stackTop
-

Pointer to the stack

+Initial value:
=
+
{}
+

Pointer to the stack

The documentation for this class was generated from the following file: diff --git a/d1/dc2/classstack.js b/d1/dc2/classstack.js index 5c68dbc82..7ef80f734 100644 --- a/d1/dc2/classstack.js +++ b/d1/dc2/classstack.js @@ -1,15 +1,11 @@ var classstack = [ - [ "stack", "d1/dc2/classstack.html#a5b64337ec34b12e98458bb9b9d5f8f83", null ], - [ "stack", "d1/dc2/classstack.html#ae8547e097cc753d5eab0207ed23d8920", null ], - [ "~stack", "d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71", null ], - [ "clear", "d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b", null ], - [ "display", "d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628", null ], - [ "isEmptyStack", "d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a", null ], - [ "operator=", "d1/dc2/classstack.html#a2b4d767447067c8bebca791b747733a1", null ], - [ "pop", "d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc", null ], - [ "push", "d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d", null ], - [ "top", "d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344", null ], - [ "size", "d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0", null ], - [ "stackTop", "d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453", null ] + [ "clear", "d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092", null ], + [ "display", "d1/dc2/classstack.html#a8bce109630118a34faae717f72986033", null ], + [ "isEmptyStack", "d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5", null ], + [ "pop", "d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0", null ], + [ "push", "d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d", null ], + [ "top", "d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709", null ], + [ "size", "d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e", null ], + [ "stackTop", "d1/dc2/classstack.html#ab2fb22962a841a45707e70fb6109ddf4", null ] ]; \ No newline at end of file diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map deleted file mode 100644 index d845e8ef0..000000000 --- a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 deleted file mode 100644 index a04e13b6f..000000000 --- a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -e669ddada15fc9c701f1b2daabf31927 \ No newline at end of file diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg deleted file mode 100644 index ac7a855f3..000000000 --- a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg +++ /dev/null @@ -1,36 +0,0 @@ - - - - - - -stack::display - - -Node1 - - -stack::display - - - - - -Node2 - - -std::endl - - - - - -Node1->Node2 - - - - - diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map deleted file mode 100644 index cc3d43390..000000000 --- a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 deleted file mode 100644 index b5d990cca..000000000 --- a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -852e38ceb34f9e0580cc49311923dba5 \ No newline at end of file diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg deleted file mode 100644 index 1a2328f76..000000000 --- a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg +++ /dev/null @@ -1,51 +0,0 @@ - - - - - - -stack::pop - - -Node1 - - -stack::pop - - - - - -Node2 - - -std::endl - - - - - -Node1->Node2 - - - - - -Node3 - - -stack::isEmptyStack - - - - - -Node1->Node3 - - - - - diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map new file mode 100644 index 000000000..165cd610f --- /dev/null +++ b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5 b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5 new file mode 100644 index 000000000..c151e07ba --- /dev/null +++ b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5 @@ -0,0 +1 @@ +28be4658e978b7668e51dd660664aa62 \ No newline at end of file diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg new file mode 100644 index 000000000..2348f481e --- /dev/null +++ b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg @@ -0,0 +1,51 @@ + + + + + + +stack::display + + +Node1 + + +stack::display + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::shared_ptr::get + + + + + +Node1->Node3 + + + + + diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html index 859d242a7..145e3796e 100644 --- a/d1/df2/structnode-members.html +++ b/d1/df2/structnode-members.html @@ -106,7 +106,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini
color (defined in node< Kind >)node< Kind >
data (defined in node< Kind >)node< Kind >
data (defined in node< Kind >)node< Kind >
datanode< Kind >
datanode< Kind >
height (defined in node< Kind >)node< Kind >
key (defined in node< Kind >)node< Kind >
left (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
nextnode< Kind >
nextnode< Kind >
node(int d) (defined in node< Kind >)node< Kind >inline
parent (defined in node< Kind >)node< Kind >
prev (defined in node< Kind >)node< Kind >
data [MAX] = {1, 1
hashtab
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
std::malloc
T malloc(T... args)
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html index a16295168..2ef51793d 100644 --- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html +++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html @@ -715,7 +715,7 @@ template<typename X >
478 Tree<X>::t_val[node] = val;
479 }
range_queries::heavy_light_decomposition::SG::update
void update(int p, X v)
Update the value at a node.
Definition: heavy_light_decomposition.cpp:293
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html index 3f7f741c0..45f6b2797 100644 --- a/d3/d26/binary__search__tree_8cpp.html +++ b/d3/d26/binary__search__tree_8cpp.html @@ -118,6 +118,7 @@ Include dependency graph for binary_search_tree.cpp:

Classes

class  node< Kind >
 for std::vector More...
 
class  Queue
 
@@ -209,7 +209,7 @@ int 
30}
endl
#define endl
Definition: matrix_exponentiation.cpp:36
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html index 6ef17bf06..a52769155 100644 --- a/d5/d45/sublist__search_8cpp.html +++ b/d5/d45/sublist__search_8cpp.html @@ -305,7 +305,7 @@ Here is the call graph for this function:
91}
data
int data[MAX]
test data
Definition: hash_search.cpp:24
Node
Definition: linkedlist_implentation_usingarray.cpp:14
-
node
Definition: avltree.cpp:13
+
node
for std::vector
Definition: avltree.cpp:13
Here is the call graph for this function:
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index 4812ff117..01b00d2fe 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -177,7 +177,7 @@ Data Structures
  • Reverse A Linked List
  • Skip List
  • Sparse Table
    • -
  • Stack
    • +
  • Stack
  • Stack Using Array
  • Stack Using Linked List
  • Stack Using Queue
    • diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html index 784e4de3c..40b6ed18c 100644 --- a/d5/da1/structnode.html +++ b/d5/da1/structnode.html @@ -105,11 +105,14 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini
    +

    for std::vector + More...

    +

    #include <queue.h>

    Collaboration diagram for node< Kind >:
    -
    +
    [legend]
    total
    @@ -165,24 +168,24 @@ int  - - - - - - + + + + + +
    key
    char color
     
    -Type data
     data at current node
     
    -node< Type > * next
     pointer to the next node instance
     
    +ValueType data = {}
     data at current node
     
    std::shared_ptr< node< ValueType > > next
     pointer to the next node instance More...
     
    node * link
     

    Detailed Description

    template<class Kind>
    -class node< Kind >

    Definition of the node

    -

    Definition of the node as a linked-list

    Template Parameters
    +class node< Kind >

    for std::vector

    +

    Definition of the node

    +

    for IO operations for std::shared_ptr for std::invalid_argument Definition of the node as a linked-list

    Template Parameters
    - +
    Typetype of data nodes of the linked list should contain
    ValueTypetype of data nodes of the linked list should contain
    @@ -218,6 +221,27 @@ template<class Kind >
    12 }
    + + +

    Member Data Documentation

    + +

    ◆ next

    + +
    +
    +
    +template<class Kind >
    + + + + +
    std::shared_ptr<node<ValueType> > node< Kind >::next
    +
    +Initial value:
    =
    +
    {}
    +
    +

    pointer to the next node instance

    +
    The documentation for this class was generated from the following files:
      @@ -229,7 +253,7 @@ template<class Kind >
    • data_structures/queue.h
    • data_structures/queue_using_linked_list.cpp
    • data_structures/rb_tree.cpp
      • -
    • data_structures/stack.h
      • +
    • data_structures/stack.hpp
    • data_structures/stack_using_linked_list.cpp
    • data_structures/tree.cpp
    • operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
      • diff --git a/d5/da1/structnode.js b/d5/da1/structnode.js index 1737ae4cb..8d4ff7926 100644 --- a/d5/da1/structnode.js +++ b/d5/da1/structnode.js @@ -1,5 +1,5 @@ var structnode = [ - [ "data", "d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37", null ], - [ "next", "d5/da1/structnode.html#a135f25acadfbba644f848f1aa18d8350", null ] + [ "data", "d5/da1/structnode.html#a0156481432c124395407ff6b372a52e8", null ], + [ "next", "d5/da1/structnode.html#aac5efc64dab7734e2867dd3c95bee8e6", null ] ]; \ No newline at end of file diff --git a/d7/d75/postfix__evaluation_8cpp.html b/d7/d75/postfix__evaluation_8cpp.html index c7cc78637..6bfddba91 100644 --- a/d7/d75/postfix__evaluation_8cpp.html +++ b/d7/d75/postfix__evaluation_8cpp.html @@ -247,12 +247,12 @@ Functions
    - - - - - -
    -
    Algorithms_in_C++ 1.0.0 -
    -
    Set of algorithms implemented in C++.
    -
    -
    - - - - - - - -
    -
    - -
    -
    -
    - -
    - -
    -
    - - -
    -
    -
    -
    -
    -
    Loading...
    -
    Searching...
    -
    No Matches
    -
    -
    -
    -
    - -
    -
    stack.h
    -
    -
    -Go to the documentation of this file.
    1/**
    -
    2 * @file stack.h
    -
    3 * @author danghai
    -
    4 * @brief This class specifies the basic operation on a stack as a linked list
    -
    5 **/
    -
    6#ifndef DATA_STRUCTURES_STACK_H_
    -
    7#define DATA_STRUCTURES_STACK_H_
    -
    8
    -
    9#include <cassert>
    -
    10#include <iostream>
    -
    11
    -
    12/** Definition of the node as a linked-list
    -
    13 * \tparam Type type of data nodes of the linked list should contain
    -
    14 */
    -
    15template <class Type>
    -
    16struct node {
    -
    17 Type data; ///< data at current node
    -
    18 node<Type> *next; ///< pointer to the next ::node instance
    -
    19};
    -
    20
    -
    21/** Definition of the stack class
    -
    22 * \tparam Type type of data nodes of the linked list in the stack should
    -
    23 * contain
    -
    24 */
    -
    25template <class Type>
    -
    26class stack {
    -
    27 public:
    -
    28 /** Show stack */
    -
    29 void display() {
    -
    30 node<Type> *current = stackTop;
    -
    31 std::cout << "Top --> ";
    -
    32 while (current != nullptr) {
    -
    33 std::cout << current->data << " ";
    -
    34 current = current->next;
    -
    35 }
    -
    36 std::cout << std::endl;
    -
    37 std::cout << "Size of stack: " << size << std::endl;
    -
    38 }
    -
    39
    -
    40 /** Default constructor*/
    -
    41 stack() {
    -
    42 stackTop = nullptr;
    -
    43 size = 0;
    -
    44 }
    -
    45
    -
    46 /** Copy constructor*/
    -
    47 explicit stack(const stack<Type> &otherStack) {
    -
    48 node<Type> *newNode, *current, *last;
    -
    49
    -
    50 /* If stack is no empty, make it empty */
    -
    51 if (stackTop != nullptr) {
    -
    52 stackTop = nullptr;
    -
    53 }
    -
    54 if (otherStack.stackTop == nullptr) {
    -
    55 stackTop = nullptr;
    -
    56 } else {
    -
    57 current = otherStack.stackTop;
    -
    58 stackTop = new node<Type>;
    -
    59 stackTop->data = current->data;
    -
    60 stackTop->next = nullptr;
    -
    61 last = stackTop;
    -
    62 current = current->next;
    -
    63 /* Copy the remaining stack */
    -
    64 while (current != nullptr) {
    -
    65 newNode = new node<Type>;
    -
    66 newNode->data = current->data;
    -
    67 newNode->next = nullptr;
    -
    68 last->next = newNode;
    -
    69 last = newNode;
    -
    70 current = current->next;
    -
    71 }
    -
    72 }
    -
    73 size = otherStack.size;
    -
    74 }
    -
    75
    -
    76 /** Destructor */
    -
    77 ~stack() {}
    -
    78
    -
    79 /** Determine whether the stack is empty */
    -
    80 bool isEmptyStack() { return (stackTop == nullptr); }
    -
    81
    -
    82 /** Add new item to the stack */
    -
    83 void push(Type item) {
    -
    84 node<Type> *newNode;
    -
    85 newNode = new node<Type>;
    -
    86 newNode->data = item;
    -
    87 newNode->next = stackTop;
    -
    88 stackTop = newNode;
    -
    89 size++;
    -
    90 }
    -
    91
    -
    92 /** Return the top element of the stack */
    -
    93 Type top() {
    -
    94 assert(stackTop != nullptr);
    -
    95 return stackTop->data;
    -
    96 }
    -
    97
    -
    98 /** Remove the top element of the stack */
    -
    99 void pop() {
    -
    100 node<Type> *temp;
    -
    101 if (!isEmptyStack()) {
    -
    102 temp = stackTop;
    -
    103 stackTop = stackTop->next;
    -
    104 delete temp;
    -
    105 size--;
    -
    106 } else {
    -
    107 std::cout << "Stack is empty !" << std::endl;
    -
    108 }
    -
    109 }
    -
    110
    -
    111 /** Clear stack */
    -
    112 void clear() { stackTop = nullptr; }
    -
    113
    -
    114 /** Overload "=" the assignment operator */
    -
    115 stack<Type> &operator=(const stack<Type> &otherStack) {
    -
    116 node<Type> *newNode, *current, *last;
    -
    117
    -
    118 /* If stack is no empty, make it empty */
    -
    119 if (stackTop != nullptr) {
    -
    120 stackTop = nullptr;
    -
    121 }
    -
    122 if (otherStack.stackTop == nullptr) {
    -
    123 stackTop = nullptr;
    -
    124 } else {
    -
    125 current = otherStack.stackTop;
    -
    126 stackTop = new node<Type>;
    -
    127 stackTop->data = current->data;
    -
    128 stackTop->next = nullptr;
    -
    129 last = stackTop;
    -
    130 current = current->next;
    -
    131 /* Copy the remaining stack */
    -
    132 while (current != nullptr) {
    -
    133 newNode = new node<Type>;
    -
    134 newNode->data = current->data;
    -
    135 newNode->next = nullptr;
    -
    136 last->next = newNode;
    -
    137 last = newNode;
    -
    138 current = current->next;
    -
    139 }
    -
    140 }
    -
    141 size = otherStack.size;
    -
    142 return *this;
    -
    143 }
    -
    144
    -
    145 private:
    -
    146 node<Type> *stackTop; /**< Pointer to the stack */
    -
    147 int size; ///< size of stack
    -
    148};
    -
    149
    -
    150#endif // DATA_STRUCTURES_STACK_H_
    - -
    stack
    Definition: stack.h:26
    -
    stack::isEmptyStack
    bool isEmptyStack()
    Definition: stack.h:80
    -
    stack::~stack
    ~stack()
    Definition: stack.h:77
    -
    stack::top
    Type top()
    Definition: stack.h:93
    -
    stack::operator=
    stack< Type > & operator=(const stack< Type > &otherStack)
    Definition: stack.h:115
    -
    stack::push
    void push(Type item)
    Definition: stack.h:83
    -
    stack::stack
    stack()
    Definition: stack.h:41
    -
    stack::clear
    void clear()
    Definition: stack.h:112
    -
    stack::display
    void display()
    Definition: stack.h:29
    -
    stack::pop
    void pop()
    Definition: stack.h:99
    -
    stack::stackTop
    node< Type > * stackTop
    Definition: stack.h:146
    -
    stack::size
    int size
    size of stack
    Definition: stack.h:147
    -
    stack::stack
    stack(const stack< Type > &otherStack)
    Definition: stack.h:47
    -
    std::endl
    T endl(T... args)
    -
    node
    Definition: avltree.cpp:13
    -
    node::next
    node< Type > * next
    pointer to the next node instance
    Definition: stack.h:18
    -
    node::data
    Type data
    data at current node
    Definition: stack.h:17
    -
    -
    - - - - diff --git a/d8/d38/queue_8h_source.html b/d8/d38/queue_8h_source.html index 4294ee676..6b6bb1654 100644 --- a/d8/d38/queue_8h_source.html +++ b/d8/d38/queue_8h_source.html @@ -201,7 +201,7 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
    queue::~queue
    ~queue()
    Definition: queue.h:39
    queue::queueRear
    node< Kind > * queueRear
    Definition: queue.h:84
    std::endl
    T endl(T... args)
    -
    node
    Definition: avltree.cpp:13
    +
    node
    for std::vector
    Definition: avltree.cpp:13
    diff --git a/d8/d72/class_r_btree.html b/d8/d72/class_r_btree.html index 0007dfa09..a92ea93bb 100644 --- a/d8/d72/class_r_btree.html +++ b/d8/d72/class_r_btree.html @@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d8/d72/class_r_btree.html','../../');
    Collaboration diagram for RBtree:
    -
    +
    [legend]
    @@ -276,7 +276,7 @@ Private Attributes
    221}
    -
    node
    Definition: avltree.cpp:13
    +
    node
    for std::vector
    Definition: avltree.cpp:13
    diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html index 65197405e..aff95d19a 100644 --- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html +++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html @@ -243,7 +243,7 @@ Private Attributes
    operations_on_datastructures::circular_linked_list::CircularLinkedList::insert
    void insert(const std::vector< int64_t > &values)
    Inserts all the values from a vector into the Circular Linked List.
    Definition: circular_linked_list.cpp:146
    std::copy
    T copy(T... args)
    Node
    Definition: linkedlist_implentation_usingarray.cpp:14
    -
    node
    Definition: avltree.cpp:13
    +
    node
    for std::vector
    Definition: avltree.cpp:13
    Here is the call graph for this function:
    diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html index 7aa81c95b..17dd96850 100644 --- a/d8/d90/iterative__tree__traversals_8cpp.html +++ b/d8/d90/iterative__tree__traversals_8cpp.html @@ -331,7 +331,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -404,7 +404,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -477,7 +477,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -549,7 +549,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -621,7 +621,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    @@ -693,7 +693,7 @@ Here is the call graph for this function:
    Here is the call graph for this function:
    -
    +
    diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map index 976b23a79..5b9838f21 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map @@ -1,9 +1,8 @@ - - - - - - - + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 index 60069dda8..91a89ab21 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 @@ -1 +1 @@ -c7b242d0c577854fb05bea2cc97039d6 \ No newline at end of file +a0a533cf7a29de6e40bb51f4b78c28af \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg index 42e1edc1e..d9b357dca 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg @@ -4,16 +4,16 @@ - - + + test4 Node1 - -test4 + +test4 @@ -21,38 +21,38 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + Node3 - -others::iterative_tree -_traversals::BinaryTree -::preOrderIterative + +others::iterative_tree +_traversals::BinaryTree +::preOrderIterative Node1->Node3 - - + + Node4 - + stack::pop @@ -61,59 +61,38 @@ Node3->Node4 - - + + - - -Node6 - + + +Node5 + stack::push - - -Node3->Node6 - - + + +Node3->Node5 + + - - -Node7 - + + +Node6 + stack::top - - -Node3->Node7 - - - - - -Node4->Node2 - - - - - -Node5 - - -stack::isEmptyStack - - - - + -Node4->Node5 - - +Node3->Node6 + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map index a8bcb1d42..4767d6089 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map @@ -1,9 +1,8 @@ - - - - - - - + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 index 9d735801a..b40357d4c 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 @@ -1 +1 @@ -165dd450fbf664826b6a311f4f43c254 \ No newline at end of file +77c3d03e17eb5a03458732a3799c2619 \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg index 99f3806a0..334054930 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg @@ -4,16 +4,16 @@ - - + + test1 Node1 - -test1 + +test1 @@ -21,38 +21,38 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + Node3 - -others::iterative_tree -_traversals::BinaryTree -::preOrderIterative + +others::iterative_tree +_traversals::BinaryTree +::preOrderIterative Node1->Node3 - - + + Node4 - + stack::pop @@ -61,59 +61,38 @@ Node3->Node4 - - + + - - -Node6 - + + +Node5 + stack::push - - -Node3->Node6 - - + + +Node3->Node5 + + - - -Node7 - + + +Node6 + stack::top - - -Node3->Node7 - - - - - -Node4->Node2 - - - - - -Node5 - - -stack::isEmptyStack - - - - + -Node4->Node5 - - +Node3->Node6 + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map index 6f497bbf9..66ff37ea4 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map @@ -1,9 +1,8 @@ - - - - - - - + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5 index 63376f105..eb88f4306 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5 @@ -1 +1 @@ -98067223800aba4cd9ae21de0684f730 \ No newline at end of file +aa40948124773e41e2587a35e28c91a8 \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg index bb7a05eac..7fff89745 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg @@ -4,16 +4,16 @@ - - + + test3 Node1 - -test3 + +test3 @@ -21,38 +21,38 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + Node3 - -others::iterative_tree -_traversals::BinaryTree -::inOrderIterative + +others::iterative_tree +_traversals::BinaryTree +::inOrderIterative Node1->Node3 - - + + Node4 - + stack::pop @@ -61,59 +61,38 @@ Node3->Node4 - - + + - - -Node6 - + + +Node5 + stack::push - - -Node3->Node6 - - + + +Node3->Node5 + + - - -Node7 - + + +Node6 + stack::top - - -Node3->Node7 - - - - - -Node4->Node2 - - - - - -Node5 - - -stack::isEmptyStack - - - - + -Node4->Node5 - - +Node3->Node6 + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map index 848ba4a5b..e15264ae6 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map @@ -1,9 +1,8 @@ - - - - - - - + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 index 958048f33..16796da1b 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 @@ -1 +1 @@ -96e002bcd4012479f47466c61887da32 \ No newline at end of file +3e58d502dd2e6f41978fd5dd1a66b6b9 \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg index 19e7a10fc..055dd185d 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg @@ -4,16 +4,16 @@ - - + + test5 Node1 - -test5 + +test5 @@ -21,38 +21,38 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + Node3 - -others::iterative_tree -_traversals::BinaryTree -::postOrderIterative + +others::iterative_tree +_traversals::BinaryTree +::postOrderIterative Node1->Node3 - - + + Node4 - + stack::pop @@ -61,59 +61,38 @@ Node3->Node4 - - + + - - -Node6 - + + +Node5 + stack::push - - -Node3->Node6 - - + + +Node3->Node5 + + - - -Node7 - + + +Node6 + stack::top - - -Node3->Node7 - - - - - -Node4->Node2 - - - - - -Node5 - - -stack::isEmptyStack - - - - + -Node4->Node5 - - +Node3->Node6 + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map index 881587aab..1de1240a7 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map @@ -1,9 +1,8 @@ - - - - - - - + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5 index 478afc7b6..3a7831159 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5 @@ -1 +1 @@ -229c425e189ae82469ba6f168334d719 \ No newline at end of file +7384ebf3787f6e46212497210da998ca \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg index fdee300af..b194fbf9e 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg @@ -4,16 +4,16 @@ - - + + test2 Node1 - -test2 + +test2 @@ -21,38 +21,38 @@ Node2 - -std::endl + +std::endl Node1->Node2 - - + + Node3 - -others::iterative_tree -_traversals::BinaryTree -::postOrderIterative + +others::iterative_tree +_traversals::BinaryTree +::postOrderIterative Node1->Node3 - - + + Node4 - + stack::pop @@ -61,59 +61,38 @@ Node3->Node4 - - + + - - -Node6 - + + +Node5 + stack::push - - -Node3->Node6 - - + + +Node3->Node5 + + - - -Node7 - + + +Node6 + stack::top - - -Node3->Node7 - - - - - -Node4->Node2 - - - - - -Node5 - - -stack::isEmptyStack - - - - + -Node4->Node5 - - +Node3->Node6 + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 38de3ce15..aac0c2163 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,33 +1,32 @@ - + - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index c379cf616..b120e77bd 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -66bb1e935c798ef9c849333682531d25 \ No newline at end of file +fbea2878f12906293db655e7578cd49a \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 1f4988431..0ed9ae2bf 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,7 +4,7 @@ - +