Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Yet another Algorithm::Diff question

by mdillon (Priest)
on Dec 05, 2000 at 22:23 UTC ( #45046=note: print w/ replies, xml ) Need Help??


in reply to Yet another Algorithm::Diff question

here it is again in forward order, with deletions and additions processed in a single pass:

#!/usr/bin/perl -w use Data::Dumper; use Algorithm::Diff qw(diff); use strict; use subs qw(patch); ## ## sub patch { my @orig = @{shift()}; my $diff = shift; my $shift = 0; for my $hunk (@$diff) { for my $change (@$hunk) { if ($change->[0] eq "-") { # process deletions splice @orig, $change->[1] + $shift, 1; --$shift; } elsif ($change->[0] eq "+") { # process additions splice @orig, $change->[1], 0, $change->[2]; ++$shift; } } } @orig; } ## ## my @orig = qw(a b c e h j l m n p); my @rev = qw(b c d e f j k l m r s t); my $diff = diff \@orig, \@rev; my @patched = patch \@orig, $diff; print "Original:\t@orig", $/; print "Revision:\t@rev", $/; print "Patched:\t@patched", $/;


Comment on Re: Yet another Algorithm::Diff question
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://45046]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (10)
As of 2014-07-25 14:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (172 votes), past polls