1 /* 2 * Copyright (C) 2005 Allan Sandfeld Jensen (kde (at) carewolf.com) 3 * Copyright (C) 2006, 2007 Apple Inc. All rights reserved. 4 * 5 * This library is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU Library General Public 7 * License as published by the Free Software Foundation; either 8 * version 2 of the License, or (at your option) any later version. 9 * 10 * This library is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 13 * Library General Public License for more details. 14 * 15 * You should have received a copy of the GNU Library General Public License 16 * along with this library; see the file COPYING.LIB. If not, write to 17 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, 18 * Boston, MA 02110-1301, USA. 19 * 20 */ 21 22 #ifndef CounterNode_h 23 #define CounterNode_h 24 25 #include <wtf/Noncopyable.h> 26 27 // This implements a counter tree that is used for finding parents in counters() lookup, 28 // and for propagating count changes when nodes are added or removed. 29 30 // Parents represent unique counters and their scope, which are created either explicitly 31 // by "counter-reset" style rules or implicitly by referring to a counter that is not in scope. 32 // Such nodes are tagged as "reset" nodes, although they are not all due to "counter-reset". 33 34 // Not that render tree children are often counter tree siblings due to counter scoping rules. 35 36 namespace WebCore { 37 38 class AtomicString; 39 class RenderObject; 40 41 class CounterNode : public Noncopyable { 42 public: 43 CounterNode(RenderObject*, bool isReset, int value); 44 45 bool actsAsReset() const { return m_hasResetType || !m_parent; } 46 bool hasResetType() const { return m_hasResetType; } 47 int value() const { return m_value; } 48 int countInParent() const { return m_countInParent; } 49 RenderObject* renderer() const { return m_renderer; } 50 51 CounterNode* parent() const { return m_parent; } 52 CounterNode* previousSibling() const { return m_previousSibling; } 53 CounterNode* nextSibling() const { return m_nextSibling; } 54 CounterNode* firstChild() const { return m_firstChild; } 55 CounterNode* lastChild() const { return m_lastChild; } 56 CounterNode* lastDescendant() const; 57 CounterNode* previousInPreOrder() const; 58 CounterNode* nextInPreOrder(const CounterNode* stayWithin = 0) const; 59 CounterNode* nextInPreOrderAfterChildren(const CounterNode* stayWithin = 0) const; 60 61 void insertAfter(CounterNode* newChild, CounterNode* beforeChild, const AtomicString& identifier); 62 63 // identifier must match the identifier of this counter. 64 void removeChild(CounterNode*, const AtomicString& identifier); 65 66 private: 67 int computeCountInParent() const; 68 void recount(const AtomicString& identifier); 69 70 // Invalidates the text in the renderer of this counter, if any. 71 // identifier must match the identifier of this counter. 72 void resetRenderer(const AtomicString& identifier) const; 73 74 // Invalidates the text in the renderer of this counter, if any, 75 // and in the renderers of all descendants of this counter, if any. 76 // identifier must match the identifier of this counter. 77 void resetRenderers(const AtomicString& identifier) const; 78 79 bool m_hasResetType; 80 int m_value; 81 int m_countInParent; 82 RenderObject* m_renderer; 83 84 CounterNode* m_parent; 85 CounterNode* m_previousSibling; 86 CounterNode* m_nextSibling; 87 CounterNode* m_firstChild; 88 CounterNode* m_lastChild; 89 }; 90 91 } // namespace WebCore 92 93 #ifndef NDEBUG 94 // Outside the WebCore namespace for ease of invocation from gdb. 95 void showTree(const WebCore::CounterNode*); 96 #endif 97 98 #endif // CounterNode_h 99
