[PD-cvs] externals/k_cext help-markov.pd,1.1,1.2

[Kjetil S. Matheussen]

Update of /cvsroot/pure-data/externals/k_cext
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv8314

Modified Files:
	help-markov.pd 
Log Message:
New SEND syntax

Index: help-markov.pd
===================================================================
RCS file: /cvsroot/pure-data/externals/k_cext/help-markov.pd,v
retrieving revision 1.1
retrieving revision 1.2
diff -C2 -d -r1.1 -r1.2
*** help-markov.pd	8 Jan 2004 14:55:24 -0000	1.1
--- help-markov.pd	9 Aug 2004 14:20:52 -0000	1.2
***************
*** 8,16 ****
  #X msg 371 52 \; state 1;
  #X text 371 32 reset;
- #X obj 260 103 k_cext 1 0 \; \; int state=I(0) \; int s1[3]=BEGIN 30
- \, 10 \, 70 END \; int s2[3]=BEGIN 60 \, 60 \, 80 END \; int random=RANDOM(100)
- \; \; IF random < s1[state] THEN DO \; . SEND("state" \, 1) \; ELIF
- random < s2[state] THEN DO \; . SEND("state" \, 2) \; ELSE \; . SEND("state"
- \, 3) \;;
  #X obj 33 25 bng 20 250 50 0 empty empty empty 20 8 0 8 -262144 -1
  -1;
--- 8,11 ----
***************
*** 35,41 ****
  \; IF random<a THEN DO \; . return 1 \; ELIF random<b THEN DO \; .
  return 2 \; ELSE \; . return 3 \;;
- #X obj 557 115 k_cext 1 0 \; \; int s1[3]=BEGIN 30 \, 10 \, 70 END
- \; int s2[3]=BEGIN 60 \, 60 \, 80 END \; SEND("state" \, INT_markov(s1[I(0)]
- \, s2[I(0)])) \;;
  #X obj 574 46 bng 20 250 50 0 empty empty empty 20 8 0 8 -262144 -1
  -1;
--- 30,33 ----
***************
*** 45,66 ****
  #X text 557 25 STEP;
  #X msg 530 72 print;
! #X text 237 29;
  #X text 244 360 Three ways to implement the markov;
  #X msg 561 259 print;
  #X connect 0 0 2 0;
  #X connect 1 0 2 1;
  #X connect 1 0 3 0;
! #X connect 2 0 7 0;
  #X connect 8 0 10 0;
! #X connect 9 0 10 1;
! #X connect 9 0 11 0;
! #X connect 10 0 18 0;
! #X connect 16 0 18 0;
! #X connect 17 0 7 0;
! #X connect 18 0 13 0;
! #X connect 21 0 23 0;
! #X connect 22 0 23 1;
! #X connect 22 0 24 0;
! #X connect 23 0 20 0;
! #X connect 26 0 20 0;
! #X connect 29 0 19 0;
--- 37,66 ----
  #X text 557 25 STEP;
  #X msg 530 72 print;
! #X text 237 29 comment;
  #X text 244 360 Three ways to implement the markov;
  #X msg 561 259 print;
+ #X obj 260 103 k_cext 1 0 \; \; int state=I(0) \; int s1[3]=BEGIN 30
+ \, 10 \, 70 END \; int s2[3]=BEGIN 60 \, 60 \, 80 END \; int random=RANDOM(100)
+ \; \; IF random < s1[state] THEN DO \; . SEND(state \, 1) \; ELIF random
+ < s2[state] THEN DO \; . SEND(state \, 2) \; ELSE \; . SEND(state \,
+ 3) \;;
+ #X obj 557 115 k_cext 1 0 \; \; int s1[3]=BEGIN 30 \, 10 \, 70 END
+ \; int s2[3]=BEGIN 60 \, 60 \, 80 END \; SEND(state \, INT_markov(s1[I(0)]
+ \, s2[I(0)])) \;;
  #X connect 0 0 2 0;
  #X connect 1 0 2 1;
  #X connect 1 0 3 0;
! #X connect 2 0 28 0;
! #X connect 7 0 9 0;
! #X connect 8 0 9 1;
  #X connect 8 0 10 0;
! #X connect 9 0 17 0;
! #X connect 15 0 17 0;
! #X connect 16 0 28 0;
! #X connect 17 0 12 0;
! #X connect 19 0 21 0;
! #X connect 20 0 21 1;
! #X connect 20 0 22 0;
! #X connect 21 0 29 0;
! #X connect 24 0 29 0;
! #X connect 27 0 18 0;