Howdy, Stranger!
We are about to switch to a new forum software. Until then we have removed the registration on this forum.
Categories
- All Categories 25.7K
- Announcements & Guidelines 13
- Common Questions 30
- Using Processing 22.1K
- Programming Questions 12.2K
- Questions about Code 6.4K
- How To... 4.2K
- Hello Processing 72
- GLSL / Shaders 292
- Library Questions 4K
- Hardware, Integration & Other Languages 2.7K
- Kinect 668
- Arduino 1K
- Raspberry PI 188
- Questions about Modes 2K
- Android Mode 1.3K
- JavaScript Mode 413
- Python Mode 205
- Questions about Tools 100
- Espanol 5
- Developing Processing 548
- Create & Announce Libraries 211
- Create & Announce Modes 19
- Create & Announce Tools 29
- Summer of Code 2018 93
- Rails Girls Summer of Code 2017 3
- Summer of Code 2017 49
- Summer of Code 2016 4
- Summer of Code 2015 40
- Summer of Code 2014 22
- p5.js 1.6K
- p5.js Programming Questions 947
- p5.js Library Questions 315
- p5.js Development Questions 31
- General 1.4K
- Events & Opportunities 288
- General Discussion 365
In this Discussion
- AzazelHD August 2017
- GoToLoop August 2017
- jeremydouglass August 2017
- koogs August 2017
- quark August 2017
Answers
yeah but i mean, i dont see any queue here: https://processing.org/reference/
AFAIK Processing does not provide its own implementations for FIFO and LIFO data structures.
So no, it doesn't have its own queues. All the normal Java data structures are stil available, though -- you just need to include an import from java.util
etc. then use as per examples in a forum search, check the reference in the Java API.
For reference:
https://forum.processing.org/two/discussion/23895/muffet-from-undertale