73 lines
1.3 KiB
C++
73 lines
1.3 KiB
C++
#include "rules.h"
|
|
#include "rule.h"
|
|
|
|
Rules::Rules(QObject *parent) : QAbstractListModel(parent)
|
|
{
|
|
|
|
}
|
|
|
|
void Rules::clear()
|
|
{
|
|
qDeleteAll(m_list);
|
|
m_list.clear();
|
|
}
|
|
|
|
int Rules::rowCount(const QModelIndex &parent) const
|
|
{
|
|
Q_UNUSED(parent)
|
|
return m_list.count();
|
|
}
|
|
|
|
QVariant Rules::data(const QModelIndex &index, int role) const
|
|
{
|
|
switch (role) {
|
|
case RoleName:
|
|
return m_list.at(index.row())->name();
|
|
}
|
|
return QVariant();
|
|
}
|
|
|
|
QHash<int, QByteArray> Rules::roleNames() const
|
|
{
|
|
QHash<int, QByteArray> roles;
|
|
roles.insert(RoleName, "name");
|
|
return roles;
|
|
}
|
|
|
|
void Rules::insert(Rule *rule)
|
|
{
|
|
beginInsertRows(QModelIndex(), m_list.count(), m_list.count());
|
|
m_list.append(rule);
|
|
endInsertRows();
|
|
}
|
|
|
|
void Rules::remove(const QUuid &ruleId)
|
|
{
|
|
for (int i = 0; i < m_list.count(); i++) {
|
|
if (m_list.at(i)->id() == ruleId) {
|
|
beginRemoveRows(QModelIndex(), i, i);
|
|
m_list.takeAt(i)->deleteLater();
|
|
endRemoveRows();
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
Rule *Rules::get(int index) const
|
|
{
|
|
if (index < 0 || index >= m_list.count()) {
|
|
return nullptr;
|
|
}
|
|
return m_list.at(index);
|
|
}
|
|
|
|
Rule *Rules::getRule(const QUuid &ruleId) const
|
|
{
|
|
foreach (Rule *rule, m_list) {
|
|
if (rule->id() == ruleId) {
|
|
return rule;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|