(* * rational numbers * Copyright (c) 2003 Michael Niedermayer * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * * This is a part of Pascal porting of ffmpeg. * - Originally by Victor Zinetz for Delphi and Free Pascal on Windows. * - For Mac OS X, some modifications were made by The Creative CAT, denoted as CAT * in the source codes. * - Changes and updates by the UltraStar Deluxe Team * * Conversion of libavutil/rational.h * avutil max. version 50.21.0, revision 24190, Wed Jul 21 01:00:00 2010 CET * *) unit rational; {$IFDEF FPC} {$MODE DELPHI} {$PACKENUM 4} (* use 4-byte enums *) {$PACKRECORDS C} (* C/C++-compatible record packing *) {$ELSE} {$MINENUMSIZE 4} (* use 4-byte enums *) {$ENDIF} {$I switches.inc} interface uses ctypes, UConfig; type (* * rational number numerator/denominator *) PAVRational = ^TAVRational; TAVRational = record num: cint; ///< numerator den: cint; ///< denominator end; TAVRationalArray = array[0 .. (MaxInt div SizeOf(TAVRational))-1] of TAVRational; PAVRationalArray = ^TAVRationalArray; (** * Compare two rationals. * @param a first rational * @param b second rational * @return 0 if a==b, 1 if a>b and -1 if a= 49011000} // 49.11.0 (** * @return 1 if q1 is nearer to q than q2, -1 if q2 is nearer * than q1, 0 if they have the same distance. *) function av_nearer_q(q, q1, q2: TAVRational): cint; cdecl; external av__util; (** * Find the nearest value in q_list to q. * @param q_list an array of rationals terminated by {0, 0} * @return the index of the nearest value found in the array *) function av_find_nearest_q_idx(q: TAVRational; q_list: {const} PAVRationalArray): cint; cdecl; external av__util; {$IFEND} implementation function av_cmp_q (a: TAVRational; b: TAVRational): cint; var tmp: cint64; begin tmp := a.num * cint64(b.den) - b.num * cint64(a.den); if (tmp <> 0) then Result := (tmp shr 63) or 1 else Result := 0 end; function av_q2d(a: TAVRational): cdouble; begin Result := a.num / a.den; end; end.