tiny.smg.command.analyze.support

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

1const std = @import("std");23const smg = @import("../../root.zig");4const diff = smg.diff;5const graph_mod = smg.graph;6const model = smg.model;7const output = smg.cli.output;8const text = smg.text;910pub fn deltaNames(allocator: std.mem.Allocator, result: diff.Result) ![]const []const u8 {11    var out: std.ArrayList([]const u8) = .empty;12    for (result.added_nodes) |node| try appendUniqueDeltaName(allocator, &out, node.name);13    for (result.changed_nodes) |node| try appendUniqueDeltaName(allocator, &out, node.node.name);14    for (result.added_edges) |edge| {15        try appendUniqueDeltaName(allocator, &out, edge.source);16        try appendUniqueDeltaName(allocator, &out, edge.target);17    }18    return try out.toOwnedSlice(allocator);19}2021pub fn writeScopeWarning(allocator: std.mem.Allocator, graph: graph_mod.Graph, filter: []const u8) !void {22    const candidate_names = try candidates(allocator, graph, filter);23    var out: std.Io.Writer.Allocating = .init(allocator);24    errdefer out.deinit();25    try out.writer.print("Warning: no nodes matching {s}", .{filter});26    if (candidate_names.len != 0) {27        try out.writer.writeAll(". Did you mean:");28        for (candidate_names[0..@min(candidate_names.len, 5)]) |candidate| try out.writer.print("\n  {s}", .{candidate});29    }30    try out.writer.writeByte('\n');31    try output.writeErr(out.written());32}3334fn candidates(allocator: std.mem.Allocator, graph: graph_mod.Graph, filter: []const u8) ![]const []const u8 {35    const suffix = if (std.mem.lastIndexOfScalar(u8, filter, '.')) |index| filter[index + 1 ..] else filter;36    const middle = try std.fmt.allocPrint(allocator, ".{s}.", .{suffix});37    const end = try std.fmt.allocPrint(allocator, ".{s}", .{suffix});38    var out: std.ArrayList([]const u8) = .empty;39    for (graph.nodes.items) |node| {40        if (std.mem.indexOf(u8, node.name, middle) == null and !std.mem.endsWith(u8, node.name, end)) continue;41        const index = std.mem.lastIndexOf(u8, node.name, end) orelse continue;42        const candidate = try std.fmt.allocPrint(allocator, "{s}.{s}", .{ node.name[0..index], suffix });43        if (!text.list.containsString(out.items, candidate)) try out.append(allocator, candidate);44    }45    std.mem.sort([]const u8, out.items, {}, stringLess);46    return try out.toOwnedSlice(allocator);47}4849fn stringLess(_: void, a: []const u8, b: []const u8) bool {50    return std.mem.lessThan(u8, a, b);51}5253fn appendUniqueDeltaName(allocator: std.mem.Allocator, list: *std.ArrayList([]const u8), name: []const u8) !void {54    if (!text.list.containsString(list.items, name)) try list.append(allocator, name);55}5657test "delta names preserve first occurrence order" {58    const added_nodes = [_]model.Node{.{59        .name = "new",60        .type = model.NodeType.module,61    }};62    const changed_nodes = [_]diff.ChangedNode{.{63        .node = .{ .name = "changed", .type = model.NodeType.function },64        .changes = &.{},65    }};66    const added_edges = [_]model.Edge{67        .{ .source = "new", .rel = model.RelType.calls, .target = "changed" },68        .{ .source = "extra", .rel = model.RelType.imports, .target = "new" },69    };70    const names = try deltaNames(std.testing.allocator, .{71        .added_nodes = &added_nodes,72        .changed_nodes = &changed_nodes,73        .added_edges = &added_edges,74    });75    defer std.testing.allocator.free(names);76    try std.testing.expectEqual(@as(usize, 3), names.len);77    try std.testing.expectEqualStrings("new", names[0]);78    try std.testing.expectEqualStrings("changed", names[1]);79    try std.testing.expectEqualStrings("extra", names[2]);80}8182test "analyze scope candidates match python suffix suggestions" {83    var arena = std.heap.ArenaAllocator.init(std.testing.allocator);84    defer arena.deinit();85    const allocator = arena.allocator();86    var graph = graph_mod.init(allocator);87    try graph_mod.addNode(&graph, .{ .name = "app.service", .type = model.NodeType.module });88    try graph_mod.addNode(&graph, .{ .name = "app.service.Worker", .type = model.NodeType.class });89    try graph_mod.addNode(&graph, .{ .name = "pkg.service", .type = model.NodeType.module });90    try graph_mod.addNode(&graph, .{ .name = "pkg.service.Helper", .type = model.NodeType.class });91    try graph_mod.addNode(&graph, .{ .name = "pkg.other", .type = model.NodeType.module });9293    const candidate_names = try candidates(allocator, graph, "service");94    try std.testing.expectEqual(@as(usize, 2), candidate_names.len);95    try std.testing.expectEqualStrings("app.service", candidate_names[0]);96    try std.testing.expectEqualStrings("pkg.service", candidate_names[1]);97    const none = try candidates(allocator, graph, "missing");98    try std.testing.expectEqual(@as(usize, 0), none.len);99}