Pd-cvs January 2007

pd-cvs@lists.iem.at

21 participants
539 discussions

pd/src desire.c, 1.1.2.217.2.101, 1.1.2.217.2.102 m_pd.h, 1.4.4.11.2.33.2.22, 1.4.4.11.2.33.2.23
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv5062 Modified Files: Tag: desiredata desire.c m_pd.h Log Message: removed gp_valid Index: m_pd.h =================================================================== RCS file: /cvsroot/pure-data/pd/src/m_pd.h,v retrieving revision 1.4.4.11.2.33.2.22 retrieving revision 1.4.4.11.2.33.2.23 diff -C2 -d -r1.4.4.11.2.33.2.22 -r1.4.4.11.2.33.2.23 *** m_pd.h 3 Jan 2007 02:03:21 -0000 1.4.4.11.2.33.2.22 --- m_pd.h 3 Jan 2007 02:36:26 -0000 1.4.4.11.2.33.2.23 *************** *** 114,118 **** union word *gp_w; /* raw data (if array) */ } gp_un; ! int gp_valid; /* number which must match gpointee */ t_gstub *gp_stub; /* stub which points to glist/array */ } t_gpointer; --- 114,118 ---- union word *gp_w; /* raw data (if array) */ } gp_un; ! int gp_useless; t_gstub *gp_stub; /* stub which points to glist/array */ } t_gpointer; Index: desire.c =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/desire.c,v retrieving revision 1.1.2.217.2.101 retrieving revision 1.1.2.217.2.102 diff -C2 -d -r1.1.2.217.2.101 -r1.1.2.217.2.102 *** desire.c 3 Jan 2007 02:03:18 -0000 1.1.2.217.2.101 --- desire.c 3 Jan 2007 02:36:24 -0000 1.1.2.217.2.102 *************** *** 5099,5108 **** t_gstub *gs = gp->gp_stub; if (!gs) return 0; ! if (gs->gs_which == GP_ARRAY) return gs->gs_un.gs_array->valid == gp->gp_valid; ! if (gs->gs_which == GP_CANVAS) { ! if (!headok && !gp->gp_un.gp_scalar) return 0; ! if (gs->gs_un.gs_glist->valid != gp->gp_valid) return 0; ! return 1; ! } else return 0; } --- 5099,5105 ---- t_gstub *gs = gp->gp_stub; if (!gs) return 0; ! if (gs->gs_which == GP_ARRAY) return 1; ! if (gs->gs_which == GP_CANVAS) return headok || gp->gp_un.gp_scalar; ! return 0; } *************** *** 5112,5116 **** t_gstub *gs = gp->gp_stub; if (gs->gs_which == GP_CANVAS) {t_scalar *sc = gp->gp_un.gp_scalar; return sc ? sc->t : 0;} ! else {t_array *a = gs->gs_un.gs_array; return a->templatesym;} } --- 5109,5113 ---- t_gstub *gs = gp->gp_stub; if (gs->gs_which == GP_CANVAS) {t_scalar *sc = gp->gp_un.gp_scalar; return sc ? sc->t : 0;} ! else {t_array *a = gs->gs_un.gs_array; return a->templatesym;} } *************** *** 5133,5146 **** static void gpointer_setcanvas(t_gpointer *gp, t_canvas *canvas, t_scalar *x) { t_gstub *gs = gp->gp_stub; if (gs) gstub_dis(gs); ! gp->gp_stub=gs=canvas->stub; gp->gp_valid = canvas->valid; gp->gp_un.gp_scalar = x; gs->gs_refcount++; } static void gpointer_setarray(t_gpointer *gp, t_array *array, t_word *w) { t_gstub *gs = gp->gp_stub; if (gs) gstub_dis(gs); ! gp->gp_stub=gs=array->stub; gp->gp_valid = array->valid; gp->gp_un.gp_w = w; gs->gs_refcount++; } void gpointer_init(t_gpointer *gp) { gp->gp_stub = 0; - gp->gp_valid = 0; gp->gp_un.gp_scalar = 0; } --- 5130,5142 ---- static void gpointer_setcanvas(t_gpointer *gp, t_canvas *canvas, t_scalar *x) { t_gstub *gs = gp->gp_stub; if (gs) gstub_dis(gs); ! gp->gp_stub=gs=canvas->stub; gp->gp_un.gp_scalar = x; gs->gs_refcount++; } static void gpointer_setarray(t_gpointer *gp, t_array *array, t_word *w) { t_gstub *gs = gp->gp_stub; if (gs) gstub_dis(gs); ! gp->gp_stub=gs=array->stub; gp->gp_un.gp_w = w; gs->gs_refcount++; } void gpointer_init(t_gpointer *gp) { gp->gp_stub = 0; gp->gp_un.gp_scalar = 0; } *************** *** 5185,5188 **** --- 5181,5187 ---- } + /* for future use */ + static int isstale(t_gpointer *x) {return 1;} + static void ptrobj_vnext(t_ptrobj *x, float f) { t_gobj *gobj; *************** *** 5191,5200 **** t_canvas *canvas; int wantselected = f!=0; - if (!gs) {pd_error(x, "next: no current pointer"); return;} if (gs->gs_which != GP_CANVAS) {pd_error(x, "next: lists only, not arrays"); return;} canvas = gs->gs_un.gs_glist; ! if (canvas->valid != gp->gp_valid) {pd_error(x, "next: stale pointer"); return;} ! if (wantselected && !canvas_isvisible(canvas)) {pd_error(x, "next: next-selected only works for a visible window"); return;} gobj = gp->gp_un.gp_scalar; if (!gobj) gobj = canvas->list; --- 5190,5200 ---- t_canvas *canvas; int wantselected = f!=0; if (!gs) {pd_error(x, "next: no current pointer"); return;} if (gs->gs_which != GP_CANVAS) {pd_error(x, "next: lists only, not arrays"); return;} canvas = gs->gs_un.gs_glist; ! if (isstale(gp)) {pd_error(x, "next: stale pointer"); return;} ! if (wantselected) {pd_error(x, "next: next-selected unsupported in desiredata"); return;} ! /* if (wantselected && !canvas_isvisible(canvas)) ! {pd_error(x, "next: next-selected only works for a visible window"); return;} */ gobj = gp->gp_un.gp_scalar; if (!gobj) gobj = canvas->list; *************** *** 5626,5638 **** int nitems = x->nin; t_template *t = template_findbyname(x->templatesym); - t_appendvariable *vp; t_gpointer *gp = &x->gp; t_gstub *gs = gp->gp_stub; - t_word *vec; TEMPLATE_CHECK(x,x->templatesym,) if (!gs) {pd_error(x, "no current pointer"); return;} if (gs->gs_which != GP_CANVAS) {pd_error(x, "lists only, not arrays"); return;} t_canvas *canvas = gs->gs_un.gs_glist; ! if (canvas->valid != gp->gp_valid) {pd_error(x, "stale pointer"); return;} if (!nitems) return; x->variables[0].f = f; --- 5626,5636 ---- int nitems = x->nin; t_template *t = template_findbyname(x->templatesym); t_gpointer *gp = &x->gp; t_gstub *gs = gp->gp_stub; TEMPLATE_CHECK(x,x->templatesym,) if (!gs) {pd_error(x, "no current pointer"); return;} if (gs->gs_which != GP_CANVAS) {pd_error(x, "lists only, not arrays"); return;} t_canvas *canvas = gs->gs_un.gs_glist; ! if (isstale(gp)) {pd_error(x, "stale pointer"); return;} if (!nitems) return; x->variables[0].f = f; *************** *** 5644,5649 **** gobj_changed(sc,0); gp->gp_un.gp_scalar = sc; ! vec = sc->v; ! vp=x->variables; for (int i=0; i<nitems; i++,vp++) template_setfloat(t, vp->sym, vec, vp->f, 1); scalar_redraw(sc, canvas); --- 5642,5647 ---- gobj_changed(sc,0); gp->gp_un.gp_scalar = sc; ! t_word *vec = sc->v; ! t_appendvariable *vp=x->variables; for (int i=0; i<nitems; i++,vp++) template_setfloat(t, vp->sym, vec, vp->f, 1); scalar_redraw(sc, canvas);

1 0

pd/src ChangeLog,1.1.4.11.2.11,1.1.4.11.2.12
by chunlee 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv4328 Modified Files: Tag: desiredata ChangeLog Log Message: some new entries for pre6 Index: ChangeLog =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/ChangeLog,v retrieving revision 1.1.4.11.2.11 retrieving revision 1.1.4.11.2.12 diff -C2 -d -r1.1.4.11.2.11 -r1.1.4.11.2.12 *** ChangeLog 28 Dec 2006 22:47:21 -0000 1.1.4.11.2.11 --- ChangeLog 3 Jan 2007 02:33:35 -0000 1.1.4.11.2.12 *************** *** 8,12 **** * added t_string, A_STRING for "deallocatable symbols". * some ex-symbols now parsed as floats: +1 +1.0 +1e8 0x10 and so on. ! Desire 0.40.pre5 (2006.12.19) (-r desiredata; ./configure && make) : --- 8,16 ---- * added t_string, A_STRING for "deallocatable symbols". * some ex-symbols now parsed as floats: +1 +1.0 +1e8 0x10 and so on. ! * auto show/hide scrollbars ! * menu bar can be disabled ! * new Find widget (FireFox style) ! * subpatcherize implemented ! Desire 0.40.pre5 (2006.12.19) (-r desiredata; ./configure && make) :

1 0

pd/src desire.c, 1.1.2.217.2.100, 1.1.2.217.2.101 m_pd.h, 1.4.4.11.2.33.2.21, 1.4.4.11.2.33.2.22
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv25546 Modified Files: Tag: desiredata desire.c m_pd.h Log Message: GP_GLIST renamed to GP_CANVAS Index: m_pd.h =================================================================== RCS file: /cvsroot/pure-data/pd/src/m_pd.h,v retrieving revision 1.4.4.11.2.33.2.21 retrieving revision 1.4.4.11.2.33.2.22 diff -C2 -d -r1.4.4.11.2.33.2.21 -r1.4.4.11.2.33.2.22 *** m_pd.h 31 Dec 2006 19:21:40 -0000 1.4.4.11.2.33.2.21 --- m_pd.h 3 Jan 2007 02:03:21 -0000 1.4.4.11.2.33.2.22 *************** *** 96,100 **** #define GP_NONE 0 /* the stub points nowhere (has been cut off) */ ! #define GP_GLIST 1 /* the stub points to a glist element */ #define GP_ARRAY 2 /* ... or array */ --- 96,101 ---- #define GP_NONE 0 /* the stub points nowhere (has been cut off) */ ! #define GP_CANVAS 1 /* the stub points to a glist element */ ! #define GP_GLIST 1 #define GP_ARRAY 2 /* ... or array */ Index: desire.c =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/desire.c,v retrieving revision 1.1.2.217.2.100 retrieving revision 1.1.2.217.2.101 diff -C2 -d -r1.1.2.217.2.100 -r1.1.2.217.2.101 *** desire.c 31 Dec 2006 19:21:38 -0000 1.1.2.217.2.100 --- desire.c 3 Jan 2007 02:03:18 -0000 1.1.2.217.2.101 *************** *** 5067,5071 **** t_gstub *gstub_new(t_canvas *gl, t_array *a) { t_gstub *gs = (t_gstub *)getbytes(sizeof(*gs)); ! if (gl) {gs->gs_which = GP_GLIST; gs->gs_un.gs_glist = gl;} else {gs->gs_which = GP_ARRAY; gs->gs_un.gs_array = a;} gs->gs_refcount = 0; --- 5067,5071 ---- t_gstub *gstub_new(t_canvas *gl, t_array *a) { t_gstub *gs = (t_gstub *)getbytes(sizeof(*gs)); ! if (gl) {gs->gs_which = GP_CANVAS; gs->gs_un.gs_glist = gl;} else {gs->gs_which = GP_ARRAY; gs->gs_un.gs_array = a;} gs->gs_refcount = 0; *************** *** 5100,5104 **** if (!gs) return 0; if (gs->gs_which == GP_ARRAY) return gs->gs_un.gs_array->valid == gp->gp_valid; ! if (gs->gs_which == GP_GLIST) { if (!headok && !gp->gp_un.gp_scalar) return 0; if (gs->gs_un.gs_glist->valid != gp->gp_valid) return 0; --- 5100,5104 ---- if (!gs) return 0; if (gs->gs_which == GP_ARRAY) return gs->gs_un.gs_array->valid == gp->gp_valid; ! if (gs->gs_which == GP_CANVAS) { if (!headok && !gp->gp_un.gp_scalar) return 0; if (gs->gs_un.gs_glist->valid != gp->gp_valid) return 0; *************** *** 5111,5115 **** static t_symbol *gpointer_gettemplatesym(const t_gpointer *gp) { t_gstub *gs = gp->gp_stub; ! if (gs->gs_which == GP_GLIST) {t_scalar *sc = gp->gp_un.gp_scalar; return sc ? sc->t : 0;} else {t_array *a = gs->gs_un.gs_array; return a->templatesym;} } --- 5111,5115 ---- static t_symbol *gpointer_gettemplatesym(const t_gpointer *gp) { t_gstub *gs = gp->gp_stub; ! if (gs->gs_which == GP_CANVAS) {t_scalar *sc = gp->gp_un.gp_scalar; return sc ? sc->t : 0;} else {t_array *a = gs->gs_un.gs_array; return a->templatesym;} } *************** *** 5193,5197 **** if (!gs) {pd_error(x, "next: no current pointer"); return;} ! if (gs->gs_which != GP_GLIST) {pd_error(x, "next: lists only, not arrays"); return;} canvas = gs->gs_un.gs_glist; if (canvas->valid != gp->gp_valid) {pd_error(x, "next: stale pointer"); return;} --- 5193,5197 ---- if (!gs) {pd_error(x, "next: no current pointer"); return;} ! if (gs->gs_which != GP_CANVAS) {pd_error(x, "next: lists only, not arrays"); return;} canvas = gs->gs_un.gs_glist; if (canvas->valid != gp->gp_valid) {pd_error(x, "next: stale pointer"); return;} *************** *** 5221,5225 **** if (!gpointer_check(&x->gp, 1)) {pd_error(x, "bang: empty pointer"); return;} gs = x->gp.gp_stub; ! if (gs->gs_which == GP_GLIST) canvas = gs->gs_un.gs_glist; else { t_array *owner_array = gs->gs_un.gs_array; --- 5221,5225 ---- if (!gpointer_check(&x->gp, 1)) {pd_error(x, "bang: empty pointer"); return;} gs = x->gp.gp_stub; ! if (gs->gs_which == GP_CANVAS) canvas = gs->gs_un.gs_glist; else { t_array *owner_array = gs->gs_un.gs_array; *************** *** 5253,5257 **** if (!gpointer_check(&x->gp, 1)) {pd_error(x, "rewind: empty pointer"); return;} gs = x->gp.gp_stub; ! if (gs->gs_which != GP_GLIST) {pd_error(x, "rewind: sorry, unavailable for arrays"); return;} canvas = gs->gs_un.gs_glist; gpointer_setcanvas(&x->gp, canvas, 0); --- 5253,5257 ---- if (!gpointer_check(&x->gp, 1)) {pd_error(x, "rewind: empty pointer"); return;} gs = x->gp.gp_stub; ! if (gs->gs_which != GP_CANVAS) {pd_error(x, "rewind: sorry, unavailable for arrays"); return;} canvas = gs->gs_un.gs_glist; gpointer_setcanvas(&x->gp, canvas, 0); *************** *** 5381,5385 **** for (int i=0; i<nitems; i++,vp++) template_setsymbol(t, vp->sym, vec, vp->w.w_symbol, 1); else for (int i=0; i<nitems; i++,vp++) template_setfloat(t, vp->sym, vec, vp->w.w_float, 1); ! if (gs->gs_which == GP_GLIST) scalar_redraw(gp->gp_un.gp_scalar, gs->gs_un.gs_glist); else { t_array *owner_array = gs->gs_un.gs_array; --- 5381,5385 ---- for (int i=0; i<nitems; i++,vp++) template_setsymbol(t, vp->sym, vec, vp->w.w_symbol, 1); else for (int i=0; i<nitems; i++,vp++) template_setfloat(t, vp->sym, vec, vp->w.w_float, 1); ! if (gs->gs_which == GP_CANVAS) scalar_redraw(gp->gp_un.gp_scalar, gs->gs_un.gs_glist); else { t_array *owner_array = gs->gs_un.gs_array; *************** *** 5557,5561 **** but if we belong to an element of another array we have to search back until we get to a scalar to erase. When graphics updates become queueable this may fall apart... */ ! if (gs->gs_which == GP_GLIST) { if (canvas_isvisible(gs->gs_un.gs_glist)) sys_mgui(gp->gp_un.gp_scalar,"delete",""); } else { --- 5557,5561 ---- but if we belong to an element of another array we have to search back until we get to a scalar to erase. When graphics updates become queueable this may fall apart... */ ! if (gs->gs_which == GP_CANVAS) { if (canvas_isvisible(gs->gs_un.gs_glist)) sys_mgui(gp->gp_un.gp_scalar,"delete",""); } else { *************** *** 5576,5580 **** } } ! if (gs->gs_which == GP_GLIST) { gobj_changed(gp->gp_un.gp_scalar,0); } else {/*is there something missing here?*/ --- 5576,5580 ---- } } ! if (gs->gs_which == GP_CANVAS) { gobj_changed(gp->gp_un.gp_scalar,0); } else {/*is there something missing here?*/ *************** *** 5632,5636 **** TEMPLATE_CHECK(x,x->templatesym,) if (!gs) {pd_error(x, "no current pointer"); return;} ! if (gs->gs_which != GP_GLIST) {pd_error(x, "lists only, not arrays"); return;} t_canvas *canvas = gs->gs_un.gs_glist; if (canvas->valid != gp->gp_valid) {pd_error(x, "stale pointer"); return;} --- 5632,5636 ---- TEMPLATE_CHECK(x,x->templatesym,) if (!gs) {pd_error(x, "no current pointer"); return;} ! if (gs->gs_which != GP_CANVAS) {pd_error(x, "lists only, not arrays"); return;} t_canvas *canvas = gs->gs_un.gs_glist; if (canvas->valid != gp->gp_valid) {pd_error(x, "stale pointer"); return;} *************** *** 6242,6247 **** dummy_class = class_new(gensym("dummy"), 0, 0, sizeof(t_text), CLASS_NOINLET|CLASS_PATCHABLE, 0); ! c = mresp_class = class_new(gensym("messresponder"), 0, 0, ! sizeof(t_text), CLASS_PD, 0); class_addbang( c, mresp_bang); class_addfloat( c, (t_method) mresp_float); --- 6242,6246 ---- dummy_class = class_new(gensym("dummy"), 0, 0, sizeof(t_text), CLASS_NOINLET|CLASS_PATCHABLE, 0); ! c = mresp_class = class_new(gensym("messresponder"), 0, 0, sizeof(t_text), CLASS_PD, 0); class_addbang( c, mresp_bang); class_addfloat( c, (t_method) mresp_float); *************** *** 6250,6255 **** class_addanything(c, mresp_anything); ! c = message_class = class_new(gensym("message"), 0,0, ! sizeof(t_message), CLASS_PATCHABLE, 0); class_addbang(c, message_bang); class_addfloat(c, message_float); --- 6249,6253 ---- class_addanything(c, mresp_anything); ! c = message_class = class_new(gensym("message"), 0,0, sizeof(t_message), CLASS_PATCHABLE, 0); class_addbang(c, message_bang); class_addfloat(c, message_float); *************** *** 7841,7844 **** --- 7839,7843 ---- pd_bind((t_pd *)&maxclass, gensym("max")); + /* this smells bad... a conflict with [pd] subpatches */ t_class *c = glob_pdobject = class_new(gensym("pd"), 0, 0, sizeof(t_pd), CLASS_DEFAULT, A_NULL);

1 0

pd/src desire.tk,1.1.2.600.2.150,1.1.2.600.2.151
by chunlee 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv19249 Modified Files: Tag: desiredata desire.tk Log Message: small fixes on wires Index: desire.tk =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/desire.tk,v retrieving revision 1.1.2.600.2.150 retrieving revision 1.1.2.600.2.151 diff -C2 -d -r1.1.2.600.2.150 -r1.1.2.600.2.151 *** desire.tk 3 Jan 2007 00:34:30 -0000 1.1.2.600.2.150 --- desire.tk 3 Jan 2007 01:45:45 -0000 1.1.2.600.2.151 *************** *** 1991,1995 **** $self populate_menu edit { undo redo {} ! cut copy paste duplicate select_all {} text_editor tidy_up {}} $self populate_menu find { --- 1991,1995 ---- $self populate_menu edit { undo redo {} ! cut copy paste duplicate select_all subpatcherize {} text_editor tidy_up {}} $self populate_menu find { *************** *** 2490,2494 **** def Canvas wires {} {return $@wires} ! def Canvas delete_selection {} { if {![llength $@selection] && ![llength $@selection_wire]} {return} --- 2490,2497 ---- def Canvas wires {} {return $@wires} ! def Canvas wires-= {wire} { ! set idx [lsearch $@wires $wire] ! set @wires [lreplace $@wires $idx $idx] ! } def Canvas delete_selection {} { if {![llength $@selection] && ![llength $@selection_wire]} {return} *************** *** 3206,3209 **** --- 3209,3213 ---- } + def Canvas disconnect {wire} { set @keynav_tab_sel "wire" *************** *** 3262,3265 **** --- 3266,3270 ---- } } + $wire delete } } *************** *** 3402,3406 **** } } ! def Canvas subpatcherize_paste {} { set subpatcherize(paste) 1 --- 3407,3411 ---- } } ! def Canvas subpatcherize_paste {} { set subpatcherize(paste) 1 *************** *** 4571,4574 **** --- 4576,4580 ---- $@obj1 delete_wire $self $@obj2 delete_wire $self + $@canvas wires-= $self super }

1 0

externals/pureunity/doc PureUnity.lyx,1.1,1.2
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/externals/pureunity/doc In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv3404/doc Modified Files: PureUnity.lyx Log Message: . Index: PureUnity.lyx =================================================================== RCS file: /cvsroot/pure-data/externals/pureunity/doc/PureUnity.lyx,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** PureUnity.lyx 13 Jan 2006 10:42:09 -0000 1.1 --- PureUnity.lyx 3 Jan 2007 01:02:42 -0000 1.2 *************** *** 53,56 **** --- 53,62 ---- (write ontological nonsense here) + \layout Standard + + fsdfsdf + \layout Standard + + sfsdfsdf \layout Subsection *************** *** 59,71 **** I've thought of a triad: ! \layout Standard A. "the real thing" ! \layout Standard B. what it's documented as ! \layout Standard C. --- 65,77 ---- I've thought of a triad: ! \layout Itemize A. "the real thing" ! \layout Itemize B. what it's documented as ! \layout Itemize C. *************** *** 74,84 **** and another one: ! \layout Standard changing A to match B+C: programming ! \layout Standard changing B to match A+C: the scientific method (aka reverse engineering) ! \layout Standard changing C to match A+B: unit-tests and contracts and scientific experiments --- 80,90 ---- and another one: ! \layout Itemize changing A to match B+C: programming ! \layout Itemize changing B to match A+C: the scientific method (aka reverse engineering) ! \layout Itemize changing C to match A+B: unit-tests and contracts and scientific experiments *************** *** 112,115 **** --- 118,124 ---- Protocol + \layout Standard + + (steal text from the GF paper from Graz) \layout Subsection *************** *** 141,146 **** --- 150,182 ---- \layout Subsection + Temporal Logic + \layout Subsection + TODO + \layout Bibliography + \bibitem {co99} + + a constructive deconstruction of type theory by Alistair Cockburn + \layout Bibliography + \bibitem {key-7} + + Programming Ruby by David Thomas & Andrew Hunt + \layout Bibliography + \bibitem {key-6} + + Abstract Algebra, Dummit & Foote + \layout Bibliography + \bibitem {key-5} + + Wikipedia + \layout Bibliography + \bibitem {key-3} + + my brain + \layout Section* + + Colophon \layout Standard + made with LyX and some coffee \the_end

1 0

externals/io/wiiremote aka.wiiremote.c,1.5,1.6
by Hans-Christoph Steiner 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/externals/io/wiiremote In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv3012 Modified Files: aka.wiiremote.c Log Message: oops, forgot to allocate memory to the pointer! tsk tsk... Index: aka.wiiremote.c =================================================================== RCS file: /cvsroot/pure-data/externals/io/wiiremote/aka.wiiremote.c,v retrieving revision 1.5 retrieving revision 1.6 diff -C2 -d -r1.5 -r1.6 *** aka.wiiremote.c 28 Dec 2006 23:16:03 -0000 1.5 --- aka.wiiremote.c 3 Jan 2007 01:01:08 -0000 1.6 *************** *** 311,314 **** --- 311,315 ---- t_akawiiremote *x = (t_akawiiremote *)pd_new(wiiremote_class); + x->wiiremote = (WiiRemoteRef)getbytes(sizeof(WiiRemoteRec)); // add in 1.0B4 if (x->wiiremote != nil) wiiremote_init(x->wiiremote);

1 0

externals/pureunity README,1.2,1.3
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/externals/pureunity In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv28702 Modified Files: README Log Message: some notes that I added a long time ago, plus some notes from two weeks ago. Index: README =================================================================== RCS file: /cvsroot/pure-data/externals/pureunity/README,v retrieving revision 1.2 retrieving revision 1.3 diff -C2 -d -r1.2 -r1.3 *** README 13 Jan 2006 04:54:08 -0000 1.2 --- README 3 Jan 2007 00:44:28 -0000 1.3 *************** *** 403,412 **** > tests won't tell you this. ! I once called unit-tests "test-by-example" and contracts "test-by-rule". I ! think that those names are preferable to the more common names. I also had ! listed "test-by-use" which is to use the software in practice: this may ! include testing a component A using the unit tests for B because B uses A. ! The last I had listed was "test-by-proof", which is rarer and is the only ! one that requires analysing the implementation. > > One limitation of documentation is that it has no enforcement power, --- 403,407 ---- > tests won't tell you this. ! [...] > > One limitation of documentation is that it has no enforcement power, *************** *** 420,443 **** that it was the contracts that acted as documentation! ! I've thought of a triad: ! ! A. "the real thing" ! B. what it's documented as ! C. a way to verify that (1) and (2) agree ! ! and another one: ! ! changing A to match B+C: ! programming ! ! changing B to match A+C: ! the scientific method (aka reverse engineering) ! ! changing C to match A+B: ! unit-tests and contracts and scientific experiments ! ! _ _ __ ___ _____ ________ _____________ _____________________ ... ! | Mathieu Bouchard - tél:+1.514.383.3801 - http://artengine.ca/matju ! | Freelance Digital Arts Engineer, Montréal QC Canada +-+-+--+---+-----+--------+-------------+---------------------+ --- 415,419 ---- that it was the contracts that acted as documentation! ! [...] +-+-+--+---+-----+--------+-------------+---------------------+ *************** *** 481,482 **** --- 457,594 ---- +-+-+--+---+-----+--------+-------------+---------------------+ + Date: Fri, 13 Jan 2006 17:19:41 +0900 + From: Mathieu Bouchard <matju(a)artengine.ca> + Reply-To: ruby-core(a)ruby-lang.org + To: ruby-core(a)ruby-lang.org + Subject: Re: Design contracts and refactoring (was Re: mathn: ugly warnings) + + [...] + + In order to entrench the tests-as-documentation habit firmly in the Ruby + community, we need a catchy acronym. Like RTFUT = Read the Fabulous Unit + Tests! + + +-+-+--+---+-----+--------+-------------+---------------------+ + http://lists.puredata.info/pipermail/pd-dev/2006-01/005920.html + Date: Fri, 20 Jan 2006 23:52:22 -0500 (EST) + From: Mathieu Bouchard <matju(a)artengine.ca> + To: pd-dev <pd-dev(a)iem.at> + Subject: macros and such (was: pd-lib, SIMD) + + [...] + + I think that the Pd source doesn't use nearly enough macros or other + code-reducing tricks. + + The reduction of code isn't so much about making things use less RAM: the + RAM excuse is quickly evaporating as even the tiniest computers come with + plenty of RAM and even the faster kinds of RAM come in ever more copious + amounts (big caches). + + The reduction of code is programmer-oriented. I'm not talking about length + of identifiers here (this is a separate issue). Every line of code should + do something interesting by itself. Code should read like a good story and + not like a car. Ever tried to read a car? It's boring. The same damn + piston copy-pasted 12 times. + + The reduction of code is also documentation-oriented. Once the programmer + has been contaminated with the wisdom required to make small code or + understand small code, then why wouldn't the programmer explain it to his + students in higher-level terms instead of chanting 12 times the same + piston as if it were a marathon of Hail-Marys ? + + This is why Pd needs a taxonomy of object classes. If I don't get that + taxonomy in Pd itself nor in its help files, at least I'll have it in its + unit tests. + + Once and only once. + Once and only once. + Once and only once. + Three strikes and you refactor. + for x in [1,2,3] say: Once and only once + + http://c2.com/cgi/wiki/?ThreeStrikesAndYouRefactor + + BTW I'm not talking about only inheritance of implementations. The most + important thing to me is inheritance of expectations, so that if I name + 100 classes that obey the rule "Operator2", then you have just learned + something common about 100 classes. + + Operator2 means right-inlet is cold, left-inlet is hot, there is a "set" + method for using left-inlet as cold, there is a "bang" for explicitly + activating the main computation. The main computation only produces one + message. That's what "Operator2" means in my taxonomy, and it's that much + that hasn't to be stated explicitly in each help patch. + + Help patches can be abstractions to be used to by other help patches. Just + put a [operator2-help] object in your help patch to indicate that the + currently documented class obeys the standard operator2 rules. + + Who's against it? + + +-+-+--+---+-----+--------+-------------+---------------------+ + http://lists.puredata.info/pipermail/pd-list/2006-02/035169.html + Date: Sat Feb 4 21:22:29 CET 2006 + From: Mathieu Bouchard <matju(a)artengine.ca> + To: pd-list + + * Previous message: [PD] dealing with arguments and inlets + * Next message: [PD] Re: [PD-announce] A new version of FFTease is now available for Pd + * Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] + + On Fri, 3 Feb 2006, Hans-Christoph Steiner wrote: + + > The way I have been thinking is that the first inlet is the general + > inlet, and it can accept many types of messages. Then the second inlet + > lines up with the first argument, the third inlet to the second + > argument, etc. + + I agree. Many objects obey the rule that the k'th inlet matches argument + $k for several arguments in a row, usually all of them. + + > I think this is pretty clean and flexible, and I think + > it would be nice to have some kind of standard for this. + + And the best way to make sure people are following a standard is to make + it so easy to follow that it's harder to not follow it than to follow it. + Of course I don't mean adding hurdles to doing it otherwise, but rather + make a shortcut for those who follow the standard. Short of this, people + who make abstractions/externals can get a friendly reminder, from someone + who cares, that it would be better if they followed the standard. + + > Obviously, it doesn't work for all objects, but I think it would be good to + > standardize on objects it does work for. + + PureUnity's goal (when I work on it) is to design a taxonomy that + separates objects that obey certain properties, from those that don't, + because that's a way to reuse tests, but also because certainly it doesn't + hurt documentation either, and it's even better if it can influence how + abstractions are made. + + _ _ __ ___ _____ ________ _____________ _____________________ ... + | Mathieu Bouchard - tÃ©l:+1.514.383.3801 - http://artengine.ca/matju + | Freelance Digital Arts Engineer, MontrÃ©al QC Canada + + +-+-+--+---+-----+--------+-------------+---------------------+ + From matju(a)artengine.ca on Dec 18, 2006 + + I thought up some kind of classification of type systems, avoiding to call + them strong/weak or static/dynamic because those words are confusing. + + 1. Typed expressions: each piece of code that can give a value, has a + type that can be figured out at compile-time. + + 2. Typed variables/parameters: declarations allow runtime checks but not + compile-time checks. + + 3. Typed values: variables don't have types, they can contain any value, + but every value has a type. + + 4. Typed uses: values don't have types, a type is a way of using a value. + + Strictness, in the sense of forbidding things to the user, is not on that + scale, it's another aspect. A well-balanced strictness allows one to + bypass the system whenever needed, but without being too error-prone. + + However it's difficult to say what it means to "bypass the system" for all + four typing categories at once, or even within one category.

1 0

pd/src desire.tk,1.1.2.600.2.149,1.1.2.600.2.150
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv25347 Modified Files: Tag: desiredata desire.tk Log Message: fix for deleting [*] Index: desire.tk =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/desire.tk,v retrieving revision 1.1.2.600.2.149 retrieving revision 1.1.2.600.2.150 diff -C2 -d -r1.1.2.600.2.149 -r1.1.2.600.2.150 *** desire.tk 3 Jan 2007 00:29:55 -0000 1.1.2.600.2.149 --- desire.tk 3 Jan 2007 00:34:30 -0000 1.1.2.600.2.150 *************** *** 7620,7624 **** def Box deconstruct {} { global fields ! if {[array names fields $@pdclass] == ""} { return [concat [list #X obj $@x1 $@y1] $@text] } { --- 7620,7624 ---- def Box deconstruct {} { global fields ! if {[array names -exact fields $@pdclass] == ""} { return [concat [list #X obj $@x1 $@y1] $@text] } {

1 0

pd/src desire.tk,1.1.2.600.2.148,1.1.2.600.2.149
by Mathieu Bouchard 03 Jan '07

03 Jan '07

Update of /cvsroot/pure-data/pd/src In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv23448 Modified Files: Tag: desiredata desire.tk Log Message: renamed @undo_q,@redo_q to @undo_stack,@redo_stack Index: desire.tk =================================================================== RCS file: /cvsroot/pure-data/pd/src/Attic/desire.tk,v retrieving revision 1.1.2.600.2.148 retrieving revision 1.1.2.600.2.149 diff -C2 -d -r1.1.2.600.2.148 -r1.1.2.600.2.149 *** desire.tk 2 Jan 2007 13:30:17 -0000 1.1.2.600.2.148 --- desire.tk 3 Jan 2007 00:29:55 -0000 1.1.2.600.2.149 *************** *** 311,324 **** def History init {} { super ! set @undo_q {} ! set @redo_q {} } ! def History can_undo? {} {return [expr [llength @undo_q] > 0]} ! def History can_redo? {} {return [expr [llength @redo_q] > 0]} def History next_undo_name {} {return stuff} def History next_redo_name {} {return stuff} ! def History undo_q {} {return $@undo_q} ! def History redo_q {} {return $@redo_q} # overload this if you want to control how many levels --- 311,324 ---- def History init {} { super ! set @undo_stack {} ! set @redo_stack {} } ! def History can_undo? {} {return [expr [llength @undo_stack] > 0]} ! def History can_redo? {} {return [expr [llength @redo_stack] > 0]} def History next_undo_name {} {return stuff} def History next_redo_name {} {return stuff} ! def History undo_stack {} {return $@undo_stack} ! def History redo_stack {} {return $@redo_stack} # overload this if you want to control how many levels *************** *** 326,337 **** # keep in mind that undo information is kept hierarchically. def History add {message} { ! lappend @undo_q [list do $message [lrange [info level -3] 1 end]] ! set @redo_q {} $self changed } def History can't {} { ! lappend @undo_q [list can't {} [lrange [info level -3] 1 end]] ! set @redo_q {} $self changed } --- 326,337 ---- # keep in mind that undo information is kept hierarchically. def History add {message} { ! lappend @undo_stack [list do $message [lrange [info level -3] 1 end]] ! set @redo_stack {} $self changed } def History can't {} { ! lappend @undo_stack [list can't {} [lrange [info level -3] 1 end]] ! set @redo_stack {} $self changed } *************** *** 340,351 **** def History undo {} { global errorInfo ! if {![$self can_perform? [lindex $@undo_q end]]} {error "Can't undo this!"} ! set backup $@undo_q ! set @undo_q $@redo_q ! set @redo_q {} #set err [catch {$self perform [lindex $backup end]}]; if {$err} {set err $errorInfo} $self perform [lindex $backup end] ! set @redo_q $@undo_q ! set @undo_q [lrange $backup 0 end-1] $self changed #if {$err} {post %s $err; error "undo: $err"} --- 340,351 ---- def History undo {} { global errorInfo ! if {![$self can_perform? [lindex $@undo_stack end]]} {error "Can't undo this!"} ! set backup $@undo_stack ! set @undo_stack $@redo_stack ! set @redo_stack {} #set err [catch {$self perform [lindex $backup end]}]; if {$err} {set err $errorInfo} $self perform [lindex $backup end] ! set @redo_stack $@undo_stack ! set @undo_stack [lrange $backup 0 end-1] $self changed #if {$err} {post %s $err; error "undo: $err"} *************** *** 354,363 **** def History redo {} { global errorInfo ! if {![$self can_perform? [lindex $@undo_q end]]} {error "Can't redo this!"} ! set backup $@redo_q ! set @redo_q {} set err [catch {$self perform [lindex $backup end]}]; if {$err} {set err $errorInfo} $self perform [lindex $backup end] ! set @redo_q [lrange $backup 0 end-1] $self changed #if {$err} {post %s $err; error "redo: $err"} --- 354,363 ---- def History redo {} { global errorInfo ! if {![$self can_perform? [lindex $@undo_stack end]]} {error "Can't redo this!"} ! set backup $@redo_stack ! set @redo_stack {} set err [catch {$self perform [lindex $backup end]}]; if {$err} {set err $errorInfo} $self perform [lindex $backup end] ! set @redo_stack [lrange $backup 0 end-1] $self changed #if {$err} {post %s $err; error "redo: $err"} *************** *** 387,398 **** def History atomically {what code} { global errorInfo ! set ubackup @undo_q; set @undo_q {} ! set rbackup @redo_q; set @redo_q {} set err [catch {uplevel 2 $code}] if {$err} {set err $errorInfo; puts "errorinfo :::: $errorInfo"} ! set atom $@undo_q ! set @undo_q $ubackup ! set @redo_q $rbackup ! lappend @undo_q [list $what $atom [lrange [info level -3] 1 end]] $self changed if {$err} {puts %s $err; error "atomically: $err"} --- 387,398 ---- def History atomically {what code} { global errorInfo ! set ubackup @undo_stack; set @undo_stack {} ! set rbackup @redo_stack; set @redo_stack {} set err [catch {uplevel 2 $code}] if {$err} {set err $errorInfo; puts "errorinfo :::: $errorInfo"} ! set atom $@undo_stack ! set @undo_stack $ubackup ! set @redo_stack $rbackup ! lappend @undo_stack [list $what $atom [lrange [info level -3] 1 end]] $self changed if {$err} {puts %s $err; error "atomically: $err"} *************** *** 440,444 **** icon_downarrow 7 5 "0,127,62,28,8" } { - puts "create bitmap $name" image create bitmap $name -data "#define z_width $w\n#define z_height $h static unsigned char z_bits[] = { $values };" --- 440,443 ---- *************** *** 7579,7584 **** def HistoryDialog notice {args} { .$self.list delete 0 end ! set hist [concat [$@history undo_q] [list "You Are Here"] [lreverse [$@history redo_q]]] ! set k [llength [$@history undo_q]] set i 0 foreach e $hist { --- 7578,7583 ---- def HistoryDialog notice {args} { .$self.list delete 0 end ! set hist [concat [$@history undo_stack] [list "You Are Here"] [lreverse [$@history redo_stack]]] ! set k [llength [$@history undo_stack]] set i 0 foreach e $hist {

1 0

externals/io/hidio hidio.c, 1.17, 1.18 hidio.h, 1.17, 1.18 hidio_windows.c, 1.5, 1.6
by Olaf Matthes 02 Jan '07

02 Jan '07

Update of /cvsroot/pure-data/externals/io/hidio In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv31865 Modified Files: hidio.c hidio.h hidio_windows.c Log Message: added plattform_specific_new and a pointer to my Windows specific stuff in t_hid struct Index: hidio.c =================================================================== RCS file: /cvsroot/pure-data/externals/io/hidio/hidio.c,v retrieving revision 1.17 retrieving revision 1.18 diff -C2 -d -r1.17 -r1.18 *** hidio.c 2 Jan 2007 05:37:06 -0000 1.17 --- hidio.c 2 Jan 2007 22:00:00 -0000 1.18 *************** *** 398,404 **** static void hidio_open(t_hidio *x, t_symbol *s, int argc, t_atom *argv) { - debug_post(LOG_DEBUG,"hid_%s",s->s_name); short new_device_number = get_device_number_from_arguments(argc, argv); t_int started = x->x_started; // store state to restore after device is opened if (new_device_number > -1) --- 398,404 ---- static void hidio_open(t_hidio *x, t_symbol *s, int argc, t_atom *argv) { short new_device_number = get_device_number_from_arguments(argc, argv); t_int started = x->x_started; // store state to restore after device is opened + debug_post(LOG_DEBUG,"hid_%s",s->s_name); if (new_device_number > -1) *************** *** 555,562 **** x->x_delay = DEFAULT_DELAY; for(i=0; i<MAX_DEVICES; ++i) last_execute_time[i] = 0; ! #ifdef _WIN32 ! x->x_fd = INVALID_HANDLE_VALUE; ! #endif /* _WIN32 */ ! x->x_device_number = get_device_number_from_arguments(argc, argv); --- 555,561 ---- x->x_delay = DEFAULT_DELAY; for(i=0; i<MAX_DEVICES; ++i) last_execute_time[i] = 0; ! #ifdef _WINDOWS ! x->x_hid_device = hidio_platform_specific_new(x); ! #endif x->x_device_number = get_device_number_from_arguments(argc, argv); Index: hidio.h =================================================================== RCS file: /cvsroot/pure-data/externals/io/hidio/hidio.h,v retrieving revision 1.17 retrieving revision 1.18 diff -C2 -d -r1.17 -r1.18 *** hidio.h 2 Jan 2007 20:45:40 -0000 1.17 --- hidio.h 2 Jan 2007 22:00:00 -0000 1.18 *************** *** 83,87 **** #endif #ifdef _WIN32 ! HANDLE x_fd; #endif #ifdef __linux__ --- 83,87 ---- #endif #ifdef _WIN32 ! void *x_hid_device; #endif #ifdef __linux__ *************** *** 187,191 **** extern void hidio_print(t_hidio* x); /* print info to the console */ extern void hidio_platform_specific_info(t_hidio* x); /* device info on the status outlet */ ! extern void hidio_platform_specific_free(t_hidio *x); extern short get_device_number_by_id(unsigned short vendor_id, unsigned short product_id); /* TODO: this function should probably accept the single unsigned for the combined usage_page and usage, instead of two separate variables */ --- 187,192 ---- extern void hidio_print(t_hidio* x); /* print info to the console */ extern void hidio_platform_specific_info(t_hidio* x); /* device info on the status outlet */ ! extern void hidio_platform_specific_free(t_hidio *x); ! extern void *hidio_platform_specific_new(t_hidio *x); extern short get_device_number_by_id(unsigned short vendor_id, unsigned short product_id); /* TODO: this function should probably accept the single unsigned for the combined usage_page and usage, instead of two separate variables */ *************** *** 195,200 **** /* cross-platform force feedback functions */ ! extern void hidio_ff_autocenter(t_hidio *x, t_float value); ! extern void hidio_ff_gain(t_hidio *x, t_float value); extern t_int hidio_ff_motors(t_hidio *x, t_float value); extern t_int hidio_ff_continue(t_hidio *x); --- 196,201 ---- /* cross-platform force feedback functions */ ! extern t_int hidio_ff_autocenter(t_hidio *x, t_float value); ! extern t_int hidio_ff_gain(t_hidio *x, t_float value); extern t_int hidio_ff_motors(t_hidio *x, t_float value); extern t_int hidio_ff_continue(t_hidio *x); Index: hidio_windows.c =================================================================== RCS file: /cvsroot/pure-data/externals/io/hidio/hidio_windows.c,v retrieving revision 1.5 retrieving revision 1.6 diff -C2 -d -r1.5 -r1.6 *** hidio_windows.c 2 Jan 2007 20:45:40 -0000 1.5 --- hidio_windows.c 2 Jan 2007 22:00:00 -0000 1.6 *************** *** 25,34 **** #include <winbase.h> #include <stdio.h> ! #include <setupapi.h> ! ! /* ! * Please note that this file needs the Microsoft Driver Developent Kit (DDK) ! * to be installed in order to compile! ! */ #ifdef _MSC_VER [...1245 lines suppressed...] + + if (self) + freebytes(self, sizeof(t_hid_device)); + } + void *hidio_platform_specific_new(t_hidio *x) + { + t_hid_device *self; + + debug_print(LOG_DEBUG,"hidio_platform_specific_new"); + + /* alloc memory for our instance */ + self = (t_hid_device *)getbytes(sizeof(t_hid_device)); + self->fh = INVALID_HANDLE_VALUE; + + return (void *)self; /* return void pointer to our data struct */ + } #endif /* _WINDOWS */

1 0

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

Pd-cvs January 2007