std::list::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 or linear ( C++11)

Constant ( C++11)

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

#include <list>
#include <iostream>

int main()
{
    std::list<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)

-
,

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

list::front
list::back

list::beginlist::cbegin (C++11)
list::endlist::cend (C++11)
list::rbeginlist::crbegin (C++11)
list::rendlist::crend (C++11)

list::empty
list::size
list::max_size

list::clear
list::insert
list::insert_range (C++23)
list::emplace (C++11)
list::erase
list::push_front
list::emplace_front (C++11)
list::prepend_range (C++23)
list::pop_front
list::push_back
list::emplace_back (C++11)
list::append_range (C++23)
list::pop_back
list::resize
list::swap

list::merge
list::splice
list::removelist::remove_if
list::reverse
list::unique
list::sort
,
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::list::size

.