{"ast_node_type":"other","tokens":[{"end":106,"kind":"keyword","start":0,"text":"//"}]}
        // First we need to sort the possible discriminant values so that we can look for the largest gap:
        let valid_discriminants: BTreeSet<i128> = discriminants