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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkGenericUtilities.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkGenericUtilities_h
#define __itkGenericUtilities_h
namespace itk
{
///////////////////////////////////////////////////
///////////////////////////////////////////////////
// Generic Programming Algorithms
///////////////////////////////////////////////////
/// \brief returns the min and max of a sequence defined by two iterators
///
/// Uses the < operator to determin ordering
/// If first == last then return is pair(first,first);
/// otherwise is it pair(min, max)
template <class TInputIter>
std::pair<TInputIter, TInputIter> min_max_element(TInputIter first, TInputIter last)
{
std::pair<TInputIter,TInputIter> result(first,first);
if (first == last)
return result;
while (++first != last)
{
TInputIter prev = first;
if (++first == last)
{
if (*prev < *(result.first))
result.first = prev;
if (*(result.second) < *prev)
result.second = prev;
break;
}
else if (*first < *prev)
{
if (*first < *(result.first))
result.first = first;
if (*(result.second) < *prev)
result.second = prev;
}
else
{
if (*prev < *(result.first))
result.first = prev;
if (*(result.second) < *first)
result.second = first;
}
}
return result;
}
/// \brief returns the min and max of a
///
/// Uses the provided binary functor
/// If first == last then return is pair(first,first);
/// otherwise is it pair(min, max)
template <class TInputIter, class TCompare>
std::pair<TInputIter, TInputIter> min_max_element(TInputIter first, TInputIter last, TCompare comp)
{
std::pair<TInputIter,TInputIter> result(first,first);
if (first == last)
{
return result;
}
while (++first != last)
{
TInputIter prev = first;
if (++first == last)
{
if (comp(*prev,*(result.first)))
{
result.first = prev;
}
if (comp(*(result.second),*prev))
{
result.second = prev;
}
break;
}
else if (comp(*first,*prev))
{
if (comp(*first,*(result.first)))
{
result.first = first;
}
if (comp(*(result.second),*prev))
{
result.second = prev;
}
}
else
{
if (comp(*prev,*(result.first)))
{
result.first = prev;
}
if (comp(*(result.second),*first))
{
result.second = first;
}
}
}
return result;
}
} // end itk namespace
#endif //__itkGenericUtilities_h
|
