#include "h.h" static inline B mv(B* p, usz n) { B r = p [n]; p [n] = m_f64(0); return r; } static inline B hmv(HArr_p p, usz n) { B r = p.a[n]; p.a[n] = m_f64(0); return r; } B eachd_fn(BBB2B f, B fo, B w, B x) { // consumes w,x; assumes at least one is array if (isAtm(w)) w = m_atomUnit(w); if (isAtm(x)) x = m_atomUnit(x); ur wr = rnk(w); BS2B wget = TI(w).get; ur xr = rnk(x); BS2B xget = TI(x).get; bool wg = wr>xr; ur rM = wg? wr : xr; ur rm = wg? xr : wr; if (rM==0) { B r = f(fo, wget(w,0), xget(x,0)); dec(w); dec(x); return m_hunit(r); } if (rm && !eqShPrefix(a(w)->sh, a(x)->sh, rm)) thrF("Mapping: Expected equal shape prefix (%H ≑ ≒𝕨, %H ≑ ≒𝕩)", w, x); bool rw = rM==wr && ((v(w)->type==t_harr) & reusable(w)); // v(…) is safe as rank>0 bool rx = rM==xr && ((v(x)->type==t_harr) & reusable(x)); if (rw|rx && (wr==xr | rm==0)) { HArr_p r = harr_parts(rw? w : x); usz ria = r.c->ia; if (wr==0) { B c=wget(w, 0); for(usz i = 0; i < ria; i++) r.a[i] = f(fo, inc(c), hmv(r,i)); dec(c); } else if (xr==0) { B c=xget(x, 0); for(usz i = 0; i < ria; i++) r.a[i] = f(fo, hmv(r,i), inc(c) ); dec(c); } else { assert(wr==xr); if (rw) for (usz i = 0; i < ria; i++) r.a[i] = f(fo, hmv(r,i), xget(x,i)); else for (usz i = 0; i < ria; i++) r.a[i] = f(fo, wget(w,i), hmv(r,i)); } dec(rw? x : w); return r.b; } B bo = wg? w : x; usz ria = a(bo)->ia; usz ri = 0; HArr_p r = m_harrs(ria, &ri); if (wr==xr) for(; ri < ria; ri++) r.a[ri] = f(fo, wget(w,ri), xget(x,ri)); else if (wr==0) { B c=wget(w, 0); for(; ri < ria; ri++) r.a[ri] = f(fo, inc(c) , xget(x,ri)); dec(c); } else if (xr==0) { B c=xget(x, 0); for(; ri < ria; ri++) r.a[ri] = f(fo, wget(w,ri), inc(c) ); dec(c); } else if (ria>0) { usz min = wg? a(x)->ia : a(w)->ia; usz ext = ria / min; if (wg) for (usz i = 0; i < min; i++) { B c=xget(x,i); for (usz j = 0; j < ext; j++,ri++) r.a[ri] = f(fo, wget(w,ri), inc(c)); } else for (usz i = 0; i < min; i++) { B c=wget(w,i); for (usz j = 0; j < ext; j++,ri++) r.a[ri] = f(fo, inc(c), xget(x,ri)); } } B rb = harr_fc(r, bo); dec(w); dec(x); return rb; } B eachm_fn(BB2B f, B fo, B x) { // consumes x; x must be array usz ia = a(x)->ia; if (ia==0) return x; BS2B xget = TI(x).get; usz i = 0; B cr = f(fo, xget(x,0)); HArr_p rH; if (TI(x).canStore(cr)) { bool reuse = reusable(x); if (v(x)->type==t_harr) { B* xp = harr_ptr(x); if (reuse) { dec(xp[i]); xp[i++] = cr; for (; i < ia; i++) xp[i] = f(fo, mv(xp,i)); return x; } else { rH = m_harrs(ia, &i); rH.a[i++] = cr; for (; i < ia; i++) rH.a[i] = f(fo, inc(xp[i])); return harr_fcd(rH, x); } } else if (TI(x).elType==el_i32) { i32* xp = i32any_ptr(x); B r; i32* rp; if (reuse && v(x)->type==t_i32arr) { r=x; rp = xp; } else r = m_i32arrc(&rp, x); rp[i++] = o2iu(cr); for (; i < ia; i++) { cr = f(fo, m_i32(xp[i])); if (!q_i32(cr)) { rH = m_harrs(ia, &i); for (usz j = 0; j < i; j++) rH.a[j] = m_i32(rp[j]); if (!reuse) dec(r); goto fallback; } rp[i] = o2iu(cr); } if (!reuse) dec(x); return r; } else if (TI(x).elType==el_f64) { f64* xp = f64any_ptr(x); B r; f64* rp; if (reuse && v(x)->type==t_f64arr) { r=x; rp = xp; } else r = m_f64arrc(&rp, x); rp[i++] = o2fu(cr); for (; i < ia; i++) { cr = f(fo, m_f64(xp[i])); if (!q_f64(cr)) { rH = m_harrs(ia, &i); for (usz j = 0; j < i; j++) rH.a[j] = m_f64(rp[j]); if (!reuse) dec(r); goto fallback; } rp[i] = o2fu(cr); } if (!reuse) dec(x); return r; } else if (v(x)->type==t_fillarr) { B* xp = fillarr_ptr(x); if (reuse) { dec(c(FillArr,x)->fill); c(FillArr,x)->fill = bi_noFill; dec(xp[i]); xp[i++] = cr; for (; i < ia; i++) xp[i] = f(fo, mv(xp,i)); return x; } else { HArr_p rp = m_harrs(ia, &i); rp.a[i++] = cr; for (; i < ia; i++) rp.a[i] = f(fo, inc(xp[i])); return harr_fcd(rp, x); } } else rH = m_harrs(ia, &i); } else rH = m_harrs(ia, &i); fallback: rH.a[i++] = cr; for (; i < ia; i++) rH.a[i] = f(fo, xget(x,i)); return harr_fcd(rH, x); } B eachm(B f, B x) { // complete FΒ¨ x without fills if (isAtm(x)) return m_hunit(c1(f, x)); if (isFun(f)) return eachm_fn(c(Fun,f)->c1, f, x); if (isMd(f)) if (isAtm(x) || a(x)->ia) { decR(x); thrM("Calling a modifier"); } usz ia = a(x)->ia; MAKE_MUT(r, ia); mut_fill(r, 0, f, ia); return mut_fcd(r, x); } B eachd(B f, B w, B x) { // complete w FΒ¨ x without fills if (isAtm(w) & isAtm(x)) return m_hunit(c2(f, w, x)); return eachd_fn(c2fn(f), f, w, x); } B shape_c1(B t, B x) { if (isAtm(x)) thrM("β₯Š: deshaping non-array"); usz ia = a(x)->ia; if (reusable(x)) { decSh(v(x)); arr_shVec(x, ia); return x; } B r = TI(x).slice(x, 0); arr_shVec(r, ia); return r; } B shape_c2(B t, B w, B x) { if (isAtm(x)) { dec(x); dec(w); thrM("β₯Š: Reshaping non-array"); } if (isAtm(w)) return shape_c1(t, x); BS2B wget = TI(w).get; usz wia = a(w)->ia; if (wia>UR_MAX) thrM("β₯Š: Result rank too large"); ur nr = (ur)wia; usz nia = a(x)->ia; B r; if (reusable(x)) { r = x; decSh(v(x)); } else r = TI(x).slice(x, 0); usz* sh = arr_shAllocI(r, nia, nr); if (sh) for (u32 i = 0; i < nr; i++) sh[i] = o2s(wget(w,i)); dec(w); return r; } B rt_pick; B pick_c1(B t, B x) { if (isAtm(x)) return x; if (a(x)->ia==0) { B r = getFillE(x); dec(x); return r; } B r = TI(x).get(x, 0); dec(x); return r; } B pick_c2(B t, B w, B x) { if (isNum(w) && isArr(x) && rnk(x)==1) { i64 p = o2i64(w); usz xia = a(x)->ia; if (p<0) p+= (i64)xia; if ((u64)p >= xia) thrF("βŠ‘: indexing out-of-bounds (𝕨≑%R, %s≑≠𝕩)", w, xia); B r = TI(x).get(x, p); dec(x); return r; } return c2(rt_pick, w, x); } B rt_select; B select_c1(B t, B x) { if (isAtm(x)) thrM("⊏: Argument cannot be an atom"); ur xr = rnk(x); if (xr==0) thrM("⊏: Argument cannot be rank 0"); if (a(x)->sh[0]==0) thrF("⊏: Argument shape cannot start with 0 (%H ≑ ≒𝕩)", x); B r = TI(x).slice(inc(x),0); usz* sh = arr_shAllocR(r, xr-1); usz ia = 1; for (i32 i = 1; i < xr; i++) { if (sh) sh[i-1] = a(x)->sh[i]; ia*= a(x)->sh[i]; } a(r)->ia = ia; dec(x); return r; } B select_c2(B t, B w, B x) { if (isAtm(x)) thrM("⊏: 𝕩 cannot be an atom"); ur xr = rnk(x); if (isAtm(w)) { if (xr==0) thrM("⊏: 𝕩 cannot be a unit"); usz csz = arr_csz(x); usz cam = a(x)->sh[0]; i64 wi = o2i64(w); if (wi<0) wi+= cam; if ((usz)wi >= cam) thrF("⊏: Indexing out-of-bounds (𝕨≑%R, %s≑≠𝕩)", w, cam); B r = TI(x).slice(inc(x), wi*csz); usz* sh = arr_shAllocI(r, csz, xr-1); if (sh) memcpy(sh, a(x)->sh+1, (xr-1)*sizeof(usz)); dec(x); return r; } B xf = getFillQ(x); BS2B xget = TI(x).get; usz wia = a(w)->ia; if (xr==1) { usz xia = a(x)->ia; if (TI(w).elType==el_i32) { i32* wp = i32any_ptr(w); if (TI(x).elType==el_i32) { i32* rp; B r = m_i32arrc(&rp, w); i32* xp = i32any_ptr(x); for (usz i = 0; i < wia; i++) { i64 c = wp[i]; if (c<0) c+= xia; if (c<0 | c>=xia) thrF("⊏: Indexing out-of-bounds (%iβˆŠπ•¨, %s≑≠𝕩)", wp[i], xia); rp[i] = xp[c]; } dec(w); dec(x); return r; } else { HArr_p r = m_harrUc(w); for (usz i = 0; i < wia; i++) { i64 c = wp[i]; if (c<0) c+= xia; if (c<0 | c>=xia) thrF("⊏: Indexing out-of-bounds (%iβˆŠπ•¨, %s≑≠𝕩)", wp[i], xia); r.a[i] = xget(x, c); } dec(w); dec(x); return withFill(r.b,xf); } } else { HArr_p r = m_harrUc(w); BS2B wgetU = TI(w).getU; for (usz i = 0; i < wia; i++) { B cw = wgetU(w, i); if (!isNum(cw)) { harr_pfree(r.b, i); goto base; } f64 c = o2f(cw); if (c<0) c+= xia; if ((usz)c >= xia) thrF("⊏: Indexing out-of-bounds (%RβˆŠπ•¨, %s≑≠𝕩)", cw, xia); r.a[i] = xget(x, c); } dec(w); dec(x); return withFill(r.b,xf); } } else { BS2B wgetU = TI(w).getU; ur wr = rnk(w); i32 rr = wr+xr-1; if (xr==0) thrM("⊏: 𝕩 cannot be a unit"); if (rr>UR_MAX) thrF("⊏: Result rank too large (%i≑=𝕨, %i≑=𝕩)", wr, xr); usz csz = arr_csz(x); usz cam = a(x)->sh[0]; MAKE_MUT(r, wia*csz); mut_to(r, fillElType(xf)); for (usz i = 0; i < wia; i++) { B cw = wgetU(w, i); if (!isNum(cw)) { mut_pfree(r, i*csz); goto base; } f64 c = o2f(cw); if (c<0) c+= cam; if ((usz)c >= cam) { mut_pfree(r, i*csz); thrF("⊏: Indexing out-of-bounds (%RβˆŠπ•¨, %s≑≠𝕩)", cw, cam); } mut_copy(r, i*csz, x, csz*(usz)c, csz); } B rb = mut_fp(r); usz* rsh = arr_shAllocR(rb, rr); if (rsh) { memcpy(rsh , a(w)->sh , wr *sizeof(usz)); memcpy(rsh+wr, a(x)->sh+1, (xr-1)*sizeof(usz)); } dec(w); dec(x); return withFill(rb,xf); } base: dec(xf); return c2(rt_select, w, x); } B rt_slash; B slash_c1(B t, B x) { if (isAtm(x) || rnk(x)!=1) thrF("/: Argument must have rank 1 (%H ≑ ≒𝕩)", x); i64 s = isum(x); if(s<0) thrM("/: Argument must consist of natural numbers"); usz xia = a(x)->ia; BS2B xgetU = TI(x).getU; usz ri = 0; if (xiaia; usz xia = a(x)->ia; B xf = getFillQ(x); if (wia!=xia) thrF("/: Lengths of components of 𝕨 must match 𝕩 (%s β‰  %s)", wia, xia); i64 wsum = isum(w); if (wsum>USZ_MAX) thrOOM(); usz ria = wsum; usz ri = 0; if (TI(w).elType==el_i32) { i32* wp = i32any_ptr(w); if (TI(x).elType==el_i32) { i32* xp = i32any_ptr(x); i32* rp; B r = m_i32arrv(&rp, ria); for (usz i = 0; i < wia; i++) { i32 c = wp[i]; if (c<0) thrF("/: 𝕨 must consist of natural numbers (%iβˆŠπ•¨)", c); i32 cx = xp[i]; for (usz j = 0; j < c; j++) *rp++ = cx; } dec(w); dec(x); return r; } else { HArr_p r = m_harrs(ria, &ri); BS2B xgetU = TI(x).getU; for (usz i = 0; i < wia; i++) { i32 c = wp[i]; if (c==0) continue; if (c<0) thrF("/: 𝕨 must consist of natural numbers (%iβˆŠπ•¨)", c); B cx = xgetU(x, i); for (usz j = 0; j < c; j++) r.a[ri++] = inc(cx); } dec(w); dec(x); return withFill(harr_fv(r), xf); } } else { HArr_p r = m_harrs(ria, &ri); BS2B wgetU = TI(w).getU; BS2B xgetU = TI(x).getU; for (usz i = 0; i < wia; i++) { usz c = o2s(wgetU(w, i)); if (c) { B cx = xgetU(x, i); for (usz j = 0; j < c; j++) r.a[ri++] = inc(cx); } } dec(w); dec(x); return withFill(harr_fv(r), xf); } } return c2(rt_slash, w, x); } B slicev(B x, usz s, usz ia) { usz xia = a(x)->ia; assert(s+ia <= xia); B r = TI(x).slice(x, s); arr_shVec(r, ia); return r; } B rt_take, rt_drop; B take_c1(B t, B x) { return c1(rt_take, x); } B drop_c1(B t, B x) { return c1(rt_drop, x); } B take_c2(B t, B w, B x) { if (isNum(w) && isArr(x) && rnk(x)==1) { i64 v = o2i64(w); usz ia = a(x)->ia; u64 va = v<0? -v : v; if (va>ia) { MAKE_MUT(r, va); B xf = getFillE(x); mut_copy(r, v<0? va-ia : 0, x, 0, ia); mut_fill(r, v<0? 0 : ia, xf, va-ia); dec(x); dec(xf); return mut_fv(r); } if (v<0) return slicev(x, ia+v, -v); else return slicev(x, 0, v); } return c2(rt_take, w, x); } B drop_c2(B t, B w, B x) { if (isNum(w) && isArr(x) && rnk(x)==1) { i64 v = o2i64(w); usz ia = a(x)->ia; if (v<0) return -v>ia? slicev(x, 0, 0) : slicev(x, 0, v+ia); else return v>ia? slicev(x, 0, 0) : slicev(x, v, ia-v); } return c2(rt_drop, w, x); } B rt_join; B join_c1(B t, B x) { if (isAtm(x)) thrM("∾: Argument must be an array"); if (rnk(x)==1) { usz xia = a(x)->ia; if (xia==0) { B xf = getFillE(x); if (isAtm(xf)) { decR(xf); if (!PROPER_FILLS) { B xfq = getFillR(x); bool no = noFill(xfq); decR(xfq); if (no) return x; } dec(x); thrM("∾: Empty vector 𝕩 cannot have an atom fill element"); } dec(x); ur ir = rnk(xf); if (ir==0) thrM("∾: Empty vector 𝕩 cannot have a unit fill element"); B xff = getFillQ(xf); HArr_p r = m_harrUp(0); usz* sh = arr_shAllocR(r.b, ir); if (sh) { sh[0] = 0; memcpy(sh+1, a(xf)->sh+1, sizeof(usz)*(ir-1)); } dec(xf); return withFill(r.b, xff); } BS2B xgetU = TI(x).getU; B x0 = xgetU(x,0); B rf; if(SFNS_FILLS) rf = getFillQ(x0); if (isAtm(x0)) thrM("∾: Rank of items must be equal or greater than rank of argument"); usz ir = rnk(x0); usz* x0sh = a(x0)->sh; if (ir==0) thrM("∾: Rank of items must be equal or greater than rank of argument"); usz csz = arr_csz(x0); usz cam = x0sh[0]; for (usz i = 1; i < xia; i++) { B c = xgetU(x, i); if (!isArr(c) || rnk(c)!=ir) thrF("∾: All items in argument should have same rank (contained items with ranks %i and %i)", ir, isArr(c)? rnk(c) : 0); usz* csh = a(c)->sh; if (ir>1) for (usz j = 1; j < ir; j++) if (csh[j]!=x0sh[j]) thrF("∾: Item trailing shapes must be equal (contained arrays with shapes %H and %H)", x0, c); cam+= a(c)->sh[0]; if (SFNS_FILLS && !noFill(rf)) rf = fill_or(rf, getFillQ(c)); } MAKE_MUT(r, cam*csz); usz ri = 0; for (usz i = 0; i < xia; i++) { B c = xgetU(x, i); usz cia = a(c)->ia; mut_copy(r, ri, c, 0, cia); ri+= cia; } assert(ri==cam*csz); B rb = mut_fp(r); usz* sh = arr_shAllocR(rb, ir); if (sh) { sh[0] = cam; memcpy(sh+1, x0sh+1, sizeof(usz)*(ir-1)); } dec(x); return SFNS_FILLS? qWithFill(rb, rf) : rb; } return c1(rt_join, x); } B join_c2(B t, B w, B x) { B f = fill_both(w, x); if (isAtm(w)) w = m_atomUnit(w); ur wr = rnk(w); usz wia = a(w)->ia; usz* wsh = a(w)->sh; if (isAtm(x)) x = m_atomUnit(x); ur xr = rnk(x); usz xia = a(x)->ia; usz* xsh = a(x)->sh; ur c = wr>xr?wr:xr; if (c==0) { HArr_p r = m_harrUv(2); r.a[0] = TI(w).get(w,0); dec(w); r.a[1] = TI(x).get(x,0); dec(x); return withFill(r.b, f); } if (c-wr > 1 || c-xr > 1) thrF("∾: Argument ranks must differ by 1 or less (%i≑=𝕨, %i≑=𝕩)", wr, xr); if (c==1) { B r = vec_join(w, x); if (rnk(r)==0) srnk(r,1); return r; } MAKE_MUT(r, wia+xia); mut_to(r, el_or(TI(w).elType, TI(x).elType)); mut_copy(r, 0, w, 0, wia); mut_copy(r, wia, x, 0, xia); B rb = mut_fp(r); usz* sh = arr_shAllocR(rb, c); if (sh) { for (i32 i = 1; i < c; i++) { usz s = xsh[i+xr-c]; if (wsh[i+wr-c] != s) { mut_pfree(r, wia+xia); thrF("∾: Lengths not matchable (%H ≑ ≒𝕨, %H ≑ ≒𝕩)", w, x); } sh[i] = s; } sh[0] = (wr==c? wsh[0] : 1) + (xr==c? xsh[0] : 1); } dec(w); dec(x); return qWithFill(rb, f); } B couple_c1(B t, B x) { if (isArr(x)) { usz rr = rnk(x); usz ia = a(x)->ia; B r = TI(x).slice(inc(x),0); usz* sh = arr_shAllocI(r, ia, rr+1); if (sh) { sh[0] = 1; memcpy(sh+1, a(x)->sh, rr*sizeof(usz)); } dec(x); return r; } if (q_i32(x)) { i32* rp; B r = m_i32arrv(&rp, 1); rp[0] = o2iu(x); return r; } if (isF64(x)) { f64* rp; B r = m_f64arrv(&rp, 1); rp[0] = o2fu(x); return r; } if (isC32(x)) { u32* rp; B r = m_c32arrv(&rp, 1); rp[0] = o2cu(x); return r; } HArr_p r = m_harrUv(1); r.a[0] = x; return r.b; } B couple_c2(B t, B w, B x) { if (isAtm(w)&isAtm(x)) { if (q_i32(x)&q_i32(w)) { i32* rp; B r = m_i32arrv(&rp, 2); rp[0]=o2iu(w); rp[1]=o2iu(x); return r; } if (isF64(x)&isF64(w)) { f64* rp; B r = m_f64arrv(&rp, 2); rp[0]=o2fu(w); rp[1]=o2fu(x); return r; } if (isC32(x)&isC32(w)) { u32* rp; B r = m_c32arrv(&rp, 2); rp[0]=o2cu(w); rp[1]=o2cu(x); return r; } } if (isAtm(w)) w = m_atomUnit(w); if (isAtm(x)) x = m_atomUnit(x); if (!eqShape(w, x)) thrF("≍: 𝕨 and 𝕩 must have equal shapes (%H ≑ ≒𝕨, %H ≑ ≒𝕩)", w, x); usz ia = a(w)->ia; ur wr = rnk(w); MAKE_MUT(r, ia*2); mut_copy(r, 0, w, 0, ia); mut_copy(r, ia, x, 0, ia); B rb = mut_fp(r); usz* sh = arr_shAllocR(rb, wr+1); if (sh) { sh[0]=2; memcpy(sh+1, a(w)->sh, wr*sizeof(usz)); } if (!SFNS_FILLS) { dec(w); dec(x); return rb; } B rf = fill_both(w, x); dec(w); dec(x); return qWithFill(rb, rf); } static void shift_check(B w, B x) { ur wr = rnk(w); usz* wsh = a(w)->sh; ur xr = rnk(x); usz* xsh = a(x)->sh; if (wr+1!=xr & wr!=xr) thrF("shift: =𝕨 must be =𝕩 or Β―1+=𝕩 (%i≑=𝕨, %i≑=𝕩)", wr, xr); for (i32 i = 1; i < xr; i++) if (wsh[i+wr-xr] != xsh[i]) thrF("shift: Lengths not matchable (%H ≑ ≒𝕨, %H ≑ ≒𝕩)", w, x); } B shiftb_c1(B t, B x) { if (isAtm(x) || rnk(x)==0) thrM("Β»: Argument cannot be a scalar"); usz ia = a(x)->ia; if (ia==0) return x; B xf = getFillE(x); usz csz = arr_csz(x); MAKE_MUT(r, ia); mut_to(r, TI(x).elType); mut_copy(r, csz, x, 0, ia-csz); mut_fill(r, 0, xf, csz); return qWithFill(mut_fcd(r, x), xf); } B shiftb_c2(B t, B w, B x) { if (isAtm(x) || rnk(x)==0) thrM("Β»: 𝕩 cannot be a scalar"); if (isAtm(w)) w = m_atomUnit(w); shift_check(w, x); B f = fill_both(w, x); usz wia = a(w)->ia; usz xia = a(x)->ia; MAKE_MUT(r, xia); mut_to(r, el_or(TI(w).elType, TI(x).elType)); int mid = wiaia; if (ia==0) return x; B xf = getFillE(x); usz csz = arr_csz(x); MAKE_MUT(r, ia); mut_to(r, TI(x).elType); mut_copy(r, 0, x, csz, ia-csz); mut_fill(r, ia-csz, xf, csz); return qWithFill(mut_fcd(r, x), xf); } B shifta_c2(B t, B w, B x) { if (isAtm(x) || rnk(x)==0) thrM("Β«: 𝕩 cannot be a scalar"); if (isAtm(w)) w = m_atomUnit(w); shift_check(w, x); B f = fill_both(w, x); usz wia = a(w)->ia; usz xia = a(x)->ia; MAKE_MUT(r, xia); mut_to(r, el_or(TI(w).elType, TI(x).elType)); if (wia < xia) { usz m = xia-wia; mut_copy(r, 0, x, wia, m); mut_copy(r, m, w, 0, wia); } else { mut_copy(r, 0, w, wia-xia, xia); } dec(w); return qWithFill(mut_fcd(r, x), f); } B rt_group; B group_c1(B t, B x) { return c1(rt_group, x); } B group_c2(B t, B w, B x) { if (isArr(w)&isArr(x) && rnk(w)==1 && rnk(x)==1) { usz wia = a(w)->ia; usz xia = a(x)->ia; if (wia-xia > 1) thrF("βŠ”: ≠𝕨 must be either ≠𝕩 or one bigger (%s≑≠𝕨, %s≑≠𝕩)", wia, xia); if (TI(w).elType==el_i32) { i32* wp = i32any_ptr(w); i64 ria = wia==xia? -1 : wp[xia]-1; for (usz i = 0; i < xia; i++) if (wp[i]>ria) ria = wp[i]; if (ria>USZ_MAX-1) thrOOM(); ria++; i32 len[ria]; i32 pos[ria]; for (usz i = 0; i < ria; i++) len[i] = pos[i] = 0; for (usz i = 0; i < xia; i++) { i32 n = wp[i]; if (n>=0) len[n]++; } B r = m_fillarrp(ria); arr_shVec(r, ria); fillarr_setFill(r, m_f64(0)); B* rp = fillarr_ptr(r); for (usz i = 0; i < ria; i++) rp[i] = m_f64(0); // don't break if allocation errors B xf = getFillQ(x); B rf = m_fillarrp(ria); arr_shVec(rf, 0); fillarr_setFill(r, rf); if (TI(x).elType==el_i32) { for (usz i = 0; i < ria; i++) { i32* t; rp[i] = m_i32arrv(&t, len[i]); } fillarr_setFill(rf, xf); i32* xp = i32any_ptr(x); for (usz i = 0; i < xia; i++) { i32 n = wp[i]; if (n>=0) i32arr_ptr(rp[n])[pos[n]++] = xp[i]; } } else { for (usz i = 0; i < ria; i++) { B c = m_fillarrp(len[i]); fillarr_setFill(c, inc(xf)); a(c)->ia = 0; rp[i] = c; } fillarr_setFill(rf, xf); BS2B xget = TI(x).get; for (usz i = 0; i < xia; i++) { i32 n = wp[i]; if (n>=0) fillarr_ptr(rp[n])[pos[n]++] = xget(x, i); } for (usz i = 0; i < ria; i++) { arr_shVec(rp[i], len[i]); } } dec(w); dec(x); return r; } else { BS2B wgetU = TI(w).getU; i64 ria = wia==xia? -1 : o2i64(wgetU(w, xia))-1; for (usz i = 0; i < xia; i++) { if (!isNum(w)) goto base; i64 c = o2i64(wgetU(w, i)); if (c>ria) ria = c; } if (ria>USZ_MAX-1) thrOOM(); ria++; i32 len[ria]; i32 pos[ria]; for (usz i = 0; i < ria; i++) len[i] = pos[i] = 0; for (usz i = 0; i < xia; i++) { i64 n = o2i64u(wgetU(w, i)); if (n>=0) len[n]++; } B r = m_fillarrp(ria); arr_shVec(r, ria); fillarr_setFill(r, m_f64(0)); B* rp = fillarr_ptr(r); for (usz i = 0; i < ria; i++) rp[i] = m_f64(0); // don't break if allocation errors B xf = getFillQ(x); for (usz i = 0; i < ria; i++) { B c = m_fillarrp(len[i]); fillarr_setFill(c, inc(xf)); a(c)->ia = 0; rp[i] = c; } B rf = m_fillarrp(ria); arr_shVec(rf, 0); fillarr_setFill(rf, xf); fillarr_setFill(r, rf); BS2B xget = TI(x).get; for (usz i = 0; i < xia; i++) { i64 n = o2i64u(wgetU(w, i)); if (n>=0) fillarr_ptr(rp[n])[pos[n]++] = xget(x, i); } for (usz i = 0; i < ria; i++) { arr_shVec(rp[i], len[i]); } dec(w); dec(x); return r; } } base: return c2(rt_group, w, x); } B pick_uc1(B t, B o, B x) { if (isAtm(x) || a(x)->ia==0) return def_fn_uc1(t, o, x); usz ia = a(x)->ia; B arg = TI(x).get(x, 0); B rep = c1(o, arg); MAKE_MUT(r, ia); mut_to(r, el_or(TI(x).elType, selfElType(rep))); mut_set(r, 0, rep); mut_copy(r, 1, x, 1, ia-1); return mut_fcd(r, x); } B pick_ucw(B t, B o, B w, B x) { if (isArr(w) || isAtm(x) || rnk(x)!=1) return def_fn_ucw(t, o, w, x); usz xia = a(x)->ia; i64 wi = o2i64(w); if (wi<0) wi+= (i64)xia; if ((u64)wi >= xia) thrF("π”½βŒΎ(nβŠΈβŠ‘)𝕩: reading out-of-bounds (n≑%R, %s≑≠𝕩)", w, xia); B arg = TI(x).get(x, wi); B rep = c1(o, arg); if (reusable(x) && TI(x).canStore(rep)) { if (TI(x).elType==el_i32) { i32* xp = i32any_ptr(x); xp[wi] = o2i(rep); return x; } else if (v(x)->type==t_harr) { B* xp = harr_ptr(x); dec(xp[wi]); xp[wi] = rep; return x; } else if (TI(x).elType==el_f64) { f64* xp = f64any_ptr(x); xp[wi] = o2f(rep); return x; } else if (v(x)->type==t_fillarr) { B* xp = fillarr_ptr(x); dec(xp[wi]); xp[wi] = rep; return x; } } MAKE_MUT(r, xia); mut_to(r, el_or(TI(x).elType, selfElType(rep))); mut_set(r, wi, rep); mut_copy(r, 0, x, 0, wi); mut_copy(r, wi+1, x, wi+1, xia-wi-1); return mut_fcd(r, x); } B slash_ucw(B t, B o, B w, B x) { if (isAtm(w) || rnk(w)!=1 || rnk(x)!=1 || a(w)->ia!=a(x)->ia) return def_fn_ucw(t, o, w, x); usz ia = a(x)->ia; BS2B wgetU = TI(w).getU; for (usz i = 0; i < ia; i++) { B cw=wgetU(w,i); if (!q_i32(cw)) return def_fn_ucw(t, o, w, x); } B arg = slash_c2(t, inc(w), inc(x)); usz argIA = a(arg)->ia; B rep = c1(o, arg); if (isAtm(rep) || rnk(rep)!=1 || a(rep)->ia != argIA) thrF("π”½βŒΎ(a⊸/)𝕩: Result of 𝔽 must have the same shape as a/𝕩 (expected ⟨%s⟩, got %H)", argIA, rep); MAKE_MUT(r, ia); mut_to(r, el_or(TI(x).elType, TI(rep).elType)); BS2B xget = TI(x).get; BS2B rgetU = TI(rep).getU; BS2B rget = TI(rep).get; usz repI = 0; for (usz i = 0; i < ia; i++) { i32 cw = o2iu(wgetU(w, i)); if (cw) { B cr = rget(rep,repI); if (CHECK_VALID) for (i32 j = 1; j < cw; j++) if (!equal(rgetU(rep,repI+j), cr)) { mut_pfree(r,i); thrM("π”½βŒΎ(a⊸/): Incompatible result elements"); } mut_set(r, i, cr); repI+= cw; } else mut_set(r, i, xget(x,i)); } dec(w); dec(rep); return mut_fcd(r, x); } #define F(A,M,D) A(shape) A(pick) A(pair) A(select) A(slash) A(join) A(couple) A(shiftb) A(shifta) A(take) A(drop) A(group) BI_FNS0(F); static inline void sfns_init() { BI_FNS1(F) c(BFn,bi_pick)->uc1 = pick_uc1; c(BFn,bi_pick)->ucw = pick_ucw; c(BFn,bi_slash)->ucw = slash_ucw; } #undef F