Skip to content
This repository has been archived by the owner. It is now read-only.
Permalink
Browse files
CLEREZZA-1063: Fix code documentation
  • Loading branch information
Hasan committed May 19, 2022
1 parent 777ea5a commit c19db4153a7858ef25ad86d4a3c313da3594fa13
Show file tree
Hide file tree
Showing 5 changed files with 10 additions and 12 deletions.
@@ -27,7 +27,6 @@
* add/remove-methods are called.
*
* @author reto
* @see org.apache.clerezza.rdf.core.impl.AbstractGraph
*/
public interface ImmutableGraph extends Graph {

@@ -42,8 +41,8 @@ public interface ImmutableGraph extends Graph {
/**
* Return the sum of the blank-nodes independent hashes of the triples.
* More precisely the hash of the triple is calculated as follows:
* (hash(subject) >> 1) ^ hash(hashCode) ^ (hash(hashCode) << 1)
* Where the hash-fucntion return the hashCode of the argument
* {@literal (hash(subject) >> 1) ^ hash(hashCode) ^ (hash(hashCode) << 1)}
* Where the hash-function return the hashCode of the argument
* for grounded arguments and 0 otherwise.
*
* @return hash code
@@ -29,7 +29,7 @@ public class Language {
/**
* Constructs the language tag defined by RDF 4646, normalized to lowercase.
*
* @param the id as defined by RDF 4646, normalized to lowercase.
* @param id as defined by RDF 4646, normalized to lowercase.
*/
public Language(String id) {
if ((id == null) || (id.equals(""))) {
@@ -20,9 +20,8 @@
/**
* Represents a literal value that can be a node in an RDF Graph.
* Literals are used to identify values such as numbers and dates by
* means of a lexical representation. There are two types of literals
* represented by the subinterfaces {@link PlainLiteral}
* and {@link TypedLiteral}
* means of a lexical representation. There are two types of literals:
* PlainLiteral and TypedLiteral.
*
* @author reto
*/
@@ -40,7 +40,7 @@ public interface Triple {

/**
* The hash code is computed as follow
* (subject.hashCode() >> 1) ^ predicate.hashCode() ^ object.hashCode() << 1)
* {@literal (subject.hashCode() >> 1) ^ predicate.hashCode() ^ object.hashCode() << 1)}
* <p>
* Note that the hash returned is computed including the hash of BNodes, so
* it is not blank-node blind as in Graph.
@@ -54,23 +54,23 @@ public interface WatchableGraph extends Graph {
* listener can be garbage collected if its no longer referenced by another
* object.
* <p>
* If delay is 0 notification will happen synchroneously.
* If delay is 0 notification will happen synchronously.
*
* @param listener The listener that will be notified
* @param filter The triple filter with which triples are tested,
* that were part of the modification.
* @param delay The time period afer which the listener will be notified in milliseconds.
* @param delay The time period after which the listener will be notified in milliseconds.
*/
public void addGraphListener(GraphListener listener, FilterTriple filter,
long delay);

/**
* Adds the specified <code>GraphListener</code> to the graph. This listener
* will be notified, when the graph is modified and the <code>Triple</code>
* that was part of the modifiaction matched the specified
* that was part of the modification matched the specified
* <code>FilterTriple</code>. The notification will be passed without delay.
* <p>
* Same as <code>addGraphListener(listener, filter, 0).
* Same as <code>addGraphListener(listener, filter, 0)</code>.
*
* @param listener The listener that will be notified
* @param filter The triple filter with which triples are tested,

0 comments on commit c19db41

Please sign in to comment.