001/** 
002 * Copyright (c) 2007-2008, Regents of the University of Colorado 
003 * All rights reserved.
004 * 
005 * Redistribution and use in source and binary forms, with or without
006 * modification, are permitted provided that the following conditions are met:
007 * 
008 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 
009 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 
010 * Neither the name of the University of Colorado at Boulder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. 
011 * 
012 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
013 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
014 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
015 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
016 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
017 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
018 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
019 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
020 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
021 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
022 * POSSIBILITY OF SUCH DAMAGE. 
023 */
024package org.cleartk.corpus.penntreebank;
025
026import java.util.Iterator;
027import java.util.SortedSet;
028import java.util.TreeSet;
029
030import com.google.common.annotations.Beta;
031
032/**
033 * <br>
034 * Copyright (c) 2007-2008, Regents of the University of Colorado <br>
035 * All rights reserved.
036 * 
037 * 
038 * @author Philipp Wetzler
039 * 
040 */
041
042@Beta
043public class RangeSpecification implements Iterable<Integer> {
044
045  private int start;
046
047  private int end;
048
049  private SortedSet<Integer> numbers = new TreeSet<Integer>();
050
051  public RangeSpecification(String spec) {
052    String[] parts = spec.trim().split("-");
053
054    if (parts.length == 2) {
055      this.start = Integer.valueOf(parts[0]);
056      this.end = Integer.valueOf(parts[1]);
057    } else if (parts.length == 1) {
058      this.start = this.end = Integer.valueOf(parts[0]);
059    } else {
060      throw new IllegalArgumentException();
061    }
062
063    for (int i = start; i <= end; i++)
064      numbers.add(i);
065  }
066
067  public boolean contains(int i) {
068    return numbers.contains(i);
069  }
070
071  @Override
072  public String toString() {
073    if (this.start == this.end)
074      return String.valueOf(this.start);
075    else
076      return String.valueOf(this.start) + "-" + String.valueOf(this.end);
077  }
078
079  public Iterator<Integer> iterator() {
080    return numbers.iterator();
081  }
082}