make sorting set sorted flags

This commit is contained in:
dzaima 2021-12-25 18:24:22 +02:00
parent 7e39407eb4
commit 0552ffbf37
2 changed files with 6 additions and 6 deletions

View File

@ -120,7 +120,7 @@ B GRADE_CAT(c2)(B t, B w, B x) {
x = toI32Any(x); i32* xi = i32any_ptr(x);
if (CHECK_VALID && !FL_HAS(w,fl)) {
for (i64 i = 0; i < (i64)wia-1; i++) if ((wi[i]-wi[i+1]) GRADE_UD(>,<) 0) thrM(GRADE_CHR": 𝕨 must be sorted"GRADE_UD(," in descending order"));
FL_SET(w,fl);
FL_SET(w, fl);
}
for (usz i = 0; i < xia; i++) {
@ -144,7 +144,7 @@ B GRADE_CAT(c2)(B t, B w, B x) {
}
if (CHECK_VALID && !FL_HAS(w,fl)) {
for (i64 i = 0; i < (i64)wia-1; i++) if (compare(wp[i], wp[i+1]) GRADE_UD(>,<) 0) thrM(GRADE_CHR": 𝕨 must be sorted"GRADE_UD(," in descending order"));
FL_SET(w,fl);
FL_SET(w, fl);
}
for (usz i = 0; i < xia; i++) {

View File

@ -37,7 +37,7 @@ B and_c1(B t, B x) {
memcpy(rp, xp, xia*4);
iA_tim_sort(rp, xia);
dec(x);
return r;
return FL_SET(r, fl_asc);
}
B xf = getFillQ(x);
HArr_p r = m_harrUv(xia);
@ -45,7 +45,7 @@ B and_c1(B t, B x) {
for (usz i = 0; i < xia; i++) r.a[i] = Get(x,i);
bA_tim_sort(r.a, xia);
dec(x);
return withFill(r.b,xf);
return FL_SET(withFill(r.b,xf), fl_asc);
}
@ -69,7 +69,7 @@ B or_c1(B t, B x) {
memcpy(rp, xp, xia*4);
iD_tim_sort(rp, xia);
dec(x);
return r;
return FL_SET(r, fl_dsc);
}
B xf = getFillQ(x);
HArr_p r = m_harrUv(xia);
@ -77,5 +77,5 @@ B or_c1(B t, B x) {
for (usz i = 0; i < xia; i++) r.a[i] = Get(x,i);
bD_tim_sort(r.a, xia);
dec(x);
return withFill(r.b,xf);
return FL_SET(withFill(r.b,xf), fl_dsc);
}