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

 

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

Member functions

vector::vector

vector::~vector

vector::operator=

vector::assign

vector::get_allocator

Element access

vector::at

vector::operator[]

vector::front

vector::back

vector::data (C++11)

Iterators

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

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

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

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

Capacity

vector::empty

vector::size

vector::max_size

vector::reserve

vector::capacity

vector::shrink_to_fit (C++11)

Modifiers

vector::clear

vector::insert

vector::emplace (C++11)

vector::erase

vector::push_back

vector::emplace_back (C++11)

vector::pop_back

vector::resize

vector::swap

 

template< class T, class Alloc > bool operator==( vector<T,Alloc>& lhs,                  vector<T,Alloc>& rhs );	(1)
template< class T, class Alloc > bool operator!=( vector<T,Alloc>& lhs,                  vector<T,Alloc>& rhs );	(2)
template< class T, class Alloc > bool operator<( vector<T,Alloc>& lhs,                 vector<T,Alloc>& rhs );	(3)
template< class T, class Alloc > bool operator<=( vector<T,Alloc>& lhs,                  vector<T,Alloc>& rhs );	(4)
template< class T, class Alloc > bool operator>( vector<T,Alloc>& lhs,                 vector<T,Alloc>& rhs );	(5)
template< class T, class Alloc > bool operator>=( vector<T,Alloc>& lhs,                  vector<T,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
- T must meet the requirements of EqualityComparable in order to use versions (1-2).
- T must meet the requirements of LessThanComparable in order to use versions (3-6). The ordering relation must establish total order.

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