@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node subj, final Node pred, final Node obj) { return 0 != kb.getIndividualsCount(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); // !kb.getIndividuals().isEmpty(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); // !kb.getIndividuals().isEmpty(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node subj, final Node pred, final Node obj) { return 0 != kb.getIndividualsCount(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node subj, final Node pred, final Node obj) { return 0 != kb.getIndividualsCount(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); // !kb.getIndividuals().isEmpty(); } });
@Override public boolean contains(final KnowledgeBase kb, final GraphLoader loader, final Node s, final Node p, final Node o) { return 0 != kb.getIndividualsCount(); } });
_logger.fine("Classes: " + classCount + " Individuals: " + _kb.getIndividualsCount());
_logger.fine("Classes: " + classCount + " Individuals: " + _kb.getIndividualsCount());
instancesPC.put(c, _kb.getIndividualsCount());
instancesPC.put(c, _kb.getIndividualsCount());
if (tI.equals(tC)) instanceCandidates = _kb.getIndividualsCount() < _kb.getClasses().size() ? _kb.getIndividuals() : _kb.getClasses(); for (final ATermAppl ic : instanceCandidates) if (direct ? _kb.getInstances(ic, direct).contains(ic) : _kb.isType(ic, ic))
if (tI.equals(tC)) instanceCandidates = _kb.getIndividualsCount() < _kb.getClasses().size() ? _kb.getIndividuals() : _kb.getClasses(); for (final ATermAppl ic : instanceCandidates) if (direct ? _kb.getInstances(ic, direct).contains(ic) : _kb.isType(ic, ic))
if (tI.equals(tC)) instanceCandidates = _kb.getIndividualsCount() < _kb.getClasses().size() ? _kb.getIndividuals() : _kb.getClasses(); for (final ATermAppl ic : instanceCandidates) if (direct ? _kb.getInstances(ic, direct).contains(ic) : _kb.isType(ic, ic))
assertEquals(1, kb.getIndividualsCount());