+#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 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 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->__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 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) _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,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 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 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 _I (_Iatom->I)
+#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) { 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
+/* .----------------------------------------------------------------------.
+ / 13. MySQL wrappers + SQL object interface, updated 2007-12-19 by xCh.
+ '----------------------------------------------------------------------- */
+#ifdef USE_LIBRARY_MYSQL
+#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 _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