Skip to content

Conversation

@mperikov
Copy link
Collaborator

No description provided.

using pixie::LoudsNode;
using pixie::LoudsTree;

TEST(LoudsTreeTest, Basic) {
Copy link
Owner

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).
Copy link
Owner

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.

Copy link
Owner

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?

Copy link
Owner

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

Copy link
Owner

@Malkovsky Malkovsky left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LOUDs construction isn't

@Malkovsky Malkovsky merged commit 46ee754 into main Jan 12, 2026
8 of 11 checks passed
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

Successfully merging this pull request may close these issues.

3 participants