2 * Copyright (C) 2012 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
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
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.
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.
31 #ifndef DOMPatchSupport_h
32 #define DOMPatchSupport_h
34 #include "platform/heap/Handle.h"
35 #include "wtf/HashMap.h"
36 #include "wtf/OwnPtr.h"
37 #include "wtf/PassOwnPtr.h"
38 #include "wtf/Vector.h"
39 #include "wtf/text/WTFString.h"
49 class DOMPatchSupport final {
51 WTF_MAKE_NONCOPYABLE(DOMPatchSupport);
53 static void patchDocument(Document&, const String& markup);
55 DOMPatchSupport(DOMEditor*, Document&);
57 void patchDocument(const String& markup);
58 Node* patchNode(Node*, const String& markup, ExceptionState&);
62 typedef Vector<pair<Digest*, size_t> > ResultMap;
63 typedef HashMap<String, Digest*> UnusedNodesMap;
65 bool innerPatchNode(Digest* oldNode, Digest* newNode, ExceptionState&);
66 std::pair<ResultMap, ResultMap> diff(const Vector<OwnPtr<Digest> >& oldChildren, const Vector<OwnPtr<Digest> >& newChildren);
67 bool innerPatchChildren(ContainerNode*, const Vector<OwnPtr<Digest> >& oldChildren, const Vector<OwnPtr<Digest> >& newChildren, ExceptionState&);
68 PassOwnPtr<Digest> createDigest(Node*, UnusedNodesMap*);
69 bool insertBeforeAndMarkAsUsed(ContainerNode*, Digest*, Node* anchor, ExceptionState&);
70 bool removeChildAndMoveToNew(Digest*, ExceptionState&);
71 void markNodeAsUsed(Digest*);
72 #ifdef DEBUG_DOM_PATCH_SUPPORT
73 void dumpMap(const ResultMap&, const String& name);
75 Document& document() const { return *m_document; }
77 RawPtrWillBeMember<DOMEditor> m_domEditor;
78 RawPtrWillBeMember<Document> m_document;
80 UnusedNodesMap m_unusedNodesMap;
86 #endif // !defined(DOMPatchSupport_h)