std::stack<T,Container>::size

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Technical Specifications

 

Containers library

Sequence

array (C++11)

vector

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

Views

span (C++20)

 

std::stack

Member functions

stack::stack

stack::~stack

stack::operator=

Element access

stack::top

Capacity

stack::empty

stack::size

Modifiers

stack::push

stack::emplace

stack::pop

stack::swap

Non-member functions

operator==operator!=operator<operator>operator<=operator>=operator<=> (C++20)

std::swap

Deduction guides(C++17)

 

size_type size() const;

Returns the number of elements in the underlying container, that is, c.size().

Parameters

(none)

Return value

The number of elements in the container.

Complexity

Constant.

Example

Run this code

#include <algorithm>
#include <iostream>
#include <stack>
 
int main()
{
    std::cout << std::boolalpha;
 
    std::stack<int> container;
 
    std::cout << "Initially, container.size(): " << container.size() << '\n';
 
    for (int i = 0; i < 7; ++i)
        container.push(i);
    std::cout << "After adding elements, container.size(): " << container.size() << '\n';
}

Output:

Initially, container.size(): 0
After adding elements, container.size(): 7

See also

empty

checks whether the underlying container is empty (public member function)