fix(javadoc): replace unknown Javadoc tags with standard equivalents

src/main/java/fr/inria/corese/core/EdgeFactory.java

@@ -286,7 +286,7 @@ public Edge name(Edge edge, Node predicate, Node name) {
      * to be inserted in same Graph
      * edge nodes are already inserted
      *
-     * @pragma: pred == edge.getPredicate()
+     * Pragma: pred == edge.getPredicate()
      */
     public Edge copy(Node graphNode, Node pred, Edge edge) {
         Edge copy;

src/main/java/fr/inria/corese/core/Graph.java

@@ -2681,7 +2681,7 @@ public Iterable<Node> getAllNodeIterator2() {
      * Iterate nodes from basic graph node tables
      * not exactly graph vertex with rdf star
      *
-     * @note: consider nodes from nested triple
+     * Note: consider nodes from nested triple
      *        although they are just quoted
      */
     public Iterable<Node> getNodeIterator() {
@@ -3786,9 +3786,9 @@ public boolean isFormerMetadata() {
     }
 
     /**
-     * @Draft For each triple pattern: Search if there exists graph name,
+     * Draft: For each triple pattern: Search if there exists graph name,
      *        subject, property, object in the graph with similar URI
-     *        mode=message&param=sv:distance~n => levenshtein distance <= n
+     *        mode=message&amp;param=sv:distance~n =&gt; levenshtein distance &lt;= n
      */
     public JSONObject match(ASTQuery ast) {
         return match(ast, 1);

src/main/java/fr/inria/corese/core/compiler/eval/QuerySolverVisitor.java

@@ -16,13 +16,15 @@
  * Callback manager for LDScript functions with specific annotations Eval SPARQL
  * processor calls before() and after()
  *
+ * <pre>{@code
  * @before      function us:before(?q) {}
  * @after       function us:after(?m) {}
  * @produce     function us:produce(?q) {}
  * @candidate   function us:candidate(?q, ?e) {}
  * @result      function us:result(?m) {}
  * @solution    function us:solution(?m) {}
-
+ * }</pre>
+ *
  * @author Olivier Corby, Wimmics INRIA I3S, 2018
  *
  */

src/main/java/fr/inria/corese/core/compiler/eval/QuerySolverVisitorBasic.java

@@ -25,13 +25,16 @@
  * Callback manager for LDScript functions with specific annotations Eval SPARQL
  * processor calls before() and after()
  *
- * @author Olivier Corby, Wimmics INRIA I3S, 2018
+ * <pre>{@code
  * @before function us:before(?q) {}
  * @after function us:after(?m) {}
  * @produce function us:produce(?q) {}
  * @candidate function us:candidate(?q, ?e) {}
  * @result function us:result(?m) {}
  * @solution function us:solution(?m) {}
+ * }</pre>
+ *
+ * @author Olivier Corby, Wimmics INRIA I3S, 2018
  */
 public class QuerySolverVisitorBasic extends PointerObject implements ProcessVisitor {
 
@@ -216,7 +219,7 @@ public boolean define(String name, int arity) {
     }
 
     /**
-     * @before function us:before(?q) call function us:before set Visitor as
+     * {@code @before function us:before(?q)} call function us:before set Visitor as
      * inactive during function call to prevent loop and also in case where
      * function execute a query (which would trigger Visitor recursively)
      */
@@ -240,10 +243,10 @@ public IDatatype callback(Eval ev, String metadata, IDatatype[] param) {
     }
 
     /**
-     * @eq function us:eq(?e, ?x, ?y)
-     * @error function us:error(?e, ?x, ?y) Function call is performed even if
+     * {@code @eq function us:eq(?e, ?x, ?y)}
+     * {@code @error function us:error(?e, ?x, ?y)} Function call is performed even if
      * Visitor is inactive use case: @select function execute ?a = ?b on
-     * extension datatype we want @eq function us:eq(?e, ?x, ?y) to handle ?a =
+     * extension datatype we want {@code @eq function us:eq(?e, ?x, ?y)} to handle ?a =
      * ?b
      */
     public IDatatype callbackBasic(Eval ev, String metadata, IDatatype[] param) {

src/main/java/fr/inria/corese/core/compiler/federate/FederateVisitor.java

@@ -21,18 +21,21 @@
 /**
  * Prototype for federated query
  *
- * @author Olivier Corby, Wimmics INRIA I3S, 2018
+ * <pre>{@code
  * @federate <s1> <s2>
  * select * where { }
+ * }</pre>
  * Recursively rewrite every triple t as:
- * service <s1> <s2> { t } Generalized service statement with several URI
+ * service &lt;s1&gt; &lt;s2&gt; { t } Generalized service statement with several URI
  * Returns the union of Mappings
  * PRAGMA:
  * Property Path evaluated in each of the services but not on the union
  * (hence PP is not federated)
  * graph ?g { } by default is evaluated as federated onto servers
- * @skip kg:distributeNamed :
+ * <pre>{@code @skip kg:distributeNamed :}</pre>
  * named graph as a whole on each server
+ *
+ * @author Olivier Corby, Wimmics INRIA I3S, 2018
  */
 public class FederateVisitor implements QueryVisitor, URLParam {
 
@@ -414,10 +417,9 @@ public Provenance getProvenance(Mappings map) {
     /**
      * Metadata:
      * default is true:
-     *
-     * @skip kg:select kg:group kg:simplify kg:distributeNamed
+     * <pre>{@code @skip kg:select kg:group kg:simplify kg:distributeNamed}</pre>
      * default is false:
-     * @type kg:exist kg:verbose
+     * <pre>{@code @type kg:exist kg:verbose}</pre>
      */
     void option() {
         logger.info(ast.getMetadata().toString());

src/main/java/fr/inria/corese/core/compiler/federate/RewriteList.java

@@ -13,10 +13,12 @@
  * Rewrite rdf list into one service bgp
  * Rewrite bgp with bnode into one service bgp: ?s :p [ :q ?v ]
  *
+ * <pre>{@code
  * @focus "?var" -> merge triple with variable var in bgp with bnode and var
  * @focus "?s"
  * ?s p [q u] . ?s p v
  * -> add ?s p v in bgp because it share variable ?s
+ * }</pre>
  */
 public class RewriteList implements FederateMerge {
 

src/main/java/fr/inria/corese/core/compiler/parser/FunctionCompiler.java

@@ -19,8 +19,7 @@
 import java.util.Map;
 
 /**
- * @author Olivier Corby, INRIA I3S 2020
- * @import <url>
+ * <pre>{@code @import <url>}</pre>
  * dereference URL at compile time
  * LinkedFunction:
  * 1) ff:foo() undefined extension function:         dereference  URL at compile time
@@ -31,6 +30,8 @@
  * <p>
  * Accept/reject namespace for import and LinkedFunction:
  * AccessNamespace.define(namespace, true|false)
+ *
+ * @author Olivier Corby, INRIA I3S 2020
  */
 public class FunctionCompiler {
 

src/main/java/fr/inria/corese/core/compiler/parser/Transformer.java

@@ -418,11 +418,12 @@ void visitor(ASTQuery ast) {
 
     /**
      * use case:
-     *
+     * <pre>{@code
      * @federate <s1>
      * @federate <s2>
      * select * where { }
-     * Rewrite every triple t as: service <s1> <s2> { t }
+     * }</pre>
+     * Rewrite every triple t as: service &lt;s1&gt; &lt;s2&gt; { t }
      */
     void federate(ASTQuery ast) {
         if (ast.hasMetadata(Metadata.Type.FEDERATION) && !ast.hasMetadata(Metadata.Type.FEDERATE)) {

src/main/java/fr/inria/corese/core/edge/TripleNode.java

@@ -11,7 +11,7 @@
  * Can be used as Node in the graph
  * Can be subject/object of an Edge
  *
- * @todo: function getIndex() is the same here for Node and Edge ->
+ * TODO: function getIndex() is the same here for Node and Edge ->
  * rename to getEdgeIndex() or getNodeIndex()
  * It is not a pb because it is mostly used as Node
  */

src/main/java/fr/inria/corese/core/extension/Report.java

@@ -16,9 +16,11 @@
  * environment Variable value is a LDScript JSON object, with dt:json datatype
  * prefix js: <function://fr.inria.corese.core.extension.Report>
  *
+ * <pre>{@code
  * @report @header [@enum]
  * values (?akey ?aval) { unnest(js:report()) }
  * values (?akey ?aval) { unnest(js:header()) }
+ * }</pre>
  */
 public class Report extends Extension implements URLParam {
 

src/main/java/fr/inria/corese/core/index/EdgeManager.java

@@ -387,7 +387,7 @@ int find(Edge edge) {
     /**
      * use case: Construct find occurrence of edge for rdf star
      *
-     * @todo: Index is sorted and reduced ?
+     * TODO: Index is sorted and reduced ?
      */
     Edge findEdge(Edge edge) {
         int i = findEdgeEqualWithoutMetadata(edge);
@@ -687,7 +687,7 @@ void setComparator(Comparator<Edge> c) {
      * not considering triple ref id
      * g s p o = g s p o t
      *
-     * @note: sort is not deterministic for rdf star triple with same g s p o
+     * Note: sort is not deterministic for rdf star triple with same g s p o
      * list will be reduced by metadata()
      */
 

src/main/java/fr/inria/corese/core/kgram/core/QuerySorter.java

@@ -295,7 +295,7 @@ void compile(List<Exp> list) {
     /**
      * Move filter at place where variables are bound in exp 
      * @varList: list of bound variables 
-     * @todo: exists {} could be eval earlier
+     * TODO: exists {} could be eval earlier
      */
     void sortFilter(Exp exp, VString varList) {
         int size = varList.size();

src/main/java/fr/inria/corese/core/kgram/core/SorterNew.java

@@ -17,7 +17,7 @@
  * A new sorter for QP
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 5 juin 2014
+ * @since 5 juin 2014
  */
 public class SorterNew extends Sorter {
 

src/main/java/fr/inria/corese/core/kgram/path/PathFinder.java

@@ -67,9 +67,9 @@
  * Check Loop: pf.setCheckLoop(true) => exp+ exp{n,m} without loop
  * exec.setPathLoop(false) pragma {kg:path kg:loop false}
  *
- * @author Olivier Corby, Edelweiss, INRIA 2010
- * @thanx Corentin Follenfant for the idea of property weight into the regex
+ * Thanks to Corentin Follenfant for the idea of property weight into the regex.
  *
+ * @author Olivier Corby, Edelweiss, INRIA 2010
  ********************************************************
  */
 public class PathFinder {

src/main/java/fr/inria/corese/core/kgram/sorter/core/AbstractCostModel.java

@@ -7,7 +7,7 @@
  * Cost model used to estimate the cost for node or edge in a QPG
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 20 oct. 2014 added
+ * @since 20 oct. 2014 added
  */
 public abstract class AbstractCostModel {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/Const.java

@@ -6,7 +6,7 @@
  * Constants
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 27 oct. 2014
+ * @since 27 oct. 2014
  */
 public final class Const {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/IEstimate.java

@@ -6,7 +6,7 @@
  * Interface for estimating the cost of nodes and edges in QPGraph
  *
  * @author Fuqi Song, WImmics Inria I3S
- * @date 19 mai 2014
+ * @since 19 mai 2014
  */
 public interface IEstimate {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/IProducerQP.java

@@ -6,7 +6,7 @@
  * graph
  *
  * @author Fuqi Song, WImmics Inria I3S
- * @date 4 juin 2014
+ * @since 4 juin 2014
  */
 public interface IProducerQP {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/ISort.java

@@ -7,7 +7,7 @@
  * Interface for sorting and rewriting the QPG nodes
  * 
  * @author Fuqi Song, WImmics Inria I3S
- * @date 19 mai 2014
+ * @since 19 mai 2014
  */
 public interface ISort {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/QPGEdge.java

@@ -8,7 +8,7 @@
  * Basic Query triple Pattern Graph edge used to connect two QPG nodes
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 27 juin 2014
+ * @since 27 juin 2014
  */
 public class QPGEdge {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/QPGNode.java

@@ -18,7 +18,7 @@
  * an object exp) with cost
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 19 mai 2014
+ * @since 19 mai 2014
  */
 public class QPGNode {
 

src/main/java/fr/inria/corese/core/kgram/sorter/core/QPGraph.java

@@ -12,7 +12,7 @@
  * represent exp in a graph
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 19 mai 2014
+ * @since 19 mai 2014
  */
 public class QPGraph {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/BasicPatternGenerator.java

@@ -13,7 +13,7 @@
  * of Subject, Predicate and Object Ns, Np and No
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 8 août 2014
+ * @since 8 août 2014
  */
 public class BasicPatternGenerator {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/DepthFirstBestSearch.java

@@ -25,7 +25,7 @@
  * ++ 4.1 now also check BIND 20Jan2015
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 23 Oct. 2014
+ * @since 23 Oct. 2014
  */
 public class DepthFirstBestSearch implements ISort {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/DepthFirstSearch.java

@@ -13,7 +13,7 @@
  * algorithm
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 19 mai 2014
+ * @since 19 mai 2014
  */
 public class DepthFirstSearch implements ISort {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/HeuristicsBasedEstimation.java

@@ -12,7 +12,7 @@
  * Estimate the selectivity of triple pattern by heuristics
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 23 juin 2014
+ * @since 23 juin 2014
  */
 public class HeuristicsBasedEstimation implements IEstimate {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/QPGEdgeCostModel.java

@@ -11,7 +11,7 @@
  * Cost model for QPG edge 
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 20 oct. 2014
+ * @since 20 oct. 2014
  */
 public class QPGEdgeCostModel extends AbstractCostModel {
 

src/main/java/fr/inria/corese/core/kgram/sorter/impl/qpv1/QPGNodeCostModel.java

@@ -26,7 +26,7 @@
  * Class for constructing the pattern of a triple, including many parameters
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 25 juin 2014 new
+ * @since 25 juin 2014 new
  */
 public class QPGNodeCostModel extends AbstractCostModel {
 

src/main/java/fr/inria/corese/core/kgram/tool/ApproximateSearchEnv.java

@@ -14,7 +14,7 @@
  * Key: (?var, <uri>) Value: (node, similarity, algs)
  *
  * @author Fuqi Song, Wimmics Inria I3S
- * @date 29 oct. 2015
+ * @since 29 oct. 2015
  */
 public class ApproximateSearchEnv {
 

src/main/java/fr/inria/corese/core/load/AddTripleHelper.java

@@ -17,8 +17,8 @@
  * corese graph
  *
  * @author Fuqi Song, wimmics inria i3s
- * @date Jan 28 2014 new
- * @date Feb 12 2014 re-factored
+ * @since Jan 28 2014 new
+ * @since Feb 12 2014 re-factored
  */
 public class AddTripleHelper implements ILoadSerialization {
     private final static String JSONLD_BNODE_PREFIX = ":_";