This is an automated email from the ASF dual-hosted git repository. andy pushed a commit to branch main in repository https://gitbox.apache.org/repos/asf/jena.git
commit 35983ce8e780c87274b446a0dddb4ddb03c8ebeb Author: Andy Seaborne <[email protected]> AuthorDate: Thu Nov 2 11:37:49 2023 +0000 Fix javadoc warnings --- .../apache/jena/tdb1/store/DatasetPrefixesTDB.java | 2 +- .../jena/tdb1/store/nodetable/NodeTable.java | 28 +++++++++++----------- 2 files changed, 15 insertions(+), 15 deletions(-) diff --git a/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/DatasetPrefixesTDB.java b/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/DatasetPrefixesTDB.java index 60d799cfb5..61d26e9f5f 100644 --- a/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/DatasetPrefixesTDB.java +++ b/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/DatasetPrefixesTDB.java @@ -31,7 +31,7 @@ import org.apache.jena.tdb1.store.nodetupletable.NodeTupleTable; /** * Dataset prefixes; a table of nodes with prefix-centric operations. The table is G-P-U - * where G is a graph name as a URI (a URI for <> is used for the default graph), P is a + * where G is a graph name as a URI (a URI for {@literal <>} is used for the default graph), P is a * string (the prefix) and U is the IRI. */ public class DatasetPrefixesTDB implements DatasetPrefixStorage diff --git a/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/nodetable/NodeTable.java b/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/nodetable/NodeTable.java index 7642da8bd5..3034b053d7 100644 --- a/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/nodetable/NodeTable.java +++ b/jena-tdb1/src/main/java/org/apache/jena/tdb1/store/nodetable/NodeTable.java @@ -26,22 +26,22 @@ import org.apache.jena.atlas.lib.Sync ; import org.apache.jena.graph.Node ; import org.apache.jena.tdb1.store.NodeId; -/** Node table - conceptually a two way mapping of Node<->NodeId - * where Nodes can be stored and a NodeId allocated +/** Node table - conceptually a two way mapping of Node {@literal <->} NodeId + * where Nodes can be stored and NodeIds allocated. * @see NodeId - */ + */ public interface NodeTable extends Sync, Closeable { /** Store the node in the node table (if not already present) and return the allocated Id. */ public NodeId getAllocateNodeId(Node node) ; - + /** Look up node and return the NodeId - return NodeId.NodeDoesNotExist if not found */ public NodeId getNodeIdForNode(Node node) ; - + /** Look up node id and return the Node - return null if not found */ public Node getNodeForNodeId(NodeId id) ; - + /** Test whether the node table contains an entry for node */ public boolean containsNode(Node node) ; @@ -50,15 +50,15 @@ public interface NodeTable extends Sync, Closeable /** Iterate over all nodes (not necessarily fast). Does not include inlined NodeIds */ public Iterator<Pair<NodeId, Node>> all() ; - - /** The offset needed to predicate allocation difference between persistent tables - internal function */ + + /** The offset needed to predicate allocation difference between persistent tables - internal function */ public NodeId allocOffset() ; - - /** Anything there? */ - public boolean isEmpty() ; - /** Return a NodeTable if this instance wraps another, else return null */ - public NodeTable wrapped() ; + /** Anything there? */ + public boolean isEmpty() ; + + /** Return a NodeTable if this instance wraps another, else return null */ + public NodeTable wrapped() ; + - }
