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

Do fewer linear searches of element stacks #84

Open
kmcallister opened this issue Feb 2, 2015 · 1 comment
Open

Do fewer linear searches of element stacks #84

kmcallister opened this issue Feb 2, 2015 · 1 comment

Comments

@kmcallister
Copy link
Contributor

e.g. the open elements or active formatting elements. We search these when looking for elements in various scopes, and #77 adds more.

We could track open elements with a bitvector for each scope. Checking if one of a set of elements is open in a particular scope would be a simple bitmask test. We can choose bit patterns to match the static atom indices as well.

We should find an abstraction that makes it hard to screw up the book-keeping.

@BurgundyWillow
Copy link

I wanted to know if this is still an issue, and I would like to work on this. In #77 I did not see any pull requests/commits resolving this specific request, and wanted to confirm the same.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants