octave-interval 2.1.0-2 / usr / share / octave / packages / interval-2.1.0 / @infsup / overlap.m

This file is indexed.

/usr/share/octave/packages/interval-2.1.0/@infsup/overlap.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
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
## 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
## @deftypemethod {@@infsup} {[@var{STATE}, @var{BITMASK}] =} overlap(@var{A}, @var{B})
## 
## Extensively compare the positions of intervals @var{A} and @var{B} on the
## real number line.
##
## Return the @var{STATE} as a string and the @var{BITMASK} of the state as an
## uint16 number, which represents one of the 16 possible states by taking a
## value 2^i (i = 0 … 15).
##
## Evaluated on interval matrices, this functions is applied element-wise.
##
## @table @asis
## @item @code{bothEmpty}, 2^0
## Both intervals are empty
## @item @code{firstEmpty}, 2^1
## Interval @var{A} is empty and @var{B} is not
## @item @code{secondEmpty}, 2^2
## Interval @var{A} is not empty, but @var{B} is
## @item @code{before}, 2^3
## [- - - @var{A} - - -]@ @ @ [- - - @var{B} - - -]
## @item @code{meets}, 2^4
## [- - - @var{A} - - -][- - - @var{B} - - -]
## @*Interval @var{A}'s upper boundary equals interval @var{B}'s lower boundary
## and neither consists of a single point only.
## @item @code{overlaps}, 2^5
## [- - - @var{A} - - - [= = =] - - - @var{B} - - -]
## @item @code{starts}, 2^6
## [[= = = @var{A} = = =] - - - @var{B} - - -]
## @item @code{containedBy}, 2^7
## [- - - @var{B} - - - [= = = @var{A} = = =] - - -]
## @item @code{finishes}, 2^8
## [- - - @var{B} - - - [= = = @var{A} = = =]]
## @item @code{equals}, 2^9
## Both intervals are equal (and not empty)
## @item @code{finishedBy}, 2^10
## [- - - @var{A} - - - [= = = @var{B} = = =]]
## @item @code{contains}, 2^11
## [- - - @var{A} - - - [= = = @var{B} = = =] - - -]
## @item @code{startedBy}, 2^12
## [[= = = @var{B} = = =] - - - @var{A} - - -]
## @item @code{overlappedBy}, 2^13
## [- - - @var{B} - - - [= = =] - - - @var{A} - - -]
## @item @code{metBy}, 2^14
## [- - - @var{B} - - -][- - - @var{A} - - -]
## @*Interval @var{A}'s lower boundary equals interval @var{B}'s upper boundary
## and neither consists of a single point only.
## @item @code{after}, 2^15
## [- - - @var{B} - - -]@ @ @ [- - - @var{A} - - -]
## @end table
##
## @seealso{@@infsup/eq, @@infsup/subset, @@infsup/interior, @@infsup/disjoint}
## @end deftypemethod

## Author: Oliver Heimlich
## Keywords: interval
## Created: 2014-10-04

function [state, bitmask] = overlap (a, b)

if (nargin ~= 2)
    print_usage ();
    return
endif
if (not (isa (a, "infsup")))
    a = infsup (a);
endif
if (not (isa (b, "infsup")))
    b = infsup (b);
endif

emptya = isempty (a);
emptyb = isempty (b);
notempty = not (emptya | emptyb);
comparison = {...
    "bothEmpty", (emptya & emptyb); ...
    "firstEmpty", (emptya & not (emptyb)); ...
    "secondEmpty", (emptyb & not (emptya)); ...
    "before", (notempty & a.sup < b.inf); ...
    "meets", (notempty & a.inf < a.sup & a.sup == b.inf & b.inf < b.sup); ...
    "overlaps", (notempty & a.inf < b.inf & b.inf < a.sup & a.sup < b.sup); ...
    "starts", (notempty & a.inf == b.inf & a.sup < b.sup); ...
    "containedBy", (notempty & b.inf < a.inf & a.sup < b.sup); ...
    "finishes", (notempty & b.inf < a.inf & a.sup == b.sup); ...
    "equals", (notempty & a.inf == b.inf & a.sup == b.sup); ...
    "finishedBy", (notempty & a.inf < b.inf & b.sup == a.sup); ...
    "contains", (notempty & a.inf < b.inf & b.sup < a.sup); ...
    "startedBy", (notempty & b.inf == a.inf & b.sup < a.sup); ...
    "overlappedBy", ...
            (notempty & b.inf < a.inf & a.inf < b.sup & b.sup < a.sup); ...
    "metBy", (notempty & b.inf < b.sup & b.sup == a.inf & a.inf < a.sup); ...
    "after", (notempty & b.sup < a.inf)};

if (nargout >= 2)
    bitmask = zeros (size (comparison{1, 2}), "uint16");
    for i = 1 : rows (comparison)
        bitmask(comparison{i, 2}) = pow2 (16 - i);
    endfor
endif

state = cell (size (comparison{1, 2}));
for i = 1 : rows (comparison)
    state(comparison{i, 2}) = comparison{i, 1};
endfor

if (numel (state) == 1)
    state = state{1};
endif

endfunction

%!assert (overlap (infsup (1, 2), infsup (3, 4)), "before");

APT Browse - Built by Thomas Orozco.