UHD 003.004.003-0-unknown

- Main Page
- Namespaces
- Classes
- Files

- File List
- File Members

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
algorithm.hpp
Go to the documentation of this file.
1 //
2 // Copyright 2010-2011 Ettus Research LLC
3 //
4 // This program is free software: you can redistribute it and/or modify
5 // it under the terms of the GNU General Public License as published by
6 // the Free Software Foundation, either version 3 of the License, or
7 // (at your option) any later version.
8 //
9 // This program is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with this program. If not, see <http://www.gnu.org/licenses/>.
16 //
17
18 #ifndef INCLUDED_UHD_UTILS_ALGORITHM_HPP
19 #define INCLUDED_UHD_UTILS_ALGORITHM_HPP
20
21 #include <algorithm>
22 #include <boost/range/begin.hpp>
23 #include <boost/range/end.hpp>
24
29 namespace uhd{
30
41 template<typename Range> inline Range sorted(const Range &range){
42 Range r(range); std::sort(boost::begin(r), boost::end(r)); return r;
43 }
44
55 template<typename Range> inline Range reversed(const Range &range){
56 Range r(range); std::reverse(boost::begin(r), boost::end(r)); return r;
57 }
58
68 template<typename Range, typename T> inline
69 bool has(const Range &range, const T &value){
70 return boost::end(range) != std::find(boost::begin(range), boost::end(range), value);
71 }
72
80 template<typename T> inline T clip(const T &val, const T &bound1, const T &bound2){
81 const T minimum = std::min(bound1, bound2);
82 if (val < minimum) return minimum;
83 const T maximum = std::max(bound1, bound2);
84 if (val > maximum) return maximum;
85 return val;
86 }
87
88 } //namespace uhd
89
90 #endif /* INCLUDED_UHD_UTILS_ALGORITHM_HPP */