[Python-Dev] Compact dict implementations (was: PEP 468 (original) (raw)
INADA Naoki songofacandy at gmail.com
Sat Jun 18 13:55:45 EDT 2016
- Previous message (by thread): [Python-Dev] Compact dict implementations (was: PEP 468
- Next message (by thread): [Python-Dev] Compact dict implementations (was: PEP 468
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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 <songofacandy at gmail.com>
- Previous message (by thread): [Python-Dev] Compact dict implementations (was: PEP 468
- Next message (by thread): [Python-Dev] Compact dict implementations (was: PEP 468
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]