FEST JavaFX Compiler Maven Plug-in is a Maven plug-in for compiling JavaFX sources. It compiles JavaFX source and test files. It does not require the JavaFX distribution to be in a Maven repository (since, according to its license, only Oracle can distribute JavaFX). It does not require you to list all JavaFX libraries as dependencies in your pom.xml.
Poor Man's Imaging Wrapper a clean and simple API wrapper over JAI, Java2D, ImageIO, and AWT. It supports a set of imaging operations (read, write, scale/resize, crop, grayscale, add transparency, rotate, add border, flip/mirror, add text, overlay, blur, sharpen, etc.) with simple direct calls to the API. If you want to switch from Java2D to JAI, all you need to do is add JAI jars to the classpath. It supports GIF encoding if PJA tools jars are available in the classpath.
Mr.Java is a Java IDE that is one step above a command line interface, but not quite as confusing as an IDE. It will compile for you, add libraries to your class path, and run the whole thing, with three simple buttons. Drag a library or Java source file over the window, and it will be put in the right folder. When running programs, the stout is written to a file cleverly named “stdout”, and the std err is cleverly written to file named - you guessed - stderr.
visural-wicket is a useful set of light-weight, loosely coupled components and utilities for the Apache Wicket Web framework. Each component is designed to be easily integrated into any existing Wicket application with minimal dependencies. Each component is also designed to be easily customized to fit a particular system's requirements. Other than components, visural-wicket includes some other utilities that assist in the development of Wicket applications, such as an annotation-based mounting system, model templates, and an automatic "form view mode" component.
treap.py is a treap implementation for Python. A treap is a hybrid of a binary tree and a binary heap that is self-balancing and is O(nlog2(n)) for most operations, including deleting a value, inserting a value, finding the least value, and finding the greatest value. This particular treap implementation looks like a dictionary to the caller, but it also supports getting an ordered list (forward or reverse) in O(n) time. The code is available as pure Python (should run on about any Python implementation supporting generators, but was tested on CPython 2.6) or as part Python and part Cython for performance. The version with Cython should run on CPython or Unladen Swallow, but was only tested on CPython 2.6.