++ed by:
WOLLMERS BKB

2 PAUSE users
1 non-PAUSE user.

Helmut Wollmersdorfer
and 1 contributors

NAME

LCS::XS - Fast (XS) implementation of the Longest Common Subsequence (LCS) Algorithm

SYNOPSIS

  use LCS::XS;

  $alg = LCS::XS->new;
  @lcs = $alg->LCS(\@a,\@b);

DESCRIPTION

CONSTRUCTOR

new()

Creates a new object which maintains internal storage areas for the LCS computation. Use one of these per concurrent LCS() call.

METHODS

LCS(\@a,\@b)

Finds a Longest Common Subsequence, taking two arrayrefs as method arguments.

EXPORT

None by design.

SEE ALSO

Algorithm::Diff

AUTHOR

Helmut Wollmersdorfer <helmut.wollmersdorfer@gmail.com>

COPYRIGHT AND LICENSE

Copyright 2015 by Helmut Wollmersdorfer

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.