| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights |
| 5 * reserved. | 5 * reserved. |
| 6 * | 6 * |
| 7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
| 8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
| 9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
| 10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
| (...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 46 // mergeNextSiblingNodesIfPossible() merges next sibling nodes if possible | 46 // mergeNextSiblingNodesIfPossible() merges next sibling nodes if possible |
| 47 // then returns a node not merged. | 47 // then returns a node not merged. |
| 48 Node* mergeNextSiblingNodesIfPossible(); | 48 Node* mergeNextSiblingNodesIfPossible(); |
| 49 Text* splitText(unsigned offset, ExceptionState&); | 49 Text* splitText(unsigned offset, ExceptionState&); |
| 50 | 50 |
| 51 // DOM Level 3: http://www.w3.org/TR/DOM-Level-3-Core/core.html#ID-1312295772 | 51 // DOM Level 3: http://www.w3.org/TR/DOM-Level-3-Core/core.html#ID-1312295772 |
| 52 | 52 |
| 53 String wholeText() const; | 53 String wholeText() const; |
| 54 Text* replaceWholeText(const String&); | 54 Text* replaceWholeText(const String&); |
| 55 | 55 |
| 56 void recalcTextStyle(StyleRecalcChange, Text* nextTextSibling); | 56 void recalcTextStyle(StyleRecalcChange); |
| 57 void rebuildTextLayoutTree(); | 57 void rebuildTextLayoutTree(Text* nextTextSibling); |
| 58 bool textLayoutObjectIsNeeded(const ComputedStyle&, | 58 bool textLayoutObjectIsNeeded(const ComputedStyle&, |
| 59 const LayoutObject& parent) const; | 59 const LayoutObject& parent) const; |
| 60 LayoutText* createTextLayoutObject(const ComputedStyle&); | 60 LayoutText* createTextLayoutObject(const ComputedStyle&); |
| 61 void updateTextLayoutObject(unsigned offsetOfReplacedData, | 61 void updateTextLayoutObject(unsigned offsetOfReplacedData, |
| 62 unsigned lengthOfReplacedData); | 62 unsigned lengthOfReplacedData); |
| 63 | 63 |
| 64 void attachLayoutTree(const AttachContext& = AttachContext()) final; | 64 void attachLayoutTree(const AttachContext& = AttachContext()) final; |
| 65 void reattachLayoutTreeIfNeeded(const AttachContext& = AttachContext()); | 65 void reattachLayoutTreeIfNeeded(const AttachContext& = AttachContext()); |
| 66 | 66 |
| 67 bool canContainRangeEndPoint() const final { return true; } | 67 bool canContainRangeEndPoint() const final { return true; } |
| (...skipping 15 matching lines...) Expand all Loading... |
| 83 bool needsWhitespaceLayoutObject(); | 83 bool needsWhitespaceLayoutObject(); |
| 84 | 84 |
| 85 virtual Text* cloneWithData(const String&); | 85 virtual Text* cloneWithData(const String&); |
| 86 }; | 86 }; |
| 87 | 87 |
| 88 DEFINE_NODE_TYPE_CASTS(Text, isTextNode()); | 88 DEFINE_NODE_TYPE_CASTS(Text, isTextNode()); |
| 89 | 89 |
| 90 } // namespace blink | 90 } // namespace blink |
| 91 | 91 |
| 92 #endif // Text_h | 92 #endif // Text_h |
| OLD | NEW |