| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2003, 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. | 2 * Copyright (C) 2003, 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
| 5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
| 6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
| 7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
| 8 * | 8 * |
| 9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
| 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| (...skipping 74 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 85 void setPreviousLineBox(InlineFlowBox* p) { m_prevLineBox = p; } | 85 void setPreviousLineBox(InlineFlowBox* p) { m_prevLineBox = p; } |
| 86 | 86 |
| 87 InlineBox* firstChild() const { checkConsistency(); return m_firstChild; } | 87 InlineBox* firstChild() const { checkConsistency(); return m_firstChild; } |
| 88 InlineBox* lastChild() const { checkConsistency(); return m_lastChild; } | 88 InlineBox* lastChild() const { checkConsistency(); return m_lastChild; } |
| 89 | 89 |
| 90 bool isLeaf() const final { return false; } | 90 bool isLeaf() const final { return false; } |
| 91 | 91 |
| 92 InlineBox* firstLeafChild() const; | 92 InlineBox* firstLeafChild() const; |
| 93 InlineBox* lastLeafChild() const; | 93 InlineBox* lastLeafChild() const; |
| 94 | 94 |
| 95 typedef void (*CustomInlineBoxRangeReverse)(void* userData, Vector<InlineBox
*>::iterator first, Vector<InlineBox*>::iterator last); | 95 typedef void (*CustomInlineBoxRangeReverse)(Vector<InlineBox*>::iterator fir
st, Vector<InlineBox*>::iterator last); |
| 96 void collectLeafBoxesInLogicalOrder(Vector<InlineBox*>&, CustomInlineBoxRang
eReverse customReverseImplementation = 0, void* userData = nullptr) const; | 96 void collectLeafBoxesInLogicalOrder(Vector<InlineBox*>&, CustomInlineBoxRang
eReverse customReverseImplementation = 0) const; |
| 97 | 97 |
| 98 void setConstructed() final | 98 void setConstructed() final |
| 99 { | 99 { |
| 100 InlineBox::setConstructed(); | 100 InlineBox::setConstructed(); |
| 101 for (InlineBox* child = firstChild(); child; child = child->nextOnLine()
) | 101 for (InlineBox* child = firstChild(); child; child = child->nextOnLine()
) |
| 102 child->setConstructed(); | 102 child->setConstructed(); |
| 103 } | 103 } |
| 104 | 104 |
| 105 void addToLine(InlineBox* child); | 105 void addToLine(InlineBox* child); |
| 106 void deleteLine() final; | 106 void deleteLine() final; |
| (...skipping 259 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 366 inline void InlineFlowBox::setHasBadChildList() | 366 inline void InlineFlowBox::setHasBadChildList() |
| 367 { | 367 { |
| 368 #if ENABLE(ASSERT) | 368 #if ENABLE(ASSERT) |
| 369 m_hasBadChildList = true; | 369 m_hasBadChildList = true; |
| 370 #endif | 370 #endif |
| 371 } | 371 } |
| 372 | 372 |
| 373 } // namespace blink | 373 } // namespace blink |
| 374 | 374 |
| 375 #endif // InlineFlowBox_h | 375 #endif // InlineFlowBox_h |
| OLD | NEW |