public abstract class AbstractRangeLocation extends AbstractLocation
getMin and getMax, and translate..empty, full, naturalOrder| Constructor and Description | 
|---|
| AbstractRangeLocation() | 
| Modifier and Type | Method and Description | 
|---|---|
| Iterator | blockIterator()Return an Iterator over the set of maximal contiguous sub-locations. | 
| boolean | contains(int p)Checks if this location contains a point. | 
| boolean | isContiguous()Determine if a Location is contiguous. | 
| SymbolList | symbols(SymbolList seq)Return the symbols in a sequence that fall within this range. | 
contains, equals, getDecorator, hashCode, intersection, newInstance, overlaps, unionpublic AbstractRangeLocation()
public Iterator blockIterator()
LocationGiven any location, it can be considered to contain zero or more maximal contiguous blocks of width 1 or greater. The empty location is composed from nothing. A contiguous location is composed from itself. A non-contiguous location is composed from contiguous blocks seperated by gaps.
This method should return an Iterator over these maximally contiguous blocks starting with the left-most block, and finishing at the right-most block.
public boolean isContiguous()
Locationtrue if and only if this Location
         contains every point from min to
         max inclusive.public SymbolList symbols(SymbolList seq)
Locationseq - the SymbolList to processCopyright © 2020 BioJava. All rights reserved.