Lines Matching refs:newList
147 Vector<OwnPtr<Digest> > newList;
149 newList.append(createDigest(child, 0));
155 newList.append(createDigest(child, &m_unusedNodesMap));
158 newList.append(createDigest(child, 0));
160 if (!innerPatchChildren(parentNode, oldList, newList, exceptionState)) {
213 DOMPatchSupport::diff(const Vector<OwnPtr<Digest> >& oldList, const Vector<OwnPtr<Digest> >& newList)
215 ResultMap newMap(newList.size());
229 for (size_t i = 0; i < oldList.size() && i < newList.size() && oldList[i]->m_sha1 == newList[i]->m_sha1; ++i) {
232 newMap[i].first = newList[i].get();
235 for (size_t i = 0; i < oldList.size() && i < newList.size() && oldList[oldList.size() - i - 1]->m_sha1 == newList[newList.size() - i - 1]->m_sha1; ++i) {
237 size_t newIndex = newList.size() - i - 1;
240 newMap[newIndex].first = newList[newIndex].get();
248 for (size_t i = 0; i < newList.size(); ++i) {
249 newTable.add(newList[i]->m_sha1, Vector<size_t>()).storedValue->value.append(i);
264 newMap[newIt->value[0]] = std::make_pair(newList[newIt->value[0]].get(), oldIt->value[0]);
268 for (size_t i = 0; newList.size() > 0 && i < newList.size() - 1; ++i) {
273 if (j < oldMap.size() && !oldMap[j].first && newList[i + 1]->m_sha1 == oldList[j]->m_sha1) {
274 newMap[i + 1] = std::make_pair(newList[i + 1].get(), j);
279 for (size_t i = newList.size() - 1; newList.size() > 0 && i > 0; --i) {
284 if (!oldMap[j].first && newList[i - 1]->m_sha1 == oldList[j]->m_sha1) {
285 newMap[i - 1] = std::make_pair(newList[i - 1].get(), j);
298 bool DOMPatchSupport::innerPatchChildren(ContainerNode* parentNode, const Vector<OwnPtr<Digest> >& oldList, const Vector<OwnPtr<Digest> >& newList, ExceptionState& exceptionState)
300 pair<ResultMap, ResultMap> resultMaps = diff(oldList, newList);
333 if (anchorAfter - anchorCandidate == 1 && anchorCandidate < newList.size())
334 merges.set(newList[anchorCandidate].get(), oldList[i].get());
347 for (size_t i = 0; i < newList.size(); ++i) {
363 for (size_t i = 0; i < newList.size(); ++i) {
364 if (oldHead && isHTMLHeadElement(*newList[i]->m_node))
365 merges.set(newList[i].get(), oldHead);
366 if (oldBody && isHTMLBodyElement(*newList[i]->m_node))
367 merges.set(newList[i].get(), oldBody);
379 if (newMap[i].first || merges.contains(newList[i].get()))
381 if (!insertBeforeAndMarkAsUsed(parentNode, newList[i].get(), NodeTraversal::childAt(*parentNode, i), exceptionState))