Skip to content

pdcontainer

Contributors

People who contribute to this project.

Objects

  • h_deque h_deque implements a double-ended queue for storing Pd data, with operations to access, add, or remove elements at both the front and back.
  • h_list h_list stores Pd data as a list designed for fast insertion and removal at any position, with front/back operations and iterator-based navigation and editing.
  • h_map h_map stores Pd data as key–value pairs, mapping each key to a value for later retrieval or removal.
  • h_multimap h_multimap stores key–value pairs like h_map, but allows a key to have multiple values.
  • h_multiset h_multiset stores Pd data as a multiset, allowing the same element to be added more than once and reporting how often queried data is present.
  • h_priority_queue h_priority_queue stores Pd data in a priority queue, with messages to push values, inspect the top item, remove it, test for emptiness, and report its size.
  • 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.
  • h_set h_set stores a set of elements, allowing data to be added, queried, and removed; a query outputs 1 when an element is present and 0 otherwise.
  • h_stack h_stack stores Pd data in a last-in, first-out (LIFO) stack, supporting operations to push data, inspect the top item, and remove the top item.
  • h_vector h_vector stores Pd data in an index-accessible sequence for algorithmic composition and related data handling.