blob: bbe2771cbbedcb3fdc6b507bc9fd10a64cff0835 (
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
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Build Suite.
**
** 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 Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/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 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
****************************************************************************/
#ifndef QBS_ARTIFACTLIST_H
#define QBS_ARTIFACTLIST_H
#include <set>
#include <cstddef>
namespace qbs {
namespace Internal {
class Artifact;
/**
* List that holds a bunch of build graph artifacts.
* This is faster than QSet when iterating over the container.
*/
class ArtifactList
{
public:
ArtifactList();
ArtifactList(const ArtifactList &other);
ArtifactList &unite(const ArtifactList &other);
typedef std::set<Artifact *>::const_iterator const_iterator;
typedef std::set<Artifact *>::iterator iterator;
typedef Artifact * value_type;
iterator begin() { return m_data.begin(); }
iterator end() { return m_data.end(); }
const_iterator begin() const { return m_data.begin(); }
const_iterator end() const { return m_data.end(); }
const_iterator constBegin() const { return m_data.begin(); }
const_iterator constEnd() const { return m_data.end(); }
void insert(Artifact *artifact)
{
m_data.insert(artifact);
}
void operator +=(Artifact *artifact)
{
insert(artifact);
}
void remove(Artifact *artifact);
bool contains(Artifact *artifact) const
{
return m_data.find(artifact) != m_data.end();
}
void clear()
{
m_data.clear();
}
bool isEmpty() const
{
return m_data.empty();
}
int count() const
{
return (int)m_data.size();
}
void reserve(int)
{
// no-op
}
bool operator==(const ArtifactList &other) const { return m_data == other.m_data; }
bool operator!=(const ArtifactList &other) const { return !(*this == other); }
private:
std::set<Artifact *> m_data;
};
} // namespace Internal
} // namespace qbs
#endif // QBS_ARTIFACTLIST_H
|
