OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) | 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) |
6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. |
7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
8 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) | 8 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) |
9 * Copyright (C) 2013 Google Inc. All rights reserved. | 9 * Copyright (C) 2013 Google Inc. All rights reserved. |
10 * | 10 * |
(...skipping 18 matching lines...) Expand all Loading... |
29 #define DocumentOrderedList_h | 29 #define DocumentOrderedList_h |
30 | 30 |
31 #include "platform/heap/Handle.h" | 31 #include "platform/heap/Handle.h" |
32 #include "wtf/FastAllocBase.h" | 32 #include "wtf/FastAllocBase.h" |
33 #include "wtf/ListHashSet.h" | 33 #include "wtf/ListHashSet.h" |
34 | 34 |
35 namespace blink { | 35 namespace blink { |
36 | 36 |
37 class Node; | 37 class Node; |
38 | 38 |
39 class DocumentOrderedList FINAL { | 39 class DocumentOrderedList final { |
40 WTF_MAKE_NONCOPYABLE(DocumentOrderedList); | 40 WTF_MAKE_NONCOPYABLE(DocumentOrderedList); |
41 DISALLOW_ALLOCATION(); | 41 DISALLOW_ALLOCATION(); |
42 public: | 42 public: |
43 DocumentOrderedList() { } | 43 DocumentOrderedList() { } |
44 | 44 |
45 void add(Node*); | 45 void add(Node*); |
46 void parserAdd(Node*); | 46 void parserAdd(Node*); |
47 void remove(const Node*); | 47 void remove(const Node*); |
48 bool isEmpty() const { return m_nodes.isEmpty(); } | 48 bool isEmpty() const { return m_nodes.isEmpty(); } |
49 void clear() { m_nodes.clear(); } | 49 void clear() { m_nodes.clear(); } |
50 size_t size() const { return m_nodes.size(); } | 50 size_t size() const { return m_nodes.size(); } |
51 | 51 |
52 typedef WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32>::iterator iterat
or; | 52 typedef WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32>::iterator iterat
or; |
53 | 53 |
54 iterator begin() { return m_nodes.begin(); } | 54 iterator begin() { return m_nodes.begin(); } |
55 iterator end() { return m_nodes.end(); } | 55 iterator end() { return m_nodes.end(); } |
56 | 56 |
57 void trace(Visitor*); | 57 void trace(Visitor*); |
58 | 58 |
59 private: | 59 private: |
60 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; | 60 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; |
61 }; | 61 }; |
62 | 62 |
63 } | 63 } |
64 | 64 |
65 #endif | 65 #endif |
OLD | NEW |