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

fix: Bitv and large_enough #23

Merged
merged 1 commit into from
Dec 23, 2023
Merged

fix: Bitv and large_enough #23

merged 1 commit into from
Dec 23, 2023

Conversation

FardaleM
Copy link
Collaborator

is_subset was used to check if two sets intersect. After correcting is_subset this broke the iteration on the Hullot tree.

The other change are more esthetical:

  • rename is_singleton to is_singleton_or_empty to reflexed what the implementation is doing
  • implement memdirectly using primitive fonction instead of is_subset

`is_subset` was used to check if two sets intersect. After correcting
`is_subset` this broke the iteration on the Hullot tree.
The other change are more esthetical:
 - rename `is_singleton` to `is_singleton_or_empty` to reflexed what the
   implementation is doing
 - implement `mem`directly using primitive fonction instead of
   `is_subset`
@FardaleM FardaleM mentioned this pull request Dec 23, 2023
@Drup Drup merged commit 3076b09 into master Dec 23, 2023
0 of 4 checks passed
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.

2 participants