for (Iterator<TimestampInterval> i = intervalIterator(); i.hasNext();) { if (i.next().contains(timestamp)) return true; } return false;
return findInterval(timestamp) >= 0;
	public boolean contains(long timestamp) {		// FIXME: could use binary search, since the intervals are sorted		for (Iterator<TimestampInterval> i = intervalIterator(); i.hasNext();) {			if (i.next().contains(timestamp))				return true;		}		return false;	}