On Fri, Jun 12, 2015 at 11:52 AM, Luis R. Rodriguez
mcg...@do-not-panic.com wrote:
OK wells I'm curious about more research / effort when trying to
evaluate a diff with two seprate but adjoining preprocessor directives
and if anyone has implemented an optimizaiton option to let the diff
On Thu, Jul 16, 2015 at 9:22 PM, Jacob Keller jacob.kel...@gmail.com wrote:
On Thu, Jul 16, 2015 at 12:07 PM, Luis R. Rodriguez
mcg...@do-not-panic.com wrote:
On Fri, Jun 12, 2015 at 11:52 AM, Luis R. Rodriguez
mcg...@do-not-panic.com wrote:
OK wells I'm curious about more research / effort
On Thu, Jul 16, 2015 at 12:07 PM, Luis R. Rodriguez
mcg...@do-not-panic.com wrote:
On Fri, Jun 12, 2015 at 11:52 AM, Luis R. Rodriguez
mcg...@do-not-panic.com wrote:
OK wells I'm curious about more research / effort when trying to
evaluate a diff with two seprate but adjoining preprocessor
On Tue, Jun 9, 2015 at 1:25 AM, Johannes Schindelin
johannes.schinde...@gmx.de wrote:
Hi Luis,
On 2015-06-08 20:34, Luis R. Rodriguez wrote:
Based on a cursory review of the git code I get the impression that
GNU diff and git 'diff' do not share any code for the possible diff
algorithms.
Hi Luis,
On 2015-06-08 20:34, Luis R. Rodriguez wrote:
Based on a cursory review of the git code I get the impression that
GNU diff and git 'diff' do not share any code for the possible diff
algorithms.
Indeed, Git's diff machinery is based[*1*] ofn libxdiff[*2*], not on GNU diff.
I'm in
Based on a cursory review of the git code I get the impression that
GNU diff and git 'diff' do not share any code for the possible diff
algorithms. I'm in particularly curious more about the default myers
algorithm. I can take time to do a precise code review of the
algorithms used on both GNU
6 matches
Mail list logo
