Free delta software for linux

EDelta is a fast XDelta-style binary differ, but optimized for executables which have a very systematic way of changing between versions. EDelta has not been thoroughly evaluated so far, but on one example (two versions of Vim) it produces a 30kB delta where XDelta needs 250kB.
My personal use for edelta is to quickly deploy Linux kernels from my development-laptop to my test-machines, especially when working over my slow ADSL line at home. I frequently see factor of 100 speedups compared to shipping the whole file.
Whats New in 0.9e Stable Release:
- This release adds a -q switch, better arguments parsing, and an improved version of the epatch script for remote patching using SSH.
Whats New in 0.10a Development Release:
- This version adds the -le switch, which provides better compression on Intel and other little-endian platforms.
- It also fixes a few bugs.

Pstdelta project has been created in order to vastly reduce the size of differential backups of .pst files.
Administrators of Windows networks running Outlook will often find their networks clogged with Outlook pst files. These files are often around 1GB in size.
Since these files change every day the nightly backup will have to save them every day. This means that space has to be made for 1GB per user per day.
Pstdelta can be used to store the differences between an old and new version of a pst file. It can then generate the new file using just the old file and the output generated by pstdelta.
NOTE: this program has been stable for me for a while. However, running verify after making a delta file is probably a good idea.
Enhancements:
- This release fixes a bug that caused verification failure in specific situations.
- It adds a nightly script to help facilitate the use of pstdelta in differential backups.

RPM Delta Compression Virtual Update Repository is an experiment to explore the possibility of significantly reducing the bandwidth required to apply updates to a Fedora installation.
This software includes a server which provides a virtual update repository to clients such as yum, up2date, or other update tools. RPM Delta Compression Virtual Update Repository also includes a utility to create and maintain a RPM delta repository.
The server will attempt to generate the update RPM from a small delta file applied to a locally stored RPM from the original distribution.
Enhancements:
- This version utilizes the SuSE deltarpm tool as the underlying delta generator.
- It features both HTTP virtual update of the RPM repository (using Tomcat servlet container) and command line tools for generating update RPMs from a delta repository.

RakNet project is a reliable UDP networking API.
RakNet is a networking API that is a wrapper for reliable UDP and higher level functionality on Windows, Linux, and Unix.
It allows any application to communicate with other applications on the same computer, over a LAN, or over the internet.
Although it could be used for any networked application, it was developed specifically for rapid development of online games and the addition of multiplayer to single player games.
Main features:
- Secure connections
- With one line of code Raknet will automatically use SHA1, AES128, SYN Cookies, and RSA to prevent connection spoofing, replay attacks, data eavesdropping, packet tampering, and MitM attacks. Overhead averages 12 bytes per datagram.
- Voice communication
- Using Speex for encoding / decoding, 16 bit audio can be transmitted using approximately 1000 bytes per second.
- Remote terminal
- Using either Telnet or secure RakNet, you can remotely administrate your applications. The system has built-in commands for most RakNet functions and is designed for users to extend for their own purposes. Example capabilities include application resets, password management, and logging.
- Application directory server
- The application directory server allows servers to list themselves for clients to find and connect to. The system uses a key / value system. Listing your server and posting new rules are both done with a single line of code.
- Autopatcher
- Update your users with database driven binary delta patches, or use a simpler version for updates such as user skins or maps.
- Object replication system
- RakNets object and memory replication system provides a framework from which you can synchronize your program state. It requires no changes to your program architecture and there is no unneeded overhead. Memory is replicated through a single function call, with support for callbacks for serialization of complex types such as pointers.
- Network traffic compression
- The BitStream class allows compressed writes of vectors, matrices, quaternions, and real numbers between -1 and 1. It also supports delta compression, by which unchanged values only use a single bit.
- Remote function calls
- While you can send and interpret your own bit streams, remote function calls make this process easier as you now deal with functions rather than raw data. Remote function calls only take 1-2 bytes of overhead and allow both static C function calls and class member function calls. Return values are also supported.
- Routing and multicasting
- RakNet supports automatically updated connection graphs, which are used for routing and multicasting via a minimum spanning tree. You could, for example, use RakNet for highly efficient distributed peer-to-peer file sharing. Simpler applications include directed messages between clients and efficient broadcasts.
- Robust communication layer
- Flow control, message ordering on different channels, message coalescence, and splitting and reassembly of packets larger than the MTU are transparently handled for you.

List::Search is a Perl module for fast searching of sorted lists.

SYNOPSIS

use List::Search qw( list_search nlist_search custom_list_search );

# Create a list to search
my @list = sort qw( bravo charlie delta );

# Search for a value, returns the index of first match
print list_search( alpha, @list ); # 0
print list_search( charlie, @list ); # 1
print list_search( zebra, @list ); # -1

# Search numerically
my @numbers = sort { $a $b } ( 10, 20, 100, 200, );
print nlist_search( 20, @numbers ); # 2

# Search using some other comparison
my $cmp_code = sub { lc( $_[0] ) cmp lc( $_[1] ) };
my @custom_list = sort { $cmp_code->( $a, $b ) } qw( FOO bar BAZ bundy );
print list_search_generic( $cmp_code, foo, @custom_list );

This module lets you quickly search a sorted list. It will return the index of the first entry that matches, or if there is no exact matches then the first entry that is greater than the search key.

For example in the list my @list = qw( bob dave fred ); searching for dave will return 1 as $list[1] eq dave. Searching for charles will also return 1 as dave is the first entry that is greater than charles.

If there are none of the entries match then -1 is returned. You can either check for this or use it as an index to get the last values in the list. Whichever approach you choose will depend on what you are trying to do.

The actual searching is done using a binary search which is very fast.

List::Compare is a Perl module to compare elements of two or more lists.

SYNOPSIS

The bare essentials:

@Llist = qw(abel abel baker camera delta edward fargo golfer);
@Rlist = qw(baker camera delta delta edward fargo golfer hilton);

$lc = List::Compare->new(@Llist, @Rlist);

@intersection = $lc->get_intersection;
@union = $lc->get_union;

General Comments

List::Compare is an object-oriented implementation of very common Perl code (see "History, References and Development" below) used to determine interesting relationships between two or more lists at a time. A List::Compare object is created and automatically computes the values needed to supply List::Compare methods with appropriate results. In the current implementation List::Compare methods will return new lists containing the items found in any designated list alone (unique), any list other than a designated list (complement), the intersection and union of all lists and so forth. List::Compare also has (a) methods to return Boolean values indicating whether one list is a subset of another and whether any two lists are equivalent to each other (b) methods to pretty-print very simple charts displaying the subset and equivalence relationships among lists.

Except for List::Compares get_bag() method, multiple instances of an element in a given list count only once with respect to computing the intersection, union, etc. of the two lists. In particular, List::Compare considers two lists as equivalent if each element of the first list can be found in the second list and vice versa. Equivalence in this usage takes no note of the frequency with which elements occur in either list or their order within the lists. List::Compare asks the question: Did I see this item in this list at all? Only when you use List::Compare::get_bag() to compute a bag holding the two lists do you ask the question: How many times did this item occur in this list?

pytimeago is a human-oriented representation of time deltas, a Python library.

First, I shall define what time delta is. Since Δ generally means “difference”, we take time delta to stand for difference between two events in time. Quite common, however, is to have the current time for the second event. In pytimeago we deal with time deltas from such a perspective.

Quite possibly, you can make use of this library if your application displays some dynamically generated items to the user, and you are looking for a good way to present information on how long ago specific item was created/processed/whatever.

Below is small code snippet demonstrating how simple it is to embed pytimeago:

from pytimeago.english import english
from time import time, sleep

message = queue.getNextMessage()
delta = time() - message.arrived_time
print "Message arrived %s" % english(delta)

Prints, e.g.
Message arrived 15mins ago

As you see, pytimeago is package, and has individual modules for every language supported. As of 2006-08-13 the only supported language is English. However, you can take a look at rather trivial implementation of English engine, write one for your language, and send it to to me (email at the bottom of page).

Every language should come with a set of doctests (I prefer them to casual unit tests), just like the English version does. Dont be too verbose, but check essential cases.