Micro Signage is a lightweight software suite that can be used as the basis for creating digital signage appliances, such as advertisement screens and full software systems. It is intended to be used to control the playback of media files and be managed over the network through a socket server, which is included.
JSokoban is a port of the classic Macintosh puzzle game in which players try to shift the money bags of each level to a given position. The game comes with over 200 levels of varying difficulty, sound, unlimited undos/redos, and support for moving using both the keyboard and mouse.
Battletech MUX is an Internet based, real-time rendition of the popular Battletech board game. Players take to the front lines in their very own mechs, tanks, and similar implements of destruction. Featuring an internal scripting language called SoftCode, game admins may sculpt their sites into whatever they can imagine, be it small-scale combat or massive, galactic conflict.
libbsl (Basic System Library) is a powerful, easy to use, and fully thread safe C++ template class library for frequently recurring (machine/OS oriented) programming problems. It provides many useful classes like easy to use and fully interchangable I/O devices, ElGamal/AES cryptographic network sockets, dynamic loadable C++ objects which remain dynamic_castable after loading, simple to use and fully copyable thread objects, functors, typelists, a superior state machine implementation, and much more.
libfactory++ is a C++ template framework for run-time dynamic type instantiation. You can register single classes or whole hierarchies, and then tell libfactory++ to instantiate objects using the registration key. libfactory++ differs from other factory approaches mainly in its flexibility. First, it can use any constructor a type supports, and allows you to choose (and configure) the constructor to use for each call to create(). Second, it supports custom allocators, allowing you to use, e.g., a memory pool rather than continuous invocations of 'new'.
libkdtree++ is a C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretically unlimited number of dimensions, and can store any data structure. Provided the data structure, it provides operator[0 - k-1] to access the individual dimensional components (arrays, std::vector already do) and a std::less implementation for the type of dimensional components. It has support for custom allocators, implements iterators, and provides standard find as well as range queries. It has amortised O(lg n) time (O(n lg n) worst case) on most operations (insert/erase/find optimised) and worst-case O(n) space, and also provides a means to rebalance and thus optimise the tree.