1 files changed, 116 insertions, 0 deletions
diff --git a/src/lib/buildgraph/nodeset.h b/src/lib/buildgraph/nodeset.h
new file mode 100644
index 000000000..98b754dff
--- /dev/null
+++ b/src/lib/buildgraph/nodeset.h
@@ -0,0 +1,116 @@
+/****************************************************************************
+**
+** Copyright (C) 2013 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_NODESET_H
+#define QBS_NODESET_H
+
+#include <set>
+#include <cstddef>
+
+namespace qbs {
+namespace Internal {
+
+class BuildGraphNode;
+class PersistentPool;
+
+/**
+  * Set of build graph nodes.
+  * This is faster than QSet when iterating over the container.
+  */
+class NodeSet
+{
+public:
+    NodeSet();
+    NodeSet(const NodeSet &other);
+
+    NodeSet &unite(const NodeSet &other);
+
+    typedef std::set<BuildGraphNode *>::const_iterator const_iterator;
+    typedef std::set<BuildGraphNode *>::iterator iterator;
+    typedef BuildGraphNode * 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(BuildGraphNode *node)
+    {
+        m_data.insert(node);
+    }
+
+    void operator +=(BuildGraphNode *node)
+    {
+        insert(node);
+    }
+
+    void remove(BuildGraphNode *node);
+
+    bool contains(BuildGraphNode *node) const
+    {
+        return m_data.find(node) != 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 NodeSet &other) const { return m_data == other.m_data; }
+    bool operator!=(const NodeSet &other) const { return !(*this == other); }
+
+    void load(PersistentPool &pool);
+    void store(PersistentPool &pool) const;
+
+
+private:
+    std::set<BuildGraphNode *> m_data;
+};
+
+} // namespace Internal
+} // namespace qbs
+
+#endif // QBS_NODESET_H