InteLib is a library of C++ classes that lets you do Lisp/Scheme programming within your C++ programs, even without any additional preprocessing, without all those calling conventions. You can write code that is accepted by a C++ compiler while thinking in a "Lisp/Scheme mode", and the code you write will look much like Lisp/Scheme code, although it will be pure C++.
Opticks Extras is a set of official extensions for the Opticks application. The Spectral Processing extension adds multi-spectral and hyper-spectral processing capability to Opticks. The IDL Scripting extension integrates an IDL interpreter directly into the Opticks application. The Python Scripting Extension integrates a Python interpreter directly into the Opticks application.
Qanava is a C++ library designed to display graphs on a Qt canvas. Qanava provide classes to generate various layouts of directed graphs and visualize their nodes with custom styles on a graphic canvas. Qanava is designed for applications with basic graph visualization needs such as Gantt charts, social networks, and document or network modelling applications. It is not meant for a complex interactive visualization of very large data sets.
Mapnik is a toolkit for developing GIS applications. At the core is a C++ shared library providing algorithms/patterns for spatial data access and visualization. Essentially a collection of geographic objects (map, layer, datasource, feature, and geometry), the library doesn't rely on "windowing systems" and can be deployed in any server environment. It is intended to play fair in a multi-threaded environment and is aimed primarily, but not exclusively, at Web-based development. High-level Python bindings (boost.python) facilitate rapid application development, targeting zope3, django, etc.
The stx::CBTreeDB is a collection of C++ classes with which read-only key-value database files can be created and read. A database efficiently maps a large number of integral fixed-length keys to opaque binary value blobs. Variable-length or duplicate keys are currently not supported. Keys are organized into a highly compact index structure, which is very similar to a B-tree and allows very fast key lookups. Both keys and values are stored in order and thus queries in a local proximity can benefit from caching effects. All applications mapping a large number of constant, integral keys to string or data blobs can benefit from this library.