| 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, 2008, 2009 Apple Inc. All rights reserv
ed. | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2008, 2009 Apple Inc. All rights reserv
ed. |
| 5 * | 5 * |
| 6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
| 7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
| 8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
| 9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
| 10 * | 10 * |
| (...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 50 StringImpl* dataImpl() { return m_data.impl(); } | 50 StringImpl* dataImpl() { return m_data.impl(); } |
| 51 | 51 |
| 52 void parserAppendData(const String&); | 52 void parserAppendData(const String&); |
| 53 | 53 |
| 54 protected: | 54 protected: |
| 55 CharacterData(TreeScope& treeScope, const String& text, ConstructionType typ
e) | 55 CharacterData(TreeScope& treeScope, const String& text, ConstructionType typ
e) |
| 56 : Node(&treeScope, type) | 56 : Node(&treeScope, type) |
| 57 , m_data(!text.isNull() ? text : emptyString()) | 57 , m_data(!text.isNull() ? text : emptyString()) |
| 58 { | 58 { |
| 59 ASSERT(type == CreateOther || type == CreateText || type == CreateEditin
gText); | 59 ASSERT(type == CreateOther || type == CreateText || type == CreateEditin
gText); |
| 60 ScriptWrappable::init(this); | |
| 61 } | 60 } |
| 62 | 61 |
| 63 void setDataWithoutUpdate(const String& data) | 62 void setDataWithoutUpdate(const String& data) |
| 64 { | 63 { |
| 65 ASSERT(!data.isNull()); | 64 ASSERT(!data.isNull()); |
| 66 m_data = data; | 65 m_data = data; |
| 67 } | 66 } |
| 68 void didModifyData(const String& oldValue); | 67 void didModifyData(const String& oldValue); |
| 69 | 68 |
| 70 String m_data; | 69 String m_data; |
| 71 | 70 |
| 72 private: | 71 private: |
| 73 virtual String nodeValue() const OVERRIDE FINAL; | 72 virtual String nodeValue() const OVERRIDE FINAL; |
| 74 virtual void setNodeValue(const String&) OVERRIDE FINAL; | 73 virtual void setNodeValue(const String&) OVERRIDE FINAL; |
| 75 virtual bool isCharacterDataNode() const OVERRIDE FINAL { return true; } | 74 virtual bool isCharacterDataNode() const OVERRIDE FINAL { return true; } |
| 76 virtual int maxCharacterOffset() const OVERRIDE FINAL; | 75 virtual int maxCharacterOffset() const OVERRIDE FINAL; |
| 77 virtual bool offsetInCharacters() const OVERRIDE FINAL; | 76 virtual bool offsetInCharacters() const OVERRIDE FINAL; |
| 78 void setDataAndUpdate(const String&, unsigned offsetOfReplacedData, unsigned
oldLength, unsigned newLength, RecalcStyleBehavior = DoNotRecalcStyle); | 77 void setDataAndUpdate(const String&, unsigned offsetOfReplacedData, unsigned
oldLength, unsigned newLength, RecalcStyleBehavior = DoNotRecalcStyle); |
| 79 | 78 |
| 80 bool isContainerNode() const WTF_DELETED_FUNCTION; // This will catch anyone
doing an unnecessary check. | 79 bool isContainerNode() const WTF_DELETED_FUNCTION; // This will catch anyone
doing an unnecessary check. |
| 81 bool isElementNode() const WTF_DELETED_FUNCTION; // This will catch anyone d
oing an unnecessary check. | 80 bool isElementNode() const WTF_DELETED_FUNCTION; // This will catch anyone d
oing an unnecessary check. |
| 82 }; | 81 }; |
| 83 | 82 |
| 84 DEFINE_NODE_TYPE_CASTS(CharacterData, isCharacterDataNode()); | 83 DEFINE_NODE_TYPE_CASTS(CharacterData, isCharacterDataNode()); |
| 85 | 84 |
| 86 } // namespace blink | 85 } // namespace blink |
| 87 | 86 |
| 88 #endif // CharacterData_h | 87 #endif // CharacterData_h |
| OLD | NEW |