@addtogroup lavu_math @{
Compare 2 integers modulo mod. That is we compare integers a and b for which only the least significant log2(mod) bits are known.
Compare 2 timestamps each in its own timebases. The result of the function is undefined if one of the timestamps is outside the int64_t range when represented in the others timebase. @return -1 if ts_a is before ts_b, 1 if ts_a is after ts_b or 0 if they represent the same position
Return the greatest common divisor of a and b. If both a and b are 0 or either or both are <0 then behavior is undefined.
Rescale a 64-bit integer with rounding to nearest. A simple a*b/c isn't possible as it can overflow.
Rescale a timestamp while preserving known durations.
Rescale a 64-bit integer by 2 rational numbers.
Rescale a 64-bit integer by 2 rational numbers with specified rounding.
Rescale a 64-bit integer with specified rounding. A simple a*b/c isn't possible as it can overflow.