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

#1052 - Add constraints list of a lazy linear map #1058

Merged
merged 1 commit into from
Jan 24, 2019
Merged

Conversation

schillic
Copy link
Member

Closes #1052.

@@ -328,7 +329,7 @@ A list of vertices.

### Algorithm

We assume that the underlying set `X` is polytopic.
We assume that the underlying set `X` is polyhedral.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

what about using an interface for the dispatch? LinearMap{N, S} where {S<:AbstractPolytope}

Copy link
Member Author

@schillic schillic Jan 23, 2019

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  1. This PR is about constraints_list.
  2. This is the old dispute about lazy operations. There are other sets that offer constraints_list (such as HPolyhedron).
    In this PR (constraints_list) I used the interface as you did in Intersection, but to be honest now things are inconsistent.

@schillic schillic merged commit 0988a89 into master Jan 24, 2019
@schillic schillic deleted the schillic/1052 branch January 24, 2019 18:43
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