[m-rev.] for review: build subtrees based on desired nodes, instead of desired depth

[Ian MacLarty]

> +
> +	% Find the root of a strictly increasing continuous real function
> +	% using a binary search.  Newton's method converges quicker, but
> +	% the evaluation of the derivative can cause infinite floating
> +	% point values.
> +	%
:- func binary_converge_to_root(func(float) = float, float, float, float, 
	float, int) = float.

I've changed this comment to
	% Find the root of a real function using a binary search.  The function
	% should be greater than zero after the root and less than zero before
	% the root.  Newton's method converges quicker, but for our application
	% the evaluation of the derivative can cause infinite floating point
	% values.
	%
since the function doesn't have to be strictly increasing, or even continuous.

Ian.
--------------------------------------------------------------------------
mercury-reviews mailing list
post:  mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------