10177 projects tagged "OS Independent"
Updated 13 Jul 2004
arianne
| Pop | 286.52 |
|---|---|
| Vit | 6.62 |
Arianne is a multiplayer online engine to develop turn based and real time games. It provides a simple way of creating games using Python for a game's description. Marauroa, its server, uses Java, MySQL, UDP, and Python for hosting dozens of players.
Updated 16 Apr 2013
Artistic Style
| Pop | 256.26 |
|---|---|
| Vit | 51.80 |
Artistic Style is a fast and small open-source indenter and reformatter of C, C++, C#, and Java source codes.
Updated 23 Nov 2012
ascii
| Pop | 156.08 |
|---|---|
| Vit | 7.92 |
ascii lists ASCII idiomatic names and octal/decimal code-point forms. It frovides easy conversion between various byte representations and the American Standard Code for Information Interchange (ASCII) character table. It knows about a wide variety of hex, binary, octal, Teletype mnemonic, ISO/ECMA code point, slang names, XML entity names, and other representations. Given any one on the commandline, it will try to display all others. Called with no arguments, it displays a small, handy ASCII chart.
Updated 03 Jan 2009
aspell-da
| Pop | 38.31 |
|---|---|
| Vit | 10.51 |
aspell-da is an aspell dictionary for spell-checking Danish texts. It is based on "Den store danske ordliste" (The Comprehensive Danish Dictionary).
Updated 11 Jun 2002
Astroconst
| Pop | 41.09 |
|---|---|
| Vit | 2.19 |
Astroconst makes header files in C, Fortran, Perl, IDL, Java, and Gnuplot defining a plethora of astrophysical constants useful for scientific programming. The header files are generated from a single modifiable data file.
Updated 30 Jan 2001
Autojot
| Pop | 50.00 |
|---|---|
| Vit | 1.00 |
Autojot lets you index and search every Web page you view so you can find things again later.
Updated 04 Apr 2003
autolame
| Pop | 41.79 |
|---|---|
| Vit | 2.96 |
autolame automatically encodes your .wav files. Just put them in the "in" directory, wait a bit, and you'll find your .mp3 files in the "out" directory. No further user interaction is required. An external encoder program is needed.
Updated 30 Jan 2001
Automated support for compound RPC calls
| Pop | 61.25 |
|---|---|
| Vit | 1.00 |
NFSv4 specifies that the RPC calls be batched into a "compound" call. There is no support for this in RPCGEN. By rearranging the ONC IDL for NFSv4 into AutoGen definitions, these templates will emit the original IDL *plus* all the code to package, send, distribute, collect, return, and dispatch the results. The distributed program author merely needs to call and supply server procedures for the routines specified in the IDL. Templates for these calls and service routines is provided, too. The NFSv4 definitions are included.
Updated 24 Apr 2003
Avalon
| Pop | 138.65 |
|---|---|
| Vit | 4.74 |
Avalon is Apache's Java Server Framework project. It is separated into six subprojects: Framework, Excalibur, LogKit, Cornerstone, Phoenix, and Apps. Its purpose is to simplify server side programming for Java-based projects. It formalizes several best practices and patterns for server side programming. Framework describes the interfaces and contracts for the component-based architecture. Excalibur provides a number of useful components and utilities. LogKit is a logging implementation. Cornerstone is a group of reusable server components and services. Phoenix is an enterprise container implementation that uses all of the other subprojects to automatically deploy and manage one or more componentized servers. Apps is a home for several Phoenix-compatible server applications and reusable components (like FtpServer).
Updated 13 Feb 2002
AVL C Library
| Pop | 72.21 |
|---|---|
| Vit | 2.12 |
This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys. The AVL tree is an explicit binary searching tree, where left children of each vertex are less or equal, while right children are greater or equal than the vertex itself. In addition, the tree is balanced so that the difference between the depths of the two subtrees of each vertex is at most one.
