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
|
/*
* Copyright (C) 2014-2021 Brian L. Browning
*
* This file is part of Beagle
*
* Beagle 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.
*
* Beagle 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/>.
*/
package beagleutil;
import java.util.Comparator;
/**
* <p>Interface {@code IntInterval} represents an interval of
* consecutive integers.
* </p>
* Instances of class {@code IntInterval} are immutable.
*
* @author Brian L. Browning {@code <browning@uw.edu>}
*/
public interface IntInterval {
/**
* Returns the start of the interval (inclusive).
* @return the start of the interval (inclusive).
*/
public int start();
/**
* Returns the end of the interval (inclusive).
* @return the end of the interval (inclusive).
*/
public int inclEnd();
/**
* Returns a {@code Comparator<IntInterval>} which orders
* {@code IntInterval} objects in order of increasing {@code this.start()}
* value and orders {@code IntInterval} objects with the same
* {@code this.start()} value in order of increasing {@code this.inclEnd()}
* value.
* @return a {@code Comparator<IntInterval>} object
*/
public static Comparator<IntInterval> incEndComp() {
return (IntInterval t1, IntInterval t2) -> {
if (t1.start() != t2.start()) {
return (t1.start() < t2.start()) ? -1 : 1;
}
else if (t1.inclEnd() != t2.inclEnd()) {
return (t1.inclEnd() < t2.inclEnd()) ? -1 : 1;
}
return 0;
} ;
}
/**
* Returns a {@code Comparator<IntInterval>} which orders
* {@code IntInterval} objects in order of increasing {@code this.start()}
* value and orders {@code IntInterval} objects with the same
* {@code this.start()} value in order of decreasing {@code this.inclEnd()}
* value.
* @return a {@code Comparator<IntInterval>} object
*/
public static Comparator<IntInterval> decEndComp() {
return (IntInterval t1, IntInterval t2) -> {
if (t1.start() != t2.start()) {
return (t1.start() < t2.start()) ? -1 : 1;
}
else if (t1.inclEnd() != t2.inclEnd()) {
return (t1.inclEnd() > t2.inclEnd()) ? -1 : 1;
}
return 0;
} ;
}
}
|
