{"ast_node_type":"other","tokens":[{"end":89,"kind":"keyword","start":0,"text":"//"}]}
    // optimize bitmap size for decisions in tree form such as `a && b && c && d && ...`.
    // LLVM hopes the end nodes are sorted in descending order by `num_paths` so that it can
    decision_end_nodes.sort_by_key(|(num_paths, _, _)| usize::MAX - *num_paths);