Zyan Communication Framework simplifies development of distributed applications. It works on Windows, Linux, Mac OS, and Android platforms via .NET or Mono runtimes. It features LINQ support for three-tier applications, full duplex TCP support, traffic, compression, and encryption, transparent support for events and EBC (event-based components), and Windows and LDAP authentication support.
AlgART Libraries is a collection of Java libraries, supporting generalized smart arrays and matrices with elements of any types, including a wide set of of 2D, 3D, and multidimensional image processing and other algorithms. Main features: 64-bit long int indexes, a memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multi-threading optimization for multi-core processors, etc.
Pascal-P4 for Free Pascal and Delphi is a port of a Pascal compiler written at ETH Zurich in 1976. The source code of the compiler is documented in the book "Pascal Implementation" by Steven Pemberton and Martin Daniels. The purpose of this project is to make Pascal-P compilable by Free Pascal and Delphi while keeping the changes to a minimum and preserving the line numbering as much as possible.
QtWebSockets is a pure Qt implementation of WebSockets, both client and server. It is implemented as a Qt source code module (.pri file) that can easily be embedded into existing Qt projects. It has no dependencies other than Qt. It features text and binary sockets, frame-based and message-based signals, proxy support, and strict Unicode checking.
Opensort is general purpose sorting software that aims to be a fast and easy solution for the sorting of large or small data-sets and data manipulation in general. It is still in the early stages of development and lacks many of the advanced features its commercial counterparts have. For the moment, it only provides a simple command line interface and a C library other programs can use to cover some basic needs for data sorting.
Capsule Tree is a general purpose, self-balancing tree data structure for large, ordered data sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees.
Midao JDBC simplifies development with Java JDBC. It is flexible, customizable, and simple/intuitive to use, and provides a lot of functionality: transactions, working with metadata, type handling, profiling, input/output processing/converting, pooled datasource libraries support, cached/lazy query execution, named parameters, multiple vendor support out of the box, custom exception handling, and overrides. With a single jar, it supports both JDBC 3.0 (Java 5) and JDBC 4.0 (Java 6). Midao JDBC is well tested. Not only does it have around 700 unit and functional tests, but it's also tested with the latest drivers of Derby, MySQL (MariaDB), PostgreSQL, Microsoft SQL, and Oracle. Midao is a data-centric project. Its goal is to shield Java developer from nuances of vendor implementation and standard boilerplate code. Midao JDBC is the first library released under it.