You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If a parametrized fixture generates n items, then reorder_items will have roughly O(n^2) performance. Slice items is called for each item and then iterates over the list of items to find matching groups. We can improve this by pre-caching items by fixture (like argkeys_cache but in reverse).
I've already got code ready for a pull request, I'm just making this issue for record-keeping / discussion.
The text was updated successfully, but these errors were encountered:
If a parametrized fixture generates n items, then reorder_items will have roughly O(n^2) performance. Slice items is called for each item and then iterates over the list of items to find matching groups. We can improve this by pre-caching items by fixture (like argkeys_cache but in reverse).
I've already got code ready for a pull request, I'm just making this issue for record-keeping / discussion.
The text was updated successfully, but these errors were encountered: