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

Feature/separate prefixsearch #28

Merged
merged 10 commits into from
Nov 17, 2023
Merged

Feature/separate prefixsearch #28

merged 10 commits into from
Nov 17, 2023

Conversation

adolgert
Copy link
Owner

This takes the Direct sampler and pulls out its prefix-search algorithm, also known as a scan algorithm, which is responsible for maintaining the sum of hazards while the hazards themselves can be disabled or changed. This PR creates a new algorithm I call a Keyed Prefix Search, which is a prefix search with a dictionary-like interface. It turns out that's what we need, and it encapsulates different variants of prefix search. Those variants can, for instance, optimize for sampling just a few clocks, optimize for sampling a semi-infinite set of clocks, or optimize for clocks whose keys are from 1 to N, where N is fixed. The idea for users of this is to say what their code needs, and they will get the right implementation.

@adolgert adolgert merged commit fd419db into main Nov 17, 2023
7 checks passed
@adolgert adolgert deleted the feature/separate-prefixsearch branch November 17, 2023 14:05
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.

1 participant