search

adamcrume / robust-binary-search

Robust Binary Search provides a binary search implementation which is robust against errors during the search.
Apache License 2.0
43 stars 1 forks source link

Contribute to upstream Git repository #1

Open jamestiotio opened 1 year ago

jamestiotio commented 1 year ago

Hi @adamcrume!

Thank you for your great work on this project! I was wondering one day about whether someone has ever considered implementing a version of git bisect that is robust against intermittent errors and found this repository.

I would like to kindly check with you on whether you have any plans on merging this upstream (in C, of course). Having it as a built-in feature in Git itself would be nice and much more convenient for software engineers to use. Perhaps, we could also put it behind some optional flag if this is not considered production-ready yet. I am sure that Junio Hamano would welcome this as a feature. 😄

Otherwise, if you deem this as still too experimental, then that's fine too.

Cheers! James Raphael Tiovalen

adamcrume commented 1 year ago

I wouldn't say this is experimental, but porting it to C would be a decent amount of work, of course. The trickiest part is that this algorithm doesn't (yet) support skipping commits, so that would have to be added first if this were to be merged into git bisect itself rather than being a similar but separate command.