#include "common.hpp" #include #include // Original seed -> x -> z -> cells nesting, counting every matching anchor. std::vector scan(const show::Args& a) { std::atomic next{0}, count{0}; std::atomic overflow{false}; std::vector> local(a.cpuThreads); std::vector workers; for(int t=0;t=a.seeds) break; for(uint64_t xi=0;xi(a.seed+s,x,z,a.n)) { if(count.fetch_add(1,std::memory_order_relaxed) result; for(const auto& v:local) result.insert(result.end(),v.begin(),v.end()); return result; } int main(int argc,char** argv) { try { const auto a=show::parse(argc,argv); std::cout.precision(10); auto expected=scan(a); // full-workload warmup std::sort(expected.begin(),expected.end()); std::vector times; for(int r=0;r