std::deque::size

[edit template]

[]	Google. . , . , . ( . .)

`size_type size() const;`

Returns the number of elements in the container, i.e. std::distance(begin(), end()).

()

noexcept:

noexcept

Constant

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

#include <deque>
#include <iostream>

int main()
{
    std::deque<int> nums {1, 3, 5, 7};

    std::cout << "nums contains " << nums.size() << " elements.\n";
}

:

nums contains 4 elements.

.

empty	, (public -) []
max_size	(public -) []
resize	(public -) []







(C++20)

(C++20)
(C++11)





(C++20)


/

(C++11)
(C++11)
(C++11)
(C++17)


array (C++11)
vector
vector<bool>
deque
forward_list (C++11)
list

set
multiset
map
multimap

unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)

stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)

span (C++20)
mdspan (C++23)

-
,


-
deque::deque
deque::~deque
deque::operator=
deque::assign
deque::assign_range (C++23)
deque::get_allocator

deque::at
deque::operator[]
deque::front
deque::back

deque::begindeque::cbegin (C++11)
deque::enddeque::cend (C++11)
deque::rbegindeque::crbegin (C++11)
deque::renddeque::crend (C++11)

deque::empty
deque::size
deque::max_size
deque::shrink_to_fit (DR*)

deque::clear
deque::insert
deque::insert_range (C++23)
deque::emplace
deque::erase
deque::push_front
deque::emplace_front
deque::prepend_range (C++23)
deque::pop_front
deque::push_back
deque::emplace_back (C++11)
deque::append_range (C++23)
deque::pop_back
deque::resize
deque::swap
,
std::swap
eraseerase_if (C++20)(C++20)
operator==operator!=operator<operator>operator<=operator>=operator<=> ( C++20)( C++20)( C++20)( C++20)( C++20)(C++20)
(C++17)

cppreference.com

std::deque::size

.