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

From Cppreference

C++ Standard Library
Language 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::forward_list
Member functions forward_list::forward_list forward_list::~forward_list forward_list::operator= forward_list::assign forward_list::get_allocator Element access forward_list::front Iterators forward_list::before_begin forward_list::cbefore_begin forward_list::begin forward_list::cbegin forward_list::end forward_list::cend Capacity forward_list::empty forward_list::max_size Modifiers forward_list::clear forward_list::insert_after forward_list::emplace_after forward_list::erase_after forward_list::push_front forward_list::emplace_front forward_list::pop_front forward_list::resize forward_list::swap Operations forward_list::merge forward_list::splice_after forward_list::remove forward_list::remove_if forward_list::reverse forward_list::unique forward_list::sort

template< class T, class Allocator > void operator==( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(1)
template< class T, class Allocator > void operator!=( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(2)
template< class T, class Allocator > void operator<( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(3)
template< class T, class Allocator > void operator<=( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(4)
template< class T, class Allocator > void operator>( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(5)
template< class T, class Allocator > void operator>=( forward_list<T,Allocator> &lhs, forward_list<T,Allocator> &rhs);	(6)

Compares the contents of two containers.

1-2) Checks if the contents of lhs and rhs are equal, that is, 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().

[edit] Parameters

lhs, rhs

-

containers whose contents to compare

[edit] 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

[edit] Complexity

linear in the size of the container