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

Efficient subset check between CartesianProducts #1227

Closed
mforets opened this issue Mar 12, 2019 · 0 comments · Fixed by #2241
Closed

Efficient subset check between CartesianProducts #1227

mforets opened this issue Mar 12, 2019 · 0 comments · Fixed by #2241
Assignees
@schillic
Labels
feature ➕ A new feature

Comments

@mforets
Copy link
Member

mforets commented Mar 12, 2019

This is the particular binary case of #1225.
@mforets mforets added the performance 🐎 More efficient code label Mar 12, 2019
@mforets mforets mentioned this issue Mar 12, 2019
Merged
@schillic schillic added feature ➕ A new feature and removed performance 🐎 More efficient code labels Mar 12, 2019
@schillic schillic self-assigned this Jul 19, 2020
@schillic schillic mentioned this issue Jul 19, 2020
Merged
schillic added a commit that referenced this issue Jul 22, 2020
@schillic
Merge pull request #2241 from JuliaReach/schillic/1227
693bfe2 
#1227 - Efficient subset check between CartesianProducts
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@schillic schillic

Labels
feature ➕ A new feature
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

#1227 - Efficient subset check between CartesianProducts JuliaReach/LazySets.jl
2 participants
@schillic @mforets