Lines Matching refs:digest
59 struct DOMPatchSupport::Digest {
60 explicit Digest(Node* node) : m_node(node) { }
65 Vector<OwnPtr<Digest> > m_children;
103 OwnPtr<Digest> oldInfo = createDigest(m_document.documentElement(), 0);
104 OwnPtr<Digest> newInfo = createDigest(newDocument->documentElement(), &m_unusedNodesMap);
139 Vector<OwnPtr<Digest> > oldList;
145 Vector<OwnPtr<Digest> > newList;
166 bool DOMPatchSupport::innerPatchNode(Digest* oldDigest, Digest* newDigest, ExceptionState& exceptionState)
215 DOMPatchSupport::diff(const Vector<OwnPtr<Digest> >& oldList, const Vector<OwnPtr<Digest> >& newList)
300 bool DOMPatchSupport::innerPatchChildren(ContainerNode* parentNode, const Vector<OwnPtr<Digest> >& oldList, const Vector<OwnPtr<Digest> >& newList, ExceptionState& exceptionState)
306 Digest* oldHead = 0;
307 Digest* oldBody = 0;
310 HashMap<Digest*, Digest*> merges;
374 for (HashMap<Digest*, Digest*>::iterator it = merges.begin(); it != merges.end(); ++it) {
409 PassOwnPtr<DOMPatchSupport::Digest> DOMPatchSupport::createDigest(Node* node, UnusedNodesMap* unusedNodesMap)
411 Digest* digest = new Digest(node);
425 OwnPtr<Digest> childInfo = createDigest(child, unusedNodesMap);
428 digest->m_children.append(childInfo.release());
440 digest->m_attrsSHA1 = base64Encode(reinterpret_cast<const char*>(digestResult.data()), 10);
441 addStringToDigestor(digestor.get(), digest->m_attrsSHA1);
446 digest->m_sha1 = base64Encode(reinterpret_cast<const char*>(digestResult.data()), 10);
449 unusedNodesMap->add(digest->m_sha1, digest);
450 return adoptPtr(digest);
453 bool DOMPatchSupport::insertBeforeAndMarkAsUsed(ContainerNode* parentNode, Digest* digest, Node* anchor, ExceptionState& exceptionState)
455 bool result = m_domEditor->insertBefore(parentNode, digest->m_node, anchor, exceptionState);
456 markNodeAsUsed(digest);
460 bool DOMPatchSupport::removeChildAndMoveToNew(Digest* oldDigest, ExceptionState& exceptionState)
468 // prior to dropping the original node on the floor, check whether new DOM has a digest
473 Digest* newDigest = it->value;
489 void DOMPatchSupport::markNodeAsUsed(Digest* digest)
491 Deque<Digest*> queue;
492 queue.append(digest);
494 Digest* first = queue.takeFirst();
