for k, v in data.items():
v.discard(k) # Ignore self dependencies
extra_items_in_deps = reduce(set.union, data.values()) - set(data.keys())
for k, v in data.items():
v.discard(k) # Ignore self dependencies
extra_items_in_deps = reduce(set.union, data.values()) - set(data.keys())
- data.update({item:set() for item in extra_items_in_deps})
+ data.update(dict([(item, set()) for item in extra_items_in_deps]))
while True:
ordered = set(item for item,dep in data.items() if not dep)
if not ordered:
break
for item in sorted(ordered):
yield item
while True:
ordered = set(item for item,dep in data.items() if not dep)
if not ordered:
break
for item in sorted(ordered):
yield item
- data = {item: (dep - ordered) for item,dep in data.items()
- if item not in ordered}
+ data = dict([(item, (dep - ordered)) for item,dep in data.items()
+ if item not in ordered])
assert not data, "A cyclic dependency exists amongst %r" % data
def sort_dependencies(messages):
assert not data, "A cyclic dependency exists amongst %r" % data
def sort_dependencies(messages):
for part in generate_source(headerbasename, enums, messages):
source.write(part)
for part in generate_source(headerbasename, enums, messages):
source.write(part)
-
\ No newline at end of file