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

Use of Memory Efficient Data Structures Micro-Optimization #1785

Open
CamiloFallaM opened this issue May 27, 2023 · 0 comments
Open

Use of Memory Efficient Data Structures Micro-Optimization #1785

CamiloFallaM opened this issue May 27, 2023 · 0 comments

Comments

@CamiloFallaM
Copy link

CamiloFallaM commented May 27, 2023

Hi Kickstarter Team

My name is Camilo Falla and I´m a student at Universidad de Los Andes in Bogotá, Colombia studying Computer Science. I had the opportunity to take a look into the Kotlin repository in GitHub and found some micro-optimization ideas I would like to share with you. The ideas have to do with the use of memory efficient data structures. In the file TrackingClientType.kt I found that HashMaps were used but the order of the added values was always the same. In that sense, you could use an ArrayList to save thee values in the know order without having to save the keys into memory, having a better performance and memory consumption.

This would be the changes I would make on the file:

image

image

I think this micro-optimization would have a positive impact on the general application´s memory consumption. We hope you can take it into account in the future!

Best regards,
Camilo Falla, Carlos Silva, Juan José Beltrán

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

No branches or pull requests

1 participant