Eric Snow added the comment: > It means rebuilding hash table to clean up dummy entries. > So, even when dict size is not increasing, remove + insert loop has > worst case O(n), amortized O(1) complexity.
Ah, so it matches the pure Python implementation then. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue31265> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
