This repository has been archived by the owner on May 25, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
minmax.h
66 lines (54 loc) · 1.73 KB
/
minmax.h
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
/***************************************************************************
* blitz/minmax.h Declaration of min and max functions
*
* $Id: minmax.h,v 1.4 2003/12/11 03:44:22 julianc Exp $
*
* Copyright (C) 1997-2001 Todd Veldhuizen <[email protected]>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* Suggestions: [email protected]
* Bugs: [email protected]
*
* For more information, please see the Blitz++ Home Page:
* http://oonumerics.org/blitz/
*
***************************************************************************/
#ifndef BZ_MINMAX_H
#define BZ_MINMAX_H
#include <blitz/promote.h>
BZ_NAMESPACE(blitz)
/*
* These functions are in their own namespace (blitz::minmax) to avoid
* conflicts with the array reduction operations min and max.
*/
BZ_NAMESPACE(minmax)
template<typename T1, typename T2>
BZ_PROMOTE(T1,T2) min(const T1& a, const T2& b)
{
typedef BZ_PROMOTE(T1,T2) T_promote;
if (a <= b)
return T_promote(a);
else
return T_promote(b);
}
template<typename T1, typename T2>
BZ_PROMOTE(T1,T2) max(const T1& a, const T2& b)
{
typedef BZ_PROMOTE(T1,T2) T_promote;
if (a >= b)
return T_promote(a);
else
return T_promote(b);
}
BZ_NAMESPACE_END
BZ_NAMESPACE_END
#endif