Free red piranha 0.3 software for linux

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.

Quadromania project is a board game written in C with SDL.

Your task is to restore the originating board filled with red stones. The computer will pick a named amount of 3x3 tile sets and will flip the colours of the selected tiles.

This means a red tile will become green, a green one the next colour in the amount of colours, red again in the simplest case. You select the amount of colours to use and the amount of initial rotations.

In the running game click on the center point of a 3x3 tile set to exchange that selected set following the rules above. Restore the board full of red stones before you reach the limit of maximum turns.

Quadromania is a work in progress. I currently lack the time to do a decent development on it. However the current alpha release is somewhat playable and working.

EZ Red Skin Fix is a script-fu based on a technique by lylejk of dpreview.com that can be used to improve skin that has a reddish tint.

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).

tenmado project is a hard-core shoot em up game in a blue-or-red world.

tenmado is a vertically scrolling, late 1990s style (i.e., a massive number of enemy shots against a smaller-than-it-looks spaceship) shoot em up game.

A very accurate collision detection makes it a game of dexterity. If something looks like a triangle, it is a triangle, not a rectangle of similar size.

However, surviving is only 20% of the game. The main feature of tenmado is the "color chain bonus".

You can get a very big score (about 100 times bigger than a normal enemy-destruction point) by destroying enemies of the same color successively.

It is easy or difficult depending on how greedy you are.

ical for Red Hat is an effort to provide the ical program in RPM format for users of current versions of Red Hat Linux.

WellRounded provides an aesthetically pleasing, rounding the edges of the location bar.

Adds a nice finishing touch to Firefox by providing aesthetically pleasing, rounded edges to the location bar, search bar, find bar, and all manor of other toolbars on your browser.

Some themes incorporate rounded bars as standard, but many do not - this extension will allow everyone the option to enjoy rounded bars with their favourite browser!

It conforms to the normal Firefox standards, such as turning yellow for secure (https) sites, and red for broken security, and is compatible with all toolbars (that I know of), and most themes.

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.