> but note that that table has a worst case time for dictionary lookups of O(n), so it does grow as the dictionary grows.

Yes - I'm not 100% but I think that is when you have hash collisions.

Ok, I'll keep the dictionary. Thanks for the update.