Hash Algorithm Md5

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,...

Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my $string= Filter...

Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my $changed_ary =...


Platforms: *nix

Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing...


Platforms: *nix

Hash::NoVivify is a Perl extension for non-vivifying exists and defined functions. SYNOPSIS use Hash::NoVivify qw(Defined Exists); ... if (Exists(%hash, qw(key1 key2 ... keyn ))) { ... } if (Defined(%hash, qw(key1 key2 ... keyn))) { ... } When used on a hash, the exists() and...


Platforms: *nix

Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...


Platforms: *nix

Digest::Perl::MD4 is a Perl implementation of Ron Rivests MD4 Algorithm. This is not C-code interface (like Digest::MD5) but a Perl-only implementation of MD4 (like Digest::Perl::MD5). Because of this, it is slow but avoids platform specific complications. For efficiency you should use...


Platforms: *nix

Set::Hash is a Perl module with hashes as objects with lots of handy methods (including set comparisons) and support for method chaining. SYNOPSIS use Set::Hash; my $sh1 = Set::Hash->new(name=>"dan",age=>33); my $sh2 = Set::Hash->new(qw/weight 185 height 72/); $sh1->length->print; # 2...


Platforms: *nix

Genetic Algorithm File Fitter, or just GAFFitter, is a command-line software written in C++ that arranges--via a genetic algorithm--an input list of items or files/directories into volumes of a certain capacity (target), such as CD or DVD, in a way that the total wastage is minimized. By smartly...


Platforms: *nix

EVP dirdiff recursively compares two directory trees using message digest (hash), e.g. MD5.. Get EVP dirdiff at SourceForge.net. Fast, secure and free downloads from the largest Open Source applications and software directory. Recursively compare two directory trees using message digest (hash)....


Platforms: *nix

Algorithm::Permute is a Perl module with handy and fast permutation with object oriented interface. SYNOPSIS use Algorithm::Permute; my $p = new Algorithm::Permute([a..d]); while (@res = $p->next) { print join(", ", @res), "n"; } my @array = (1..9); Algorithm::Permute::permute { print...


Platforms: *nix

Tie::Hash::RegexKeys will match hash keys using Regular Expressions. SYNOPSIS use Tie::Hash::RegexKeys; use Data::Dumper; my %h; tie %h, Tie::Hash::RegexKeys; my $a = .1.2.3.4.5.6.2; my $b = .1.2.3.4.5.7; my $c = .1.2.3.4.5.6.1; my $d = .1.2.3.4.5.6.1.6; $h{$a}="key1";...


Platforms: *nix

Algorithm::SISort is a Perl module that contains select and insert sorting algorithm. SYNOPSIS use Algorithm::SISort qw(Sort Sort_inplace); @sorted_list = Sort {$_[0] <=> $_[1]} @unsorted_list; # ... or ... $number_of_comparisons = Sort_inplace {$_[0] <=> $_[1]} @unsorted_list; This...


Platforms: *nix

Algorithm::Merge is a Perl module package that provides three-way merge and diff. SYNOPSIS use Algorithm::Merge qw(merge diff3 traverse_sequences3); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } }); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } },...


Platforms: *nix

Algorithm::Huffman is a Perl extension that implements the Huffman algorithm. SYNOPSIS use Algorithm::Huffman; my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z); # or better the real counting for your characters # as the huffman algorithm doesnt work good with random data...


Platforms: *nix

Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project...


Platforms: *nix

Basset::Container::Hash Perl module implements a layered hash. The easiest way to explain is with an example: my %x = (a => b); tie my %y, Basset::Container::Hash, %x; #<- %x is the parent of y. print $x{a}; #prints b print $y{a}; #prints b (inherited from x) $y{a} = foo; $y{z} = bar;...


Platforms: *nix

Algorithm::Networksort can create inline comparisons for sorting. SYNOPSIS use Algorithm::Networksort qw(:all); my $inputs = 4; # # Generate the network (a list of comparators). # my @network = nw_comparators($inputs); # # Print the list, and print the graph of the list. # print...


Platforms: *nix

Tie::Hash::Sorted Perl module presents hashes in sorted order. SYNOPSIS use Tie::Hash::Sorted; my %ages = ( John => 33, Jacob => 29, Jingle => 15, Heimer => 48, Smitz => 12, ); my $sort_by_numeric_value = sub { my $hash = shift; [ sort {$hash->{$b} <=> $hash->{$a}} keys %$hash ];...


Platforms: *nix

Hash::Type module contains pseudo-hashes as arrays tied to a "type" (list of fields). SYNOPSIS use Hash::Type; # create a Hash::Type my $personType = new Hash::Type(qw(firstname lastname city)); # create and populate some hashes tied to $personType tie %wolfgang, $personType, "wolfgang...


Platforms: *nix