{"ast_node_type":"other","tokens":[{"end":60,"kind":"keyword","start":0,"text":"assert_eq!(dominator_order.len(),"}]}
        assert_eq!(dominator_order.len(), this.num_nodes());
        // The coverage graph is created by traversal, so all nodes are reachable.
        for (rank, bcb) in (0u32..).zip(dominator_order) {