| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com) | 2 * Copyright (C) 2005 Allan Sandfeld Jensen (kde@carewolf.com) |
| 3 * Copyright (C) 2006, 2007 Apple Inc. All rights reserved. | 3 * Copyright (C) 2006, 2007 Apple Inc. All rights reserved. |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 55 // Invalidates the text in the layoutObjects of this counter, if any. | 55 // Invalidates the text in the layoutObjects of this counter, if any. |
| 56 void resetLayoutObjects(); | 56 void resetLayoutObjects(); |
| 57 | 57 |
| 58 CounterNode* parent() const { return m_parent; } | 58 CounterNode* parent() const { return m_parent; } |
| 59 CounterNode* previousSibling() const { return m_previousSibling; } | 59 CounterNode* previousSibling() const { return m_previousSibling; } |
| 60 CounterNode* nextSibling() const { return m_nextSibling; } | 60 CounterNode* nextSibling() const { return m_nextSibling; } |
| 61 CounterNode* firstChild() const { return m_firstChild; } | 61 CounterNode* firstChild() const { return m_firstChild; } |
| 62 CounterNode* lastChild() const { return m_lastChild; } | 62 CounterNode* lastChild() const { return m_lastChild; } |
| 63 CounterNode* lastDescendant() const; | 63 CounterNode* lastDescendant() const; |
| 64 CounterNode* previousInPreOrder() const; | 64 CounterNode* previousInPreOrder() const; |
| 65 CounterNode* nextInPreOrder(const CounterNode* stayWithin = 0) const; | 65 CounterNode* nextInPreOrder(const CounterNode* stayWithin = nullptr) const; |
| 66 CounterNode* nextInPreOrderAfterChildren(const CounterNode* stayWithin = 0)
const; | 66 CounterNode* nextInPreOrderAfterChildren(const CounterNode* stayWithin = nul
lptr) const; |
| 67 | 67 |
| 68 void insertAfter(CounterNode* newChild, CounterNode* beforeChild, const Atom
icString& identifier); | 68 void insertAfter(CounterNode* newChild, CounterNode* beforeChild, const Atom
icString& identifier); |
| 69 | 69 |
| 70 // identifier must match the identifier of this counter. | 70 // identifier must match the identifier of this counter. |
| 71 void removeChild(CounterNode*); | 71 void removeChild(CounterNode*); |
| 72 | 72 |
| 73 private: | 73 private: |
| 74 CounterNode(LayoutObject&, bool isReset, int value); | 74 CounterNode(LayoutObject&, bool isReset, int value); |
| 75 int computeCountInParent() const; | 75 int computeCountInParent() const; |
| 76 // Invalidates the text in the layoutObject of this counter, if any, | 76 // Invalidates the text in the layoutObject of this counter, if any, |
| (...skipping 15 matching lines...) Expand all Loading... |
| 92 }; | 92 }; |
| 93 | 93 |
| 94 } // namespace blink | 94 } // namespace blink |
| 95 | 95 |
| 96 #ifndef NDEBUG | 96 #ifndef NDEBUG |
| 97 // Outside the WebCore namespace for ease of invocation from gdb. | 97 // Outside the WebCore namespace for ease of invocation from gdb. |
| 98 void showCounterTree(const blink::CounterNode*); | 98 void showCounterTree(const blink::CounterNode*); |
| 99 #endif | 99 #endif |
| 100 | 100 |
| 101 #endif // CounterNode_h | 101 #endif // CounterNode_h |
| OLD | NEW |