1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "core/dom/MutationRecord.h"
#include "core/dom/Node.h"
#include "core/dom/NodeList.h"
#include "core/dom/QualifiedName.h"
#include "core/dom/StaticNodeList.h"
#include "wtf/StdLibExtras.h"
namespace WebCore {
namespace {
class ChildListRecord : public MutationRecord {
public:
ChildListRecord(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling)
: m_target(target)
, m_addedNodes(added)
, m_removedNodes(removed)
, m_previousSibling(previousSibling)
, m_nextSibling(nextSibling)
{
}
private:
virtual const AtomicString& type() OVERRIDE;
virtual Node* target() OVERRIDE { return m_target.get(); }
virtual NodeList* addedNodes() OVERRIDE { return m_addedNodes.get(); }
virtual NodeList* removedNodes() OVERRIDE { return m_removedNodes.get(); }
virtual Node* previousSibling() OVERRIDE { return m_previousSibling.get(); }
virtual Node* nextSibling() OVERRIDE { return m_nextSibling.get(); }
RefPtr<Node> m_target;
RefPtr<NodeList> m_addedNodes;
RefPtr<NodeList> m_removedNodes;
RefPtr<Node> m_previousSibling;
RefPtr<Node> m_nextSibling;
};
class RecordWithEmptyNodeLists : public MutationRecord {
public:
RecordWithEmptyNodeLists(PassRefPtr<Node> target, const String& oldValue)
: m_target(target)
, m_oldValue(oldValue)
{
}
private:
virtual Node* target() OVERRIDE { return m_target.get(); }
virtual String oldValue() OVERRIDE { return m_oldValue; }
virtual NodeList* addedNodes() OVERRIDE { return lazilyInitializeEmptyNodeList(m_addedNodes); }
virtual NodeList* removedNodes() OVERRIDE { return lazilyInitializeEmptyNodeList(m_removedNodes); }
static NodeList* lazilyInitializeEmptyNodeList(RefPtr<NodeList>& nodeList)
{
if (!nodeList)
nodeList = StaticNodeList::createEmpty();
return nodeList.get();
}
RefPtr<Node> m_target;
String m_oldValue;
RefPtr<NodeList> m_addedNodes;
RefPtr<NodeList> m_removedNodes;
};
class AttributesRecord : public RecordWithEmptyNodeLists {
public:
AttributesRecord(PassRefPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue)
: RecordWithEmptyNodeLists(target, oldValue)
, m_attributeName(name.localName())
, m_attributeNamespace(name.namespaceURI())
{
}
private:
virtual const AtomicString& type() OVERRIDE;
virtual const AtomicString& attributeName() OVERRIDE { return m_attributeName; }
virtual const AtomicString& attributeNamespace() OVERRIDE { return m_attributeNamespace; }
AtomicString m_attributeName;
AtomicString m_attributeNamespace;
};
class CharacterDataRecord : public RecordWithEmptyNodeLists {
public:
CharacterDataRecord(PassRefPtr<Node> target, const String& oldValue)
: RecordWithEmptyNodeLists(target, oldValue)
{
}
private:
virtual const AtomicString& type() OVERRIDE;
};
class MutationRecordWithNullOldValue : public MutationRecord {
public:
MutationRecordWithNullOldValue(PassRefPtr<MutationRecord> record)
: m_record(record)
{
}
private:
virtual const AtomicString& type() OVERRIDE { return m_record->type(); }
virtual Node* target() OVERRIDE { return m_record->target(); }
virtual NodeList* addedNodes() OVERRIDE { return m_record->addedNodes(); }
virtual NodeList* removedNodes() OVERRIDE { return m_record->removedNodes(); }
virtual Node* previousSibling() OVERRIDE { return m_record->previousSibling(); }
virtual Node* nextSibling() OVERRIDE { return m_record->nextSibling(); }
virtual const AtomicString& attributeName() OVERRIDE { return m_record->attributeName(); }
virtual const AtomicString& attributeNamespace() OVERRIDE { return m_record->attributeNamespace(); }
virtual String oldValue() OVERRIDE { return String(); }
RefPtr<MutationRecord> m_record;
};
const AtomicString& ChildListRecord::type()
{
DEFINE_STATIC_LOCAL(AtomicString, childList, ("childList", AtomicString::ConstructFromLiteral));
return childList;
}
const AtomicString& AttributesRecord::type()
{
DEFINE_STATIC_LOCAL(AtomicString, attributes, ("attributes", AtomicString::ConstructFromLiteral));
return attributes;
}
const AtomicString& CharacterDataRecord::type()
{
DEFINE_STATIC_LOCAL(AtomicString, characterData, ("characterData", AtomicString::ConstructFromLiteral));
return characterData;
}
} // namespace
PassRefPtr<MutationRecord> MutationRecord::createChildList(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling)
{
return adoptRef(static_cast<MutationRecord*>(new ChildListRecord(target, added, removed, previousSibling, nextSibling)));
}
PassRefPtr<MutationRecord> MutationRecord::createAttributes(PassRefPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue)
{
return adoptRef(static_cast<MutationRecord*>(new AttributesRecord(target, name, oldValue)));
}
PassRefPtr<MutationRecord> MutationRecord::createCharacterData(PassRefPtr<Node> target, const String& oldValue)
{
return adoptRef(static_cast<MutationRecord*>(new CharacterDataRecord(target, oldValue)));
}
PassRefPtr<MutationRecord> MutationRecord::createWithNullOldValue(PassRefPtr<MutationRecord> record)
{
return adoptRef(static_cast<MutationRecord*>(new MutationRecordWithNullOldValue(record)));
}
MutationRecord::~MutationRecord()
{
}
} // namespace WebCore
|
