How to use

intersection

method

in

openllet.core.datatypes.types.real.IntegerInterval

for (final IntegerInterval j : intIntersectWith)
  final IntegerInterval k = i.intersection(j);
  if (k != null)
    revisedInts.add(k);

for (final IntegerInterval j : intIntersectWith)
  final IntegerInterval k = i.intersection(j);
  if (k != null)
    revisedInts.add(k);

/**
 * Verify that intervals overlapping just on an inclusive bound intersect to a point.
 */
@Test
public void intersectionPoint()
{
  final IntegerInterval a = interval(null, 2);
  final IntegerInterval b = interval(2, null);
  final IntegerInterval expected = new IntegerInterval(Integer.valueOf(2));
  assertEquals(expected, a.intersection(b));
  assertEquals(expected, b.intersection(a));
  assertTrue(a.intersection(b).contains(Integer.valueOf(2)));
  assertTrue(b.intersection(a).contains(Integer.valueOf(2)));
}

/**
 * Verify that if no overlap exists between the bounds an empty intersection is identified
 */
@Test
public void intersectionEmpty()
{
  final IntegerInterval a = interval(null, 0);
  final IntegerInterval b = interval(1, null);
  assertNull(a.intersection(b));
  assertNull(b.intersection(a));
}

for (final IntegerInterval i : _intIntervals)
  final IntegerInterval j = i.intersection(integerRestriction);
  if (j != null)

for (final IntegerInterval i : _intIntervals)
  final IntegerInterval j = i.intersection(integerRestriction);
  if (j != null)