Free comparison tools software for linux

Webmasters Tools is a set of free open-source tools to do the work of the webmaster,
under the OSS licence.

Programs included:

metagen Program to generate meta-tags for your web pages.
metarep Report meta-tags and links in web pages.
updater Copy a part of a web page to all others.
outline Build a tutorial from simple unformatted text files.
makelist Build a page made of the list of links from a directory.

Web tools are free software; you can redistribute the archive and/or modify the programs under the terms of the OSS licence.

Bio::SAGE::Comparison module compares data from serial analysis of gene expression (SAGE) libraries.

SYNOPSIS

use Bio::SAGE::Comparison;
$sage = Bio::SAGE::Comparison->new();

This module provides several tools for comparing data generated from serial analysis of gene expression (SAGE) libraries.

BACKGROUND

Serial analysis of gene expression (SAGE) is a molecular technique for generating a near-global snapshot of a cell population’s transcriptome. Briefly, the technique extracts short sequences at defined positions of transcribed mRNA. These short sequences are then paired to form ditags. The ditags are concatamerized to form long sequences that are then cloned. The cloned DNA is then sequenced. Bioinformatic techniques are then employed to determine the original short tag sequences, and to derive their progenitor mRNA. The number of times a particular tag is observed can be used to quantitate the amount of a particular transcript. The original technique was described by Velculescu et al. (1995) and utilized an ~14bp sequence tag. A modified protocol was introduced by Saha et al. (2002) that produced ~21bp tags.

PURPOSE

This module facilitates the comparison of SAGE libraries. Specifically:

1. Calculations for determining the statistical
significance of expression differences.
2. Dynamically convert longer-tag libraries to
a shorter type for comparison (e.g. comparing
a LongSAGE vs. a regular SAGE library).

Both regular SAGE (14mer tag) and LongSAGE (21mer tag) are supported by this module.

Statistical significance in library comparisons is calculated using the method described by Audic and Claverie (1997). Code was generated by directly porting the authors original C source.

Debt Payment Comparison Calculator project is a free, flexible tool for your Web site that does more than just calculate monthly payments.
In addition to what typical Web calculators do, which is grab the principle, interest rate, and the years to pay it off to generate your monthly payment, this calculator can tell you how long it would take you to pay off a debt if you increased or decreased the payment amount.
Each time the user uses the calculator, it saves the information so that the user can compare different payment scenarios. At any time, the user can clear the data and start over. They can also color-group different scenarios for easy visual reference.
Main features:
- Stores calculations in a session variable, so users can compare different payment scenarios, side by side without the use of a database.
- Ability to color-code the scenarios by clicking on them, making it easy to visually sort the results
- Works fine without Javascript enabled
- Simple code to work with, easy to adjust to specific needs
- Styles and scripts are already in external files, making the web page search engine ready out of the box!

Kernel Configuration Comparison (kccmp) provides a GUI for comparing two Linux kernel ".config" files.
It shows configuration variables with different values in a tabular format. It also shows configuration variables found in only one of the input configuration files.
Building:
kccmp by default requires Qt 3.x. However, by changing one line in kccmp.pro you can build against Qt 4.x. Note that the Qt 4.x build requilres libboost_regex as well.
The standard build is as easy as:
example:
% qmake
% make
Usage
% kccmp /path/to/first/.config path/to/second/.config
example:
% kccmp /usr/src/linux/.config /usr/src/linux/.config.old
Enhancements:
- This release was ported to Qt 3.x.
- The requirement for libboost_regex was removed.
- Building with either Qt 4.x or Qt 3.x is now supported.

SYNOPSIS

use Array::Compare;

my $comp1 = Array::Compare->new;
$comp->Sep(|);
$comp->Skip({3 => 1, 4 => 1});
$comp->WhiteSpace(0);
$comp->Case(1);

my $comp2 = Array::Compare->new(Sep => |,
WhiteSpace => 0,
Case => 1,
Skip => {3 => 1, 4 => 1});

my @arr1 = 0 .. 10;
my @arr2 = 0 .. 10;

$comp1->compare(@arr1, @arr2);
$comp2->compare(@arr1, @arr2);

If you have two arrays and you want to know if they are the same or different, then Array::Compare will be useful to you.
All comparisons are carried out via a comparator object. In the simplest usage, you can create and use a comparator object like this:

my @arr1 = 0 .. 10;
my @arr2 = 0 .. 10;

my $comp = Array::Compare->new;

if ($comp->compare(@arr1, @arr2)) {
print "Arrays are the samen";
} else {
print "Arrays are differentn";
}

Notice that you pass references to the two arrays to the comparison method.

Internally the comparator compares the two arrays by using join to turn both arrays into strings and comparing the strings using eq. In the joined strings, the elements of the original arrays are separated with the ^G character. This can cause problems if your array data contains ^G characters as it is possible that two different arrays can be converted to the same string.

To avoid this, it is possible to override the default separator character, either by passing and alternative to the new function

my $comp = Array::Compare->new(Sep => |);

or by changing the seperator for an existing comparator object

$comp->Sep(|);

In general you should choose a separator character that wont appear in your data.

You can also control whether or not whitespace within the elements of the arrays should be considered significant when making the comparison. The default is that all whitespace is significant. The alternative is for all consecutive white space characters to be converted to a single space for the pruposes of the comparison. Again, this can be turned on when creating a comparator object:

my $comp = Array::Compare->new(WhiteSpace => 0);

or by altering an existing object:

$comp->WhiteSpace(0);

You can also control whether or not the case of the data is significant in the comparison. The default is that the case of data is taken into account. This can be changed in the standard ways when creating a new comparator object:

my $comp = Array::Compare->new(Case => 0);

or by altering an existing object:

$comp->Case(0);

In addition to the simple comparison described above (which returns true if the arrays are the same and false if theyre different) there is also a full comparison which returns a list containing the indexes of elements which differ between the two arrays. If the arrays are the same it returns an empty list. In scalar context the full comparison returns the length of this list (i.e. the number of elements that differ). You can access the full comparision in two ways. Firstly, there is a DefFull attribute. If this is true then a full comparison if carried out whenever the compare method is called.

my $comp = Array::Compare->new(DefFull => 1);
$comp->compare(@arr1, @arr2); # Full comparison

$comp->DefFull(0);
$comp->compare(@arr1, @arr2); # Simple comparison

$comp->DefFull(1);
$comp->compare(@arr1, @arr2); # Full comparison again

Secondly, you can access the full comparison method directly

$comp->full_compare(@arr1, @arr2);

For symmetry, there is also a direct method to use to call the simple comparison.

$comp->simple_compare(@arr1, @arr2);

The final complication is the ability to skip elements in the comparison. If you know that two arrays will always differ in a particular element but want to compare the arrays ignoring this element, you can do it with Array::Compare without taking array slices. To do this, a comparator object has an optional attribute called Skip which is a reference to a hash. The keys in this hash are the indexes of the array elements and the values should be any true value for elements that should be skipped.

For example, if you want to compare two arrays, ignoring the values in elements two and four, you can do something like this:

my %skip = (2 => 1, 4 => 1);
my @a = (0, 1, 2, 3, 4, 5);
my @b = (0, 1, X, 3, X, 5);

my $comp = Array::Compare->new(Skip => %skip);

$comp->compare(@a, @b);

This should return true, as we are explicitly ignoring the columns which differ.

Of course, having created a comparator object with no skip hash, it is possible to add one later:

$comp->Skip({1 => 1, 2 => 1});

or:

my %skip = (1 => 1, 2 => 2);
$comp->Skip(%skip);

To reset the comparator so that no longer skips elements, set the skip hash to an empty hash.

$comp->Skip({});

You can also check to see if one array is a permutation of another, i.e. they contain the same elements but in a different order.

if ($comp->perm(@a, @b) {
print "Arrays are permsn";
else {
print "Nope. Arrays are completely differentn";
}

In this case the values of WhiteSpace and Case are still used, but Skip is ignored for, hopefully, obvious reasons.

CinePaint is painting and retouching software primarily used for motion picture frame-by-frame retouching and dust-busting. CinePaint has been used on many feature films, including THE LAST SAMURAI where it was used to add flying arrows.

CinePaint is different from other painting tools because it supports deep color depth image formats up to 32-bit per channel deep. For comparison, GIMP is limited to 8-bit, and Photoshop to 16-bit.

CinePaint is free open source software. The generosity and commitment of its developers, users and sponsors make CinePaint possible.

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old ( $callback,
DISCARD_A => $callback,
DISCARD_B => $callback,
},
$comparison_function );

COMPARISON FUNCTIONS

Each of the main routines should be passed a comparison function. If you arent passing one in, use Algorithm::Diff instead.

These functions should return a true value when two items should compare as equal.

For instance,

@lcs = LCS( @seq1, @seq2, sub { my ($a, $b) = @_; $a eq $b } );

but if that is all youre doing with your comparison function, just use Algorithm::Diff and let it do this (this is its default).

Or:

sub someFunkyComparisonFunction
{
my ($a, $b) = @_;
$a =~ m{$b};
}

@diffs = diff( @lines, @patterns, &someFunkyComparisonFunction );

which would allow you to diff an array @lines which consists of text lines with an array @patterns which consists of regular expressions.

This is actually the reason I wrote this version -- there is no way to do this with a key generation function as in the stock Algorithm::Diff.