jk.c 91 KB

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