>> Another idea (though it has several issues and seems like a step backward): >> a split-table dict can have a separate iteration list, indexing into the >> entry table. There are ways to share iteration lists, and make it so that >> adding the same keys in the same order each time results in the same >> iteration list each time, but this costs overhead. There might be ways of >> reducing the overhead, or the overhead might be replacing bigger overhead, >> but we should decide if the behavior is what we want in the first place. >> > > I'll test some ideas. > > But for now, I'll update http://bugs.python.org/issue27350 to stop key > sharing when > order is different. (a. deletion is not allowed, and insertion order > must be same). > > It may reduce key sharing rate, but total memory usage must not increase so > much thanks to compact dict.
I did it. issue27350 is now ordered for key sharing dict, too. -- INADA Naoki <songofaca...@gmail.com> _______________________________________________ Python-Dev mailing list Python-Dev@python.org https://mail.python.org/mailman/listinfo/python-dev Unsubscribe: https://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
