/usr/include/linbox/algorithms/rational-reconstruction2.h is in liblinbox-dev 1.4.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 | /* Copyright (c) LinBox
* Author Z. Wan
* Modified to fit in linbox
* Using GMP directly
* Implement the idea in the manuscript, available at http://www.cis.udel.edu/~wan/jsc_wan.ps
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox 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.1 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
* ========LICENCE========
*/
#ifndef __LINBOX_rational_reconstruction2_H__
#define __LINBOX_rational_reconstruction2_H__
#include "linbox/integer.h"
namespace LinBox
{
inline int rational_reconstruction (integer& a, integer& b, const integer& n0, const integer& d0, const integer& B)
{
integer p0, p1, p2; integer q0, q1, q2;
integer q, r; integer n, d;
p0 = 0; p1 = 1; p2 = 0; q0 = 1; q1 = 0; q2 = 0;
n = abs (n0); d = abs (d0);
int sgn = sign(n0) * sign(d0);
if (d0 < B) {
if (sgn > 0)
a = n0;
else
a = -n0;
b= d0;
return 0;
}
do {
integer::divmod (q, r, n, d);
p2 = p0 + q * p1;
q2 = q0 + q * q1;
p0 = p1; p1 = p2;
q0 = q1; q1 = q2;
n = d; d = r;
} while ((q2 < B) && (sign(d) != 0));
if (q2 > B) {
if (sgn >= 0)
a = p0;
else
a = - p0;
b = q0;
}
else {
if (sgn >= 0)
a = p1;
else
a = -p1;
b = q1;
}
return 0;
}
}// LinBox
#endif //__LINBOX_rational_reconstruction2_H__
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|