C++ (Cpp) QUEUE::empty Examples

Programming Language: C++ (Cpp)

Class/Type: QUEUE

Method/Function: empty

Examples at hotexamples.com: 2

The `empty()` function in C++ is a built-in member function that is used to check whether the queue is empty or not. It returns a boolean value `true` if the queue is empty, and `false` otherwise.

Example 1:

#include 
#include 

int main() {
   std::queue q;

   if(q.empty()) {
      std::cout << "Queue is empty" << std::endl;
   } else {
      std::cout << "Queue is not empty" << std::endl;
   }

   return 0;
}

This example creates an empty queue and then uses the `empty()` function to check if it is empty. Since it is empty, it prints "Queue is empty" to the console.

Example 2:

#include 
#include 

int main() {
   std::queue q;
   q.push(1);
   q.push(2);
   q.push(3);

   if(q.empty()) {
      std::cout << "Queue is empty" << std::endl;
   } else {
      std::cout << "Queue is not empty" << std::endl;
   }

   return 0;
}

This example creates a queue and adds three elements to it. It then uses the `empty()` function to check if it is empty. Since it has elements in it, it prints "Queue is not empty" to the console. The `queue` and `iostream` libraries are used in both examples.

C++ (Cpp) QUEUE::empty - 2 examples found. These are the top rated real world C++ (Cpp) examples of QUEUE::empty extracted from open source projects. You can rate examples to help us improve the quality of examples.

Frequently Used Methods

Show Hide

push(3)

enqueue_tail(3)

dequeue_head(3)

pop(2)

empty(2)

message_count(1)

message_bytes(1)

is_full(1)

is_empty(1)

insert(1)

front(1)

CreateQueue(1)

enqueue_head(1)

EmptyQueue(1)

dyn_push_move(1)

dyn_push_copy(1)

dyn_push(1)

clear(1)

Push(1)

Pop(1)

enqueue(1)

Example #1

Show file

File: lf_heterogeneous_queue_basic_tests.cpp Project: giucamp/density

        /** Basic tests LfHeterQueue with a non-polymorphic base */
        template <typename QUEUE> static void lf_heterogeneous_queue_basic_void_tests()
        {
            {
                QUEUE queue;
                DENSITY_TEST_ASSERT(queue.empty());
            }

            {
                QUEUE queue;
                queue.clear();

                queue.push(1);
                DENSITY_TEST_ASSERT(!queue.empty());

                queue.clear();
                DENSITY_TEST_ASSERT(queue.empty());
                queue.clear();
            }
        }

Example #2

Show file

File: BFS.cpp Project: msanath/JustCode

void BFS(NodeMap* nMap, string startNode, string goalNode)
{
    QUEUE *q = new QUEUE();

    NodeList* nlist = nMap->find(startNode)->second;

    for (NodeList::iterator it = nlist->begin(); it != nlist->end(); it++)
    {
        (*it)->path->push_back(startNode);
        (*it)->visitedNodes->insert(pair<string, NodeList*> (startNode, nlist));
        q->push(*it);
    }

    cout << startNode << endl;


    while(!q->empty())
    {
        Node* firstNode = q->front();
        q->pop();
        cout << firstNode->name << endl;

        if (firstNode->name == goalNode)
        {
            cout << "END" << endl;
            cout << "Final path : ";

            for(list<string>::iterator sit = firstNode->path->begin(); sit != firstNode->path->end(); sit++)
            {
                cout << (*sit) << endl;
                cout << firstNode->name << endl;
            }
            break;
        }

        if (firstNode->visitedNodes->find(firstNode->name) != firstNode->visitedNodes->end())
        {
            continue;
        }

        nlist = nMap->find(firstNode->name)->second;

        for (NodeList::iterator it = nlist->begin(); it != nlist->end(); it++)
        {
            (*it)->path = new list<string>(firstNode->path->begin(), firstNode->path->end());
            (*it)->visitedNodes = new NodeMap(firstNode->visitedNodes->begin(), firstNode->visitedNodes->end());

            (*it)->path->push_back(firstNode->name);
            (*it)->visitedNodes->insert(pair<string, NodeList*> (firstNode->name, NULL));
            q->push(*it);
        }

    }
}