Backupppert/oh-my-git
1
0
Fork 0
mirror of https://github.com/git-learning-game/oh-my-git.git synced 2024-11-22 16:20:19 +01:00
Code Issues Projects Releases Packages Wiki Activity

Prior positioning of nodes for better layout

Browse source
This commit is contained in:
bleeptrack 2020-10-01 13:11:29 +02:00
parent 1eb0e0ef9f
commit 56995440a2
3 changed files with 33 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
helpers.gd
View file

@ -8,6 +8,7 @@ func crash(message):
print("FATAL ERROR: " + message) print("FATAL ERROR: " + message)
get_tree().quit() get_tree().quit()
# Oh, still here? Let's crash more violently, by calling a non-existing method. # Oh, still here? Let's crash more violently, by calling a non-existing method.
# Violent delights have violent ends.
get_tree().fatal_error() get_tree().fatal_error()
# Run a simple command with arguments, blocking, using OS.execute. # Run a simple command with arguments, blocking, using OS.execute.

2
main.gd
View file

@ -40,7 +40,7 @@ func _ready():
chapter_select.select(0) chapter_select.select(0)
# Load first chapter. # Load first chapter.
load_chapter(1) load_chapter(0)
input.grab_focus() input.grab_focus()
func load_chapter(id): func load_chapter(id):

32
repository.gd
View file

@ -33,6 +33,7 @@ func _ready():
set_path(path) set_path(path)
update_everything() update_everything()
update_node_positions()
func _process(_delta): func _process(_delta):
nodes.rect_pivot_offset = nodes.rect_size / 2 nodes.rect_pivot_offset = nodes.rect_size / 2
@ -133,6 +134,35 @@ func update_objects():
nodes.add_child(n) nodes.add_child(n)
objects[o] = n objects[o] = n
func update_node_positions():
if there_is_a_git():
var graph_text = shell.run("git log --graph --oneline --all --no-abbrev")
var graph_lines = Array(graph_text.split("\n"))
graph_lines.pop_back()
for line_count in range(graph_lines.size()):
var line = graph_lines[line_count]
if "*" in line:
var star_idx = line.find("*")
var hash_regex = RegEx.new()
hash_regex.compile("[a-f0-9]+")
var regex_match = hash_regex.search(line)
print(regex_match.get_string())
print(star_idx)
objects[regex_match.get_string()].position = Vector2(star_idx * 100 + 500, line_count * 100 + 500)
for ref in all_refs():
var target_reference = objects[ref].children.keys()[0]
var target = objects[target_reference]
objects[ref].position = Vector2(target.position.x ,target.position.y - 100)
var target_reference = objects["HEAD"].children.keys()[0]
var target = objects[target_reference]
objects["HEAD"].position = Vector2(target.position.x ,target.position.y - 100)
func update_refs(): func update_refs():
for r in all_refs(): for r in all_refs():
if not objects.has(r): if not objects.has(r):
@ -163,7 +193,7 @@ func apply_forces():
var center_of_gravity = nodes.rect_size/2 var center_of_gravity = nodes.rect_size/2
var d = o.position.distance_to(center_of_gravity) var d = o.position.distance_to(center_of_gravity)
var dir = (o.position - center_of_gravity).normalized() var dir = (o.position - center_of_gravity).normalized()
var f = (d+0.00001)*(Vector2(nodes.rect_size.y, nodes.rect_size.x).normalized()/30) var f = (d+0.00001)*(Vector2(nodes.rect_size.y, nodes.rect_size.x/3).normalized()/30)
o.position -= dir*f o.position -= dir*f
func find_position(n): func find_position(n):