In our previous episode, Maciej Izak said: > > > My results for FPC and TDictionary from Generics.Collections ( > https://github.com/dathox/generics.collections ):
If you need the in-order capacity of tstringlist then you can use http://www.stack.nl/~marcov/genlight.pas - It is iterator based though, no array access to keys. - Slower than most map solutions. - faster than (ordered) tstringlist. - Some tests indicate that the TStringlist slowdown is postponed from a few 100k to say 5M elements. (then you would need another level of indirection, though blocksize tweaking might buy you an order more) - iirc duplicates are always ignores. I need to fix that proprely sometime _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
