The shortest ooc quine

May 24, 2013 1 min #ooc · #programming

👋 This page was last updated ~13 years ago. Just so you know.

A few days ago I posted an ooc quine. But while browing HackerNews, I found an even shorter one. The shortest!

Here it is, in its full glory

Can’t see anything? That’s an empty file. It will compile and run just fine. ooc doesn’t require a main function - you can just shove code in there that will run at the program’s initialization. If there’s none, no big deal! It’ll just not run anything.

That’s one nice side-effect of simple design.

(JavaScript is required to see this. Or maybe my stuff broke)

Did you know I also make videos? Check them out on YouTube!

Here's another article just for you:

Recursive iterators in Rust

May 08, 2019

7 min #rust

I’ve been looking for this blog post everywhere, but it doesn’t exist, so I guess it’s my turn to write about Some Fun with Rust.

The task at hand

Let’s say you have a recursive, acyclic data structure, like so:



struct Node {
    values: Vec<i32>,
    children: Vec<Node>,
}

This allows you to represent a tree-like structure:

   [1, 2, 3]
       /\
      /  \
     /    \
    /      \
   /        \
[4, 5]    [6, 7]