{"action":"opened","issue":{"url":"https://api.github.com/repos/toby-allsopp/ranges-coroutines/issues/3","repository_url":"https://api.github.com/repos/toby-allsopp/ranges-coroutines","labels_url":"https://api.github.com/repos/toby-allsopp/ranges-coroutines/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/toby-allsopp/ranges-coroutines/issues/3/comments","events_url":"https://api.github.com/repos/toby-allsopp/ranges-coroutines/issues/3/events","html_url":"https://github.com/toby-allsopp/ranges-coroutines/issues/3","id":220700079,"number":3,"title":"Use atomic ref-counts","user":{"login":"ericniebler","id":225757,"avatar_url":"https://avatars2.githubusercontent.com/u/225757?v=3","gravatar_id":"","url":"https://api.github.com/users/ericniebler","html_url":"https://github.com/ericniebler","followers_url":"https://api.github.com/users/ericniebler/followers","following_url":"https://api.github.com/users/ericniebler/following{/other_user}","gists_url":"https://api.github.com/users/ericniebler/gists{/gist_id}","starred_url":"https://api.github.com/users/ericniebler/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ericniebler/subscriptions","organizations_url":"https://api.github.com/users/ericniebler/orgs","repos_url":"https://api.github.com/users/ericniebler/repos","events_url":"https://api.github.com/users/ericniebler/events{/privacy}","received_events_url":"https://api.github.com/users/ericniebler/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-04-10T16:30:27Z","updated_at":"2017-04-10T16:30:27Z","closed_at":null,"body":"I'm curious whether a smart-enough compiler is able to optimize/remove the atomic operations when it can determine there is no race. See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0062r1.html and http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4455.html."}}
{"actor":{"display_login":"ericniebler"}}