提交 54af1a88 authored 作者: Matthew Rocklin's avatar Matthew Rocklin

replace dict comprehensions with `dict` calls

This is for python2.5
上级 869d2cb5
...@@ -68,7 +68,7 @@ def _toposort(edges): ...@@ -68,7 +68,7 @@ def _toposort(edges):
[2] http://en.wikipedia.org/wiki/Toposort#Algorithms [2] http://en.wikipedia.org/wiki/Toposort#Algorithms
""" """
incoming_edges = reverse_dict(edges) incoming_edges = reverse_dict(edges)
incoming_edges = {k: set(val) for k, val in incoming_edges.items()} incoming_edges = dict((k, set(val)) for k, val in incoming_edges.items())
S = set((v for v in edges if v not in incoming_edges)) S = set((v for v in edges if v not in incoming_edges))
L = [] L = []
...@@ -104,8 +104,8 @@ def posort(l, *cmps): ...@@ -104,8 +104,8 @@ def posort(l, *cmps):
[0, 8, 2, 4, 6, 1, 3, 5, 7, 9, 16, 18, 10, 12, 14, 17, 19, 11, 13, 15] [0, 8, 2, 4, 6, 1, 3, 5, 7, 9, 16, 18, 10, 12, 14, 17, 19, 11, 13, 15]
implemented with _toposort """ implemented with _toposort """
comes_before = {a: set() for a in l} comes_before = dict((a, set()) for a in l)
comes_after = {a: set() for a in l} comes_after = dict((a, set()) for a in l)
def add_links(a, b): # b depends on a def add_links(a, b): # b depends on a
comes_after[a].add(b) comes_after[a].add(b)
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论