public ComparisonImpl comparison(DynamicOperandImpl operand1, Operator operator, StaticOperandImpl operand2) { return new ComparisonImpl(operand1, operator, operand2); }
public ComparisonImpl comparison(DynamicOperandImpl operand1, Operator operator, StaticOperandImpl operand2) { return new ComparisonImpl(operand1, operator, operand2); }
public ComparisonImpl comparison(DynamicOperandImpl operand1, Operator operator, StaticOperandImpl operand2) { return new ComparisonImpl(operand1, operator, operand2); }
@Override public AstElement copyOf() { return new ComparisonImpl(operand1.createCopy(), operator, operand2); } }
@Override public AstElement copyOf() { return new ComparisonImpl(operand1.createCopy(), operator, operand2); } }
@Override public AstElement copyOf() { return new ComparisonImpl(operand1.createCopy(), operator, operand2); } }
@Override public ConstraintImpl simplify() { if (operand2.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, operand2.iterator().next()); } Set<StaticOperandImpl> set = newHashSet(operand2); if (set.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, set.iterator().next()); } else if (set.size() != operand2.size()) { return new InImpl(operand1, newArrayList(set)); } else { return this; } }
@Override public ConstraintImpl simplify() { if (operand2.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, operand2.iterator().next()); } Set<StaticOperandImpl> set = newHashSet(operand2); if (set.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, set.iterator().next()); } else if (set.size() != operand2.size()) { return new InImpl(operand1, newArrayList(set)); } else { return this; } }
@Override public ConstraintImpl simplify() { if (operand2.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, operand2.iterator().next()); } Set<StaticOperandImpl> set = newHashSet(operand2); if (set.size() == 1) { return new ComparisonImpl( operand1, Operator.EQUAL, set.iterator().next()); } else if (set.size() != operand2.size()) { return new InImpl(operand1, newArrayList(set)); } else { return this; } }
LinkedHashSet<StaticOperandImpl> values = entry.getValue(); if (values.size() == 1) { simplified.add(new ComparisonImpl( entry.getKey(), EQUAL, values.iterator().next())); } else {
LinkedHashSet<StaticOperandImpl> values = entry.getValue(); if (values.size() == 1) { simplified.add(new ComparisonImpl( entry.getKey(), EQUAL, values.iterator().next())); } else {
LinkedHashSet<StaticOperandImpl> values = entry.getValue(); if (values.size() == 1) { simplified.add(new ComparisonImpl( entry.getKey(), EQUAL, values.iterator().next())); } else {
ConstraintImpl c, c1, c2, c3, c4, c5; c1 = new ComparisonImpl(null, null, null); c2 = new FullTextSearchImpl(null, null, null); union = new UnionQueryImpl(false, union.containsUnfilteredFullTextCondition()); c1 = new ComparisonImpl(null, null, null); c2 = new FullTextSearchImpl(null, null, null); c = new OrImpl(c1, c2); c1 = new ComparisonImpl(null, null, null); c2 = new FullTextSearchImpl(null, null, null); c3 = new FullTextSearchImpl(null, null, null); c4 = new ComparisonImpl(null, null, null); c1 = new OrImpl(of(c2, c3, c4)); c5 = mock(DescendantNodeImpl.class); c1 = new ComparisonImpl(null, null, null); c2 = new FullTextSearchImpl(null, null, null); c3 = new FullTextSearchImpl(null, null, null); c1 = new ComparisonImpl(null, null, null); c2 = new ComparisonImpl(null, null, null); c = new AndImpl(of(c1, c2, c3)); query = createQuery(c);