| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 2 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011 Apple Inc. All r
ights 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 266 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 277 TextDirection direction() const { return m_bidiEmbeddingLevel % 2 ? RTL : LT
R; } | 277 TextDirection direction() const { return m_bidiEmbeddingLevel % 2 ? RTL : LT
R; } |
| 278 bool isLeftToRightDirection() const { return direction() == LTR; } | 278 bool isLeftToRightDirection() const { return direction() == LTR; } |
| 279 int caretLeftmostOffset() const { return isLeftToRightDirection() ? caretMin
Offset() : caretMaxOffset(); } | 279 int caretLeftmostOffset() const { return isLeftToRightDirection() ? caretMin
Offset() : caretMaxOffset(); } |
| 280 int caretRightmostOffset() const { return isLeftToRightDirection() ? caretMa
xOffset() : caretMinOffset(); } | 280 int caretRightmostOffset() const { return isLeftToRightDirection() ? caretMa
xOffset() : caretMinOffset(); } |
| 281 | 281 |
| 282 virtual void clearTruncation() { } | 282 virtual void clearTruncation() { } |
| 283 | 283 |
| 284 bool isDirty() const { return m_dirty; } | 284 bool isDirty() const { return m_dirty; } |
| 285 void markDirty(bool dirty = true) { m_dirty = dirty; } | 285 void markDirty(bool dirty = true) { m_dirty = dirty; } |
| 286 | 286 |
| 287 void dirtyLineBoxes(); | 287 virtual void dirtyLineBoxes(); |
| 288 | 288 |
| 289 virtual RenderObject::SelectionState selectionState(); | 289 virtual RenderObject::SelectionState selectionState(); |
| 290 | 290 |
| 291 virtual bool canAccommodateEllipsis(bool ltr, int blockEdge, int ellipsisWid
th); | 291 virtual bool canAccommodateEllipsis(bool ltr, int blockEdge, int ellipsisWid
th); |
| 292 // visibleLeftEdge, visibleRightEdge are in the parent's coordinate system. | 292 // visibleLeftEdge, visibleRightEdge are in the parent's coordinate system. |
| 293 virtual float placeEllipsisBox(bool ltr, float visibleLeftEdge, float visibl
eRightEdge, float ellipsisWidth, bool&); | 293 virtual float placeEllipsisBox(bool ltr, float visibleLeftEdge, float visibl
eRightEdge, float ellipsisWidth, bool&); |
| 294 | 294 |
| 295 void setHasBadParent(); | 295 void setHasBadParent(); |
| 296 | 296 |
| 297 int expansion() const { return m_expansion; } | 297 int expansion() const { return m_expansion; } |
| (...skipping 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 381 | 381 |
| 382 } // namespace WebCore | 382 } // namespace WebCore |
| 383 | 383 |
| 384 #ifndef NDEBUG | 384 #ifndef NDEBUG |
| 385 // Outside the WebCore namespace for ease of invocation from gdb. | 385 // Outside the WebCore namespace for ease of invocation from gdb. |
| 386 void showTree(const WebCore::InlineBox*); | 386 void showTree(const WebCore::InlineBox*); |
| 387 void showLineTree(const WebCore::InlineBox*); | 387 void showLineTree(const WebCore::InlineBox*); |
| 388 #endif | 388 #endif |
| 389 | 389 |
| 390 #endif // InlineBox_h | 390 #endif // InlineBox_h |
| OLD | NEW |