{"ast_node_type":"other","tokens":[{"end":92,"kind":"keyword","start":0,"text":"//"}]}
    // LLVM hopes the end nodes are sorted in descending order by `num_paths` so that it can
    let mut cur_idx = 0;
    // optimize bitmap size for decisions in tree form such as `a && b && c && d && ...`.