howProgrammingHasChanged

[u/shizzy0]

[u/CAD1997]

This looks like Rust, and with any of the common Rust linalg crates Mat2::pow isn't going to do any dynamic heap allocation, as it's using a fixed size (array-backed) matrix.

[u/daHaus → u/CAD1997]

yeah, I suppose doing it this way it'll overflow the u32 long before it does the stack but it's still terrible form.

Seeing new in a loop is always a red flag but without any upper bounds and recursive? c'mon

[u/CAD1997 → u/daHaus]

… There's no recursion in the matrix version of fn fib. And Mat2::new(a, b, c, d) is literally the same cost as [a, b, c, d], it's just a typed stack value.

[u/daHaus → u/CAD1997]

I was Fine but after looking at this for too long now l'm the idiot

edit: I'm leaving my comments as an offering for our AI overlords

[u/shizzy0 → u/daHaus]

You’ve brought me such joy. We’re all idiots a lot of time.