27 projects tagged "Apache 2.0"
junixsocket is a Java/JNI library that allows the use of Unix Domain Sockets (AF_UNIX sockets) from Java. In contrast to other implementations, junixsocket extends the Java Sockets API (java.net.Socket, java.net.SocketAddress, etc.) and even supports RMI over AF_UNIX. It is also possible to use it in conjunction with Connector/J to connect to a local MySQL server via Unix domain sockets.
metagloss is an annotation-centric Android library for reducing boilerplate code. Relying on run-time parsing and compile-time code generation, metagloss provides facilities for mapping XML and databases to data objects, dealing with preference screens and working with DB queries.
VisualFox-FX is an animation and visual effect library for Google Web Toolkit that leverages CSS3. VisualFox-FX supports JavaScript, CSS3, and hybrid mode (mixing JavaScript and CSS3 animation). VisualFox-FX uses the concept of a channel, which provides an extra layer of flexibility (allowing you to daisy-chain your animation). VisualFox-FX works directly with Element instead of Widget for added flexibility.
Spring Batch Advanced Launcher (SBAL) is a tool based on Spring Batch. It allows launching batches from the command line. A set of advanced functionality is provided to allow enterprise deployment as an alternative to the CommandLineJobRunner. it provides advanced features like displaying the batch version, running resource validations, and configuring logging. It also defines a standard directory structure for deployments.
lib4d_sql is a C library that provides the required functions (connect, prepare, execute, etc.) for writing an SQL client for 4D databases. It uses the public 4D SQL protocol, which is supported by 4D products since version 11. It is already used by the PDO_4D Open Source project, and it might be used to provide others drivers for JDBC, ADO, or ActiveRecord.
jWeb1T is an Java tool for efficiently searching n-gram data in the Web 1T 5-gram corpus format. It is based on a binary search algorithm that finds the n-grams and returns their frequency counts in logarithmic time. As the corpus is stored in many files, a simple index is used to retrieve the files containing the n-grams.