Libraries.Compute.Statistics.Analysis.RootFinder

This is inspired by Brent's algorithm in apache commons. This class implements the Brent algorithm for finding zeros of real univariate functions. The function should be continuous but not necessarily smooth. The {@code solve} method returns a zero x of the function code f in the given interval [a, b] to within a tolerance 2 eps abs(x) + t} where eps is the relative accuracy and t is the absolute accuracy.

The given interval must bracket the root.

This action compares two object hash codes and returns an integer. The result is larger if this hash code is larger than the object passed as a parameter, smaller, or equal. In this case, -1 means smaller, 0 means equal, and 1 means larger. This action was changed in Quorum 7 to return an integer, instead of a CompareResult object, because the previous implementation was causing efficiency issues.

Example Code

Object o
        Object t
        integer result = o:Compare(t) //1 (larger), 0 (equal), or -1 (smaller)

This action determines if two objects are equal based on their hash code values.

Example Code

use Libraries.Language.Object
        use Libraries.Language.Types.Text
        Object o
        Text t
        boolean result = o:Equals(t)

Finds the root, if possible, at the given bracket [minimum, maximum].

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode()