Free minimal software for linux

CGI::Minimal is a lightweight CGI form processing package.

SYNOPSIS

# use CGI::Minimal qw(:preload);
use CGI::Minimal;

my $cgi = CGI::Minimal->new;
if ($cgi->truncated) {
&scream_about_bad_form;
exit;
}
my $form_field_value = $cgi->param(some_field_name);

Provides a micro-weight alternative to the CGI.pm module
Rather than attempt to address every possible need of a CGI programmer, it provides the _minimum_ functions needed for CGI such as form decoding (including file upload forms), URL encoding and decoding, HTTP usable date generation (RFC1123 compliant dates) and basic escaping and unescaping of HTMLized text.

The :preload use time option is used to force all sub-component modules to load at compile time. It is not required for operation. It is solely a performance optimization for particular configurations. When used, it preloads the dehtmlize, param_mime, param_filename, date_rfc1123, url_decode, calling_parms_table and parameter setting supporting code. Those code sections are normally loaded automatically the first time they are needed.

The form decoding interface is somewhat compatible with the CGI.pm module. No provision is made for generating HTTP or HTML on your behalf - you are expected to be conversant with how to put together any HTML or HTTP you need.

gvidm is a gtk app to quickly and easily change video resolutions in X. Running it will pop up a list of available modes, upon choosing a mode or cancelling, it exits.
This makes it perfect for running from an application menu or a hotkey, so you dont have to use ram for an applet constantly running. If you are running dual or multi-head displays, it will give you a list of screens so you can select the appropriate one.
You can also specify on the command line a mode to switch to immediatly, or a list of modes to choose from.
Please note that gvidm cannot change the color depth, as that requires restarting X. Furthermore, any and all modes you want to appear must be defined in your XF86Config.
If youve only configured one mode, thats all that will show in the pop up. (Though this seems to no longer be the case with XFree 4.3+)
The XVidMode and/or XRandR extensions must be enabled in order to run gvid.
As mentioned above, gvidm supports multiple screen displays, including Xinerama. If youre running Xinerama, make sure that the configure script detects that and compiles in support for it.
If gvidm only displays one list of resolutions when youre running Xinerama, it means that Xinerama wasnt detected, Try re-configuring and re-compiling, telling it where your X libs (specifically libXinerama.a) are with the http://www.dakotacom.net/~donut/programs/gvidm/gvidm-0.8.tar.gz--x-libraries= option.
Enhancements:
http://www.dakotacom.net/~donut/programs/gvidm/gvidm-0.8.tar.gz8 - Add support for GTK 2.0.
- The default is to build for GTK 2.0 if it is present, specify configure --with-gtk1 if you want to force building with GTK 1.x.
- Fix build when xf86Parser.h isnt present. (Though interlaced or doublescan modes may show wrong refresh rates then.)
- Fix showing incorrect refresh rates for interlaced modes.

C Minimal Perfect Hashing Library encapsulates the newest and more efficient algorithms in an easy-to-use, production-quality, fast API. The library was designed to work with big entries that cannot fit in the main memory. It has been used successfully for constructing minimal perfect hash functions for sets with more than 100 million of keys, and we intend to expand this number to the order of billion of keys.
Main features:
- Fast.
- Space-efficient with main memory usage carefully documented.
- The best modern algorithms are available (or at least scheduled for implementation :-)).
- Works with in-disk key sets through of using the adapter pattern.
- Serialization of hash functions.
- Portable C code (currently works on GNU/Linux and WIN32 and is reported to work in OpenBSD and Solaris).
- Object oriented implementation.
- Easily extensible.
- Well encapsulated API aiming binary compatibility through releases.
- Free Software.
A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.
Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others.
The use of minimal perfect hash functions is, until now, restricted to scenarios where the set of keys being hashed is small, because of the limitations of current algorithms. But in many cases, to deal with huge set of keys is crucial. So, this project gives to the free software community an API that will work with sets in the order of billion of keys.
Probably, the most interesting application for minimal perfect hash functions is its use as an indexing structure for databases. The most popular data structure used as an indexing structure in databases is the B+ tree. In fact, the B+ tree is very used for dynamic applications with frequent insertions and deletions of records. However, for applications with sporadic modifications and a huge number of queries the B+ tree is not the best option, because practical deployments of this structure are extremely complex, and perform poorly with very large sets of keys such as those required for the new frontiers database applications.
For example, in the information retrieval field, the work with huge collections is a daily task. The simple assignment of ids to web pages of a collection can be a challenging task. While traditional databases simply cannot handle more traffic once the working set of web page urls does not fit in main memory anymore, minimal perfect hash functions can easily scale to hundred of millions of entries, using stock hardware.
As there are lots of applications for minimal perfect hash functions, it is important to implement memory and time efficient algorithms for constructing such functions. The lack of similar libraries in the free software world has been the main motivation to create the C Minimal Perfect Hashing Library (gperf is a bit different, since it was conceived to create very fast perfect hash functions for small sets of keys and CMPH Library was conceived to create minimal perfect hash functions for very large sets of keys). C Minimal Perfect Hashing Library is a portable LGPLed library to generate and to work with very efficient minimal perfect hash functions.
Enhancements:
- This release adds an implementation of a classical minimal perfect hash algorithm called fch.
- This is used as a basis for a new algorithm that can create minimal perfect hashes for billions of keys with less than four bits per key, and is ready to use.
- Suggestions and bugfixes from users have been incorporated.

Sunergos Simple is a minimal Gnome Login Manager.

An experiment in minimalism.

There are no options, no buttons, just a hello and how are you and why dont you just log in already?

So, this theme may not be suited for all users.

However, it is _extremely_ easy to understand and quite useful if you are interested in creating your own theme.

Swing Glue is an ultra thin layer that allows to decouple view, controller and model into separate individual domains.
It as not just another framework as you might think now. It is an very generic layer that has a minimal impact to the application where swing glue is used.
Main features:
- Object repository that minimizes transport of references
- automatic population of Adhesive class members from the repository
- abstraction of view code and event code
- no wrapping component classes, you still use the normal Swing classes
Swing Glue is proof for the legend that a framewok does not necessarly has to be a Bloat of code that helps you to simplify your development.
It also works with a simple framework that is non evasive and has a very simple code base.

Dial-Up Bot project aims to be a fully functional automated replacement for the /etc/ppp/ip-{up,down}.d hierarchy. Its supposed to be started by cron at night. It cant satisfy the requirements of impatient roots. Its not designed for hosts with a permanent Internet connection.
Enhancements:
- This is the first public release since dubot reached minimal useful functionality and stability. Installation mech is minimally stable (at least for install in /usr/local hierarchy).

Spin is a transparent threading solution for non-freezing Swing applications.
Every non trivial GUI sooner or later encounters the problem of "freeze".
This annoying behaviour is experienced by users every time the application performs extensive calculations or blocks for network or disk I/O.
Spin offers a new approach for solving this problem.
It offers transparent thread handling with minimal impact on your application code.
Enhancements:
- Now built with Maven.

Stamits Online Poker project is a simple OpenGL poker game that can be played online with another person.

Compilation:

Make sure you have the GNU C and C++ compilers.

Get MOGUL, the Minimal OpenGL Utility Library, compile and install it (or use a compiled binary version, if there is one available). Instructions should be included.

Open `Makefile and uncomment the lines below the label `Unix configuration.

Say `make. The result should be an executable named `sopoker in the current working directory.