From e385df80d1d89abd3eda97a578b93a8ce9046609 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?IOhannes=20m=20zm=C3=B6lnig?=
 <zmoelnig@users.sourceforge.net>
Date: Mon, 19 Dec 2005 10:34:49 +0000
Subject: updated help-patches for [lifop] and [fifop]

svn path=/trunk/externals/zexy/; revision=4256
---
 examples/fifop.pd | 13 +++++++++----
 examples/lifop.pd | 11 ++++++++---
 2 files changed, 17 insertions(+), 7 deletions(-)

(limited to 'examples')

diff --git a/examples/fifop.pd b/examples/fifop.pd
index cc043a5..b1546c0 100644
--- a/examples/fifop.pd
+++ b/examples/fifop.pd
@@ -4,15 +4,15 @@
 #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 msg 199 97 bang;
+#X floatatom 200 133 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 247 80 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;
@@ -25,9 +25,14 @@ of the object any more.;
 #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 msg 201 159 info;
+#X text 247 158 query the number of arguments in the LIFO;
+#X obj 156 209 print info;
 #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;
+#X connect 9 1 19 0;
+#X connect 17 0 9 0;
diff --git a/examples/lifop.pd b/examples/lifop.pd
index fe8169c..822e564 100644
--- a/examples/lifop.pd
+++ b/examples/lifop.pd
@@ -5,10 +5,10 @@
 #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 msg 199 107 bang;
+#X floatatom 200 143 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
+#X text 247 90 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;
@@ -25,9 +25,14 @@ 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 msg 200 167 info;
+#X obj 112 203 print info;
+#X text 247 168 query the number of arguments in the LIFO;
 #X connect 2 0 10 0;
+#X connect 2 1 18 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;
+#X connect 17 0 2 0;
-- 
cgit v1.2.1