ReadLinearConstraintVisitor.h

/*
 * Copyright 2007-2024, RTE (https://www.rte-france.com)
 * See AUTHORS.txt
 * SPDX-License-Identifier: MPL-2.0
 * This file is part of Antares-Simulator,
 * Adequacy and Performance assessment for interconnected energy networks.
 *
 * Antares_Simulator is free software: you can redistribute it and/or modify
 * it under the terms of the Mozilla Public Licence 2.0 as published by
 * the Mozilla Foundation, either version 2 of the License, or
 * (at your option) any later version.
 *
 * Antares_Simulator is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * Mozilla Public Licence 2.0 for more details.
 *
 * You should have received a copy of the Mozilla Public Licence 2.0
 * along with Antares_Simulator. If not, see <https://opensource.org/license/mpl-2-0/>.
 */
 
#pragma once
 
#include <limits>
 
#include <antares/expressions/visitors/EvaluationContext.h>
#include <antares/expressions/visitors/NodeVisitor.h>
 
#include "ReadLinearExpressionVisitor.h"
 
namespace Antares::Optimization
{
 
struct LinearConstraint
{
    FullKeyMap coef_per_var;
    double lb = -std::numeric_limits<double>::infinity();
    double ub = std::numeric_limits<double>::infinity();
    unsigned int timeStep = 0;
};
 
class ReadLinearConstraintVisitor
    : public Expressions::Visitors::NodeVisitor<std::vector<LinearConstraint>>
{
public:
    ReadLinearConstraintVisitor() = default;
    explicit ReadLinearConstraintVisitor(
      Expressions::Visitors::EvaluationContext context,
      const Optimisation::LinearProblemApi::FillContext& fillContext,
      const std::string& componentId /* or vector ?*/);
    std::string name() const override;
 
private:
    ReadLinearExpressionVisitor linear_expression_visitor_;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::SumNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::SubtractionNode* node) override;
    std::vector<LinearConstraint> visit(
      const Expressions::Nodes::MultiplicationNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::DivisionNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::EqualNode* node) override;
    std::vector<LinearConstraint> visit(
      const Expressions::Nodes::LessThanOrEqualNode* node) override;
    std::vector<LinearConstraint> visit(
      const Expressions::Nodes::GreaterThanOrEqualNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::NegationNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::VariableNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::ParameterNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::LiteralNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::PortFieldNode* node) override;
    std::vector<LinearConstraint> visit(const Expressions::Nodes::PortFieldSumNode* node) override;
    std::vector<LinearConstraint> visit(
      const Expressions::Nodes::ComponentVariableNode* node) override;
    std::vector<LinearConstraint> visit(
      const Expressions::Nodes::ComponentParameterNode* node) override;
};
} // namespace Antares::Optimization