Fix javadoc errors

Author: tpietzsch

src/main/java/net/imglib2/algorithm/bspline/BSplineLazyCoefficientsInterpolatorFactory.java

@@ -234,9 +234,6 @@ public RealRandomAccess< S > create( RandomAccessible< T > f, RealInterval inter
 
 	/**
 	 * Returns an image of coefficients that is lazily evaluated and cached.
-	 *
-	 * @param <R>
-	 *            the type
 	 */
 	public static class LazyCellImgFactory< T extends RealType< T >, S extends RealType< S > & NativeType< S > > extends ImgFactory< S >
 	{

src/main/java/net/imglib2/algorithm/interpolation/randomaccess/BSplineInterpolator.java

@@ -46,7 +46,7 @@
 /**
  * Performs cubic b-spline interpolation by pre-computing coefficients on the fly.
  * This will be less time efficient, in general, than pre-computing coefficients
- * using a {@link BSplineDecomposition}. This will be more memory-efficient
+ * using a {@code BSplineDecomposition}. This will be more memory-efficient
  * though.
  *
  * See Unser, Aldroubi, and Eden "Fast B-Spline Transforms for Continuous Image

src/main/java/net/imglib2/algorithm/lazy/Caches.java

@@ -116,7 +116,7 @@ public void load( final SingleCellArrayImg< T, ? > cell )
 	 * {@link NativeType} implementations in a memory cell image with volatile
 	 * cells. The result can be used with non-volatile types for processing but
 	 * it can also be wrapped into volatile types for visualization, see
-	 * {@link VolatileViews#wrapAsVolatile(RandomAccessible)}.
+	 * {@code VolatileViews.wrapAsVolatile(RandomAccessible)}.
 	 *
 	 * This is a very naive method to implement this kind of cache, but it
 	 * serves the purpose for this tutorial. The imglib2-cache library offers

src/main/java/net/imglib2/algorithm/math/execution/IterableRandomAccessibleFunction.java

@@ -80,7 +80,6 @@ public class IterableRandomAccessibleFunction< C extends RealType< C >, O extend
 	 * @param computeType
 	 * @param outputType
 	 * @param outConverter Can be null.
-	 * @param interval Necessary only when there aren't any intervals already as inputs to the operations, or to crop
 	 */
 	public IterableRandomAccessibleFunction(
 			final IFunction operation,

src/main/java/net/imglib2/algorithm/neighborhood/GeneralRectangleShape.java

@@ -54,10 +54,6 @@ public class GeneralRectangleShape extends RectangleShape
 
 	final int size;
 
-	/**
-	 * @param span
-	 * @param skipCenter
-	 */
 	public GeneralRectangleShape( final int size, final int offset, boolean skipCenter )
 	{
 		super( -1, skipCenter );

src/main/java/net/imglib2/algorithm/util/Singleton.java

@@ -49,7 +49,7 @@
  *
  * Example:
  *
- * <pre>
+ * <pre>{@code
  * final String url = "https://janelia-cosem.s3.amazonaws.com/jrc_hela-2/jrc_hela-2.n5";
  * final String dataset = "/em/fibsem-uint16/s4";
  *
@@ -60,7 +60,7 @@
  * final RandomAccessibleInterval< T > img = Singleton.get(
  * 		url + ":" + dataset,
  * 		() -> N5Utils.open( n5, dataset ) );
- * </pre>
+ * }</pre>
  *
  * @author Stephan Saalfeld
  *

src/main/java/net/imglib2/algorithm/util/unionfind/UnionFind.java

@@ -136,8 +136,6 @@ static < B extends BooleanType< B >, L extends IntegerType< L > > void relabel(
 	 *            labeled zero, foreground pixels are greater than zero: 1, 2,
 	 *            ..., N. Note that this is expected to be zero as background
 	 *            values will not be written.
-	 * @param unionFind
-	 *            {@link UnionFind}
 	 * @param idForPixel
 	 *            Create id from pixel location and value. Multiple calls with
 	 *            the same argument should always return the same result.
@@ -168,14 +166,6 @@ public default < B extends BooleanType< B >, L extends IntegerType< L > > void r
 	 *            labeled zero, foreground pixels are greater than zero: 1, 2,
 	 *            ..., N. Note that this is expected to be zero as background
 	 *            values will not be written.
-	 * @param unionFind
-	 *            {@link UnionFind}
-	 * @param idForPixel
-	 *            Create id from pixel location and value. Multiple calls with
-	 *            the same argument should always return the same result.
-	 * @param idForSet
-	 *            Create id for a set from the root id of a set. Multiple calls
-	 *            with the same argument should always return the same result.
 	 */
 	public default < L extends IntegerType< L > > void relabel(
 			final RandomAccessibleInterval< L > labeling )