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

IdpfCache implementation using a binary tree #925

Open
divergentdave opened this issue Jan 31, 2024 · 2 comments
Open

IdpfCache implementation using a binary tree #925

divergentdave opened this issue Jan 31, 2024 · 2 comments

Comments

@divergentdave
Copy link
Contributor

Chris suggested adding an IdpfCache implementation that uses a binary tree, as the cached values are arranged in a tree already. Note that this will have to sparsely populated, because the full binary tree may get impractically large.

@cjpatton
Copy link
Collaborator

I suspect this will be the most efficient option for VIDPF.

@armfazh
Copy link
Contributor

armfazh commented Mar 21, 2024

In #978, I implemented a binary tree for this purpose.

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

3 participants