This page was generated automatically from The Delphi Super Page archive. If you have any remarks concerning this page please do not hesitate to mail me.
In your mail please do refer to your unique DSP author ID which is 0003508. This helps me to locate your data records in DSP databse.
 
Author/SiteName(Contact)e-mailHome Page
  Barry Kelly [email] 

 

 

Files

[ bkhash11.zip ] [ 9,187 bytes ] [ Freeware ] [ No Source ]
[ D2 | D3 | D4 | D5 ]
A fast associative array targeted specifically at create and looking up associations between strings and 32-bit untyped fields (usually pointers to records or classes).

  • Compromises in favor of speed: string - 32-bit pointer only
  • Has protected interface for custom memory allocation.
  • Supports function pointer and method pointer iteration
  • Plug-in different hash function
Examples: 
 hash.add('abc', myobject); TMyObject(hash['abc']).Whatever; if not hash.Find('abc', myobject) then .. TObject(hash.remove('abc')).Free; // removes and frees without temp hash.Iterate(nil, Iterate_FreeObjects);
Added: 31-08-2000   |  Version: 1.1   |  Downloads: 4036/4036/2
Author:Barry Kelly   [DSP files]

 

© 1995-2006 Robert M. Czerwinski ( The Delphi Super Page a.k.a. DSP ).
All rights reserved.