Forest Edge Count connected-component count Solver

            from math import *

def forest_edge_count_solve_b(c, a) -> float:
    return (a - c)

assert abs(forest_edge_count_solve_b(34, 40) - 6) < 1e-6 * max(1.0, abs(6))
          

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

double forest_edge_count_solve_b(double c, double a) {
    return (a - c);
}

int main(void) {
    const double expected = 6;
    const double actual = forest_edge_count_solve_b(34, 40);
    assert(fabs(actual - expected) < 1e-6 * fmax(1.0, fabs(expected)));
}
          

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

double forest_edge_count_solve_b(double c, double a) {
    return (a - c);
}

int main() {
    constexpr double expected = 6;
    const double actual = forest_edge_count_solve_b(34, 40);
    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 forest_edge_count_solve_b(double c, double a)
; Linux x86-64 NASM · System V ABI · first eight doubles in xmm0–xmm7
global forest_edge_count_solve_b
section .text

forest_edge_count_solve_b:
    push rbp
    mov rbp, rsp
    sub rsp, 32
    movsd [rbp-8], xmm0
    movsd [rbp-16], xmm1
    movsd xmm0, [rbp-16]
    subsd xmm0, [rbp-8]
    movsd [rbp-24], xmm0
    movsd xmm0, [rbp-24]
    leave
    ret
          

            function result = forest_edge_count_solve_b(c, a)
    result = (a - c);
end
          

            ClearAll[mwCalculate];
mwCalculate[c_, a_] := (a - c);