←
Maksim Volkau4,186 posts
Maksim Volkau avatar

Maksim Volkau

@dadhi

Software Developer. Love my family, coding, movies, comics, manga, SF.

◷ Joined January 2009▧ 117 Photos and videos
Maksim Volkau avatar
Maksim Volkau@dadhi·22 Apr 2025

Hi @neuecc, Do you know how to implement GetRef as instance method here: public interface ITs<T> { ref T GetRef(int index); } public struct Ts<T> : ITs<T> { public T T0, T1; public ref T GetRef(int i) { switch (i) { case 0: return ref T0; // ERROR CS8170 ... }

Jonathan Blow avatar
⟳ Maksim Volkau retweeted
Jonathan Blow@Jonathan_Blow·Nov 17

MONOMOON is my favorite game that I have played in this entire year of good indie games. You explore and solve puzzles. If you liked the book of clues in Tunic, this is the first game to do a good job of following up on that (that I've seen!) store.steampowered.com/app/3…

Evan Czaplicki avatar
⟳ Maksim Volkau retweeted
Evan Czaplicki@evancz·Nov 10

Me when I want to avoid unexpected JSON so much that I write a typed functional query language. "Tony Hoare told me to do it in 1973!"

Post attachment
Order of the Sinking Star avatar
⟳ Maksim Volkau retweeted
Order of the Sinking Star@SinkingStarGame·Oct 28

In partnership with @PLAYISMJP, we're thrilled to announce Order of the Sinking Star is out now on Switch 2 & PlayStation 5 in Japan! 🧩 We’re excited for console players in Japan to jump into our massive puzzle adventure! 🎌 🌟 Get Order of the Sinking Star today > orderofthesinkingstar.com

Post attachment
Valentin Ignatev avatar
⟳ Maksim Volkau retweeted
Valentin Ignatev@valigo·Oct 24

Code optimization is absolutely fascinating. When you multiply something by a constant (let's say 24), LLVM replaces multiplication (imul) with a combination of left shift (shl) and load effective address (lea) Left shift by 3 is the same as multiplying by 8, load effective address does math of [base + index] in the brackets, and then stores its result. All of this literally to save 1 cycle. Because imul takes 3 cycles, and shl and lea take 1 each. And you can find tables with similar heuristics for a lot of different constants. These people who write optimizing compiler backends spend so much effort to save just one instruction, so don't throw it all away!

Post attachment
Wouter van Oortmerssen avatar
⟳ Maksim Volkau retweeted
Wouter van Oortmerssen@wvo·Oct 23

I just made a programming language doing exactly this. As many address-space-reserved huge stacks as the program statically needs, with bump alloc, stable pointers, all compile time safe and yet way faster than what you can do in C++/Rust: github.com/aardappel/goose

.NET Foundation avatar
⟳ Maksim Volkau retweeted
.NET Foundation@dotnetfdn·Oct 22

Meet TinyFFR: a real-time cross-platform 3D rendering lib for modern .NET that doesn't mess around. Native AoT, SIMD math, PBR, FSR, SDF text, skeletal anims, multi-format 3D models, and drop-in UI support (Avalonia/WPF/WinForms/ImGui). Check it out: hubs.li/Q04BtBnJ0

Post attachment