Description of Fast Hash Linked List unit :
Sometimes you need a list of items but cannot use an array or TList efficiently. For example: You have an MRU (Most Recently Used) cache with many items in it. Placing an item in front becomes very expensive. Linked lists can be used in these situations. The lists allow for associative access via hash tables on ID, Name, none or both (four list/item class pairs provided). The list can be sorted on anything very efficiently, making only minimal amounts of compares.Now with HTMLHelp and test application
ASP
