* Test that the right elements are contained in the condition.
*/
@Test
- public void testContains() {
- assertFalse(CONDITION.contains(-5));
- assertTrue(CONDITION.contains(LOW));
- assertTrue(CONDITION.contains(5));
- assertTrue(CONDITION.contains(HIGH));
- assertFalse(CONDITION.contains(15));
+ public void testPredicate() {
+ assertFalse(CONDITION.test(-5));
+ assertTrue(CONDITION.test(LOW));
+ assertTrue(CONDITION.test(5));
+ assertTrue(CONDITION.test(HIGH));
+ assertFalse(CONDITION.test(15));
}
/**
* Test that the right elements are contained in the condition.
*/
@Test
- public void testContains() {
- assertFalse(CONDITION.contains(-5));
+ public void testPredicate() {
+ assertFalse(CONDITION.test(-5));
for (Integer v : VALUES) {
- assertTrue(CONDITION.contains(v));
- assertFalse(CONDITION.contains(v + 1));
+ assertTrue(CONDITION.test(v));
+ assertFalse(CONDITION.test(v + 1));
}
- assertFalse(CONDITION.contains(15));
+ assertFalse(CONDITION.test(15));
}
/**
* affect the condition
*/
@Test
- public void testContainsAndAdd() {
+ public void testPredicateAndAdd() {
List<Integer> values = new ArrayList<>();
values.add(1);
values.add(5);
DiscreteRangeCondition<Integer> condition = new DiscreteRangeCondition<>(values);
- assertFalse(condition.contains(-5));
+ assertFalse(condition.test(-5));
for (Integer v : values) {
- assertTrue(condition.contains(v));
- assertFalse(condition.contains(v + 1));
+ assertTrue(condition.test(v));
+ assertFalse(condition.test(v + 1));
}
- assertFalse(condition.contains(15));
+ assertFalse(condition.test(15));
// Add the values to the initial set and make sure it is not part of the
// condition
values.add(15);
- assertFalse(condition.contains(15));
+ assertFalse(condition.test(15));
}
/**
assertEquals(min, cnd.min());
assertEquals(max, cnd.max());
for (Long i = min; i <= max; i++) {
- assertTrue(cnd.contains(i));
+ assertTrue(cnd.test(i));
}
// Test with a step of 0, it should take 1 as a default value
assertEquals(min, cnd.min());
assertEquals(max, cnd.max());
for (Long i = min; i <= max; i++) {
- assertTrue(cnd.contains(i));
+ assertTrue(cnd.test(i));
}
// Test with a step of 2. Make sure that values have the right steps and
assertEquals(max, cnd.max());
for (Long i = min; i < max; i++) {
if ((i - min) % step == 0) {
- assertTrue(cnd.contains(i));
+ assertTrue(cnd.test(i));
} else {
- assertFalse(cnd.contains(i));
+ assertFalse(cnd.test(i));
}
}
- assertTrue(cnd.contains(max));
+ assertTrue(cnd.test(max));
}
/**
}
@Override
- public boolean contains(E element) {
+ public boolean test(E element) {
return fMin.compareTo(element) <= 0 && element.compareTo(fMax) <= 0;
}
public String toString() {
return "Continuous condition: " + fMin.toString() + '-' + fMax.toString(); //$NON-NLS-1$
}
+
}
\ No newline at end of file
}
@Override
- public boolean contains(E element) {
+ public boolean test(E element) {
return fSet.contains(element);
}
import java.util.Collections;
import java.util.Set;
import java.util.TreeSet;
+import java.util.function.Predicate;
import org.eclipse.jdt.annotation.NonNull;
import org.eclipse.jdt.annotation.Nullable;
* Long
* @noimplement Accessor interface
*/
-public interface RangeCondition<@NonNull E extends Comparable<E>> {
+public interface RangeCondition<@NonNull E extends Comparable<E>> extends Predicate<E> {
/**
* Get the lower bound of this range
@NonNull E max();
/**
- * Verify whether a value is within this specific range boundaries. If the
+ * Test whether a value is within this specific range boundaries. If the
* range is continuous, it will return <code>true</code> if the value is
* between the lower and upper bounds. If the range is discrete, it will
* return <code>true</code> if the requested element is one of the elements
* value that we want to test
* @return true if element is contained in this condition's set or range
*/
- boolean contains(@NonNull E element);
+ @Override
+ boolean test(@NonNull E element);
/**
* Determine if the current range intersects a ranged bounded by the values