Free double software for linux

cddsolve project is a double dummy bridge solver.
It utilizes alpha-beta pruning and minimax searching to find the number of tricks a given side can take under the assumption of optimal play.
While the complexity of the problem may be enormous depending on the given deal and contract, cddsolve is fast enough to be actually helpfull for many double dummy bridge problems.
cddsolve has an predecessor called ddsolve which is implemented in python and also available on this page.
ddsolve is considered to be a prototypical implementation to demonstrate the basic algorithms and quantify the impact of different optimizations.
Enhancements:
- cleaned up the preprocessor macros and added some bogus return values to make recent gccs happy.
- incremented the TPBUCKETCOUNT in ddtranspos.c, trading computational speed against memory footprint. shoe size is about 10mb larger now.
- released 0.9.

UMLet project is an open-source Java tool for rapidly drawing UML diagrams with a pop-up-free, light-weight user interface.
UMLet lets you draw diagram sketches fast; export diagrams to eps, pdf, jpg, svg, and sys.
Add elements to a diagram with a double click. Edit elements using the lower-right text panel. Select multiple elements using Ctrl or lasso. Press C to copy diagram to the system clipboard
Main features:
- fast
- text-based sequence diagram
- call from command line.

Coloryze is an application for generating color themes based on the theory of how hues can be combined. It supports monochromatic, complementary, split-complementary, double-complementary, analogous, and triadic schemes.
It can generate tables for a full range of saturation and brightness values, or it can randomly select a group of colors to comprise a theme. It generates both text and HTML, and an online version is available.
Enhancements:
- This version was fixed to properly use the background specified.

With kmp3db, you can search easily through all your mp3 files. With a double-click on a song, your favorite mp3-player will play the song!
Main features:
- create and play playlists
- playing and queueing
- dragndrop
- support for ogg/vorbis files
- recursively scan your filesystem for .mp3/.ogg files
- support for cds
- extract info from tags in the file or from the filename
- xml database

Qleuren project is a Qt-based MasterMind clone.
Qleuren is a Qt-based MasterMind clone with a user-interface that tries to look and feel like a real-world board game.
The colored pegs can be dragged to any place on the game board. Alternatively the pegs can be moved to the first usable spot on the board by right-clicking them.
Main features:
- Non-configurable game rules; just straight classic rules without double colors in the hidden code.
- Moving pegs automatically (right- or double-clicking them ) is animated. This animation is optional and the speed can be adjusted.
Enhancements:
- Fixed bug that prevented putting a peg in a place where there was a pegged remove previously from that place.

Bloglines Notifier is a Gnome panel applet that monitors a Bloglines account and displays an alert when there new items.

When there are new items the applet displays a tooltip with the count of unread items. Also one can double click on the applet in order to launch a web browser and point it at the Bloglines account being monitored.

PDL::LinearAlgebra::Complex is a PDL interface to the lapack linear algebra programming library (complex number).

SYNOPSIS

use PDL::Complex
use PDL::LinearAlgebra::Complex;

$a = r2C random (100,100);
$s = r2C zeroes(100);
$u = r2C zeroes(100,100);
$v = r2C zeroes(100,100);
$info = 0;
$job = 0;
cgesdd($a, $job, $info, $s , $u, $v);

This module provide an interface to parts of the lapack library (complex number). These routine accept either float or double piddles.

EOD

pp_defc("gesvd", HandleBad => 0, RedoDimsCode => $SIZE(r) = $PDL(A)->ndims > 2 ? min($PDL(A)->dims[1], $PDL(A)->dims[2]) : 1;, Pars => [io,phys]A(2,m,n); int jobu(); int jobvt(); [o,phys]s(r); [o,phys]U(2,p,q); [o,phys]VT(2,s,t); int [o,phys]info(), GenericTypes => [F,D], Code => generate_code
integer lwork;
char trau, travt;
types(F) %{

extern int cgesvd_(char *jobu, char *jobvt, integer *m, integer *n, float *a,
integer *lda, float *s, float *u, int *ldu,
float *vt, integer *ldvt, float *work, integer *lwork, float *rwork,
integer *info);
float *rwork;
float tmp_work[2];
%}
types(D) %{

extern int zgesvd_(char *jobz,char *jobvt, integer *m, integer *n,
double *a, integer *lda, double *s, double *u, int *ldu,
double *vt, integer *ldvt, double *work, integer *lwork, double *rwork,
integer *info);
double *rwork;
double tmp_work[2];
%}
lwork = ($PRIV(__m_size) < $PRIV(__n_size)) ? 5*$PRIV(__m_size) : 5*$PRIV(__n_size);
types(F) %{
rwork = (float *)malloc(lwork * sizeof(float));
%}
types(D) %{
rwork = (double *)malloc(lwork * sizeof(double));
%}
lwork = -1;


switch ($jobu())
{
case 1: trau = A;
break;
case 2: trau = S;
break;
case 3: trau = O;
break;
default: trau = N;
}
switch ($jobvt())
{
case 1: travt = A;
break;
case 2: travt = S;
break;
case 3: travt = O;
break;
default: travt = N;
}



$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
&tmp_work[0],
&lwork,
rwork,
$P(info));

lwork = (integer )tmp_work[0];
{
types(F) %{

float *work = (float *)malloc(2*lwork * sizeof(float));
%}
types(D) %{

double *work = (double *)malloc(2*lwork * sizeof(double));
%}
$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
work,
&lwork,
rwork,
$P(info));
free(work);
}
free(rwork);
,
Doc=>