Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

efficient branching #30

Open
ngsankha opened this issue Jun 7, 2020 · 0 comments
Open

efficient branching #30

ngsankha opened this issue Jun 7, 2020 · 0 comments

Comments

@ngsankha
Copy link
Owner

ngsankha commented Jun 7, 2020

  1. start off with one hole and fill that with the assumption that it will pass all tests.
  2. if one candidate passes n tests and fails m tests, keep the program corresponding to n tests together (along with branch condition) and recursively apply this procedure.
  3. Then apply the merge procedure as in the paper.

This method will eliminate individual cost for generating candidates for each test.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ngsankha