blob: 589c6c49ad6ce3cf5d3dcb49978ccab2eb16759f (
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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt for Python project.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** Commercial License Usage
** Licensees holding valid commercial Qt 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 General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** 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-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <string>
#include "filter.h"
Data::Data(Field field, std::string value)
: m_field(field), m_value(value)
{
}
Union::Union(const Data& filter)
{
m_filters.push_back(filter);
}
Union::Union(const Intersection& filter)
{
m_filters.push_back(filter);
}
Union::Union(const Union& filter)
{
m_filters = filter.filters();
}
Intersection::Intersection(const Data& filter)
{
m_filters.push_back(filter);
}
Intersection::Intersection(const Union& filter)
{
m_filters.push_back(filter);
}
Intersection::Intersection(const Intersection& filter)
{
m_filters = filter.filters();
}
Intersection operator&(const Intersection& a, const Intersection& b)
{
Intersection filter;
filter.addFilter(a);
filter.addFilter(b);
return filter;
}
|
