.\" ident @(#)less_equal.3
.\" Standard Template Library
.\" $$RW_INSERT_HEADER "slyrs.man"
.TH less_equal 3C++ "02 Apr 1998" "Rogue Wave Software" "-"
.ce2
Standard C++ Library   
Copyright 1998, Rogue Wave Software, Inc.   

.SH NAME

\f2less_equal\fP

\ - A binary function object that returns \f2true\fP if its first argument is less than or equal to its second.



.SH  SYNOPSIS


.br
#include<functional>
.br
template <class T>
.br
struct less_equal : public binary_function<T, T, bool>;



.SH  DESCRIPTION


less_equal is a binary function object. Its \f2operator()\fP returns \f2true\fP if \f2x\fP is less than or equal to \f2y\fP. You can pass a less_equal object to any algorithm that requires a binary function. For example, the sort algorithm can accept a binary function as an alternate comparison object to sort a sequence. less_equal would be used in that algorithm in the following manner:


.br
vector<int> vec1;
.br
.
.br
.
.br
.
.br
sort(vec1.begin(), vec1.end(),less_equal<int>());

After this call to sort, \f2vec1\fP is sorted in ascending order. 



.SH  INTERFACE



.br
template <class T>
.br
struct less_equal : binary_function<T, T, bool> {
.RE
.RS 1
bool operator() (const T&, const T&) const;
.RE
.RS 0
};



.SH  WARNINGS


If your compiler does not support default template parameters, then you always need to supply the \f2Allocator\fP template argument. For instance, you have to write:

\f2vector<int, allocator<int> >\fP

instead of 

\f2vector<int>\fP

If your compiler does not support namespaces, then you do not need the using declaration for \f2std\fP.



.SH  SEE ALSO


binary_function, Function_Objects