tiny.smg.scan.core.tree

1pub const tree = @import("tree.zig");

1const std = @import("std");23const smg = @import("../../root.zig");4const text = smg.text;5const tree = smg.tree;67pub fn findChild(node: tree.Node, kind: []const u8) ?tree.Node {8    const children = tree.childCount(node);9    for (0..children) |raw_index| {10        const child = tree.child(node, @intCast(raw_index));11        if (std.mem.eql(u8, tree.kind(child), kind)) return child;12    }13    return null;14}1516pub fn namedChildByIndex(node: tree.Node, index: usize) ?tree.Node {17    if (index >= tree.namedChildCount(node)) return null;18    return tree.namedChild(node, @intCast(index));19}2021pub fn hasDescendant(node: tree.Node, kind: []const u8) bool {22    const children = tree.childCount(node);23    for (0..children) |raw_index| {24        const child_node = tree.child(node, @intCast(raw_index));25        if (std.mem.eql(u8, tree.kind(child_node), kind) or hasDescendant(child_node, kind)) return true;26    }27    return false;28}2930pub fn compactParseCandidateAny(source: []const u8, prefixes: []const []const u8) bool {31    const trimmed = text.trim(source);32    if (trimmed.len == 0 or trimmed.len > 4096) return false;33    var matches = false;34    for (prefixes) |prefix| {35        if (std.mem.startsWith(u8, trimmed, prefix)) {36            matches = true;37            break;38        }39    }40    if (!matches) return false;41    return boundedLineLength(trimmed, 512);42}4344fn boundedLineLength(source: []const u8, limit: usize) bool {45    var current: usize = 0;46    for (source) |byte| {47        if (byte == '\n') {48            current = 0;49            continue;50        }51        current += 1;52        if (current > limit) return false;53    }54    return true;55}