Ports 搜索

MUMPS is a Distributed Multifrontal Solver (F90, MPI based) with Dynamic Distributed Scheduling to accomodate both numerical fill-in and multi-user environment. - Solution of large linear systems with symmetric positive definite matrices; general symmetric matrices; general unsymmetric matrices. - Version for complex arithmetic. - Parallel factorization and solve phases (uniprocessor version also available). - Iterative refinement and backward error analysis. - Various matrix input formats: assembled format; distributed assembled format; elemental format. - Partial factorization and Schur complement matrix. - Several orderings interfaced : AMD, AMF, PORD, METIS

This tool removes blocks of 0x00 from files by replacing them with phantomblocks. That way, a file uses less diskspace while its contents hasn't changed at all! BEWARE: after copying these files with tar, cp, cpio or any other tool, the phantomblocks have been replaced with 0x00-blocks again! EXAMPLE: find / -type f -print | xargs -n 1 phantom -r -i This would go trough the whole harddisk, scan all files and generate 0x00-blocks where necessary.

This is a meta-port for boost libraries, depends on all of them. Boost provides free peer-reviewed portable C++ source libraries. The emphasis is on libraries that work well with the C++ Standard Library. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. The goal is to establish "existing practice" and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are already included in the C++ Standards Committee's Library Technical Report (TR1) and will be in the new C++0x Standard now being finalized. C++0x will also include several more Boost libraries in addition to those from TR1. More Boost libraries are proposed for TR2.

As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see Math::Random::MT), this algorithm is designed to take some seed information and produce seemingly random results as output. However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has different goals than these commonly used algorithms. In particular, it's really fast - on average, it requires only 18.75 machine cycles to generate a 32-bit value. This makes it suitable for applications where a significant amount of random data needs to be produced quickly, such solving using the Monte Carlo method or for games.

Flex is a tool for generating scanners. A scanner, sometimes called a tokenizer, is a program which recognizes lexical patterns in text. The flex program reads user-specified input files, or its standard input if no file names are given, for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C code, called rules. Flex generates a C source file named, "lex.yy.c", which defines the function yylex(). The file "lex.yy.c" can be compiled and linked to produce an executable. When the executable is run, it analyzes its input for occurrences of text matching the regular expressions for each rule. Whenever it finds a match, it executes the corresponding C code.

gURLChecker is a C/GNOME2 tool that can check links on a single web page or on a whole web site in order to determine the validity of each page.

This module implements a very simple and fast parser for cookies used in HTTP applications.

WSGI request delegation. (AKA routing.) This distribution provides WSGI middleware for "RESTful" dispatch of requests to WSGI applications by URL path and HTTP request method. Selector now also comes with components for environ-based dispatch and on-the-fly middleware composition. There is a very simple optional mini-language for path matching expressions. Alternately we can easily use regular expressions directly or even create our own mini-language. There is a simple "mapping file" format that can be used. There are no architecture specific features (to MVC or whatever). Neither are there any framework specific features.

Splint is a tool for statically checking C programs for security vulnerabilities and coding mistakes. With minimal effort, Splint can be used as a better lint. If additional effort is invested adding annotations to programs, Splint can perform stronger checking than can be done by any standard lint.

This library implements i;unicode-casemap, the simple, non locale-sensitive unicode collation algorithm described in RFC 5051. Proper unicode collation can be done using text-icu, but that is a big dependency that depends on a large C library, and rfc5051 might be better for some purposes.