ReadLinearConstraintVisitor.h

/*
 * Copyright 2007-2025, 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 <antares/expressions/visitors/NodeVisitor.h>
 
#include "ReadLinearExpressionVisitor.h"
#include "TimeDependentLinearExpression.h"
 
namespace Antares::Optimisation
{
class OptimEntityContainer;
} // namespace Antares::Optimisation
 
namespace Antares::Optimisation
{
 
struct LinearConstraint
{
    Antares::Optimization::TimeDependentLinearExpression coef_per_var;
    std::vector<double> lb;
    std::vector<double> ub;
};
 
class ReadLinearConstraintVisitor final: public Expressions::Visitors::NodeVisitor<LinearConstraint>
{
public:
    ReadLinearConstraintVisitor() = delete;
    explicit ReadLinearConstraintVisitor(
      const Optimisation::OptimEntityContainer& optimEntityContainer,
      const Optimisation::LinearProblemApi::FillContext& fillContext,
      const ModelerStudy::SystemModel::Component& component);
 
    std::string name() const override;
 
private:
    LinearConstraint visit(const Expressions::Nodes::SumNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::SubtractionNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::MultiplicationNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::DivisionNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::EqualNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::LessThanOrEqualNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::GreaterThanOrEqualNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::NegationNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::VariableNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::ParameterNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::LiteralNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::PortFieldNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::PortFieldSumNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::TimeShiftNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::TimeIndexNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::TimeSumNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::AllTimeSumNode* node) override;
    LinearConstraint visit(const Expressions::Nodes::FunctionNode* node) override;
 
    ReadLinearExpressionVisitor linear_expression_visitor_;
};
} // namespace Antares::Optimisation