869
Comment:
|
877
l should be decorated
|
Deletions are marked like this. | Additions are marked like this. |
Line 24: | Line 24: |
sorted = [dict_ for (key, dict_) in l] | sorted = [dict_ for (key, dict_) in decorated] |
Sorting Lists of Dictionaries
Frequently you want to sort a list of dictionaries, based on some particular key.
For example:
There are many ways to do this. Here's the fastest way to do it, as it avoids using a custom comparison function, instead using builtin comparisons. This is the decorate-sort-undecorate pattern, or the Schwartzian transform if you're coming from Perl.
(The variable was named dict_ because dict is already a builtin.)