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
|
/***************************************************************************
* Copyright (C) 2012 by Daniel Nicoletti *
* dantti12@gmail.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; see the file COPYING. If not, write to *
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, *
* Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "CategoryMatcher.h"
CategoryMatcher::CategoryMatcher(Kind kind, const QString &term) :
m_kind(kind),
m_term(term)
{
}
CategoryMatcher::CategoryMatcher(const CategoryMatcher &other) :
m_kind(other.m_kind),
m_term(other.m_term),
m_child(other.m_child)
{
}
CategoryMatcher::~CategoryMatcher()
{
}
CategoryMatcher &CategoryMatcher::operator =(const CategoryMatcher &other)
{
m_kind = other.m_kind;
m_term = other.m_term;
m_child = other.m_child;
return *this;
}
bool CategoryMatcher::match(const QStringList &categories) const
{
if (categories.isEmpty()) {
return false;
}
bool ret = false;
switch (m_kind) {
case Term:
ret = categories.contains(m_term);
break;
case And:
foreach (const CategoryMatcher &parser, m_child) {
if (!(ret = parser.match(categories))) {
break;
}
}
break;
case Or:
foreach (const CategoryMatcher &parser, m_child) {
if ((ret = parser.match(categories))) {
break;
}
}
break;
case Not:
// We match like And but negating
foreach (const CategoryMatcher &parser, m_child) {
if (!(ret = !parser.match(categories))) {
break;
}
}
break;
}
return ret;
}
void CategoryMatcher::setChild(const QList<CategoryMatcher> &child)
{
m_child = child;
}
QList<CategoryMatcher> CategoryMatcher::child() const
{
return m_child;
}
QString CategoryMatcher::term() const
{
return m_term;
}
CategoryMatcher::Kind CategoryMatcher::kind() const
{
return m_kind;
}
|
