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

 

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::set

Member functions

set::set

set::~set

set::operator=

set::get_allocator

Iterators

set::begin set::cbegin (C++11)

set::end set::cend (C++11)

set::rbegin set::crbegin (C++11)

set::rend set::crend (C++11)

Capacity

set::empty

set::size

set::max_size

Modifiers

set::clear

set::insert

set::emplace (C++11)

set::emplace_hint (C++11)

set::erase

set::swap

Lookup

set::count

set::find

set::equal_range

set::lower_bound

set::upper_bound

Observers

set::key_comp

set::value_comp

 

template< class Key, class Compare, class Alloc > bool operator==( set<Key,Compare,Alloc>& lhs,                  set<Key,Compare,Alloc>& rhs );	(1)
template< class Key, class Compare, class Alloc > bool operator!=( set<Key,Compare,Alloc>& lhs,                  set<Key,Compare,Alloc>& rhs );	(2)
template< class Key, class Compare, class Alloc > bool operator<( set<Key,Compare,Alloc>& lhs,                 set<Key,Compare,Alloc>& rhs );	(3)
template< class Key, class Compare, class Alloc > bool operator<=( set<Key,Compare,Alloc>& lhs,                  set<Key,Compare,Alloc>& rhs );	(4)
template< class Key, class Compare, class Alloc > bool operator>( set<Key,Compare,Alloc>& lhs,                 set<Key,Compare,Alloc>& rhs );	(5)
template< class Key, class Compare, class Alloc > bool operator>=( set<Key,Compare,Alloc>& lhs,                  set<Key,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 has equivalent 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
- Key must meet the requirements of EqualityComparable in order to use versions (1-2).

Return value

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

2) true if the contents of the containers are not equivalent, 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