1 /* 2 * Copyright (C) 1999 Lars Knoll (knoll (at) kde.org) 3 * (C) 1999 Antti Koivisto (koivisto (at) kde.org) 4 * (C) 2001 Dirk Mueller (mueller (at) kde.org) 5 * (C) 2006 Alexey Proskuryakov (ap (at) 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 "platform/heap/Handle.h" 32 #include "wtf/FastAllocBase.h" 33 #include "wtf/ListHashSet.h" 34 35 namespace blink { 36 37 class Node; 38 39 class DocumentOrderedList FINAL { 40 WTF_MAKE_NONCOPYABLE(DocumentOrderedList); 41 DISALLOW_ALLOCATION(); 42 public: 43 DocumentOrderedList() { } 44 45 void add(Node*); 46 void parserAdd(Node*); 47 void remove(const Node*); 48 bool isEmpty() const { return m_nodes.isEmpty(); } 49 void clear() { m_nodes.clear(); } 50 size_t size() const { return m_nodes.size(); } 51 52 typedef WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32>::iterator iterator; 53 54 iterator begin() { return m_nodes.begin(); } 55 iterator end() { return m_nodes.end(); } 56 57 void trace(Visitor*); 58 59 private: 60 WillBeHeapListHashSet<RawPtrWillBeMember<Node>, 32> m_nodes; 61 }; 62 63 } 64 65 #endif 66
