The Sierpinski triangle was the first "complex" system I had managed to draw, using the Logo programming language in the 90s. I recently tried to do a vtk 3D extension (Sierpinski cube)[1] using the same process as in the OP, but it was surprisingly computationally expensive!
I'm actually very interested in the Delay/Disruption Tolerant Networking protocol that is under development at Goddard. I've found a lot of resources on why it is needed and how it is helpful, but not much on the actual implementation.
Erlang iolists are an example. It means you can generate HTML from templates as a deeply nested list of strings, and write that to a socket efficiently, without concatenating the strings.
The point isn't the requirement, the point is the possibility. You can supply a vector with just one element if you like. But if the data is already in multiple buffers, you avoid either a copy or the overhead of additional syscalls. Typical use cases are when you have headers and payload of some protocol in different buffers, possibly of multiple layers of protocol headers.
For some reason that feels like cheating on a test but it's brilliant nevertheless. I think I'll try it with the 15 local corner shop sites that I'm hosting out of the goodness of my heart. Thanks!
