Free red and orange software for linux

Murrina Orange 0.3 is yet another great addition for Gnome users. It is actually a Murrine based theme using the Xubuntu colors, you'd better have it!

Enhancements:

• Theme was updated for new version of MurrineEngine 0.30

Red Carpet is a software management tool for RPM-based Linux distros.

Red Carpet is a suite of applications that allows easy installation and update of software on Linux systems. Red Carpet project features both command-line and graphical GNOME interfaces.

These days Red Carpet is part of the Novell ZenWorks solution.

Help Hannahs Horse is a fun and fast pacman / fastfood type game in SDL.

Help Hannahs Horse is a simple combi-clone of pacman and the Dizzy game Fastfood. The aim is to guide Hannah around the maze collecting the carrots (which move!) and the pills.

Collect a powerpill (blue and red) to enable Hannah to eat the ghosts for a short while.

Some mazes have gates that only Hannah or only the Ghosts can pass. Some need Hannah to collect the red key to open them.

Help Hannahs Horse project is licensed under the GPL (VERSION 2)

Red-Piranha is an open source search system that can actually learn what you are looking for. It lets you go everywhere , find anything , understand everything.
Because it is open source , it can integrate with any system. Because you can use it as a web page , command line or XML- WebService , it will work with most languages , including Java , Perl , C#/.Net and PHP. As a Java based program , it will run on any platform including Windows , Linux / Unix and Mac.
Main features:
- Personal Search Engine for your Desktop (Windows , Linux and Mac).
- Intranet Search Engine - Search your Company or College Intranet.
- Part of your Development Project - Have search abilities up and running in a few minutes.
- To provide Search facilities on your website.
- As a P2P search engine.
- In conjunction with a wiki, as a knowledge / document management solution.
- Scan a set of websites for the data you want (e.g. Search Job sites on a hourly basis).
- Explore the Semantic web using RDF.
- Search RSS feeds for the information you want.
- Search your Companies systems (including SAP , Oracle or any other Database / Data source).
- Provide a back end for searching in your App (Web , Swing , SWT , Flash, Mozilla-XUL, PHP , Perl or even c#/.Net) .
- Document Management for PDF, Word and other Docs.
- As a Webservice to provide search information
- As a command line tool , to give searching power to your scripts.
- Provide a Search facility for your project documentation.
Using
To use Red-Piranha - open your favourite web browser and point it at http://localhost:8080/RP . Within a few seconds , you should see the Red-Piranha start screen. This will have three items of interest
- A Text box , where we enter the information to add or search
- An add information button - to tell Red-Piranha about new information
- A Search button - to carry out a search.
Before we can search , we must tell Red-Piranha we information we are interested in. This is as easy as putting the piece of information we want to add (e.g. the folder c:temp) in the search box and pressing the Add information button. A message will be displayed saying that your information is being added and will be available to search shortly. For more information , look in the logs at TOMCAT_HOMEWebappsRPlogsrp.log
Examples of things we can add to Red-Piranha are
- A folder (e.g. C:Temp). All files in both this folder and *all* its subfolders will be added.
- An individual file. This file can be text , a web page , a word document , or pdf document. For binary files (like word , which are not plain text) , Red-Piranha will scan the file for recognizable text and add that.
- A Web page. Red-Piranha will add this web page , *and* web pages it links to.
- A Google Search (e.g. http://www.google.com/search?q=some+thing?m=100). Red-Piranha will get the results of the google search , and add information on the pages it links to.
- An XML file (including RSS feeds) , either on disk or over the web.
- Favourites / Bookmarks folders - Red-Piranha will index the web pages that these favourites point to.
Adding information can take anything from a few milliseconds , depending on the amount of information being added. Once added, Red-Piranha will check on a regular basis to see if the information added has changed and re-index if required. Your information is now available to be searched.
To do a search , put the item you want to search for into the textbox and press search. Red-Piranha will show the search results on the screen. Clicking on the link beside the search results will show you the original information (as long as you have access to it).
From version 0.3 onwards , Red-Piranha can learn what search results you are interested in an improve your future searches. To give Red-Piranha feedback and help it learn what you are interested in , click on any of the links on the search results page. Red-Piranha makes a note of your choice , which is used to adjust the search results later.

remerge is a simple browser-based interface to Gentoo Linuxs Portage and Novells Red Carpet package management systems.
It supports installation, uninstallation, and upgrading of many different packages.
Enhancements:
- An installation script glitch was fixed.

Fedora Core is now available from Red Hat and at distinguished mirror sites near you, and is also available in the torrent.
Fedora Core has expanded in this release to four binary ISO images and four source ISO images, and is available for both x86-64 and i386 and also PPC machines.
The Fedora Project is a Red-Hat-sponsored and community-supported open source project. It is also a proving ground for new technology that may eventually make its way into Red Hat products. It is not a supported product of Red Hat, Inc.
The goal of The Fedora Project is to work with the Linux community to build a complete, general purpose operating system exclusively from free software. Development will be done in a public forum. The project will produce time-based releases of Fedora Core about 2-3 times a year with a public release schedule.
The Red Hat engineering team will continue to participate in the building of Fedora Core and will invite and encourage more outside participation than was possible in Red Hat Linux.
By using this more open process, we hope to provide an operating system that uses free software development practices and is more appealing to the open source community.
Main features:
- KDE 3.5.4
- GNOME 2.16
- OpenOffice 2.0.4
- Kernel 2.6.17
- Xen
- ...and many more

libredblack is a library to provide the RedBlack balanced tree searching and sorting algorithm.

The algorithm was taken from the book "Introduction to Algorithms" by Cormen, Leiserson & Rivest. Frankly I never entirely understood it, but it most definately works!

What is the problem with normal binary trees?: A standard binary tree only works well if the original data is provided in a random order (random in terms of the key being sorted on). If however the data is provided in order, then the tree becomes very un-balanced and searches degrade into nothing more than a linked list.

How is the RedBlack tree different?: The RedBlack tree acts in a way to keep the overall tree fairly balanced as new data is loaded in.

How does it work?: The tree is always organised such that it has the following properties:

Every node is either Red or Black.

A leaf node (a dummy empty node at the end of the tree) is always Black.
If a node is Red then its children are Black.

Every path from the root to a leaf contains the same number of Black nodes.
So from 3 & 4 above, we can see that the longest path (alternating Red and Black nodes) is only twice as long as the shortest path (all Black nodes). Thus the tree remains fairly balanced.

Great! How does it maintain those properties?: Ah, well, thats where I get a bit hazy. I know that it does this by adding Red nodes and then rotating the tree elements and changing the colours to sort out times when two Red nodes become parent-child (breaking rule 3).

AddTraction project is a SDL 2-player board game with numbers.

Two players ("red" and "green") take their turns on a 6x6 board. In the beginning, the board is empty except for a red "1" in the upper left and a green "1" in the lower right.

Taking a turn means setting one field of the board. Setting a field makes it assume the sum of the points of the 8 surrounding fields. But there is a catch: if the field is of the opponents color, their score is subtracted rather than added. If the resulting score is positive, the field will get your color, else your opponents color.

The same happens to the global score, which is just a colored difference of the score of all fields on the board. If the score in the end is red, red wins. If it is green, green wins. If it is black (0), it is a draw.