Download JAR files tagged by buffering with all dependencies

WARP socket modem for multiplexing and concurrently transporting prioritized, explicitly flow-controlled WARP treams over a network, without blocking or intermediate buffering

Uploads all artifacts belonging to configuration ':swim-io-ws:archives'

Jlayer version used in libgdx. Fixed some NPEs, changed how buffering happens, deleted most of the classes, everything not related to decoding and half of what was related to decoding but not needed. Added support for reading replay gain out of the mp3.

This module implements virtual file systems from arbitrary resources, manages their state and commits unsynchronized changes if required or requested. The TrueZIP Kernel uses file system drivers to access these resources. It provides multithreading, multiplexing, caching and buffering so that the file system drivers do not need to take care of this.

Includes 2 main parts: - Path finding through 2D polygons using the A star algorithm and navigation-mesh generation Field of vision / shadows / line of sight / lighting. The basic polygon and point classes are the KPolygon and KPoint. KPolygon contains a list of KPoints for vertices as well as a center (centroid), area, and radius (circular bound or distance from center to furthest point). KPolygon was born out of the need for a more game-oriented and flexible polygon class than the Path2D class in the standard Java library. KPolygon implements java.awt.geom.Shape so it can be easily drawn and filled by Java2D's Graphics2D object. - This API provides path-finding and field-of-vision. For other complex geometric operations such as buffering (fattening and shrinking) and constructive area geometry (intersections and unions) it is recommended to use the excellent Java Topology Suite (JTS). The standard Java2D library also provides the Area class which can be used for some constructive area geometry operations. Note that there is a utility class PolygonConverter that can quickly convert KPolygons to JTS polygons and vice versa.