PipeX / News: Recent posts

PipeX project's goal is to provide developers with set of flexible stream pipes which can combine in different order to achieve desirable output (i.e. compress/uncompress, encrypt/decrypt and etc.) on fly.

Today, I have wrote a short tutorial to demonstrate how to perform code obfuscation using pipeX library: http://sourceforge.net/docman/display_doc.php?docid=41802&group_id=180345.

As new release is about to come, I have discovered an defect in BWT pipe. I hope it will be fix in 0.4 release...
I have already uploaded the sources to CVS, so feel free to download or wait couple of days until package will be created (I have to work for my living...).
So, what to expect in 0.4:
- Heads: Allow to start piping (read) from different sources like file, string, HTTP, Sockets,etc.
- Tails: Exactly the oposite of "Head"s. They are allow to write from last pipe to different destinations like files, string, HTTP, Sockets, etc.

New PipeX release!
So, we have 2 new categories of pipes:
- Manipulation: allows to manipulate data of fly (to upper case, to lower case, etc.) without storing it in temporary variables/buffers.
- Security: filter out/replace malicious input.

Do anyone want to help me work on web site?
If you are the man (or woman), send me a buzz to john_markh@users.sourceforge.net.

We are not dead, we are just on vacation...
By the end of November, we will do another major release which will include:
1. String manipulation pipes
2. Security filtering pipes
State tuned...

New release (0.2) of pipeX project. This time LZW pipe been added to the library which allow to compress/decompress the stream (on fly) using LZW algorithm.
Also, you will find a demo program which demonstrate how to construct and connect the pipes.

The first pipe is ready to go.
BWT (Burrows-Wheeler Transformation / Block Sorting) sorting operation brings together rotations with the same initial characters.
Since the initial characters of the rotations are adjacent to the final characters,
consecutive characters in L are adjacent to similar strings in S. If the context of a
character is a good predictor for the character, L will be easy to compress with a
simple locally-adaptive compression algorithm.