/usr/share/octave/packages/interval-3.1.0/@infsup/private/decimaldivide.m is in octave-interval 3.1.0-5.
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 | ## Copyright 2014-2016 Oliver Heimlich
##
## This program is free software; you can redistribute it and/or modify
## it under the terms of the GNU General Public License as published by
## the Free Software Foundation; either version 3 of the License, or
## (at your option) any later version.
##
## This program 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 General Public License for more details.
##
## You should have received a copy of the GNU General Public License
## along with this program; if not, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @documentencoding UTF-8
## @deftypefun {[@var{QUOTIENT}, @var{REMAINDER}] =} decimaldivide (@var{DIVIDEND}, @var{DIVISOR}, @var{PRECISION})
##
## Divide two decimal numbers. The parameter @var{PRECISION} limits the
## maximum significand places in the @var{QUOTIENT}.
##
## @end deftypefun
## Author: Oliver Heimlich
## Created: 2014-10-22
function [quotient, remainder] = decimaldivide (dividend, divisor, precision)
assert (not (isempty (divisor.m)), "division by zero");
if (isempty (dividend.m)) # 0 / divisor
quotient = dividend;
remainder = dividend;
return
endif
## Compute exponent and sign of the result
quotient.e = dividend.e - divisor.e + 1;
divisor.e = dividend.e;
quotient.s = xor (dividend.s, divisor.s);
divisor.s = dividend.s;
quotient.m = zeros (precision, 1);
## Perform long division
remainder = dividend;
i = 1;
while (i <= length (quotient.m))
if (isempty (remainder.m))
break
endif
while (sign (decimalcompare (divisor, remainder)) ~= (-1) ^ remainder.s)
quotient.m (i) ++;
## Subtract divisor from remainder
divisor.s = not (remainder.s);
remainder = decimaladd (remainder, divisor);
divisor.s = remainder.s;
endwhile
divisor.e --;
if (i == 1 && quotient.m (i) == 0)
quotient.e --;
else
i++;
endif
endwhile
## Remove trailing zeros
quotient.m = quotient.m(1 : find (quotient.m ~= 0, 1, "last"));
endfunction
|