Function cursor_has

ds4.c:1481–1487

        uint32_t intersection = 0;
        for (uint32_t a = 0; a < p->n_expert_used; a++) {
            for (uint32_t b = 0; b < p->n_expert_used; b++) {
                if (p->prev_selected[il][a] == selected[b]) {
                    intersection++;
                    break;
                }
            }
        }
        const uint32_t union_size = 2u * p->n_expert_used - intersection;
        p->adjacent_pairs[il]++;
        p->adjacent_overlap_sum[il] +=