{"comment":{"url":"https://api.github.com/repos/envelope-project/laik-lulesh/comments/28036178","html_url":"https://github.com/envelope-project/laik-lulesh/commit/e84b869f0e5f8a715f546e883b1e497496166391#commitcomment-28036178","id":28036178,"user":{"login":"weidendo","id":7921996,"avatar_url":"https://avatars1.githubusercontent.com/u/7921996?v=4","gravatar_id":"","url":"https://api.github.com/users/weidendo","html_url":"https://github.com/weidendo","followers_url":"https://api.github.com/users/weidendo/followers","following_url":"https://api.github.com/users/weidendo/following{/other_user}","gists_url":"https://api.github.com/users/weidendo/gists{/gist_id}","starred_url":"https://api.github.com/users/weidendo/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/weidendo/subscriptions","organizations_url":"https://api.github.com/users/weidendo/orgs","repos_url":"https://api.github.com/users/weidendo/repos","events_url":"https://api.github.com/users/weidendo/events{/privacy}","received_events_url":"https://api.github.com/users/weidendo/received_events","type":"User","site_admin":false},"position":18,"line":116,"path":"laik_vector.cc","commit_id":"e84b869f0e5f8a715f546e883b1e497496166391","created_at":"2018-03-11T11:24:30Z","updated_at":"2018-03-11T11:24:30Z","author_association":"CONTRIBUTOR","body":"Background: fast data lookup is important for performance. At the moment we have a branch, and access to the array base address, access to the array index with the pointer, and dereferencing the returned pointer to access the data. How can this ever achieve same performance as the original code?\r\n"}}
{"actor":{"display_login":"weidendo"}}