Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
list
comparison operators
list::list
list::~list
member functions:
list::assign
list::back
list::begin
list::clear
list::empty
list::end
list::erase
list::front
list::get_allocator
list::insert
list::max_size
list::merge
list::operator=
list::pop_back
list::pop_front
list::push_back
list::push_front
list::rbegin
list::remove
list::remove_if
list::rend
list::resize
list::reverse
list::size
list::sort
list::splice
list::swap
list::unique


list::empty

public member function
bool empty ( ) const;

Test whether container is empty

Returns whether the list container is empty, i.e. whether its size is 0.

This function does not modify the content of the container in any way. To clear the content of a list container, use list::clear.

Parameters

none

Return Value

true if the container size is 0, false otherwise.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
// list::empty
#include <iostream>
#include <list>
using namespace std;
int main ()
{
  list<int> mylist;
  int sum (0);
  for (int i=1;i<=10;i++) mylist.push_back(i);
  while (!mylist.empty())
  {
     sum += mylist.front();
     mylist.pop_front();
  }
  cout << "total: " << sum << endl;
  
  return 0;
}

The example initializes the content of the container to a sequence of numbers (form 1 to 10). It then pops the elements one by one until it is empty and calculates their sum.

Output:
total: 55

Complexity

Constant.

See also