What method of getting the absolute value in modular arithmetic given a bounded value is the fastest?

Question

If I\'m writing a function f :: Integer -> Integer that I know will only be called with values from 0 to divisor, which of these implem