4 projects tagged "Linux"
Updated 10 May 2010
InteLib
| Pop | 81.42 |
|---|---|
| Vit | 8.91 |
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++.
Updated 02 Jan 2012
Open Tool Kit
| Pop | 146.71 |
|---|---|
| Vit | 15.81 |
Open Tool Kit (Otk) is a portable widget library for making graphical user interfaces for C programs. It emphasizes simplicity for the application programmer without eliminating capability. Based on OpenGL, Otk supports Linux, Unix, and other OSs neutrally and efficiently. It is simple and compact, and it strives for easy compilation and linking to other applications. In seeking to address several issues associated with earlier graphics APIs, Otk explores some interesting methods, such as window-relative layout instead of pixel-based layout.
Updated 23 Mar 2010
mapnik
| Pop | 101.35 |
|---|---|
| Vit | 5.67 |
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.
Updated 18 Apr 2010
stx::CBTreeDB
| Pop | 18.57 |
|---|---|
| Vit | 1.00 |
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.
