KaHIP - Karlsruhe High Quality Partitioning - is a family of graph partitioning programs that tackle the balanced graph partitioning problem. It focuses on solution quality and implements flow-based methods, more-localized local searches, and several parallel and sequential meta-heuristics.
libtld is a library used to extract the TLD from a URI and to check email validity. This allows you to extract the exact domain name, sub-domains, and all the TLD (top level, second level, third level, etc.). The problem with TLDs is that you cannot know where the domain starts. Some domains can use one top-level domain, others use two, etc. However, it may be useful to know where the domain is to have the exact list of sub-domains. For example, if you want to force www. at the start of the domain name if no other sub-domains are specified, then you need to know exactly how many TLD are defined in a URI. The libtld offers one main function: tld(), which gives you a way to extract the TLD from any URI. The result is the offset where the TLD starts. This gives you enough information to extract everything else you need. For emails, the library is capable of parsing a string that represents a list of email addresses to be verified. The verification includes a check of the domain name and its TLD.
libpetey is a small scientific/numerical computation library. It includes the following components: templated sorting routines; templated binary tree classes; a templated linked-list class; routines for finding the k-least and k-greatest elements in an array; "supernewton", a one-dimensional root-finding algorithm based on cubic interpolation; a class for working with dates and times; a function for easy parsing of command line options; datasets (the beginnings of a data-representation paradigm that generalizes matrices but is mainly useful for n-dimensional linear interpolation); and sparse matrix library including command-line utilities for sparse matrix multiplication and eigenvalue decomposition as well as a sparse matrix calculator.
FastFlow is a pattern-based programming framework targeting streaming applications. It implements pipeline, farm, divide and conquer, and their composition, as well as generic streaming networks. It is specifically designed to support the development and the seamless porting of existing applications on multi-core, GPGPUs, and clusters of them. The layered template-based C++ design ensures flexibility and extendibility. Its lock-free/fence-free run-time support minimizes cache invalidation traffic and enforces the development of high-performance (high-throughput, low-latency) scalable applications. It has been proven comparable or faster than TBB, OpenMP, and Cilk on several micro-benchmarcks and real-world applications, especially when dealing with fine-grained parallelism and high-throughput applications.
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.