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 30 matching lines...) Expand all Loading... |
41 public: | 41 public: |
42 DocumentOrderedList() { } | 42 DocumentOrderedList() { } |
43 | 43 |
44 void add(Node*); | 44 void add(Node*); |
45 void remove(const Node*); | 45 void remove(const Node*); |
46 bool isEmpty() const { return m_nodes.isEmpty(); } | 46 bool isEmpty() const { return m_nodes.isEmpty(); } |
47 void clear() { m_nodes.clear(); } | 47 void clear() { m_nodes.clear(); } |
48 size_t size() const { return m_nodes.size(); } | 48 size_t size() const { return m_nodes.size(); } |
49 | 49 |
50 using iterator = WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32>::iterat
or; | 50 using iterator = WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32>::iterat
or; |
| 51 using const_reverse_iterator = WillBeHeapListHashSet<RawPtrWillBeMember<Node
>, 32>::const_reverse_iterator; |
51 | 52 |
52 iterator begin() { return m_nodes.begin(); } | 53 iterator begin() { return m_nodes.begin(); } |
53 iterator end() { return m_nodes.end(); } | 54 iterator end() { return m_nodes.end(); } |
54 | 55 |
| 56 const_reverse_iterator rbegin() const { return m_nodes.rbegin(); } |
| 57 const_reverse_iterator rend() const { return m_nodes.rend(); } |
| 58 |
55 DECLARE_TRACE(); | 59 DECLARE_TRACE(); |
56 | 60 |
57 private: | 61 private: |
58 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; | 62 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; |
59 }; | 63 }; |
60 | 64 |
61 } // namespace blink | 65 } // namespace blink |
62 | 66 |
63 #endif | 67 #endif |
OLD | NEW |