h_queue
h_queue stores Pd data in a first-in, first-out (FIFO) queue, intended as a container for uses such as algorithmic composition. Use push to add data, front to inspect the front item without removing it, and pop to remove it; an optional initialization argument selects the namespace shared by matching containers.
AI Generated
This content was generated with the assistance of AI. If you notice any errors, please report them or submit a fix using Submit. Check the prompt used here.
- Download via Deken.
Open
Pdand go toToolsFind Externals. Search forpdcontainerand install it. Then create an object withdeclare -lib pdcontainer -path pdcontainer. Finally, useh_queueor any other object frompdcontainer. - Available for .