> Dict access should probably be documented as no worse > than O(log n) to allow for tree implementations. That should not be documented. The current dict implementation may use O(n) for lookup operations, where n is the number of keys in the dictionary, and counting comparison operations. Regards, Martin