/** * Builder initialized from an existing object. * * @param expected the existing object * @param df data factory */ public BuilderDataIntersectionOf(OWLDataIntersectionOf expected, OWLDataFactory df) { this(df); withItems(expected.operands()); }
/** * {@inheritDoc} */ @Override public void visit(final OWLDataIntersectionOf node) { writeNaryKeyword(Keyword.AND, node.operands()); }
@Override public void visit(OWLDataIntersectionOf node) { sb.append("DataIntersectionOf("); node.operands().forEach(r -> { r.accept(this); sb.append(' '); }); sb.append(')'); }
/** * Builder initialized from an existing object. * * @param expected the existing object * @param df data factory */ public BuilderDataIntersectionOf(OWLDataIntersectionOf expected, OWLDataFactory df) { this(df); withItems(expected.operands()); }
@Override public void visit(OWLDataIntersectionOf node) { sb.append("DataIntersectionOf("); node.operands().forEach(r -> { r.accept(this); sb.append(' '); }); sb.append(')'); }
/** * Builder initialized from an existing object. * * @param expected the existing object * @param df data factory */ public BuilderDataIntersectionOf(OWLDataIntersectionOf expected, OWLDataFactory df) { this(df); withItems(expected.operands()); }
@Override public OWLDataRange visit(OWLDataIntersectionOf range) { return m_factory.getOWLDataIntersectionOf(range.operands().map(ExpressionManager.this::getNNF)); } @Override
@Override public OWLDataRange visit(OWLDataIntersectionOf object) { OWLDataRange definition=getDefinitionFor(object,m_alreadyExists); if (!m_alreadyExists[0]) object.operands().forEach(d->m_newDataRangeInclusions.add(Arrays.asList(negative(definition),d))); return definition; } @Override
@Override public void visit(OWLDataIntersectionOf node) { for (Iterator<? extends OWLDataRange> it = node.operands().iterator(); it.hasNext(); ) { it.next().accept(this); if (it.hasNext()) { writeSpace(); write(AND); writeSpace(); } } }
@Override public void visit(OWLDataIntersectionOf node) { for (Iterator<? extends OWLDataRange> it = node.operands().iterator(); it.hasNext(); ) { it.next().accept(this); if (it.hasNext()) { writeSpace(); write(AND); writeSpace(); } } }
@Override public OWLDataRange visit(OWLDataIntersectionOf node) { List<OWLDataRange> ops = asList(node.operands().map(op -> op.accept(this))); return df.getOWLDataIntersectionOf(ops); }
@Override public OWLDataRange visit(OWLDataIntersectionOf node) { Stream<OWLDataRange> ops = node.operands().map(p -> p.accept(this)); if (negated) { return df.getOWLDataUnionOf(ops); } return df.getOWLDataIntersectionOf(ops); }
@Override public OWLDataRange visit(OWLDataIntersectionOf node) { List<OWLDataRange> ops = asList(node.operands().map(op -> op.accept(this))); return df.getOWLDataIntersectionOf(ops); }
@Override public void visit(OWLDataIntersectionOf node) { walkerCallback.pushDataRange(node); process(node); node.operands().forEach(a -> a.accept(this)); walkerCallback.popDataRange(); }
@Override public void visit(OWLDataIntersectionOf node) { write("("); write(node.operands(), AND, false); write(")"); }
@Override public void visit(OWLDataIntersectionOf node) { writer.writeStartElement(DATA_INTERSECTION_OF); render(node.operands()); writer.writeEndElement(); }
@Override public void visit(OWLDataIntersectionOf node) { writer.writeStartElement(DATA_INTERSECTION_OF); render(node.operands()); writer.writeEndElement(); }
@Override public void visit(OWLDataIntersectionOf node) { walkerCallback.pushDataRange(node); process(node); node.operands().forEach(a -> a.accept(this)); walkerCallback.popDataRange(); }