A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../../cpp/../cpp/container/deque/size.html below:

std::deque<T,Allocator>::size - cppreference.com

size_type size() const;

(noexcept since C++11)
(constexpr since C++26)

Returns the number of elements in the container.

[edit] Return value

std::distance(begin(), end())

[edit] Complexity

Constant.

[edit] Example

The following code uses size to display the number of elements in a std::deque:

#include <deque>
#include <iostream>
 
int main()
{ 
    std::deque<int> nums{1, 3, 5, 7};
 
    std::cout << "nums contains " << nums.size() << " elements.\n";
}

Output:

nums contains 4 elements.
[edit] See also checks whether the container is empty
(public member function) [edit] returns the maximum possible number of elements
(public member function) [edit] changes the number of elements stored
(public member function) [edit] returns the size of a container or array
(function template) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4