The HshdList unit is a realization of hashed lists also called as hash-arrays or associated arrays for Borland Delphi.

A hashed list is an array of items where each item can be idenified by the unique name. (Not by the integer number). Hashing is used to increase the speed to access items in list. Prior to including an item into a list the hashsum (MD5 in this example) of a name is calculated. And new item is placed into a list to keep the order of hashsums.

Searching an item by specified name compares only sorted hashsums, not unsorted string names. To customize list it is need to code one class descentant and create an instance of list specifying the name of items class only!