std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::end, std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::cend

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros(C++20)

Language support library

Concepts library(C++20)

Diagnostics library

Memory management library

Metaprogramming library(C++11)

General utilities library

Containers library

Iterators library

Ranges library(C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library(C++17)

Concurrency support library(C++11)

Execution control library(C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

node-handle (C++17)

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

hive (C++26)

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

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::flat_map

Member types

Member functions

flat_map::flat_map flat_map::operator= Element access flat_map::at flat_map::operator[] Iterators flat_map::beginflat_map::cbegin flat_map::endflat_map::cend flat_map::rbeginflat_map::crbegin flat_map::rendflat_map::crend Lookup flat_map::count flat_map::find flat_map::contains flat_map::equal_range    flat_map::lower_bound flat_map::upper_bound Capacity flat_map::size flat_map::max_size flat_map::empty Modifiers flat_map::clear flat_map::erase flat_map::swap flat_map::emplace flat_map::extract flat_map::replace flat_map::insert flat_map::insert_range flat_map::insert_or_assign flat_map::emplace_hint flat_map::try_emplace Observers flat_map::key_comp flat_map::keys flat_map::value_comp flat_map::values

Non-member functions

operator==operator<=>         swap(std::flat_map) erase_if(std::flat_map)

Helper classes

uses_allocator<std::flat_map>

Tags

sorted_unique       sorted_unique_t

Deduction guides

 

iterator end()noexcept;	(1)	(since C++23) (constexpr since C++26)
const_iterator end()constnoexcept;	(2)	(since C++23) (constexpr since C++26)
const_iterator cend()constnoexcept;	(3)	(since C++23) (constexpr since C++26)

Returns an iterator past the last element of *this.

This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable.

Return value

Iterator past the last element.

Complexity

Constant.

Example

Run this code

#include <iostream>#include <flat_map>   int main(){std::flat_map<int, double> map{{4, 4.13}, {9, 9.24}, {1, 1.09}};   for(auto it = map.cbegin(); it != map.cend();++it)std::cout<<'['<< it->first <<"] = "<< it->second <<'\n';   // Unlike std::map's bidirectional iterators, the std::flat_map iterators// are random-access, so they can be used with the operator[]:auto it = map.cbegin();assert(it[0]== map[1]);assert(it[1]== map[4]);assert(it[2]== map[9]);}

Output:

[1] = 1.09 [4] = 4.13 [9] = 9.24

See also

begincbegin	returns an iterator to the beginning (public member function)
endcend (C++11)(C++14)	returns an iterator to the end of a container or array (function template)