Search Results for "hash data"

(New version 1.05 is released) Dynamic Arrays is a set of useful incredibly fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). ...

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

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.