jk.c 90 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509
  1. /* jk intepreter, by @txlyre,www:txlyre.website, in the public domain */
  2. #include<ctype.h>
  3. #include<limits.h>
  4. #include<math.h>
  5. #include<setjmp.h>
  6. #include<stdbool.h>
  7. #include<stdint.h>
  8. #include<stdio.h>
  9. #include<stdlib.h>
  10. #include<string.h>
  11. #include<time.h>
  12. #include<unistd.h>
  13. #include<sys/wait.h>
  14. #include<errno.h>
  15. #include<gc.h>
  16. #define VER "0.1alep"
  17. #define R return
  18. #define BR break
  19. #define CN continue
  20. #define WH while
  21. #define SW switch
  22. #define CS case
  23. #define T true
  24. #define F false
  25. #define N NULL
  26. #define LOOP for(;;)
  27. #define elif else if
  28. #define FR(p) GC_FREE(p)
  29. #define xt ((x)->tag)
  30. #define yt ((y)->tag)
  31. #define xa ((x)->val.array)
  32. #define ya ((y)->val.array)
  33. #define xad ((x)->val.array->data)
  34. #define yad ((y)->val.array->data)
  35. #define xal ((x)->val.array->length)
  36. #define yal ((y)->val.array->length)
  37. #define xn ((x)->val.number)
  38. #define yn ((y)->val.number)
  39. #define vn ((v)->val.number)
  40. #define xV ((x)->val.verb)
  41. #define yV ((y)->val.verb)
  42. #define xY ((x)->val.symbol)
  43. #define yY ((y)->val.symbol)
  44. #define Vnc(c) (CHARS[(unsigned char)(c)])
  45. typedef uint32_t U32;
  46. typedef uint64_t U64;
  47. typedef double D;
  48. typedef unsigned char UC;
  49. typedef char C;
  50. typedef char *S;
  51. typedef ssize_t SZ;
  52. typedef size_t Z;
  53. typedef bool B;
  54. typedef unsigned int UI;
  55. typedef int I;
  56. typedef void *P;
  57. typedef void V;
  58. typedef const char *cS;
  59. typedef const void *cP;
  60. #define SO(t) (sizeof(t))
  61. #define AE(x)(SO(x)/SO((x)[0]))
  62. #define ROTL32(x, r) ((x << r) | (x >> (32 - r)))
  63. #define FMIX32(h) \
  64. h ^= h >> 16; \
  65. h *= 0x85ebca6b; \
  66. h ^= h >> 13; \
  67. h *= 0xc2b2ae35; \
  68. h ^= h >> 16;
  69. #define TABLE_MIN_SIZE 32
  70. #define CV(s) (Srun(st,s)->val.verb)
  71. jmp_buf Icp;
  72. B Iin;
  73. P ma(Z size){P p;
  74. if(!(p=GC_MALLOC(size)))abort();R p;}
  75. P maa(Z size){P p;
  76. if(!(p=GC_malloc_atomic(size)))abort();
  77. memset(p,0,size);R p;}
  78. P mau(Z size){P p;
  79. if(!(p=GC_malloc_uncollectable(size)))abort();
  80. memset(p,0,size);R p;}
  81. P mrea(P p,Z size){if(!(p=GC_REALLOC(p,size)))abort();R p;}
  82. S sdup(S s){S p=GC_strdup(s);
  83. if(!p)abort();R p;}
  84. typedef struct{P*data;
  85. Z length;
  86. Z allocated;}Ar;
  87. Ar*An(void){Ar*arr=ma(SO(Ar));
  88. arr->data=N;
  89. arr->length=arr->allocated=0;R arr;}
  90. Ar*Ank(Z k){Ar*arr=ma(SO(Ar));
  91. arr->data=ma(k*SO(P ));
  92. arr->length=k;
  93. arr->allocated=k;R arr;}
  94. Ar*Ana(Z k){Ar*arr=ma(SO(Ar));
  95. arr->data=ma(k*SO(P ));
  96. arr->length=0;
  97. arr->allocated=k;R arr;}
  98. Ar*Ac(Ar*l){Ar*arr=ma(SO(Ar));
  99. arr->data=ma(l->length*SO(P ));
  100. arr->length=l->length;
  101. arr->allocated=l->length;
  102. for(Z i=0;i<l->length;i++)arr->data[i]=l->data[i];R arr;}
  103. V Ap(Ar*l,P v){Z i=l->length++;
  104. if(l->length>l->allocated){l->allocated+=16;
  105. l->data=mrea(l->data,l->allocated*SO(P ));}
  106. l->data[i]=v;}
  107. P AP(Ar*l){if(!l->data)R N;
  108. P v=l->data[--l->length];
  109. if(!l->length){FR(l->data);
  110. l->data=N;
  111. l->allocated=0;}
  112. elif(l->allocated-l->length>16){l->allocated=l->length;
  113. l->data=mrea(l->data,l->allocated*SO(P ));}
  114. R v;}
  115. P Ai(Ar*l,SZ index){if(!l->data)R N;
  116. if(index<0)index+=((SZ)l->length);
  117. if(index<0||index>=l->length)R N;R l->data[index];}
  118. V As(Ar*l,SZ index,P v){if(!l->data)R;
  119. if(index<0)index+=((SZ)l->length);
  120. if(index<0||index>=l->length)R;
  121. l->data[index]=v;}
  122. typedef struct{S str;
  123. Z used;
  124. Z allocated;}Bt;
  125. Bt*Bnew(void){Bt*buf=ma(SO(Bt));
  126. buf->str=N;
  127. buf->used=buf->allocated=0;R buf;}
  128. V Bappend(Bt*buf,C c){buf->used++;
  129. if(buf->used>buf->allocated){buf->allocated++;
  130. buf->str=mrea(buf->str,SO(char)*buf->allocated);}
  131. buf->str[buf->used-1]=c;}
  132. S Bread(Bt*buf){if(buf->used==0||buf->str[buf->used-1])Bappend(buf,0);
  133. S str=buf->str;
  134. FR(buf);R str;}
  135. V BappendS(Bt*buf,S s){WH(*s)Bappend(buf,*s++);}
  136. typedef struct{enum Tkt{T_PUNCT,T_LPAR,T_RPAR,T_NAME,T_NUM,T_QUOTE}tag;
  137. S text;}Tkt;
  138. typedef struct{S source;
  139. Z len;
  140. Z pos;
  141. Ar*tokens;}Lt;
  142. Lt*Lnew(void){Lt*lexer=ma(SO(Lt));R lexer;}
  143. C Llook(Lt*lexer,Z offset){Z pos=lexer->pos+offset;
  144. if(pos>=lexer->len)R 0;R lexer->source[pos];}
  145. C Leat(Lt*lexer){if(lexer->pos>=lexer->len)R 0;R lexer->source[lexer->pos++];}
  146. V LpT(Lt*lexer,enum Tkt tag,S text){Tkt*token=ma(SO(Tkt));
  147. token->tag=tag;
  148. token->text=text;
  149. Ap(lexer->tokens,token);}
  150. Ar*guards;
  151. jmp_buf*guard(){jmp_buf*lb=maa(SO(jmp_buf));
  152. Ap(guards,lb);R lb;}
  153. jmp_buf*guarding(){R Ai(guards,-1);}
  154. V unguard(){jmp_buf*lb=AP(guards);
  155. FR(lb);}
  156. V fatal(S s){jmp_buf*lb;
  157. if((lb=guarding()))longjmp(*lb,1);
  158. fprintf(stderr,"|%s error\n",s);
  159. if(Iin)longjmp(Icp,1);
  160. exit(1);}
  161. V Lerror(Lt*lexer,S s){fatal(s);}
  162. V Llnum(Lt*lexer,B is_negative){Bt*buf=Bnew();
  163. if(is_negative)Bappend(buf,'-');
  164. if(Llook(lexer,0)=='.'){Bappend(buf,Leat(lexer));
  165. if(!(isdigit(Llook(lexer,0))))Lerror(lexer,"trailing-dot");}
  166. do{Bappend(buf,Leat(lexer));
  167. if(Llook(lexer,0)=='`'&&isdigit(Llook(lexer,1)))Leat(lexer);}WH(isdigit(Llook(lexer,0)));
  168. if(Llook(lexer,0)=='.'){Bappend(buf,Leat(lexer));
  169. if(!(isdigit(Llook(lexer,0))))Lerror(lexer,"trailing-dot");
  170. do{Bappend(buf,Leat(lexer));}WH(isdigit(Llook(lexer,0)));}
  171. LpT(lexer,T_NUM,Bread(buf));}
  172. V Llex(Lt*lexer,S s){lexer->source=s;
  173. lexer->len=strlen(s);
  174. lexer->pos=0;
  175. lexer->tokens=An();
  176. WH(lexer->pos<lexer->len){C c=Llook(lexer,0);
  177. if(c=='/'&&!lexer->tokens->data)BR;
  178. if(isspace(c)){Leat(lexer);
  179. if(Llook(lexer,0)=='/')BR;}elif(isdigit(c)||c=='.'){Llnum(lexer,F);}elif(isalpha(c)){Bt*buf=Bnew();
  180. do{Bappend(buf,Leat(lexer));}WH(isalpha(Llook(lexer,0)));
  181. if(buf->used==1&&Llook(lexer,0)=='.'){Bappend(buf,Leat(lexer));
  182. LpT(lexer,T_PUNCT,Bread(buf));}else LpT(lexer,T_NAME,Bread(buf));}elif(c=='('||c==')'){Leat(lexer);
  183. LpT(lexer,c=='('?T_LPAR:T_RPAR,N);}elif(c=='\''){Bt*buf=Bnew();
  184. Leat(lexer);
  185. LOOP{if(lexer->pos>=lexer->len)Lerror(lexer,"unmatched-quote");
  186. if(Llook(lexer,0)=='\''){if(Llook(lexer,1)=='\''){Bappend(buf,Leat(lexer));
  187. Leat(lexer);CN;}
  188. Leat(lexer);BR;}
  189. Bappend(buf,Leat(lexer));}
  190. LpT(lexer,T_QUOTE,Bread(buf));}elif(ispunct(c)){C buf[3];
  191. buf[0]=Leat(lexer);
  192. buf[1]=0;
  193. if(Llook(lexer,0)=='.'||Llook(lexer,0)==':'){buf[1]=Leat(lexer);
  194. buf[2]=0;}
  195. if(strcmp(buf,"-")==0&&isdigit(Llook(lexer,0))){Llnum(lexer,T);CN;}
  196. LpT(lexer,T_PUNCT,sdup(buf));}else Lerror(lexer,"lex");}}
  197. typedef struct _Tt Tt;
  198. typedef struct _Tentry_t Tentry_t;
  199. struct _Tentry_t{S key;
  200. P value;
  201. B is_deleted;};
  202. struct _Tt{Tentry_t*entries;
  203. Z used;
  204. Z capacity;};
  205. Tt*Tnew(void){Tt*table=ma(SO(Tt));
  206. table->used=0;
  207. table->capacity=TABLE_MIN_SIZE;
  208. table->entries=ma(table->capacity*SO(Tentry_t));R table;}
  209. Z Tlength(Tt*table){R table->used;}
  210. B Tempty(Tt*table){R table->used==0;}
  211. static U64 MM86128(P key,const I len,U32 seed){const uint8_t*data=(const uint8_t*)key;
  212. const I nblocks=len/16;
  213. U32 h1=seed;
  214. U32 h2=seed;
  215. U32 h3=seed;
  216. U32 h4=seed;
  217. U32 c1=0x239b961b;
  218. U32 c2=0xab0e9789;
  219. U32 c3=0x38b34ae5;
  220. U32 c4=0xa1e38b93;
  221. const uint32_t*blocks=(const uint32_t*)(data+nblocks*16);
  222. for(I i=-nblocks;i;i++){U32 k1=blocks[i*4+0];
  223. U32 k2=blocks[i*4+1];
  224. U32 k3=blocks[i*4+2];
  225. U32 k4=blocks[i*4+3];
  226. k1*=c1;
  227. k1=ROTL32(k1,15);
  228. k1*=c2;
  229. h1^=k1;
  230. h1=ROTL32(h1,19);
  231. h1+=h2;
  232. h1=h1*5+0x561ccd1b;
  233. k2*=c2;
  234. k2=ROTL32(k2,16);
  235. k2*=c3;
  236. h2^=k2;
  237. h2=ROTL32(h2,17);
  238. h2+=h3;
  239. h2=h2*5+0x0bcaa747;
  240. k3*=c3;
  241. k3=ROTL32(k3,17);
  242. k3*=c4;
  243. h3^=k3;
  244. h3=ROTL32(h3,15);
  245. h3+=h4;
  246. h3=h3*5+0x96cd1c35;
  247. k4*=c4;
  248. k4=ROTL32(k4,18);
  249. k4*=c1;
  250. h4^=k4;
  251. h4=ROTL32(h4,13);
  252. h4+=h1;
  253. h4=h4*5+0x32ac3b17;}
  254. const uint8_t*tail=(const uint8_t*)(data+nblocks*16);
  255. U32 k1=0;
  256. U32 k2=0;
  257. U32 k3=0;
  258. U32 k4=0;
  259. SW(len & 15){CS 15:k4^=tail[14]<<16;
  260. CS 14:k4^=tail[13]<<8;
  261. CS 13:k4^=tail[12]<<0;
  262. k4*=c4;
  263. k4=ROTL32(k4,18);
  264. k4*=c1;
  265. h4^=k4;
  266. CS 12:k3^=tail[11]<<24;
  267. CS 11:k3^=tail[10]<<16;
  268. CS 10:k3^=tail[9]<<8;
  269. CS 9:k3^=tail[8]<<0;
  270. k3*=c3;
  271. k3=ROTL32(k3,17);
  272. k3*=c4;
  273. h3^=k3;
  274. CS 8:k2^=tail[7]<<24;
  275. CS 7:k2^=tail[6]<<16;
  276. CS 6:k2^=tail[5]<<8;
  277. CS 5:k2^=tail[4]<<0;
  278. k2*=c2;
  279. k2=ROTL32(k2,16);
  280. k2*=c3;
  281. h2^=k2;
  282. CS 4:k1^=tail[3]<<24;
  283. CS 3:k1^=tail[2]<<16;
  284. CS 2:k1^=tail[1]<<8;
  285. CS 1:k1^=tail[0]<<0;
  286. k1*=c1;
  287. k1=ROTL32(k1,15);
  288. k1*=c2;
  289. h1^=k1;}
  290. h1^=len;
  291. h2^=len;
  292. h3^=len;
  293. h4^=len;
  294. h1+=h2;
  295. h1+=h3;
  296. h1+=h4;
  297. h2+=h1;
  298. h3+=h1;
  299. h4+=h1;
  300. FMIX32(h1);
  301. FMIX32(h2);
  302. FMIX32(h3);
  303. FMIX32(h4);
  304. h1+=h2;
  305. h1+=h3;
  306. h1+=h4;
  307. h2+=h1;
  308. h3+=h1;
  309. h4+=h1;R(((U64)h2)<<32)| h1;}
  310. static U32 HASH_SEED=0;
  311. P Tget(Tt*table,S key){if(Tempty(table))R N;
  312. U64 hash=MM86128(key,strlen(key),HASH_SEED);
  313. Z index=hash%table->capacity;
  314. Z i=index;
  315. WH(table->entries[i].key){if(!table->entries[i].is_deleted&&strcmp(table->entries[i].key,key)==0)R table->entries[i].value;
  316. i++;
  317. if(i>=table->capacity)i=0;
  318. if(i==index)BR;}
  319. R N;}
  320. B Thas(Tt*table,S key){if(Tempty(table))R F;
  321. U64 hash=MM86128(key,strlen(key),HASH_SEED);
  322. Z index=hash%table->capacity;
  323. Z i=index;
  324. WH(table->entries[i].key){if(!table->entries[i].is_deleted&&strcmp(table->entries[i].key,key)==0)R T;
  325. i++;
  326. if(i>=table->capacity)i=0;
  327. if(i==index)BR;}
  328. R F;}
  329. static V Tentry_set(Tentry_t*entries,S key,P value,Z capacity,Z*used){U64 hash=MM86128(key,strlen(key),HASH_SEED);
  330. Z index=hash%capacity;
  331. Z i=index;
  332. WH(entries[i].key){if(strcmp(entries[i].key,key)==0){entries[i].value=value;
  333. if(entries[i].is_deleted){if(used)(*used)++;
  334. entries[i].is_deleted=F;}
  335. R;}elif(entries[i].is_deleted)BR;
  336. i++;
  337. if(i>=capacity)i=0;
  338. if(i==index)BR;}
  339. if(used)(*used)++;
  340. entries[i].key=key;
  341. entries[i].value=value;
  342. entries[i].is_deleted=F;}
  343. Tt*Tset(Tt*table,S key,P value){if(table->used>=table->capacity){Z capacity=table->capacity+TABLE_MIN_SIZE;
  344. Tentry_t*entries=ma(capacity*SO(Tentry_t));
  345. for(Z i=0;i<table->capacity;i++){Tentry_t entry=table->entries[i];
  346. if(entry.key&&!entry.is_deleted)Tentry_set(entries,entry.key,entry.value,capacity,N);}
  347. FR(table->entries);
  348. table->entries=entries;
  349. table->capacity=capacity;}
  350. Tentry_set(table->entries,key,value,table->capacity,&table->used);R table;}
  351. B Tdelete(Tt*table,S key){U64 hash=MM86128(key,strlen(key),HASH_SEED);
  352. Z index=hash%table->capacity;
  353. Z i=index;
  354. WH(table->entries[i].key){if(!table->entries[i].is_deleted&&strcmp(table->entries[i].key,key)==0){table->entries[i].value=N;
  355. table->entries[i].is_deleted=T;
  356. table->used--;
  357. if(table->capacity>TABLE_MIN_SIZE&&table->used<=table->capacity-TABLE_MIN_SIZE){Z capacity=table->capacity-TABLE_MIN_SIZE;
  358. Tentry_t*entries=ma(capacity*SO(Tentry_t));
  359. for(Z i=0;i<table->capacity;i++){Tentry_t entry=table->entries[i];
  360. if(entry.key&&!entry.is_deleted)Tentry_set(entries,entry.key,entry.value,capacity,N);}
  361. FR(table->entries);
  362. table->entries=entries;
  363. table->capacity=capacity;}
  364. R T;}
  365. i++;
  366. if(i>=table->capacity)i=0;
  367. if(i==index)BR;}
  368. R F;}
  369. typedef struct _Vt Vt;
  370. typedef struct _St St;
  371. typedef struct _vt vt;
  372. struct _St{Tt*env;
  373. Ar*args;
  374. Ar*selfrefs;
  375. Vt*nil;
  376. Vt*udf;
  377. Vt*unit;
  378. vt*at;};
  379. struct _vt{S name;
  380. UI rank[3];
  381. Ar*bonds;
  382. B mark;
  383. B is_fun;
  384. Vt*(*monad)(St*,vt*,Vt*);
  385. Vt*(*dyad)(St*,vt*,Vt*,Vt*);};
  386. typedef struct{S name;
  387. vt*(*adverb)(St*,Vt*);
  388. vt*(*conjunction)(St*,Vt*,Vt*);}advt;
  389. struct _Vt{enum Vtag_t{ARRAY,VERB,SYM,NUM,CHAR,NIL,UDF}tag;
  390. union{Ar*array;
  391. vt*verb;
  392. S symbol;
  393. D number;
  394. UC _char;}val;};
  395. vt*vnew(){vt*verb=ma(SO(vt));R verb;}
  396. Vt*Vnew(enum Vtag_t tag){Vt*val;
  397. if(tag>SYM)val=maa(SO(Vt));
  398. else val=ma(SO(Vt));
  399. val->tag=tag;R val;}
  400. Vt*VnC(enum Vtag_t tag){Vt*val=mau(SO(Vt));
  401. val->tag=tag;R val;}
  402. Vt*_UNIT;
  403. Vt*Vna(Ar*array){if(!array->data){FR(array);R _UNIT;}
  404. Vt*val=Vnew(ARRAY);
  405. val->val.array=array;R val;}
  406. Tt*VCACHE;
  407. Vt*Vnv(vt*verb){Vt*val;
  408. if((val=Tget(VCACHE,verb->name)))R val;
  409. val=Vnew(VERB);
  410. val->val.verb=verb;R val;}
  411. Tt*SCACHE;
  412. Vt*Vny(S symbol){Vt*val;
  413. if((val=Tget(SCACHE,symbol)))R val;
  414. val=VnC(SYM);
  415. val->val.symbol=symbol;
  416. Tset(SCACHE,symbol,val);R val;}
  417. Vt*_NAN,*INF,*NINF;
  418. Vt*NNUMS[8];
  419. Vt*NUMS[256];
  420. Vt*CHARS[256];
  421. Vt*Vnn(D number){if(isnan(number))R _NAN;
  422. elif(number==INFINITY)R INF;
  423. elif(number==-INFINITY)R NINF;
  424. elif(number>=0&&number<256&&number==(D)((Z)number))R NUMS[(Z)number];
  425. elif(number<0&&number>=-8&&fabs(number)==(D)((Z)fabs(number)))R NNUMS[((Z)fabs(number))-1];
  426. Vt*val=Vnew(NUM);
  427. val->val.number=number;R val;}
  428. B Veq(Vt*x,Vt*y){if(xt!=yt)R F;
  429. SW(xt){CS ARRAY:{Ar*tx=xa;
  430. Ar*ty=ya;
  431. if(tx->length==0&&ty->length==0)BR;
  432. if(tx->length!=ty->length)R F;
  433. for(Z i=0;i<tx->length;i++)if(!Veq(tx->data[i],ty->data[i]))R F;}
  434. CS VERB:R strcmp(xV->name,xV->name)==0;
  435. CS SYM:R strcmp(xY,yY)==0;
  436. CS NUM:if(isnan(xn)&&isnan(yn))BR;R xn==yn;
  437. CS CHAR:R x==y;
  438. CS NIL:CS UDF:BR;}
  439. R T;}
  440. B Cap(Ar*a){for(Z i=0;i<a->length;i++){Vt*v=a->data[i];
  441. if(v->tag!=CHAR||!isprint(v->val._char))R F;}
  442. R T;}
  443. B Aap(Ar*a){for(Z i=0;i<a->length;i++){Vt*v=a->data[i];
  444. if(v->tag!=ARRAY)R F;}
  445. R T;}
  446. S Vshow(Vt*v);
  447. S show_array(Vt*v){if(v->tag!=ARRAY)R Vshow(v);
  448. Ar*t=v->val.array;
  449. if(!t->data)R sdup("()");
  450. Bt*buf=Bnew();
  451. if(t->length==1){Bappend(buf,',');
  452. S ts=Vshow(t->data[0]);
  453. BappendS(buf,ts);
  454. FR(ts);R Bread(buf);}
  455. if(Cap(t)){for(Z i=0;i<t->length;i++)Bappend(buf,((Vt*)t->data[i])->val._char);R Bread(buf);}
  456. if(!Aap(t)){for(Z i=0;i<t->length;i++){S ts=Vshow(t->data[i]);
  457. BappendS(buf,ts);
  458. FR(ts);
  459. if(i!=t->length-1)Bappend(buf,' ');}}else{for(Z i=0;i<t->length;i++){S ts=show_array(t->data[i]);
  460. BappendS(buf,ts);
  461. FR(ts);
  462. if(i!=t->length-1)Bappend(buf,'\n');}}
  463. R Bread(buf);}
  464. S Vshow(Vt*v){SW(v->tag){CS ARRAY:R show_array(v);
  465. CS VERB:R sdup(v->val.verb->name);
  466. CS SYM:R sdup(v->val.symbol);
  467. CS NUM:{C buf[128];
  468. snprintf(buf,SO(buf),"%.15g",vn);R sdup(buf);}
  469. CS CHAR:{if(!isprint(v->val._char)){C buf[16];
  470. snprintf(buf,SO(buf),"4t.%d",v->val._char);R sdup(buf);}
  471. C buf[2];
  472. buf[0]=v->val._char;
  473. buf[1]=0;R sdup(buf);}
  474. CS NIL:R sdup("nil");
  475. CS UDF:R sdup("udf");}
  476. R sdup("<?>");}
  477. D Vnum(Vt*v){if(v->tag==CHAR)R v->val._char;R vn;}
  478. B VTp(Vt*x){SW(xt){CS ARRAY:R xal!=0;
  479. CS NUM:CS CHAR:R Vnum(x)!=0;
  480. CS NIL:CS UDF:R F;
  481. default:R T;}}
  482. vt*Gv(S s);
  483. St*Sn(void){St*st=ma(SO(St));
  484. st->env=Tnew();
  485. st->args=An();
  486. st->selfrefs=An();
  487. st->nil=Vnew(NIL);
  488. st->udf=Vnew(UDF);
  489. st->unit=_UNIT;
  490. st->at=Gv("@");R st;}
  491. V Serror(St*st,S e){fprintf(stderr,"%s error\n",e);
  492. exit(1);}
  493. Vt*eR(St*st,vt*f,Vt*x,UI d,UI rm){if(!f->monad)R st->udf;
  494. if(d>=rm||xt!=ARRAY){if(f->mark)Ap(st->selfrefs,f);
  495. Vt*r=f->monad(st,f,x);
  496. if(f->mark)AP(st->selfrefs);R r;}
  497. Ar*t=xa;
  498. if(!t->data)R x;
  499. Ar*l=Ank(t->length);
  500. for(Z i=0;i<t->length;i++)l->data[i]=eR(st,f,t->data[i],d+1,rm);R Vna(l);}
  501. Vt*apM(St*st,Vt*f,Vt*x){if(f->tag!=VERB)R st->udf;
  502. if(!f->val.verb->monad)R st->udf;R eR(st,f->val.verb,x,0,f->val.verb->rank[0]);}
  503. Vt*tgth(St*st,vt*f,Vt*x,Vt*y,UI dl,UI dr,UI rl,UI rr){if(!f->dyad)R st->udf;
  504. if(dl>=rl&&dr>=rr){if(f->mark)Ap(st->selfrefs,f);
  505. Vt*r=f->dyad(st,f,x,y);
  506. if(f->mark)AP(st->selfrefs);R r;}
  507. if(dl<rl&&dr<rr&&xt==ARRAY&&yt==ARRAY){Ar*tx=xa;
  508. Ar*ty=ya;
  509. if(!tx->data||!ty->data)R !tx->data?x:y;
  510. Ar*t=Ank(ty->length<tx->length?ty->length:tx->length);
  511. for(Z i=0;i<tx->length;i++){if(i>=ty->length)BR;
  512. t->data[i]=tgth(st,f,tx->data[i],ty->data[i],dl+1,dr+1,rl,rr);}
  513. R Vna(t);}elif((xt!=ARRAY||dl>=rl)&&yt==ARRAY&&dr<rr){Ar*ty=ya;
  514. if(!ty->data)R y;
  515. Ar*t=Ank(ty->length);
  516. for(Z i=0;i<ty->length;i++)t->data[i]=tgth(st,f,x,ty->data[i],dl,dr+1,rl,rr);R Vna(t);}elif((yt!=ARRAY||dr>=rr)&&xt==ARRAY&&dl<rl){Ar*tx=xa;
  517. if(!tx->data)R x;
  518. Ar*t=Ank(tx->length);
  519. for(Z i=0;i<tx->length;i++)t->data[i]=tgth(st,f,tx->data[i],y,dl+1,dr,rl,rr);R Vna(t);}
  520. if(f->mark)Ap(st->selfrefs,f);
  521. Vt*r=f->dyad(st,f,x,y);
  522. if(f->mark)AP(st->selfrefs);R r;}
  523. Vt*apD(St*st,Vt*f,Vt*x,Vt*y){if(f->tag!=VERB)R st->nil;R tgth(st,f->val.verb,x,y,0,0,f->val.verb->rank[1],f->val.verb->rank[2]);}
  524. typedef struct _Nt Nt;
  525. struct _Nt{enum Ntag_t{N_STRAND,N_LITERAL,N_INDEX1,N_INDEX2,N_FUN,N_MONAD,N_DYAD,N_ADV,N_CONJ,N_PARTIAL_CONJ,N_FORK,N_HOOK,N_BOND,N_OVER,N_BIND}tag;
  526. advt*av;
  527. Vt*v;
  528. Ar*l;
  529. Nt*a;
  530. Nt*b;
  531. Nt*c;};
  532. Vt*_fork_m(St*st,vt*self,Vt*x){vt*f=Ai(self->bonds,0);
  533. vt*g=Ai(self->bonds,1);
  534. vt*h=Ai(self->bonds,2);
  535. Vt*l=eR(st,f,x,0,f->rank[0]);
  536. Vt*r=eR(st,h,x,0,f->rank[0]);R tgth(st,g,l,r,0,0,g->rank[1],g->rank[2]);}
  537. Vt*_fork_d(St*st,vt*self,Vt*x,Vt*y){vt*f=Ai(self->bonds,0);
  538. vt*g=Ai(self->bonds,1);
  539. vt*h=Ai(self->bonds,2);
  540. Vt*l=eR(st,f,x,0,f->rank[0]);
  541. Vt*r=eR(st,h,y,0,f->rank[0]);R tgth(st,g,l,r,0,0,g->rank[1],g->rank[2]);}
  542. Vt*_hook_m(St*st,vt*self,Vt*x){vt*f=Ai(self->bonds,0);
  543. vt*g=Ai(self->bonds,1);
  544. Vt*r=eR(st,g,x,0,g->rank[0]);R eR(st,f,r,0,f->rank[0]);}
  545. Vt*_hook_d(St*st,vt*self,Vt*x,Vt*y){vt*f=Ai(self->bonds,0);
  546. vt*g=Ai(self->bonds,1);
  547. Vt*r=tgth(st,g,x,y,0,0,g->rank[1],g->rank[2]);R eR(st,f,r,0,f->rank[0]);}
  548. Vt*_bond_m(St*st,vt*self,Vt*x){vt*f=Ai(self->bonds,0);
  549. Vt*g=Ai(self->bonds,1);R tgth(st,f,g,x,0,0,f->rank[1],f->rank[2]);}
  550. Vt*_bond_d(St*st,vt*self,Vt*x,Vt*y){vt*f=Ai(self->bonds,0);
  551. Vt*g=Ai(self->bonds,1);
  552. Vt*r=tgth(st,f,x,y,0,0,f->rank[1],f->rank[2]);R tgth(st,f,x,r,0,0,f->rank[1],f->rank[2]);}
  553. Vt*_over_m(St*st,vt*self,Vt*x){Vt*f=Ai(self->bonds,0);
  554. vt*g=Ai(self->bonds,1);
  555. vt*h=Ai(self->bonds,2);
  556. Vt*l=eR(st,h,x,0,h->rank[0]);R tgth(st,g,f,l,0,0,g->rank[1],g->rank[2]);}
  557. Vt*_over_d(St*st,vt*self,Vt*x,Vt*y){Vt*f=Ai(self->bonds,0);
  558. vt*g=Ai(self->bonds,1);
  559. vt*h=Ai(self->bonds,2);
  560. Vt*l=tgth(st,h,x,y,0,0,h->rank[1],h->rank[2]);R tgth(st,g,f,l,0,0,g->rank[1],g->rank[2]);}
  561. B nca(Nt*node,unsigned int*argc){if(!node)R F;
  562. if(node->tag==N_LITERAL&&node->v->tag==SYM&&strcmp(node->v->val.symbol,"y")==0){*argc=2;R T;}elif(node->tag==N_LITERAL&&node->v->tag==SYM&&strcmp(node->v->val.symbol,"x")==0){if(*argc<2)*argc=1;}elif(node->tag==N_MONAD||node->tag==N_CONJ||node->tag==N_HOOK||node->tag==N_BOND||node->tag==N_INDEX1){if(nca(node->a,argc))R T;
  563. if(nca(node->b,argc))R T;}elif(node->tag==N_DYAD||node->tag==N_FORK||node->tag==N_OVER||node->tag==N_INDEX2){if(nca(node->a,argc))R T;
  564. if(nca(node->b,argc))R T;
  565. if(nca(node->c,argc))R T;}elif(node->tag==N_ADV){if(nca(node->a,argc))R T;}elif(node->tag==N_STRAND){Ar*t=node->l;
  566. for(Z i=0;i<t->length;i++)if(nca(t->data[i],argc))R T;}
  567. R F;}
  568. Vt*Swalk(St*st,Nt*node);
  569. Vt*_const_m(St*st,vt*self,Vt*x){R self->bonds->data[0];}
  570. Vt*_const_d(St*st,vt*self,Vt*x,Vt*y){R self->bonds->data[0];}
  571. Vt*_fun_m(St*st,vt*self,Vt*x){Ar*args=An();
  572. Ap(args,x);
  573. Ap(args,self);
  574. Ap(st->args,args);
  575. Vt*r=Swalk(st,self->bonds->data[0]);
  576. AP(st->args);
  577. FR(args);R r;}
  578. Vt*_fun_d(St*st,vt*self,Vt*x,Vt*y){Ar*args=An();
  579. Ap(args,x);
  580. Ap(args,y);
  581. Ap(args,self);
  582. Ap(st->args,args);
  583. Vt*r=Swalk(st,self->bonds->data[1]);
  584. AP(st->args);
  585. FR(args);R r;}
  586. Vt*_partial_conjunction(St*st,vt*self,Vt*x){advt*av=self->bonds->data[0];
  587. Vt*a=self->bonds->data[1];R Vnv(av->conjunction(st,a,x));}
  588. Nt*Nn1(enum Ntag_t tag,Nt*a);
  589. Vt*Swalk(St*st,Nt*node){if(!node)R st->nil;
  590. SW(node->tag){CS N_STRAND:{Ar*t=node->l;
  591. for(Z i=0;i<t->length;i++)t->data[i]=Swalk(st,t->data[i]);R Vna(node->l);}
  592. CS N_LITERAL:{Vt*v=node->v;
  593. Vt*t=N;
  594. if(v->tag==SYM){S n=v->val.symbol;
  595. if(st->args->data){Ar*args=Ai(st->args,-1);
  596. Z argc=args->length-1;
  597. if(argc==2&&strcmp(n,"y")==0)R args->data[1];
  598. elif(strcmp(n,"x")==0)R args->data[0];}
  599. if((t=Tget(st->env,n)))R t;
  600. if(strcmp(n,"T")==0)R Vnn(time(N));}
  601. R v;}
  602. CS N_INDEX1:R tgth(st,st->at,Swalk(st,node->a),Swalk(st,node->b),0,0,st->at->rank[1],st->at->rank[2]);
  603. CS N_INDEX2:R tgth(st,st->at,tgth(st,st->at,Swalk(st,node->a),Swalk(st,node->b),0,0,st->at->rank[1],st->at->rank[2]),Swalk(st,node->c),0,0,st->at->rank[1],st->at->rank[2]);
  604. CS N_FUN:{UI argc=0;
  605. nca(node->a,&argc);
  606. vt*nv=vnew();
  607. if(argc>0)nv->is_fun=T;
  608. nv->bonds=An();
  609. nv->name=sdup(argc==0?":...":argc==1?":x":":xy");
  610. nv->rank[0]=0;
  611. nv->rank[1]=0;
  612. nv->rank[2]=0;
  613. if(argc==0){Ap(nv->bonds,Swalk(st,node->a));
  614. nv->monad=_const_m;
  615. nv->dyad=_const_d;}elif(argc==1){Ap(nv->bonds,node->a);
  616. nv->monad=_fun_m;
  617. nv->dyad=N;}else{nv->monad=N;
  618. Ap(nv->bonds,st->udf);
  619. Ap(nv->bonds,node->a);
  620. nv->dyad=_fun_d;}
  621. R Vnv(nv);}
  622. CS N_MONAD:R apM(st,Swalk(st,node->a),Swalk(st,node->b));
  623. CS N_DYAD:R apD(st,Swalk(st,node->a),Swalk(st,node->b),Swalk(st,node->c));
  624. CS N_ADV:{Vt*v=Swalk(st,node->a);R Vnv(node->av->adverb(st,v));}
  625. CS N_CONJ:{Vt*v1=Swalk(st,node->a);
  626. Vt*v2=Swalk(st,node->b);R Vnv(node->av->conjunction(st,v1,v2));}
  627. CS N_PARTIAL_CONJ:{vt*nv=vnew();
  628. Vt*a=Swalk(st,node->a);
  629. S r=Vshow(a);
  630. Z l=strlen(r)+strlen(node->av->name)+1;
  631. nv->name=ma(l);
  632. snprintf(nv->name,l,"%s%s",r,node->av->name);
  633. FR(r);
  634. nv->bonds=An();
  635. Ap(nv->bonds,node->av);
  636. Ap(nv->bonds,a);
  637. nv->rank[0]=0;
  638. nv->rank[1]=0;
  639. nv->rank[2]=0;
  640. nv->monad=_partial_conjunction;
  641. nv->dyad=N;R Vnv(nv);}
  642. CS N_FORK:{Vt*_f=Swalk(st,node->a);
  643. if(_f->tag!=VERB)R st->udf;
  644. Vt*_g=Swalk(st,node->b);
  645. if(_g->tag!=VERB)R st->udf;
  646. Vt*_h=Swalk(st,node->c);
  647. if(_h->tag!=VERB)R st->udf;
  648. vt*f=_f->val.verb;
  649. vt*g=_g->val.verb;
  650. vt*h=_h->val.verb;
  651. vt*nv=vnew();
  652. nv->bonds=An();
  653. Ap(nv->bonds,f);
  654. Ap(nv->bonds,g);
  655. Ap(nv->bonds,h);
  656. Z l=strlen(f->name)+strlen(g->name)+strlen(h->name)+1;
  657. nv->name=ma(l);
  658. snprintf(nv->name,l,"%s%s%s",f->name,g->name,h->name);
  659. nv->rank[0]=0;
  660. nv->rank[1]=0;
  661. nv->rank[2]=0;
  662. nv->monad=_fork_m;
  663. nv->dyad=_fork_d;R Vnv(nv);}
  664. CS N_HOOK:{Vt*_f=Swalk(st,node->a);
  665. if(_f->tag!=VERB)R st->udf;
  666. Vt*_g=Swalk(st,node->b);
  667. if(_g->tag!=VERB)R st->udf;
  668. vt*f=_f->val.verb;
  669. vt*g=_g->val.verb;
  670. vt*nv=vnew();
  671. nv->bonds=An();
  672. Ap(nv->bonds,f);
  673. Ap(nv->bonds,g);
  674. Z l=strlen(f->name)+strlen(g->name)+1;
  675. nv->name=ma(l);
  676. snprintf(nv->name,l,"%s%s",f->name,g->name);
  677. nv->rank[0]=0;
  678. nv->rank[1]=0;
  679. nv->rank[2]=0;
  680. nv->monad=_hook_m;
  681. nv->dyad=_hook_d;R Vnv(nv);}
  682. CS N_BOND:{Vt*_f=Swalk(st,node->a);
  683. if(_f->tag!=VERB)R st->udf;
  684. Vt*g=Swalk(st,node->b);
  685. vt*f=_f->val.verb;
  686. vt*nv=vnew();
  687. nv->bonds=An();
  688. Ap(nv->bonds,f);
  689. Ap(nv->bonds,g);
  690. S r=Vshow(g);
  691. Z l=strlen(r)+strlen(f->name)+1;
  692. nv->name=ma(l);
  693. snprintf(nv->name,l,"%s%s",r,f->name);
  694. FR(r);
  695. nv->rank[0]=0;
  696. nv->rank[1]=0;
  697. nv->rank[2]=0;
  698. nv->monad=_bond_m;
  699. nv->dyad=_bond_d;R Vnv(nv);}
  700. CS N_OVER:{Vt*f=Swalk(st,node->a);
  701. Vt*_g=Swalk(st,node->b);
  702. if(_g->tag!=VERB)R st->udf;
  703. Vt*_h=Swalk(st,node->c);
  704. if(_h->tag!=VERB)R st->udf;
  705. vt*g=_g->val.verb;
  706. vt*h=_h->val.verb;
  707. vt*nv=vnew();
  708. nv->bonds=An();
  709. Ap(nv->bonds,f);
  710. Ap(nv->bonds,g);
  711. Ap(nv->bonds,h);
  712. S r=Vshow(f);
  713. Z l=strlen(r)+strlen(g->name)+strlen(h->name)+1;
  714. nv->name=ma(l);
  715. snprintf(nv->name,l,"%s%s%s",r,g->name,h->name);
  716. FR(r);
  717. nv->rank[0]=0;
  718. nv->rank[1]=0;
  719. nv->rank[2]=0;
  720. nv->monad=_over_m;
  721. nv->dyad=_over_d;R Vnv(nv);}
  722. CS N_BIND:{Vt*l=node->a->v;
  723. Nt*b=node->b;
  724. UI argc=0;
  725. nca(b,&argc);
  726. if(argc!=0)b=Nn1(N_FUN,b);
  727. Vt*r=Swalk(st,b);
  728. if(r->tag==VERB&&argc==0)r->val.verb->mark=T;
  729. Vt*ov=Tget(st->env,l->val.symbol);
  730. if(ov&&ov->tag==VERB&&ov->val.verb->is_fun&&r->tag==VERB&&r->val.verb->is_fun){if(!ov->val.verb->monad&&r->val.verb->monad){As(ov->val.verb->bonds,0,r->val.verb->bonds->data[0]);
  731. ov->val.verb->monad=r->val.verb->monad;BR;}
  732. if(!ov->val.verb->dyad&&r->val.verb->dyad){Ap(ov->val.verb->bonds,r->val.verb->bonds->data[1]);
  733. ov->val.verb->dyad=r->val.verb->dyad;BR;}}
  734. Tset(st->env,l->val.symbol,r);}}
  735. R st->nil;}
  736. Vt*vconst(St*st,vt*self,Vt*x){vt*nv=vnew();
  737. nv->bonds=An();
  738. Ap(nv->bonds,x);
  739. S r=Vshow(x);
  740. Z l=strlen(r)+2;
  741. nv->name=ma(l);
  742. snprintf(nv->name,l,":%s",r);
  743. nv->rank[0]=0;
  744. nv->rank[1]=0;
  745. nv->rank[2]=0;
  746. nv->monad=_const_m;
  747. nv->dyad=_const_d;R Vnv(nv);}
  748. Vt*vbind(St*st,vt*self,Vt*x,Vt*y){if(xt==SYM){if(yt==VERB)yV->mark=T;
  749. Tset(st->env,xY,y);}
  750. R st->udf;}
  751. Tt*Inverses;
  752. Vt*vunbind(St*st,vt*self,Vt*x){if(xt==SYM){Tdelete(st->env,xY);R st->nil;}
  753. R st->udf;}
  754. Vt*vobverse(St*st,vt*self,Vt*x,Vt*y){if(xt==VERB&&yt==VERB){vt*vx=xV;
  755. if(!yV->monad)
  756. R st->udf;
  757. if(strcmp(vx->name,":...")==0||strcmp(vx->name,":x")==0||strcmp(vx->name,":xy")==0)R st->udf;
  758. if(Thas(Inverses,vx->name))R st->udf;
  759. Tset(Inverses,vx->name,yV);R st->nil;}
  760. R st->udf;}
  761. Vt*vflip(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R st->udf;
  762. if(!Aap(xa))R st->udf;
  763. Ar*r=An();
  764. Vt*c0=xad[0];
  765. Ar*c0t=c0->val.array;
  766. Z c0l=c0t->length;
  767. for(Z i=0;i<c0l;i++){Ar*nc=An();
  768. for(Z j=0;j<xal;j++){Vt*rw=xad[j];
  769. Ar*rwt=rw->val.array;
  770. if(!rwt->data)R st->udf;
  771. Vt*v=Ai(rwt,i);
  772. if(!v)v=rwt->data[0];
  773. Ap(nc,v);}
  774. Ap(r,Vna(nc));}
  775. R Vna(r);}
  776. Vt*vplus(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(xt==CHAR||yt==CHAR)R Vnc(Vnum(x)+Vnum(y));R Vnn(Vnum(x)+Vnum(y));}
  777. R _NAN;}
  778. Vt*vsign(St*st,vt*self,Vt*x){if(xt==NUM)R xn<0?NNUMS[0]:xn>0?NUMS[1]:NUMS[0];R _NAN;}
  779. D gcd(D a,D b){if(b!=0)R gcd(b,fmod(a,b));
  780. else R fabs(a);}
  781. Vt*vgcd(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(gcd(xn,yn));R _NAN;}
  782. Vt*vsin(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(sin(xn));R _NAN;}
  783. Vt*vsquare(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(xn*xn);R _NAN;}
  784. Vt*vnegate(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(-xn);R _NAN;}
  785. Vt*vminus(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(xt==CHAR||yt==CHAR)R Vnc(Vnum(x)-Vnum(y));R Vnn(Vnum(x)-Vnum(y));}
  786. R _NAN;}
  787. Vt*vatan(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(atan(xn));R _NAN;}
  788. Vt*vatan2(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(atan2(xn,yn));R _NAN;}
  789. Vt*vfirst(St*st,vt*self,Vt*x){if(xt!=ARRAY)R x;
  790. if(!xad)R st->udf;R xad[0];}
  791. Vt*vtimes(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(xt==CHAR||yt==CHAR)R Vnc(Vnum(x)*Vnum(y));R Vnn(Vnum(x)*Vnum(y));}
  792. R _NAN;}
  793. D lcm(D a,D b){R(a*b)/gcd(a,b);}
  794. U64 factorial(U64 n){U64 r=1;
  795. WH(n>0)r*=n--;R r;}
  796. Vt*vfactorial(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(factorial((U64)fabs(xn)));R _NAN;}
  797. Vt*vlcm(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(lcm(xn,yn));R _NAN;}
  798. Vt*vdouble(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(xn*2);R _NAN;}
  799. Vt*vreplicate(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM){Z k=fabs(xn);
  800. Ar*r=An();
  801. WH(k--)Ap(r,y);R Vna(r);}
  802. R st->udf;}
  803. Vt*vreciprocal(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(1/xn);R _NAN;}
  804. Vt*vdivide(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM){D ny=yn;
  805. if(ny==0)R INF;R Vnn(xn/ny);}
  806. R _NAN;}
  807. D npower(D base,I n){if(n<0)R npower(1/base,-n);
  808. elif(n==0)R 1.0;
  809. elif(n==1)R base;
  810. elif(n%2)R base*npower(base*base,n/2);
  811. else R npower(base*base,n/2);}
  812. D nroot(D base,I n){if(n==1)R base;
  813. elif(n<=0||base<0)R NAN;
  814. else{D delta,x=base/n;
  815. do{delta=(base/npower(x,n-1)-x)/n;
  816. x+=delta;}WH(fabs(delta)>=1e-8);R x;}}
  817. Vt*vsqrt(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(sqrt(xn));R _NAN;}
  818. Vt*vroot(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(nroot(yn,xn));R _NAN;}
  819. Vt*vhalve(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(xn/2);R _NAN;}
  820. Vt*vidivide(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM){D ny=yn;
  821. if(ny==0)R INF;R Vnn(trunc(xn/ny));}
  822. R _NAN;}
  823. Vt*venlist(St*st,vt*self,Vt*x);
  824. Vt*vpred(St*st,vt*self,Vt*x);
  825. Vt*vrange(St*st,vt*self,Vt*x,Vt*y);
  826. Vt*venum(St*st,vt*self,Vt*x){if(Veq(x,NUMS[1]))R venlist(st,N,NUMS[0]);
  827. elif(Veq(x,NUMS[0]))R st->unit;R vrange(st,self,NUMS[0],vpred(st,self,x));}
  828. Vt*vmod(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM){D ny=yn;
  829. if(ny==0)R _NAN;R Vnn(fmod(xn,ny));}
  830. R _NAN;}
  831. Vt*vtake(St*st,vt*self,Vt*x,Vt*y);
  832. Vt*vdrop(St*st,vt*self,Vt*x,Vt*y);
  833. B spnp(D v){R isnan(v)||v==INFINITY||v==-INFINITY;}
  834. Vt*vodometer(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  835. elif(xal<2)R st->udf;
  836. Z p=1;
  837. Z xl=xal;
  838. for(Z i=0;i<xl;i++){Vt*it=xad[i];
  839. if(it->tag!=NUM||spnp(it->val.number))R st->udf;
  840. p*=(Z)(it->val.number);}
  841. if(p<1)R st->unit;
  842. uint64_t*lims=maa(SO(U64)*xl);
  843. for(Z i=0;i<xl;i++)lims[i]=(Z)(((Vt*)xad[i])->val.number);
  844. uint64_t**z=ma(SO(uint64_t*)*p);
  845. for(Z i=0;i<p;i++)z[i]=maa(SO(U64)*xl);
  846. for(Z i=0;i<p-1;i++){uint64_t*r=z[i];
  847. uint64_t*s=z[i+1];
  848. B carry=T;
  849. for(Z j=0;j<xl;j++){U64 a=xl-1-j;
  850. s[a]=r[a];
  851. if(carry){s[a]++;carry=F;}
  852. if(s[a]>=lims[a]){s[a]=0;carry=T;}}}
  853. FR(lims);
  854. Ar*r=An();
  855. for(Z i=0;i<p;i++){Ar*rw=An();
  856. for(Z j=0;j<xl;j++)Ap(rw,Vnn(z[i][j]));
  857. Ap(r,Vna(rw));
  858. FR(z[i]);}
  859. FR(z);R Vna(r);}
  860. Vt*vchunks(St*st,vt*self,Vt*x,Vt*y){if(xt!=NUM)R st->udf;
  861. if(yt!=ARRAY)y=venlist(st,N,y);
  862. elif(!yad)R y;
  863. Ar*r=An();
  864. Z cl=fabs(xn);
  865. for(Z i=0;i<yal;i+=cl)Ap(r,vtake(st,N,Vnn(cl),vdrop(st,N,Vnn(i),y)));R Vna(r);}
  866. Vt*vexp(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(exp(xn));R _NAN;}
  867. Vt*vpower(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(pow(xn,yn));R _NAN;}
  868. Vt*vnlog(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(log(xn));R _NAN;}
  869. Vt*vlog(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(log(yn)/log(xn));R _NAN;}
  870. I bits_needed(U32 value){I bits=0;
  871. for(I bit_test=16;bit_test>0;bit_test>>=1){if(value>>bit_test!=0){bits+=bit_test;
  872. value>>=bit_test;}}
  873. R bits+value;}
  874. Vt*vbits(St*st,vt*self,Vt*x){if(xt==NUM){I n=xn;
  875. I bk=bits_needed(n);
  876. Ar*r=Ana(bk);
  877. for(I i=0;i<bk;i++)if((n &(1<<i))>>i)Ap(r,NUMS[1]);
  878. else Ap(r,NUMS[0]);R Vna(r);}
  879. R st->udf;}
  880. Vt*vreverse(St*st,vt*self,Vt*x);
  881. Vt*vbase(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM){Z v=fabs(yn);
  882. Z b=fabs(xn);
  883. if(b<2)R st->udf;
  884. Ar*r=An();
  885. WH(v>0){Ap(r,Vnn(v%b));
  886. v/=b;}
  887. R vreverse(st,N,Vna(r));}
  888. R st->udf;}
  889. SZ indexOf(Ar*l,Vt*x){if(!l->data)return-1;
  890. for(Z i=0;i<l->length;i++)if(Veq(l->data[i],x))R i;
  891. return-1;}
  892. Vt*vgroup(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  893. elif(!xad)R x;
  894. Ar*r=An();
  895. Ar*is=An();
  896. for(Z i=0;i<xal;i++){Vt*v=xad[i];
  897. SZ n=indexOf(is,v);
  898. if(n<0){Ap(r,venlist(st,N,Vnn(i)));
  899. Ap(is,v);}else{Vt*tmp=Ai(r,n);
  900. Ap(tmp->val.array,Vnn(i));}}
  901. FR(is->data);
  902. FR(is);R Vna(r);}
  903. Vt*vbuckets(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,N,x);
  904. elif(!xad)R y;
  905. if(yt!=ARRAY)y=venlist(st,N,x);
  906. elif(!yad)R y;
  907. Ar*r=An();
  908. Z mx=0;
  909. for(Z i=0;i<xal;i++){Vt*v=xad[i];
  910. if(v->tag!=NUM)BR;
  911. SZ j=vn;
  912. if(j>=0&&j>mx)mx=j;}
  913. for(Z i=0;i<mx+1;i++)Ap(r,An());
  914. if(!r->data){FR(r);R st->unit;}
  915. for(Z i=0;i<xal;i++){if(i>=yal)BR;
  916. Vt*v=xad[i];
  917. if(v->tag!=NUM)BR;
  918. SZ j=vn;
  919. if(j>=0){Ar*b=Ai(r,j);
  920. if(b)Ap(b,yad[i]);}}
  921. if(xal<yal){Ar*lb=An();
  922. for(Z i=xal;i<yal;i++)Ap(lb,yad[i]);
  923. Ap(r,lb);}
  924. for(Z i=0;i<r->length;i++)r->data[i]=Vna(r->data[i]);R Vna(r);}
  925. Vt*vequals(St*st,vt*self,Vt*x,Vt*y){R Veq(x,y)?NUMS[1]:NUMS[0];}
  926. Vt*vpermute(St*st,vt*self,Vt*x){if(xt!=ARRAY||xal<2)R x;
  927. Ar*permutation=Ac(xa);
  928. Z length=permutation->length;
  929. Ar*result=An();
  930. Ap(result,Ac(permutation));
  931. Ar*c=An();
  932. for(Z i=0;i<length;i++){Z*n=maa(SO(Z));
  933. Ap(c,n);}
  934. Z k;
  935. Ar*p;
  936. Z i=0;
  937. WH(i<length){Z*n=Ai(c,i);
  938. if((*n)<i){k=i%2&&(*n);
  939. p=Ai(permutation,i);
  940. As(permutation,i,Ai(permutation,k));
  941. As(permutation,k,p);
  942. *n=(*n)+1;
  943. i=1;
  944. Ap(result,Ac(permutation));}else{*n=0;
  945. i++;}}
  946. for(Z i=0;i<c->length;i++)FR(c->data[i]);
  947. FR(c->data);
  948. FR(c);
  949. FR(permutation->data);
  950. FR(permutation);
  951. for(Z i=0;i<result->length;i++)result->data[i]=Vna(result->data[i]);R Vna(result);}
  952. Vt*voccurences(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  953. elif(!xad)R x;
  954. Ar*table=An();
  955. Ar*r=An();
  956. for(Z i=0;i<xal;i++){B f=F;
  957. Vt*it=xad[i];
  958. for(Z j=0;j<table->length;j++){Ar*p=table->data[j];
  959. if(Veq(p->data[0],it)){Z*n=p->data[1];
  960. *n=(*n)+1;
  961. Ap(r,Vnn(*n));
  962. f=T;BR;}}
  963. if(!f){Ar*p=Ank(2);
  964. p->data[0]=it;
  965. Z*n=maa(SO(Z));
  966. p->data[1]=n;
  967. Ap(table,p);
  968. Ap(r,NUMS[0]);}}
  969. for(Z i=0;i<table->length;i++){Ar*p=table->data[i];
  970. FR(p->data[1]);
  971. FR(p->data);
  972. FR(p);}
  973. FR(table->data);
  974. FR(table);R Vna(r);}
  975. Vt*vmask(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,N,x);
  976. elif(!xad)R x;
  977. if(yt!=ARRAY)y=venlist(st,N,y);
  978. Ar*r=An();
  979. Vt*l=Vnn(yal);
  980. Z n=0;
  981. Z k=xal;
  982. for(Z i=0;i<k;i++){Vt*s=vtake(st,N,l,vdrop(st,N,Vnn(i),x));
  983. if(Veq(s,y)){n++;
  984. for(Z j=0;j<l->val.number;j++,i++)Ap(r,Vnn(n));
  985. i--;}else Ap(r,NUMS[0]);}
  986. R Vna(r);}
  987. Vt*vclassify(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  988. elif(!xad)R x;
  989. Ar*table=An();
  990. Ar*r=An();
  991. for(Z i=0;i<xal;i++){B f=F;
  992. Vt*it=xad[i];
  993. for(Z j=0;j<table->length;j++){Ar*p=table->data[j];
  994. if(Veq(p->data[0],it)){Z*n=p->data[1];
  995. Ap(r,Vnn(*n));
  996. f=T;BR;}}
  997. if(!f){Ar*p=Ank(2);
  998. p->data[0]=it;
  999. Z*n=maa(SO(Z));
  1000. *n=i++;
  1001. p->data[1]=n;
  1002. Ap(table,p);
  1003. Ap(r,Vnn(*n));}}
  1004. for(Z i=0;i<table->length;i++){Ar*p=table->data[i];
  1005. FR(p->data[1]);
  1006. FR(p->data);
  1007. FR(p);}
  1008. FR(table->data);
  1009. FR(table);R Vna(r);}
  1010. Vt*vunbits(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  1011. I n=0;
  1012. for(Z i=0;i<xal;i++){if(VTp(xad[i]))n|=(int)1<<(int)i;
  1013. else n &=~((int)1<<(int)i);}
  1014. R Vnn(n);}
  1015. Vt*vunbase(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM){Z b=fabs(xn);
  1016. if(b<2)R st->udf;
  1017. if(yt!=ARRAY)y=venlist(st,N,y);
  1018. Z n=0;
  1019. if(!yad)R st->udf;
  1020. for(Z i=0;i<yal;i++){Vt*v=yad[i];
  1021. if(v->tag!=NUM)BR;
  1022. Z k=fabs(vn);
  1023. n=n*b+k;}
  1024. R Vnn(n);}
  1025. R st->udf;}
  1026. Vt*vnot(St*st,vt*self,Vt*x){R VTp(x)?NUMS[0]:NUMS[1];}
  1027. Vt*vnot_equals(St*st,vt*self,Vt*x,Vt*y){R !Veq(x,y)?NUMS[1]:NUMS[0];}
  1028. Vt*vpred(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(xn-1);
  1029. elif(xt==CHAR)R Vnc(x->val._char-1);R _NAN;}
  1030. Vt*vless(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)<Vnum(y))R NUMS[1];R NUMS[0];}
  1031. R _NAN;}
  1032. Vt*vfloor(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(floor(xn));R _NAN;}
  1033. I _compare_up(cP a,cP b){Vt*x=(*(Ar**)a)->data[0];
  1034. Vt*y=(*(Ar**)b)->data[0];
  1035. if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)>Vnum(y))R 1;
  1036. elif(Vnum(x)<Vnum(y))return-1;R 0;}
  1037. R 0;}
  1038. I _compare_down(cP a,cP b){Vt*x=(*(Ar**)a)->data[0];
  1039. Vt*y=(*(Ar**)b)->data[0];
  1040. if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)>Vnum(y))return-1;
  1041. elif(Vnum(x)<Vnum(y))R 1;R 0;}
  1042. R 0;}
  1043. Vt*_grade(Vt*x,B down){if(xt!=ARRAY||xal<2)R x;
  1044. Ar*ps=Ank(xal);
  1045. for(Z i=0;i<xal;i++){Ar*p=Ank(2);
  1046. p->data[0]=xad[i];
  1047. p->data[1]=Vnn(i);
  1048. ps->data[i]=p;}
  1049. qsort(ps->data,ps->length,SO(P ),down?_compare_down:_compare_up);
  1050. for(Z i=0;i<ps->length;i++){Ar*p=ps->data[i];
  1051. ps->data[i]=p->data[1];
  1052. FR(p->data);
  1053. FR(p);}
  1054. R Vna(ps);}
  1055. Vt*vgradedown(St*st,vt*self,Vt*x){R _grade(x,T);}
  1056. Vt*vnudge_left(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)R venlist(st,N,x);
  1057. elif(!yad)R y;
  1058. elif(yal<2)R venlist(st,N,x);
  1059. Ar*r=An();
  1060. for(Z i=1;i<yal;i++)Ap(r,yad[i]);
  1061. Ap(r,x);R Vna(r);}
  1062. Vt*vlesseq(St*st,vt*self,Vt*x,Vt*y){if(Veq(x,y))R NUMS[1];
  1063. if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)<Vnum(y))R NUMS[1];R NUMS[0];}
  1064. R _NAN;}
  1065. Vt*vsucc(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(xn+1);
  1066. elif(xt==CHAR)R Vnc(x->val._char+1);R _NAN;}
  1067. Vt*vceil(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(ceil(xn));R _NAN;}
  1068. Vt*vgreater(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)>Vnum(y))R NUMS[1];R NUMS[0];}
  1069. R _NAN;}
  1070. Vt*vgreatereq(St*st,vt*self,Vt*x,Vt*y){if(Veq(x,y))R NUMS[1];
  1071. if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)>Vnum(y))R NUMS[1];R NUMS[0];}
  1072. R _NAN;}
  1073. Vt*vgradeup(St*st,vt*self,Vt*x){R _grade(x,F);}
  1074. Vt*vnudge_right(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)R venlist(st,N,x);
  1075. elif(!yad)R y;
  1076. elif(yal<2)R venlist(st,N,x);
  1077. Ar*r=An();
  1078. Ap(r,x);
  1079. for(Z i=0;i<yal-1;i++)Ap(r,yad[i]);R Vna(r);}
  1080. Vt*venlist(St*st,vt*self,Vt*x){Ar*l=An();
  1081. Ap(l,x);R Vna(l);}
  1082. Vt*vjoin(St*st,vt*self,Vt*x,Vt*y){Ar*l=An();
  1083. if(xt==ARRAY&&xad)for(Z i=0;i<xal;i++)Ap(l,xad[i]);
  1084. else Ap(l,x);
  1085. if(yt==ARRAY&&yad)for(Z i=0;i<yal;i++)Ap(l,yad[i]);
  1086. else Ap(l,y);R Vna(l);}
  1087. Vt*venpair(St*st,vt*self,Vt*x,Vt*y){Ar*l=An();
  1088. Ap(l,x);
  1089. Ap(l,y);R Vna(l);}
  1090. Vt*vselfref1(St*st,vt*self,Vt*x){vt*v;
  1091. if(st->args->data)v=Ai(Ai(st->args,-1),-1);
  1092. elif(st->selfrefs->data)v=Ai(st->selfrefs,-1);
  1093. else R st->udf;R eR(st,v,x,0,v->rank[0]);}
  1094. Vt*vselfref2(St*st,vt*self,Vt*x,Vt*y){vt*v;
  1095. if(st->args->data)v=Ai(Ai(st->args,-1),-1);
  1096. elif(st->selfrefs->data)v=Ai(st->selfrefs,-1);
  1097. else R st->udf;R tgth(st,v,x,y,0,0,v->rank[1],v->rank[2]);}
  1098. Vt*vtake(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM){if(yt!=ARRAY){if(xn==0)R st->unit;
  1099. else R x;}
  1100. if(xn==0||!yad)R st->unit;
  1101. B rev=xn<0;
  1102. Z k=(Z)fabs(xn);
  1103. Ar*r=Ank(yal<k?yal:k);
  1104. Z p=0;
  1105. if(rev)for(SZ i=k;i>0;i--){Vt*v=Ai(ya,-i);
  1106. if(!v)CN;
  1107. r->data[p++]=v;}
  1108. else for(Z i=0;i<yal&&k;i++,k--)r->data[p++]=yad[i];R Vna(r);}
  1109. R st->udf;}
  1110. Vt*vwhere(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  1111. elif(!xad)R x;
  1112. Ar*r=An();
  1113. for(Z i=0;i<xal;i++){Vt*a=xad[i];
  1114. if(a->tag!=NUM)BR;
  1115. Z k=fabs(a->val.number);
  1116. for(Z j=0;j<k;j++)Ap(r,Vnn(i));}
  1117. R Vna(r);}
  1118. Vt*vcopy(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,N,x);
  1119. if(yt!=ARRAY)y=venlist(st,N,y);
  1120. Ar*tx=xa;
  1121. Ar*ty=ya;
  1122. if(!tx->data||!ty->data)R st->unit;
  1123. Ar*r=An();
  1124. for(Z i=0;i<tx->length;i++){Vt*a=tx->data[i];
  1125. Vt*b=ty->data[i>=ty->length?ty->length-1:i];
  1126. if(b->tag!=NUM)BR;
  1127. Z k=fabs(b->val.number);
  1128. for(Z i=0;i<k;i++)Ap(r,a);}
  1129. R Vna(r);}
  1130. Vt*vnub(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R x;
  1131. Ar*n=An();
  1132. Ar*r=An();
  1133. for(Z i=0;i<xal;i++){B u=T;
  1134. for(Z j=0;j<r->length;j++)if(Veq(xad[i],r->data[j])){u=F;BR;}
  1135. if(u)Ap(r,xad[i]);
  1136. Ap(n,u?NUMS[1]:NUMS[0]);}
  1137. FR(r->data);
  1138. FR(r);R Vna(n);}
  1139. Vt*vdrop(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM){if(yt!=ARRAY){if(xn==0)R y;
  1140. else R st->unit;}
  1141. if(xn==0)R y;
  1142. if(!yad)R st->unit;
  1143. B rev=xn<0;
  1144. Z k=(Z)fabs(xn);
  1145. if(rev){Z l=yal;
  1146. if(k>=l)R st->unit;R vtake(st,N,Vnn(l-k),y);}
  1147. Ar*r=An();
  1148. for(Z i=k;i<yal;i++)Ap(r,yad[i]);R Vna(r);}
  1149. R st->udf;}
  1150. Vt*vunique(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R x;
  1151. Ar*r=An();
  1152. for(Z i=0;i<xal;i++){B u=T;
  1153. for(Z j=0;j<r->length;j++)if(Veq(xad[j],r->data[j])){u=F;BR;}
  1154. if(u)Ap(r,xad[i]);}
  1155. R Vna(r);}
  1156. Vt*vfind(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,self,y);
  1157. elif(!yad)R st->unit;
  1158. Ar*r=An();
  1159. for(Z i=0;i<yal;i++)if(Veq(yad[i],x))Ap(r,Vnn(i));R Vna(r);}
  1160. Vt*vcount(St*st,vt*self,Vt*x){if(xt!=ARRAY)R NUMS[1];R Vnn(xal);}
  1161. V flatten(Vt*x,Ar*r){if(xt==ARRAY)
  1162. for(Z i=0;i<xal;i++)flatten(xad[i],r);
  1163. else Ap(r,x);}
  1164. Vt*vflatten(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R x;
  1165. Ar*r=An();
  1166. flatten(x,r);R Vna(r);}
  1167. Vt*vminand(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)<Vnum(y))R x;R y;}
  1168. R _NAN;}
  1169. Vt*vreverse(St*st,vt*self,Vt*x){if(xt!=ARRAY)R x;
  1170. if(xal<2)R x;
  1171. Ar*r=An();
  1172. for(SZ i=xal-1;i>=0;i--)Ap(r,xad[i]);R Vna(r);}
  1173. Vt*vmaxor(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(Vnum(x)>Vnum(y))R x;R y;}
  1174. R _NAN;}
  1175. Vt*vrotate(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||yal<2)R x;
  1176. if(xt!=NUM)R st->udf;
  1177. B rev=xn<0;
  1178. Z k=fabs(xn);
  1179. Ar*r=Ac(ya);
  1180. for(Z i=0;i<k;i++){Vt*v;
  1181. if(rev){v=r->data[0];
  1182. for(Z j=0;j<r->length-1;j++)r->data[j]=r->data[j+1];
  1183. r->data[r->length-1]=v;}
  1184. else{v=r->data[r->length-1];
  1185. for(Z j=r->length-1;j>0;j--)r->data[j]=r->data[j-1];
  1186. r->data[0]=v;}}
  1187. R Vna(r);}
  1188. Vt*vwindows(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,N,y);
  1189. elif(!yad)R y;
  1190. Z k=fabs(xn);
  1191. Z l=yal;
  1192. Ar*r=An();
  1193. for(Z i=0;i<l;i++){if(i+k>l)BR;
  1194. Ap(r,vtake(st,N,Vnn(k),vdrop(st,N,Vnn(i),y)));}
  1195. R Vna(r);}
  1196. Z depthOf(Vt*x,Z d){if(xt==ARRAY){if(!xad)R 0;
  1197. for(Z i=0;i<xal;i++){Z d2=depthOf(xad[i],d+1);
  1198. if(d2>d)d=d2;}
  1199. R d;}
  1200. R 0;}
  1201. Vt*vdepth(St*st,vt*self,Vt*x){R Vnn(depthOf(x,1));}
  1202. Vt*vround(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(round(xn));R _NAN;}
  1203. Vt*vabs(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(fabs(xn));R _NAN;}
  1204. Vt*vtail(St*st,vt*self,Vt*x);
  1205. Vt*vat(St*st,vt*self,Vt*x,Vt*y){if(yt!=NUM)R st->udf;
  1206. if(xt!=ARRAY){if(yn>-1&&yn<1)R x;
  1207. else R st->udf;}
  1208. if(!xad)R st->nil;
  1209. Vt*v=Ai(xa,(SZ)yn);
  1210. if(!v)R st->udf;R v;}
  1211. Vt*vmember(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,self,y);
  1212. elif(!yad)R NUMS[0];
  1213. for(Z i=0;i<yal;i++)if(Veq(yad[i],x))R NUMS[1];R NUMS[0];}
  1214. Vt*vshuffle(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,self,x);
  1215. elif(!xad)R x;
  1216. Ar*r=Ac(xa);
  1217. for(Z i=0;i<r->length;i++){Z j=rand()%r->length;
  1218. Vt*tmp=r->data[i];
  1219. r->data[i]=r->data[j];
  1220. r->data[j]=tmp;}
  1221. R Vna(r);}
  1222. Vt*vhead(St*st,vt*self,Vt*x){R vtake(st,N,NUMS[2],x);}
  1223. Vt*vbin(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,self,x);
  1224. elif(!xad)R x;
  1225. if(yt!=ARRAY)y=venlist(st,self,x);
  1226. elif(!yad)R y;
  1227. Z xl=xal;
  1228. Ar*bins=An();
  1229. for(Z i=0;i<xl;i++){D s;
  1230. D e;
  1231. Vt*vs=xad[i];
  1232. if(vs->tag==NUM)s=vs->val.number;
  1233. elif(vs->tag==CHAR)s=vs->val._char;
  1234. else R st->udf;
  1235. Vt*ve=i==xl-1?Vnn(s+1):xad[i+1];
  1236. if(ve->tag==NUM)e=fabs(ve->val.number);
  1237. elif(ve->tag==CHAR)e=ve->val._char;
  1238. else R st->udf;
  1239. if(bins->data){Ar*pp=Ai(bins,-1);
  1240. D*pe=pp->data[0];
  1241. if(s<=(*pe))R st->udf;}
  1242. D*sn=ma(SO(D));
  1243. *sn=s;
  1244. D*en=ma(SO(D));
  1245. *en=e;
  1246. Ar*p=An();
  1247. Ap(p,sn);
  1248. Ap(p,en);
  1249. Ap(bins,p);}
  1250. Z bl=bins->length;
  1251. Ar*r=An();
  1252. Z yl=yal;
  1253. for(Z i=0;i<yl;i++){Vt*it=yad[i];
  1254. D itv;
  1255. if(it->tag==NUM)itv=it->val.number;
  1256. elif(it->tag==CHAR)itv=it->val._char;
  1257. else R st->udf;
  1258. Ar*b=bins->data[0];
  1259. D*s=b->data[0];
  1260. if(itv<(*s)){Ap(r,NNUMS[0]);CN;}
  1261. b=Ai(bins,-1);
  1262. s=b->data[1];
  1263. if(itv>=(*s)){Ap(r,Vnn(bl-1));CN;}
  1264. D v=NAN;
  1265. for(Z j=0;j<bl;j++){b=bins->data[j];
  1266. D*s=b->data[0];
  1267. D*e=b->data[1];
  1268. if(itv>=(*s)&&itv<(*e)){v=j;BR;}}
  1269. if(!isnan(v))Ap(r,Vnn(v));}
  1270. for(Z j=0;j<bl;j++){Ar*b=bins->data[j];
  1271. FR(b->data[0]);
  1272. FR(b->data[1]);
  1273. FR(b->data);
  1274. FR(b);}
  1275. FR(bins->data);
  1276. FR(bins);R Vna(r);}
  1277. Vt*vtail(St*st,vt*self,Vt*x){if(xt!=ARRAY)R x;
  1278. if(!xad)R st->udf;R Ai(xa,-1);}
  1279. Vt*vcut(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,self,x);
  1280. elif(!xad)R x;
  1281. if(yt!=ARRAY)y=venlist(st,self,x);
  1282. elif(!yad)R x;
  1283. if(xal!=2)R st->udf;
  1284. Vt*vs=xad[0];
  1285. Vt*ve=xad[1];
  1286. if(vs->tag!=NUM||ve->tag!=NUM)R st->udf;
  1287. Z s=fabs(vs->val.number);
  1288. Z e=fabs(ve->val.number);
  1289. Ar*r=An();
  1290. Z l=yal;
  1291. Ar*pa=An();
  1292. for(Z i=s;i<e&&i<l;i++){Vt*v=Ai(ya,i);
  1293. if(!v)BR;
  1294. Ap(pa,v);}
  1295. Ar*pb=An();
  1296. for(Z i=e;i<l;i++){Vt*v=Ai(ya,i);
  1297. if(!v)BR;
  1298. Ap(pb,v);}
  1299. Ap(r,Vna(pa));
  1300. Ap(r,Vna(pb));R Vna(r);}
  1301. Vt*vprefixes(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  1302. Ar*r=An();
  1303. for(Z i=0;i<xal;i++)Ap(r,vtake(st,N,Vnn(i),x));
  1304. Ap(r,x);R Vna(r);}
  1305. Vt*vbehead(St*st,vt*self,Vt*x){R vdrop(st,N,NUMS[1],x);}
  1306. Vt*vcurtail(St*st,vt*self,Vt*x){R vdrop(st,N,NNUMS[0],x);}
  1307. Vt*vsuffixes(St*st,vt*self,Vt*x){if(xt!=ARRAY)x=venlist(st,N,x);
  1308. Ar*r=An();
  1309. for(Z i=0;i<xal;i++)Ap(r,vdrop(st,N,Vnn(i),x));
  1310. Ap(r,st->unit);R Vna(r);}
  1311. Vt*vleft(St*st,vt*self,Vt*x,Vt*y){R x;}
  1312. Vt*vsame(St*st,vt*self,Vt*x){R x;}
  1313. Vt*vright(St*st,vt*self,Vt*x,Vt*y){R y;}
  1314. Vt*vsymbol(St*st,vt*self,Vt*x){S s=Vshow(x);R Vny(s);}
  1315. Vt*vapply1(St*st,vt*self,Vt*x,Vt*y){R apM(st,x,y);}
  1316. Vt*vapply2(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||yal<2)R st->udf;R apD(st,x,yad[0],yad[1]);}
  1317. Vt*vshape(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R st->unit;
  1318. if(!Aap(xa))R venlist(st,N,vcount(st,N,x));
  1319. if(xal<2)R venlist(st,N,vshape(st,N,xad[0]));R venpair(st,N,vcount(st,N,x),vcount(st,N,xad[0]));}
  1320. Vt*vreshape(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,N,y);
  1321. elif(!yad)R y;
  1322. if(xt!=ARRAY)x=venlist(st,N,x);
  1323. elif(!xad)R st->unit;
  1324. Ar*r;
  1325. if(xal<2){Vt*a=xad[0];
  1326. if(a->tag!=NUM)R st->udf;
  1327. Z k=fabs(a->val.number);
  1328. Ar*t=An();
  1329. flatten(y,t);
  1330. r=An();
  1331. for(Z i=0;i<k;i++)Ap(r,t->data[i>=t->length?t->length-1:i]);}elif(xal>1){Vt*a=xad[0];
  1332. if(a->tag!=NUM)R st->udf;
  1333. Vt*b=xad[1];
  1334. if(a->tag!=NUM)R st->udf;
  1335. Z k=fabs(a->val.number);
  1336. Z l=fabs(b->val.number);
  1337. y=vreshape(st,self,venlist(st,N,Vnn(k*l)),y);
  1338. r=An();
  1339. WH(k--){Ar*rw=An();
  1340. for(Z i=0;i<l;i++)Ap(rw,yad[i]);
  1341. Ap(r,Vna(rw));}}else R st->udf;R Vna(r);}
  1342. Vt*vrepr(St*st,vt*self,Vt*x){S s=Vshow(x);
  1343. Ar*r=An();
  1344. for(Z i=0;i<strlen(s);i++)Ap(r,Vnc(s[i]));
  1345. FR(s);R Vna(r);}
  1346. S format(S template,Ar*replaces){Bt*text=Bnew();
  1347. B skip=F;
  1348. Z ri=0;
  1349. Z tl=strlen(template);
  1350. Z rl=replaces->length;
  1351. for(Z i=0;i<tl;i++){C c=template[i];
  1352. if(skip){Bappend(text,c);
  1353. skip=F;CN;}
  1354. if(c=='_'){S s=Vshow(Ai(replaces,ri));
  1355. BappendS(text,s);
  1356. FR(s);
  1357. if(ri<rl-1)ri++;CN;}elif(c=='{'){Z bi=i;
  1358. Bt*n=Bnew();
  1359. i++;
  1360. WH(i<tl&&template[i]!='}')Bappend(n,template[i++]);
  1361. if(i>=tl||template[i]!='}'){FR(Bread(n));
  1362. Bappend(text,'{');
  1363. i=bi;CN;}
  1364. S s=Bread(n);
  1365. SZ ind=atoi(s);
  1366. FR(s);
  1367. Vt*v=Ai(replaces,ind);
  1368. if(!v)CN;
  1369. s=Vshow(v);
  1370. BappendS(text,s);
  1371. FR(s);CN;}elif(c=='~'){skip=T;CN;}
  1372. Bappend(text,c);}
  1373. R Bread(text);}
  1374. Vt*vformat(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,N,x);
  1375. elif(!yad)R y;
  1376. S fmt=Vshow(x);
  1377. S s=format(fmt,ya);
  1378. FR(fmt);
  1379. Ar*r=An();
  1380. WH(*s)Ap(r,Vnc(*s++));R Vna(r);}
  1381. Vt*vinsert(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY)y=venlist(st,N,y);
  1382. Ar*r=An();
  1383. for(Z i=0;i<yal;i++){Ap(r,yad[i]);
  1384. if(i!=yal-1)Ap(r,x);}
  1385. R Vna(r);}
  1386. U64 fibonacci(U64 n){U64 a=0;
  1387. U64 b=1;
  1388. WH(n-->1){U64 t=a;
  1389. a=b;
  1390. b+=t;}
  1391. R b;}
  1392. Vt*vfibonacci(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(fibonacci((U64)fabs(xn)));R _NAN;}
  1393. Vt*viota(St*st,vt*self,Vt*x){if(Veq(x,NUMS[1]))R venlist(st,N,NUMS[1]);
  1394. elif(Veq(x,NUMS[0]))R st->unit;R vrange(st,self,NUMS[1],x);}
  1395. Vt*vrange(St*st,vt*self,Vt*x,Vt*y){if((xt==NUM||xt==CHAR)&&(yt==NUM||yt==CHAR)){if(xt==NUM&&spnp(xn))R st->udf;
  1396. if(yt==NUM&&spnp(yn))R st->udf;
  1397. SZ s=Vnum(x);
  1398. SZ e=Vnum(y);
  1399. if(s==e)R venlist(st,N,x);
  1400. Z p=0;
  1401. Ar*r=Ank((s>e?s-e:e-s)+1);
  1402. if(s>e)for(SZ i=s;i>=e;i--){if(xt==CHAR||yt==CHAR)r->data[p++]=CHARS[i];
  1403. else r->data[p++]=Vnn(i);}
  1404. else for(SZ i=s;i<=e;i++){if(xt==CHAR||yt==CHAR)r->data[p++]=CHARS[i];
  1405. else r->data[p++]=Vnn(i);}
  1406. R Vna(r);}
  1407. R _NAN;}
  1408. Vt*vdeal(St*st,vt*self,Vt*x){if(xt!=ARRAY)R x;
  1409. if(!xad)R st->udf;R xad[rand()%xal];}
  1410. Vt*vroll(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM){Ar*r=An();
  1411. Z k=fabs(xn);
  1412. Z d=fabs(yn);
  1413. for(Z i=0;i<k;i++)Ap(r,Vnn(rand()%d));R Vna(r);}
  1414. R st->udf;}
  1415. Vt*vtype(St*st,vt*self,Vt*x){R NUMS[xt];}
  1416. Vt*vcast(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM){I t=fabs(xn);
  1417. if(yt==t)R y;
  1418. SW(t){CS ARRAY:if(yt==SYM){S s=yY;
  1419. Ar*r=An();
  1420. WH(*s)Ap(r,Vnc(*s++));R Vna(r);}BR;
  1421. CS NUM:if(yt==CHAR)R Vnn(y->val._char);
  1422. elif(yt==ARRAY&&Cap(ya)){Bt*buf=Bnew();
  1423. for(Z i=0;i<yal;i++)Bappend(buf,((Vt*)yad[i])->val._char);
  1424. S s=Bread(buf);
  1425. D r=strtod(s,N);
  1426. FR(s);R Vnn(r);}BR;
  1427. CS CHAR:if(yt==NUM)R Vnc(yn);BR;}}
  1428. R st->udf;}
  1429. Vt*vprint(St*st,vt*self,Vt*x){S s=Vshow(x);
  1430. fprintf(stdout,"%s",s);
  1431. FR(s);R st->nil;}
  1432. Vt*vprintln(St*st,vt*self,Vt*x){S s=Vshow(x);
  1433. fprintf(stdout,"%s\n",s);
  1434. FR(s);R st->nil;}
  1435. Vt*vexit(St*st,vt*self,Vt*x){if(xt!=NUM)R st->udf;
  1436. I code=xn;
  1437. exit(code);R st->nil;}
  1438. Vt*vread(St*st,vt*self,Vt*x){if(x==NUMS[0]){Bt*buf=Bnew();
  1439. Z size=0;
  1440. LOOP{I c=fgetc(stdin);
  1441. if(c<0)BR;
  1442. Bappend(buf,c);size++;}
  1443. S s=Bread(buf);
  1444. Ar*r=An();
  1445. for(Z i=0;i<size;i++)Ap(r,Vnc(s[i]));
  1446. FR(s);R Vna(r);}
  1447. elif(x==NUMS[1]){C line[512];
  1448. if(!fgets(line,SO(line),stdin))R st->udf;
  1449. Ar*r=An();
  1450. for(Z i=0;i<strlen(line);i++)Ap(r,Vnc(line[i]));R Vna(r);}
  1451. S path=Vshow(x);
  1452. FILE*fd=fopen(path,"rb");
  1453. if(!fd){FR(path);R st->udf;}
  1454. fseek(fd,0,SEEK_END);
  1455. Z size=ftell(fd);
  1456. fseek(fd,0,SEEK_SET);
  1457. UC*buf=ma(size+1);
  1458. if(!buf)R st->udf;
  1459. size=fread(buf,SO(UC),size,fd);
  1460. fclose(fd);
  1461. FR(path);
  1462. Ar*r=Ana(size);
  1463. for(Z i=0;i<size;i++)Ap(r,Vnc(buf[i]));
  1464. FR(buf);R Vna(r);}
  1465. Vt*vwrite(St*st,vt*self,Vt*x,Vt*y){FILE*fd;
  1466. S path=N;
  1467. if(xt!=ARRAY)x=venlist(st,N,x);
  1468. if(y==NUMS[0])fd=stderr;
  1469. else{path=Vshow(y);
  1470. fd=fopen(path,"wb");
  1471. if(!fd){FR(path);R NNUMS[0];}}
  1472. Z k=0;
  1473. for(Z i=0;i<xal;i++){UC c;
  1474. Vt*v=xad[i];
  1475. if(v->tag==NUM)c=fabs(vn);
  1476. elif(v->tag==CHAR)c=v->val._char;
  1477. else BR;
  1478. fputc(c,fd);
  1479. k++;}
  1480. fclose(fd);
  1481. if(path)FR(path);R Vnn(k);}
  1482. Vt*vsystem(St*st,vt*self,Vt*x){S cmd=Vshow(x);
  1483. FILE*pd;
  1484. pd=popen(cmd,"r");
  1485. if(!pd){FR(cmd);R st->udf;}
  1486. UC*buffer=N;
  1487. Z Bsize=0;
  1488. Z Ballocated=0;
  1489. Z bytes_received;
  1490. UC chunk[1024];
  1491. LOOP{bytes_received=fread(chunk,1,1024,pd);
  1492. if(bytes_received==0)BR;
  1493. Z head=Bsize;
  1494. Bsize+=bytes_received;
  1495. if(Bsize>Ballocated){Ballocated=Bsize;
  1496. if(!buffer)buffer=ma(Ballocated);
  1497. else buffer=mrea(buffer,Ballocated);
  1498. if(!buffer){FR(cmd);
  1499. pclose(pd);R st->udf;}}
  1500. for(Z i=0;i<bytes_received;i++)buffer[head+i]=chunk[i];
  1501. if(feof(pd))BR;}
  1502. pclose(pd);
  1503. FR(cmd);
  1504. Ar*r=Ana(Bsize);
  1505. for(Z i=0;i<Bsize;i++)Ap(r,Vnc(buffer[i]));
  1506. FR(buffer);R Vna(r);}
  1507. struct files_t{FILE*in;
  1508. FILE*out;};
  1509. typedef struct files_t files_t;
  1510. struct files_chain_t{files_t files;
  1511. pid_t pid;
  1512. struct files_chain_t*next;};
  1513. typedef struct files_chain_t files_chain_t;
  1514. static files_chain_t*files_chain;
  1515. V _cleanup_pipe(int*pipe){close(pipe[0]);
  1516. close(pipe[1]);}
  1517. static I _do_popen2(files_chain_t*link,cS command){I child_in[2];
  1518. I child_out[2];
  1519. if(0!=pipe(child_in))return-1;
  1520. if(0!=pipe(child_out)){_cleanup_pipe(child_in);
  1521. return-1;}
  1522. pid_t cpid=link->pid=fork();
  1523. if(0>cpid){_cleanup_pipe(child_in);
  1524. _cleanup_pipe(child_out);
  1525. return-1;}
  1526. if(0==cpid){if(0>dup2(child_in[0],0)||0>dup2(child_out[1],1))_Exit(127);
  1527. _cleanup_pipe(child_in);
  1528. _cleanup_pipe(child_out);
  1529. for(files_chain_t*p=files_chain;p;p=p->next){I fd_in=fileno(p->files.in);
  1530. if(fd_in!=0)close(fd_in);
  1531. I fd_out=fileno(p->files.out);
  1532. if(fd_out!=1)close(fd_out);}
  1533. execl("/bin/sh","sh","-c",command,(S )N);
  1534. _Exit(127);}
  1535. close(child_in[0]);
  1536. close(child_out[1]);
  1537. link->files.in=fdopen(child_in[1],"w");
  1538. link->files.out=fdopen(child_out[0],"r");R 0;}
  1539. files_t*popen2(cS command){files_chain_t*link=(files_chain_t*)malloc(SO(files_chain_t));
  1540. if(N==link)R N;
  1541. if(0>_do_popen2(link,command)){free(link);R N;}
  1542. link->next=files_chain;
  1543. files_chain=link;R(files_t*)link;}
  1544. I pclose2(files_t*fp){files_chain_t**p=&files_chain;
  1545. I found=0;
  1546. WH(*p){if(*p==(files_chain_t*)fp){*p=(*p)->next;
  1547. found=1;BR;}
  1548. p=&(*p)->next;}
  1549. if(!found)return-1;
  1550. if(0>fclose(fp->out)){free((files_chain_t*)fp);
  1551. return-1;}
  1552. I status=-1;
  1553. pid_t wait_pid;
  1554. do{wait_pid=waitpid(((files_chain_t*)fp)->pid,&status,0);}WH(-1==wait_pid&&EINTR==errno);
  1555. free((files_chain_t*)fp);
  1556. if(wait_pid==-1)return-1;R status;}
  1557. Vt*vsystem2(St*st,vt*self,Vt*x,Vt*y){S cmd=Vshow(y);
  1558. files_t*pd;
  1559. pd=popen2(cmd);
  1560. if(pd==N){FR(cmd);R st->udf;}
  1561. for(Z i=0;i<xal;i++){UC c;
  1562. Vt*v=xad[i];
  1563. if(v->tag==NUM)c=fabs(vn);
  1564. elif(v->tag==CHAR)c=v->val._char;
  1565. else BR;
  1566. fputc(c,pd->in);}
  1567. fflush(pd->in);
  1568. fclose(pd->in);
  1569. UC*buffer=N;
  1570. Z Bsize=0;
  1571. Z Ballocated=0;
  1572. Z bytes_received;
  1573. UC chunk[1024];
  1574. LOOP{bytes_received=fread(chunk,1,1024,pd->out);
  1575. if(bytes_received==0)BR;
  1576. Z head=Bsize;
  1577. Bsize+=bytes_received;
  1578. if(Bsize>Ballocated){Ballocated=Bsize;
  1579. if(!buffer)buffer=ma(Ballocated);
  1580. else buffer=mrea(buffer,Ballocated);
  1581. if(!buffer){FR(cmd);
  1582. pclose2(pd);R st->udf;}}
  1583. for(Z i=0;i<bytes_received;i++)buffer[head+i]=chunk[i];
  1584. if(feof(pd->out))BR;}
  1585. pclose2(pd);
  1586. FR(cmd);
  1587. Ar*r=Ana(Bsize);
  1588. for(Z i=0;i<Bsize;i++)Ap(r,Vnc(buffer[i]));
  1589. FR(buffer);R Vna(r);}
  1590. Vt*vshl(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(((int)xn)<<((int)yn));R _NAN;}
  1591. Vt*vshr(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(((int)xn)>>((int)yn));R _NAN;}
  1592. Vt*vxor(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(((int)xn)^((int)yn));R _NAN;}
  1593. Vt*vband(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(((int)xn)&((int)yn));R _NAN;}
  1594. Ar*find_primes(U64 limit){B sieve[limit+1];
  1595. for(U64 i=0;i<=limit;i++)sieve[i]=F;
  1596. if(limit>2)sieve[2]=T;
  1597. if(limit>3)sieve[3]=T;
  1598. for(U64 x=1;x*x<=limit;x++)for(U64 y=1;y*y<=limit;y++){U64 n=(4*x*x)+(y*y);
  1599. if(n<=limit&&(n%12==1||n%12==5))sieve[n]^=T;
  1600. n=(3*x*x)+(y*y);
  1601. if(n<=limit&&n%12==7)sieve[n]^=T;
  1602. n=(3*x*x)-(y*y);
  1603. if(x>y&&n<=limit&&n%12==11)sieve[n]^=T;}
  1604. for(U64 r=5;r*r<=limit;r++)if(sieve[r])for(I i=r*r;i<=limit;i+=r*r)sieve[i]=F;
  1605. Ar*r=An();
  1606. for(U64 a=1;a<=limit;a++)if(sieve[a])Ap(r,Vnn(a));R r;}
  1607. Vt*vprimes(St*st,vt*self,Vt*x){if(xt==NUM&&!spnp(xn))R Vna(find_primes(fabs(xn)+1));R st->udf;}
  1608. Vt*vparts(St*st,vt*self,Vt*x,Vt*y){if(xt!=NUM)R st->udf;
  1609. if(yt!=ARRAY)y=venlist(st,N,y);
  1610. elif(!yad)R y;
  1611. if(spnp(xn)||xn<1)R y;
  1612. Z np=fabs(xn);
  1613. Ar*r=Ana(np);
  1614. Z l=yal;
  1615. Z k=ceil(((D)l)/(D)np);
  1616. WH(yt==ARRAY&&yad){if(yal<=k){Ap(r,y);BR;}
  1617. Ap(r,vtake(st,N,Vnn(k),y));
  1618. y=vdrop(st,N,Vnn(k),y);}
  1619. R Vna(r);}
  1620. Vt*vbor(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM)R Vnn(((int)xn)|((int)yn));R _NAN;}
  1621. Vt*vbnot(St*st,vt*self,Vt*x){if(xt==NUM)R Vnn(~(int)xn);R _NAN;}
  1622. Ar*prime_factors(D n){Ar*factors=An();
  1623. D divisor=2;
  1624. WH(n>=2){if(fmod(n,divisor)==0){Ap(factors,Vnn(divisor));
  1625. n/=divisor;}else divisor++;}
  1626. R factors;}
  1627. Vt*vfactors(St*st,vt*self,Vt*x){if(xt==NUM&&!spnp(xn))R Vna(prime_factors(xn));R st->udf;}
  1628. Vt*vcombine(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM&&!spnp(xn)&&!spnp(yn)){Vt*n=venpair(st,N,x,y);R vunbase(st,N,NUMS[10],n);}
  1629. R _NAN;}
  1630. Vt*voutof(St*st,vt*self,Vt*x,Vt*y){if(xt==NUM&&yt==NUM&&!spnp(xn)&&!spnp(yn)&&xn>0&&yn>0){U64 a=(U64)fabs(xn);
  1631. U64 b=(U64)fabs(yn);R Vnn(factorial(b)/(factorial(a)*(a>=b?1:factorial(b-a))));}
  1632. R _NAN;}
  1633. Vt*vsort(St*st,vt*self,Vt*x){Vt*i=vgradeup(st,N,x);R tgth(st,st->at,x,i,0,0,st->at->rank[1],st->at->rank[2]);}
  1634. Vt*vunsort(St*st,vt*self,Vt*x){Vt*i=vgradedown(st,N,x);R tgth(st,st->at,x,i,0,0,st->at->rank[1],st->at->rank[2]);}
  1635. Vt*Srun(St*st,S program);
  1636. Vt*veval(St*st,vt*self,Vt*x){S s=Vshow(x);
  1637. jmp_buf*lb=guard();
  1638. if(setjmp(*lb)){unguard();
  1639. FR(s);R st->udf;}
  1640. Vt*v=Srun(st,s);
  1641. FR(s);
  1642. unguard();R v;}
  1643. Vt*vimport(St*st,vt*self,Vt*x){S path=Vshow(x);
  1644. FILE*fd=fopen(path,"rb");
  1645. if(!fd){FR(path);R st->udf;}
  1646. fseek(fd,0,SEEK_END);
  1647. Z size=ftell(fd);
  1648. fseek(fd,0,SEEK_SET);
  1649. UC*buf=ma(size+1);
  1650. if(!buf)R st->udf;
  1651. size=fread(buf,SO(UC),size,fd);
  1652. fclose(fd);
  1653. FR(path);
  1654. Vt*v=Srun(st,(S )buf);
  1655. FR(buf);R v;}
  1656. Vt*vexplode(St*st,vt*self,Vt*x,Vt*y){S del=Vshow(x);
  1657. S s=Vshow(y);
  1658. Z dell=strlen(del);
  1659. Z sl=strlen(s);
  1660. Ar*r=An();
  1661. Ar*t=An();
  1662. for(Z i=0;i<sl;i++){if(strncmp(&s[i],del,dell)==0){Ap(r,Vna(t));
  1663. t=An();
  1664. i+=dell-1;CN;}
  1665. Ap(t,CHARS[s[i]]);}
  1666. FR(s);
  1667. FR(del);
  1668. Ap(r,Vna(t));R Vna(r);}
  1669. Vt*vimplode(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||!yad)R y;
  1670. S del=Vshow(x);
  1671. Ar*r=An();
  1672. for(Z i=0;i<yal;i++){S s=Vshow(yad[i]);
  1673. S _s=s;
  1674. WH(*_s)Ap(r,CHARS[*_s++]);
  1675. FR(s);
  1676. if(i!=yal-1){S s=del;
  1677. WH(*s)Ap(r,CHARS[*s++]);}}
  1678. FR(del);R Vna(r);}
  1679. Vt*veye(St*st,vt*self,Vt*x){if(xt==NUM&&!spnp(xn)){Z k=fabs(xn);
  1680. Ar*r=Ana(k);
  1681. for(Z i=0;i<k;i++){Ar*rw=Ana(k);
  1682. for(Z j=0;j<k;j++)Ap(rw,NUMS[i==j]);
  1683. Ap(r,Vna(rw));}
  1684. R Vna(r);}
  1685. R st->udf;}
  1686. Vt*vudf1(St*st,vt*self,Vt*x){R st->udf;}
  1687. Vt*vudf2(St*st,vt*self,Vt*x,Vt*y){R st->udf;}
  1688. #define X UINT_MAX
  1689. #define DEFVERB(__symb,__rm,__rl,__rr,__m,__d){__symb,{__rm,__rl,__rr},N,F,F,v##__m,v##__d}
  1690. #define DEFVERBD(__symb,__rm,__rl,__rr,__m,__d){__symb ".",{__rm,__rl,__rr},N,F,F,v##__m,v##__d}
  1691. #define DEFVERBC(__symb,__rm,__rl,__rr,__m,__d){__symb ":",{__rm,__rl,__rr},N,F,F,v##__m,v##__d}
  1692. vt VERBS[]={DEFVERB(":",0,0,0,const,bind),DEFVERBC(":",X,0,0,unbind,obverse),DEFVERB("+",0,X,X,flip,plus),DEFVERBD("+",X,X,X,fibonacci,gcd),DEFVERBC("+",X,X,X,sin,combine),DEFVERB("-",X,X,X,negate,minus),DEFVERBD("-",X,X,X,atan,atan2),DEFVERB("*",0,X,X,first,times),DEFVERBD("*",X,X,X,factorial,lcm),DEFVERBC("*",X,X,0,double,replicate),DEFVERB("%",X,X,X,reciprocal,divide),DEFVERBD("%",X,X,X,sqrt,root),DEFVERBC("%",X,X,X,halve,idivide),DEFVERB("!",X,X,X,enum,mod),DEFVERBD("!",X,X,X,iota,range),DEFVERBC("!",0,X,0,odometer,chunks),DEFVERB("^",X,X,X,exp,power),DEFVERBD("^",X,X,X,nlog,log),DEFVERB("=",0,X,X,permute,equals),DEFVERBD("=",0,0,0,occurences,mask),DEFVERBC("=",0,0,0,classify,equals),DEFVERB("~",X,X,X,not,not_equals),DEFVERBD("~",X,0,0,sign,insert),DEFVERBC("~",0,0,0,not,not_equals),DEFVERB("<",X,X,X,pred,less),DEFVERBD("<",X,X,X,floor,lesseq),DEFVERBC("<",0,X,0,gradedown,nudge_left),DEFVERB(">",X,X,X,succ,greater),DEFVERBD(">",X,X,X,ceil,greatereq),DEFVERBC(">",0,X,0,gradeup,nudge_right),DEFVERB(",",0,0,0,enlist,join),DEFVERBD(",",X,0,0,enlist,enpair),DEFVERB("#",0,X,0,count,take),DEFVERBD("#",0,0,0,where,copy),DEFVERBC("#",0,0,0,group,buckets),DEFVERB("_",0,X,0,nub,drop),DEFVERBD("_",0,X,0,unbits,unbase),DEFVERBC("_",X,X,X,bits,base),DEFVERB("?",0,0,0,unique,find),DEFVERB("&",0,X,X,flatten,minand),DEFVERB("|",0,X,X,reverse,maxor),DEFVERBD("|",X,X,0,round,rotate),DEFVERBC("|",0,X,0,depth,windows),DEFVERB("@",X,0,X,abs,at),DEFVERBD("@",0,0,0,shuffle,member),DEFVERB("{",0,0,0,head,bin),DEFVERBD("{",0,0,0,tail,cut),DEFVERBC("{",0,X,X,prefixes,shl),DEFVERB("}",0,X,X,behead,xor),DEFVERBD("}",0,0,0,curtail,band),DEFVERBC("}",0,X,X,suffixes,shr),DEFVERB("[",X,0,0,factors,left),DEFVERBD("[",X,X,X,bnot,bor),DEFVERBC("[",X,X,0,primes,parts),DEFVERB("]",0,0,0,same,right),DEFVERBD("]",0,X,X,sort,outof),DEFVERBC("]",0,0,0,unsort,explode),DEFVERBD("`",0,0,0,symbol,apply1),DEFVERBC("`",0,0,0,square,apply2),DEFVERB("$",0,0,0,shape,reshape),DEFVERBD("$",0,0,0,repr,format),DEFVERBC("$",X,0,0,eye,implode),DEFVERBD("p",0,0,0,print,udf2),DEFVERBD("P",0,0,0,println,udf2),DEFVERBD("f",0,0,0,selfref1,selfref2),DEFVERBD("F",0,0,0,read,write),DEFVERBD("r",0,X,X,deal,roll),DEFVERBD("t",0,0,0,type,cast),DEFVERBD("E",0,0,0,exit,udf2),DEFVERBD("y",0,0,0,system,system2),DEFVERBD("e",0,0,0,eval,udf2),DEFVERBD("i",0,0,0,import,udf2)};
  1693. Vt*_advfold_m(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R x;
  1694. Vt*_v=self->bonds->data[0];
  1695. if(_v->tag!=VERB)R st->udf;
  1696. vt*v=_v->val.verb;
  1697. Vt*t=xad[0];
  1698. Ar*tx=xa;
  1699. for(Z i=1;i<tx->length;i++)t=tgth(st,v,t,tx->data[i],0,0,v->rank[1],v->rank[2]);R t;}
  1700. Vt*_advfold_d(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||!yad)R y;
  1701. Vt*_v=self->bonds->data[0];
  1702. if(_v->tag!=VERB)R st->udf;
  1703. vt*v=_v->val.verb;
  1704. Vt*t=x;
  1705. Ar*ty=ya;
  1706. for(Z i=0;i<ty->length;i++)t=tgth(st,v,t,ty->data[i],0,0,v->rank[1],v->rank[2]);R t;}
  1707. Vt*_advscan_m(St*st,vt*self,Vt*x){if(xt!=ARRAY||!xad)R x;
  1708. Vt*_v=self->bonds->data[0];
  1709. if(_v->tag!=VERB)R st->udf;
  1710. vt*v=_v->val.verb;
  1711. Ar*r=An();
  1712. Vt*t=xad[0];
  1713. Ar*tx=xa;
  1714. Ap(r,t);
  1715. for(Z i=1;i<tx->length;i++){t=tgth(st,v,t,tx->data[i],0,0,v->rank[1],v->rank[2]);
  1716. Ap(r,t);}
  1717. R Vna(r);}
  1718. Vt*_advscan_d(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||!yad)R y;
  1719. Vt*_v=self->bonds->data[0];
  1720. if(_v->tag!=VERB)R st->udf;
  1721. vt*v=_v->val.verb;
  1722. Ar*r=An();
  1723. Vt*t=x;
  1724. Ar*ty=ya;
  1725. Ap(r,t);
  1726. for(Z i=1;i<ty->length;i++){t=tgth(st,v,t,ty->data[i],0,0,v->rank[1],v->rank[2]);
  1727. Ap(r,t);}
  1728. R Vna(r);}
  1729. Vt*_adveach_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1730. if(_v->tag!=VERB)R st->udf;
  1731. vt*v=_v->val.verb;
  1732. if(xt!=ARRAY)R eR(st,v,x,0,1);
  1733. if(!xad)R x;R eR(st,v,x,0,1);}
  1734. Vt*_adveach_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1735. if(_v->tag!=VERB)R st->udf;
  1736. vt*v=_v->val.verb;
  1737. if(xt!=ARRAY)x=venlist(st,N,x);
  1738. if(yt!=ARRAY)y=venlist(st,N,y);
  1739. Ar*r=An();
  1740. Ar*tx=xa;
  1741. Ar*ty=ya;
  1742. for(Z i=0;i<tx->length&&i<ty->length;i++)Ap(r,tgth(st,v,tx->data[i],ty->data[i],0,0,v->rank[1],v->rank[2]));R Vna(r);}
  1743. Vt*_advconverge_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1744. if(_v->tag!=VERB)R st->udf;
  1745. vt*v=_v->val.verb;
  1746. Vt*t;
  1747. LOOP{t=x;
  1748. x=eR(st,v,x,0,v->rank[0]);
  1749. if(Veq(x,t))BR;}
  1750. R x;}
  1751. vt*cnjbond(St*st,Vt*x,Vt*y);
  1752. Vt*_advconverge_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1753. if(_v->tag!=VERB)R st->udf;
  1754. vt*v=_v->val.verb;
  1755. if(yt!=ARRAY)R tgth(st,v,y,x,0,0,v->rank[1],v->rank[2]);
  1756. if(!yad)R x;
  1757. v=cnjbond(st,Vnv(v),x);R eR(st,v,y,0,1);}
  1758. Vt*_advconverges_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1759. if(_v->tag!=VERB)R st->udf;
  1760. Ar*r=An();
  1761. Vt*t;
  1762. Ap(r,x);
  1763. LOOP{t=x;
  1764. x=apM(st,_v,x);
  1765. if(Veq(x,t))BR;
  1766. Ap(r,x);}
  1767. R Vna(r);}
  1768. Vt*_advconverges_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1769. if(_v->tag!=VERB)R st->udf;
  1770. vt*v=_v->val.verb;
  1771. if(yt!=ARRAY)R tgth(st,v,y,x,0,0,v->rank[1],v->rank[2]);
  1772. if(!yad)R x;
  1773. v=cnjbond(st,x,Vnv(v));R eR(st,v,y,0,1);}
  1774. Vt*_adveachprior_m(St*st,vt*self,Vt*x){if(xt!=ARRAY||xal<2)R x;
  1775. Vt*_v=self->bonds->data[0];
  1776. if(_v->tag!=VERB)R st->udf;
  1777. vt*v=_v->val.verb;
  1778. Ar*r=An();
  1779. for(Z i=1;i<xal;i++)Ap(r,tgth(st,v,xad[i],xad[i-1],0,0,v->rank[1],v->rank[2]));R Vna(r);}
  1780. Vt*_adveachprior_d(St*st,vt*self,Vt*x,Vt*y){if(yt!=ARRAY||!yad)R y;
  1781. Vt*_v=self->bonds->data[0];
  1782. if(_v->tag!=VERB)R st->udf;
  1783. vt*v=_v->val.verb;
  1784. Ar*r=An();
  1785. for(Z i=0;i<yal;i++)Ap(r,tgth(st,v,yad[i],i==0?x:yad[i-1],0,0,v->rank[1],v->rank[2]));R Vna(r);}
  1786. Vt*_advreflex_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1787. if(_v->tag!=VERB)R st->udf;
  1788. vt*v=_v->val.verb;R tgth(st,v,x,x,0,0,v->rank[1],v->rank[2]);}
  1789. Vt*_advreflex_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1790. if(_v->tag!=VERB)R st->udf;
  1791. vt*v=_v->val.verb;R tgth(st,v,y,x,0,0,v->rank[1],v->rank[2]);}
  1792. Vt*_advamend_m(St*st,vt*self,Vt*x){R st->udf;}
  1793. Vt*_advamend_d(St*st,vt*self,Vt*x,Vt*y){if(xt!=ARRAY)x=venlist(st,N,x);
  1794. Vt*v=self->bonds->data[0];
  1795. if(v->tag!=ARRAY)v=venlist(st,N,v);
  1796. if(yt!=ARRAY)y=venlist(st,N,y);
  1797. Ar*r=Ac(ya);
  1798. Z l=xal;
  1799. Ar*t=v->val.array;
  1800. for(Z i=0;i<t->length;i++){Vt*n=t->data[i];
  1801. if(n->tag!=NUM)BR;
  1802. As(r,n->val.number,Ai(xa,i<l?i:l-1));}
  1803. R Vna(r);}
  1804. Vt*_advfilter_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1805. if(_v->tag!=VERB)R st->udf;
  1806. if(xt!=ARRAY)x=venlist(st,N,x);
  1807. elif(!xad)R x;
  1808. vt*v=_v->val.verb;
  1809. Ar*r=An();
  1810. for(Z i=0;i<xal;i++){Vt*b=eR(st,v,xad[i],0,v->rank[0]);
  1811. if(VTp(b))Ap(r,xad[i]);}
  1812. R Vna(r);}
  1813. Vt*_advfilter_d(St*st,vt*self,Vt*x,Vt*y){R st->udf;}
  1814. Vt*_advspan_m(St*st,vt*self,Vt*x){Vt*v=self->bonds->data[0];
  1815. if(v->tag!=VERB)R st->udf;
  1816. if(xt!=ARRAY)x=venlist(st,N,x);
  1817. elif(!xad)R x;
  1818. Ar*r=An();
  1819. Ar*p=An();
  1820. for(Z i=0;i<xal;i++){Vt*b=apM(st,v,xad[i]);
  1821. if(VTp(b)){Ap(r,Vna(p));
  1822. p=An();}else Ap(p,xad[i]);}
  1823. Ap(r,Vna(p));R Vna(r);}
  1824. Vt*_advspan_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1825. if(_v->tag!=VERB)R st->udf;
  1826. vt*v=_v->val.verb;
  1827. Vt*r=vwindows(st,N,x,y);R eR(st,v,r,0,1);}
  1828. Vt*_advinverse_m(St*st,vt*self,Vt*x){Vt*_v=self->bonds->data[0];
  1829. if(_v->tag!=VERB)R st->udf;
  1830. vt*v=_v->val.verb;
  1831. vt*iv=Tget(Inverses,v->name);
  1832. if(!iv)R st->udf;R eR(st,iv,x,0,iv->rank[0]);}
  1833. Vt*_advinverse_d(St*st,vt*self,Vt*x,Vt*y){Vt*_v=self->bonds->data[0];
  1834. if(_v->tag!=VERB)R st->udf;
  1835. vt*v=_v->val.verb;
  1836. vt*iv=Tget(Inverses,v->name);
  1837. if(!iv)R st->udf;
  1838. Vt*a=eR(st,iv,x,0,iv->rank[0]);
  1839. Vt*b=eR(st,iv,y,0,iv->rank[0]);R apD(st,_v,a,b);}
  1840. #define ADVERB(__name,__symb)\
  1841. vt*adv##__name(St*st,Vt*v){\
  1842. vt*nv=vnew();\
  1843. nv->bonds=An();\
  1844. Ap(nv->bonds,v);\
  1845. S r=Vshow(v);\
  1846. Z l=strlen(r)+strlen(__symb)+1;\
  1847. nv->name=ma(l);\
  1848. snprintf(nv->name,l,"%s" __symb,r);\
  1849. FR(r);\
  1850. nv->rank[0]=0;\
  1851. nv->monad=_adv##__name##_m;\
  1852. nv->dyad=_adv##__name##_d;\
  1853. R nv;}
  1854. ADVERB(fold,"/");
  1855. ADVERB(converge,"/.");
  1856. ADVERB(scan,"\\");
  1857. ADVERB(converges,"\\.");
  1858. ADVERB(each,"\"");
  1859. ADVERB(eachprior,"\".");
  1860. ADVERB(reflex,";.");
  1861. ADVERB(amend,"`");
  1862. ADVERB(filter,"&.");
  1863. ADVERB(span,"/:");
  1864. ADVERB(inverse,"-:");
  1865. advt ADVERBS[]={{"/",advfold,N}, {"/.",advconverge,N},{"\\",advscan,N}, {"\\.",advconverges,N},{"\"",adveach,N}, {"\".",adveachprior,N},{";.",advreflex,N},{"`",advamend,N},{"&.",advfilter,N},{"/:",advspan,N},{"-:",advinverse,N}};
  1866. Vt*_cnjbond_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1867. Vt*v2=self->bonds->data[1];
  1868. if(v1->tag==VERB&&v2->tag==VERB)R apM(st,v1,apM(st,v2,x));
  1869. elif(v1->tag==VERB)R apD(st,v1,x,v2);
  1870. elif(v2->tag==VERB)R apD(st,v2,v1,x);
  1871. else R st->nil;}
  1872. Vt*_cnjbond_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1873. Vt*v2=self->bonds->data[1];
  1874. if(v1->tag==VERB&&v2->tag==VERB)R apM(st,v1,apD(st,v2,x,y));
  1875. elif(v1->tag==VERB)R apD(st,v1,apD(st,v1,x,y),v2);
  1876. elif(v2->tag==VERB)R apD(st,v2,v1,apD(st,v2,x,y));
  1877. else R st->nil;}
  1878. Vt*_cnjpick_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1879. Vt*v2=self->bonds->data[1];
  1880. if(v1->tag!=VERB||v2->tag!=ARRAY)R st->nil;
  1881. Vt*n=apM(st,v1,x);
  1882. Vt*f=vat(st,N,v2,n);R apM(st,f,x);}
  1883. Vt*_cnjpick_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1884. Vt*v2=self->bonds->data[1];
  1885. if(v1->tag!=VERB||v2->tag!=ARRAY)R st->nil;
  1886. Vt*n=apD(st,v1,x,y);
  1887. Vt*f=vat(st,N,v2,n);R apD(st,f,x,y);}
  1888. Vt*_cnjwhile_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1889. Vt*v2=self->bonds->data[1];
  1890. if(v1->tag==VERB){LOOP{if(!VTp(apM(st,v1,x)))BR;
  1891. x=apM(st,v2,x);}}elif(v1->tag==NUM){Z k=(Z)fabs(v1->val.number);
  1892. for(Z i=0;i<k;i++)x=apM(st,v2,x);}
  1893. R x;}
  1894. Vt*_cnjwhile_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1895. Vt*v2=self->bonds->data[1];
  1896. if(v1->tag==VERB){LOOP{if(!VTp(apD(st,v1,x,y)))BR;
  1897. x=apD(st,v2,x,y);}}elif(v1->tag==NUM){Z k=(Z)fabs(v1->val.number);
  1898. for(Z i=0;i<k;i++)x=apD(st,v2,x,y);}
  1899. R x;}
  1900. Vt*_cnjrank_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1901. Vt*v2=self->bonds->data[1];
  1902. if(v1->tag!=VERB||v2->tag!=NUM)R st->udf;
  1903. UI rank=
  1904. v2->val.number==INFINITY?UINT_MAX:fabs(v2->val.number);R eR(st,v1->val.verb,x,0,rank);}
  1905. Vt*_cnjrank_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1906. Vt*v2=self->bonds->data[1];
  1907. if(v1->tag!=VERB)R st->udf;
  1908. UI rl;
  1909. UI rr;
  1910. if(v2->tag==NUM)rl=rr=v2->val.number==INFINITY?UINT_MAX:fabs(v2->val.number);
  1911. elif(v2->tag==ARRAY&&v2->val.array->length==2){Vt*a=v2->val.array->data[0];
  1912. Vt*b=v2->val.array->data[1];
  1913. if(a->tag!=NUM)R st->udf;
  1914. rl=a->val.number==INFINITY?UINT_MAX:fabs(a->val.number);
  1915. if(b->tag!=NUM)R st->udf;
  1916. rr=b->val.number==INFINITY?UINT_MAX:fabs(b->val.number);}
  1917. else R st->udf;R tgth(st,v1->val.verb,x,y,0,0,rl,rr);}
  1918. Vt*_cnjmonaddyad_m(St*st,vt*self,Vt*x){Vt*v=self->bonds->data[0];
  1919. if(v->tag!=VERB)R st->udf;R eR(st,v->val.verb,x,0,v->val.verb->rank[0]);}
  1920. Vt*_cnjmonaddyad_d(St*st,vt*self,Vt*x,Vt*y){Vt*v=self->bonds->data[1];
  1921. if(v->tag!=VERB)R st->udf;R tgth(st,v->val.verb,x,y,0,0,v->val.verb->rank[1],v->val.verb->rank[2]);}
  1922. Vt*_cnjif_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1923. Vt*v2=self->bonds->data[1];
  1924. if(v1->tag!=VERB||v2->tag!=VERB)R st->udf;
  1925. Vt*b=apM(st,v2,x);
  1926. if(VTp(b))R x;R apM(st,v1,x);}
  1927. Vt*_cnjif_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1928. Vt*v2=self->bonds->data[1];
  1929. if(v1->tag!=VERB||v2->tag!=VERB)R st->udf;
  1930. Vt*b=apD(st,v2,x,y);
  1931. if(VTp(b))R y;R apD(st,v1,x,y);}
  1932. Vt*_cnjunder_m(St*st,vt*self,Vt*x){Vt*v1=self->bonds->data[0];
  1933. Vt*v2=self->bonds->data[1];
  1934. if(v1->tag!=VERB||v2->tag!=VERB)R st->udf;
  1935. vt*iv=Tget(Inverses,v2->val.verb->name);
  1936. if(!iv)R st->udf;
  1937. Vt*v=apM(st,v2,x);
  1938. v=apM(st,v1,v);R eR(st,iv,v,0,iv->rank[0]);}
  1939. Vt*_cnjunder_d(St*st,vt*self,Vt*x,Vt*y){Vt*v1=self->bonds->data[0];
  1940. Vt*v2=self->bonds->data[1];
  1941. if(v1->tag!=VERB||v2->tag!=VERB)R st->udf;
  1942. vt*iv=Tget(Inverses,v2->val.verb->name);
  1943. if(!iv)R st->udf;
  1944. Vt*a=apM(st,v2,x);
  1945. Vt*b=apM(st,v2,y);
  1946. Vt*v=apD(st,v1,a,b);R eR(st,iv,v,0,iv->rank[0]);}
  1947. #define CONJUNCTION(__name,__symb)\
  1948. vt*cnj##__name(St*st,Vt*x,Vt*y){\
  1949. vt*nv=vnew();\
  1950. nv->bonds=An();\
  1951. Ap(nv->bonds,x);\
  1952. Ap(nv->bonds,y);\
  1953. S rx=Vshow(x);\
  1954. S ry=Vshow(y);\
  1955. Z l=strlen(rx)+strlen(ry)+strlen(__symb)+1;\
  1956. nv->name=ma(l);\
  1957. snprintf(nv->name,l,"%s"__symb"%s",rx,ry);\
  1958. FR(rx);\
  1959. FR(ry);\
  1960. nv->rank[0]=0;\
  1961. nv->rank[1]=0;\
  1962. nv->rank[1]=0;\
  1963. nv->monad=_cnj##__name##_m;\
  1964. nv->dyad=_cnj##__name##_d;\
  1965. R nv;}
  1966. CONJUNCTION(bond,";");
  1967. CONJUNCTION(pick,"?.");
  1968. CONJUNCTION(while,"?:");
  1969. CONJUNCTION(rank,"\":");
  1970. CONJUNCTION(monaddyad,";:");
  1971. CONJUNCTION(if,"&:");
  1972. CONJUNCTION(under,"^:");
  1973. advt CONJUNCTIONS[]={{";",N,cnjbond},{"?.",N,cnjpick},{"?:",N,cnjwhile},{"\":",N,cnjrank},{";:",N,cnjmonaddyad},{"&:",N,cnjif},{"^:",N,cnjunder}};
  1974. #define FINDER(kind,rname,table)\
  1975. kind*G##rname(S s){\
  1976. for(Z i=0;i<AE(table);i++){\
  1977. if(strcmp(table[i].name,s)==0)\
  1978. R &table[i];}\
  1979. R N;}
  1980. FINDER(vt,v,VERBS);
  1981. FINDER(advt,adv,ADVERBS);
  1982. FINDER(advt,cnj,CONJUNCTIONS);
  1983. Nt*Nn(enum Ntag_t tag){Nt*node=ma(SO(Nt));
  1984. node->tag=tag;R node;}
  1985. Nt*Nns(Ar*l){Nt*node=ma(SO(Nt));
  1986. node->tag=N_STRAND;
  1987. node->l=l;R node;}
  1988. Nt*Nnl(Vt*v){Nt*node=ma(SO(Nt));
  1989. node->tag=N_LITERAL;
  1990. node->v=v;R node;}
  1991. Nt*Nn1(enum Ntag_t tag,Nt*a){Nt*node=ma(SO(Nt));
  1992. node->tag=tag;
  1993. node->a=a;R node;}
  1994. Nt*Nn2(enum Ntag_t tag,Nt*a,Nt*b){Nt*node=ma(SO(Nt));
  1995. node->tag=tag;
  1996. node->a=a;
  1997. node->b=b;R node;}
  1998. Nt*Nn3(enum Ntag_t tag,Nt*a,Nt*b,Nt*c){Nt*node=ma(SO(Nt));
  1999. node->tag=tag;
  2000. node->a=a;
  2001. node->b=b;
  2002. node->c=c;R node;}
  2003. typedef struct{Lt*lexer;
  2004. St*st;
  2005. Z pos;
  2006. Z end;}Pt;
  2007. Pt*Pnew(St*state){Pt*parser=ma(SO(Pt));
  2008. parser->st=state;R parser;}
  2009. V Perror(Pt*parser,S s){fatal(s);}
  2010. B Pdone(Pt*parser){R parser->pos>=parser->end;}
  2011. Tkt*Plook(Pt*parser,Z offset){Z pos=parser->pos+offset;
  2012. if(pos>=parser->end)R N;R Ai(parser->lexer->tokens,pos);}
  2013. B Pstop(Pt*parser){Tkt*tok=Plook(parser,0);
  2014. if(!tok)R T;R tok->tag==T_RPAR;}
  2015. V Peat(Pt*parser){if(!Pdone(parser))parser->pos++;}
  2016. Nt*PPexpr(Pt*parser);
  2017. Nt*PPverb(Pt*parser){Tkt*tok=Plook(parser,0);
  2018. if(!tok||tok->tag!=T_PUNCT)R N;
  2019. vt*verb=Gv(tok->text);
  2020. if(!verb)R N;R Nnl(Vnv(verb));}
  2021. Vt*_advwrapper_m(St*st,vt*self,Vt*x){advt*av=self->bonds->data[0];
  2022. if(xt!=VERB)R st->nil;R Vnv(av->adverb(st,x));}
  2023. Vt*_advwrapper_d(St*st,vt*self,Vt*x,Vt*y){advt*av=self->bonds->data[0];
  2024. if(xt!=VERB)R st->nil;
  2025. vt*v=av->adverb(st,x);R eR(st,v,y,0,v->rank[0]);}
  2026. Nt*PPadvatom(Pt*parser){Tkt*tok=Plook(parser,0);
  2027. if(!tok||tok->tag!=T_PUNCT)R N;
  2028. advt*adverb=Gadv(tok->text);
  2029. if(!adverb)R N;
  2030. vt*nv=vnew();
  2031. nv->name=sdup(tok->text);
  2032. nv->bonds=An();
  2033. Ap(nv->bonds,adverb);
  2034. nv->rank[0]=0;
  2035. nv->rank[1]=0;
  2036. nv->rank[2]=0;
  2037. nv->monad=_advwrapper_m;
  2038. nv->dyad=_advwrapper_d;R Nnl(Vnv(nv));}
  2039. Vt*_cnjwrapper_d(St*st,vt*self,Vt*x,Vt*y){advt*av=self->bonds->data[0];R Vnv(av->conjunction(st,x,y));}
  2040. Nt*PPcnjatom(Pt*parser){Tkt*tok=Plook(parser,0);
  2041. if(!tok||tok->tag!=T_PUNCT)R N;
  2042. advt*adverb=Gcnj(tok->text);
  2043. if(!adverb)R N;
  2044. vt*nv=vnew();
  2045. nv->name=sdup(tok->text);
  2046. nv->bonds=An();
  2047. Ap(nv->bonds,adverb);
  2048. nv->rank[0]=0;
  2049. nv->rank[1]=0;
  2050. nv->rank[2]=0;
  2051. nv->monad=N;
  2052. nv->dyad=_cnjwrapper_d;R Nnl(Vnv(nv));}
  2053. Nt*PPatom(Pt*parser){Tkt*tok=Plook(parser,0);
  2054. Nt*node=N;
  2055. SW(tok->tag){CS T_RPAR:Perror(parser,"unmatched");
  2056. CS T_LPAR:Peat(parser);
  2057. tok=Plook(parser,0);
  2058. if(tok&&tok->tag==T_RPAR){node=Nnl(parser->st->unit);BR;}
  2059. node=PPexpr(parser);
  2060. tok=Plook(parser,0);
  2061. if(!tok||tok->tag!=T_RPAR)Perror(parser,"unmatched");BR;
  2062. CS T_PUNCT:node=PPverb(parser);
  2063. if(!node)node=PPadvatom(parser);
  2064. if(!node)node=PPcnjatom(parser);
  2065. if(!node)Perror(parser,"parse");BR;
  2066. CS T_NUM:node=Nnl(Vnn(strtod(tok->text,N)));BR;
  2067. CS T_NAME:node=Nnl(Vny(sdup(tok->text)));BR;
  2068. CS T_QUOTE:if(!*tok->text)node=Nnl(parser->st->unit);
  2069. elif(!*(tok->text+1))node=Nnl(Vnc(tok->text[0]));
  2070. else{Ar*arr=An();
  2071. for(Z i=0;i<strlen(tok->text);i++)Ap(arr,Vnc(tok->text[i]));
  2072. node=Nnl(Vna(arr));}BR;}
  2073. if(!node)Perror(parser,"parse");
  2074. Peat(parser);R node;}
  2075. Nt*PPa(Pt*parser,Nt*a,enum Tkt tag){Tkt*tok;
  2076. if((tok=Plook(parser,0))&&tok->tag==tag){Ar*as=An();
  2077. Ap(as,a->v);
  2078. do{a=PPatom(parser);
  2079. Ap(as,a->v);}WH((tok=Plook(parser,0))&&tok->tag==tag);R Nnl(Vna(as));}
  2080. R N;}
  2081. Nt*_PPnoun(Pt*parser){Nt*n;
  2082. Nt*a=PPatom(parser);
  2083. if(a->tag==N_LITERAL&&a->v->tag==NUM&&(n=PPa(parser,a,T_NUM)))R n;
  2084. elif(a->tag==N_LITERAL&&a->v->tag==SYM&&(n=PPa(parser,a,T_NAME)))R n;
  2085. elif(a->tag==N_LITERAL&&a->v->tag==ARRAY&&Cap(a->v->val.array)&&(n=PPa(parser,a,T_QUOTE)))R n;R a;}
  2086. Nt*PPnoun(Pt*parser,B flat){Nt*a=flat?PPatom(parser):_PPnoun(parser);
  2087. Tkt*tok;
  2088. if((tok=Plook(parser,0))&&tok->tag==T_PUNCT&&strcmp(tok->text,",:")==0){Peat(parser);
  2089. Ar*l=An();
  2090. Ap(l,a);
  2091. LOOP{a=flat?PPatom(parser):_PPnoun(parser);
  2092. Ap(l,a);
  2093. if(!((tok=Plook(parser,0))&&tok->tag==T_PUNCT&&strcmp(tok->text,",:")==0))BR;
  2094. Peat(parser);}
  2095. R Nns(l);}
  2096. R a;}
  2097. B Nisv(Pt*parser,Nt*n){Vt*v;
  2098. if(n->tag==N_FUN)R T;
  2099. elif(n->tag==N_ADV||n->tag==N_CONJ||n->tag==N_PARTIAL_CONJ)R T;
  2100. elif(n->tag==N_FORK||n->tag==N_HOOK||n->tag==N_BOND||n->tag==N_OVER)R T;
  2101. elif(n->tag==N_LITERAL&&n->v->tag==VERB)R T;
  2102. elif(n->tag==N_LITERAL&&n->v->tag==SYM&&(v=Tget(parser->st->env,n->v->val.symbol))&&v->tag==VERB)R T;R F;}
  2103. Nt*PPadv(Pt*parser,Nt*v,bool*flag){Tkt*tok;
  2104. advt*adv;
  2105. Nt*t;
  2106. LOOP{tok=Plook(parser,0);
  2107. if(!tok||tok->tag!=T_PUNCT)BR;
  2108. if((adv=Gadv(tok->text))){if(flag)*flag=T;
  2109. Peat(parser);
  2110. t=Nn(N_ADV);
  2111. t->av=adv;
  2112. t->a=v;
  2113. v=t;}else BR;}
  2114. R v;}
  2115. Nt*PPcnj(Pt*parser,Nt*v,bool*flag){Tkt*tok;
  2116. advt*adv;
  2117. Nt*t;
  2118. LOOP{tok=Plook(parser,0);
  2119. if(!tok||tok->tag!=T_PUNCT)BR;
  2120. if((adv=Gcnj(tok->text))){if(flag)*flag=T;
  2121. Peat(parser);
  2122. if(Pstop(parser)){t=Nn(N_PARTIAL_CONJ);
  2123. t->av=adv;
  2124. t->a=v;}else{t=Nn(N_CONJ);
  2125. t->av=adv;
  2126. t->a=v;
  2127. t->b=PPnoun(parser,T);}
  2128. v=t;}else BR;}
  2129. R v;}
  2130. B is_apply(Nt*n){R n->tag==N_LITERAL&&n->v->tag==VERB&&(strcmp(n->v->val.verb->name,"`.")==0||strcmp(n->v->val.verb->name,"`:")==0);}
  2131. B is_obverse(Nt*n){R n->tag==N_LITERAL&&n->v->tag==VERB&&strcmp(n->v->val.verb->name,"::")==0;}
  2132. Nt*PPexpr(Pt*parser){Tkt*tmp;
  2133. Ar*ns=An();
  2134. WH(!Pstop(parser)){if(!ns->data&&(tmp=Plook(parser,0))&&tmp->tag==T_PUNCT&&strcmp(tmp->text,":")==0&&(Plook(parser,1))){Peat(parser);R Nn1(N_FUN,PPexpr(parser));}
  2135. Nt*n=PPnoun(parser,F);
  2136. if(!ns->data&&n->tag==N_LITERAL&&n->v->tag==SYM&&(tmp=Plook(parser,0))&&tmp->tag==T_PUNCT&&strcmp(tmp->text,":")==0){Peat(parser);R Nn2(N_BIND,n,PPexpr(parser));}
  2137. LOOP{B flag=F;
  2138. n=PPadv(parser,n,&flag);
  2139. n=PPcnj(parser,n,&flag);
  2140. if(!flag)BR;}
  2141. Ap(ns,n);}
  2142. Z len;
  2143. Nt*l,*m,*r;
  2144. LOOP{len=ns->length;
  2145. if(len<2)BR;
  2146. if(len>=3&&(is_apply(Ai(ns,-2))||is_obverse(Ai(ns,-2)))&&Nisv(parser,Ai(ns,-1))){r=AP(ns);
  2147. m=AP(ns);
  2148. l=AP(ns);
  2149. Ap(ns,Nn3(N_DYAD,m,l,r));}elif(len>=3&&!Nisv(parser,Ai(ns,-1))&&Nisv(parser,Ai(ns,-2))&&!Nisv(parser,Ai(ns,-3))){r=AP(ns);
  2150. m=AP(ns);
  2151. l=AP(ns);
  2152. Ap(ns,Nn3(N_DYAD,m,l,r));}elif(len>=3&&Nisv(parser,Ai(ns,-1))&&Nisv(parser,Ai(ns,-2))&&Nisv(parser,Ai(ns,-3))){r=AP(ns);
  2153. m=AP(ns);
  2154. l=AP(ns);
  2155. Ap(ns,Nn3(N_FORK,l,m,r));}elif(len>=3&&Nisv(parser,Ai(ns,-1))&&Nisv(parser,Ai(ns,-2))&&!Nisv(parser,Ai(ns,-3))){r=AP(ns);
  2156. m=AP(ns);
  2157. l=AP(ns);
  2158. Ap(ns,Nn3(N_OVER,l,m,r));}elif(len>=2&&is_apply(Ai(ns,-1))){r=AP(ns);
  2159. l=AP(ns);
  2160. Ap(ns,Nn2(N_BOND,r,l));}elif(len>=2&&!Nisv(parser,Ai(ns,-1))&&Nisv(parser,Ai(ns,-2))){r=AP(ns);
  2161. l=AP(ns);
  2162. Ap(ns,Nn2(N_MONAD,l,r));}elif(len>=2&&Nisv(parser,Ai(ns,-1))&&Nisv(parser,Ai(ns,-2))){r=AP(ns);
  2163. l=AP(ns);
  2164. Ap(ns,Nn2(N_HOOK,l,r));}elif(len>=2&&Nisv(parser,Ai(ns,-1))&&!Nisv(parser,Ai(ns,-2))){r=AP(ns);
  2165. l=AP(ns);
  2166. Ap(ns,Nn2(N_BOND,r,l));}elif(len>=3){r=AP(ns);
  2167. m=AP(ns);
  2168. l=AP(ns);
  2169. Ap(ns,Nn3(N_INDEX2,m,l,r));}elif(len>=2){r=AP(ns);
  2170. l=AP(ns);
  2171. Ap(ns,Nn2(N_INDEX1,l,r));}}
  2172. R ns->data?ns->data[0]:N;}
  2173. Nt*Pparse(Pt*parser,Lt*lexer){parser->lexer=lexer;
  2174. parser->pos=0;
  2175. parser->end=parser->lexer->tokens->length;
  2176. Nt*node=PPexpr(parser);
  2177. if(!Pdone(parser)){Tkt*tok=Plook(parser,0);
  2178. if(tok&&tok->tag==T_RPAR)Perror(parser,"unmatched");
  2179. Perror(parser,"parse");}
  2180. R node;}
  2181. Vt*Srun(St*st,S program){Lt*lexer=Lnew();
  2182. Llex(lexer,program);
  2183. Pt*parser=Pnew(st);
  2184. Nt*node=Pparse(parser,lexer);
  2185. Ar*t=lexer->tokens;
  2186. for(Z i=0;i<t->length;i++){Tkt*tok=t->data[i];
  2187. if(tok->text)FR(tok->text);
  2188. FR(tok);}
  2189. FR(t->data);
  2190. FR(t);
  2191. Vt*r=Swalk(st,node);
  2192. FR(parser);R r;}
  2193. cS VHELP =\
  2194. ": monadic const create a function that always yields x" "\n"\
  2195. ": dyadic bind bind y to symbol x" "\n"\
  2196. ":: dyadic obverse insert inverse for x" "\n"\
  2197. "+ monadic flip transpose matrix" "\n"\
  2198. "+ dyadic plus add numbers" "\n"\
  2199. "+. monadic fibonacci compute xth fibonacci number" "\n"\
  2200. "+. dyadic gcd compute gcd(x, y)" "\n"\
  2201. "+: monadic sin compute sin(x)" "\n"\
  2202. "+: dyadic combine combine digits of x and y, same as 10_.(10_:),(10_:)" "\n"\
  2203. "- monadic negate negate number" "\n"\
  2204. "- dyadic minus subtract numbers" "\n"\
  2205. "* monadic first yield first element of x" "\n"\
  2206. "* dyadic times multiply numbers" "\n"\
  2207. "*. monadic factorial x!" "\n"\
  2208. "*. dyadic lcm compute lcm(x, y)" "\n"\
  2209. "*: monadic double x * 2" "\n"\
  2210. "*: dyadic replicate repeat y x times" "\n"\
  2211. "% monadic reciprocal 1 / x" "\n"\
  2212. "% dyadic divide divide numbers" "\n"\
  2213. "%. monadic sqrt compute square root of x" "\n"\
  2214. "%. dyadic root compute xth root of y" "\n"\
  2215. "%: monadic halve x % 2" "\n"\
  2216. "%: dyadic idivide same as % divide, but result is always integer" "\n"\
  2217. "! monadic enum [0, x)" "\n"\
  2218. "! dyadic mod modulo of numbers" "\n"\
  2219. "!. monadic iota [1, x]" "\n"\
  2220. "!. dyadic range [x, y] (also works for chars and even if x > y)" "\n"\
  2221. "!: monadic odometer !:10 10 is 0 0,:0 1,: ... 1 0,:1 1,: ... 9 8,:9 9" "\n"\
  2222. "!: dyadic chunks split y into x-sized chunks" "\n"\
  2223. "^ monadic exp e^x" "\n"\
  2224. "^ dyadic power raise number to a power" "\n"\
  2225. "^. monadic nlog ln(x)" "\n"\
  2226. "^. dyadic log log(y)/log(x)" "\n"\
  2227. "= monadic permute generate permutations of x" "\n"\
  2228. "= dyadic equals test whether x and y are equal" "\n"\
  2229. "=. monadic occurences count occurences of elts, =.'Hello World!' is 0 0 0 1 0 0 0 1 0 2 0 0" "\n"\
  2230. "=. dyadic mask mask one array in another, 'abxyzabayxxyabxyk'=.'xy' is 0 0 1 1 0 0 0 0 0 0 2 2 0 0 3 3 0" "\n"\
  2231. "=: monadic classify assign unique index to each unique elt, =:'Hello World!' is 0 1 2 2 3 4 5 3 6 2 7 8" "\n"\
  2232. "=: dyadic match same as = equals, but rank 0, so compares x and y as whole" "\n"\
  2233. "~ monadic not logical not, nil udf () 0 4t.0 are not truthy, everything else is truthy" "\n"\
  2234. "~ dyadic notequals test whether x and y are not equal" "\n"\
  2235. "~. monadic sign sign of x, -1 for negative, 0 for 0, 1 for positive" "\n"\
  2236. "~. dyadic insert insert x between elts of y, 0~.1 2 3 is 1 0 2 0 3" "\n"\
  2237. "~: dyadic notmatch rank 0 version of ~ notequals" "\n"\
  2238. "< monadic pred x - 1" "\n"\
  2239. "< dyadic less test whether x is lesser than y" "\n"\
  2240. "<. monadic floor round x down" "\n"\
  2241. "<. dyadic lesseq test whether x is equal or lesser than y" "\n"\
  2242. "<: monadic gradedown indices of array sorted descending" "\n"\
  2243. "<: dyadic nudgeleft shift elts of y to the left filling gap with x" "\n"\
  2244. "> monadic succ x + 1" "\n"\
  2245. "> dyadic greater test whether x is greater than y" "\n"\
  2246. ">. monadic ceil round x up" "\n"\
  2247. ">. dyadic greatereq test whether x is equal or greater than y" "\n"\
  2248. ">: monadic gradeup indices of array sorted ascending" "\n"\
  2249. ">: dyadic nudgeright shift elts of y to the right filling gap with x" "\n"\
  2250. ", monadic enlist put x into 1-elt array" "\n"\
  2251. ", dyadic join concat x and y" "\n"\
  2252. ",. monadic enfile ame as , enlist but with infinite rank, ,.1 2 3 is (,1),:(,2),:(,3)" "\n"\
  2253. "# monadic count yield count of elts of x" "\n"\
  2254. "# dyadic take take x first elts of y (or last if x < 0)" "\n"\
  2255. "#. monadic where #.0 0 1 0 1 0 is 2 4" "\n"\
  2256. "#. dyadic copy repeat each elt of x by corresponding number in y, 5 2 3 3#.0 2 2 1 is 2 2 3 3 3" "\n"\
  2257. "#: monadic group #:'mississippi' is (,0),:1 4 7 10,:2 3 5 6,:8 9" "\n"\
  2258. "#: dyadic buckets group elts of y into buckets according to x, e.g. 0 -1 -1 2 0#:a b c d e is (a,.e),:(),:(,d)" "\n"\
  2259. "_ monadic nub mark all unique elts of x, e.g. _'abracadabra' yields 1 1 1 0 1 0 1 0 0 0 0" "\n"\
  2260. "_ dyadic drop remove first x elts of y (or last if x < 0)" "\n"\
  2261. "_. monadic unbits _.1 0 1 is 5" "\n"\
  2262. "_. dyadic unbase 10_.4 5 6 is 456" "\n"\
  2263. "_: monadic bits _:5 is 1 0 1" "\n"\
  2264. "_: dyadic base 10_:4242 is 4 2 4 2" "\n"\
  2265. "? monadic unique distinct elts of x, same as ]#._" "\n"\
  2266. "? dyadic find find all indices of x in y" "\n"\
  2267. "& monadic flatten flatten an array, same as ,//." "\n"\
  2268. "& dyadic minand get min of two numbers (logical and for 0/1s)" "\n"\
  2269. "| monadic reverse reverse an array" "\n"\
  2270. "| dyadic maxor get max of two numbers (for 0/1s is same as logical or)" "\n"\
  2271. "|. monadic round round x" "\n"\
  2272. "|. dyadic rotate rotate array x times clockwise (-x for counterclockwise)" "\n"\
  2273. "|: monadic depth find max depth of x, |:,,,y yields 3" "\n"\
  2274. "|: dyadic windows yields all contiguous x-sized subarrays of y" "\n"\
  2275. "@ monadic abs |x|" "\n"\
  2276. "@ dyadic at pick elts from x by indices from y" "\n"\
  2277. "@. monadic shuffle shuffle elts of x" "\n"\
  2278. "@. dyadicn member check whether x is in y" "\n"\
  2279. "{ monadic head first two elts of x, same as 2#" "\n"\
  2280. "{ dyadic bin bin search, e.g. 1 3 5 7 9{8 9 0 yields 3 4 -1" "\n"\
  2281. "{. monadic tail last elt of x" "\n"\
  2282. "{: monadic prefixes prefixes of x, same as |}.\\." "\n"\
  2283. "{: dyadic shl x << y" "\n"\
  2284. "} monadic behead all elts of x except first, same as 1_" "\n"\
  2285. "} dyadic xor x ^ y" "\n"\
  2286. "}. monadic curtail all elts of x except last, same as -1_" "\n"\
  2287. "}: monadic suffixes suffixes of x, same as }.\\." "\n"\
  2288. "}: dyadic shr x >> y" "\n"\
  2289. "[ monadic factors compute prime factors of x" "\n"\
  2290. "[ dyadic left yield x" "\n"\
  2291. "[. monadic bnot ~x" "\n"\
  2292. "[. dyadic bor x | y" "\n"\
  2293. "[: monadic primes find primes in range [2, x]" "\n"\
  2294. "[: dyadic parts split y into x parts" "\n"\
  2295. "] monadic same yield x (i.e. identity)" "\n"\
  2296. "] dyadic right yield y (i.e. right argument)" "\n"\
  2297. "]. monadic sort sort x ascending, shortcut for ]@>:" "\n"\
  2298. "]. dyadic outof the number of ways of picking x balls from a bag of y balls, e.g. 5].10 is 252" "\n"\
  2299. "]: monadic unsort sort x descending, shortcut for ]@<:" "\n"\
  2300. "]: dyadic explode split y by delim x" "\n"\
  2301. "`. monadic symbol cast x to a symbol" "\n"\
  2302. "`. dyadic apply1 apply x to y" "\n"\
  2303. "`: monadic square x ^ 2" "\n"\
  2304. "`: dyadic apply2 apply x to y (y is 2-elt array of args)" "\n"\
  2305. "$ monadic shape yield shape of x" "\n"\
  2306. "$ dyadic reshape reshape y to shape x" "\n"\
  2307. "$. monadic repr yield string repr of x" "\n"\
  2308. "$. dyadic format format y by template x, e.g. '{0}+{1}*{-1}+_'$.1 2 3 4 is 1+2*4+1" "\n"\
  2309. "$: monadic eye identity matrix of size x" "\n"\
  2310. "$: dyadic implode join y inserting x between" "\n"\
  2311. "";
  2312. cS V2HELP =\
  2313. "p. monadic print print x" "\n"\
  2314. "P. monadic println print x and a \\n" "\n"\
  2315. "f. monadic selfref1 monadic reference to current function or rhs of bind" "\n"\
  2316. "f. dyadic selfref2 dyadic reference to current function or rhs of bind" "\n"\
  2317. "F. monadic read read file (x=0 to read stdin)" "\n"\
  2318. "F. dyadic write write file (y=0 to write to stderr)" "\n"\
  2319. "t. monadic type type of x, array=0, verb=1, symbol=2, number=3, char=4, nil=5, udf=6" "\n"\
  2320. "r. monadic deal yield random elt of x" "\n"\
  2321. "r. dyadic roll roll xdy (note: y is 0-based, so >xr.y for 1-based)" "\n"\
  2322. "e. monadic eval eval expression, yields udf on parse error" "\n"\
  2323. "i. monadic import load and eval source file" "\n"\
  2324. "y. monadic system exec system command (yields output)" "\n"\
  2325. "y. dyadic system2 exec system command with input" "\n"\
  2326. "E. monadic exit exit with exit code" "\n"\
  2327. "";
  2328. cS AHELP =\
  2329. "f\" each >\"1 2 3 yields 2 3 4" "\n"\
  2330. "xf\" merge 1 2 3,\"a b c yields (1,.a),:(2,.b),:(3,.c)" "\n"\
  2331. "f\". eachprior -\".1 2 2 3 5 6 yields 1 0 1 2 1" "\n"\
  2332. "xf\". eachpriorwith 0-\".1 2 2 3 5 6 yields 1 1 0 1 2 1" "\n"\
  2333. "f/ fold +/1 2 3 yields 6" "\n"\
  2334. "xf/ foldwith 1+/1 2 3 yields 7" "\n"\
  2335. "f\\ scan +\\1 2 3 yields 1 3 6" "\n"\
  2336. "xf\\ scanwith 1+\\1 2 3 yields 1 2 4 7" "\n"\
  2337. "f/. converge 1;_/.1 2 3 yields ()" "\n"\
  2338. "f\\. converges 1;_\\.1 2 3 yields 1 2 3,:2 3,:(,3),:()" "\n"\
  2339. "xf/. eachright 1-/.1 2 3 yields 0 1 2" "\n"\
  2340. "xf\\. eachleft 1-\\.1 2 3 yields 0 -1 -2" "\n"\
  2341. "f\": rank #\":1 2 3$1 yields 3 3, #\":inf 2 3$1 yields 1 1 1,:1 1 1" "\n"\
  2342. "xf\": rank2 1 2 3 *:\":1 1 2 3 yields (,1),:2 2,:3 3 3" "\n"\
  2343. "n` amend 'gw'0 3`'cross' yields 'grows'" "\n"\
  2344. "f&. filter >;0&.-2!.2 yields 1 2, basically shortcut for ]#.f" "\n"\
  2345. "f/: span =;' '/:'x y z' yields (,'x'),:(,'y'),:(,'z')" "\n"\
  2346. "xf/: stencil 3+//:!10 yields 3 6 9 12 15 18 21 24, shortcut for f\"x|:" "\n"\
  2347. "f;. reflex *;.5 yields 25, 5%;.2 yields 0.4" "\n"\
  2348. "";
  2349. cS CHELP =\
  2350. "f;g bond */;!.5 yields 120, +;1 5 yields 6, 5;- 1 yields 4" "\n"\
  2351. "f?.x pick >;5?.((2*),:<)\"3 6 yields 6 5" "\n"\
  2352. "f?:F while <;5?:>0 yields 5" "\n"\
  2353. "n?:f repeat 5?:*;2 1 yields 32" "\n"\
  2354. "f&:F if 1+&:+2 yields 2" "\n"\
  2355. "f;:F monaddyad -;:+5 yields -5, 1-;:+5 yields 6" "\n"\
  2356. "";
  2357. cS IHELP =\
  2358. "inverse of a function f is a function ~f that undoes the effect of f" "\n"\
  2359. "\n"\
  2360. "f::~f obverse define inverse ~f for f" "\n"\
  2361. "\n"\
  2362. "f-:x inverse ~fx" "\n"\
  2363. "xf-:y inverse2 (~fx)~f~fx" "\n"\
  2364. "f^:Fx under ~FfFx" "\n"\
  2365. "xf^:Fx under2 ~F(Fx)f(Fx)" "\n"\
  2366. "";
  2367. cS SHELP =\
  2368. "/ comment" "\n"\
  2369. "5+5 / also comment" "\n"\
  2370. "5+5/not comment (no whitespace before /)" "\n"\
  2371. "nil udf / special, nil and undefined" "\n"\
  2372. "'a'%2 / = nan, nan used to denote illegal numeric operation" "\n"\
  2373. "+1 2 3 / = udf, attempt to transpose flat vector, udf/undefined used to denote illegal operation" "\n"\
  2374. "5 5.5 -5 42 / number (double-precision floats)" "\n"\
  2375. "nan inf /" "\n"\
  2376. "'a' 'b' 'g' / chars (bytes)" "\n"\
  2377. "4t.0 / 0 NUL byte" "\n"\
  2378. "(4t.0),:(4t.16),:(4t.22) /" "\n"\
  2379. "1 2 3 / numbers array" "\n"\
  2380. "'hello world!' 'bla''bla' / quote, array of chars" "\n"\
  2381. ",'a' / 1-char string" "\n"\
  2382. ",1 / 1-elt array" "\n"\
  2383. "() / unit, empty array" "\n"\
  2384. "1,:(5+5),:1 2 3 / strand, mixed array literal" "\n"\
  2385. "-1 / negative num literal" "\n"\
  2386. "- 1 / application of - negate to 1" "\n"\
  2387. "-1 -2 -3 / array of negative nums" "\n"\
  2388. "- 1 2 3 / application of - negate to an array of nums" "\n"\
  2389. "5-5 / array of numbers 5 and -5" "\n"\
  2390. "5- 5 / 5 minus 5" "\n"\
  2391. "+ / verb" "\n"\
  2392. "5+5 / dyadic expr" "\n"\
  2393. "#1 2 3 / monadic expr (no left side)" "\n"\
  2394. "+/ *;. / adverb" "\n"\
  2395. "+;1 -;* +^:^. / conjunction" "\n"\
  2396. ":x+y / function literal" "\n"\
  2397. ":1 / function that always yields 1" "\n"\
  2398. "x:123 / bind name" "\n"\
  2399. "sq:*;. /" "\n"\
  2400. "fac:*/1+! / bind function" "\n"\
  2401. "f:x+y /" "\n"\
  2402. "f:-x / overload function by arity" "\n"\
  2403. "f 5 / = -5" "\n"\
  2404. "5 f 5 / = 10" "\n"\
  2405. "*/!. / hook, fgx -> f(g(x)), xfgy -> f(g(x, y))" "\n"\
  2406. "+/%# / fork, fghx -> g(f(x), h(x)), xfghy -> g(f(x), h(y))" "\n"\
  2407. "1+! / over, nfgx -> f(n, g(x)), xnfgy -> f(n, g(x, y))" "\n"\
  2408. "1+ / bond, nfx -> f(n, x), xnfy -> f(n, f(x, y))" "\n";
  2409. cS HELP = "\\0\thelp on syntax\n"\
  2410. "\\+\thelp on verbs\n"\
  2411. "\\a\thelp on additional verbs\n"\
  2412. "\\\"\thelp on adverbs\n"\
  2413. "\\;\thelp on conjunctions\n"\
  2414. "\\-:\thelp on inverses\n";
  2415. cS VSTR=VER " " __DATE__;
  2416. I main(I argc,S*argv){GC_INIT();
  2417. GC_enable_incremental();
  2418. guards=An();
  2419. Iin=isatty(0);
  2420. HASH_SEED=time(N);
  2421. srand(HASH_SEED);
  2422. VCACHE=Tnew();
  2423. SCACHE=Tnew();
  2424. for(Z i=0;i<AE(VERBS);i++){Vt*v=VnC(VERB);
  2425. v->val.verb=&VERBS[i];
  2426. Tset(VCACHE,VERBS[i].name,v);}
  2427. _UNIT=Vnew(ARRAY);
  2428. _UNIT->val.array=An();
  2429. St*st=Sn();
  2430. for(I i=1;i<=8;i++){NNUMS[i-1]=VnC(NUM);
  2431. NNUMS[i-1]->val.number=-i;}
  2432. for(I i=0;i<256;i++){NUMS[i]=VnC(NUM);
  2433. NUMS[i]->val.number=i;}
  2434. for(I i=0;i<256;i++){CHARS[i]=VnC(CHAR);
  2435. CHARS[i]->val._char=i;}
  2436. _NAN=VnC(NUM);
  2437. _NAN->val.number=NAN;
  2438. INF=VnC(NUM);
  2439. INF->val.number=INFINITY;
  2440. NINF=VnC(NUM);
  2441. NINF->val.number=-INFINITY;
  2442. Ar*vs=An();
  2443. for(Z i=0;i<strlen(VSTR);i++)Ap(vs,CHARS[VSTR[i]]);
  2444. Tset(st->env,"JKV",Vna(vs));
  2445. Tset(st->env,"E",Vnn(exp(1)));
  2446. Tset(st->env,"pi",Vnn(M_PI));
  2447. Tset(st->env,"tau",Vnn(M_PI*2));
  2448. Tset(st->env,"nan",_NAN);
  2449. Tset(st->env,"inf",INF);
  2450. Tset(st->env,"nil",st->nil);
  2451. Tset(st->env,"udf",st->udf);
  2452. Inverses=Tnew();
  2453. Tset(Inverses,"+",Gv("+"));
  2454. Tset(Inverses,"-",Gv("-"));
  2455. Tset(Inverses,"|",Gv("|"));
  2456. Tset(Inverses,"~",Gv("~"));
  2457. Tset(Inverses,"%",Gv("%"));
  2458. Tset(Inverses,"]",Gv("]"));
  2459. Tset(Inverses,"*:",Gv("%:"));
  2460. Tset(Inverses,"%:",Gv("*:"));
  2461. Tset(Inverses,">",Gv("<"));
  2462. Tset(Inverses,"<",Gv(">"));
  2463. Tset(Inverses,"_.",Gv("_:"));
  2464. Tset(Inverses,"_:",Gv("_."));
  2465. Tset(Inverses,"^.",Gv("^"));
  2466. Tset(Inverses,"^",Gv("^."));
  2467. Tset(Inverses,"+;.",Gv("%:"));
  2468. Tset(Inverses,"*/",Gv("["));
  2469. Tset(Inverses,"[",CV("*/"));
  2470. Tset(Inverses,"!",CV(">|/"));
  2471. Tset(Inverses,"!.",CV("|/"));
  2472. Tset(Inverses,"]@>:",CV("]@<:"));
  2473. Tset(Inverses,"]@<:",CV("]@>:"));
  2474. Ar*args=An();
  2475. for(I i=1;i<argc;i++){Ar*arg=An();
  2476. S s=argv[i];
  2477. WH(*s)Ap(arg,CHARS[*s++]);
  2478. Ap(args,Vna(arg));}
  2479. Tset(st->env,"args",Vna(args));
  2480. if(Iin)printf("jk\t\\\\ to exit \\ for help\n");
  2481. S s=N;
  2482. if(Iin)setjmp(Icp);
  2483. if(s){FR(s);s=N;}
  2484. LOOP{Bt*buffer;
  2485. C line[256];
  2486. buffer=Bnew();
  2487. if(Iin)putc('\t',stdout);
  2488. if(!fgets(line,SO(line),stdin))BR;
  2489. if(Iin){if(strcmp(line,"\\\\\n")==0)BR;
  2490. elif(strcmp(line,"\\\n")==0){printf("%s",HELP);CN;}
  2491. elif(strcmp(line,"\\0\n")==0){printf("%s",SHELP);CN;}
  2492. elif(strcmp(line,"\\+\n")==0){printf("%s",VHELP);CN;}
  2493. elif(strcmp(line,"\\a\n")==0){printf("%s",V2HELP);CN;}
  2494. elif(strcmp(line,"\\\"\n")==0){printf("%s",AHELP);CN;}
  2495. elif(strcmp(line,"\\;\n")==0){printf("%s",CHELP);CN;}
  2496. elif(strcmp(line,"\\-:\n")==0){printf("%s",IHELP);CN;}}
  2497. WH(strlen(line)>2&&strcmp(line+strlen(line)-3,"..\n")==0){line[strlen(line)-3]=0;
  2498. BappendS(buffer,line);
  2499. if(Iin)putc('\t',stdout);
  2500. if(!fgets(line,SO(line),stdin))R 0;}
  2501. BappendS(buffer,line);
  2502. s=Bread(buffer);
  2503. Vt*v=Srun(st,s);
  2504. FR(s);s=N;
  2505. if(v->tag!=NIL){Tset(st->env,"it",v);
  2506. S s=Vshow(v);
  2507. fputs(s,stdout);
  2508. if(Iin)putc('\n',stdout);}}}