|
|
|
@@ -144,28 +144,3 @@ int av_find_nearest_q_idx(AVRational q, const AVRational* q_list) |
|
|
|
|
|
|
|
return nearest_q_idx; |
|
|
|
} |
|
|
|
|
|
|
|
#ifdef TEST |
|
|
|
int main(void) |
|
|
|
{ |
|
|
|
AVRational a,b; |
|
|
|
for (a.num = -2; a.num <= 2; a.num++) { |
|
|
|
for (a.den = -2; a.den <= 2; a.den++) { |
|
|
|
for (b.num = -2; b.num <= 2; b.num++) { |
|
|
|
for (b.den = -2; b.den <= 2; b.den++) { |
|
|
|
int c = av_cmp_q(a,b); |
|
|
|
double d = av_q2d(a) == av_q2d(b) ? |
|
|
|
0 : (av_q2d(a) - av_q2d(b)); |
|
|
|
if (d > 0) d = 1; |
|
|
|
else if (d < 0) d = -1; |
|
|
|
else if (d != d) d = INT_MIN; |
|
|
|
if (c != d) |
|
|
|
av_log(0, AV_LOG_ERROR, "%d/%d %d/%d, %d %f\n", a.num, |
|
|
|
a.den, b.num, b.den, c,d); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
return 0; |
|
|
|
} |
|
|
|
#endif |