/**
* Checks if the generated elements from the first mapped element has either the desired value, or
* has some value in common with the elements generated from second mapped element.
*
* @param match current pattern match
* @param ind mapped indices
* @return true if a value match is found
*/
@Override
public boolean satisfies(Match match, int... ind) {
assertIndLength(ind);
// Collect values of the element group
Set values = new HashSet();
for (BioPAXElement gen : con1.generate(match, ind)) {
values.addAll(pa1.getValueFromBean(gen));
}
// If emptiness is desired, check that
if (value == EMPTY) return values.isEmpty();
// If cannot be empty, check it
if (oper == Operation.NOT_EMPTY_AND_NOT_INTERSECT && values.isEmpty()) return false;
// If the second element is desired value, check that
else if (value == USE_SECOND_ARG) {
BioPAXElement q = match.get(ind[1]);
return oper == Operation.INTERSECT ? values.contains(q) : !values.contains(q);
}
// If element group is compared to preset value, but the value is actually a collection,
// then iterate the collection, see if any of them matches
else if (value instanceof Collection) {
Collection query = (Collection) value;
values.retainAll(query);
if (oper == Operation.INTERSECT) return !values.isEmpty();
else return values.isEmpty();
}
// If two set of elements should share a field value, check that
else if (pa2 != null) {
// Collect values of the second group
Set others = new HashSet();
for (BioPAXElement gen : con2.generate(match, ind)) {
others.addAll(pa2.getValueFromBean(gen));
}
switch (oper) {
case INTERSECT:
others.retainAll(values);
return !others.isEmpty();
case NOT_INTERSECT:
others.retainAll(values);
return others.isEmpty();
case NOT_EMPTY_AND_NOT_INTERSECT:
if (others.isEmpty()) return false;
others.retainAll(values);
return others.isEmpty();
default:
throw new RuntimeException("Unhandled operation: " + oper);
}
}
// Check if the element field values contain the parameter value
else if (oper == Operation.INTERSECT) return values.contains(value);
else return !values.contains(value);
}
/**
* Size of this constraint is one less than con1 if con2 is null, otherwise it is two less than
* the total of size of con1 and con2.
*
* @return the size based on con1 and con2
*/
@Override
public int getVariableSize() {
return con1.getVariableSize() + (con2 != null ? con2.getVariableSize() - 2 : -1);
}
