added help-patches for [fifop] and [lifop]

svn path=/trunk/externals/zexy/; revision=3019

2 files changed, 66 insertions, 0 deletions

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;
diff --git a/examples/lifop.pd b/examples/lifop.pd
new file mode 100644
index 0000000..fe8169c
--- /dev/null
+++ b/examples/lifop.pd
@@ -0,0 +1,33 @@
+#N canvas 2 165 568 508 10;
+#X text 471 31 part of;
+#X obj 533 30 zexy;
+#X obj 58 192 lifop;
+#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 247 110 bang to output the last list that came in \; bang again
+to output the second last list \; and so on;
+#X obj 58 223 print LIFO;
+#X text 47 18 lifop:: Last-In-First-Out stack with Priorities;
+#X text 54 263 [lifop] manages a number of LIFO-stacks \; each stack
+has assigned a priority value \; the lower the value \, the higher
+the priority;
+#X text 52 312 banging the object will first empty the LIFO with the
+highest priority \, then the LIFO with the second highest priority
+until the LIFO with the lowest priority is emptied.;
+#X text 52 363 when all LIFOs are emptied \, nothing will come out
+of the object any more.;
+#X text 50 400 priorities can be floating-point numbers (1.8 has a
+higher priority then 10);
+#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 10 0;
+#X connect 3 0 2 0;
+#X connect 4 0 2 0;
+#X connect 5 0 2 0;
+#X connect 6 0 2 0;
+#X connect 7 0 2 1;