001/*
002 *                    BioJava development code
003 *
004 * This code may be freely distributed and modified under the
005 * terms of the GNU Lesser General Public Licence.  This should
006 * be distributed with the code.  If you do not have a copy,
007 * see:
008 *
009 *      http://www.gnu.org/copyleft/lesser.html
010 *
011 * Copyright for this code is held jointly by the individual
012 * authors.  These should be listed in @author doc comments.
013 *
014 * For more information on the BioJava project and its aims,
015 * or to join the biojava-l mailing list, visit the home page
016 * at:
017 *
018 *      http://www.biojava.org/
019 *
020 */
021package org.biojava.bio.symbol;
022
023import java.util.Collections;
024import java.util.Iterator;
025
026/**
027 * Base class for simple contiguous Location implementations.
028 *
029 * Just implement <code>getMin</code> and <code>getMax</code>, and <code>translate</code>..
030 *
031 * @author Matthew Pocock
032 * @author Keith James
033 */
034public abstract class AbstractRangeLocation extends AbstractLocation {
035  public Iterator blockIterator() {
036    return Collections.singleton(this).iterator();
037  }
038  
039  public boolean isContiguous() {
040    return true;
041  }
042  
043  public SymbolList symbols(SymbolList seq) {
044    return seq.subList(getMin(), getMax());
045  }
046  
047  public boolean contains(int p) {
048    return p >= getMin() && p <= getMax();
049  }
050}