Algorithm-Merge
view release on metacpan or search on metacpan
one, two, or three arguments.
If one argument, then only the element at the given position from
the first sequence is not in either of the other two sequences.
If two arguments, then there is no element in the first sequence
that corresponds to the elements at the given positions in the
second and third sequences.
If three arguments, then the element at the given position in the
first sequence is different than the corresponding element in the
other two sequences, but the other two sequences have corresponding
elements.
B_DIFF
This is called if the second sequence is different than the other
two sequences at the current position. This callback will be called
with one, two, or three arguments.
If one argument, then only the element at the given position from
the second sequence is not in either of the other two sequences.
If two arguments, then there is no element in the second sequence
that corresponds to the elements at the given positions in the first
and third sequences.
If three arguments, then the element at the given position in the
second sequence is different than the corresponding element in the
other two sequences, but the other two sequences have corresponding
elements.
C_DIFF
This is called if the third sequence is different than the other two
sequences at the current position. This callback will be called with
one, two, or three arguments.
If one argument, then only the element at the given position from
the third sequence is not in either of the other two sequences.
If two arguments, then there is no element in the third sequence
that corresponds to the elements at the given positions in the first
and second sequences.
If three arguments, then the element at the given position in the
third sequence is different than the corresponding element in the
other two sequences, but the other two sequences have corresponding
elements.
CONFLICT
This is called if all three sequences have different elements at the
current position. The three arguments are the current positions
within each sequence.
BUGS
Most assuredly there are bugs. If a pattern similar to the above example
does not work, send it to <jsmith@cpan.org> or report it on
<http://rt.cpan.org/>, the CPAN bug tracker.
Algorithm::Diff's implementation of "traverse_sequences" may not be
symmetric with respect to the input sequences if the second and third
sequence are of different lengths. Because of this,
"traverse_sequences3" will calculate the diffs of the second and third
sequences as passed and swapped. If the differences are not the same, it
will issue an `Algorithm::Diff::diff is not symmetric for second and
third sequences...' warning. It will try to handle this, but there may
be some cases where it can't.
SEE ALSO
Algorithm::Diff.
AUTHOR
James G. Smith, <jsmith@cpan.org>
COPYRIGHT
Copyright (C) 2003, 2007 Texas A&M University. All Rights Reserved.
This module is free software; you may redistribute it and/or modify it
under the same terms as Perl itself.
( run in 1.187 second using v1.01-cache-2.11-cpan-140bd7fdf52 )