{"action":"created","issue":{"url":"https://api.github.com/repos/kuanb/peartree/issues/12","repository_url":"https://api.github.com/repos/kuanb/peartree","labels_url":"https://api.github.com/repos/kuanb/peartree/issues/12/labels{/name}","comments_url":"https://api.github.com/repos/kuanb/peartree/issues/12/comments","events_url":"https://api.github.com/repos/kuanb/peartree/issues/12/events","html_url":"https://github.com/kuanb/peartree/issues/12","id":283772308,"node_id":"MDU6SXNzdWUyODM3NzIzMDg=","number":12,"title":"[performance] feed_to_graph_path is slow on larger feeds","user":{"login":"kuanb","id":6053396,"node_id":"MDQ6VXNlcjYwNTMzOTY=","avatar_url":"https://avatars1.githubusercontent.com/u/6053396?v=4","gravatar_id":"","url":"https://api.github.com/users/kuanb","html_url":"https://github.com/kuanb","followers_url":"https://api.github.com/users/kuanb/followers","following_url":"https://api.github.com/users/kuanb/following{/other_user}","gists_url":"https://api.github.com/users/kuanb/gists{/gist_id}","starred_url":"https://api.github.com/users/kuanb/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/kuanb/subscriptions","organizations_url":"https://api.github.com/users/kuanb/orgs","repos_url":"https://api.github.com/users/kuanb/repos","events_url":"https://api.github.com/users/kuanb/events{/privacy}","received_events_url":"https://api.github.com/users/kuanb/received_events","type":"User","site_admin":false},"labels":[{"id":768378495,"node_id":"MDU6TGFiZWw3NjgzNzg0OTU=","url":"https://api.github.com/repos/kuanb/peartree/labels/performance","name":"performance","color":"006b75","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":7,"created_at":"2017-12-21T04:45:58Z","updated_at":"2018-07-16T00:44:04Z","closed_at":null,"author_association":"OWNER","body":"`test_feed_to_graph_path` itself is the slowest test by far. Create benchmarks and identify which steps are slowest. Find ways to speed up operations and get graph creation process to be as fast as possible."},"comment":{"url":"https://api.github.com/repos/kuanb/peartree/issues/comments/405130464","html_url":"https://github.com/kuanb/peartree/issues/12#issuecomment-405130464","issue_url":"https://api.github.com/repos/kuanb/peartree/issues/12","id":405130464,"node_id":"MDEyOklzc3VlQ29tbWVudDQwNTEzMDQ2NA==","user":{"login":"yiyange","id":14876272,"node_id":"MDQ6VXNlcjE0ODc2Mjcy","avatar_url":"https://avatars2.githubusercontent.com/u/14876272?v=4","gravatar_id":"","url":"https://api.github.com/users/yiyange","html_url":"https://github.com/yiyange","followers_url":"https://api.github.com/users/yiyange/followers","following_url":"https://api.github.com/users/yiyange/following{/other_user}","gists_url":"https://api.github.com/users/yiyange/gists{/gist_id}","starred_url":"https://api.github.com/users/yiyange/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/yiyange/subscriptions","organizations_url":"https://api.github.com/users/yiyange/orgs","repos_url":"https://api.github.com/users/yiyange/repos","events_url":"https://api.github.com/users/yiyange/events{/privacy}","received_events_url":"https://api.github.com/users/yiyange/received_events","type":"User","site_admin":false},"created_at":"2018-07-16T00:44:04Z","updated_at":"2018-07-16T00:44:04Z","author_association":"CONTRIBUTOR","body":"I am curious in what cases using multi-processing is faster"}}
{"actor":{"display_login":"yiyange"}}