Deopify StructuringElements

These Ops are not used, and there is ambiguity about how they might be
used so let's punt on the decision to opify

Author: gselzer

src/main/java/net/imglib2/algorithm/morphology/StructuringElements.java

@@ -88,7 +88,6 @@ public class StructuringElements
 	 * This methods relies on heuristics to determine automatically what
 	 * decomposition level to use.
 	 *
-	 * @implNote op name='create.disk', type=Function
 	 * @param radius
 	 *            the radius of the disk, so that it extends over
 	 *            {@code 2 × radius + 1} in all dimensions
@@ -146,7 +145,6 @@ else if ( radius < 17 )
 	 * select the level of approximation. For other dimensionalities, no
 	 * optimization are available yet and the parameter is ignored.
 	 *
-	 * @implNote op name='create.disk', type=Function
 	 * @param radius
 	 *            the radius of the disk, so that it extends over
 	 *            {@code 2 × radius + 1} in all dimensions
@@ -293,7 +291,6 @@ else if ( decomposition == 8 || decomposition == 4 || decomposition == 6 )
 	 * dimensionality and target dimensionality do not match. Non-decomposed
 	 * version are dimension-generic.
 	 *
-	 * @implNote op name='create.square', type=Function
 	 * @param radius
 	 *            the radius of the square.
 	 * @param dimensionality
@@ -343,7 +340,6 @@ public static final List< Shape > square( final int radius, final int dimensiona
 	 * This method determines whether it is worth returning a decomposed strel
 	 * based on simple heuristics.
 	 *
-	 * @implNote op name='create.square', type=Function
 	 * @param radius
 	 *            the radius of the square.
 	 * @param dimensionality
@@ -374,7 +370,6 @@ public static final List< Shape > square( final int radius, final int dimensiona
 	 * of orthogonal lines and yield the exact same results on any of the
 	 * morphological operations.
 	 *
-	 * @implNote op name='create.rectangle', type=Function
 	 * @param halfSpans
 	 *            an {@code int[]} array containing the half-span of the
 	 *            symmetric rectangle in each dimension. The total extent of the
@@ -428,7 +423,6 @@ public static final List< Shape > rectangle( final int[] halfSpans, final boolea
 	 * morphological operations. This method uses a simple heuristic to decide
 	 * whether to decompose the rectangle or not.
 	 *
-	 * @implNote op name='create.rectangle', type=Function
 	 * @param halfSpans
 	 *            an {@code int[]} array containing the half-span of the
 	 *            symmetric rectangle in each dimension. The total extent of the
@@ -484,7 +478,6 @@ public static final List< Shape > rectangle( final int halfSpans[] )
 	 * fall back on a linear decomposition, still very effective (see [1] as
 	 * well).
 	 *
-	 * @implNote op name='create.diamond', type=Function
 	 * @param radius
 	 *            the desired radius of the diamond structuring element. The
 	 *            strel will extend over {@code 2 × radius + 1} in all
@@ -534,7 +527,6 @@ public static final List< Shape > diamond( final int radius, final int dimension
 	 * fall back on a linear decomposition, still very effective (see [1] as
 	 * well).
 	 *
-	 * @implNote op name='create.diamond', type=Function
 	 * @param radius
 	 *            the desired radius of the diamond structuring element. The
 	 *            strel will extend over {@code 2 × radius + 1} in all
@@ -630,7 +622,6 @@ public static final List< Shape > diamond( final int radius, final int dimension
 	 *
 	 * The importance of periodic lines is explained in [1].
 	 *
-	 * @implNote op name='create.periodicLine', type=Function
 	 * @param span
 	 *            the span of the neighborhood, so that it will iterate over
 	 *            {@code 2 × span + 1} pixels.