[queue] is a universal first-in, first-out (FIFO) queue, that takes symbols, floats and lists. It is all vanilla.

It uses [text] by simply writing new items to the end of the [text] and outputting and deleting the first line of the [text] if an item is retrieved.

Download: queue.zip

Help file:

Abstraction:

Edit: Added the option to retrieve the current size

@ingox Extended abstractions........ lifo-fifo.zip

@whale-av that is from the list-abs library. i think those abstractions are really useful (and I use them too), but most of them are iterating lists which gets quite slow for long lists (for short ones it is not really a problem).
It would be at least much better to use [textfile], [list-store], [text] or (perhaps) [array] for that. Depending on the use case. Everything that is not iterating... [array] was more limited, [text] and [list-store] did not exist, but I think [textfile] did not change since the library was created. What I wanted to say, a lot of those abstractions could be optimized with the new/improved objects.