class IntegerList implements SortedSet<Integer>, List<Integer> {

	@Override
	@Pure
	public Object[] toArray() {
		final Object[] tab = new Object[this.size];
		if (this.values != null) {
			int idxTab = 0;
			for (int idxStart = 0; idxStart < this.values.length - 1; idxStart += 2) {
				for (int n = this.values[idxStart]; n <= this.values[idxStart + 1]; ++n) {
					tab[idxTab++] = n;
				}
			}
		}
		return tab;
	}

	public  IntegerList();
	public  IntegerList(int value);
	public  IntegerList(int start, int end);
	public  IntegerList(Collection<? extends Integer> collection);

}