/*
 * #%L
 * ImageJ OPS: a framework for reusable algorithms.
 * %%
 * Copyright (C) 2014 Board of Regents of the University of
 * Wisconsin-Madison and University of Konstanz.
 * %%
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 * #L%
 */

package imagej.ops.chunker;

/**
 * A {@link Chunk}, which can be executed by the {@link Chunker}
 * A {@link Chunk} processes a subset of a bigger problem and can be executed
 * in parallel with other {@link Chunk}. The elements of the subproblem are identified
 * by enumerating the original problem.
 * 
 * @author Christian Dietz
 */
public interface Chunk {
	
	/**
	 * Solve the subproblem for the element at startIndex, increase the index by the given stepSize
	 * and repeat numSteps.
	 * 
	 * @param startIndex zero based index that identifies the first element of this
	 * subproblem (w.r.t. the global problem enumeration)
	 * @param stepSize the step-size between two consecutive elements
	 * @param numSteps how many steps shall be taken
	 */
	void execute(int startIndex, int stepSize, int numSteps);

}

@@ -1522,16 +1522,45 @@
 unker;%0A%0A
+import imagej.ops.Parallel;%0A%0A
 /**%0A * A
@@ -1573,17 +1573,24 @@
 k Chunk%7D
-,
+ of code
  which c
@@ -1607,19 +1607,17 @@
 uted by 
-the
+a
  %7B@link 
@@ -1624,16 +1624,24 @@
 Chunker%7D
+.%0A * %3Cp%3E
 %0A * A %7B@
@@ -1714,14 +1714,14 @@
 uted
-%0A *
  in
+%0A *
  par
@@ -1750,16 +1750,17 @@
 k Chunk%7D
+s
 . The el
@@ -1787,16 +1787,19 @@
 blem are
+%0A *
  identif
@@ -1801,19 +1801,16 @@
 entified
-%0A *
  by enum
@@ -1839,16 +1839,24 @@
 roblem.%0A
+ * %3C/p%3E%0A
  * %0A * @
@@ -1878,16 +1878,49 @@
 n Dietz%0A
+ * @see Chunker%0A * @see Parallel%0A
  */%0Apubl
@@ -2024,16 +2024,20 @@
 index by
+%0A%09 *
  the giv
@@ -2047,20 +2047,16 @@
 stepSize
-%0A%09 *
  and rep
@@ -2153,17 +2153,26 @@
 t of
+%0A%09 *         
  this
-%0A%09 *
  sub

improve javadoc