Optimize OutputIterator using a queue structure

[n1lordduck]

Replaced table.insert and table.remove(self, 1) with a queue implementation using explicit first and last pointers, because shifting elements out of a table with table.remove(1) triggers a re-indexing every iteration

I've taken inspiration from here: https://www.lua.org/pil/11.4.html

I've tested implementing this with the following code: gist

Results:

Ignore the push/pop score, i've been making an addon with my own personal wiremod preferences (hence why the gist code looks like that) but i think this change would benefit wiremod