{"ast_node_type":"variable","tokens":[{"end":24,"kind":"keyword","start":0,"text":"let"}]}
    let mut cur_idx = 0;
    assert!(next_conditions.is_empty(), "the decision tree has untouched nodes");
    // LLVM hopes the end nodes are sorted in descending order by `num_paths` so that it can