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

Investigate replacing Set with François Pottier's sets from the baby library #1525

Open
michael-schwarz opened this issue Jun 25, 2024 · 1 comment
Labels
performance Analysis time, memory usage student-job

Comments

@michael-schwarz
Copy link
Member

It supposedly offers several performance advantages over the normal Set.

https://discuss.ocaml.org/t/ann-first-release-of-baby/14840

@michael-schwarz michael-schwarz added the performance Analysis time, memory usage label Jun 25, 2024
@sim642
Copy link
Member

sim642 commented Jun 25, 2024

More broadly, it might be worth experimenting with alternatives to various data structures like Maps (although the baby library doesn't yet have them) or Hashtbls.
This includes both libraries that may already be in the OCaml ecosystem or something else. I recall an Astree paper claiming how a choice of data structure was crucial for their performance.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
performance Analysis time, memory usage student-job
Projects
None yet
Development

No branches or pull requests

2 participants