Search Results for "reference"

The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. ...

...The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks

MDSTk is a collection of 2D/3D image processing tools aimed at medical images. It contains routines for volume data processing (3D filtering, segmentation, etc.) as well as fast low-level vector graphics library for surface and tetrahedral meshing. MDSTk has been forked by 3Dim Laboratory s.r.o. to provide better support and further push its development forward. Please check VPL (Voxel Processing Library) project available on Bitbucket (https://bitbucket.org/3dimlab/vpl).