operator==,!=,<,<=,>,>=(std::map)

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

array (C++11)

vector

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

 

std::map

Member functions

map::map

map::~map

map::operator=

map::get_allocator

Element access

map::at

map::operator[]

Iterators

map::beginmap::cbegin (C++11)

map::endmap::cend (C++11)

map::rbeginmap::crbegin (C++11)

map::rendmap::crend (C++11)

Capacity

map::empty

map::size

map::max_size

Modifiers

map::clear

map::insert

map::insert_or_assign (C++17)

map::emplace (C++11)

map::emplace_hint (C++11)

map::try_emplace (C++17)

map::erase

map::swap

Lookup

map::count

map::find

map::equal_range

map::lower_bound

map::upper_bound

Observers

map::key_comp

map::value_comp

 

template< class Key, class T, class Compare, class Alloc > bool operator==( const map<Key,T,Compare,Alloc>& lhs,                  const map<Key,T,Compare,Alloc>& rhs );	(1)
template< class Key, class T, class Compare, class Alloc > bool operator!=( const map<Key,T,Compare,Alloc>& lhs,                  const map<Key,T,Compare,Alloc>& rhs );	(2)
template< class Key, class T, class Compare, class Alloc > bool operator<( const map<Key,T,Compare,Alloc>& lhs,                 const map<Key,T,Compare,Alloc>& rhs );	(3)
template< class Key, class T, class Compare, class Alloc > bool operator<=( const map<Key,T,Compare,Alloc>& lhs,                  const map<Key,T,Compare,Alloc>& rhs );	(4)
template< class Key, class T, class Compare, class Alloc > bool operator>( const map<Key,T,Compare,Alloc>& lhs,                 const map<Key,T,Compare,Alloc>& rhs );	(5)
template< class Key, class T, class Compare, class Alloc > bool operator>=( const map<Key,T,Compare,Alloc>& lhs,                  const map<Key,T,Compare,Alloc>& rhs );	(6)

Compares the contents of two containers.

1-2) Checks if the contents of lhs and rhs are equal, that is, whether lhs.size() == rhs.size() and each element in lhs compares equal with the element in rhs at the same position.

3-6) Compares the contents of lhs and rhs lexicographically. The comparison is performed by a function equivalent to std::lexicographical_compare.

Parameters

lhs, rhs	-	containers whose contents to compare
- T, Key must meet the requirements of EqualityComparable in order to use overloads (1-2).
- Key must meet the requirements of LessThanComparable in order to use overloads (3-6). The ordering relation must establish total order.

Return value

1) true if the contents of the containers are equal, false otherwise

2) true if the contents of the containers are not equal, false otherwise

3) true if the contents of the lhs are lexicographically less than the contents of rhs, false otherwise

4) true if the contents of the lhs are lexicographically less than or equal the contents of rhs, false otherwise

5) true if the contents of the lhs are lexicographically greater than the contents of rhs, false otherwise

6) true if the contents of the lhs are lexicographically greater than or equal the contents of rhs, false otherwise

Complexity

Linear in the size of the container