{"action":"created","issue":{"url":"https://api.github.com/repos/kdmurray91/kWIP/issues/8","labels_url":"https://api.github.com/repos/kdmurray91/kWIP/issues/8/labels{/name}","comments_url":"https://api.github.com/repos/kdmurray91/kWIP/issues/8/comments","events_url":"https://api.github.com/repos/kdmurray91/kWIP/issues/8/events","html_url":"https://github.com/kdmurray91/kWIP/issues/8","id":117724241,"number":8,"title":"Diagonal calculated twice","user":{"login":"chengsoonong","id":709424,"avatar_url":"https://avatars.githubusercontent.com/u/709424?v=3","gravatar_id":"","url":"https://api.github.com/users/chengsoonong","html_url":"https://github.com/chengsoonong","followers_url":"https://api.github.com/users/chengsoonong/followers","following_url":"https://api.github.com/users/chengsoonong/following{/other_user}","gists_url":"https://api.github.com/users/chengsoonong/gists{/gist_id}","starred_url":"https://api.github.com/users/chengsoonong/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/chengsoonong/subscriptions","organizations_url":"https://api.github.com/users/chengsoonong/orgs","repos_url":"https://api.github.com/users/chengsoonong/repos","events_url":"https://api.github.com/users/chengsoonong/events{/privacy}","received_events_url":"https://api.github.com/users/chengsoonong/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":2,"created_at":"2015-11-19T02:06:44Z","updated_at":"2015-11-22T23:08:24Z","closed_at":null,"body":"In the calculation of the kernel matrix, the items along the diagonal are computed twice, i.e when i=j.\r\n\r\n"},"comment":{"url":"https://api.github.com/repos/kdmurray91/kWIP/issues/comments/158817174","html_url":"https://github.com/kdmurray91/kWIP/issues/8#issuecomment-158817174","issue_url":"https://api.github.com/repos/kdmurray91/kWIP/issues/8","id":158817174,"user":{"login":"chengsoonong","id":709424,"avatar_url":"https://avatars.githubusercontent.com/u/709424?v=3","gravatar_id":"","url":"https://api.github.com/users/chengsoonong","html_url":"https://github.com/chengsoonong","followers_url":"https://api.github.com/users/chengsoonong/followers","following_url":"https://api.github.com/users/chengsoonong/following{/other_user}","gists_url":"https://api.github.com/users/chengsoonong/gists{/gist_id}","starred_url":"https://api.github.com/users/chengsoonong/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/chengsoonong/subscriptions","organizations_url":"https://api.github.com/users/chengsoonong/orgs","repos_url":"https://api.github.com/users/chengsoonong/repos","events_url":"https://api.github.com/users/chengsoonong/events{/privacy}","received_events_url":"https://api.github.com/users/chengsoonong/received_events","type":"User","site_admin":false},"created_at":"2015-11-22T23:08:24Z","updated_at":"2015-11-22T23:08:24Z","body":"Sorry for the imprecise bug report. When i == j, (the diagonal), you can skip the second call to _get_hash. Depending on how your memory management works, you could just add an extra if statement there, or you could write another for loop to just compute the diagonal.\r\n "}}