qelectrotech-source-mirror/sources/elementprovider.cpp

216 lines
5.5 KiB
C++
Raw Permalink Normal View History

/*
2021-02-20 12:13:46 +01:00
Copyright 2006-2021 The QElectroTech Team
This file is part of QElectroTech.
QElectroTech is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
QElectroTech 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
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with QElectroTech. If not, see <http://www.gnu.org/licenses/>.
*/
#include "elementprovider.h"
2020-12-08 19:57:35 +01:00
#include "diagram.h"
2020-12-08 19:57:35 +01:00
#include "qetgraphicsitem/ViewItem/qetgraphicstableitem.h"
#include "qetgraphicsitem/element.h"
#include "qetgraphicsitem/terminalelement.h"
2020-12-08 19:57:35 +01:00
#include "qetproject.h"
#include <QAbstractItemModel>
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::ElementProvider Constructor
@param prj the project where we must find element
@param diagram the diagram to exclude from the search
*/
ElementProvider::ElementProvider(QETProject *prj, Diagram *diagram)
{
m_diagram_list = prj->diagrams();
m_diagram_list.removeOne(diagram);
}
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::ElementProvider Constructor
@param diag Diagram to search
*/
ElementProvider::ElementProvider(Diagram *diag) {
m_diagram_list << diag;
}
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::FreeElement
2020-08-20 21:57:35 +02:00
Search and return the asked element corresponding with the given filter
All returned element are free,
ie element aren't connected with another element
2020-08-16 11:19:36 +02:00
@param filter
the filter for search element
@return
*/
2022-06-13 20:46:22 +02:00
QVector <QPointer<Element>> ElementProvider::freeElement(ElementData::Types filter) const
{
2022-06-13 20:46:22 +02:00
QVector<QPointer<Element>> free_elmt;
QList<Element *> elmt_list;
//serch in all diagram
for (const auto &diagram_ : qAsConst(m_diagram_list))
{
//get all element in diagram d
elmt_list = diagram_->elements();
for (const auto &elmt_ : qAsConst(elmt_list))
{
if (filter & elmt_->elementData().m_type &&
elmt_->isFree())
{
free_elmt << elmt_;
}
}
//Clear for next loop
elmt_list.clear();
}
return free_elmt;
}
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::fromUuids
@param uuid_list list of uuid must be found
2020-08-20 21:57:35 +02:00
@return all elements with uuid corresponding to uuid in uuid_list
2020-08-16 11:19:36 +02:00
*/
2020-09-07 22:03:40 +02:00
QList <Element *> ElementProvider::fromUuids(QList<QUuid> uuid_list) const
{
QList <Element *> found_element;
foreach (Diagram *d, m_diagram_list) {
foreach(Element *elmt, d->elements()) {
if (uuid_list.contains(elmt->uuid())) {
found_element << elmt;
uuid_list.removeAll(elmt->uuid());
}
}
}
return found_element;
}
/**
* @brief ElementProvider::find
* Search and return the element with the type given in parameter
* @param elmt_type
* @return
*/
QVector<QPointer<Element>> ElementProvider::find(ElementData::Types elmt_type) const
{
QVector<QPointer<Element>> returned_vector;
for (const auto &diagram_ : qAsConst(m_diagram_list))
{
const auto elmt_list = diagram_->elements();
for (const auto &elmt_ : elmt_list)
{
if (elmt_type & elmt_->elementData().m_type) {
returned_vector << QPointer<Element>(elmt_);
}
}
}
return returned_vector;
}
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::table
@param table
@param model
2020-08-20 21:57:35 +02:00
@return All tables wich display the derivated class of model (if set)
and not already in all the chain of next/previous table of table (if set)
2020-08-16 11:19:36 +02:00
If table and model are nullptr, return every tables
*/
2020-08-20 21:58:23 +02:00
QVector<QetGraphicsTableItem *> ElementProvider::table(
QetGraphicsTableItem *table,
QAbstractItemModel *model)
{
QVector<QetGraphicsTableItem *> v_;
QVector<QetGraphicsTableItem *> linked_vector;
if (table)
{
2020-08-20 21:58:23 +02:00
//table can be inside a chain, at the head of a chain or alone
auto linked_table = table->previousTable()
? table->previousTable()
: table->nextTable();
while (linked_table) { //Go to the first table
if (linked_table->previousTable())
linked_table = linked_table->previousTable();
else
break;
}
while (linked_table) { //Store each linked table in linked_vector
linked_vector.append(linked_table);
linked_table = linked_table->nextTable();
}
}
for (auto d : m_diagram_list) {
for (auto item_ : d->items())
{
if(item_->type() == QetGraphicsTableItem::Type)
{
auto found_table = static_cast<QetGraphicsTableItem *>(item_);
if (linked_vector.contains(found_table)) {
continue;
}
if (!model ||
(found_table->model() &&
model->metaObject()->className() == found_table->model()->metaObject()->className()))
{v_.append(found_table);}
}
}
}
return v_;
}
/**
2020-08-16 11:19:36 +02:00
@brief ElementProvider::tableFromUuid
@param uuid
2020-08-20 21:57:35 +02:00
@return the table with uuid uuid or nullptr if not found
2020-08-16 11:19:36 +02:00
*/
QetGraphicsTableItem *ElementProvider::tableFromUuid(const QUuid &uuid)
{
for (auto table : this->table())
if (table->uuid() == uuid)
return table;
return nullptr;
}
/**
* @brief ElementProvider::freeTerminal
* @return a vector of every terminals element who doesn't
* belong to a terminal strip.
*/
QVector<TerminalElement *> ElementProvider::freeTerminal() const
{
QVector<TerminalElement *> vector_;
for (const auto diagram : m_diagram_list) {
DiagramContent dc(diagram, false);
for (const auto element : qAsConst(dc.m_elements)) {
if (element->elementData().m_type == ElementData::Terminale)
{
auto te = static_cast<TerminalElement *>(element);
if (!te->parentTerminalStrip()) {
vector_.append(static_cast<TerminalElement *>(element));
}
}
}
}
return vector_;
}