libmodule-want-perl

module to check @INC only once for wanted modules

Sometimes you want to lazy load a module for use in, say, a loop or function. First you do the eval-require but then realize if the module is not available it will re-search @INC each time. So then you add a lexical boolean to your eval and do the same simple logic all over the place.

gdc-14-mipsisa32r6el-linux-gnu

GNU D compiler (version 2) for the mipsisa32r6el-linux-gnu architecture

This is the GNU D compiler for the mipsisa32r6el-linux-gnu architecture, which compiles D on platforms supported by gcc. It uses the gcc backend to generate optimised code.

python-pystache

Python implementation of Mustache

Pystache is Python implementation of Mustache. Original Mustache is a framework-agnostic, logic-free templating system inspired by ctemplate and et. Like ctemplate, Mustache "emphasizes separating logic from presentation: it is impossible to embed application logic in this template language."

libspring-transaction-java

modular Java/J2EE application framework - transaction

Spring is a layered Java/J2EE application framework offering a lot of freedom to Java developers yet providing well documented and easy-to-use solutions for common practices in the industry.

clasp

conflict-driven nogood learning answer set solver

clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set programming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on LPARSE output format), as a SAT solver (on simplified DIMACS/CNF format), or as a PB solver (on OPB format).

libghc-diff-prof

O(ND) diff algorithm library; profiling libraries

This is a Haskell library providing an implementation of the O(ND) diff algorithm described in "An O(ND) Difference Algorithm and Its Variations" (1986) by Eugene W. Myers. It is O(mn) in space.