OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
61 typedef Vector<pair<Digest*, size_t> > ResultMap; | 61 typedef Vector<pair<Digest*, size_t> > ResultMap; |
62 typedef HashMap<String, Digest*> UnusedNodesMap; | 62 typedef HashMap<String, Digest*> UnusedNodesMap; |
63 | 63 |
64 void innerPatchNode(Digest* oldNode, Digest* newNode, ExceptionCode&); | 64 void innerPatchNode(Digest* oldNode, Digest* newNode, ExceptionCode&); |
65 std::pair<ResultMap, ResultMap> diff(const Vector<OwnPtr<Digest> >& oldChild
ren, const Vector<OwnPtr<Digest> >& newChildren); | 65 std::pair<ResultMap, ResultMap> diff(const Vector<OwnPtr<Digest> >& oldChild
ren, const Vector<OwnPtr<Digest> >& newChildren); |
66 void innerPatchChildren(ContainerNode*, const Vector<OwnPtr<Digest> >& oldCh
ildren, const Vector<OwnPtr<Digest> >& newChildren, ExceptionCode&); | 66 void innerPatchChildren(ContainerNode*, const Vector<OwnPtr<Digest> >& oldCh
ildren, const Vector<OwnPtr<Digest> >& newChildren, ExceptionCode&); |
67 PassOwnPtr<Digest> createDigest(Node*, UnusedNodesMap*); | 67 PassOwnPtr<Digest> createDigest(Node*, UnusedNodesMap*); |
68 void insertBefore(ContainerNode*, Digest*, Node* anchor, ExceptionCode&); | 68 void insertBefore(ContainerNode*, Digest*, Node* anchor, ExceptionCode&); |
69 void removeChild(Digest*, ExceptionCode&); | 69 void removeChild(Digest*, ExceptionCode&); |
70 void markNodeAsUsed(Digest*); | 70 void markNodeAsUsed(Digest*); |
| 71 #ifdef DEBUG_DOM_EDITOR |
| 72 void dumpMap(const ResultMap&, const String& name); |
| 73 #endif |
71 | 74 |
72 Document* m_document; | 75 Document* m_document; |
73 | 76 |
74 UnusedNodesMap m_unusedNodesMap; | 77 UnusedNodesMap m_unusedNodesMap; |
75 }; | 78 }; |
76 | 79 |
77 #endif // ENABLE(INSPECTOR) | 80 #endif // ENABLE(INSPECTOR) |
78 | 81 |
79 } // namespace WebCore | 82 } // namespace WebCore |
80 | 83 |
81 #endif // !defined(DOMEditor_h) | 84 #endif // !defined(DOMEditor_h) |
OLD | NEW |