Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- diff --git a/nova/compute/instance_list.py b/nova/compute/instance_list.py
- index 28ccd69..c54f349 100644
- --- a/nova/compute/instance_list.py
- +++ b/nova/compute/instance_list.py
- @@ -90,15 +90,14 @@ def get_instances_sorted(ctx, filters, limit, marker, columns_to_join,
- sort_keys, sort_dirs):
- """Get a cross-cell list of instances matching filters.
- - This iterates cells in parallel generating a unified and sorted list of
- - instances as efficiently as possible. It takes care to iterate the list
- - as infrequently as possible. Because of the way scatter_gather_all_cells()
- - works, we have collapsed the DB result set into a single list before
- - returning from the thread, so we take that opportunity to wrap the results
- - in InstanceWrapper objects so that they are sortable by heapq.merge(),
- - which requires that the '<' operator just works. We encapsulate our
- - sorting requirements into an InstanceSortContext which we pass to
- - all of the wrappers so they behave the way we want.
- + This iterates cells in parallel generating a unified and sorted
- + list of instances as efficiently as possible. It takes care to
- + iterate the list as infrequently as possible. We wrap the results
- + in InstanceWrapper objects so that they are sortable by
- + heapq.merge(), which requires that the '<' operator just works. We
- + encapsulate our sorting requirements into an InstanceSortContext
- + which we pass to all of the wrappers so they behave the way we
- + want.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement