1/*
2 * Copyright (C) 2012 Google Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met:
7 *
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
13 * distribution.
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
31#pragma once
32
33#include "ExceptionOr.h"
34#include <wtf/HashMap.h>
35#include <wtf/Vector.h>
36
37namespace WebCore {
38
39class ContainerNode;
40class DOMEditor;
41class Document;
42class Node;
43
44class DOMPatchSupport final {
45public:
46 DOMPatchSupport(DOMEditor&, Document&);
47
48 void patchDocument(const String& markup);
49 ExceptionOr<Node*> patchNode(Node&, const String& markup);
50
51private:
52 struct Digest;
53
54 using ResultMap = Vector<std::pair<Digest*, size_t>>;
55 using UnusedNodesMap = HashMap<String, Digest*>;
56
57 ExceptionOr<void> innerPatchNode(Digest& oldNode, Digest& newNode);
58 std::pair<ResultMap, ResultMap> diff(const Vector<std::unique_ptr<Digest>>& oldChildren, const Vector<std::unique_ptr<Digest>>& newChildren);
59 ExceptionOr<void> innerPatchChildren(ContainerNode&, const Vector<std::unique_ptr<Digest>>& oldChildren, const Vector<std::unique_ptr<Digest>>& newChildren);
60 std::unique_ptr<Digest> createDigest(Node&, UnusedNodesMap*);
61 ExceptionOr<void> insertBeforeAndMarkAsUsed(ContainerNode&, Digest&, Node* anchor);
62 ExceptionOr<void> removeChildAndMoveToNew(Digest&);
63 void markNodeAsUsed(Digest&);
64
65#ifdef DEBUG_DOM_PATCH_SUPPORT
66 void dumpMap(const ResultMap&, const String& name);
67#endif
68
69 DOMEditor& m_domEditor;
70 Document& m_document;
71
72 UnusedNodesMap m_unusedNodesMap;
73};
74
75} // namespace WebCore
76