Fix javadoc warnings.

wrandelshofer · Oct 13, 2024 · bd49455 · bd49455
1 parent ad5bf67
commit bd49455
Show file tree

Hide file tree

Showing 4 changed files with 0 additions and 22 deletions.
diff --git a/...raw/src/main/java/org.jhotdraw8.draw/org/jhotdraw8/draw/figure/MarkerStrokableFigure.java b/...raw/src/main/java/org.jhotdraw8.draw/org/jhotdraw8/draw/figure/MarkerStrokableFigure.java
@@ -36,7 +36,6 @@ public interface MarkerStrokableFigure extends Figure {
      * value: {@code 0}.
      * <p>
      * References:
-     * <p>
      * <dl>
      * <dt>SVG Stroke Properties</dt>
      * <dd><a href="http://www.w3.org/TR/SVG/painting.html#StrokeProperties">w3.org</a></dd>
@@ -47,7 +46,6 @@ public interface MarkerStrokableFigure extends Figure {
      * Defines the end cap style. Default value: {@code SQUARE}.
      * <p>
      * References:
-     * <p>
      * <dl>
      * <dt>SVG Stroke Properties</dt>
      * <dd><a href="http://www.w3.org/TR/SVG/painting.html#StrokeProperties">w3.org</a></dd>

diff --git a/...eom/src/main/java/org.jhotdraw8.geom/org/jhotdraw8/geom/intersect/IntersectLinePoint.java b/...eom/src/main/java/org.jhotdraw8.geom/org/jhotdraw8/geom/intersect/IntersectLinePoint.java
@@ -55,7 +55,6 @@ private IntersectLinePoint() {
      * <li>{@literal 2·a·t1 + b = 0, 0 ≤ t1 ≤ 1 }<br>
      * : derivative</li>
      * </ol>
-     * <p>
      *
      * @param x0 point 0 of the line
      * @param y0 point 0 of the line

diff --git a/...h/src/main/java/org.jhotdraw8.graph/org/jhotdraw8/graph/algo/MinimumSpanningTreeAlgo.java b/...h/src/main/java/org.jhotdraw8.graph/org/jhotdraw8/graph/algo/MinimumSpanningTreeAlgo.java
@@ -97,7 +97,6 @@ public <V, A, C extends Number & Comparable<C>, P extends OrderedPair<V, V>> Lis
     /**
      * Given an undirected graph and a cost function, returns a builder
      * with the minimum spanning tree.
-     * <p>
      *
      * @param graph the graph. This must be an undirected graph
      *              represented as a directed graph with two identical arrows for each edge.
@@ -112,7 +111,6 @@ public <V, A, C extends Number & Comparable<C>> SimpleMutableDirectedGraph<V, A>
     /**
      * Given an undirected graph and a cost function, returns a builder
      * with the minimum spanning tree.
-     * <p>
      *
      * @param graph the graph. This must be an undirected graph
      *              represented as a directed graph with two identical arrows for each edge.
@@ -150,7 +148,6 @@ public <V, A, C extends Number & Comparable<C>> SimpleMutableDirectedGraph<V, A>
      * Given a set of vertices and a list of arrows ordered by cost, returns a
      * builder with the minimum spanning tree. This is an undirected graph with
      * an arrow in each direction.
-     * <p>
      *
      * @param <P>            the pair data type
      * @param vertices       the list of vertices

diff --git a/...ava/org.jhotdraw8.graph/org/jhotdraw8/graph/path/algo/AnyIndexedVertexPathSearchAlgo.java b/...ava/org.jhotdraw8.graph/org/jhotdraw8/graph/path/algo/AnyIndexedVertexPathSearchAlgo.java
@@ -41,21 +41,6 @@ public void accept(int value) {
         }
     }
 
-    /**
-     * {@inheritDoc}
-     *
-     * @param startVertices        the set of start vertices
-     * @param goalPredicate        the goal predicate
-     * @param nextVerticesFunction the next vertices function
-     * @param maxDepth             the maximal depth (inclusive) of the search
-     *                             Must be {@literal >= 0}.
-     * @param zero                 the zero cost value
-     * @param costLimit            the cost limit is <b>ignored</b>
-     * @param costFunction         the cost function
-     * @param sumFunction          the sum function for adding two cost values
-     * @param visited
-     * @return
-     */
     @Override
     public @Nullable IndexedVertexBackLinkWithCost<C> search(
             Iterable<Integer> startVertices,
@@ -80,7 +65,6 @@ public void accept(int value) {
      * @param nextVerticesFunction the next vertices function
      * @param visited              the set of visited vertices (see {@link AddToIntSet})
      * @param maxDepth             the maximal depth (inclusive) of the search.
-     * @return
      * @return on success: a back link, otherwise: null
      */
     public @Nullable IndexedVertexBackLink search(Iterable<Integer> startVertices,