Regular Graph Edge Count Calculator

            from math import *

def regular_graph_edge_count_calculator(a, b) -> float:
    return ((a * b) / 2.0)

assert abs(regular_graph_edge_count_calculator(120, 6) - 360) < 1e-6 * max(1.0, abs(360))
          

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

double regular_graph_edge_count_calculator(double a, double b) {
    return ((a * b) / 2.0);
}

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

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

double regular_graph_edge_count_calculator(double a, double b) {
    return ((a * b) / 2.0);
}

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

regular_graph_edge_count_calculator:
    push rbp
    mov rbp, rsp
    sub rsp, 48
    movsd [rbp-8], xmm0
    movsd [rbp-16], xmm1
    movsd xmm0, [rbp-8]
    mulsd xmm0, [rbp-16]
    movsd [rbp-32], xmm0
    mov rax, 0x4000000000000000
    movq xmm0, rax
    movsd [rbp-40], xmm0
    movsd xmm0, [rbp-32]
    divsd xmm0, [rbp-40]
    movsd [rbp-24], xmm0
    movsd xmm0, [rbp-24]
    leave
    ret
          

            function result = regular_graph_edge_count_calculator(a, b)
    result = ((a * b) / 2.0);
end
          

            ClearAll[mwCalculate];
mwCalculate[a_, b_] := ((a * b) / 2.0);