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.
Create a new Deque instance which is initially empty.
Adds an element at the end of
Tries to retrieve an element from the front of
If an element is available, it is removed from the queue and returned.
If no element is available and
null is returned.
Otherwise, execution blocks until an element is available and returns it.
Adds an element at the front of
© 2005–2020 Haxe Foundation
Licensed under a MIT license.