-
Notifications
You must be signed in to change notification settings - Fork 0
Louds implementation #26
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
base: main
Are you sure you want to change the base?
Conversation
| using pixie::LoudsNode; | ||
| using pixie::LoudsTree; | ||
|
|
||
| TEST(LoudsTreeTest, Basic) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Need at least a test of the size corresponding to several superblocks
| ### Реализация | ||
|
|
||
| Level Order Unary Degree Sequence - сжатое представление дерева в виде последовательности битов длины 2n-1. | ||
| Идея взята из [sdsl](https://github.com/simongog/sdsl-lite/blob/master/include/sdsl/louds_tree.hpp). |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Всё-таки LOUDs -- это вот эта диссертация
Jacobson G. Space-efficient static trees and graphs //30th annual symposium on foundations of computer science. – IEEE Computer Society, 1989. – С. 549-554.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is it measured in 1e9 ns? Maybe make it in seconds then?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Also, seems like log scale for y is needed here
No description provided.