aboutsummaryrefslogtreecommitdiff
path: root/examples/dependencies.tm
blob: e13e3621ab16b7c86f5a2669a97e767e28374483 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
# Show dependency graph
use file

func build_dependency_graph(filename:Text, dependencies:&{Text:@{Text}}):
    reader := when LineReader.from_file(filename) is Failure(msg):
        return
    is Open(reader): reader

    while when reader:next_line() is Success(line):
        if line:matches($/{start}use {..}.tm/):
            import := line:replace($/{start}use {..}/, "\2")
            resolved := relative_path(resolve_path(import, filename))
            if resolved != "":
                import = resolved

            if not dependencies:has(filename):
                dependencies:set(filename, @{:Text})

            dependencies:get(filename):add(import)
            if not dependencies:has(import):
                build_dependency_graph(import, dependencies)

func get_dependency_graph(file:Text)->{Text:{Text}}:
    graph := {:Text:@{Text}}
    resolved := relative_path(file)
    build_dependency_graph(resolved, &graph)
    return {f:deps[] for f,deps in graph}

func draw_tree(file:Text, dependencies:{Text:{Text}}, already_printed:&{Text}, prefix="", is_last=yes):
    color_file := if resolve_path(file): file else: "$\x1b[31;1m$file$\x1b[m"


    if already_printed:has(file):
        say(prefix ++ (if is_last: "└── " else: "├── ") ++ color_file ++ " $\x1b[2m(recursive)$\x1b[m")
        return

    say(prefix ++ (if is_last: "└── " else: "├── ") ++ color_file)
    already_printed:add(file)
    
    child_prefix := prefix ++ (if is_last: "    " else: "│   ")
    
    children := dependencies:get(file, {:Text})
    for i,child in children.items:
        is_child_last := (i == children.length)
        draw_tree(child, dependencies, already_printed, child_prefix, is_child_last)

func main(files:[Text]):
    for f,file in files:
        if not file:matches($/{..}.tm/):
            say("$\x1b[2mSkipping $file$\x1b[m")
            skip

        printed := {:Text}
        resolved := relative_path(file)
        if resolved != "":
            file = resolved

        deps := get_dependency_graph(file)

        say(file)
        printed:add(file)
        children := deps:get(file, {:Text})
        for i,child in children.items:
            is_child_last := (i == children.length)
            draw_tree(child, deps, already_printed=&printed, is_last=is_child_last)