diff options
Diffstat (limited to 'examples/tomodeps/tomodeps.tm')
| -rw-r--r-- | examples/tomodeps/tomodeps.tm | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/examples/tomodeps/tomodeps.tm b/examples/tomodeps/tomodeps.tm index 4ccbec2c..1aafa6bd 100644 --- a/examples/tomodeps/tomodeps.tm +++ b/examples/tomodeps/tomodeps.tm @@ -11,12 +11,12 @@ _HELP := " enum Dependency(File(path:Path), Module(name:Text)) -func _get_file_dependencies(file:Path -> {Dependency}) +func _get_file_dependencies(file:Path -> |Dependency|) if not file.is_file() say("Could not read file: $file") - return {/} + return || - deps : @{Dependency} = @{/} + deps : @|Dependency| = @|| if lines := file.by_line() for line in lines if line.matches_pattern($Pat/use {..}.tm/) @@ -27,18 +27,18 @@ func _get_file_dependencies(file:Path -> {Dependency}) deps.add(Dependency.Module(module_name)) return deps[] -func _build_dependency_graph(dep:Dependency, dependencies:@{Dependency={Dependency}}) +func _build_dependency_graph(dep:Dependency, dependencies:@{Dependency=|Dependency|}) return if dependencies.has(dep) - dependencies[dep] = {/} # Placeholder + dependencies[dep] = || # Placeholder dep_deps := when dep is File(path) _get_file_dependencies(path) is Module(module) dir := (~/.local/share/tomo/installed/$module) - module_deps : @{Dependency} = @{/} - visited : @{Path} = @{/} - unvisited := @{f.resolved() for f in dir.files() if f.extension() == ".tm"} + module_deps : @|Dependency| = @|| + visited : @|Path| = @|| + unvisited := @|f.resolved() for f in dir.files() if f.extension() == ".tm"| while unvisited.length > 0 file := unvisited.items[-1] unvisited.remove(file) @@ -57,8 +57,8 @@ func _build_dependency_graph(dep:Dependency, dependencies:@{Dependency={Dependen for dep2 in dep_deps _build_dependency_graph(dep2, dependencies) -func get_dependency_graph(dep:Dependency -> {Dependency={Dependency}}) - graph : @{Dependency={Dependency}} = @{} +func get_dependency_graph(dep:Dependency -> {Dependency=|Dependency|}) + graph : @{Dependency=|Dependency|} = @{} _build_dependency_graph(dep, graph) return graph @@ -72,7 +72,7 @@ func _printable_name(dep:Dependency -> Text) else return "$(\x1b)[31;1m$(f) (not found)$(\x1b)[m" -func _draw_tree(dep:Dependency, dependencies:{Dependency={Dependency}}, already_printed:@{Dependency}, prefix="", is_last=yes) +func _draw_tree(dep:Dependency, dependencies:{Dependency=|Dependency|}, already_printed:@|Dependency|, prefix="", is_last=yes) if already_printed.has(dep) say(prefix ++ (if is_last "└── " else "├── ") ++ _printable_name(dep) ++ " $\x1b[2m(recursive)$\x1b[m") return @@ -82,16 +82,16 @@ func _draw_tree(dep:Dependency, dependencies:{Dependency={Dependency}}, already_ child_prefix := prefix ++ (if is_last " " else "│ ") - children := dependencies[dep] or {/} + children := dependencies[dep] or || for i,child in children.items is_child_last := (i == children.length) _draw_tree(child, dependencies, already_printed, child_prefix, is_child_last) -func draw_tree(dep:Dependency, dependencies:{Dependency={Dependency}}) - printed : @{Dependency} = @{/} +func draw_tree(dep:Dependency, dependencies:{Dependency=|Dependency|}) + printed : @|Dependency| = @|| say(_printable_name(dep)) printed.add(dep) - deps := dependencies[dep] or {/} + deps := dependencies[dep] or || for i,child in deps.items is_child_last := (i == deps.length) _draw_tree(child, dependencies, already_printed=printed, is_last=is_child_last) |