125 lines
2.8 KiB
C++
125 lines
2.8 KiB
C++
/*
|
|
* ModelRailroadTimetablePlanner
|
|
* Copyright 2016-2023, Filippo Gentile
|
|
*
|
|
* This program 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 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
*/
|
|
|
|
#ifndef JOB_CROSS_DATA_H
|
|
#define JOB_CROSS_DATA_H
|
|
|
|
#ifdef ENABLE_BACKGROUND_MANAGER
|
|
|
|
# include <QMap>
|
|
# include <QTime>
|
|
|
|
# include "utils/types.h"
|
|
|
|
struct JobCrossingErrorData
|
|
{
|
|
db_id jobId = 0;
|
|
|
|
db_id stopId = 0;
|
|
db_id stationId = 0;
|
|
|
|
JobStopEntry otherJob;
|
|
|
|
QTime arrival, departure;
|
|
QTime otherArr, otherDep;
|
|
|
|
QString stationName;
|
|
|
|
enum Type
|
|
{
|
|
NoError = 0,
|
|
JobCrossing, // NOTE: arrival refers to next job stop so it comes after departure (same for
|
|
// otherArr/Dep)
|
|
JobPassing
|
|
};
|
|
|
|
Type type = NoError;
|
|
};
|
|
|
|
struct JobCrossingErrorList
|
|
{
|
|
JobEntry job;
|
|
QVector<JobCrossingErrorData> errors;
|
|
|
|
inline int childCount() const
|
|
{
|
|
return errors.size();
|
|
}
|
|
inline const JobCrossingErrorData *ptrForRow(int row) const
|
|
{
|
|
return &errors.at(row);
|
|
}
|
|
};
|
|
|
|
/*!
|
|
* \brief The JobCrossingErrorMap class
|
|
*
|
|
* Each job crossing or passing involves 2 jobs.
|
|
* This map contains duplicated errors from the point of view
|
|
* of both jobs.
|
|
*/
|
|
class JobCrossingErrorMap
|
|
{
|
|
public:
|
|
typedef QMap<db_id, JobCrossingErrorList> ErrorMap;
|
|
|
|
JobCrossingErrorMap();
|
|
|
|
inline int topLevelCount() const
|
|
{
|
|
return map.size();
|
|
}
|
|
|
|
inline const JobCrossingErrorList *getTopLevelAtRow(int row) const
|
|
{
|
|
if (row >= topLevelCount())
|
|
return nullptr;
|
|
return &(map.constBegin() + row).value();
|
|
}
|
|
|
|
inline const JobCrossingErrorList *getParent(JobCrossingErrorData *child) const
|
|
{
|
|
auto it = map.constFind(child->jobId);
|
|
if (it == map.constEnd())
|
|
return nullptr;
|
|
return &it.value();
|
|
}
|
|
|
|
inline int getParentRow(JobCrossingErrorData *child) const
|
|
{
|
|
auto it = map.constFind(child->jobId);
|
|
if (it == map.constEnd())
|
|
return -1;
|
|
return std::distance(map.constBegin(), it);
|
|
}
|
|
|
|
void removeJob(db_id jobId);
|
|
|
|
void renameJob(db_id newJobId, db_id oldJobId);
|
|
|
|
void merge(const ErrorMap &results);
|
|
|
|
public:
|
|
ErrorMap map;
|
|
};
|
|
|
|
#endif // ENABLE_BACKGROUND_MANAGER
|
|
|
|
#endif // JOB_CROSS_DATA_H
|