/*
 * #%L
 * ImageJ software for multidimensional image processing and analysis.
 * %%
 * Copyright (C) 2009 - 2013 Board of Regents of the University of
 * Wisconsin-Madison, Broad Institute of MIT and Harvard, and Max Planck
 * Institute of Molecular Cell Biology and Genetics.
 * %%
 * 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.
 * 
 * The views and conclusions contained in the software and documentation are
 * those of the authors and should not be interpreted as representing official
 * policies, either expressed or implied, of any organization.
 * #L%
 */

package imagej.data.autoscale;

import imagej.data.minmax.MinMaxMethod;

import java.util.List;

import net.imglib2.IterableInterval;
import net.imglib2.type.numeric.RealType;

import org.scijava.plugin.Plugin;
import org.scijava.plugin.PluginService;

/**
 * Computes he data range from the entire set of values in an
 * {@link IterableInterval}.
 * 
 * @author Barry DeZonia
 */
@Plugin(type = AutoscaleMethod.class, name = "Default")
public class DefaultAutoscaleMethod<T extends RealType<T>> extends AbstractAutoscaleMethod<T> {

	private double min, max;

	@Override
	public DataRange getRange(final IterableInterval<T> interval)
	{
		@SuppressWarnings("rawtypes")
    List<MinMaxMethod> lists = getContext().getService(PluginService.class)
		    .createInstancesOfType(MinMaxMethod.class);
    @SuppressWarnings("unchecked")
		final MinMaxMethod<T> minmax = lists.get(0);
		Thread thread = new Thread() {

			@Override
			public void run() {
				minmax.initialize(interval);
				minmax.process();
				min = minmax.getMin().getRealDouble();
				max = minmax.getMax().getRealDouble();
				// NB - never return a display range of zero
				if (min == max) max += 0.000000000000001;
			}
		};
		try {
			thread.start();
			thread.join();
		}
		catch (Exception e) {
			//
		}
		return new DataRange(min, max);
	}

}

@@ -2357,35 +2357,8 @@
  %7B%0A%0A
-%09private double min, max;%0A%0A
 %09@Ov
@@ -2391,22 +2391,16 @@
 etRange(
-final 
 Iterable
@@ -2623,14 +2623,8 @@
 )%0A%09%09
-final 
 MinM
@@ -2662,80 +2662,8 @@
 0);%0A
-%09%09Thread thread = new Thread() %7B%0A%0A%09%09%09@Override%0A%09%09%09public void run() %7B%0A%09%09
 %09%09mi
@@ -2689,18 +2689,16 @@
 erval);%0A
-%09%09
 %09%09minmax
@@ -2711,18 +2711,23 @@
 ss();%0A%09%09
-%09%09
+double 
 min = mi
@@ -2759,18 +2759,23 @@
 le();%0A%09%09
-%09%09
+double 
 max = mi
@@ -2805,18 +2805,16 @@
 uble();%0A
-%09%09
 %09%09// NB 
@@ -2852,18 +2852,16 @@
 of zero%0A
-%09%09
 %09%09if (mi
@@ -2900,101 +2900,8 @@
 01;%0A
-%09%09%09%7D%0A%09%09%7D;%0A%09%09try %7B%0A%09%09%09thread.start();%0A%09%09%09thread.join();%0A%09%09%7D%0A%09%09catch (Exception e) %7B%0A%09%09%09//%0A%09%09%7D%0A
 %09%09re
@@ -2934,10 +2934,9 @@
 x);%0A
+
 %09%7D%0A
-%0A
 %7D%0A

Remove accidental debug code