File: ViewFilter.cpp

package info (click to toggle)
charmtimetracker 1.12.0-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 3,340 kB
  • sloc: cpp: 19,176; xml: 284; python: 120; makefile: 14
file content (155 lines) | stat: -rw-r--r-- 4,742 bytes parent folder | download | duplicates (2)
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/*
  ViewFilter.cpp

  This file is part of Charm, a task-based time tracking application.

  Copyright (C) 2007-2018 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com

  Author: Mirko Boehm <mirko.boehm@kdab.com>
  Author: Frank Osterfeld <frank.osterfeld@kdab.com>

  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 2 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/>.
*/

#include "ViewFilter.h"
#include "Core/CharmDataModel.h"
#include "ViewHelpers.h"

ViewFilter::ViewFilter(CharmDataModel *model, QObject *parent)
    : QSortFilterProxyModel(parent)
    , m_model(model)
{
    setSourceModel(&m_model);

    // we filter for the task name column
    setFilterKeyColumn(Column_TaskId);
    // setFilterKeyColumn( -1 );
    setFilterCaseSensitivity(Qt::CaseInsensitive);

    // relay signals to the view:
    connect(&m_model, &TaskModelAdapter::eventActivationNotice,
            this, &ViewFilter::eventActivationNotice);
    connect(&m_model, &TaskModelAdapter::eventDeactivationNotice,
            this, &ViewFilter::eventDeactivationNotice);

    sort(Column_TaskId);
}

ViewFilter::~ViewFilter()
{
}

Task ViewFilter::taskForIndex(const QModelIndex &index) const
{
    return m_model.taskForIndex(mapToSource(index));
}

QModelIndex ViewFilter::indexForTaskId(TaskId id) const
{
    return mapFromSource(m_model.indexForTaskId(id));
}

bool ViewFilter::taskIsActive(const Task &task) const
{
    return m_model.taskIsActive(task);
}

bool ViewFilter::taskHasChildren(const Task &task) const
{
    return m_model.taskHasChildren(task);
}

void ViewFilter::prefilteringModeChanged()
{
    invalidate();
}

bool ViewFilter::filterAcceptsRow(int source_row, const QModelIndex &parent) const
{
    // by default, QSortFilterProxyModel only accepts row where already the parents where accepted
    bool acceptedByFilter = QSortFilterProxyModel::filterAcceptsRow(source_row, parent);
    // in our case, this is not what we want, we want parents to be
    // accepted if any of their children are accepted (this is a
    // recursive call, and could possibly be slow):
    const QModelIndex index(m_model.index(source_row, 0, parent));
    if (!index.isValid()) return acceptedByFilter;

    int rowCount = m_model.rowCount(index);
    for (int i = 0; i < rowCount; ++i) {
        if (filterAcceptsRow(i, index)) {
            acceptedByFilter = true;
            break;
        }
    }

    bool accepted = acceptedByFilter;
    const Task task = m_model.taskForIndex(index);
    switch (Configuration::instance().taskPrefilteringMode) {
    case Configuration::TaskPrefilter_ShowAll:
        break;
    case Configuration::TaskPrefilter_CurrentOnly:
    {
        const bool ok = (task.isCurrentlyValid() || checkChildren(task, HaveValidChild));
        accepted &= ok;
        break;
    }
    case Configuration::TaskPrefilter_SubscribedOnly:
    {
        const bool ok = (task.subscribed() || checkChildren(task, HaveSubscribedChild));
        accepted &= ok;
        break;
    }
    case Configuration::TaskPrefilter_SubscribedAndCurrentOnly:
        accepted
            &= ((task.subscribed()
                 || checkChildren(task,
                                  HaveSubscribedChild))
                && (task.isCurrentlyValid() || checkChildren(task, HaveValidChild)));
        break;
    default:
        break;
    }

    return accepted;
}

bool ViewFilter::filterAcceptsColumn(int, const QModelIndex &) const
{
    return true;
}

bool ViewFilter::taskIdExists(TaskId taskId) const
{
    return m_model.taskIdExists(taskId);
}

bool ViewFilter::checkChildren(Task task, CheckFor checkFor) const
{
    if (taskHasChildren(task)) {
        const TaskList taskList = m_model.children(task);
        for (const Task &taskChild : taskList) {
            if (checkFor == HaveSubscribedChild && taskChild.subscribed()) {
                return true;
            } else if (checkFor == HaveValidChild && taskChild.isCurrentlyValid()) {
                return true;
            }
        }
    }
    return false;
}

void ViewFilter::commitCommand(CharmCommand *command)
{   // we do not emit signals, we are the relay (since we are a proxy):
    m_model.commitCommand(command);
}