[英]How to create a sorted dictionary in Python by key (alphabetically)
从 Python 3.7 开始,字典是“有序的”,其中迭代基于“插入顺序”。
我想要 Python 中的字典,其中迭代基于键的字母顺序,即字典按字母顺序排序。
即以下字典:
dictionary = {}
dictionary["b"] = 1
dictionary["a"] = 2
将导致以下 output:
for key in dictionary:
print(key) # a, b
是否有一些内置的 Python class 用于“排序字典”,类似于我们如何使用OrderedDict
插入顺序?
注意:我不认为这是任何现有问题的重复,这些问题似乎只提到:
我做了很多谷歌搜索,但找不到答案。
实际上有一个解决方案,来自 Mark Summerfield:使用 Python 进行快速 GUI 编程,我会谦虚地把它转移到这里。 对马克的所有尊重:)
import bisect
class CustomOrderedDict(object):
def __init__(self, dictionary=None):
self.__keys = {}
self.__dict = []
if dictionary is not None:
if isinstance(dictionary, CustomOrderedDict):
self.__dict = dictionary.__dict.copy()
self.__keys = dictionary.__keys[:]
else:
self.__dict = dict(dictionary).copy()
self.__keys = sorted(self.__dict.keys())
def getAt(self, index):
return self.__dict[self.__keys[index]]
def setAt(self, index, value):
self.__dict[self.__keys[index]] = value
return self.__dict[self.__keys[index]]
def __getitem__(self, key):
return self.__dict[key]
def __setitem__(self, key, value):
if key not in self.__dict:
bisect.insort_left(self.__keys, key)
self.__dict[key] = value
def __delitem__(self, key):
i = bisect.bisect_left(self.__keys, key)
del self.__keys[i]
del self.__dict[key]
def setdefault(self, key, value):
if key not in self.__dict:
bisect.insort_left(self.__keys, key)
return self.__dict.setdefault(key, value)
def pop(self, key, value=None):
if key not in self.__dict:
return value
i = bisect.bisect_left(self.__keys, key)
del self.__keys[i]
return self.__dict.pop(key, value)
def popitem(self):
item = self.__dict.popitem()
i = bisect.bisect_left(self.__keys, item[0])
del self.keys[i]
return item
def has_key(self, key):
return key in self.__dict
def __contains__(self, key):
return key in self.__dict
def __len__(self):
return len(self.__dict)
def keys(self):
return self.__keys[:]
def values(self):
return [self.__dict[key] for key in self.__keys]
def __iter__(self):
return iter(self.__keys)
def iterkeys(self):
return iter(self.__keys)
def itervalues(self):
for key in self.__keys:
yield self._dict[key]
def iteritems(self):
for key in self.__keys:
yield key, self.__dict[key]
def copy(self): # shallow copy
dictionary = CustomOrderedDict()
dictionary.__keys = self.__keys[:]
dictionary.__dict = self.__dict.copy()
return dictionary
def clear(self):
self.__keys = []
self.__dict = {}
def __repr__(self):
pieces = []
for key in self.__keys:
pieces.append("%r: %r" % (key, self.__dict[key]))
return "CustomOrderedDict({%s})" % ", ".join(pieces)
t = CustomOrderedDict(dict(s=1, a = 2, b =100, c = 200))
print t
结果:
CustomOrderedDict({'a': 2, 'b': 100, 'c': 200, 's': 1})
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.