Algorithm::Loops - Looping constructs: NestedLoops, MapCar*, Filter, and NextPermute* River stage two • 10 direct dependents • 14 total dependents

TYEMQ/Algorithm-Loops-1.032 - 24 Jul 2016 03:23:01 GMT

Algorithm::Search - Module for traversing an object. River stage one • 1 direct dependent • 1 total dependent

AND DEFINITIONS A user provided traversable object starts in an initial position. The traversable object must have certain methods, such as 'move', described below. This is passed into the search method via the 'search_this' parameter. At any positio...

ARTHUR/Algorithm-Search-0.04 - 08 Dec 2014 04:23:55 GMT

Algorithm::Diff::Any - Perl module to find differences between files River stage one • 1 direct dependent • 1 total dependent

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 GMT

Algorithm::LatticePoints - Run code for each lattice points River stage one • 1 direct dependent • 1 total dependent

Lattice-point handling is a common chore. You do it for image processing, 3-d processing, and more. Usually you do it via nested for loops but it is boring and tedious. This module loops for you instead. METHODS new(\&coderef) Pass a coderef which pr...

DANKOGAI/Algorithm-LatticePoints-0.01 - 04 Feb 2007 05:49:28 GMT

Algorithm::Diff::Callback - Use callbacks on computed differences River stage one • 1 direct dependent • 1 total dependent

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 GMT

Algorithm::Evolutionary::Op::DeltaTerm - Termination condition for an algorithm; checks that the difference of the best to a target is less than a delta River stage one • 4 direct dependents • 5 total dependents

Termination condition for evolutionary algorithm loops; the "apply" method returns false when the first element in the array is as close to the target as the differente indicated....

JMERELO/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT

6 results (0.028 seconds)