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

	protected int getSegmentIndexFor(int value) {
		if (this.values != null) {
			int first = 0;
			int last = getSegmentCount() - 1;

			while (first <= last) {
				final int center = (first + last) / 2;
				final int min = this.values[center * 2];
				final int max = this.values[center * 2 + 1];

				if (value >= min && value <= max) {
					return center * 2;
				}

				if (value < min) {
					last = center - 1;
				} else {
					first = center + 1;
				}
			}
		}

		return -1;
	}

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

}