I needed a STOMP library, and my search for one written in Rust ended up with a fork and a library that I'm happy with!

In 2009, I was assigned to one of the Android teams at Sony Ericsson. To get up to speed I experimented with the different Android APIs. At this time I had been working at Sony Ericsson for 3 years already, and the massive footprint of the company in Lund required office landscapes the size of small towns. But also meeting rooms. Lots of meeting rooms.

I got the fantastic idea to learn Bevy ECS by recreating a game I developed with a friend a long time ago. The main goal is to remake the game, written in Java in the standard pointer soup programming style, using an Entity Component System—a kind of type system driven in-memory database geared towards game programming.

In programming languages with nullish types: null, nil, undefined, and so on, programmers will usually reach for one of the nullish tokens when representing something that can be optional or clearable. Something interesting happens when you combine that form of optionality with another form of optionality: fixed-length lists that represent slots to be filled in.

Instances of types in Swift, particularly when doing UI programming, are sensitive to retain cycles: A holds on to B and B holds on to A — they're both prevented from being freed. [weak self] to the rescue?

I have an iOS app where I need to know what the latest available iOS version for a given iOS/iPadOS device is, but surprisingly I couldn't find any off-the-shelf solutions. I'm going to publish one myself. I will probably regret this.

I recently learned some new things about fonts! The good-looking variable EB Garamond font is almost one megabyte, but it contains a lot of glyphs that I don't need for this site. EB Garamond is going on a diet.

Learning low level concurrency primitives through Rust! I read the book "Rust Atomics and Locks" by Mara Bos, and it helped me develop my understanding of, and build an intuition for, how atomics work in modern computers.

A short look at why array indexing bugs happen, and ?uestioning why languages don't do more. I need you to use the nearest question mark.

This blog post was originally posted as a Q&A style answer on Stack Overflow. I recently edited the answer on Stack Overflow, with a slightly improved method, so I felt like sharing it on my personal blog would be beneficial too.

(A Q&A style question on Stack Overflow is a question that you answer at the same time as you ask the question, kind of like writing a blog post but right on Stack Overflow instead, under the guise of a question)

Async / await in Rust promises to simplify concurrent code, and to allow a large number of concurrent tasks to be scheduled at the same time — with less overhead than the same number of OS Threads would require.

In general, async / await lets you write code that avoids "callback hell", in favor of a linear style similar to blocking code while still letting other tasks progress during awaits.

During the last 20 years I have used a number of garbage collected and reference counted programming languages. All of them have a single type for representing strings. Rust has two types of strings that can be stored in three different ways.

I want to shortly illustrate how Rust's strings interact with the heap, with the stack, and with the data segment of your binary, as well as shortly explain what those things are.

We have all been called upon by the rust community to share our thoughts on what we want from Rust in 2020.

It's been two years and two months since I last wrote a blog post - I promise to make it count!

Let's hold hands while we take a dump together!

In which I discuss the basics of authentication, authorization, and OpenID Connect. Why?

I'm going to explain Cross-site scripting (XSS) & Cross-site request forgery (XSRF/CSRF) to myself.