comparisons
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 170
Bio::SAGE::Comparison 1.00
Bio::SAGE::Comparison module compares data from serial analysis of gene expression (SAGE) libraries. more>>
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.
<<lessSYNOPSIS
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.
Download (0.008MB)
Added: 2007-07-14 License: Perl Artistic License Price:
832 downloads
Ctcompare 2.2
Ctcompares project purpose is to allow you to compare several sets of C code trees on a token basis... more>>
Ctcompares project purpose is to allow you to compare several sets of C code trees on a token basis, rather than on a line by line basis. The programs help to identify similarities between snippets of code in both trees.
Enhancements:
- The comparison method has been completely rewritten.
- A database is now used to hold 16-token "tuples" as keys; the result attached to each key is the list of source files which have that tuple.
- Tuples with multiple files from different source trees indicate potential code similarity.
- These are then fully tested to find actual code similarity.
<<lessEnhancements:
- The comparison method has been completely rewritten.
- A database is now used to hold 16-token "tuples" as keys; the result attached to each key is the list of source files which have that tuple.
- Tuples with multiple files from different source trees indicate potential code similarity.
- These are then fully tested to find actual code similarity.
Download (0.035MB)
Added: 2007-06-09 License: GPL (GNU General Public License) Price:
867 downloads
Komparator 0.5
Komparator is an application that searches and synchronizes two directories. more>>
Komparator is an application that searches and synchronizes two directories. Komparator project discovers duplicate, newer or missing files and empty folders.
It works on local and some network / kioslave protocol folders (like smb:/ and media:/).
It is still in an early stage; please try on test directories first.
Main features:
- ftp et alii supported (might still be buggy!).
- Keyboard shortcuts (popup menus didnt work, unfortunately) fixed.
- Drag & drop missing / newer files from left to right side & vice versa.
- Special characters in URLs fixed.
- Cancel button isnt locked any more if md5-summing / binary comparing remote files.
- Status bar including progress of kompare and about / help button.
- Source code cleanups.
- GUI cleanups.
- Resize list view columns to original width.
- Binary comparison wont store the complete file in RAM any more.
- First documentation attempt.
Enhancements:
- Filters to display only specific files
- Regex that the file name may not contain
- In-/Exclude hidden items
- Some bug fixes
<<lessIt works on local and some network / kioslave protocol folders (like smb:/ and media:/).
It is still in an early stage; please try on test directories first.
Main features:
- ftp et alii supported (might still be buggy!).
- Keyboard shortcuts (popup menus didnt work, unfortunately) fixed.
- Drag & drop missing / newer files from left to right side & vice versa.
- Special characters in URLs fixed.
- Cancel button isnt locked any more if md5-summing / binary comparing remote files.
- Status bar including progress of kompare and about / help button.
- Source code cleanups.
- GUI cleanups.
- Resize list view columns to original width.
- Binary comparison wont store the complete file in RAM any more.
- First documentation attempt.
Enhancements:
- Filters to display only specific files
- Regex that the file name may not contain
- In-/Exclude hidden items
- Some bug fixes
Download (0.32MB)
Added: 2006-09-14 License: GPL (GNU General Public License) Price:
1137 downloads
DMAring 0.9
DMAring project is a novel generic network interface card driver architecture. more>>
DMAring project is a novel generic network interface card driver architecture which works in hybrid interrupt-polling mode to deliver superior real-time performance on Linux, Redhat Linux or Linux-RTAI-LXRT (a real-time co-kernel for Linux with user level extension).
Existing Linux drivers are inefficient, they saturate the CPU at a much lower packet rates than the maximum wire line packet rate that is possible. But with this driver, vanilla network cards can be used for high speed packet capturing. This driver improves the packet capturing speed by 7 to 10 times, and the real-time packet delivery response by 500 to 5000 times over existing drivers and alternate approaches (HIP, NAPI, pfring, check the references in the papers for performance comparisons [1, 2, 3]), depending on whether Redhat Linux or RTAI is used. Thus this obviates the need for expensive high capacity hardware, specialized network data acquisition cards and systems (for example from Endace).
This project contain basic source codes, which other developers can use/adapt for their applications, and three published conference papers [1, 2, 3] describes the architecture and establishes its benefits. One of the papers (at SANE 2006) also documents the detailed architecture and provides guidelines to modify any Linux network interface driver (Donald Becker style drivers).
Earlier I had received lot of mail request from networking, network security/monitoring domain people, to get these codes or modified specific network drivers. I am looking forward that some developer will take up this project, churn out driver modifications for the most common net work cards and share with others. I will continue to add other drivers, and libpcap library modifications when I get more time.
Anybody willing to know the issues involved in real-time Linux or looking for real-time networking solutions can take a look at my Masters thesis. I found RTAI with LXRT to be a very tractable, good performance, cheap (free!) real-time Linux option. My thesis contains some useful performance related discussions on this.
<<lessExisting Linux drivers are inefficient, they saturate the CPU at a much lower packet rates than the maximum wire line packet rate that is possible. But with this driver, vanilla network cards can be used for high speed packet capturing. This driver improves the packet capturing speed by 7 to 10 times, and the real-time packet delivery response by 500 to 5000 times over existing drivers and alternate approaches (HIP, NAPI, pfring, check the references in the papers for performance comparisons [1, 2, 3]), depending on whether Redhat Linux or RTAI is used. Thus this obviates the need for expensive high capacity hardware, specialized network data acquisition cards and systems (for example from Endace).
This project contain basic source codes, which other developers can use/adapt for their applications, and three published conference papers [1, 2, 3] describes the architecture and establishes its benefits. One of the papers (at SANE 2006) also documents the detailed architecture and provides guidelines to modify any Linux network interface driver (Donald Becker style drivers).
Earlier I had received lot of mail request from networking, network security/monitoring domain people, to get these codes or modified specific network drivers. I am looking forward that some developer will take up this project, churn out driver modifications for the most common net work cards and share with others. I will continue to add other drivers, and libpcap library modifications when I get more time.
Anybody willing to know the issues involved in real-time Linux or looking for real-time networking solutions can take a look at my Masters thesis. I found RTAI with LXRT to be a very tractable, good performance, cheap (free!) real-time Linux option. My thesis contains some useful performance related discussions on this.
Download (3.2MB)
Added: 2007-01-05 License: Perl Artistic License Price:
1023 downloads
Kernel Configuration Comparison 0.2
Kernel Configuration Comparison (kccmp) provides a GUI for comparing two Linux kernel .config files. more>>
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.
<<lessIt 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.
Download (0.012MB)
Added: 2005-10-03 License: GPL (GNU General Public License) Price:
1482 downloads
Debt Payment Comparison Calculator 1.18
Debt Payment Comparison Calculator is a free, flexible tool for your Web site that does more than just calculate monthly payment more>>
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!
<<lessIn 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!
Download (0.025MB)
Added: 2005-12-15 License: Freeware Price:
1410 downloads
Schema-compare 0.2
Schema-compare is a script that will compares two database schema and show the differences side-by-side. more>>
Schema-compare is a script that will compares two database schema and show the differences side-by-side.
Schema-compare can also generate SQL statements that will alter the old database to match the schema of the new database.
The comparisons are correct, but the SQL statements at the bottom are not quite right, they are close to what is necessary, but probably not exactly right.
To install simply ungzip/untar the file wherever you want to put it in your web folder and then edit the include/config.inc.php file with the information needed to connect to the two databases you want to compare. Both databases need to be on the same database server and use the same username and password to connect to them.
Enhancements:
- This is the first release of schema-compare. It compares the database schema just fine, but the sql alter statements it creates could use some work.
<<lessSchema-compare can also generate SQL statements that will alter the old database to match the schema of the new database.
The comparisons are correct, but the SQL statements at the bottom are not quite right, they are close to what is necessary, but probably not exactly right.
To install simply ungzip/untar the file wherever you want to put it in your web folder and then edit the include/config.inc.php file with the information needed to connect to the two databases you want to compare. Both databases need to be on the same database server and use the same username and password to connect to them.
Enhancements:
- This is the first release of schema-compare. It compares the database schema just fine, but the sql alter statements it creates could use some work.
Download (0.41MB)
Added: 2006-03-07 License: BSD License Price:
1329 downloads
XML-CompareML 0.2.0
XML::CompareML is a Perl module for managing multi-system and multi-item comparisons. more>>
The primary use of this module by its author was to manage the Better SCM comparison of version control systems.
The Perl versions can generate either HTML or DocBook/XML. (the latter can be converted into many other formats). Also available is an XSLT stylesheet for transforming the XML markup into HTML.
<<lessThe Perl versions can generate either HTML or DocBook/XML. (the latter can be converted into many other formats). Also available is an XSLT stylesheet for transforming the XML markup into HTML.
Download (0.017MB)
Added: 2007-03-20 License: Perl Artistic License Price:
948 downloads
Array::Compare 1.14
Array::Compare is a Perl extension for comparing arrays. more>>
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.
Download (0.008MB)
Added: 2007-08-15 License: Perl Artistic License Price:
800 downloads
CLSimilarImages 0.4.1
CLSimilarImages is a command-line utility for finding visually similar images which may not be identical. more>>
CLSimilarImages is a command-line utility for finding visually similar images which may not be identical. It reads filenames from standard input, and outputs customisable results to standard output.
It can write similarity data to files for rapid future comparisons, with timestamps for quick updates. The project can compare one collection of images with itself, or two collections with each other. It works well in scripts or with pipes.
<<lessIt can write similarity data to files for rapid future comparisons, with timestamps for quick updates. The project can compare one collection of images with itself, or two collections with each other. It works well in scripts or with pipes.
Download (0.13MB)
Added: 2007-03-24 License: GPL (GNU General Public License) Price:
945 downloads
Struct::Compare 1.0.1
Struct::Compare is a recursive diff for perl structures. more>>
Struct::Compare is a recursive diff for perl structures.
SYNOPSIS
use Struct::Compare;
my $is_different = compare($ref1, $ref2);
Compares two values of any type and structure and returns true if they are the same. It does a deep comparison of the structures, so a hash of a hash of a whatever will be compared correctly.
This is especially useful for writing unit tests for your modules!
PUBLIC FUNCTIONS
$bool = compare($var1, $var2)
Recursively compares $var1 to $var2, returning false if either structure is different than the other at any point. If both are undefined, it returns true as well, because that is considered equal.
<<lessSYNOPSIS
use Struct::Compare;
my $is_different = compare($ref1, $ref2);
Compares two values of any type and structure and returns true if they are the same. It does a deep comparison of the structures, so a hash of a hash of a whatever will be compared correctly.
This is especially useful for writing unit tests for your modules!
PUBLIC FUNCTIONS
$bool = compare($var1, $var2)
Recursively compares $var1 to $var2, returning false if either structure is different than the other at any point. If both are undefined, it returns true as well, because that is considered equal.
Download (0.003MB)
Added: 2007-02-12 License: Perl Artistic License Price:
984 downloads
CinePaint 0.22.1
CinePaint is painting and retouching software primarily used for motion picture. more>>
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.
<<lessCinePaint 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.
Download (11.5MB)
Added: 2007-06-12 License: GPL (GNU General Public License) Price:
1823 downloads
Benchmark::Forking 0.99
Benchmark::Forking is a Perl module to run benchmarks in separate processes. more>>
Benchmark::Forking is a Perl module to run benchmarks in separate processes.
SYNOPSIS
use Benchmark::Forking qw( timethis timethese cmpthese );
timethis ($count, "code");
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
Benchmark::Forking->enabled(0); # Stop using forking feature
...
Benchmark::Forking->enabled(1); # Begin using forking again
The Benchmark::Forking module changes the behavior of the standard Benchmark module, running each piece of code to be timed in a separate forked process. Because each child exits after running its timing loop, the computations it performs cant propogate back to affect subsequent test cases.
This can make benchmark comparisons more accurate, because the separate test cases are mostly isolated from side-effects caused by the others. Benchmark scripts typically dont depend on those side-effects, so in most cases you can simply use or require this module at the top of your existing code without having to change anything else. (A few key exceptions are noted in "BUGS".)
<<lessSYNOPSIS
use Benchmark::Forking qw( timethis timethese cmpthese );
timethis ($count, "code");
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
Benchmark::Forking->enabled(0); # Stop using forking feature
...
Benchmark::Forking->enabled(1); # Begin using forking again
The Benchmark::Forking module changes the behavior of the standard Benchmark module, running each piece of code to be timed in a separate forked process. Because each child exits after running its timing loop, the computations it performs cant propogate back to affect subsequent test cases.
This can make benchmark comparisons more accurate, because the separate test cases are mostly isolated from side-effects caused by the others. Benchmark scripts typically dont depend on those side-effects, so in most cases you can simply use or require this module at the top of your existing code without having to change anything else. (A few key exceptions are noted in "BUGS".)
Download (0.006MB)
Added: 2007-04-30 License: Perl Artistic License Price:
907 downloads
Cromfs 1.5.2
Cromfs is a compressed read-only filesystem for Linux. more>>
Cromfs is a compressed read-only filesystem for Linux. Cromfs is intended for permanently archiving gigabytes of big files that have a lot of redundancy. It is more aimed at heavy compression than at a light fingerprint.
Version restrictions:
- Filesystem is write-once, read-only. It is not possible to append to a previously-created filesystem, nor it is to mount it read-write.
- Max filesize: 2^64 bytes (16777216 TB), but 256 TB with default settings.
- Max number of files in a directory: 2^30 (smaller if filenames are longer, but still more than 100000 in almost all cases)
- Max number of inodes (all files, dirs etc combined): 2^60, but depends on file sizes
- Max filesystem size: 2^64 bytes (16777216 TB)
- There are no "." and ".." entries in directories.
- mkcromfs is slow. You must be patient.
- The cromfs-driver has a large memory footprint. It is not suitable for very size-constrained systems.
- Ownerships are not saved.
- Maximum filename length: 4095 bytes
Main features:
- Data, inodes, directories and block lists are stored compressed
- Duplicate inodes, files and even duplicate file portions are detected and stored only once
- Especially suitable for gigabyte-class archives of thousands of nearly-identical megabyte-class files.
- Files are stored in solid blocks, meaning that parts of different files are compressed together for effective compression
- Most of inode types recognized by Linux are supported (see comparisons).
- The LZMA compression is used. In the general case, LZMA compresses better than gzip and bzip2.
- As with usual filesystems, the files on a cromfs volume can be accessed in arbitrary order; the waits to open a specific file are small, despite the files being semisolidly archived.
<<lessVersion restrictions:
- Filesystem is write-once, read-only. It is not possible to append to a previously-created filesystem, nor it is to mount it read-write.
- Max filesize: 2^64 bytes (16777216 TB), but 256 TB with default settings.
- Max number of files in a directory: 2^30 (smaller if filenames are longer, but still more than 100000 in almost all cases)
- Max number of inodes (all files, dirs etc combined): 2^60, but depends on file sizes
- Max filesystem size: 2^64 bytes (16777216 TB)
- There are no "." and ".." entries in directories.
- mkcromfs is slow. You must be patient.
- The cromfs-driver has a large memory footprint. It is not suitable for very size-constrained systems.
- Ownerships are not saved.
- Maximum filename length: 4095 bytes
Main features:
- Data, inodes, directories and block lists are stored compressed
- Duplicate inodes, files and even duplicate file portions are detected and stored only once
- Especially suitable for gigabyte-class archives of thousands of nearly-identical megabyte-class files.
- Files are stored in solid blocks, meaning that parts of different files are compressed together for effective compression
- Most of inode types recognized by Linux are supported (see comparisons).
- The LZMA compression is used. In the general case, LZMA compresses better than gzip and bzip2.
- As with usual filesystems, the files on a cromfs volume can be accessed in arbitrary order; the waits to open a specific file are small, despite the files being semisolidly archived.
Download (0.080MB)
Added: 2007-08-20 License: GPL v3 Price:
796 downloads
Genezzo::Havok::SQLCompare 0.69
Genezzo::Havok::SQLCompare is a Perl module with SQL comparison functions. more>>
Genezzo::Havok::SQLCompare is a Perl module with SQL comparison functions.
SYNOPSIS
HavokUse("Genezzo::Havok::SQLCompare")
FUNCTIONS
SQL functions
IN
WHERE value IN (list)
Returns TRUE if the value is present in the list, else FALSE. NOT IN is slightly different: returns NULL if any list item is NULL, return FALSE if the value matches any list item, else returns TRUE.
LIKE
WHERE value LIKE (pattern)
WHERE value LIKE (pattern, escape_char)
Returns TRUE if the value matches the pattern. In the pattern, a % (percent sign) matches zero or more characters, and an _ (underscore) matches exactly one character. These characters can be matched as literals if they are preceded by the optional escape character.
LIMITATIONS
- IN has list support, but no IN subquery support.
- LIKE has a "functional" syntax, instead of the standard LIKE pattern [ESCAPE escape_char].
<<lessSYNOPSIS
HavokUse("Genezzo::Havok::SQLCompare")
FUNCTIONS
SQL functions
IN
WHERE value IN (list)
Returns TRUE if the value is present in the list, else FALSE. NOT IN is slightly different: returns NULL if any list item is NULL, return FALSE if the value matches any list item, else returns TRUE.
LIKE
WHERE value LIKE (pattern)
WHERE value LIKE (pattern, escape_char)
Returns TRUE if the value matches the pattern. In the pattern, a % (percent sign) matches zero or more characters, and an _ (underscore) matches exactly one character. These characters can be matched as literals if they are preceded by the optional escape character.
LIMITATIONS
- IN has list support, but no IN subquery support.
- LIKE has a "functional" syntax, instead of the standard LIKE pattern [ESCAPE escape_char].
Download (0.47MB)
Added: 2007-03-15 License: GPL (GNU General Public License) Price:
957 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above comparisons search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed