Skip to content
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

Performance improvement #75

Merged
merged 1 commit into from Dec 12, 2014
Merged

Performance improvement #75

merged 1 commit into from Dec 12, 2014

Conversation

jmurciego
Copy link

Bubble sort algorithm over a double linked list has poor performance,
making the javaparser unusable in large projects.

This ugly refactor avoid the issue, reducing the complexity to O(n^2)

Bubble sort algorithm over a double linked list has poor performance,
making the javaparser unusable in large projects.

This ugly refactor avoid the issue, reducing the complexity to O(n^2)
@matozoid matozoid added this to the 2.0.0 milestone Dec 12, 2014
matozoid added a commit that referenced this pull request Dec 12, 2014
@matozoid matozoid merged commit 9c8c77d into javaparser:master Dec 12, 2014
@matozoid
Copy link
Contributor

That's an ugly sort :-O Let's open an issue to fix this more thoroughly.

@ftomassetti
Copy link
Member

I think I could have been the culprit of that awful sort... thanks for deleting that shame!

@sebastiankirsch sebastiankirsch added the Improvement Not a bug, but a way that JP can be be enhanced to work better. label Mar 2, 2015
@sebastiankirsch sebastiankirsch modified the milestones: 2.1, 2.0.0 Mar 2, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Improvement Not a bug, but a way that JP can be be enhanced to work better.
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

4 participants