blob: 1ad7358ea425e48720a00234fde16f9ba064b73a (
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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/include/util/algorithm.H $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2012
//
// 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 __UTIL_ALGORITHM_H
#define __UTIL_ALGORITHM_H
namespace Util
{
namespace Algorithm
{
/** @struct static_min
* @brief Template class to perform a compile-time min calculation.
*
* Example:
* static_min<size_t, 5, 7>::value == 5
*/
template <typename T, T a, T b>
struct static_min
{
static const T value = (a < b) ? a : b;
};
/** @struct static_max
* @brief Template class to perform a compile-time max calculation.
*
* Example:
* static_max<size_t, 5, 7>::value == 7
*/
template <typename T, T a, T b>
struct static_max
{
static const T value = (a > b) ? a : b;
};
};
};
#endif
|
