Scilab Bag Of Tricks - Claymore

Chapter 4. Unknown Spots
[p_red, q_red] = reduce_int(p0, q0)
else
p_red = p0
q_red = q0
end
else
[p_red, q_red] = reduce_int(p0, q0) – reduce_int defined in complete example
end
f = tlist([’frac’; ’num’; ’denom’], p_red, q_red)
function s = %frac_p(f)
// display function for fractions
s = string(f)
disp(s)
//
// addition
//
function r = %frac_a_frac(f1, f2)
d1 = gcd_int(f1(’denom’), f2(’denom’))
if d1 == 1 then
r = frac(f1(’num’)*f2(’denom’) + f1(’denom’)*f2(’num’), ..
f1(’denom’)*f2(’denom’))
else
t = f1(’num’)*(f2(’denom’) / d1) + f2(’num’)*(f1(’denom’) / d1)
d2 = gcd_int(t, d1)
r = frac(t/d2, (f1(’denom’) / d1)*(f2(’denom’) / d2))
end
//
// conversion
//
function fl = frac2float(f)
// convert a fraction to a floating point number
fl = f(’num’) / f(’denom’)
function s = %frac_string(f)
// string( frac(...) )
if f(’denom’) == 1 then
s = sprintf(’%.0f’, f(’num’))
else
s = sprintf(’%.0f/%.0f’, f(’num’), f(’denom’))
end
After loading these definitions a new type named frac exists. It can be used like this:
46