/*! \file heron.diderot
 *
 * \author John Reppy
 *
 * This example illustrates using Heron's method for computing square roots.  It also
 * serves as a test for loading data sequences.
 */

/*
 * COPYRIGHT (c) 2012 The Diderot Project (http://diderot-language.cs.uchicago.edu)
 * All rights reserved.
 */

input int{} args = load("numbers.nrrd");
//int{} args = load("numbers.nrrd");
int nArgs = length(args);
input real eps = 0.00001;
input bool dummy;

strand SqRoot (real arg)
{
    output real root = arg;

    update {
	if (dummy) root = arg+1;
	root = (root + arg/root) / 2.0;
	if (|root^2 - arg| / arg < eps)
	    stabilize;
    }
}

initially { SqRoot(args{i}) | i in 0 .. nArgs-1 };