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

[Feature] Implementing self-balanced tree in order to keep all facets #31

Open
Rassska opened this issue Aug 28, 2022 · 0 comments
Open

Comments

@Rassska
Copy link

Rassska commented Aug 28, 2022

Hi there!

I just briefly checked the code and realized that in order to keep all facets current diamond version uses a dynamically allocated array and simple mapping for getting O(1) per getFacet() query. What if we could simply store everything in a tree in order to get O(log n) for getFacet() query without having a need to allocate an array and mapping(it looks kind of crutch in a code)?

Thanks!

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