Most efficient/elegant way to clip a number?

by

What about boring, old, readable, and shortest yet:

float clip(float n, float lower, float upper) {
  return std::max(lower, std::min(n, upper));
}

?

This expression could also be ‘genericized’ like so:

template <typename T>
T clip(const T& n, const T& lower, const T& upper) {
  return std::max(lower, std::min(n, upper));
}

Update

Billy ONeal added:

Note that on windows you might have to define NOMINMAX because they define min and max macros which conflict

More Related Contents:

  1. Creating all possible k combinations of n items in C++
  2. Finding all the subsets of a set
  3. Fast ceiling of an integer division in C / C++
  4. Fastest algorithm for primality test [closed]
  5. Special simple random number generator
  6. sine wave that slowly ramps up frequency from f1 to f2 for a given time
  7. Efficiently getting all divisors of a given number
  8. Inverting a 4×4 matrix
  9. Fastest way to get the integer part of sqrt(n)?
  10. Finding square root without using sqrt function?
  11. find the number of times a character occurs between two indexes
  12. Which is the fastest algorithm to find prime numbers?
  13. Rounding up to the nearest multiple of a number
  14. Magic number in boost::hash_combine
  15. How do I calculate the week number given a date?
  16. Where can I get a “useful” C++ binary search algorithm?
  17. How to convert Euler angles to directional vector?
  18. Printing prime numbers from 1 through 100
  19. Circular lock-free buffer
  20. Generating m distinct random numbers in the range [0..n-1]
  21. Rotate and translate object in local and global orientation using glm
  22. Gaussian elimination without result for acceleration
  23. Fastest implementation of sine, cosine and square root in C++ (doesn’t need to be much accurate)
  24. signed and unsigned arithmetic implementation on x86
  25. What is half open range and off the end value
  26. What’s the quickest way to compute log2 of an integer in C#?
  27. OpenSouce C/C++ Math expression parser Library [closed]
  28. Counting number of bits: How does this line work ? n=n&(n-1); [duplicate]
  29. Algorithm to pick values from array that sum closest to a target value?
  30. Is there any advantage to using pow(x,2) instead of x*x, with x double?

Leave a Comment