Advertisement
Guest User

Untitled

a guest
Sep 21st, 2017
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.52 KB | None | 0 0
  1. diff --git a/nova/compute/instance_list.py b/nova/compute/instance_list.py
  2. index 28ccd69..c54f349 100644
  3. --- a/nova/compute/instance_list.py
  4. +++ b/nova/compute/instance_list.py
  5. @@ -90,15 +90,14 @@ def get_instances_sorted(ctx, filters, limit, marker, columns_to_join,
  6. sort_keys, sort_dirs):
  7. """Get a cross-cell list of instances matching filters.
  8.  
  9. - This iterates cells in parallel generating a unified and sorted list of
  10. - instances as efficiently as possible. It takes care to iterate the list
  11. - as infrequently as possible. Because of the way scatter_gather_all_cells()
  12. - works, we have collapsed the DB result set into a single list before
  13. - returning from the thread, so we take that opportunity to wrap the results
  14. - in InstanceWrapper objects so that they are sortable by heapq.merge(),
  15. - which requires that the '<' operator just works. We encapsulate our
  16. - sorting requirements into an InstanceSortContext which we pass to
  17. - all of the wrappers so they behave the way we want.
  18. + This iterates cells in parallel generating a unified and sorted
  19. + list of instances as efficiently as possible. It takes care to
  20. + iterate the list as infrequently as possible. We wrap the results
  21. + in InstanceWrapper objects so that they are sortable by
  22. + heapq.merge(), which requires that the '<' operator just works. We
  23. + encapsulate our sorting requirements into an InstanceSortContext
  24. + which we pass to all of the wrappers so they behave the way we
  25. + want.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement