{"ast_node_type":"variable","tokens":[{"end":63,"kind":"keyword","start":0,"text":"let"}]}
        let valid_discriminants: BTreeSet<i128> = discriminants
        // First we need to sort the possible discriminant values so that we can look for the largest gap:
            .filter(|&(i, _)| repr.c() || variants[i].iter().all(|f| !f.is_uninhabited()))