Ports Search

[Original description for version 0.0.2beta1] Qonk is a small game I wrote to learn some SDL basics. The game is a small build-and-conquer strategy game with very simple rules. A complete game only lasts for a few minutes and can be a fun break away from work or whatever you're doing. The setting of the game is a solar system of planets. Your goal is to conquer all of the planets in the game by sending ships there. Planets that are under your control generate new ships. Simple AI players are playing against you. As you gain more experience throughout the game, more AI players have to be kicked out of bigger solar systems. The game is currently very much in beta. I published it however in order to see whether it compiles on other machines, and to see what reactions people had on its gameplay. The game engine itself is fully functional. A lot of things have to be added to make this a mature game (like menus and stuff), but since the engine itself works, Qonk is already very playable.

Htmlc is an HTML template files expander that produces regular HTML pages from source files that contain text fragments that require some computation to be written. Those fragments can be the output of an arbitrary Unix command, for instance the last modification date of a page, or parts of HTML pages to be included in the page, or pieces of the page that are common to the entire WEB site (a presentation header or a footer section for each page). Providing the automatic inclusion of those text fragments into your HTML source pages, Htmlc offers a server independent way of defining templates to factorize out the repetitive parts of HTML pages. Htmlc also provides a variable expansion facility (using definitions in the template file or in simple environment files using a syntax a la objective Caml). In short, Htmlc ensures the static verification and the static expansion of the Server Side Includes directives of the Web pages in the efficient and friendly way of a command-line compiler.

Tsung is an open-source multi-protocol distributed load testing tool It can be used to stress HTTP, WebDAV, SOAP, PostgreSQL, MySQL, LDAP and Jabber/XMPP servers. Tsung is a free software released under the GPLv2 license. The purpose of Tsung is to simulate users in order to test the scalability and performance of IP based client/server applications. You can use it to do load and stress testing of your servers. Many protocols have been implemented and tested, and it can be easily extended. It can be distributed on several client machines and is able to simulate hundreds of thousands of virtual users concurrently (or even millions if you have enough hardware ...). Tsung is developed in Erlang, an open-source language made by Ericsson for building robust fault-tolerant distributed applications.

Urban Terror is a realism based total conversion mod for Quake III Arena which no longer requires this game to be played. It only uses its engine, which is open sourced through the GPL and may be distributed freely. Urban Terror plays in about the same setting as Counter Strike, but is less focused on realism and plays much faster, which among other things, is caused by the ability to strafe jump, which combined with wall jumping can lead to very quick movement and nice jumps. Urban Terror has 7 game modes, 25 maps and 15 weapons. This port only contains the data, and can be played with ioUrbanTerror (games/iourbanterror) or any other Quake 3 Arena compatible engine.

This program writes short movies with your Canon DSLR camera directly to the computer. The camera must have Live View feature to work; supported models include Canon EOS 450D, Canon EOS 1000D, Canon 40D, Canon 50D, Canon 5D Mark II, Canon 1Ds Mark III. The program offers preview, Av, Tv, and WB control. While some newer models provide video recording natively, this program can be useful if your camera does not have this option. Video will be recorded using MJPEG codec, with no sound, roughly at 22 FPS (depends on your hardware: camera and computer). Image size is also camera dependent: 848x560 for 450D; 1024x680 for 40D, 50D, and top models; 768x512 for 1000D. Resulting file is simply a collection of Live View frames stored sequentially without any compression in AVI container (expect file size to be quite large).

The octave-forge package is the result of The GNU Octave Repositry project, which is intended to be a central location for custom scripts, functions and extensions for GNU Octave. contains the source for all the functions plus build and install scripts. This is queueing. The queueing toolbox provides functions for queueing networks and Markov chains analysis. This package can be used to compute steady-state performance measures for open, closed and mixed networks with single or multiple job classes. Mean Valud Analysis (MVA), convolution and various bounding techniques are implemented. Various transient and steady-state performance measures for Markov chains can als be computed (including state occupancy probabilities, mean time to absorption, time-averaged sojourn times), both for continuous-time and discrete-time chains.

The octave-forge package is the result of The GNU Octave Repositry project, which is intended to be a central location for custom scripts, functions and extensions for GNU Octave. contains the source for all the functions plus build and install scripts. This is interval. The interval package for real-valued interval arithmetic allows to evaluate functions over subsets of their domain. All results are verified, because interval computations automatically keep track of any errors. These concepts can be used to handle uncertainties, estimate arithmetic errors and produce reliable results. Also it can be applied to computer-assisted proofs, constraint programming, and verified computing. The implementation is based on interval boundaries represented by binary64 numbers and is conforming to IEEE Std 1788-2015, IEEE standard for interval arithmetic.

xjobs reads job descriptions line by line and executes them in parallel. It limits the number of parallel executing jobs and starts new jobs when jobs finish. Therefore, it combines the arguments from every input line with the utility and arguments given on the command line. If no utility is given as an argument to xjobs, then the first argument on every job line will be used as utility. To execute utility xjobs searches the directories given in the PATH environment variable and uses the first file found in these directories. xjobs is most useful on multi-processor/core machines when one needs to execute several time consuming command several that could possibly be run in parallel. With xjobs this can be achieved easily, and it is possible to limit the load of the machine to a useful value. It works similar to xargs, but starts several processes simultaneously and gives only one line of arguments to each utility call.

This module provides a simple way to extend the Math::Symbolic parser with arbitrary functions that return any valid Math::Symbolic tree. The return value of the function call is inserted into the complete parse tree at the point at which the function call is parsed. Familiarity with the Math::Symbolic module will be assumed throughout the documentation. This module is not object oriented. It does not export anything. You should not call any subroutines directly nor should you modify any class data directly. The complete interface is the call to use Math::SymbolicX::ParserExtensionFactory and its arguments. The reason for the long module name is that you should not have to call it multiple times in your code because it modifies the parser for good. It is intended to be a pain to type. :-) The aim of the module is to allow for hooks into the parser without modifying the parser yourself because that requires rather in-depth knowledge of the module code. By specifying key => value pairs of function names and function implementations (code references) as arguments to the use() call of the module, this module extends the parser that is stored in the $Math::Symbolic::Parser variable with the specified functions and whenever "yourfunction(any argument string not containing an unescaped \) )" occurs in the code, the subroutine reference is called with the argument string as argument. The subroutine is expected to return any Math::Symbolic tree. That means, as of version 0.133, a Math::Symbolic::Operator, a Math::Symbolic::Variable, or a Math::Symbolic::Constant object. The returned object will be incorporated into the Math::Symbolic tree that results from the parse at the exact position at which the custom function call was parsed. Please note that the usage of this module will be quite slow at compile time because it has to regenerate the complete Math::Symbolic parser the first time you use this module in your code. The run time performance penalty should be low, however.

PPM2FLI can read directly PPM,PGM,PBM and FBM files. If necessary it performs a quantization. The filters of the NETPBM, PBMPLUS and FBM package can be used as read filters. Together with one of this packages a large number of image formats can be handled. UNFLICK writes images in PPM or FBM format. In contrast to FBM2FLI no additional package is required to build PPM2FLI and UNFLICK. So it can be used without any of the above mentioned packages, if another source of PPM,PGM,PBM or FBM images is available. For example, PS images can be animated using ghostscript. The current version is call `beta' because some parts are relative new and not totally tested. I made tests on SUN sparc-stations (various versions of SUN-OS), on PC running LINUX and under MSDOS using the DJGPP DOS-extender. In all cases the GCC compiler was used. Under MSDOS I used a modified makefile. Anyway, in some environments changes in the makefile are necessary.