It would be very useful if Enforce Script had a Queue data structure available (implemented in C++, exposed through Types.c), just like it has other data structures like maps and sets.
Why is it useful?
It is e. g. useful for things like BFS / level order traversal, which are common problems with many applications.
Why not implement it yourself?
It takes effort for individual modders to implement their own basic data structures
If implemented in Script, it is fairly slow compared to a C++ implementation exposed to Script
Why not use an alternative?
Regular array based queues (i. e. just using an array) have deque time of O(n), which makes them very costly
Circular array based queues have a fixed capacity which is not flexible enough for most problems
Using recursion (for level order traversal) instead of a queue is not a good approach because of the costs and limitations inherent to recursion
Conclusion
Only good solution here is a C++ implemented queue that is exposed to script like map, set or array.