Very fast classes for working with Dynamic Arrays in Delphi and C++
(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...
I took a fork and ported to Lazarus The Delphi Containers library. I called it Containers library for Lazarus. DCL is a free library that provides ArrayList, LinkedList, Vector, HashMap, HashSet, ArraySet, Queue and Stack structures to Delphi/Kylix.It also provides algorithms like in STL (Apply, Found, CountObject, Copy, Generate, Fill, Reverse, Sort...).
DCLX is a free library that provides ArrayList, LinkedList, Vector, HashMap, HashSet, ArraySet, Queue and Stack structures to Delphi/Kylix.
It also provides algorithms like in STL (Apply, Found, CountObject, Copy, Generate, Fill, Reverse, Sort...).
The Delphi Container and Algorithm Library (DeCAL) is a powerful library of reusable container classes, generic algorithms, and an easy to use persistence mechanism. It is similar to and based on Stepanov's STL.