/** * Gets the operands as a list. * * @return The operands. */ default List<T> getOperandsAsList() { return asList(operands()); } }
protected void insufficientIndividuals(HasOperands<? extends OWLIndividual> axiom) { if (axiom.getOperandsAsList().size() < 2) { violations.add(new InsufficientIndividuals(getCurrentOntology(), getCurrentAxiom())); } }
/** * Gets the operands as a list. * * @return The operands. */ default List<T> getOperandsAsList() { return asList(operands()); } }
protected void insufficientOperands(HasOperands<?> node) { if (node.getOperandsAsList().size() < 2) { violations.add(new InsufficientOperands(getCurrentOntology(), getCurrentAxiom(), (OWLObject) node)); } }
/** * Gets the operands as a list. * * @return The operands. */ default List<T> getOperandsAsList() { return asList(operands()); } }
protected void insufficientIndividuals(HasOperands<? extends OWLIndividual> axiom) { if (axiom.getOperandsAsList().size() < 2) { violations.add(new InsufficientIndividuals(getCurrentOntology(), getCurrentAxiom())); } }
<C extends OWLObject> int getAndValue(HasOperands<C> expr) { // noUpperValue is a maximal element AtomicInteger min = new AtomicInteger(noUpperValue()); // we are looking for the minimal value here, use an appropriate helper expr.operands().forEach(p -> min.set(minUpperValue(min.get(), getUpperBoundDirect(p)))); return min.get(); }
protected void insufficientOperands(HasOperands<?> node) { if (node.getOperandsAsList().size() < 2) { violations.add(new InsufficientOperands(getCurrentOntology(), getCurrentAxiom(), (OWLObject) node)); } }
/** * Processing method for all Disjoint axioms. * * @param axiom axiom * @return true if axiom is local */ private <T extends OWLObject> boolean processDisjointAxiom(HasOperands<T> axiom) { // local iff at most 1 element is not bot-equiv boolean hasNBE = false; Iterator<T> it = axiom.operands().iterator(); while (it.hasNext()) { T p = it.next(); if (!isBotEquivalent(p)) { if (hasNBE) { // already seen one non-bot-eq element return false; } else { // record that 1 non-bot-eq element was found hasNBE = true; } } } return true; }
protected void emptyOneOf(HasOperands<?> node) { if (node.getOperandsAsList().size() < 1) { violations.add(new EmptyOneOfAxiom(getCurrentOntology(), getCurrentAxiom())); } }
<C extends OWLObject> int getOrValue(HasOperands<C> expr) { // noUpperValue is a maximal element AtomicInteger min = new AtomicInteger(noUpperValue()); // we are looking for the minimal value here, use an appropriate helper expr.operands().forEach(p -> min.set(minUpperValue(min.get(), getUpperBoundDirect(p)))); return min.get(); }
protected void insufficientProperties(HasOperands<?> node) { if (node.getOperandsAsList().size() < 2) { violations .add(new InsufficientPropertyExpressions(getCurrentOntology(), getCurrentAxiom())); } }
<C extends OWLObject> int getAndValue(HasOperands<C> expr) { // noUpperValue is a maximal element AtomicInteger min = new AtomicInteger(noUpperValue()); // we are looking for the minimal value here, use an appropriate helper expr.operands().forEach(p -> min.set(minUpperValue(min.get(), getUpperBoundDirect(p)))); return min.get(); }
protected void emptyProperties(HasOperands<?> node) { if (node.getOperandsAsList().isEmpty()) { violations .add(new InsufficientPropertyExpressions(getCurrentOntology(), getCurrentAxiom())); } }
/** * Processing method for all Disjoint axioms. * * @param axiom axiom * @return true if axiom is local */ private <T extends OWLObject> boolean processDisjointAxiom(HasOperands<T> axiom) { // local iff at most 1 element is not bot-equiv boolean hasNBE = false; Iterator<T> it = axiom.operands().iterator(); while (it.hasNext()) { T p = it.next(); if (!isBotEquivalent(p)) { if (hasNBE) { // already seen one non-bot-eq element return false; } else { // record that 1 non-bot-eq element was found hasNBE = true; } } } return true; }
protected void insufficientOperands(HasOperands<?> node) { if (node.getOperandsAsList().size() < 2) { violations.add(new InsufficientOperands(getCurrentOntology(), getCurrentAxiom(), (OWLObject) node)); } }
/** * Processing method for all Disjoint axioms. * * @param axiom axiom * @return true if axiom is local */ private <T extends OWLObject> boolean processDisjointAxiom(HasOperands<T> axiom) { // local iff at most 1 element is not bot-equiv boolean hasNBE = false; Iterator<T> it = axiom.operands().iterator(); while (it.hasNext()) { T p = it.next(); if (!isBotEquivalent(p)) { if (hasNBE) { // already seen one non-bot-eq element return false; } else { // record that 1 non-bot-eq element was found hasNBE = true; } } } return true; }
protected void emptyOneOf(HasOperands<?> node) { if (node.getOperandsAsList().size() < 1) { violations.add(new EmptyOneOfAxiom(getCurrentOntology(), getCurrentAxiom())); } }
<C extends OWLObject> int getAndValue(HasOperands<C> expr) { // noUpperValue is a maximal element AtomicInteger min = new AtomicInteger(noUpperValue()); // we are looking for the minimal value here, use an appropriate helper expr.operands().forEach(p -> min.set(minUpperValue(min.get(), getUpperBoundDirect(p)))); return min.get(); }
protected void insufficientProperties(HasOperands<?> node) { if (node.getOperandsAsList().size() < 2) { violations .add(new InsufficientPropertyExpressions(getCurrentOntology(), getCurrentAxiom())); } }