types of data structures in computer science: FIFO: preserves order for queues LIFO: stack behavior, common in programming languages FAFO: the novel data structure that one guy on the team who seems to just show up when he feels like it invented which has a bunch of "DO NOT CHANGE" comments
What do you call FAFO without the comments?
'HEY WHY DID THE EASTERN SEABOARD JUST GO DARK?''HEY WHY DID THE EASTERN SEABOARD JUST GO DARK?'
Can you even call yourself a programmer if you don’t write your own Lockless Concurrent FAFO?
You forgot GIGO .. Garbage In Garbage Out.
FAFO was the official way for python dicts because while it always returned a consistent order, the documentation said there was no need for python to preserve order and different implementations could decide to do something else. This changed to being required behavior.
I have FAFO in my own code. No comments, at least not useful ones.. obviously. I wonder why the hell I did it that way. Then remember that I used to code a lot whilst drunk..
/* THAT MEANS YOU KEITH */