INNER CODE UNIT · C++
found
torognes/swarm · src/algo.cpp:434
auto const found = pigeonhole->search(seedampliconid);
if (not found.heavy) {
scanned_pool = false;
auto const listlen = map_candidates_to_pool(found.candidates,
cursor.swarmed,
amps_v, workspace);
qgram_differ.fast(seedampliconid,
workspace.qgram_candidates(listlen),
workspace.qgram_diffs(listlen));
targetcount = collect_targets(listlen, parameters.opt_differences,
workspace);
}
}
if (scanned_pool) {
// The seed's candidates are the whole unswarmed pool, in pool order, so
// there is nothing to collect: hand the workers the pool itself. The pass
// this replaces copied four bytes out of each twenty-byte record into a