formatting source-code for 153fb7b8a5

data_structure/queue/queue.cpp

@@ -6,8 +6,7 @@ using namespace std;
 
 /* Default constructor*/
 template <class Kind>
-queue<Kind>::queue()
-{
+queue<Kind>::queue() {
     queueFront = NULL;
     queueRear = NULL;
     size = 0;
@@ -15,18 +14,14 @@ queue<Kind>::queue()
 
 /* Destructor */
 template <class Kind>
-queue<Kind>::~queue()
-{
-}
+queue<Kind>::~queue() {}
 
 /* Display for testing */
 template <class Kind>
-void queue<Kind>::display()
-{
+void queue<Kind>::display() {
     node<Kind> *current = queueFront;
     cout << "Front --> ";
-    while (current != NULL)
-    {
+    while (current != NULL) {
         cout << current->data << "    ";
         current = current->next;
     }
@@ -36,33 +31,27 @@ void queue<Kind>::display()
 
 /* Determine whether the queue is empty */
 template <class Kind>
-bool queue<Kind>::isEmptyQueue()
-{
+bool queue<Kind>::isEmptyQueue() {
     return (queueFront == NULL);
 }
 
 /* Clear queue */
 template <class Kind>
-void queue<Kind>::clear()
-{
+void queue<Kind>::clear() {
     queueFront = NULL;
 }
 
 /* Add new item to the queue */
 template <class Kind>
-void queue<Kind>::enQueue(Kind item)
-{
+void queue<Kind>::enQueue(Kind item) {
     node<Kind> *newNode;
     newNode = new node<Kind>;
     newNode->data = item;
     newNode->next = NULL;
-    if (queueFront == NULL)
-    {
+    if (queueFront == NULL) {
         queueFront = newNode;
         queueRear = newNode;
-    }
-    else
-    {
+    } else {
         queueRear->next = newNode;
         queueRear = queueRear->next;
     }
@@ -71,26 +60,21 @@ void queue<Kind>::enQueue(Kind item)
 
 /* Return the top element of the queue */
 template <class Kind>
-Kind queue<Kind>::front()
-{
+Kind queue<Kind>::front() {
     assert(queueFront != NULL);
     return queueFront->data;
 }
 
 /* Remove the element of the queue */
 template <class Kind>
-void queue<Kind>::deQueue()
-{
+void queue<Kind>::deQueue() {
     node<Kind> *temp;
-    if (!isEmptyQueue())
-    {
+    if (!isEmptyQueue()) {
         temp = queueFront;
         queueFront = queueFront->next;
         delete temp;
         size--;
-    }
-    else
-    {
+    } else {
         cout << "Queue is empty !" << endl;
     }
 }