UHD
003.004.005-release
|
00001 // 00002 // Copyright 2010-2011 Ettus Research LLC 00003 // 00004 // This program is free software: you can redistribute it and/or modify 00005 // it under the terms of the GNU General Public License as published by 00006 // the Free Software Foundation, either version 3 of the License, or 00007 // (at your option) any later version. 00008 // 00009 // This program is distributed in the hope that it will be useful, 00010 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00012 // GNU General Public License for more details. 00013 // 00014 // You should have received a copy of the GNU General Public License 00015 // along with this program. If not, see <http://www.gnu.org/licenses/>. 00016 // 00017 00018 #ifndef INCLUDED_UHD_UTILS_ALGORITHM_HPP 00019 #define INCLUDED_UHD_UTILS_ALGORITHM_HPP 00020 00021 #include <algorithm> 00022 #include <boost/range/begin.hpp> 00023 #include <boost/range/end.hpp> 00024 00029 namespace uhd{ 00030 00041 template<typename Range> inline Range sorted(const Range &range){ 00042 Range r(range); std::sort(boost::begin(r), boost::end(r)); return r; 00043 } 00044 00055 template<typename Range> inline Range reversed(const Range &range){ 00056 Range r(range); std::reverse(boost::begin(r), boost::end(r)); return r; 00057 } 00058 00068 template<typename Range, typename T> inline 00069 bool has(const Range &range, const T &value){ 00070 return boost::end(range) != std::find(boost::begin(range), boost::end(range), value); 00071 } 00072 00080 template<typename T> inline T clip(const T &val, const T &bound1, const T &bound2){ 00081 const T minimum = std::min(bound1, bound2); 00082 if (val < minimum) return minimum; 00083 const T maximum = std::max(bound1, bound2); 00084 if (val > maximum) return maximum; 00085 return val; 00086 } 00087 00088 } //namespace uhd 00089 00090 #endif /* INCLUDED_UHD_UTILS_ALGORITHM_HPP */