27 assert(task2Constraint_.find(&tr) == task2Constraint_.end());
28 task2Constraint_[&tr] = c;
37 { task2Constraint_.insert(
map.begin(),
map.end()); }
41 {
return task2Constraint_.at(&tr); }
44 std::optional<std::reference_wrapper<const LinearConstraintWithRequirements>>
constraintNoThrow(
47 auto it = task2Constraint_.find(&tr);
48 if(it != task2Constraint_.end())
60 task2Constraint_.clear();
Definition: LinearizedControlProblem.h:16
Definition: ControlProblem.h:22
Definition: LinearizedProblemComputationData.h:20
void addConstraints(const tvm::utils::internal::map< TaskWithRequirements const *, LinearConstraintWithRequirements > &map)
Definition: LinearizedProblemComputationData.h:35
const LinearConstraintWithRequirements & constraint(const TaskWithRequirements &tr) const
Definition: LinearizedProblemComputationData.h:40
std::optional< std::reference_wrapper< const LinearConstraintWithRequirements > > constraintNoThrow(const TaskWithRequirements &tr) const
Definition: LinearizedProblemComputationData.h:44
void addConstraint(const TaskWithRequirements &tr, const LinearConstraintWithRequirements &c)
Definition: LinearizedProblemComputationData.h:25
void reset()
Definition: LinearizedProblemComputationData.h:58
void removeConstraint(const TaskWithRequirements &tr)
Definition: LinearizedProblemComputationData.h:32
LinearizedProblemComputationData(int solverId)
Definition: LinearizedProblemComputationData.h:56
Definition: ProblemComputationData.h:27
void clearVariables()
Definition: ProblemComputationData.h:168
void clearEvents()
Definition: ProblemComputationData.h:166
int solverId() const
Definition: ProblemComputationData.h:96
Definition: Assignment.h:23
std::map< KeyWithId, Value, IdLess< KeyWithId >, Allocator > map
Definition: map.h:41