blob: 176cab53c445e00121e84ed5a2f98b709998a8e4 (
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
|
/****************************************************************************
**
** 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.
**
****************************************************************************/
#include "nodeset.h"
#include "artifact.h"
#include "rulenode.h"
#include <language/language.h> // because of RulePtr
#include <tools/persistence.h>
#include <tools/qbsassert.h>
namespace qbs {
namespace Internal {
NodeSet::NodeSet()
{
}
NodeSet::NodeSet(const NodeSet &other)
: m_data(other.m_data)
{
}
NodeSet &NodeSet::unite(const NodeSet &other)
{
m_data.insert(other.begin(), other.end());
return *this;
}
void NodeSet::remove(BuildGraphNode *node)
{
m_data.erase(node);
}
void NodeSet::load(PersistentPool &pool)
{
clear();
int i;
pool.stream() >> i;
for (; --i >= 0;) {
int t;
pool.stream() >> t;
BuildGraphNode *node = 0;
switch (static_cast<BuildGraphNode::Type>(t)) {
case BuildGraphNode::ArtifactNodeType:
node = pool.idLoad<Artifact>();
break;
case BuildGraphNode::RuleNodeType:
node = pool.idLoad<RuleNode>();
break;
}
QBS_CHECK(node);
insert(node);
}
}
void NodeSet::store(PersistentPool &pool) const
{
pool.stream() << count();
for (NodeSet::const_iterator it = constBegin(); it != constEnd(); ++it) {
pool.stream() << int((*it)->type());
pool.store(*it);
}
}
} // namespace Internal
} // namespace qbs
|
