-
Notifications
You must be signed in to change notification settings - Fork 6.6k
/
dom_patch_support.h
98 lines (83 loc) · 3.74 KB
/
dom_patch_support.h
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
/*
* Copyright (C) 2012 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.
*/
#ifndef THIRD_PARTY_BLINK_RENDERER_CORE_INSPECTOR_DOM_PATCH_SUPPORT_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_INSPECTOR_DOM_PATCH_SUPPORT_H_
#include "third_party/blink/renderer/platform/heap/handle.h"
#include "third_party/blink/renderer/platform/wtf/hash_map.h"
#include "third_party/blink/renderer/platform/wtf/text/wtf_string.h"
#include "third_party/blink/renderer/platform/wtf/vector.h"
namespace blink {
class ContainerNode;
class DOMEditor;
class Document;
class ExceptionState;
class Node;
class DOMPatchSupport final {
STACK_ALLOCATED();
public:
DOMPatchSupport(DOMEditor*, Document&);
DOMPatchSupport(const DOMPatchSupport&) = delete;
DOMPatchSupport& operator=(const DOMPatchSupport&) = delete;
void PatchDocument(const String& markup);
Node* PatchNode(Node*, const String& markup, ExceptionState&);
private:
class Digest final : public GarbageCollected<Digest> {
public:
explicit Digest(Node* node) : node_(node) {}
void Trace(Visitor*) const;
String sha1_;
String attrs_sha1_;
Member<Node> node_;
HeapVector<Member<Digest>> children_;
};
typedef HeapVector<std::pair<Member<Digest>, wtf_size_t>> ResultMap;
typedef HeapHashMap<String, Member<Digest>> UnusedNodesMap;
bool InnerPatchNode(Digest* old_node, Digest* new_node, ExceptionState&);
std::pair<ResultMap, ResultMap> Diff(
const HeapVector<Member<Digest>>& old_children,
const HeapVector<Member<Digest>>& new_children);
bool InnerPatchChildren(ContainerNode*,
const HeapVector<Member<Digest>>& old_children,
const HeapVector<Member<Digest>>& new_children,
ExceptionState&);
Digest* CreateDigest(Node*, UnusedNodesMap*);
bool InsertBeforeAndMarkAsUsed(ContainerNode*,
Digest*,
Node* anchor,
ExceptionState&);
bool RemoveChildAndMoveToNew(Digest*, ExceptionState&);
void MarkNodeAsUsed(Digest*);
Document& GetDocument() const { return *document_; }
DOMEditor* dom_editor_;
Document* document_;
UnusedNodesMap unused_nodes_map_;
};
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_CORE_INSPECTOR_DOM_PATCH_SUPPORT_H_