This release adds built-in functions for: Sort, Sum, Map/Reduce, and Filter. It adds a new client side feature TyArrays for accessing the built-in functions more easily. TyArrays contains static methods for all the functions both using a synchronous call and an asynchronous call with/without callback. Parallel sorting, etc. both synchronously and asynchronously with/without callback can now be done in a single line:
TyArraysReturn back = TyArrays.sort(tymeac, new BIFArrayInput(array, threshold)).
The ability to decompose (fork()) was added in the complete() method. This makes usage easier for uses such as sorting. After sorting in the compute() method, the application is left with many arrays of sorted items in the complete() method. Merging those arrays can now be done in two ways. You can simply fork() groups of those arrays in the complete() method until you arrive at a single array. Or you can recursively call the Tymeac Server with Merge Functions until you arrive at a single array.
This version adds indexing over the threads and queues to accommodate hundreds or thousands of threads. The Tymeac series of Fork-Join open source Java tools makes the proposed Java 7 inclusion seem little more than an academic exercise.