mike meyer tlfmiredorg wed 02 apr 2008 043705 0200 martin v löwis wrote unless misinterpreting sounds like burden proof falls option keep status quo thing seems outside observer look situation might ask names changed current behavior functional one clamoring change think fairly obvious 2x keys change wasteful actually build list keys dictionary even values create tuples well want iterate common operation keys iterate look right id say clear two reasons one pretty much never use keys loop use dictionary applications take snapshot keys rare right second dont think rare want process keys sorted order exactly common keys mydictkeys keyssort key keys fact 25 standard library turns 3 occurrences keyssort given thats ones used obvious name list sorted nowdays tend write keys sortedmydictkeys yeah know keys redundant key keys maybe key sortedmydict probably slower original version unless sorted switches insertion sort passed generator direct name used common scenario loop ie people dont think issue likely right thing 2x case id say direct name use dictionary iterator directly dont think way dont think get right thing 2x 30 given dictionary iterator use cases wanting result keys method returning iterator cant use dictionary thought assignment might one second reference dictionary behave way cases youd use dict_keys hmm dict_keys__xor__ httpwwwmiredorgconsultinghtml independent networkunixperforce consultant email information _______________________________________________ python3000 mailing list python3000pythonorg httpmailpythonorgmailmanlistinfopython3000 unsubscribe httpmailpythonorgmailmanoptionspython3000python300040tangomucom tue 05 aug 2008 034849 0400 python3000 spooky behavior dictitems friends