1/*
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
3 *           (C) 1999 Antti Koivisto (koivisto@kde.org)
4 *           (C) 2001 Dirk Mueller (mueller@kde.org)
5 *           (C) 2006 Alexey Proskuryakov (ap@webkit.org)
6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All rights reserved.
7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
8 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies)
9 * Copyright (C) 2013 Google Inc. All rights reserved.
10 *
11 * This library is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Library General Public
13 * License as published by the Free Software Foundation; either
14 * version 2 of the License, or (at your option) any later version.
15 *
16 * This library is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
19 * Library General Public License for more details.
20 *
21 * You should have received a copy of the GNU Library General Public License
22 * along with this library; see the file COPYING.LIB.  If not, write to
23 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
24 * Boston, MA 02110-1301, USA.
25 *
26 */
27
28#ifndef DocumentOrderedList_h
29#define DocumentOrderedList_h
30
31#include "wtf/FastAllocBase.h"
32#include "wtf/ListHashSet.h"
33
34namespace WebCore {
35
36class Node;
37
38class DocumentOrderedList {
39    WTF_MAKE_NONCOPYABLE(DocumentOrderedList); WTF_MAKE_FAST_ALLOCATED;
40public:
41    DocumentOrderedList() { }
42
43    void add(Node*);
44    void parserAdd(Node*);
45    void remove(const Node*);
46    bool isEmpty() const { return m_nodes.isEmpty(); }
47    void clear() { m_nodes.clear(); }
48
49    typedef ListHashSet<Node*, 32>::iterator iterator;
50
51    iterator begin() { return m_nodes.begin(); }
52    iterator end() { return m_nodes.end(); }
53
54private:
55    ListHashSet<Node*, 32> m_nodes;
56};
57
58}
59
60#endif
61