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
Eliminate binary trees #3
Comments
@wczekalski You're right. It was cool to make those functions with the binary tree but this is the wrong use case. Maybe |
I will also refactor those lines to make them more readable. |
set is the fastest one from collection types. |
Cool, looking forward to it. |
fixed in #4 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
@maartenschumacher Time Profiler clearly shows that binary trees are the problem in the game. Multiple conversions between trees and arrays are simply slow. I tried to solve this issue but I don't know enough about game logics to do it. Namely this and this line were too misterious for me to fix it.
The text was updated successfully, but these errors were encountered: