Mercurial > libavutil.hg
diff rational.c @ 573:1f4b70bcd610 libavutil
Implement av_nearer_q() and av_find_nearest_q_idx() functions.
author | stefano |
---|---|
date | Thu, 25 Sep 2008 19:23:13 +0000 |
parents | f13e5473611e |
children | 819752f80c64 |
line wrap: on
line diff
--- a/rational.c Fri Sep 19 12:41:12 2008 +0000 +++ b/rational.c Thu Sep 25 19:23:13 2008 +0000 @@ -101,3 +101,28 @@ return a; } + +int av_nearer_q(AVRational q, AVRational q1, AVRational q2) +{ + /* n/d is q, a/b is the median between q1 and q2 */ + int64_t a = q1.num * (int64_t)q2.den + q2.num * (int64_t)q1.den; + int64_t b = 2 * (int64_t)q1.den * q2.den; + + /* rnd_up(a*d/b) > n => a*d/b > n */ + int64_t x_up = av_rescale_rnd(a, q.den, b, AV_ROUND_UP); + + /* rnd_down(a*d/b) < n => a*d/b < n */ + int64_t x_down = av_rescale_rnd(a, q.den, b, AV_ROUND_DOWN); + + return ((x_up > q.num) - (x_down < q.num)) * av_cmp_q(q2, q1); +} + +int av_find_nearest_q_idx(AVRational q, const AVRational* q_list) +{ + int i, nearest_q_idx = 0; + for(i=0; q_list[i].den; i++) + if (av_nearer_q(q, q_list[i], q_list[nearest_q_idx]) > 0) + nearest_q_idx = i; + + return nearest_q_idx; +}