X-Git-Url: http://git.harvie.cz/?a=blobdiff_plain;f=cll1.h;h=356d70d716d3ce295dc8af6293917e40d9e22830;hb=a3c2aecbff1dd82a26f3a69a3e1fdc04349b8d7a;hp=c32debdf41c899e43b4aa8a2301090549fd4a979;hpb=f57259369784a5df46b75488d50e431ed1741235;p=svn%2FCll1h%2F.git

diff --git a/cll1.h b/cll1.h
index c32debd..356d70d 100644
--- a/cll1.h
+++ b/cll1.h
@@ -1,6 +1,6 @@
-/* ,-----------------------------------------------------------------------
-  /  C<<1 header file - C language style sheet - GNU C/ANSI C99 compliant
- /  Cumbersome Extraction and Report Language - http://cll1h.arachne.cz/  /
+   /* .---------------------------------------------------------------------.
+  /  C<<1 header file - C language style sheet - GNU C/ANSI C99 compliant 
+ /  Cumbersome Extraction and Report Language - http://cll1h.arachne.cz/ 
 '---------------------------------------------------------------------- */
 /*
    Copyright (c) 2004-2008 Michael xChaos Polak - x(at)n.cz
@@ -18,13 +18,11 @@
    You should have received a copy of the GNU Lesser General Public License
    along with C<<1 header file; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
-
 */
-
 #ifndef _CLL1_H
 #define _CLL1_H
 #define CLL1H_VERSION "0.7.1"
-/* ,-----------------------------------------------------------------------
+/* .----------------------------------------------------------------------.
   /  0. Library definitions not parsed by @CC, updated 2008-01-26 xCh.
  '---------------------------------------------------------------------- */
 /*
@@ -33,167 +31,275 @@
 @define USE_PREPROCESSOR cake *.html *.xml > _include.c
 @define USE_POSTPROCESSOR strip @
 */
-/* ,-----------------------------------------------------------------------
+/* .----------------------------------------------------------------------.
   /  1. C<<1 header auto include, updated 2008-01-26 xCh.
  '---------------------------------------------------------------------- */
+#ifndef DISABLE_MODULE_AUTOINCLUDE
 #include <string.h>
+#include <strings.h>
 #include <malloc.h>
 #include <time.h>
 #include <stdlib.h>
 #include <stdarg.h>
 #include <unistd.h>
-#ifdef USE_LIBRARY_MYSQL
-#include <mysql/mysql.h>
-#endif
+#include <locale.h>
 #ifdef USE_LIBRARY_FASTCGI
 #include <fcgi_stdio.h>
 #else
 #include <stdio.h>
 #endif
-/* ,-----------------------------------------------------------------------
-  /  2. C<<1 then buddhist section, updated 2008-01-26 xCh.
+#endif
+#ifdef USE_LIBRARY_MYSQL
+#include <mysql/mysql.h>
+#endif
+/* .----------------------------------------------------------------------.
+  /  0. C<<1 typedefs and public gloabl variables, updated 2008-02-03 xCh.
+ '----------------------------------------------------------------------- */
+typedef char * str; /* #ifdef USE_MODULE_UNICODE...typedef wchar_t * str; */
+typedef unsigned char * buf; /* this will be always 8-bit usigned char *  */
+typedef FILE * file;
+typedef int bool;
+extern  str NIL,EOL,OFS,IFS;
+extern  unsigned RANDOM_SEED;
+#define _EXPORT_GLOBALS str NIL="(null)", EOL="\n", OFS=" ", IFS=" \t\n", LANG=NULL; unsigned RANDOM_SEED=0;
+/* .----------------------------------------------------------------------.
+  /  1. C<<1 then buddhist section, updated 2008-02-04 xCh.
  '----------------------------------------------------------------------- */
 #ifndef DISABLE_MODULE_THEN_BUDDHISM 
 #define then
-#define MAYBE (int)((RANDOM_SEED?random():(RANDOM_SEED=time(NULL),srandom(RANDOM_SEED),random()))%2)
-#define WHOKNOWS (int)(srandom(time(NULL)),random()%2)
-#define Create_var(ID,TYPE,INIT) TYPE ID=INIT
-#define Define_var(ID,TYPE) TYPE ID
+#define MAYBE (int)((long)(RANDOM_SEED?random():((RANDOM_SEED=(unsigned)time(NULL)),srandom(RANDOM_SEED),random()))%2)
+#define WHOKNOWS (int)(srandom((unsigned)time(NULL)),random()%2)
+#define for_samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next)
+#define samsara(MIND,SOUL) for(MIND=SOUL; MIND || ((MIND->__next=SOUL),0) ; MIND=MIND->__next)
+//#define atob(EXPR) (word_in_stri(YES,(EXPR))?1:0)
+//#define _EXPORT_YES str YES="TRUE\nYES\nJA\nOUI\nDA\nANO\nY\n1";
+//#else
+#define atob(EXPR) (eqi((EXPR),YES)?TRUE:FALSE)
+#define _EXPORT_YES str YES="TRUE";
 #endif
-/* ,-----------------------------------------------------------------------
-  /  3. C<<1 constants and optional keywords, updated 2008-01-26 xCh.
+/* .----------------------------------------------------------------------.
+  /  2. C<<1 almost then buddhist section, updated 2008-02-02 xCh.
  '----------------------------------------------------------------------- */
 #define not !
 #define and &&
 #define or ||
-#define boolean int
-#define bool_str(VALUE) ((VALUE)?"TRUE":"FALSE")
 #define TRUE 1
 #define FALSE 0
-#define coalesce(VAR,NOTNULL) (VAR?VAR:(NOTNULL))
-#define mem struct
-#define construct struct
-#define _GLOBALS time_t RANDOM_SEED=0; char *EOL="\n", *OFS=" ", *IFS=" \t\n", *NIL="NULL";
-/* ,-----------------------------------------------------------------------
-  /  4. C<<1 data declaration and allocation, updated 2008-01-07 xCh.
+#define PI 3.141592654
+#define WEIRDINT (1<<(sizeof(int)*8-1))
+#define btoa(EXPR) ((EXPR)?"TRUE":"FALSE")
+#define coalesce(VAR,EXPR) (VAR?VAR:(VAR=0,(EXPR)))
+#define coalesce_str(VAR,EXPR) (VAR && *VAR?VAR:((VAR=NULL),(EXPR)))
+/* .----------------------------------------------------------------------.
+  /  4. C<<1 data declaration and allocation, updated 2008-01-31 xCh.
  '----------------------------------------------------------------------- */
-#define Create_str(ID,INIT) char *ID=INIT
-#define Define_str(ID) char *ID=NULL
-#define Create_mem(ID,...) struct _ARG1(__VA_ARGS__,) *ID=get_mem(__VA_ARGS__)
-#define Define_mem(ID,TYPE) struct TYPE *ID=NULL
-#define Define_mems(ID1,ID2,TYPE) Define_mem(ID1,TYPE); Define_mem(ID2,TYPE)
-#define Create_list(ID1,I2,TYPE) Create_mem(ID1,TYPE); struct TYPE *ID2=((ID1->__next=NULL),ID1)
-#define Define_var(ID,TYPE) TYPE ID
-#define list(TYPE) struct TYPE *__next
-#define tree(TYPE) struct TYPE *__next;struct TYPE *__seek
-#define dictionary(TYPE) tree(TYPE);char *__key
-#define array(TYPE) tree(TYPE);char *__key
-#define interface(TYPE) struct TYPE *__interface
-#define get_mem(...) (struct _ARG1(__VA_ARGS__,)*)_cll1_malloc(sizeof(struct _ARG1(__VA_ARGS__,)),NULL)
-#define get_str(...) (char *)_cll1_get_str(__VA_ARGS__,(void *)&_cll1_get_str)
-/* ,-----------------------------------------------------------------------
+#define def_mem(TYPE) typedef struct _##TYPE##_t * TYPE; struct  _##TYPE##_t 
+#define get_mem(TYPE) _GET_MEM(TYPE)
+#define get_buf(SIZE) (buf)malloc(SIZE) /* temporary solution */
+#define size_of_mem(TYPE) sizeof(struct _##TYPE##_t)
+#define copy_of_mem(TYPE,SRC) _cll1_mem_cpy(sizeof(struct _##TYPE##_t),SRC)
+#define list(TYPE) TYPE __next
+#define tree(TYPE) TYPE __next; TYPE __seek
+#define dict(TYPE) tree(TYPE); str __key
+#define array(TYPE) tree(TYPE); int __key
+/* variable declarators */
+#define Get_mem(ID,TYPE) TYPE ID=get_mem(TYPE)
+#define Get_buf(ID,SIZE) buf ID=get_buf(SIZE)
+/* .----------------------------------------------------------------------.
   /  5. C<<1 string manipulation, updated 2008-01-26 xCh.
  '----------------------------------------------------------------------- */
-#define eq(A,B) !strcmp(A,B)
-#define eqi(A,B) !strcasecmp(A,B)
-#define print(...) _cll1_print(__VA_ARGS__,(void *)&_cll1_print)
-#define fprint(...) _cll1_fprint(__VA_ARGS__,(void *)&_cll1_fprint)
-#define file_print(...) _cll1_fprint(_F,__VA_ARGS__,(void *)&_cll1_fprint)
-#define echo(...) _cll1_echo(__VA_ARGS__,(void *)&_cll1_echo)
-#define fecho(...) _cll1_fecho(__VA_ARGS__,(void *)&_cll1_fecho)
-#define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,(void *)&_cll1_fecho)
-/* ,-----------------------------------------------------------------------
+#define get_str(...) _cll1_get_str(__VA_ARGS__,NIL)
+#define eq(A,B) (!_cll1_str_cmp(A,B))
+#define eqi(A,B) (!_cll1_str_cmpi(A,B))
+#define str_order(A,B) _cll1_str_coll(A,B)
+#define str_ascii(A,B) _cll1_str_cmp(A,B)
+#define chars_in_str(...) _cll1_strlen(__VA_ARGS__,NIL)
+#define size_of_str(A) mbstowcs(NULL,A,0)
+#define str_in(A,B) _cll1_str_str(A,B)
+#define word_in(A,B) _cll1_wordinstr(A,B,0)
+#define print(...) _cll1_print(__VA_ARGS__,NIL)
+#define fprint(...) _cll1_fprint(__VA_ARGS__,NIL)
+#define file_print(...) _cll1_fprint(_F,__VA_ARGS__,NIL)
+#define echo(...) _cll1_echo(__VA_ARGS__,NIL)
+#define fecho(...) _cll1_fecho(__VA_ARGS__,NIL)
+#define file_echo(...) _cll1_fecho(_F,__VA_ARGS__,NIL)
+#define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
+#define prefix(A,B,C) ((A=B),((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
+#define tr(STR,B,C) _NEW(S,STR) while(S && *_S) { if(*_S==B)*_S=C; /* <-' */ _S++; }
+/* variable declarators */
+#define Get_str(ID,...) str ID=get_str(__VA_ARGS__)
+/* .----------------------------------------------------------------------.
   /  6. C<<1 data container manipulation, updated 2008-01-26 xCh.
  '----------------------------------------------------------------------- */
-#define push(NODE,HEAD) ((NODE && NODE!=HEAD)?((NODE->__next=HEAD),(HEAD=NODE)):(HEAD=NODE))
-#define pop(NODE,HEAD) (HEAD?((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)):(NODE=NULL))
-#define append(NODE,HEAD) if(HEAD) { void *N=NODE; /**/ NODE->__next=NULL; for_search(NODE,HEAD,!NODE->__next) {NODE->__next=N; break;} else push(NODE,HEAD); }
-#define remove(NODE,HEAD,EXPR) { void **_D=NULL; /**/ for_search(NODE,HEAD,EXPR) { if(_D)*_D=NODE->__next; else HEAD=NODE->__next; free(NODE); } else _D=(void *)&(NODE->__next); }
+#define push(NODE,HEAD) ( NODE ? ((NODE->__next=HEAD),(HEAD=NODE)) : NULL )
+#define pop(NODE,HEAD) ( HEAD ? ((NODE=HEAD->__next),free(HEAD),(HEAD=NODE)) : (NODE=NULL) )
+#define append(NODE,HEAD) { void *_PTR=NODE; if(NODE) NODE->__next=NULL; if(HEAD) { for_search(NODE,HEAD,!NODE->__next) { NODE->__next=_PTR; break; } } else HEAD=NODE; }
+#define remove(NODE,HEAD,EXPR) { void **_D=NULL; /* <-' */ for_search(NODE,HEAD,EXPR) { if(_D)*_D=NODE->__next; else HEAD=NODE->__next; free(NODE); } else _D=(void *)&(NODE->__next); }
 #define drop(NODE,HEAD) for( NODE=HEAD; NODE || (HEAD=NULL); HEAD=NODE, NODE=NODE->__next, free(HEAD) )
-//to do seek
-//to do store
-#define order_by(K1,K2) (K1>K2)
-#define desc_order_by(K1,K2) (K1<K2)
-#define sort_by(K1,K2) (strcasecmp(K1, K2)>0)
-#define desc_sort_by(K1,K2) (strcasecmp(K1, K2)<0)
-#define ascii_by(K1,K2) (strcmp(K1, K2)>0)
-#define desc_ascii_by(K1,K2) (strcmp(K1, K2)<0)
-#define insert(NODE,HEAD,EXP,K) { if(HEAD) { void **_L=NULL, *H=HEAD; /**/ for_search(HEAD,H,EXP(HEAD->K,NODE->K)) { if(_L) {*_L=NODE; NODE->__next=HEAD; } else push(NODE,H); break; } else _L=(void *)&(HEAD->__next); if(!HEAD)*_L=NODE; HEAD=H; } else if (NODE) push(NODE,HEAD)->__next=NULL; }
-#define sort(NODE,HEAD,EXP,K) { void *_NEXT; /**/ NODE=HEAD; HEAD=NULL; do { _NEXT=NODE->__next; NODE->__next=NULL; insert(NODE,HEAD,EXP,K); NODE=_NEXT; } while(_NEXT); }
-/* ,-----------------------------------------------------------------------
+//to do: seek
+//to do: store
+#define count(NODE,HEAD,VAR) { _NEW(I,0) for(NODE=HEAD; NODE || ((VAR=_I),0) ; (NODE=NODE->__next)?(_I++):0 ); }
+#define order_by_int(K1,K2) (K1>K2)
+#define order_by_int_desc(K1,K2) (K1<K2)
+#define order_by_str(K1,K2) (str_order(K1,K2)>0)
+#define order_by_str_desc(K1,K2) (str_order(K1,K2)<0)
+#define order_by_ascii(K1,K2) (str_ascii(K1,K2)>0)
+#define order_by_ascii_desc(K1,K2) (str_ascii(K1,K2)<0)
+#define insert(NODE,HEAD,ORDERBY,KEY) { if(HEAD) { void **_L=NULL, *H=HEAD; /* <-' */ for_search(HEAD,H,ORDERBY(HEAD->KEY,NODE->KEY)) { if(_L) {*_L=NODE; NODE->__next=HEAD; } else push(NODE,H); break; } else _L=(void *)&(HEAD->__next); if(!HEAD)*_L=NODE; HEAD=H; } else if (NODE) { push(NODE,HEAD); HEAD->__next=NULL; } }
+#define sort(NODE,HEAD,ORDERBY,KEY) { void *_NEXT; /* <-' */ NODE=HEAD; HEAD=NULL; do { _NEXT=NODE->__next; NODE->__next=NULL; insert(NODE,HEAD,ORDERBY,KEY); NODE=_NEXT; } while(_NEXT); }
+/* .----------------------------------------------------------------------.
   /  7. C<<1 builtin iterators and conditionals, updated 2008-01-26 xCh.
  '----------------------------------------------------------------------- */
 #define loop while(TRUE)
-#define repeat(N) if(N>0) _NEW_I for_range(_I,1,N)
-#define for_range(VAR,FROM,TO) for( VAR=FROM ; FROM<=TO?VAR<=TO:VAR>=TO ; FROM<=TO?VAR++:VAR--)
+#define repeat(N) _NEW(I,0) _NEW(J,N) while(_I++<_J)
+#define for_range(VAR,FROM,TO) _NEW(I,FROM) _NEW(J,TO) for( VAR=_I ; _I<=_J?VAR<=_J:VAR>=_J ; _I<=_J?VAR++:VAR--)
 #define for_each(NODE,HEAD) for(NODE=HEAD; NODE; NODE=NODE->__next)
 #define for_search(NODE,HEAD,EXPR) for_each(NODE,HEAD) if(EXPR)
-#define for_file_lines(STR,F) /* _NEW_F for() */
-#define for_ints(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_ints(_I,__VA_ARGS__,-1))>=0 ; _I++)
-#define for_strs(VAR,...) _NEW_I for( _I=0 ; (VAR=_cll1_it_strs(_I,__VA_ARGS__,(void *)&_cll1_it_strs))!=(void *)&_cll1_it_strs ; _I++)
-#define if_exists(A,B,C) for_search(A,B,C) break; if(A)
-#define for_args _NEW_I for(_I=1;_I<argc;_I++)
-#define if_args if(argc>1)
-#define if_arg(VAL) if(eq(argv[_I],VAL))
+#define for_file_lines(STR,FNAME) /* _NEW(CTX,get_context()) file_read(FNAME) for(use_context(_CTX),STR=file_line(_F);release_context(_M),(*S && !feof(_F));STR=file_line(_F),end_context()) _CATCH */
+#define for_input_lines(S,L) /* _NEW(CTX,get_context()) for(use_context(_CTX),STR=file_get_line(stdin);release_context(_M),(*S && !feof(stdin));STR=file_get_line(stdin)) _CATCH */
+#define for_ints(VAR,...) _NEW(I,0) while( (VAR=_cll1_for_ints(_I++,__VA_ARGS__,WEIRDINT))!=WEIRDINT )
+#define for_strs(VAR,...) _NEW(I,0) while( (VAR=(char *)_cll1_for_ptrs(_I++,__VA_ARGS__,NIL))!=NIL )
+#define for_args(STR) _NEW(I,1) while(_I++<argc)
 #define this_arg argv[_I]
 #define next_arg ((_I+1<argc)?argv[_I]:NULL)
-#define skip_next _I++
-/* ,-----------------------------------------------------------------------
-  /  8. C<<1 va_list based library functions, updated 2008-01-26 xCh.
+#define continue_args _I++
+#define if_exists(NODE,HEAD,EXPR) for_search(NODE,HEAD,EXPR) break; if(NODE)
+#define if_args if(argc>1)
+#define switch_for_args for_args switch_str(this_arg)
+#define switch_str(STR) _NEW(S,STR)
+#define if_case(VAL) if(eq(argv[_I],VAL))
+#define for_fields(FIELD,STR) for_valid_split(FIELD,STR,*OFS)
+#define for_split_str(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL))
+#define for_valid_split(A,B,C) for_split_str(A,B,C) if(*A)
+#define switch_for_columns(A,B,C) _FOR_COLUMNS(A,B,C) switch(__I)
+#define switch_for_valid_columns(A,B,C) _FOR_VALID_COLUMNS(A,B,C) switch (_I)
+#define if_column_number(A,B,C,V) _FOR_COLUMNS(A,B,C) if(_I==V)
+#define if_valid_column_number(A,B,C,V) _FOR_VALID_COLUMNS(A,B,C) if(_I==V)
+/* .----------------------------------------------------------------------.
+  /  8. C<<1 object oriented infrastructure, updated 2008-02-04
  '----------------------------------------------------------------------- */
-#define _ARG1(ARG1,...) ARG1
-#define _MALLOC void *_cll1_malloc(size_t size,...) { /*temporary solution*/ return malloc(size); }
-#define _CLL1_FPRINT(IOSTREAM,LASTARG) { int p2=0;char *ofs=coalesce(OFS,"\0");va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) { if(p2 && *ofs) fputs(ofs,IOSTREAM); else p2=1; fputs(coalesce(s,NIL),IOSTREAM); } va_end(ap); if(EOL && *EOL) fputs(EOL,IOSTREAM); }
-#define _PRINT void _cll1_print(char *s,...) _CLL1_FPRINT(stdout,(void *)&_cll1_print)
-#define _FPRINT void _cll1_fprint(FILE *f,char *s,...) _CLL1_FPRINT(f,(void *)&_cll1_fprint)
-#define _CLL1_FECHO(IOSTREAM,LASTARG) { va_list ap; /**/ for(va_start(ap,s);s!=LASTARG;s=va_arg(ap,char *)) fputs(coalesce(s,NIL),IOSTREAM); va_end(ap); }
-#define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout,(void *)&_cll1_echo)
-#define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f,(void *)&_cll1_fecho)
-#define _IT_INTS int _cll1_it_ints(int i, int n, ...) { int j=0;va_list ap; /**/ va_start(ap,n); while(n>=0 && j++<i) n=va_arg(ap,int); return n; }
-#define _IT_STRS char *_cll1_it_strs(int i, char *s, ...) { int j=0;va_list ap; /**/ va_start(ap,s); while(s!=(void *)&_cll1_it_strs && j++<i) s=va_arg(ap,char *); return s; }
-/* ,-----------------------------------------------------------------------
-  /  9. C<<1 hidden stack infrastructure, updated 2008-01-26 by xCh.
+#define def_type(TYPE) typedef struct  _##TYPE##_t * TYPE;
+#define def_obj(TYPE) struct _##TYPE##_t
+#define interface(TYPE) TYPE __interface
+#define interface_of(SELF) SELF->__interface
+#define method(NAME) (*NAME)
+#define construct(TYPE,INTERFACE) TYPE _init_##TYPE(TYPE o,INTERFACE i) { o->__interface=i; return o; } TYPE __init__##TYPE
+#define get_obj(TYPE,INTERFACE,...) __init__##TYPE(_init_##TYPE(get_mem(TYPE),INTERFACE),__VA_ARGS__)
+#define get_obj_as(COMMUNITY,MEM,INTERFACE,...) (COMMUNITY)get_obj(MEM,INTERFACE,__VA_ARGS__)
+#define _(METHOD,...) ((((_ARG1(__VA_ARGS__,)) || /* will not compile if object is not lvalue: */(_ARG1(__VA_ARGS__,)=NULL)) && (_ARG1(__VA_ARGS__,))->__interface->METHOD)?(*( (_ARG1(__VA_ARGS__,))->__interface->METHOD )) ((void *)__VA_ARGS__):0)
+#define __(METHOD,...) ( _ASSERT(ARG1(__VA_ARGS__,)), (*( __cll1_seekmethod(ARG1(__VA_ARGS__,),METHOD) )) ( __VA_ARGS__ ) )
+#define call(OBJTYPE,METHOD,...) { int _N=0; OBJTYPE _OBJ; /* <-' */ while( (_OBJ=(OBJTYPE)_cll1_for_ptrs(_N++,__VA_ARGS__,NIL))!=(OBJTYPE)NIL ) _(_OBJ,METHOD); }
+#define def_community(TYPE,INTERFACE) def_obj(TYPE) { INTERFACE __interface; };
+#define anonymous void *
+/* variable declarators */
+#define Get_obj(ID,MEM,...) MEM ID=get_obj(MEM,__VA_ARGS__)
+#define Get_obj_as(ID,COMMUNITY,MEM,...) MEM ID=get_obj_as(COMMUNITY,MEM,INTERFACE,__VA_ARGS__)
+#define I_am(SELF,MEM) MEM SELF=(MEM)community
+/* .----------------------------------------------------------------------.
+  /  9. implementation of C<<1 library functions, updated 2008-01-26 xCh.
+ '----------------------------------------------------------------------- */
+/* later... #define _MALLOC void *_cll1_malloc(size_t size) {  return malloc(size); } */
+#define _CLL1_FPRINT(IOSTREAM) { int ofs=0; va_list ap; /* <-' */ for(va_start(ap,s);s!=NIL;s=va_arg(ap,char *)) { if(ofs)fputs(OFS,IOSTREAM);else ofs=1;/**/fputs(coalesce(s,NIL),IOSTREAM); } va_end(ap); fputs(EOL,IOSTREAM); }
+#define _DECLARE_PRINT void _cll1_print(char *s,...)
+#define _PRINT _DECLARE_PRINT _CLL1_FPRINT(stdout)
+#define _DECLARE_FPRINT void _cll1_fprint(FILE *f,char *s,...)
+#define _FPRINT _DECLARE_FPRINT _CLL1_FPRINT(f)
+#define _CLL1_FECHO(IOSTREAM) { va_list ap; /* <-' */ for(va_start(ap,s);s!=NIL;s=va_arg(ap,char *)) fputs(coalesce(s,NIL),IOSTREAM); va_end(ap); }
+#define _ECHO void _cll1_echo(char *s,...) _CLL1_FECHO(stdout)
+#define _FECHO void _cll1_fecho(FILE *f,char *s,...) _CLL1_FECHO(f)
+#define _FOR_INTS int _cll1_for_ints(int i, int n, ...) { int j=0;va_list ap; /* <-' */ va_start(ap,n); while(n!=WEIRDINT && j++<i) n=va_arg(ap,int); return n; }
+#define _FOR_PTRS void *_cll1_for_ptrs(int i, void *v, ...) { int j=0;va_list ap; /* <-' */ va_start(ap,v); while(v!=(void *)NIL && j++<i) v=va_arg(ap,void *); return v; }
+#define _DECLARE_STRCOLL  int _cll1_str_coll(str a, str b)
+#define _STRCOLL _DECLARE_STRCOLL { if(a && b) return strcoll(a,b); else return (int)(a-b); }
+#define _DECLARE_STRCMP int _cll1_str_cmp(str a, str b)
+#define _STRCMP _DECLARE_STRCMP { if(a && b) return strcmp(a,b); else return (int)(a-b); }
+#define _DECLARE_STRCMPI int _cll1_str_cmpi(str a, str b)
+#define _STRCMPI _DECLARE_STRCMPI { if(a && b) return strcasecmp(a,b); else return (int)(a-b); }
+#define _DECLARE_STRSTR str _cll1_str_str(str h, str n) 
+#define _STRSTR _DECLARE_STRSTR { if(h && n) return strstr(h,n); else return NULL; }
+// later... #define _WORDINSTR char *_cll1_wordinstr(char *a,char *b,int ign) { char *IFS=a; for(;a&&*a;a++) for(;*ifs||ifs=IFS;ifs++) if(*a=b);) for    return strcasestr(a,b); else return NULL; }
+extern  _DECLARE_PRINT;
+extern  _DECLARE_FPRINT;
+extern  _DECLARE_STRCOLL;
+extern  _DECLARE_STRCMP;
+extern  _DECLARE_STRCMPI;
+extern  _DECLARE_STRSTR;
+#define _EXPORT_OUTS _PRINT _FPRINT _ECHO _FECHO
+#define _EXPORT_STRS _STRCOLL _STRCMP _STRCMPI _STRSTR //_WORDINSTR
+#define _EXPORT_ARGS _FOR_INTS _FOR_PTRS
+/* .----------------------------------------------------------------------.
+  /  10. C<<1 private infrastructure, updated 2008-02-03 by xCh.
  '----------------------------------------------------------------------- */
-#define _ISTACK struct _IStack { int I; int _23; list(_IStack); } *_Iatom,*_Istack=NULL;
-#define _SSTACK struct _SStack { char *S; int _23; list(_SSTACK); } *_Satom,*_Sstack=NULL;
-#define _FSTACK struct _FStack { FILE *F; int _23; list(_FSTACK); } *_Fatom,*_Fstack=NULL;
-#define _NEW_(ATOM,STACK,TYPE) (ATOM=get_mem(TYPE),ATOM->_23=1,push(ATOM,STACK);ATOM->_23||pop(ATOM,STACK)&&0;ATOM->_23--)
-#define _NEW_I for _NEW_(_Iatom,_Istack,_IStack)
-#define _NEW_S for _NEW_(_Satom,_Sstack,_SStack)
-#define _NEW_F for _NEW_(_Fatom,_Fstack,_FStack)
 #define _I (_Iatom->I)
-#define _S (_Satom->I)
-#define _F (_Satom->F)
-/* ,-----------------------------------------------------------------------
-  /  10. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.  
+#define _J (_Jatom->J)
+#define _S (_Satom->S)
+#define _F (_Fatom->F)
+#define _CTX (_CTXatom->CTX)
+#define _ARG1(ARG1,...) ARG1
+#define _ASSERT(EXPR) assert(EXPR) /* later... _cll1_assert(EXPR,handler) */
+#define _GET_MEM(TYPE) ((TYPE)malloc(sizeof(struct _##TYPE##_t))) /* later... ((TYPE)_cll1_malloc(sizeof(struct _##TYPE##_t))) */
+#define _ANYATOM(TYPE,NAME) def_mem(_##NAME##Atom ) { TYPE NAME; int c; list( _##NAME##Atom ); }
+#define _FOR_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C)||(A=NULL) ),_I++ ) 
+#define _FOR_VALID_COLUMNS(A,B,C) _NEW(I,0) for( prefix(A,B,C) ; A ; ((A!=B)&&prefix(A,B,C))||(A=NULL) ) if(*A&&++_I) 
+#define _NEW(NAME,VALUE) for(_##NAME##atom=get_mem(_##NAME##Atom),_##NAME##atom->NAME=(VALUE),_##NAME##atom->c=1,push(_##NAME##atom,_##NAME##stack);_##NAME##atom->c||(pop(_##NAME##atom,_##NAME##stack),0);_##NAME##atom->c--)
+#define _ANYSTACK(NAME) _##NAME##Atom _##NAME##atom,_##NAME##stack=NULL;
+#define _EXPORT_STACKS _ANYSTACK(I) _ANYSTACK(J) _ANYSTACK(S) _ANYSTACK(F) _ANYSTACK(CTX)
+_ANYATOM(int,I);
+_ANYATOM(int,J);
+_ANYATOM(str,S);
+_ANYATOM(FILE *,F);
+_ANYATOM(void *,CTX);
+/* .----------------------------------------------------------------------.
+  /  11. C<<1 memory contexts - alternative to garbage collection
+ '----------------------------------------------------------------------- */
+typedef _CTXAtom * context;
+#define create_context(ID) create_mem(ID,context)
+/* .----------------------------------------------------------------------.
+  /  12. C<<1 CGI and FASTCGI handling, updated 2008-01-16 by xCh.
  '----------------------------------------------------------------------- */
 #ifdef USE_LIBRARY_FASTCGI
 #define while_fastcgi_accept while(FCGI_Accept()>=0)
 #define USE_MODULE_CGI
 #endif
 #ifdef USE_MODULE_CGI
-#define cgi(MIME) /* _init_cgi */ if(MIME) printf("Content-type: %s\r\n\r\n",MIME);
-//todo getcgi(VAR)
-//todo define_init_cgi
-//todo #define _QSTACK struct _QStack { char *Q; int _23; list(_QStack); } *_Qatom,*_Qstack=NULL;
+#define cgi(MIME) { char *PTR; /* <-' */ recycle_context(_CGI); _CGIdict=NULL; for_split_str(PTR,getenv("QUERY_STRING"),'&')   /* _init_cgi */ if(MIME) printf("Content-type: %s\r\n\r\n",MIME); }
+#define _GETCGI char *getcgi(VAR) {     }
+#define _CGI_GLOBALS def_context(_CGI); struct _CGIVariable { char *V; dict(_CGIVariable); } *_CGIvariable,*_CGIdict;
+#else
+#define _GETCGI
+#define _CGI_GLOBALS
 #endif
-/* ,-----------------------------------------------------------------------
-  /  11. MySQL infrastructure and wrappers  -  updated 2007-12-19 by xCh.
+/* .----------------------------------------------------------------------.
+  /  13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh.
  '----------------------------------------------------------------------- */
 #ifdef USE_LIBRARY_MYSQL
-#define mysql_connect(S,U,P,D) ((_Matom=get_mem(_MStack)) && push(_Matom,_Mstack) && (_Matom->M=mysql_init(NULL)),(_Matom->M && mysql_real_connect(_Matom->M,S,U,P,D,0,NULL,0)?_Matom->M:NULL))
-#define for_mysql_query_results(ROW,QUERY) _NEW_(_Ratom,_Rstack,_RStack)for(_Ratom->R=(mysql_query(_Matom->M,QUERY)?NULL:mysql_use_result(_Matom->M)),ROW=(_Ratom->R?mysql_fetch_row(_Ratom->R):NULL);ROW;ROW=mysql_fetch_row(_Ratom->R))
-#define _MSTACK struct _MStack { MYSQL *M; int _23; list(_MStack); } *_Matom,*_Mstack=NULL;
-#define _RSTACK struct _RStack { MYSQL_RES *R; int _23; list(_RStack); } *_Ratom,*_Rstack=NULL;
+#define def_sql(CONN) MYSQL *CONN
+#define create_sql(CONN) MYSQL *ID=mysql_init(NULL)
+#define sql_connect(CONN,S,U,P,D) mysql_real_connect(CONN,S,U,P,D,0,NULL,0)
+//todo sql_query
+//todo sql_queryf
+//todo for_sql_query_results(ROW,CONN,QUERY)
+//todo for_sql_queryf_results
+#define if_db_connect(U,P,D) _NEW(SQLC,mysql_init(NULL)) for(;_SQLC && mysql_real_connect(_SQLC,"localhost",U,P,D,0,NULL,0);mysql_close(SQLC),SQLC=NULL)
+#define for_db_query_results(ROW,QUERY) _NEW(MYSQLR,mysql_query(_MYSQLC,QUERY)) for( (_SQLR=(_MYSQLR?0:mysql_use_result(_MYSQLC))),(ROW=(_MYSQLR?mysql_fetch_row(_MYSQLR):NULL)) ; ROW ; ROW=mysql_fetch_row(_MYSQLR) )
+//todo db_query
+//todo for_db_results
+//todo for_db_queryf_results(ROW,...)
+//todo db_queryf
+#define _MYSQLC (_MYSQLCatom->MYSQLC)
+#define _MYSQLR (_MYSQLRatom->MYSQLR)
+#define _SQL_GLOBALS _ANYSTACK(MYSQL,MYSQLC) _ANYSTACK(MYSQL_RES,MYSQLR)
 #else
-#define _MSTACK
-#define _RSTACK
+#define _SQL_GLOBALS
 #endif
+//#ifdef USE_INTERFACE_SQL
+//todo #define _SQL_OBJECT mem Sql { interface(SqlInterface); char *hostname; char *username; char *password; char *database; }
+//todo #define _SQL_CONSTRUCT def_construct(Sql) { self->hostname="localhost"; }
+//#endif
 
 /* ------------------------------------------------------------------- */
 /* old - from version 0.6                                              */
 /* =================================================================== */
-
 /*
 obsolete
 #define strlwr(A) {char *_S=A; while(_&&*_S){*_S=tolower(*_S);_S++;}}
@@ -201,8 +307,6 @@ obsolete
 #define string(S,L) (S=(char *)malloc(L),*S=0)
 #define duplicate(A,B) if(A) { string(B,strlen(A)+1); strcpy(B,A); }
 #define concatenate(A,B,C) if (A && B) { string(C,strlen(A)+strlen(B)+1); strcpy(C,A); strcat(C,B); }
-#define suffix(A,B,C) (((A=strrchr(B,C))&&!(*(A++)=0))||(A=B))
-#define prefix(A,B,C) ((A=B)&&((B=strchr(B,C))&&!(*(B++)=0)||(B=A)))
 #define gotoalpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR))CHAR++
 #define goto_alpha(CHAR) if(CHAR)while(*CHAR && !isalpha(*CHAR) && *CHAR!='_')CHAR++
 #define gotoalnum(CHAR) if(CHAR)while(*CHAR && !isalnum(*CHAR))CHAR++
@@ -214,7 +318,6 @@ obsolete
 #define skipspaces(CHAR) if(CHAR)while(*CHAR==' ')CHAR++
 #define cutspaces(CHAR) if(CHAR){int _L=strlen(CHAR); while(--_L>0 && CHAR[_L]==' ')CHAR[_L]=0;}
 #define gotochr(CHAR,C) if(CHAR)while(*CHAR && *CHAR!=C)CHAR++
-#define tr(CHAR,B,C) {char *_S=CHAR; while(*_S){ if(*_S==B)*_S=C; _S++; }}
 #define strswitch(CHAR) {char *_K=CHAR; FILE *_F=NULL; {{ 
 #define stroption(STR) if(eq(STR,_K))
 #define match(KEY,VAL) {char *_K=KEY, *_V=VAL; FILE *_F=NULL; {{ 
@@ -222,23 +325,18 @@ obsolete
 */
 /* I/O iterations, updated 2004-04-19 by xCh. */
 
-#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
-#define input(S,L) fparse(S,L,stdin)
-#define fstring(S,F) { int _C=0,_L=0; fpos_t _P; fgetpos(F,&_P); while(_C!='\n' && !feof(F)){ _C=fgetc(F); _L++; } string(S,_L); fsetpos(F,&_P);fgets(S,_L,F);fgetc(F);}
-#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);  
+//#define fparse(S,L,F) for(fgets(S,L,F);*S && !feof(F);fgets(S,L,F))
+//#define input(S,L) fparse(S,L,stdin)
+//#define fstring(S,F) { int _C=0,_L=0; fpos_t _P; fgetpos(F,&_P); while(_C!='\n' && !feof(F)){ _C=fgetc(F); _L++; } string(S,_L); fsetpos(F,&_P);fgets(S,_L,F);fgetc(F);}
+//#define parses(S,F) {FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(S,_F);  
 //obsolete
 //#define parse(F) {char *_; FILE *_F=fopen(F,"r"); if(_F) { while(!feof(_F)) { fstring(_,_F);  
 //#define fail }} else {{
 //#define done }} if(_F)fclose(_F);}
-#define option(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=_V; _=NULL;} else free(_Q);}
-#define ioption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=atoi(_V); _=NULL;} free(_Q);}
-#define loption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#');  cutspaces(_V); SETVAR=atol(_V); _=NULL;} free(_Q);}
-
-/* Dynamic list advanced I/O, updated 2003-05-30 by xCh. */
+//to do #define option(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=_V; _=NULL;} else free(_Q);}
+//to do #define ioption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#'); cutspaces(_V); SETVAR=atoi(_V); _=NULL;} free(_Q);}
+//to do #define loption(STR,SETVAR) if(_){char *_K,*_V,*_O,*_Q; duplicate(_,_Q); _O=_Q; tr(_O,'\t',' '); prefix(_K,_O,' '); if(eq(STR,_K)) {skipspaces(_O); prefix(_V,_O,'#');  cutspaces(_V); SETVAR=atol(_V); _=NULL;} free(_Q);}
 
-/* obsolete #define load(A,B,F,T,K) {char *_S; parses(_S,F) { create(A,T); A->K=_S; A->_eoln=TRUE; append(A,B);} done; A->_eoln=FALSE;} */
-/* obsolete #define save(A,B,F,K) {FILE *_F=fopen(F,"w"); if(_F) { for_each(A,B) {fputs(A->K,_F); if(A->_eoln) fputc('\n',_F);} fclose(_F);}} */
-     
 /* I/O sequences, updated 2003-05-29 by xCh. */
 
 #define nullreopen(F) F=freopen("/dev/null","r",F)
@@ -246,53 +344,30 @@ obsolete
 #define shell(CMD) stdinredir(system(CMD))
 #define paste(STR) stdinredir(fputs(STR,stdout))
 
-/* String iterations, updated 2003-06-19 by xCh. */
-
-#define split(A,B,C) for(prefix(A,B,C);A;(A!=B)&&prefix(A,B,C)||(A=NULL))
-#define valid_split(A,B,C) split(A,B,C) if(*A)
-#define columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C)||(A=NULL)),V++)
-#define valid_columns(A,B,C,V) for(V=0,prefix(A,B,C);A;((A!=B)&&prefix(A,B,C))||(A=NULL)) if(*A&&++V)
-#define column(A,B,C,V) { int _V; columns(A,B,C,_V) if(_V==V) break; }
-#define valid_column(A,B,C,V) { int _V; valid_columns(A,B,C,_V) if(_V==V) break; }
-
 /* Useful structures, updated 2003-05-29 by xCh. */
 
-//#define hashtable(TYPE,NAME,VALUE) struct TYPE { char *NAME; char *VALUE; list(TYPE); }
-//#define textfile(TYPE,LINE) struct TYPE { char *LINE; char _eoln; list(TYPE); }
 //#define date(S) { time_t _T; _T=time(NULL); duplicate(ctime(&_T),S); }
 
-/* ------------------------------------------------------------------- */
-/* Object infrastructure and basic macros - updated 2008-01-13 by xCh. */
-/* unfinished */ 
-
-#define method(NAME)
-#define define_interface(IFACE,TYPE) struct TYPE *__get_##_##IFACE(void) { Create_mem(_FACE,TYPE); __bind_##_##IFACE(_FACE); return _IFC; } void __bind_##_##IFACE(struct TYPE *_FACE)
-#define bind_method(METHOD,FUNCTION) _IFACE->METHOD=FUNCTION
-#define get_interface(IFACE) __get_##_##IFACE(void)
-//get_dynamic_interface
-//#define get_object(TYPE)
-//#define _(OBJECT,...) (assert(OBJECT),/**/(*(OBJECT->interface->_ARG1(__VA_ARGS__,)))/**/(OBJECT,OBJECT->interface->__VA_ARGS__)/**/)
-
-/* ------------------------------------------------------------------- */
 /* some general ideas, unfinished */
 //bind_exception, unbind_exception 
 //#define _CLL1_THROW(ERR)
 //#define _CLL1_TRY _NEW_E for(bind_exception(0,NULL);;) if () {.... if(_Eatom->SYS) { if(_Eatom->RET) return; else break;} else { }
-//#define _ASSERT(EXPR) assert(EXPR)
-/* =================================================================== */
-
 
 
-/* ,-----------------------------------------------------------------------
-  /  99. We have have done our homework - now let's have some fun:          
+/* .----------------------------------------------------------------------.
+  /  98. We have have done our homework - now let's have some fun:          
  '----------------------------------------------------------------------- */
-#define _DEF_VARIABLES _GLOBALS _ISTACK _SSTACK _FSTACK _MSTACK _RSTACK //_QSTACK
-#define _DEF_FUNCTIONS _MALLOC _ECHO _PRINT _FECHO _FPRINT _IT_INTS _IT_STRS // _GET_STR _GET_MEM
-#define _DEF_INTERFACE //_CAKE _STD _X
-#define implement_cll1_library _DEF_VARIABLES _DEF_FUNCTIONS _DEF_INTERFACE
+#define _INIT_VARIABLES _EXPORT_GLOBALS _EXPORT_YES _EXPORT_STACKS _SQL_GLOBALS _CGI_GLOBALS
+#define _IMPL_FUNCTIONS /*_MALLOC*/ _EXPORT_OUTS _EXPORT_ARGS _EXPORT_STRS
+#define _IMPL_INTERFACE //_SQL_IFC _CAKE_IFC _STD_IFC _X_IFC
+#define _IMPLEMENT_CLL1_LIBRARY _INIT_VARIABLES _IMPL_FUNCTIONS _IMPL_INTERFACE
+#define _PROGRAM _cll1_program
+#define _DECLARE_PROGRAM void _PROGRAM(int argc, char **argv)
+#define program _IMPLEMENT_CLL1_LIBRARY _DECLARE_PROGRAM; int main(int argc, char **argv) { LANG=setlocale(LC_ALL, ""); _PROGRAM(argc,argv); return 0; } _DECLARE_PROGRAM
 #ifdef USE_PREPROCESSOR
 #include "_include.c"
 #endif
-#define program implement_cll1_library int main(int argc, char **argv)
-/* #ifndef _CLL1_H */
+/* .----------------------------------------------------------------------.
+  /  99. C<<1 is up and running. It's your turn now to show something new.
+ '----------------------------------------------------------------------- */
 #endif