Search Results for "data structures"

Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. ...

Containers to extend STL: graph, tree, matrix, smart-pointer. Persistence (serialisation) of C++ data structures. Portability: subprocesses, TCP, file system. Reusable subsystems: library manager, message handler. Portable between OSs and compilers. Documentation is included in the download and is also available on the STLplus website http://stlplus.sourceforge.net. The headers are intended to be readable, so look at them too for usage information on each function and class.

With this library we provide useful data structures and algorithms for common programming tasks in the C language.

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. Implementations of some lock-free shared data structures are provided.

Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision.

*** THIS PROJECT HAS MOVED TO GITHUB *** https://github.com/frozen-solid/CSharp_MARC/ ********************************************************** C# MARC: C# class structures for reading and manipulating Library of Congress MARC records using the MARC21 standard. Based upon the PHP Pear package File_MARC (http://pear.php.net/package/File_MARC) by Dan Scott. C# MARC Editor: A full featured SQLite based editor for quickly modifying MARC records and exporting them to MARC21 or MARCXML.

Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. 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