> > Ordered, or just initially ordered? I mean, "ordered if no deletion". >
I implemented "ordered". Because: * "orderd" is easier to explain than "ordered if no deletion". * I don't want to split sparse index hash and dense entry array. In case of very small dict, index hash (8byte) and first two entries (24*2=48byte) can be on one cache line. * Easy to implement "split dictionary" (aka. key sharing dictionary). You can see what I implemented in here. https://github.com/methane/cpython/pull/1/files -- 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
