From e145ae58b67cd07ed7371b77a042a65819d1a546 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?IOhannes=20m=20zm=C3=B6lnig?= Date: Wed, 18 May 2005 17:28:20 +0000 Subject: added help-patches for [fifop] and [lifop] svn path=/trunk/externals/zexy/; revision=3019 --- examples/fifop.pd | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 examples/fifop.pd (limited to 'examples/fifop.pd') diff --git a/examples/fifop.pd b/examples/fifop.pd new file mode 100644 index 0000000..cc043a5 --- /dev/null +++ b/examples/fifop.pd @@ -0,0 +1,33 @@ +#N canvas 432 159 587 516 10; +#X text 471 31 part of; +#X obj 533 30 zexy; +#X msg 58 85 1 2 3 4 5; +#X msg 69 110 list a list; +#X msg 81 137 5; +#X msg 199 127 bang; +#X floatatom 200 163 5 0 0 1 priority - -; +#X text 45 61 input lists; +#X text 50 400 priorities can be floating-point numbers (1.8 has a +higher priority then 10); +#X obj 58 192 fifop; +#X text 47 18 fifop:: First-In-First-Out stack with Priorities; +#X text 247 110 bang to output the first list that came in \; bang +again to output the second list \; and so on; +#X text 54 263 [fifop] manages a number of FIFO-stacks \; each stack +has a priority value assigned \; the lower the value \, the higher +the priority; +#X text 52 310 banging the object will first empty the FIFO with the +highest priority \, then the FIFO with the second highest priority +and so on \, until the FIFO with the lowest priority is emptied.; +#X text 51 368 when all FIFOs are emptied \, nothing will come out +of the object any more.; +#X obj 58 223 print FIFO; +#X text 52 445 note: you can store any number of lists into the [fifop] +\, but just pushing lists on the stack without popping them back will +eat your memory.; +#X connect 2 0 9 0; +#X connect 3 0 9 0; +#X connect 4 0 9 0; +#X connect 5 0 9 0; +#X connect 6 0 9 1; +#X connect 9 0 15 0; -- cgit v1.2.1