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
/
vecmin.cc
151 lines (129 loc) · 3.09 KB
/
vecmin.cc
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/*
* $Id: vecmin.cc,v 1.4 2005/06/02 18:56:08 julianc Exp $
*
* Copyright (C) 1997 Todd Veldhuizen <[email protected]>
* All rights reserved. Please see <blitz/blitz.h> for terms and
* conditions of use.
*
*/
#ifndef BZ_VECMIN_CC
#define BZ_VECMIN_CC
#ifndef BZ_VECGLOBS_H
#error <blitz/vecmin.cc> must be included via <blitz/vecglobs.h>
#endif
BZ_NAMESPACE(blitz)
template<typename P_expr>
inline
Extremum<_bz_typename P_expr::T_numtype, int> _bz_vec_min(P_expr vector)
{
typedef _bz_typename P_expr::T_numtype T_numtype;
T_numtype minValue = vector(0);
int minIndex = 0;
int length = vector._bz_suggestLength();
if (vector._bz_hasFastAccess())
{
for (int i=1; i < length; ++i)
{
T_numtype value = vector._bz_fastAccess(i);
if (value < minValue)
{
minValue = value;
minIndex = i;
}
}
}
else {
for (int i=1; i < length; ++i)
{
T_numtype value = vector(i);
if (value < minValue)
{
minValue = value;
minIndex = i;
}
}
}
return Extremum<T_numtype, int>(minValue, minIndex);
}
// min(vector)
template<typename P_numtype>
inline
Extremum<P_numtype,int> (min)(const Vector<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr());
}
// min(expr)
template<typename P_expr>
inline
Extremum<_bz_typename P_expr::T_numtype,int> (min)(_bz_VecExpr<P_expr> x)
{
return _bz_vec_min(x);
}
// min(vecpick)
template<typename P_numtype>
inline
Extremum<P_numtype, int> (min)(const VectorPick<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr());
}
// min(TinyVector)
template<typename P_numtype, int N_length>
inline
Extremum<P_numtype, int> (min)(const TinyVector<P_numtype, N_length>& x)
{
return _bz_vec_min(x._bz_asVecExpr());
}
// minIndex(vector)
template<typename P_numtype>
inline
int minIndex(const Vector<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).index();
}
// maxIndex(expr)
template<typename P_expr>
inline
int minIndex(_bz_VecExpr<P_expr> x)
{
return _bz_vec_min(x).index();
}
// minIndex(vecpick)
template<typename P_numtype>
int minIndex(const VectorPick<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).index();
}
// minIndex(TinyVector)
template<typename P_numtype, int N_length>
int minIndex(const TinyVector<P_numtype, N_length>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).index();
}
// minValue(vector)
template<typename P_numtype>
inline
int minValue(const Vector<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).value();
}
// minValue(expr)
template<typename P_expr>
inline
int minValue(_bz_VecExpr<P_expr> x)
{
return _bz_vec_min(x).value();
}
// minValue(vecpick)
template<typename P_numtype>
int minValue(const VectorPick<P_numtype>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).value();
}
// minValue(TinyVector)
template<typename P_numtype, int N_length>
int minValue(const TinyVector<P_numtype, N_length>& x)
{
return _bz_vec_min(x._bz_asVecExpr()).value();
}
BZ_NAMESPACE_END
#endif // BZ_VECMIN_CC