{"action":"created","issue":{"url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/8","repository_url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations","labels_url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/8/labels{/name}","comments_url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/8/comments","events_url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/8/events","html_url":"https://github.com/KieranP/Game-Of-Life-Implementations/pull/8","id":379568454,"node_id":"MDExOlB1bGxSZXF1ZXN0MjI5OTgxNTQ2","number":8,"title":"Go (golang) implementation","user":{"login":"DeyV","id":311626,"node_id":"MDQ6VXNlcjMxMTYyNg==","avatar_url":"https://avatars0.githubusercontent.com/u/311626?v=4","gravatar_id":"","url":"https://api.github.com/users/DeyV","html_url":"https://github.com/DeyV","followers_url":"https://api.github.com/users/DeyV/followers","following_url":"https://api.github.com/users/DeyV/following{/other_user}","gists_url":"https://api.github.com/users/DeyV/gists{/gist_id}","starred_url":"https://api.github.com/users/DeyV/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/DeyV/subscriptions","organizations_url":"https://api.github.com/users/DeyV/orgs","repos_url":"https://api.github.com/users/DeyV/repos","events_url":"https://api.github.com/users/DeyV/events{/privacy}","received_events_url":"https://api.github.com/users/DeyV/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":3,"created_at":"2018-11-11T22:05:30Z","updated_at":"2018-11-19T08:08:58Z","closed_at":"2018-11-19T04:23:25Z","author_association":"NONE","pull_request":{"url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/pulls/8","html_url":"https://github.com/KieranP/Game-Of-Life-Implementations/pull/8","diff_url":"https://github.com/KieranP/Game-Of-Life-Implementations/pull/8.diff","patch_url":"https://github.com/KieranP/Game-Of-Life-Implementations/pull/8.patch"},"body":""},"comment":{"url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/comments/439804721","html_url":"https://github.com/KieranP/Game-Of-Life-Implementations/pull/8#issuecomment-439804721","issue_url":"https://api.github.com/repos/KieranP/Game-Of-Life-Implementations/issues/8","id":439804721,"node_id":"MDEyOklzc3VlQ29tbWVudDQzOTgwNDcyMQ==","user":{"login":"KieranP","id":16620,"node_id":"MDQ6VXNlcjE2NjIw","avatar_url":"https://avatars3.githubusercontent.com/u/16620?v=4","gravatar_id":"","url":"https://api.github.com/users/KieranP","html_url":"https://github.com/KieranP","followers_url":"https://api.github.com/users/KieranP/followers","following_url":"https://api.github.com/users/KieranP/following{/other_user}","gists_url":"https://api.github.com/users/KieranP/gists{/gist_id}","starred_url":"https://api.github.com/users/KieranP/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/KieranP/subscriptions","organizations_url":"https://api.github.com/users/KieranP/orgs","repos_url":"https://api.github.com/users/KieranP/repos","events_url":"https://api.github.com/users/KieranP/events{/privacy}","received_events_url":"https://api.github.com/users/KieranP/received_events","type":"User","site_admin":false},"created_at":"2018-11-19T08:08:58Z","updated_at":"2018-11-19T08:08:58Z","author_association":"OWNER","body":"@DeyV Thanks for the feedback. I'm aware of some potential speed boosts such as the one you mentioned. The same multi dimensional array approach would likely improve most of the implementations.\r\n\r\nHowever, the point of this repo though wasn't for measuring raw/optimised speed (since there are many benchmarks all over the place that showcase those sorts of things). My purpose here is to:\r\n\r\na) showcase different constructs for each language (classes, loops, arrays, hashes, etc). Replacing the hash table with a 2D array would leave no other hash tables in the code, which would exclude a rather large part of many languages.\r\nb) write code that is easy to understand, pleasing to read, and a little bit naive (intentionally not optimised). If a language can run fast with unoptimised code, then it's going run even faster once optimised.\r\n\r\nAlso, since all implementations are written similarly, it's put them on an even playing field. I feel these implementations are actually a better benchmark, not of how a language could be, but of how people in general would probably write in that language."}}
{"actor":{"display_login":"KieranP"}}