Free binary patches software for linux

KickPIM is a panel applet for quickly editing and accessing the KDE addressbook or sending emails to your contacts. It shows also a list of upcoming birthdays and waiting emails of multiple email-accounts.

When I added support for photos in the contact list in Kopete, I did the same for KickPim.

Adding support in Kopete was easy because we have a component architecture for the contact list display (created by Richard Smith) that allows us to layout an item in any arbitrary style, including text, images, vboxes, hboxes and spacers. So then I ported this architecture to KickPim too.

KickPims author never replied my emails, and I didnt want to fork or something, so I made this patches available here. I hope to merge them back with the authors codebase in the future.

The new display code for contacts could look ugglier or have regresions, but they will be fixed as I get feedback or ideas for the styles. To activate the KABC Photos, look in the preferences.

The Exim DSN patch adds delivery status notification support to Exim 4.xx.

DSN Support for Exim. This patch allows Exim 4.xx to support the sending of email Delivery Status Notifications.

XV Jumbo Patches package contains a pair of aggregate patches against XV 3.10a, which was last released in December 1994. The first jumbo patch incorporates roughly two dozen bugfixes.

The second patch encompasses almost as many enhancements, including support for additional image formats like PNG, PhotoCD, and PDF; performance improvements; and new features such as mouse-wheel support, alpha blending against a background color, and improved dithering for 15/16-bit displays.

All patches available from the official XV site are included, as well as numerous other patches from around the world.

Tree::Binary is a Object Oriented Binary Tree for Perl.

SYNOPSIS

use Tree::Binary;

# a tree representaion of the expression:
# ((2 + 2) * (4 + 5))
my $btree = Tree::Binary->new("*")
->setLeft(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("2"))
->setRight(Tree::Binary->new("2"))
)
->setRight(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("4"))
->setRight(Tree::Binary->new("5"))
);
# Or shown visually:
# +---(*)---+
# | |
# +-(+)-+ +-(+)-+
# | | | |
# (2) (2) (4) (5)

# get a InOrder visitor
my $visitor = Tree::Binary::Visitor::InOrderTraversal->new();
$btree->accept($visitor);

# print the expression in infix order
print $visitor->getAccumulation(); # prints "2 + 2 * 4 + 5"

# get a PreOrder visitor
my $visitor = Tree::Binary::Visitor::PreOrderTraversal->new();
$btree->accept($visitor);

# print the expression in prefix order
print $visitor->getAccumulation(); # prints "* + 2 2 + 4 5"

# get a PostOrder visitor
my $visitor = Tree::Binary::Visitor::PostOrderTraversal->new();
$btree->accept($visitor);

# print the expression in postfix order
print $visitor->getAccumulation(); # prints "2 2 + 4 5 + *"

# get a Breadth First visitor
my $visitor = Tree::Binary::Visitor::BreadthFirstTraversal->new();
$btree->accept($visitor);

# print the expression in breadth first order
print $visitor->getAccumulation(); # prints "* + + 2 2 4 5"

# be sure to clean up all circular references
$btree->DESTROY();

This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an n-ary tree, like Tree::Simple, to fill most of your binary tree needs, a true binary tree object is just easier to mantain and use.

Binary Tree objects are especially useful (to me anyway) when building parse trees of things like mathematical or boolean expressions. They can also be used in games for such things as descisions trees. Binary trees are a well studied data structure and there is a wealth of information on the web about them.

This module uses exceptions and a minimal Design By Contract style. All method arguments are required unless specified in the documentation, if a required argument is not defined an exception will usually be thrown. Many arguments are also required to be of a specific type, for instance the $tree argument to both the setLeft and setRight methods, must be a Tree::Binary object or an object derived from Tree::Binary, otherwise an exception is thrown. This may seems harsh to some, but this allows me to have the confidence that my code works as I intend, and for you to enjoy the same level of confidence when using this module. Note however that this module does not use any Exception or Error module, the exceptions are just strings thrown with die.

This object uses a number of methods copied from another module of mine, Tree::Simple. Users of that module will find many similar methods and behaviors. However, it did not make sense for Tree::Binary to be derived from Tree::Simple, as there are a number of methods in Tree::Simple that just wouldnt make sense in Tree::Binary. So, while I normally do not approve of cut-and-paste code reuse, it was what made the most sense in this case.

Search::Binary is a Perl module for generic binary search.

SYNOPSIS

use Seach::Binary;
$pos = binary_search($min, $max, $val, $read, $handle, [$size]);

binary_search implements a generic binary search algorithm returning the position of the first record whose index value is greater than or equal to $val. The search routine does not define any of the terms position, record or index value, but leaves their interpretation and implementation to the user supplied function &$read(). The only restriction is that positions must be integer scalars.

During the search the read function will be called with three arguments: the input parameters $handle and $val, and a position. If the position is not undef, the read function should read the first whole record starting at or after the position; otherwise, the read function should read the record immediately following the last record it read. The search algorithm will guarantee that the first call to the read function will not be with a position of undef. The read function needs to return a two element array consisting of the result of comparing $val with the index value of the read record and the position of the read record. The comparison value must be positive if $val is strictly greater than the index value of the read record, 0 if equal, and negative if strictly less. Furthermore, the returned position value must be greater than or equal to the position the read function was called with.

The input parameters $min and $max are positions and represents the extent of the search. Only records which begin at positions within this range (inclusive) will be searched. Moreover, $min must be the starting position of a record. If present $size is a difference between positions and determines when the algorithms switches to a sequential search. $val is an index value. The value of $handle is of no consequence to the binary search algorithm; it is merely passed as a convenience to the read function.

Patch Maker helps you manage multiple in-progress source code patches to software. Patch Maker remembers which files are part of which patch, and keeps them disentangled during the development process.
It speeds up common operations and housekeeping tasks, allowing you to focus on writing code. It is a command-line tool written in Perl, and so is usable on (at least) Windows, Linux and Mac OS X.
Enhancements:
- Initial SVN support was added to go with CVS.
- The configuration was moved to the .pmrc file in the home directory.
- Message and error printing were tidied up and standardized.

qmail-usermap-patch project is a patch for qmail that allows external mail exchanges to check a user map before routing mail to a local delivery host.

This reduces server load by preventing spam to dictionary-generated addresses from going through the usual qmail process chain. The user map is sent to the external hosts securely using SSH.

KPowersave Icon Patch is intended for KPowersave 0.6.2

This patch changes the way of displaying power state for KPowersave. Using this patch you can better theme KPowersave, by using a series of pixmaps.

Installation instructions:

>>> Patch the sources

1. Copy the patch file in the parent folder of KPowersave sources.
2. Cd into KPowersave
3. issue: patch -Np1 -i ../kpowersave-icon.patch

>>> Compile the sources

>>> Copy the icons

After instalation, you wont get any icons for displaying battery state.
You have to copy them to your theme folder.
Copy the iconset in the THEME_FOLDER/22x22/actions/

You can use this theme for start:

http://www.kde-look.org/content/show.php?content=28287