diff --git a/d0/d62/struct_queue-members.html b/d0/d62/struct_queue-members.html index 3dbb0b598..2d4d2c05a 100644 --- a/d0/d62/struct_queue-members.html +++ b/d0/d62/struct_queue-members.html @@ -110,16 +110,19 @@ $(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(tru

This is the complete list of members for Queue, including all inherited members.

- + + + +
createNode(int val) (defined in Queue)Queueinline
createNode(int val) (defined in Queue)Queueinlineprivate
dequeue() (defined in Queue)Queueinline
enqueue(int val) (defined in Queue)Queueinline
front (defined in Queue)Queue
front (defined in Queue)Queueprivate
operator=(const Queue &)=delete (defined in Queue)Queueprivate
Queue(const Queue &)=delete (defined in Queue)Queueprivate
Queue()=default (defined in Queue)Queue
rear (defined in Queue)Queue
rear (defined in Queue)Queueprivate
t (defined in Queue)Queue
traverse() (defined in Queue)Queueinline
~Queue() (defined in Queue)Queueinline
diff --git a/dc/db5/struct_queue.html b/dc/db5/struct_queue.html index 5c47df2d6..31590eee5 100644 --- a/dc/db5/struct_queue.html +++ b/dc/db5/struct_queue.html @@ -107,6 +107,7 @@ $(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(tru
Public Member Functions | Public Attributes | +Private Member Functions | Private Attributes | List of all members
Queue Class Reference
@@ -120,8 +121,6 @@ Collaboration diagram for Queue: - - @@ -141,15 +140,57 @@ int  int 

Public Member Functions

void createNode (int val)
 
void enqueue (int val)
 
void dequeue ()
front
rear
 
+ + + + + + + +

+Private Member Functions

+ Queue (const Queue &)=delete
 
+Queue & operator= (const Queue &)=delete
 
void createNode (int val)
 
+node *  +node * 

Private Attributes

-node * front =nullptr
front = nullptr
 
-node * rear =nullptr
rear = nullptr
 
+

Constructor & Destructor Documentation

+ +

◆ ~Queue()

+ +
+
+ + + + + +
+ + + + + + + +
Queue::~Queue ()
+ 		+inline
+
+
16 {
+
17 while (front) {
+
18 dequeue();
+
19 }
+
20 }
+
+
+

Member Function Documentation

◆ createNode()

@@ -169,17 +210,17 @@ Private Attributes -inline +inlineprivate
-
13 {
-
14 auto* nn = new node;
-
15 nn->data = val;
-
16 nn->next = nullptr;
-
17 front = nn;
-
18 rear = nn;
-
19 }
+
23 {
+
24 auto* nn = new node;
+
25 nn->data = val;
+
26 nn->next = nullptr;
+
27 front = nn;
+
28 rear = nn;
+
29 }
node
struct node { int data; int height; struct node *left; struct node *right;} node
for std::queue
Definition avltree.cpp:13
@@ -206,14 +247,20 @@ Private Attributes
-
33 {
-
34 node* n;
-
35 n = front;
-
36 if (n) {
-
37 front = front->next;
-
38 delete n;
-
39 }
-
40 }
+
43 {
+
44 if (front == nullptr) {
+
45 return;
+
46 }
+
47 const node* const n = front;
+
48 if (front == rear) {
+
49 front = nullptr;
+
50 rear = nullptr;
+
51 } else {
+
52 front = front->next;
+
53 rear->next = front;
+
54 }
+
55 delete n;
+
56 }
node
Definition binary_search_tree.cpp:11
@@ -240,19 +287,17 @@ Private Attributes
-
20 {
-
21 if (front == nullptr || rear == nullptr) {
-
22 createNode(val);
-
23 }
-
24 else {
-
25 node* nn;
-
26 nn = new node;
-
27 nn->data = val;
-
28 rear->next = nn;
-
29 nn->next = front;
-
30 rear = nn;
-
31 }
-
32 }
+
32 {
+
33 if (front == nullptr || rear == nullptr) {
+
34 createNode(val);
+
35 } else {
+
36 node* nn = new node;
+
37 nn->data = val;
+
38 rear->next = nn;
+
39 nn->next = front;
+
40 rear = nn;
+
41 }
+
42 }
@@ -278,19 +323,18 @@ Private Attributes
-
41 {
-
42 node* ptr;
-
43 ptr = front;
-
44 if (ptr) {
-
45 do {
-
46 std::cout << ptr->data << " ";
-
47 ptr = ptr->next;
-
48 } while (ptr != rear->next);
-
49 std::cout << front->data << std::endl;
-
50 }
-
51 }
+
57 {
+
58 if (front == nullptr) {
+
59 return;
+
60 }
+
61 const node* ptr = front;
+
62 do {
+
63 std::cout << ptr->data << ' ';
+
64 ptr = ptr->next;
+
65 } while (ptr != front);
+
66 std::cout << '\n';
+
67 }
-
std::endl
T endl(T... args)