Dynamic Arrays and Hashes (Delphi, C++) / News: Recent posts

Dynamic Arrays and Hashes has been released with bunch of improvements and fixes.

Most changes are made in Delphi classes, less in C++.

Delphi

• Added the following sorting methods: Bubble, Selection sort, Insertion sort, Shaker, QuickSort.
• Added new classes THArrayUInt64, THArrayShortInt, THArrayCardinal (as alias for THArrayLongWord), THArrayExtended, THArraySingle
• Many optimization and improvements in THArrayStringFix and THArrayAnsiStringFix classes
• Added type InnerType into THarray and all descendants. Makes it easier to get to know type of stored values in the particular array
• Key array has replaced by THArraySorted<K> to improve performance of IndexOf calls
• Added methods Pop and Push into THarray
• Added new class TMyComparer<T> for testing SortedArray methods in a generic way
• THArraySorted<T> divided into two classes THArraySorted<T> and THArraySorted<T; CmpT: TComparer<T>>. First class accepts one type parameter, second class - two type parameters. If you want to define your own comparing function it is easier to use THArraySorted with two type parameters.
• Added possibility to specify Comparer in constructor in THArraySorted<T> class. If not specified then default is used TComparer<T>.Default
• Added Assign() method that copies all data from TArray<T>
• THash: added GetPair function that returns both Key and Value
• Updated many existing tests, added huge number of new ones.
• Project with tests divided into two projects: DynamicArraysTests - for testing new classes from DynamicArray.pas unit and DynamicArraysOTests - for testing old classes from DynamicArrays.pas unit.
• Added method Find().
• Added more descriptions for methods. Made it clearer for the new people.... read more

Dynamic Arrays and Hashes 1.04 has been released with bunch of improvements and fixes.

Most changes are made in Delphi classes now:

• Fixes in THArrayG.QuickFind method.
• THArrayG: Added new sorting algs.
• Added tests on sorting algs
• Added GetValuePointer method to THash<k,v> that can be useful from performance point of view</k,v>
• DynamicArrays.pas - many formatting changes, fixed compiler warnings, fixed bugs discovered by new tests, strings moved to resource strings
• DynamicArrays.pas - added assembler functions for 64bits

Give it a try and let us know how it goes!

After long time we have released new version of Dynamic Arrays with bunch of improvements and fixes.

Now Delphi and C++ code can be compiled with latest version of dev tools (VS Studio 2022, RAD Delphi 11.3-12.2, Linux GNU compiler).

Changes in Delphi:

• Added generic container THArrayG<T>. No need to have dozen of containers for each data type.
• Added generic THash<K, V> and THash2<K1, K2, V> containers
• New THash and THas2 classes use new class THArraySorted<T> to increase performance IndexOf() operations in Hash classes.
• Added many unit tests to make sure that everything works smoothly
  
  Changes in C++:
• Many code refactorings and bug fixes in existing classes. Most of these changes do not break existing interfaces though. So, you can continue using arrays and hashes in your applications.
• Added THArraySorted<T> container that always contain sorted data.
• THArraySorted<T> is now used in THash and THash2 classes to increase performance IndexOf() operations
  
  Give it a try and let us know how it goes!

DynamicArrays is a powerful set of classes for storing and manipulation arrays of various types.
DynamicArrays are available on Delphi and on C++ programing languages.
Support of all Delphi data types!

In this release added implementation of DynamicArrays for Delphi 4,5,6,7.
Added documentation for C++ (english, russian) and for Delphi (only russian right now). The English documentation is coming soon.

Dynamic Arrays it is a set of classes to store and manipulate collections of data any type (int, double, any custom class and etc.)
Very handy and usable.

Minor changes:
Fixed crash bug in a copy constructor.
Several other bugs were fixed.
See release changelog for details.

Dynamic Arrays it is a set of classes to store and manipulate collections of data any type (int, double, any custom class and etc.)
Very handy and usable.

All classes are protected by tests.
Very fast and functional.
Reallocs of memory are minimized to improve performance.