{"action":"created","issue":{"url":"https://api.github.com/repos/FabricMC/fabric-base/issues/20","repository_url":"https://api.github.com/repos/FabricMC/fabric-base","labels_url":"https://api.github.com/repos/FabricMC/fabric-base/issues/20/labels{/name}","comments_url":"https://api.github.com/repos/FabricMC/fabric-base/issues/20/comments","events_url":"https://api.github.com/repos/FabricMC/fabric-base/issues/20/events","html_url":"https://github.com/FabricMC/fabric-base/issues/20","id":176794467,"number":20,"title":"Use topological sort to improve hookchain","user":{"login":"liach","id":7806504,"avatar_url":"https://avatars.githubusercontent.com/u/7806504?v=3","gravatar_id":"","url":"https://api.github.com/users/liach","html_url":"https://github.com/liach","followers_url":"https://api.github.com/users/liach/followers","following_url":"https://api.github.com/users/liach/following{/other_user}","gists_url":"https://api.github.com/users/liach/gists{/gist_id}","starred_url":"https://api.github.com/users/liach/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/liach/subscriptions","organizations_url":"https://api.github.com/users/liach/orgs","repos_url":"https://api.github.com/users/liach/repos","events_url":"https://api.github.com/users/liach/events{/privacy}","received_events_url":"https://api.github.com/users/liach/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2016-09-14T01:50:20Z","updated_at":"2016-09-14T02:42:38Z","closed_at":null,"body":""},"comment":{"url":"https://api.github.com/repos/FabricMC/fabric-base/issues/comments/246889424","html_url":"https://github.com/FabricMC/fabric-base/issues/20#issuecomment-246889424","issue_url":"https://api.github.com/repos/FabricMC/fabric-base/issues/20","id":246889424,"user":{"login":"liach","id":7806504,"avatar_url":"https://avatars.githubusercontent.com/u/7806504?v=3","gravatar_id":"","url":"https://api.github.com/users/liach","html_url":"https://github.com/liach","followers_url":"https://api.github.com/users/liach/followers","following_url":"https://api.github.com/users/liach/following{/other_user}","gists_url":"https://api.github.com/users/liach/gists{/gist_id}","starred_url":"https://api.github.com/users/liach/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/liach/subscriptions","organizations_url":"https://api.github.com/users/liach/orgs","repos_url":"https://api.github.com/users/liach/repos","events_url":"https://api.github.com/users/liach/events{/privacy}","received_events_url":"https://api.github.com/users/liach/received_events","type":"User","site_admin":false},"created_at":"2016-09-14T02:42:38Z","updated_at":"2016-09-14T02:42:38Z","body":"If you use graph algorithms, you just need to record how many dependencies are needed for those hooks and which dependencies are unlocked after one call. You can eventually use a heap, or priority queue, to support numerical priority beyond these hard dependencies. More the check of cycles can be done when executing the method call."}}
{"actor":{"display_login":"liach"}}