Lines Matching defs:insertionPoint
47 void distributeTo(InsertionPoint*, ElementShadow*);
73 InsertionPoint* insertionPoint = toInsertionPoint(child);
74 for (size_t i = 0; i < insertionPoint->size(); ++i)
75 m_nodes.append(insertionPoint->at(i));
84 void DistributionPool::distributeTo(InsertionPoint* insertionPoint, ElementShadow* elementShadow)
92 if (isHTMLContentElement(*insertionPoint) && !toHTMLContentElement(insertionPoint)->canSelectNode(m_nodes, i))
97 elementShadow->didDistributeNode(node, insertionPoint);
102 if (insertionPoint->isContentInsertionPoint() && distribution.isEmpty()) {
103 for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling()) {
105 elementShadow->didDistributeNode(fallbackNode, insertionPoint);
108 insertionPoint->setDistribution(distribution);
240 const InsertionPoint* ElementShadow::finalDestinationInsertionPointFor(const Node* key) const
262 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& insertionPoints = root->descendantInsertionPoints();
264 InsertionPoint* point = insertionPoints[i].get();
297 void ElementShadow::didDistributeNode(const Node* node, InsertionPoint* insertionPoint)
300 result.storedValue->value.append(insertionPoint);
