/** * 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))); }
/** * Private constructor forces use of {@link #getInstance()} */ private XSDDecimal() { super(ATermUtils.makeTermAppl(Namespaces.XSD + "decimal")); dataRange = new RestrictedRealDatatype(this, IntegerInterval.allIntegers(), ContinuousRealInterval.allReals(), null); }
@Test public void unboundContainsAll() { final IntegerInterval interval = new IntegerInterval(null, null); assertTrue(interval.contains(-1)); assertTrue(interval.contains(0)); assertTrue(interval.contains(1)); assertTrue(interval.contains(Long.MAX_VALUE)); assertTrue(interval.contains(BigInteger.valueOf(Long.MAX_VALUE).multiply(BigInteger.TEN))); } }
if (i.canUnionWith(j)) tmp.addAll(i.union(j)); revisedInts.addAll(tmp);
if (negated) intIntersectWith = Collections.singletonList(IntegerInterval.allIntegers()); for (final IntegerInterval i : otherRRD._intIntervals) tmp.addAll(j.remove(i)); intIntersectWith = tmp; for (final IntegerInterval j : intIntersectWith) final IntegerInterval k = i.intersection(j); if (k != null) revisedInts.add(k);
@Override protected IntegerInterval create(final Number lower, final Number upper) { return new IntegerInterval(lower, upper); }
for (final IntegerInterval i : _intIntervals) final IntegerInterval j = i.intersection(integerRestriction); if (j != null) if (!i.equals(j)) changes = true;
/** * Test getting a sub-interval greater than an integer on an integer line. */ @Test public void greater1() { final IntegerInterval i = interval(1, 5); assertEquals(interval(3, 5), i.greater(2)); }
/** * Test getting a sub-interval less than an integer. */ @Test public void less1() { final IntegerInterval i = interval(1, 5); assertEquals(interval(1, 3), i.less(4)); }
/** * 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)); }
if (negated) intIntersectWith = Collections.singletonList(IntegerInterval.allIntegers()); for (final IntegerInterval i : otherRRD._intIntervals) tmp.addAll(j.remove(i)); intIntersectWith = tmp; for (final IntegerInterval j : intIntersectWith) final IntegerInterval k = i.intersection(j); if (k != null) revisedInts.add(k);
@Override protected IntegerInterval create(final Number lower, final Number upper) { return new IntegerInterval(lower, upper); }
for (final IntegerInterval i : _intIntervals) final IntegerInterval j = i.intersection(integerRestriction); if (j != null) if (!i.equals(j)) changes = true;
if (i.canUnionWith(j)) tmp.addAll(i.union(j)); revisedInts.addAll(tmp);
if (i.contains(n)) return true;
/** * Test getting a sub-interval greater than the lower endpoint of an integer line. */ @Test public void greater2() { final IntegerInterval i = interval(1, 5); assertEquals(interval(2, 5), i.greater(1)); }