aboutsummaryrefslogtreecommitdiffstats
path: root/src/tools/ivigenerator/common/pagingmodel_simulation.cpp.tpl
blob: 3b5ad78199f67f0b26c87ed4b248b358ad019068 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
{#
# Copyright (C) 2019 Luxoft Sweden AB
# Copyright (C) 2018 Pelagicore AG.
# Copyright (C) 2017 Klaralvdalens Datakonsult AB (KDAB)
# Contact: https://www.qt.io/licensing/
#
# This file is part of the QtIvi module of the Qt Toolkit.
#
# $QT_BEGIN_LICENSE:LGPL-QTAS$
# Commercial License Usage
# Licensees holding valid commercial Qt Automotive Suite licenses may use
# this file in accordance with the commercial license agreement provided
# with the Software or, alternatively, in accordance with the terms
# contained in a written agreement between you and The Qt Company.  For
# licensing terms and conditions see https://www.qt.io/terms-conditions.
# For further information use the contact form at https://www.qt.io/contact-us.
#
# GNU Lesser General Public License Usage
# Alternatively, this file may be used under the terms of the GNU Lesser
# General Public License version 3 as published by the Free Software
# Foundation and appearing in the file LICENSE.LGPL3 included in the
# packaging of this file. Please review the following information to
# ensure the GNU Lesser General Public License version 3 requirements
# will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
#
# GNU General Public License Usage
# Alternatively, this file may be used under the terms of the GNU
# General Public License version 2.0 or (at your option) the GNU General
# Public license version 3 or any later version approved by the KDE Free
# Qt Foundation. The licenses are as published by the Free Software
# Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
# included in the packaging of this file. Please review the following
# information to ensure the GNU General Public License requirements will
# be met: https://www.gnu.org/licenses/gpl-2.0.html and
# https://www.gnu.org/licenses/gpl-3.0.html.
#
# $QT_END_LICENSE$
#
# SPDX-License-Identifier: LGPL-3.0
#}
{% set class = '{0}ModelBackend'.format(property|upperfirst) %}

{{class}}::{{class}}(QObject* parent)
    : QIviPagingModelInterface(parent)
{
    qRegisterMetaType<QIviPagingModelInterface*>();
}

/*! \internal */
{{class}}::~{{class}}()
{
}

void {{class}}::initialize()
{
    QIVI_SIMULATION_TRY_CALL({{class}}, "initialize", void);

    Q_EMIT initializationDone();
}

void {{class}}::registerInstance(const QUuid &identifier)
{
    QIVI_SIMULATION_TRY_CALL({{class}}, "registerInstance", void, identifier);

    Q_EMIT countChanged(identifier, m_list.count());
}

void {{class}}::unregisterInstance(const QUuid &identifier)
{
    QIVI_SIMULATION_TRY_CALL({{class}}, "unregisterInstance", void, identifier);
}

void {{class}}::fetchData(const QUuid &identifier, int start, int count)
{
    QIVI_SIMULATION_TRY_CALL({{class}}, "fetchData", void, identifier, start, count);

    QVariantList list;
    int max = qMin(start + count, m_list.count());
    for(int i=start; i < max; i++)
        list.append(QVariant::fromValue(m_list.at(i)));

    Q_EMIT dataFetched(identifier, list, start, max <  m_list.count());
}

void {{class}}::insert(int index, const {{property.type.nested}} &item)
{
    m_list.insert(index, item);

    Q_EMIT dataChanged(QUuid(), { QVariant::fromValue(item) }, index, 0);
}

void {{class}}::remove(int index)
{
    m_list.removeAt(index);

    Q_EMIT dataChanged(QUuid(), QVariantList(), index, 1);
}

void {{class}}::move(int currentIndex, int newIndex)
{
    int min = qMin(currentIndex, newIndex);
    int max = qMax(currentIndex, newIndex);

    m_list.move(currentIndex, newIndex);
    QVariantList variantList;
    for (int i = min; i <= max; i++)
        variantList.append(QVariant::fromValue(m_list.at(i)));

    Q_EMIT dataChanged(QUuid(), variantList, min, max - min + 1);
}

void {{class}}::reset()
{
    Q_EMIT dataChanged(QUuid(), QVariantList(), 0, m_list.count());
    m_list.clear();
}

void {{class}}::update(int index, const {{property.type.nested}} &item)
{
    m_list[index] = item;
    Q_EMIT dataChanged(QUuid(), { QVariant::fromValue(item) }, index, 1);
}

const {{property.type.nested}} &{{class}}::at(int index) const
{
    return m_list.at(index);
}