Skip to content

NH-3037: ActionQueue Insertion sort performance degrades exponentially #67

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 3 commits into from

Conversation

mike-spencer
Copy link
Contributor

More or less a line for line port of the improvements found in HHH-2957.

@hazzik
Copy link
Member

hazzik commented May 18, 2012

It whould be great if you provide a test case for this issue.

@mike-spencer
Copy link
Contributor Author

Many of the existing testcases already perform effective functional tests for the change, so I added a few testcases to benchmark sorting different #s of insert actions. On my machine and the original implementation, the performance starts to noticeably slow down at around 10000 pending insert actions, taking approximately 1s to perform the sort. 40000 pending insert actions would take approximately 30s. With the implementation included in this fix, 10000 inserts takes 0.015s to sort and 40000 takes 0.025s.

@hazzik hazzik closed this in 2247a35 Jul 3, 2012
@hazzik
Copy link
Member

hazzik commented Jul 3, 2012

Thanks, applied

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants