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.

Sign up for GitHub

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

Jump to bottom

Find a memory efficient replacement of BinaryHeap #918

Open
bvssvni opened this issue Nov 21, 2020 · 0 comments
Open

Find a memory efficient replacement of BinaryHeap #918

bvssvni opened this issue Nov 21, 2020 · 0 comments
Labels
discussion

Comments

@bvssvni
Copy link
Contributor

bvssvni commented Nov 21, 2020

Currently, every equivalence found under automated theorem proving is added to a BinaryHeap.

Every traversed equivalence is added to a HashSet. This could be replaced by a Cuckoo filter, by choosing a sufficient low positive false rate.

It is much harder to find a replacement of BinaryHeap. However, the overall idea is to compress the memory.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
discussion
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@bvssvni