Ports Search

Add is a fixed-point calculator that operates as a full-screen editor. Add performs fixed-point computation. It is designed for use as a checkbook or expense-account balancing tool. Add maintains a running result for each operation. You may scroll to any position in the expression list and modify the list.

ANN is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor neighbor searching in arbitrarily high dimensions.

The Clipper library primarily performs boolean clipping (intersection, union, difference and xor) on polygons in 2D space. There are no restrictions on either the number nor the type of polygon that can be clipped. They can have holes, be self-intersecting and even have coincident edges. The library also performs polygon offsetting

This extension for PHP provides routines for manipulating bitsets.

ARPACK++ is a collection of classes that offers c++ programmers an interface to ARPACK. It preserves the full capability, performance, accuracy and low memory requirements of the FORTRAN package, but takes advantage of the C++ object-oriented programming environment.

This extension for PHP provides routines for manipulating bitsets.

Concorde is a computer code for the traveling salesman problem (TSP) and some related network optimization problems. The code is written in the ANSI C programming language and it is available for academic research use; for other uses, contact bico@isye.gatech.edu for licensing options. Concorde's TSP solver has been used to obtain the optimal solutions to 106 of the 110 TSPLIB instances; the largest having 15,112 cities. The Concorde callable library includes over 700 functions permitting users to create specialized codes for TSP-like problems. All Concorde functions are thread-safe for programming in shared-memory parallel environments; the main TSP solver includes code for running over networks of Unix workstations.

ARPACK software is capable of solving large symmetric, nonsymmetric, and generalized eigenproblems. The software is designed to compute a few (k) eigenvalues with user-specified features, such as those of largest real part or largest magnitude. Storage requirements are on the order of n*k locations, and no auxiliary storage is required. A set of numerically orthogonal Schur basis vectors for the desired k-dimensional eigen-space is computed. Numerically accurate eigenvectors are available on request.

This ststs extension for PHP provides few dozens routines for statistical computation.

djbfft is an extremely fast library for floating-point convolution. The current version holds most of the speed records for double-precision FFTs on general-purpose computers. djbfft provides power-of-2 complex FFTs, real FFTs at twice the speed, and fast multiplication of complex arrays. Single precision and double precision are equally supported.