/** * Add all periods that intersect a given period to the result PeriodList. */ private void addRelevantPeriods(PeriodList results, PeriodList periods, Period range) { for (Iterator<Period> it = periods.iterator(); it.hasNext();) { Period p = it.next(); if (p.intersects(range)) results.add(p); } }
/** * Add all periods that intersect a given period to the result PeriodList. */ private void addRelevantPeriods(PeriodList results, PeriodList periods, Period range) { for (Iterator<Period> it = periods.iterator(); it.hasNext();) { Period p = it.next(); if (p.intersects(range)) results.add(p); } }
/** * */ public void testNotIntersects() { assertFalse(period.intersects(expectedPeriod)); }
/** * test range before * test range after * test range adjacent before * test range adjacent after * test overlap * test reverse overlap * test range contained within * test range contains this one * * @throws Exception */ public void testIntersects() { assertTrue(period.intersects(expectedPeriod)); }
.map(p -> p.getPeriods()).flatMap(PeriodList::stream).filter(rdatePeriod -> period.intersects(rdatePeriod)) .collect(Collectors.toList())); duration.getDuration()); if (period.intersects(startPeriod)) { recurrenceSet.add(startPeriod);
.map(p -> p.getPeriods()).flatMap(PeriodList::stream).filter(rdatePeriod -> period.intersects(rdatePeriod)) .collect(Collectors.toList())); duration.getDuration()); if (period.intersects(startPeriod)) { recurrenceSet.add(startPeriod);
else if (prevPeriod.intersects(period)) { period = prevPeriod.add(period); normalised = true;
while(periodIt.hasNext()) { Period fbPeriod = periodIt.next(); if(fbPeriod.intersects(period)) { return true;
while(periodIt.hasNext()) { Period fbPeriod = periodIt.next(); if(fbPeriod.intersects(period)) { return true;
else if (prevPeriod.intersects(period)) { period = prevPeriod.add(period); normalised = true;
else if (prevPeriod.intersects(period)) { period = prevPeriod.add(period); normalised = true;
else if (prevPeriod.intersects(period)) { period = prevPeriod.add(period); normalised = true;
else if (prevPeriod.intersects(period)) { period = prevPeriod.add(period); normalised = true;
if (! p.intersects(getLimit())) { Dur duration = new Dur(start, end); start = new DateTime(rid.getDate()); end = (DateTime) org.unitedinternet.cosmo.calendar.util.Dates.getInstance(duration.getTime(start), start); p = new Period(start, end); if (! p.intersects(getLimit())) { if (Range.THISANDFUTURE.equals(range)) { if (start.compareTo(getLimit().getEnd()) >= 0) {
if (! p.intersects(getLimit())) { Dur duration = new Dur(start, end); start = new DateTime(rid.getDate()); end = (DateTime) org.unitedinternet.cosmo.calendar.util.Dates.getInstance(duration.getTime(start), start); p = new Period(start, end); if (! p.intersects(getLimit())) { if (Range.THISANDFUTURE.equals(range)) { if (start.compareTo(getLimit().getEnd()) >= 0) {
return result; else if (!period.intersects(this)) { result.add(this); return result;
return result; else if (!period.intersects(this)) { result.add(this); return result;
return result; else if (!period.intersects(this)) { result.add(this); return result;
return result; else if (!period.intersects(this)) { result.add(this); return result;
return result; else if (!period.intersects(this)) { result.add(this); return result;