blob: ac0b070f4a4ceb2239e679c58f3a4e246a84a833 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/include/functional $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#ifndef _FUNCTIONAL_H
#define _FUNCTIONAL_H
// See C++ spec
namespace std
{
template<typename A1, typename A2, typename R>
struct binary_function
{
typedef A1 first_argument_type; ///< type of the first argument
typedef A2 second_argument_type; ///< type of the second argument
typedef R result_type; ///< type of the return type
};
template<typename A, typename R>
struct unary_function
{
typedef A argument_type;
typedef R result_type;
};
/**
* less template
*/
template<typename T>
struct less : public binary_function<T, T, bool>
{
/**
* operator()
* @param[in] x first object
* @param[in] y second object
* @return true if x < y otherwise false
*/
bool operator()(const T& x, const T& y) const
{
return x < y;
}
};
template<typename T>
struct greater : public binary_function<T, T, bool>
{
/**
* operator()
* @param[in] x first object
* @param[in] y second object
* @return true if x > y otherwise false
*/
bool operator()(const T& x, const T& y) const
{ return x > y; }
};
};
#endif
/* vim: set filetype=cpp : */
|
