Function push_children

src/extraction/complexity.rs:177–191

Pushes the direct children of `parent` onto `stack` in reverse order, so a LIFO pop reproduces left-to-right traversal. Iterates via a `TreeCursor` — sibling walks are O(1) each, vs. O(i) for `parent.child(i)`. Skipping this matters: high-fanout nodes (1 K+ children, common in switch-heavy C files like `kernel/bpf/verifier.c`) turn `for i in 0..N { child(i) }` into an O(N²) trap that dominated ind

(stack: &mut Vec<(TsNode<'a>, u32)>, parent: TsNode<'a>, depth: u32)

/// C files like `kernel/bpf/verifier.c`) turn `for i in 0..N { child(i) }`
/// into an O(N²) trap that dominated indexing time before this helper.
fn push_children<'a>(stack: &mut Vec<(TsNode<'a>, u32)>, parent: TsNode<'a>, depth: u32) {
    let start = stack.len();
    let mut cursor = parent.walk();
    if cursor.goto_first_child() {
        loop {
            stack.push((cursor.node(), depth));
            if !cursor.goto_next_sibling() {
                break;
            }
        }
    }
    // Reverse the slice we just appended so the next `pop()` sees the
    // first child first.
    stack[start..].reverse();
}

/// Extracts the method/function name from a call expression node.
///