manager.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/>.
 */
#ifndef __ANTARES_TOOLBOX_MAP_CONTAINER_H__
#define __ANTARES_TOOLBOX_MAP_CONTAINER_H__
 
#include <antares/study/study.h>
#include <vector>
#include <queue>
#include "nodes/node.h"
 
namespace Antares::Map
{
using BoundingBox = std::pair<wxPoint, wxPoint>;
 
// Forward declarations
class Connection;
class Component;
class Node;
class BindingConstraint;
 
class Manager final
{
public:
    static Manager* Instance();
 
public:
 
 
    Manager(Component& component);
    ~Manager();
 
 
 
    void attachStudy(Data::Study::Ptr study);
 
    Data::Study::Ptr study() const
    {
        return pStudy;
    }
 
 
 
 
    BoundingBox boundingBox(const size_t& layerID) const;
 
    BoundingBox boundingBoxOfSelectedNodes(const size_t& layerID) const;
 
    // void recentreAllNodes(const int offsetX = 0, const int offsetY = 0);
 
 
 
    bool loadFromStudy(Data::Study& study);
 
    bool loadFromAttachedStudy();
 
    template<class T>
    T* add();
 
    Node* addNode(const wxString& id);
 
    Node* addNode(const wxString& id, const wxString& caption, const int x, const int y);
 
    Connection* addConnection(Item* a, Item* b);
 
    void addConnectionFromEachSelectedItem(Item* to, Item::Vector* results = NULL);
 
    bool remove(const wxString& text);
 
    uint removeAllSelected();
 
    void hideAllSelected(size_t id);
 
    void showAllSelected(size_t id);
 
    void clear();
 
    Item* find(const int x, const int y) const;
 
    Item::Vector* find(const int x1, const int y1, const int x2, const int y2) const;
 
    Item* find(const wxString& text) const;
 
    Node* find(const Data::Area* area);
 
    void moveAllSelected(const int x, const int y);
 
    void invalidateAllNodes();
 
    void refreshCacheForAllNodes(wxDC& dc);
 
 
 
    void selectOnly(Item* item);
 
    void changeItemSelectionState(Item* item);
 
    void selectOnly(const Item::Vector& item);
 
    void selectOnly(const Data::Area::Vector& areas);
 
    void selectOnly(const Data::Area::Vector& areas, const Data::AreaLink::Vector& links);
 
    void selectAllNodes(size_t layerID);
 
    void selectAllItems(size_t layerID);
 
    void selectAllAreas(size_t layerID);
 
    void selectAllLinks(size_t layerID);
 
    void unselectAll();
 
    void reverseSelection();
 
    void selectFromBoundingBox(const wxPoint& a, const wxPoint& b, const size_t layerID = 0);
 
    uint selectedItemsCount() const
    {
        return (uint)pSelectedItems.size();
    }
 
    uint selectedItemsAsConnectionCount() const
    {
        return (uint)pSelectedItemsAsConnection;
    }
 
    void getAllSelectedItems(std::vector<Item*>& list);
 
    Data::AreaName findNewCaption(Data::AreaName = "") const;
 
    void beginUpdate();
    void endUpdate();
 
    void draw(DrawingContext& dc);
 
    void drawExternalDrawer(DrawingContext& dc);
 
    bool hasChanges() const
    {
        return pHasChanges;
    }
 
    void setChangesFlag(bool v)
    {
        pHasChanges = v;
    }
 
    uint areasCount(const size_t& layerID) const;
 
    void removeLayerVisibility(const size_t& layerID);
 
    size_t getActiveLayerId();
 
    uint connectionsCount(const size_t& layerID) const;
 
    void pendingDeleteArea(Data::Area* area);
    void pendingDeleteLink(Data::AreaLink* lnk);
 
public:
    bool mouseSelectionArea;
    bool mouseSelectionLinks;
    bool mouseSelectionPlants;
    bool mouseSelectionConstraints;
 
private:
    void internalAddItem(Item* item, bool takeOwnership = false);
    void internalRemoveItem(Item* item);
    bool removeTheFirstSelectedItem();
 
    void deallocationStackAdd(Item* i);
    void deallocationStackRemove(Item* it);
    bool deallocationStackExists(Item* it);
 
    void deleteAllPendingData();
 
private:
    using NodeMap = std::map<Item*, bool>;
    using NodeByZPosition = std::map<int, NodeMap>;
 
private:
    Component& pComponent;
    Data::Study::Ptr pStudy;
 
    NodeByZPosition pAllNodes;
 
    Item::Set pStackDeallocation;
 
    NodeMap pSelectedItems;
    int pSelectedItemsAsConnection;
 
    std::queue<Item*> pExternalQueue;
 
    bool pHasChanges;
 
    uint pUpdaterLock;
 
    Data::AreaLink::Vector pLinksToDelete;
    Data::Area::Vector pAreasToDelete;
 
    // Some friends
    friend class ::Antares::Map::Item;
    friend class ::Antares::Map::Node;
    friend class ::Antares::Map::Connection;
    friend class ::Antares::Map::BindingConstraint;
 
}; // class Manager
 
} // namespace Antares::Map
 
#include "manager.hxx"
#include "nodes/connection.h"
 
#endif // __ANTARES_TOOLBOX_MAP_CONTAINER_H__