Searched refs:m_unusedNodesMap (Results 1 – 2 of 2) sorted by relevance
107 OwnPtr<Digest> newInfo = createDigest(newDocument->documentElement(), &m_unusedNodesMap); in patchDocument()148 newList.append(createDigest(child, &m_unusedNodesMap)); in patchNode()205 m_unusedNodesMap.remove(newDigest->m_sha1); in innerPatchNode()329 …if (!m_unusedNodesMap.contains(oldList[i]->m_sha1) && (!i || oldMap[i - 1].first) && (i == oldMap.… in innerPatchChildren()469 UnusedNodesMap::iterator it = m_unusedNodesMap.find(oldDigest->m_sha1); in removeChildAndMoveToNew()470 if (it != m_unusedNodesMap.end()) { in removeChildAndMoveToNew()493 m_unusedNodesMap.remove(first->m_sha1); in markNodeAsUsed()
77 UnusedNodesMap m_unusedNodesMap; variable