aboutsummaryrefslogtreecommitdiff
path: root/src/listfind.c
diff options
context:
space:
mode:
authorIOhannes m zmölnig <zmoelnig@users.sourceforge.net>2007-07-26 10:24:38 +0000
committerIOhannes m zmölnig <zmoelnig@users.sourceforge.net>2007-07-26 10:24:38 +0000
commitb19be3cca1a839593c952e0bb17b11119a2e6436 (patch)
treeff255d73c29de722ac1fcc2d30d0f02dcbc5d785 /src/listfind.c
parent17bbb7ac85846bcc2c29ec382013711c13dc6fa0 (diff)
added more list operating objects
svn path=/trunk/externals/zexy/; revision=8246
Diffstat (limited to 'src/listfind.c')
-rw-r--r--src/listfind.c200
1 files changed, 200 insertions, 0 deletions
diff --git a/src/listfind.c b/src/listfind.c
new file mode 100644
index 0000000..693181f
--- /dev/null
+++ b/src/listfind.c
@@ -0,0 +1,200 @@
+/******************************************************
+ *
+ * zexy - implementation file
+ *
+ * copyleft (c) IOhannes m zmölnig
+ *
+ * 1999:forum::für::umläute:2004
+ *
+ * institute of electronic music and acoustics (iem)
+ *
+ ******************************************************
+ *
+ * license: GNU General Public License v.2
+ *
+ ******************************************************/
+
+/* 2607:forum::für::umläute:2007 */
+
+
+#include "zexy.h"
+#include <string.h>
+
+//#define DEBUG
+
+#ifdef DEBUG
+# define DEBUGFUN(x) x
+#else
+# define DEBUGFUN(x)
+#endif
+
+
+/* ------------------------- listfind ------------------------------- */
+
+/* find a sublist in a list and return the index of the occurence (or indices if there are more) */
+
+static t_class *listfind_class;
+
+
+typedef struct _listfind
+{
+ t_object x_obj;
+ t_outlet *x_outlet;
+
+ int x_n;
+
+ t_inlet*x_listin;
+ int x_argc;
+ t_atom *x_argv;
+} t_listfind;
+
+
+
+static void listfind_list2(t_listfind*x,t_symbol*s, int argc, t_atom*argv)
+{
+ if(x->x_argv!=0) {
+ freebytes(x->x_argv, sizeof(t_atom)*x->x_argc);
+ }
+ x->x_argc=0;
+ x->x_argv=0;
+
+ DEBUGFUN(post("list of length %d", argc));
+
+ if(argc>0) {
+ int i;
+ x->x_argc=argc;
+ x->x_argv=(t_atom*)getbytes((x->x_argc)*sizeof(t_atom));
+ for(i=0; i<argc; i++) {
+ x->x_argv[i]=argv[i];
+ }
+ }
+
+ DEBUGFUN(post("list2: %d %x", x->x_argc, x->x_argv));
+}
+
+static int atom_equals(t_atom*a1, t_atom*a2) {
+ if(a1->a_type!=a2->a_type) return 0;
+
+ return(a1->a_w.w_symbol==a2->a_w.w_symbol);
+}
+
+static int list_equals(int count, t_atom*a1, t_atom*a2) {
+ int i=0;
+ for(i=0; i<count; i++, a1++, a2++) {
+ if(a1->a_type!=a2->a_type)
+ return 0;
+ if(a1->a_w.w_symbol!=a2->a_w.w_symbol) // is it that simple?
+ return 0;
+ }
+ return 1;
+}
+
+static int listfind_find(int argc, t_atom*argv, int matchc, t_atom*matchv) {
+ int i=0;
+
+ if(matchc>argc)
+ return -1;
+ if(matchc==0)
+ return 0;
+
+ for(i=0; i<=(argc-matchc); i++, argv++) {
+ if(list_equals(matchc, argv, matchv))
+ return i;
+ }
+ return -1;
+}
+
+static void listfind_doit(t_outlet*out, int longcount, t_atom*longlist, int patterncount, t_atom*patternlist) {
+ int count=0;
+ int index;
+ int offset=0;
+
+ t_atom*ap=0;
+ int length=1+((patterncount>0)?(longcount/patterncount):longcount); /* we shan't have more hits than this! */
+ if(length<1) {
+ outlet_bang(out);
+ }
+ ap=(t_atom*)getbytes(length*sizeof(t_atom));
+
+ DEBUGFUN(post("expecting no more than %d results", length));
+
+ while((index=listfind_find(longcount-offset, longlist+offset, patterncount, patternlist))>=0) {
+ offset+=index;
+ SETFLOAT(ap+count, offset);
+
+ count++;
+
+ DEBUGFUN(post("new offset=%d", offset));
+ offset++; // proceed to the next element
+ }
+
+ DEBUGFUN(post("got %d results", count));
+
+ outlet_list(out, gensym("list"), count, ap);
+ freebytes(ap, length*sizeof(t_atom));
+}
+
+static void listfind_list(t_listfind *x, t_symbol *s, int argc, t_atom *argv)
+{
+#if 0
+ /* entire list hot:
+ * this is more intuitive when searching a pattern in many lists
+ */
+ listfind_doit(x->x_obj.ob_outlet, argc, argv, x->x_argc, x->x_argv);
+
+#else
+
+ /* pattern is hot
+ * this is compatible with foobar's [list-find]
+ * this is more intuitive when searching different patterns in a list
+ */
+ listfind_doit(x->x_obj.ob_outlet, x->x_argc, x->x_argv, argc, argv);
+
+#endif
+
+ /* personally i think that searching 1 pattern in many lists is more useful */
+}
+
+static void listfind_free(t_listfind *x)
+{
+ if(x->x_argv) {
+ freebytes(x->x_argv, x->x_argc*sizeof(int));
+ x->x_argv=0;
+ x->x_argc=0;
+ }
+ inlet_free(x->x_listin);
+
+}
+
+static void *listfind_new(t_symbol *s, int argc, t_atom *argv)
+{
+ t_listfind *x = (t_listfind *)pd_new(listfind_class);
+ ZEXY_USEVAR(s);
+
+ outlet_new(&x->x_obj, 0);
+ x->x_listin=inlet_new(&x->x_obj, &x->x_obj.ob_pd, gensym("list"), gensym("lst2"));
+
+ x->x_argc=0;
+ x->x_argv=0;
+
+ listfind_list2(x, gensym("list"), argc, argv);
+
+ return (x);
+}
+
+
+static void listfind_help(t_listfind*x)
+{
+ post("\n%c listfind\t\t:: split lists into multiple sublists based on matches", HEARTSYMBOL);
+}
+
+void listfind_setup(void)
+{
+ listfind_class = class_new(gensym("listfind"), (t_newmethod)listfind_new,
+ (t_method)listfind_free, sizeof(t_listfind), 0, A_GIMME, 0);
+ class_addlist (listfind_class, listfind_list);
+ class_addmethod (listfind_class, (t_method)listfind_list2, gensym("lst2"), A_GIMME, 0);
+
+ class_addmethod(listfind_class, (t_method)listfind_help, gensym("help"), A_NULL);
+ zexy_register("listfind");
+}