Binary-Log Ranking Discount rank plus one Solver

            from math import *

def binary_log_rank_discount_solve_a(c, b) -> float:
    return pow(b, c)

assert abs(binary_log_rank_discount_solve_a(3.1699250014423126, 2) - 9.000000000000002) < 1e-6 * max(1.0, abs(9.000000000000002))
          

            #include <assert.h>
#include <math.h>

double binary_log_rank_discount_solve_a(double c, double b) {
    return pow(b, c);
}

int main(void) {
    const double expected = 9.000000000000002;
    const double actual = binary_log_rank_discount_solve_a(3.1699250014423126, 2);
    assert(fabs(actual - expected) < 1e-6 * fmax(1.0, fabs(expected)));
}
          

            #include <cassert>
#include <cmath>
#include <numbers>

double binary_log_rank_discount_solve_a(double c, double b) {
    return std::pow(b, c);
}

int main() {
    constexpr double expected = 9.000000000000002;
    const double actual = binary_log_rank_discount_solve_a(3.1699250014423126, 2);
    assert(std::fabs(actual - expected) < 1e-6 * std::fmax(1.0, std::fabs(expected)));
}
          

x86-64 NASM · System V ABI · Linux · SSE2 with libm where required

            ; double binary_log_rank_discount_solve_a(double c, double b)
; Linux x86-64 NASM · System V ABI · first eight doubles in xmm0–xmm7
extern pow
global binary_log_rank_discount_solve_a
section .text

binary_log_rank_discount_solve_a:
    push rbp
    mov rbp, rsp
    sub rsp, 32
    movsd [rbp-8], xmm0
    movsd [rbp-16], xmm1
    movsd xmm0, [rbp-16]
    movsd xmm1, [rbp-8]
    call pow wrt ..plt
    movsd [rbp-24], xmm0
    movsd xmm0, [rbp-24]
    leave
    ret
          

            function result = binary_log_rank_discount_solve_a(c, b)
    result = (b ^ c);
end
          

            ClearAll[mwCalculate];
mwCalculate[c_, b_] := (b ^ c);