val fifo = ArrayDeque<Int>()fifo.add(1)fifo.add(2)fifo.add(3)while (fifo.isNotEmpty()) { Timber.d("fifo=${fifo.remove()}")}Output
fifo=1
fifo=2
fifo=3NOTE: Other Queue implementation inclides LinkedList, PriorityQueue, ConcurrentLinkedDeque, ConcurrentLinkedQueue, etc.
❤️ Is this article helpful?
Buy me a coffee ☕ or support my work via PayPal to keep this space 🖖 and ad-free.
Do send some 💖 to @d_luaz or share this article.
✨ By Desmond Lua
A dream boy who enjoys making apps, travelling and making youtube videos. Follow me on @d_luaz
👶 Apps I built
Travelopy - discover travel places in Malaysia, Singapore, Taiwan, Japan.