Clean javadoc
Project: http://git-wip-us.apache.org/repos/asf/jena/repo Commit: http://git-wip-us.apache.org/repos/asf/jena/commit/17472426 Tree: http://git-wip-us.apache.org/repos/asf/jena/tree/17472426 Diff: http://git-wip-us.apache.org/repos/asf/jena/diff/17472426 Branch: refs/heads/add-contract-tests Commit: 1747242679d76a3c43c2dbcc03764dd6dc823fd2 Parents: b2a1953 Author: Andy Seaborne <[email protected]> Authored: Sat May 2 18:21:29 2015 +0100 Committer: Andy Seaborne <[email protected]> Committed: Mon May 4 18:04:17 2015 +0100 ---------------------------------------------------------------------- jena-core/src/main/java/org/apache/jena/ontology/OntTools.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/jena/blob/17472426/jena-core/src/main/java/org/apache/jena/ontology/OntTools.java ---------------------------------------------------------------------- diff --git a/jena-core/src/main/java/org/apache/jena/ontology/OntTools.java b/jena-core/src/main/java/org/apache/jena/ontology/OntTools.java index bb3b2a3..1f80448 100755 --- a/jena-core/src/main/java/org/apache/jena/ontology/OntTools.java +++ b/jena-core/src/main/java/org/apache/jena/ontology/OntTools.java @@ -136,9 +136,9 @@ public class OntTools * such that every step on the path is accepted by the given filter. A path is a {@link List} * of RDF {@link Statement}s. The subject of the first statement in the list is <code>start</code>, * and the object of the last statement in the list is <code>end</code>.</p> - * <p>The <code>onPath</code> argument is a {@link Filter}, which accepts a statement and returns + * <p>The <code>onPath</code> argument is a {@link Predicate}, which accepts a statement and returns * true if the statement should be considered to be on the path. To search for an unconstrained - * path, pass {@link Filter#any} as an argument. To search for a path whose predicates match a + * path, pass <code>()->true</code> as an argument. To search for a path whose predicates match a * fixed restricted set of property names, pass an instance of {@link PredicatesFilter}.</p> * <p>If there is more than one path of minimal length from <code>start</code> to <code>end</code>, * this method returns an arbitrary one. The algorithm is blind breadth-first search,
