package sys.thread
Available on cs, neko, cpp, macro, java, hl
A Deque is a double-ended queue with a pop method that can block until an element is available. It is commonly used to synchronize threads.
new()Create a new Deque instance which is initially empty.
add(i:T):VoidAdds an element at the end of this Deque.
pop(block:Bool):Null<T>Tries to retrieve an element from the front of this Deque.
If an element is available, it is removed from the queue and returned.
If no element is available and block is false, null is returned.
Otherwise, execution blocks until an element is available and returns it.
push(i:T):VoidAdds an element at the front of this Deque.
© 2005–2020 Haxe Foundation
Licensed under a MIT license.
https://api.haxe.org/sys/thread/Deque.html