This file is indexed.

/usr/share/octave/packages/interval-2.1.0/@infsup/mince.m is in octave-interval 2.1.0-2.

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
## Copyright 2015-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
## @defmethod {@@infsup} mince (@var{X})
## @defmethodx {@@infsup} mince (@var{X}, @var{N})
## 
## Mince interval @var{X} into a row vector of @var{N} sub-intervals of equal
## size.
##
## The sub-intervals are returned in ascending order and may overlap due to
## round-off errors.
##
## If @var{X} is not a scalar, the result is a matrix.  The default value for
## @var{N} is 100.
##
## Accuracy: The result is an accurate enclosure.
##
## @example
## @group
## mince (infsup (0, 10), 4)
##   @result{} ans = 1×4 interval vector
##
##        [0, 2.5]   [2.5, 5]   [5, 7.5]   [7.5, 10]
## @end group
## @end example
## @seealso{@@infsup/linspace, @@infsup/bisect}
## @end defmethod

## Author: Oliver Heimlich
## Keywords: interval
## Created: 2015-07-19

function x = mince (x, n)

if (nargin > 2)
    print_usage ();
    return
endif
if (not (isa (x, "infsup")))
    x = infsup (x);
endif
if (nargin < 2)
    n = 100;
endif

base = limit = x;
idx.type = '()';
idx.subs = {isfinite(x.inf)};
base = subsasgn (base, idx, infsup (subsref (x.inf, idx)));
idx.subs = {isfinite(x.sup)};
limit = subsasgn (limit, idx, infsup (subsref (x.sup, idx)));

boundaries = linspace (base, limit, n + 1);
l = boundaries.inf(:, 1 : end - 1);
u = boundaries.sup(:, 2 : end);

empty = vec (isempty (x));
l(empty, :) = inf;
u(empty, :) = -inf;

x.inf = l;
x.sup = u;

endfunction

%!assert (isequal (mince (infsup (0, 10), 10), infsup (0 : 9, 1 : 10)));