{"action":"created","issue":{"url":"https://api.github.com/repos/gintool/gin/issues/16","repository_url":"https://api.github.com/repos/gintool/gin","labels_url":"https://api.github.com/repos/gintool/gin/issues/16/labels{/name}","comments_url":"https://api.github.com/repos/gintool/gin/issues/16/comments","events_url":"https://api.github.com/repos/gintool/gin/issues/16/events","html_url":"https://github.com/gintool/gin/issues/16","id":271910849,"number":16,"title":"Bug? Size zero patches possible","user":{"login":"sandybrownlee","id":7725644,"avatar_url":"https://avatars3.githubusercontent.com/u/7725644?v=4","gravatar_id":"","url":"https://api.github.com/users/sandybrownlee","html_url":"https://github.com/sandybrownlee","followers_url":"https://api.github.com/users/sandybrownlee/followers","following_url":"https://api.github.com/users/sandybrownlee/following{/other_user}","gists_url":"https://api.github.com/users/sandybrownlee/gists{/gist_id}","starred_url":"https://api.github.com/users/sandybrownlee/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sandybrownlee/subscriptions","organizations_url":"https://api.github.com/users/sandybrownlee/orgs","repos_url":"https://api.github.com/users/sandybrownlee/repos","events_url":"https://api.github.com/users/sandybrownlee/events{/privacy}","received_events_url":"https://api.github.com/users/sandybrownlee/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":5,"created_at":"2017-11-07T17:07:39Z","updated_at":"2017-11-10T11:52:00Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"LocalSearch.neighbour() can generate a patch with no Edits in it, by deleting an edit when patch size == 1. Not sure if this is intentional or not!"},"comment":{"url":"https://api.github.com/repos/gintool/gin/issues/comments/343454075","html_url":"https://github.com/gintool/gin/issues/16#issuecomment-343454075","issue_url":"https://api.github.com/repos/gintool/gin/issues/16","id":343454075,"user":{"login":"drdrwhite","id":23726180,"avatar_url":"https://avatars3.githubusercontent.com/u/23726180?v=4","gravatar_id":"","url":"https://api.github.com/users/drdrwhite","html_url":"https://github.com/drdrwhite","followers_url":"https://api.github.com/users/drdrwhite/followers","following_url":"https://api.github.com/users/drdrwhite/following{/other_user}","gists_url":"https://api.github.com/users/drdrwhite/gists{/gist_id}","starred_url":"https://api.github.com/users/drdrwhite/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/drdrwhite/subscriptions","organizations_url":"https://api.github.com/users/drdrwhite/orgs","repos_url":"https://api.github.com/users/drdrwhite/repos","events_url":"https://api.github.com/users/drdrwhite/events{/privacy}","received_events_url":"https://api.github.com/users/drdrwhite/received_events","type":"User","site_admin":false},"created_at":"2017-11-10T11:52:00Z","updated_at":"2017-11-10T11:52:00Z","author_association":"COLLABORATOR","body":"Thanks for chiming in, Markus.\r\n\r\nI can see a few ways of implementing a racing approach:\r\n\r\n- Racing two (or n) patches across a set of test cases (this fits well with local search or tournament selection)\r\n\r\n- Repeatedly sampling the _same_ set of tests with two patches until we can determine a difference between them with a certain statistical confidence.\r\n\r\n> Do we want to go there right away?\r\n\r\nNot necessarily, but I think we need to work out some way of solving the execution time comparison problem. Alternatives include counting the number of bytecodes executed, and using a model to estimate expected execution time, for instance.\r\n\r\nImmediate question is - how is this solved in other software? I know that some work takes the 3rd quartile as a conservative estimate of the execution time, for example. "}}
{"actor":{"display_login":"drdrwhite"}}