{"action":"created","issue":{"url":"https://api.github.com/repos/ebfull/pairing/issues/85","repository_url":"https://api.github.com/repos/ebfull/pairing","labels_url":"https://api.github.com/repos/ebfull/pairing/issues/85/labels{/name}","comments_url":"https://api.github.com/repos/ebfull/pairing/issues/85/comments","events_url":"https://api.github.com/repos/ebfull/pairing/issues/85/events","html_url":"https://github.com/ebfull/pairing/issues/85","id":330180051,"node_id":"MDU6SXNzdWUzMzAxODAwNTE=","number":85,"title":"Operator Overloading","user":{"login":"afck","id":7894725,"node_id":"MDQ6VXNlcjc4OTQ3MjU=","avatar_url":"https://avatars0.githubusercontent.com/u/7894725?v=4","gravatar_id":"","url":"https://api.github.com/users/afck","html_url":"https://github.com/afck","followers_url":"https://api.github.com/users/afck/followers","following_url":"https://api.github.com/users/afck/following{/other_user}","gists_url":"https://api.github.com/users/afck/gists{/gist_id}","starred_url":"https://api.github.com/users/afck/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/afck/subscriptions","organizations_url":"https://api.github.com/users/afck/orgs","repos_url":"https://api.github.com/users/afck/repos","events_url":"https://api.github.com/users/afck/events{/privacy}","received_events_url":"https://api.github.com/users/afck/received_events","type":"User","site_admin":false},"labels":[{"id":642807376,"node_id":"MDU6TGFiZWw2NDI4MDczNzY=","url":"https://api.github.com/repos/ebfull/pairing/labels/enhancement","name":"enhancement","color":"84b6eb","default":true}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":4,"created_at":"2018-06-07T09:02:00Z","updated_at":"2018-06-12T03:45:42Z","closed_at":null,"author_association":"NONE","body":"Would it make sense to overload the arithmetic operators (`std::ops`) for everything that has an `add`, `add_assign`, `mul` or `mul_assign` method? I would love being able to write `x += y;` instead of `x.add_assign(y)`, but I know that there are arguments against it, too. It certainly would make some heavy computation \"feel\" more lightweight than it is.\r\n\r\nWhat's your opinion on this? If you are fine with it, I'd be happy to try and make e.g. `Field: AddAssign + MulAssign + SubAssign + Neg`, and `CurveAffine: Mul + Neg`."},"comment":{"url":"https://api.github.com/repos/ebfull/pairing/issues/comments/396456568","html_url":"https://github.com/ebfull/pairing/issues/85#issuecomment-396456568","issue_url":"https://api.github.com/repos/ebfull/pairing/issues/85","id":396456568,"node_id":"MDEyOklzc3VlQ29tbWVudDM5NjQ1NjU2OA==","user":{"login":"ebfull","id":3794471,"node_id":"MDQ6VXNlcjM3OTQ0NzE=","avatar_url":"https://avatars1.githubusercontent.com/u/3794471?v=4","gravatar_id":"","url":"https://api.github.com/users/ebfull","html_url":"https://github.com/ebfull","followers_url":"https://api.github.com/users/ebfull/followers","following_url":"https://api.github.com/users/ebfull/following{/other_user}","gists_url":"https://api.github.com/users/ebfull/gists{/gist_id}","starred_url":"https://api.github.com/users/ebfull/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ebfull/subscriptions","organizations_url":"https://api.github.com/users/ebfull/orgs","repos_url":"https://api.github.com/users/ebfull/repos","events_url":"https://api.github.com/users/ebfull/events{/privacy}","received_events_url":"https://api.github.com/users/ebfull/received_events","type":"User","site_admin":false},"created_at":"2018-06-12T03:45:42Z","updated_at":"2018-06-12T03:45:42Z","author_association":"OWNER","body":"One good test is to see how it impacts downstream libraries and benchmarks. I'll do this when I get a chance."}}
{"actor":{"display_login":"ebfull"}}