Search results for "module:Algorithm::Diff"
Algorithm::Diff - Compute `intelligent' differences between two files / lists
RJBS/Algorithm-Diff-1.201
-
13 Dec 2020 22:34:02 UTC
Bencher::Scenario::Algorithm::Diff::Diff - Benchmark Algorithm::Diff's diff(), sdiff(), compact_diff(), LCS(), LCSidx(), LCS_length()
Packaging a benchmark script as a Bencher scenario makes it convenient to include/exclude/add participants/datasets (either via CLI or Perl code), send the result to a central repository, among others . See Bencher and bencher (CLI) for more details....
PERLANCAR/Bencher-Scenarios-Algorithm-Diff-0.002 - 07 May 2023 00:05:41 UTC
Algorithm::Diff::XS - Algorithm::Diff with XS core loop
This module is a simple re-packaging of Joe Schaefer's excellent but not very well-known Algorithm::LCS with a drop-in interface that simply re-uses the installed version of the Algorithm::Diff module. Note that only the "LCSidx" function is optimize...
AUDREYT/Algorithm-Diff-XS-0.04 - 24 Oct 2008 09:58:12 UTC
Algorithm::Diff::Any - Perl module to find differences between files
This is a simple module to select the best available implementation of the standard "diff" algorithm, which works by effectively trying to solve the Longest Common Subsequence (LCS) problem. This algorithm is described in: *A Fast Algorithm for Compu...
JAWNSY/Algorithm-Diff-Any-1.001 - 23 Dec 2009 00:34:12 UTC
Algorithm::Diff::JSON - find the differences between two lists and report on them in JSON
DCANTRELL/Algorithm-Diff-JSON-1.000
-
06 Nov 2020 21:56:32 UTC
Algorithm::Diff::Callback - Use callbacks on computed differences
One of the difficulties when using diff modules is that they assume they know what you want the information for. Some give you formatted output, some give you just the values that changes (but neglect to mention how each changed) and some (such as Al...
XSAWYERX/Algorithm-Diff-Callback-0.111 - 14 Oct 2016 21:52:17 UTC
Algorithm::Diff::HTMLTable - Show differences of a file as a HTML table
RENEEB/Algorithm-Diff-HTMLTable-0.05
-
17 Dec 2018 14:36:54 UTC
Bencher::Scenarios::Algorithm::Diff - Scenarios to benchmark Algorithm::Diff
This distribution contains the following Bencher scenario modules: * Bencher::Scenario::Algorithm::Diff::Diff * Bencher::Scenario::Algorithm::Diff::Startup...
PERLANCAR/Bencher-Scenarios-Algorithm-Diff-0.002 - 07 May 2023 00:05:41 UTC
Bencher::Scenario::Algorithm::Diff::Startup - Benchmark startup of Algorithm::Diff
Packaging a benchmark script as a Bencher scenario makes it convenient to include/exclude/add participants/datasets (either via CLI or Perl code), send the result to a central repository, among others . See Bencher and bencher (CLI) for more details....
PERLANCAR/Bencher-Scenarios-Algorithm-Diff-0.002 - 07 May 2023 00:05:41 UTC
Algorithm::GDiffDelta - generate and apply GDIFF format binary deltas
This module can be used to generate binary deltas describing the differences between two files. Given the first file and the delta the second file can be reconstructed. A delta is equivalent to the output of the unix "diff" program, except that it ca...
GEOFFR/Algorithm-GDiffDelta-0.01 - 19 Sep 2004 02:54:30 UTC
Algorithm::Evolutionary::Op::Quad_Crossover_Diff - Uniform crossover, but interchanges only those atoms that are different
Crossover operator for a GA, takes args by reference and issues two children from two parents...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Uniform_Crossover_Diff - Uniform crossover, but interchanges only those atoms that are different
Crossover operator for a GA acting only on those bits that are different....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::LCSS - Perl extension for getting the Longest Common Sub-Sequence
This module uses Algoritm::Diff to implement LCSS and is orders of magnitude faster than String::LCSS. If you pass the methods array refs you get back array (ref) format data. If you pass strings you get a string or a ref to an array of strings....
JFREEMAN/Algorithm-LCSS-0.01 - 31 Dec 2003 03:15:44 UTC
Algorithm::Annotate - represent a series of changes in annotate form
Algorithm::Annotate generates a list that is useful for generating output simliar to "cvs annotate"....
CLKAO/Algorithm-Annotate-0.10 - 25 Sep 2003 18:19:06 UTC
Algorithm::LCS::XS - Fast (XS) implementation of the Longest Common Subsequence (LCS) Algorithm
CONSTRUCTOR new() Creates a new object which maintains internal storage areas for the LCS computation. Use one of these per concurrent LCS() call. METHODS line_map(@lines) Send @lines to a hashref containing elements of the form @lines entry => [(inc...
JOESUF/Algorithm-LCS-XS-v2.0.2 - 19 Sep 2022 19:31:58 UTC
Algorithm::HowSimilar - Perl extension for quantifying similarites between things
This module leverages Algorithm::Diff to let you compare the degree of sameness of array or strings. It returns a result set that defines exactly how similar these things are....
JFREEMAN/Algorithm-HowSimilar-0.01 - 31 Dec 2003 02:56:11 UTC
Algorithm::NeedlemanWunsch - sequence alignment with configurable scoring
Sequence alignment is a way to find commonalities in two (or more) similar sequences or strings of some items or characters. Standard motivating example is the comparison of DNA sequences and their functional and evolutionary similarities and differe...
VBAR/Algorithm-NeedlemanWunsch-0.04 - 07 Sep 2013 07:35:42 UTC