Search Results for "algorithms containers"

(New version 1.04 is released) Dynamic Arrays is a set of useful very 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). Give it a try and let me know how...

20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.

fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.

The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.