{"action":"closed","issue":{"url":"https://api.github.com/repos/seachel/treehehe/issues/10","repository_url":"https://api.github.com/repos/seachel/treehehe","labels_url":"https://api.github.com/repos/seachel/treehehe/issues/10/labels{/name}","comments_url":"https://api.github.com/repos/seachel/treehehe/issues/10/comments","events_url":"https://api.github.com/repos/seachel/treehehe/issues/10/events","html_url":"https://github.com/seachel/treehehe/issues/10","id":379328076,"node_id":"MDU6SXNzdWUzNzkzMjgwNzY=","number":10,"title":"Compute node coordinates on tree traversal","user":{"login":"seachel","id":25065270,"node_id":"MDQ6VXNlcjI1MDY1Mjcw","avatar_url":"https://avatars2.githubusercontent.com/u/25065270?v=4","gravatar_id":"","url":"https://api.github.com/users/seachel","html_url":"https://github.com/seachel","followers_url":"https://api.github.com/users/seachel/followers","following_url":"https://api.github.com/users/seachel/following{/other_user}","gists_url":"https://api.github.com/users/seachel/gists{/gist_id}","starred_url":"https://api.github.com/users/seachel/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/seachel/subscriptions","organizations_url":"https://api.github.com/users/seachel/orgs","repos_url":"https://api.github.com/users/seachel/repos","events_url":"https://api.github.com/users/seachel/events{/privacy}","received_events_url":"https://api.github.com/users/seachel/received_events","type":"User","site_admin":false},"labels":[{"id":1127923344,"node_id":"MDU6TGFiZWwxMTI3OTIzMzQ0","url":"https://api.github.com/repos/seachel/treehehe/labels/On%20hold","name":"On hold","color":"f4f284","default":false},{"id":1111771319,"node_id":"MDU6TGFiZWwxMTExNzcxMzE5","url":"https://api.github.com/repos/seachel/treehehe/labels/enhancement","name":"enhancement","color":"a2eeef","default":true}],"state":"closed","locked":false,"assignee":{"login":"seachel","id":25065270,"node_id":"MDQ6VXNlcjI1MDY1Mjcw","avatar_url":"https://avatars2.githubusercontent.com/u/25065270?v=4","gravatar_id":"","url":"https://api.github.com/users/seachel","html_url":"https://github.com/seachel","followers_url":"https://api.github.com/users/seachel/followers","following_url":"https://api.github.com/users/seachel/following{/other_user}","gists_url":"https://api.github.com/users/seachel/gists{/gist_id}","starred_url":"https://api.github.com/users/seachel/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/seachel/subscriptions","organizations_url":"https://api.github.com/users/seachel/orgs","repos_url":"https://api.github.com/users/seachel/repos","events_url":"https://api.github.com/users/seachel/events{/privacy}","received_events_url":"https://api.github.com/users/seachel/received_events","type":"User","site_admin":false},"assignees":[{"login":"seachel","id":25065270,"node_id":"MDQ6VXNlcjI1MDY1Mjcw","avatar_url":"https://avatars2.githubusercontent.com/u/25065270?v=4","gravatar_id":"","url":"https://api.github.com/users/seachel","html_url":"https://github.com/seachel","followers_url":"https://api.github.com/users/seachel/followers","following_url":"https://api.github.com/users/seachel/following{/other_user}","gists_url":"https://api.github.com/users/seachel/gists{/gist_id}","starred_url":"https://api.github.com/users/seachel/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/seachel/subscriptions","organizations_url":"https://api.github.com/users/seachel/orgs","repos_url":"https://api.github.com/users/seachel/repos","events_url":"https://api.github.com/users/seachel/events{/privacy}","received_events_url":"https://api.github.com/users/seachel/received_events","type":"User","site_admin":false}],"milestone":null,"comments":0,"created_at":"2018-11-09T21:28:31Z","updated_at":"2018-11-22T00:41:48Z","closed_at":"2018-11-22T00:41:48Z","author_association":"OWNER","body":"The tree traversal begins at the root, so the initial coordinates of the root node, its text, and its children come from one of four base cases: zero, one, two, or three children. These should be values that are updated during tree traversal.\r\n\r\nTODO:\r\n\r\n- for each base case, compute coordinates of all elements and changes to height and width of grid\r\n\r\nThoughts:\r\n\r\n- is it necessary to keep updating the values at each level of the tree, or one computation once the tree is parsed:\r\n- can each node update the coordinates of the level before it, so that each nodes coordinates references it's children?\r\n- how to position nodes \"inside\" containing inferences? i.e. above an inference line vs outside of it"}}
{"actor":{"display_login":"seachel"}}