private static boolean isSyntaxTriple(final Triple t) { BuiltinTerm builtin = BuiltinTerm.find(t.getPredicate()); if (builtin != null) { if (builtin.isSyntax()) return true; if (BuiltinTerm.isExpression(builtin) && (t.getSubject().isBlank() || t.getObject().isBlank())) return true; if (builtin.equals(BuiltinTerm.RDF_type)) { builtin = BuiltinTerm.find(t.getObject()); return builtin != null && builtin.isSyntax(); } } return false; }
public static boolean isBuiltin(final Node node) { return find(node) != null; }
protected Triple getExpression(final Node node) { for (final BuiltinTerm expressionPredicate : BuiltinTerm.EXPRESSION_PREDICATES) { final ClosableIterator<Triple> i = _graph.find(node, expressionPredicate.getNode(), null); if (i.hasNext()) { _monitor.incrementProgress(); final Triple t = i.next(); i.close(); return t; } } return null; }
private void cache(final Node node) if (_terms.containsKey(node) || BuiltinTerm.isBuiltin(node)) return;
public static boolean isBuiltin(final Node node) { return find(node) != null; }
protected Triple getExpression(final Node node) { for (final BuiltinTerm expressionPredicate : BuiltinTerm.EXPRESSION_PREDICATES) { final ClosableIterator<Triple> i = _graph.find(node, expressionPredicate.getNode(), null); if (i.hasNext()) { _monitor.incrementProgress(); final Triple t = i.next(); i.close(); return t; } } return null; }
private void cache(final Node node) if (_terms.containsKey(node) || BuiltinTerm.isBuiltin(node)) return;
private static boolean isSyntaxTriple(final Triple t) { BuiltinTerm builtin = BuiltinTerm.find(t.getPredicate()); if (builtin != null) { if (builtin.isSyntax()) return true; if (BuiltinTerm.isExpression(builtin) && (t.getSubject().isBlank() || t.getObject().isBlank())) return true; if (builtin.equals(BuiltinTerm.RDF_type)) { builtin = BuiltinTerm.find(t.getObject()); return builtin != null && builtin.isSyntax(); } } return false; }
public static boolean isBuiltin(final Node node) { return find(node) != null; }
protected Triple getExpression(final Node node) { for (final BuiltinTerm expressionPredicate : BuiltinTerm.EXPRESSION_PREDICATES) { final ClosableIterator<Triple> i = _graph.find(node, expressionPredicate.getNode(), null); if (i.hasNext()) { _monitor.incrementProgress(); final Triple t = i.next(); i.close(); return t; } } return null; }
private void cache(final Node node) if (_terms.containsKey(node) || BuiltinTerm.isBuiltin(node)) return;