The clamp() function in C++ boost library is found under the header ‘boost/algorithm/clamp.hpp’ contains two functions for “clamping” a value between a pair of boundary values.
const T& clamp ( const T& val, const T& lo, const T& hi ) or const T& clamp ( const T& value, const T& low, const T& high, Pred p )
Parameters: The function accepts parameters as described below:
- value: This speifies the value compared to.
- low: This specifies the lower range.
- high: This specifies the higher range.
- p: This specifies the predicate function.
- It returns low if value is less than low.
- It returns high if high is greater than value.
- In all other cases, it returns value.
- snprintf() in C library
- <strings> library in C++ STL
- <algorithms> library in C++ STL
- <iterator> library in C++ STL
- SDL library in C/C++ with examples
- <regex> library in C++ STL
- <numeric> library in C++ STL
- Any datatype in C++ boost library
- difftime() C library function
- boost::split in C++ library
- Pattern Searching using C++ library
- Map in C++ Standard Template Library (STL)
- Set in C++ Standard Template Library (STL)
- Advanced C++ with boost library
- The C++ Standard Template Library (STL)
- boost::algorithm::equal() in C++ library
- boost::algorithm::is_partitioned() in C++ library
- boost::algorithm::none_of() in C++ library
- boost::algorithm::any_of() in C++ library
- boost::algorithm::none_of_equal() in C++ library
Return Value: The function returns three values as described below:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.