4 Copyright (c) 2018, Mungo Carstairs
7 Redistribution and use in source and binary forms, with or without
8 modification, are permitted provided that the following conditions are met:
10 * Redistributions of source code must retain the above copyright notice, this
11 list of conditions and the following disclaimer.
13 * Redistributions in binary form must reproduce the above copyright notice,
14 this list of conditions and the following disclaimer in the documentation
15 and/or other materials provided with the distribution.
17 * Neither the name of the copyright holder nor the names of its
18 contributors may be used to endorse or promote products derived from
19 this software without specific prior written permission.
21 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
24 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
25 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
27 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
28 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 package intervalstore.api;
34 import java.util.Collections;
35 import java.util.Comparator;
36 import java.util.List;
38 public interface IntervalI
42 * Compare intervals by start position ascending and end position descending.
44 * BIGENDIAN sorts 10-100 ahead of 10-80 (original IntervalStoreJ method
47 static Comparator<? super IntervalI> COMPARATOR_BIGENDIAN = new Comparator<IntervalI>()
50 public int compare(IntervalI o1, IntervalI o2)
52 int ret = Integer.signum(o1.getBegin() - o2.getBegin());
53 return (ret == 0 ? Integer.signum(o2.getEnd() - o1.getEnd()) : ret);
58 * Compare intervals by start position ascending and end position descending.
60 * LITTLEENDIAN sorts 10-100 after 10-80
63 static Comparator<? super IntervalI> COMPARATOR_LITTLEENDIAN = new Comparator<IntervalI>()
66 public int compare(IntervalI o1, IntervalI o2)
68 int ret = Integer.signum(o1.getBegin() - o2.getBegin());
69 return (ret == 0 ? Integer.signum(o1.getEnd() - o2.getEnd()) : ret);
74 * a comparator for sorting intervals by start position ascending
76 static Comparator<? super IntervalI> FORWARD_STRAND = new Comparator<IntervalI>()
79 public int compare(IntervalI o1, IntervalI o2)
81 return Integer.signum(o1.getBegin() - o2.getBegin());
86 * a comparator for sorting intervals by end position descending
88 static Comparator<? super IntervalI> REVERSE_STRAND = new Comparator<IntervalI>()
91 public int compare(IntervalI o1, IntervalI o2)
93 return Integer.signum(o2.getEnd() - o1.getEnd());
97 static int NOT_CONTAINED = Integer.MIN_VALUE;
98 static int CONTAINMENT_UNKNOWN = 0;
104 * Answers true if this interval contains (or matches) the given interval
105 * based solely on start and end.
110 default boolean containsInterval(IntervalI i)
112 return i != null && i.getBegin() >= getBegin()
113 && i.getEnd() <= getEnd();
118 * Answers true if this interval properly contains the given interval, that
119 * is, it contains it and is larger than it
124 default boolean properlyContainsInterval(IntervalI i)
126 return containsInterval(i)
127 && (i.getBegin() > getBegin() || i.getEnd() < getEnd());
131 * Slower than equalsInterval; also includes type.
133 * Ensure that subclasses override equals(Object). For example:
135 * public boolean equals(Object o) { return o != null && o instanceof XXX &&
136 * equalsInterval((XXX) i); }
139 * equalsInterval also must be overridden.
141 * public boolean equalsInterval(IntervalI i) {return ((SimpleFeature)i).start
142 * == start && ((SimpleFeature)i).end == end && ((SimpleFeature)i).description
143 * == this.description; }
147 * @return true if equal, including a type check
150 abstract boolean equals(Object o);
155 * Check that two intervals are equal, in terms of end points, descriptions,
156 * or any other distinguishing features.
158 * Used in IntervalStore in searches, since it is faster than equals(), as at
159 * that point we know that we have the correct type.
163 * @return true if equal; null value must return false, not throw
164 * NullPointerException
166 abstract boolean equalsInterval(IntervalI i);
168 default boolean overlapsInterval(IntervalI i)
174 if (i.getBegin() < getBegin())
176 return i.getEnd() >= getBegin();
178 if (i.getEnd() > getEnd())
180 return i.getBegin() <= getEnd();
182 return true; // i internal to this
186 * Sorts the list by start position ascending (if forwardString==true), or by
187 * end position descending
190 * @param forwardStrand
192 static void sortIntervals(List<? extends IntervalI> intervals,
193 final boolean forwardStrand)
195 Collections.sort(intervals,
196 forwardStrand ? FORWARD_STRAND : REVERSE_STRAND);