> Dean Zobec wrote: > > As the project looks like a long term one and I think that fpc urgently > > needs a optimized hash table I'll also work on a streamlined hash table > > with a chaining technique as a collision resolution scheme and a paging > > for the allocation of the nodes in the chains, to have an associative > > container that would easily beat the TStringList in search speed when > > the number of items added is more than 100.000 (the IndexOf() function > > in an unordered TStringList does a linear search). > > A good hash class is even a candidate for the classes unit imo.
Something variants based is not though, at least IMHO. Note that the Technetium people (Flawless and Aison on IRC) have several of such routines. At least all the algo's are there and tested, only class wrapper would be needed. _______________________________________________ fpc-devel maillist - fpc-devel@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-devel
