Linear.Quaternion:$clog from linear-1.19.1.3

Percentage Accurate: 69.0% → 99.9%

Time: 2.5s

Alternatives: 5

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \sqrt{x \cdot x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ (* x x) y)))

C

double code(double x, double y) {
	return sqrt(((x * x) + y));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(((x * x) + y))
end function

Java

public static double code(double x, double y) {
	return Math.sqrt(((x * x) + y));
}

Python

def code(x, y):
	return math.sqrt(((x * x) + y))

Julia

function code(x, y)
	return sqrt(Float64(Float64(x * x) + y))
end

MATLAB

function tmp = code(x, y)
	tmp = sqrt(((x * x) + y));
end

Wolfram

code[x_, y_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]

Initial Program: 69.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{x \cdot x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ (* x x) y)))

C

double code(double x, double y) {
	return sqrt(((x * x) + y));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(((x * x) + y))
end function

Java

public static double code(double x, double y) {
	return Math.sqrt(((x * x) + y));
}

Python

def code(x, y):
	return math.sqrt(((x * x) + y))

Julia

function code(x, y)
	return sqrt(Float64(Float64(x * x) + y))
end

MATLAB

function tmp = code(x, y)
	tmp = sqrt(((x * x) + y));
end

Wolfram

code[x_, y_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 2 \cdot 10^{+139}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x\_m, x\_m, y\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{0.5}{x\_m}, y, x\_m\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= x_m 2e+139) (sqrt (fma x_m x_m y)) (fma (/ 0.5 x_m) y x_m)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if (x_m <= 2e+139) {
		tmp = sqrt(fma(x_m, x_m, y));
	} else {
		tmp = fma((0.5 / x_m), y, x_m);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (x_m <= 2e+139)
		tmp = sqrt(fma(x_m, x_m, y));
	else
		tmp = fma(Float64(0.5 / x_m), y, x_m);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[x$95$m, 2e+139], N[Sqrt[N[(x$95$m * x$95$m + y), $MachinePrecision]], $MachinePrecision], N[(N[(0.5 / x$95$m), $MachinePrecision] * y + x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2.00000000000000007e139

   1. Initial program 83.1%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x + y}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x} + y} \]

      3. lower-fma.f64 83.1

         \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   4. Applied rewrites 83.1%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   if 2.00000000000000007e139 < x

   1. Initial program 16.3%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + \frac{1}{2} \cdot \frac{y}{x}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{y}{x} + x} \]

      2. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2} \cdot y}{x}} + x \]

      3. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2}}{x} \cdot y} + x \]

      4. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\frac{1}{2} \cdot 1}}{x} \cdot y + x \]

      5. associate-*r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \frac{1}{x}\right)} \cdot y + x \]

      6. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} \cdot \frac{1}{x}, y, x\right)} \]

      7. associate-*r/ N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{1}{2} \cdot 1}{x}}, y, x\right) \]

      8. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{1}{2}}}{x}, y, x\right) \]

      9. lower-/.f64 100.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{0.5}{x}}, y, x\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{0.5}{x}, y, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 57.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \cdot x\_m \leq 10^{-163}:\\ \;\;\;\;\sqrt{y}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x\_m \cdot x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y)
 :precision binary64
 (if (<= (* x_m x_m) 1e-163) (sqrt y) (sqrt (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m, double y) {
	double tmp;
	if ((x_m * x_m) <= 1e-163) {
		tmp = sqrt(y);
	} else {
		tmp = sqrt((x_m * x_m));
	}
	return tmp;
}

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m, y)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x_m * x_m) <= 1d-163) then
        tmp = sqrt(y)
    else
        tmp = sqrt((x_m * x_m))
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	double tmp;
	if ((x_m * x_m) <= 1e-163) {
		tmp = Math.sqrt(y);
	} else {
		tmp = Math.sqrt((x_m * x_m));
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	tmp = 0
	if (x_m * x_m) <= 1e-163:
		tmp = math.sqrt(y)
	else:
		tmp = math.sqrt((x_m * x_m))
	return tmp

Julia

x_m = abs(x)
function code(x_m, y)
	tmp = 0.0
	if (Float64(x_m * x_m) <= 1e-163)
		tmp = sqrt(y);
	else
		tmp = sqrt(Float64(x_m * x_m));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y)
	tmp = 0.0;
	if ((x_m * x_m) <= 1e-163)
		tmp = sqrt(y);
	else
		tmp = sqrt((x_m * x_m));
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := If[LessEqual[N[(x$95$m * x$95$m), $MachinePrecision], 1e-163], N[Sqrt[y], $MachinePrecision], N[Sqrt[N[(x$95$m * x$95$m), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 9.99999999999999923e-164

   1. Initial program 100.0%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\sqrt{y}} \]
   4. Step-by-step derivation

      1. lower-sqrt.f64 89.9

         \[\leadsto \color{blue}{\sqrt{y}} \]

   5. Applied rewrites 89.9%

      \[\leadsto \color{blue}{\sqrt{y}} \]

   if 9.99999999999999923e-164 < (*.f64 x x)

   1. Initial program 61.4%

      \[\sqrt{x \cdot x + y} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x + y}} \]

      2. lift-*.f64 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x} + y} \]

      3. lower-fma.f64 61.4

         \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   4. Applied rewrites 61.4%

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

   5. Taylor expanded in x around inf

      \[\leadsto \sqrt{\color{blue}{{x}^{2}}} \]
   6. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]

      2. lower-*.f64 50.6

         \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]

   7. Applied rewrites 50.6%

      \[\leadsto \sqrt{\color{blue}{x \cdot x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 69.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \sqrt{\mathsf{fma}\left(x\_m, x\_m, y\right)} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (sqrt (fma x_m x_m y)))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return sqrt(fma(x_m, x_m, y));
}

Julia

x_m = abs(x)
function code(x_m, y)
	return sqrt(fma(x_m, x_m, y))
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := N[Sqrt[N[(x$95$m * x$95$m + y), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 70.6%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \sqrt{\color{blue}{x \cdot x + y}} \]

   2. lift-*.f64 N/A

      \[\leadsto \sqrt{\color{blue}{x \cdot x} + y} \]

   3. lower-fma.f64 70.6

      \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]

4. Applied rewrites 70.6%

   \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(x, x, y\right)}} \]
5. Add Preprocessing

Alternative 4: 34.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \sqrt{y} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (sqrt y))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return sqrt(y);
}

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m, y)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = sqrt(y)
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	return Math.sqrt(y);
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	return math.sqrt(y)

Julia

x_m = abs(x)
function code(x_m, y)
	return sqrt(y)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m, y)
	tmp = sqrt(y);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := N[Sqrt[y], $MachinePrecision]

Derivation

1. Initial program 70.6%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\sqrt{y}} \]
4. Step-by-step derivation

   1. lower-sqrt.f64 31.4

      \[\leadsto \color{blue}{\sqrt{y}} \]

5. Applied rewrites 31.4%

   \[\leadsto \color{blue}{\sqrt{y}} \]
6. Add Preprocessing

Alternative 5: 1.2% accurate, 6.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ -x\_m \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y) :precision binary64 (- x_m))

C

x_m = fabs(x);
double code(double x_m, double y) {
	return -x_m;
}

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m, y)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = -x_m
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y) {
	return -x_m;
}

Python

x_m = math.fabs(x)
def code(x_m, y):
	return -x_m

Julia

x_m = abs(x)
function code(x_m, y)
	return Float64(-x_m)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m, y)
	tmp = -x_m;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_] := (-x$95$m)

Derivation

1. Initial program 70.6%

   \[\sqrt{x \cdot x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around -inf

   \[\leadsto \color{blue}{-1 \cdot x} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. lower-neg.f64 35.6

      \[\leadsto \color{blue}{-x} \]

5. Applied rewrites 35.6%

   \[\leadsto \color{blue}{-x} \]
6. Add Preprocessing

Developer Target 1: 98.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \frac{y}{x} + x\\ \mathbf{if}\;x < -1.5097698010472593 \cdot 10^{+153}:\\ \;\;\;\;-t\_0\\ \mathbf{elif}\;x < 5.582399551122541 \cdot 10^{+57}:\\ \;\;\;\;\sqrt{x \cdot x + y}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* 0.5 (/ y x)) x)))
   (if (< x -1.5097698010472593e+153)
     (- t_0)
     (if (< x 5.582399551122541e+57) (sqrt (+ (* x x) y)) t_0))))

C

double code(double x, double y) {
	double t_0 = (0.5 * (y / x)) + x;
	double tmp;
	if (x < -1.5097698010472593e+153) {
		tmp = -t_0;
	} else if (x < 5.582399551122541e+57) {
		tmp = sqrt(((x * x) + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (0.5d0 * (y / x)) + x
    if (x < (-1.5097698010472593d+153)) then
        tmp = -t_0
    else if (x < 5.582399551122541d+57) then
        tmp = sqrt(((x * x) + y))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (0.5 * (y / x)) + x;
	double tmp;
	if (x < -1.5097698010472593e+153) {
		tmp = -t_0;
	} else if (x < 5.582399551122541e+57) {
		tmp = Math.sqrt(((x * x) + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (0.5 * (y / x)) + x
	tmp = 0
	if x < -1.5097698010472593e+153:
		tmp = -t_0
	elif x < 5.582399551122541e+57:
		tmp = math.sqrt(((x * x) + y))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(0.5 * Float64(y / x)) + x)
	tmp = 0.0
	if (x < -1.5097698010472593e+153)
		tmp = Float64(-t_0);
	elseif (x < 5.582399551122541e+57)
		tmp = sqrt(Float64(Float64(x * x) + y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (0.5 * (y / x)) + x;
	tmp = 0.0;
	if (x < -1.5097698010472593e+153)
		tmp = -t_0;
	elseif (x < 5.582399551122541e+57)
		tmp = sqrt(((x * x) + y));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(0.5 * N[(y / x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[Less[x, -1.5097698010472593e+153], (-t$95$0), If[Less[x, 5.582399551122541e+57], N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2025011 
(FPCore (x y)
  :name "Linear.Quaternion:$clog from linear-1.19.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x -1509769801047259300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* 1/2 (/ y x)) x)) (if (< x 5582399551122541000000000000000000000000000000000000000000) (sqrt (+ (* x x) y)) (+ (* 1/2 (/ y x)) x))))

  (sqrt (+ (* x x) y)))