This is based on the Phan demo, which is based on oraoto/pib (PHP in Browser)
(This was built on 2022-11-10 from commit c2bad593, and the implementation of the RFC may have changed since this was last updated.)
(As described in Wikipedia: In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like “cheque”) is an abstract data type that generalizes a queue, for which elements can be (efficiently) added to or removed from either the front (head) or back (tail))
(Note that WebAssembly performance/optimizations are slower and different compared to native architectures for both Collections\Deque
and array
(and all parts of PHP). E.g. for large values of n, native x64 performance of Collections\Deque
is several times faster than the WebAssembly performance.)