Búsqueda Binaria

It's a common developer practice to track down a bug by looking for the change that introduced it. This is most efficiently done by performing a binary search between the last known working commit and the first known broken commit in the commit history.

At each step of the binary search, the bisect method checks out the source code at the commit chosen by the search. The user then has to test to see if the software is working or not. If it is, the user performs a svn-bisect good, otherwise they do a svn-bisect bad, and the search proceeds accordingly.

• App::SVN::Bisect (Recuerde: export LC_MESSAGES=C)
• Beautiful code By Andy Oram, Greg Wilson Chapter Beautiful Debugging
• Andreas Zeller on Debugging Episode 101 of software Engineering Radio

• casiano@exthost:~$ env | grep -i perl
  MANPATH=:/soft/perl5lib/man/
  PERL5LIB=/soft/perl5lib/lib/perl5:/soft/perl5lib/lib/perl/5.10.0/:/soft/perl5lib/share/perl/5.10.0:/soft/perl5lib/share/perl/5.10/
  PATH=.:/home/casiano/bin:/opt/groovy/groovy-1.7.1//bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/soft/perl5lib/bin
  casiano@exthost:~$
  

Ejercicio 13.40.1   Haga un checkout del proyecto parse-eyapp en google-code. Utilize el método de la bisección con svn-bisect para averiguar en que versión del proyecto se introdujo la funcionalidad que comprueba el test t/73dynamicshiftreduceconflictresolution.t