You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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!
The text was updated successfully, but these errors were encountered:
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!
The text was updated successfully, but these errors were encountered: