157 lines
4.8 KiB
C
157 lines
4.8 KiB
C
#include "../core.h"
|
|
#include "gstack.h"
|
|
|
|
|
|
|
|
B toCells(B x) {
|
|
assert(isArr(x) && rnk(x)>1);
|
|
usz cam = a(x)->sh[0];
|
|
usz csz = arr_csz(x);
|
|
usz i = 0;
|
|
BSS2A slice = TI(x,slice);
|
|
usz p = 0;
|
|
HArr_p r = m_harrs(cam, &i);
|
|
if (rnk(x)==2) {
|
|
for (; i < cam; i++) {
|
|
Arr* s = slice(inc(x), p, csz); arr_shVec(s);
|
|
r.a[i] = taga(s);
|
|
p+= csz;
|
|
}
|
|
} else {
|
|
usz cr = rnk(x)-1;
|
|
ShArr* csh = m_shArr(cr);
|
|
usz* xsh = a(x)->sh;
|
|
for (u64 i = 0; i < cr; i++) csh->a[i] = xsh[i+1];
|
|
for (; i < cam; i++) {
|
|
Arr* s = slice(inc(x), p, csz); arr_shSetI(s, cr, csh);
|
|
r.a[i] = taga(s);
|
|
p+= csz;
|
|
}
|
|
ptr_dec(csh);
|
|
}
|
|
dec(x);
|
|
return harr_fv(r);
|
|
}
|
|
B toKCells(B x, ur k) {
|
|
assert(isArr(x) && k<=rnk(x) && k>=0);
|
|
ur xr = rnk(x); usz* xsh = a(x)->sh;
|
|
ur cr = xr-k;
|
|
usz cam = 1; for (i32 i = 0; i < k ; i++) cam*= xsh[i];
|
|
usz csz = 1; for (i32 i = k; i < xr; i++) csz*= xsh[i];
|
|
|
|
ShArr* csh;
|
|
if (cr>1) {
|
|
csh = m_shArr(cr);
|
|
for (i32 i = 0; i < cr; i++) csh->a[i] = xsh[i+k];
|
|
}
|
|
|
|
usz i = 0;
|
|
usz p = 0;
|
|
HArr_p r = m_harrs(cam, &i);
|
|
BSS2A slice = TI(x,slice);
|
|
for (; i < cam; i++) {
|
|
Arr* s = slice(inc(x), p, csz); arr_shSetI(s, cr, csh);
|
|
r.a[i] = taga(s);
|
|
p+= csz;
|
|
}
|
|
if (cr>1) ptr_dec(csh);
|
|
usz* rsh = harr_fa(r, k);
|
|
if (rsh) for (i32 i = 0; i < k; i++) rsh[i] = xsh[i];
|
|
dec(x);
|
|
return r.b;
|
|
}
|
|
|
|
|
|
HArr* toHArr(B x) {
|
|
if (v(x)->type==t_harr) return c(HArr,x);
|
|
HArr_p r = m_harrUc(x);
|
|
usz ia = r.c->ia;
|
|
SGet(x)
|
|
for (usz i = 0; i < ia; i++) r.a[i] = Get(x,i);
|
|
dec(x);
|
|
return r.c;
|
|
}
|
|
|
|
NOINLINE B m_caB(usz ia, B* a) {
|
|
HArr_p r = m_harrUv(ia);
|
|
for (usz i = 0; i < ia; i++) r.a[i] = a[i];
|
|
return r.b;
|
|
}
|
|
|
|
NOINLINE void harr_pfree(B x, usz am) { // am - item after last written
|
|
assert(v(x)->type==t_harr);
|
|
B* p = harr_ptr(x);
|
|
for (usz i = 0; i < am; i++) dec(p[i]);
|
|
if (rnk(x)>1) ptr_dec(shObj(x));
|
|
mm_free(v(x));
|
|
}
|
|
|
|
|
|
|
|
static Arr* m_hslice(Arr* p, B* ptr, usz ia) {
|
|
HSlice* r = m_arr(sizeof(HSlice), t_hslice, ia);
|
|
r->p = p;
|
|
r->a = ptr;
|
|
return (Arr*)r;
|
|
}
|
|
static Arr* harr_slice (B x, usz s, usz ia) { return m_hslice(a(x), c(HArr,x)->a+s, ia); }
|
|
static Arr* hslice_slice(B x, usz s, usz ia) { Arr* p=c(Slice,x)->p; ptr_inc(p); Arr* r = m_hslice(p, c(HSlice,x)->a+s, ia); dec(x); return r; }
|
|
|
|
static B harr_get (Arr* x, usz n) { assert(x->type==t_harr ); return inc(((HArr* )x)->a[n]); }
|
|
static B hslice_get (Arr* x, usz n) { assert(x->type==t_hslice); return inc(((HSlice*)x)->a[n]); }
|
|
static B harr_getU (Arr* x, usz n) { assert(x->type==t_harr ); return ((HArr* )x)->a[n] ; }
|
|
static B hslice_getU(Arr* x, usz n) { assert(x->type==t_hslice); return ((HSlice*)x)->a[n] ; }
|
|
DEF_FREE(harr) {
|
|
decSh(x);
|
|
B* p = ((HArr*)x)->a; // don't use harr_ptr so type isn't checked
|
|
usz ia = ((Arr*)x)->ia;
|
|
for (usz i = 0; i < ia; i++) dec(p[i]);
|
|
}
|
|
static void harr_visit(Value* x) {
|
|
usz ia = ((Arr*)x)->ia; B* p = ((HArr*)x)->a;
|
|
for (usz i = 0; i < ia; i++) mm_visit(p[i]);
|
|
}
|
|
static bool harr_canStore(B x) { return true; }
|
|
|
|
|
|
|
|
DEF_FREE(harrP) { assert(x->type==t_harrPartial|x->type==t_freed);
|
|
assert(prnk(x)>1? true : ((Arr*)x)->sh!=&((Arr*)x)->ia);
|
|
B* p = ((HArr*)x)->a;
|
|
usz am = *((HArr*)x)->sh;
|
|
// printf("partfree %d/%d %p\n", am, a(x)->ia, (void*)x.u);
|
|
for (usz i = 0; i < am; i++) dec(p[i]);
|
|
}
|
|
static void harrP_visit(Value* x) { assert(x->type==t_harrPartial);
|
|
assert(prnk(x)>1? true : ((Arr*)x)->sh!=&((Arr*)x)->ia);
|
|
B* p = ((HArr*)x)->a;
|
|
usz am = *((HArr*)x)->sh;
|
|
for (usz i = 0; i < am; i++) mm_visit(p[i]);
|
|
}
|
|
static B harrP_get(Arr* x, usz n) { err("getting item from t_harrPartial"); }
|
|
static void harrP_print(B x) {
|
|
B* p = c(HArr,x)->a;
|
|
usz am = *c(HArr,x)->sh;
|
|
usz ia = a(x)->ia;
|
|
printf("(partial HArr "N64d"/"N64d": ⟨", (u64)am, (u64)ia);
|
|
for (usz i = 0; i < ia; i++) {
|
|
if (i) printf(", ");
|
|
if (i>=am) printf("?");
|
|
else print(p[i]);
|
|
}
|
|
printf("⟩)");
|
|
}
|
|
|
|
void harr_init() {
|
|
TIi(t_harr,get) = harr_get; TIi(t_hslice,get) = hslice_get; TIi(t_harrPartial,get) = harrP_get;
|
|
TIi(t_harr,getU) = harr_getU; TIi(t_hslice,getU) = hslice_getU; TIi(t_harrPartial,getU) = harrP_get;
|
|
TIi(t_harr,slice) = harr_slice; TIi(t_hslice,slice) = hslice_slice;
|
|
TIi(t_harr,freeO) = harr_freeO; TIi(t_hslice,freeO) = slice_freeO; TIi(t_harrPartial,freeO) = harrP_freeO;
|
|
TIi(t_harr,freeF) = harr_freeF; TIi(t_hslice,freeF) = slice_freeF; TIi(t_harrPartial,freeF) = harrP_freeF;
|
|
TIi(t_harr,visit) = harr_visit; TIi(t_hslice,visit) = slice_visit; TIi(t_harrPartial,visit) = harrP_visit;
|
|
TIi(t_harr,print) = arr_print; TIi(t_hslice,print) = arr_print; TIi(t_harrPartial,print) = harrP_print;
|
|
TIi(t_harr,isArr) = true; TIi(t_hslice,isArr) = true;
|
|
TIi(t_harr,canStore) = harr_canStore;
|
|
bi_emptyHVec = m_harrUv(0).b; gc_add(bi_emptyHVec);
|
|
}
|