Brillien, is an enterprise-level application server that reduces the significance of modeling issues and inconveniences. It is able to map the logical system formed during the requirement analysis and make it a functioning one. Brillien features a Powerobject model; a basis on Flow to control, composite, distribute, and restore; tools for the entire project lifecycle, from design to operation; functional dependency handling; state-driven functionality; error cases and timout handling; and wide EE tool, library, and technology integration.
CouchUnit is a JUnit extension that helps administer tests run against CouchDB. It mimics the syntax and feel of DBUnit by helping developers write tests that load XML style datasets to place databases in known states between integration tests. A number of standard operations are used to store and remove CouchDB documents. Any number of documents may be declared within a single CouchUnit dataset.
Minnow is a concurrent programming language with a Ruby-like syntax. It compiles to an executable and uses a companion library to allow fully-rebalanced microthreads. Minnow gains a lot of strength from its actor model, which uses message passing, as opposed to threads and locking, as its concurrency model. Taking a cue from Erlang, actor creation and message passing is extremely lightweight (often on the order of a few nanoseconds). The language has a built-in foreign function interface that allows developers to leverage existing C-based libraries in a simple SWIG-like manner. Minnow's object model is based on "melding" features together to form objects.
Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.