本文整理汇总了C++中HTMLStackItem::findAttribute方法的典型用法代码示例。如果您正苦于以下问题：C++ HTMLStackItem::findAttribute方法的具体用法？C++ HTMLStackItem::findAttribute怎么用？C++ HTMLStackItem::findAttribute使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类HTMLStackItem的用法示例。
在下文中一共展示了HTMLStackItem::findAttribute方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: isHTMLIntegrationPoint
// http://www.whatwg.org/specs/web-apps/current-work/multipage/tree-construction.html#html-integration-point
bool HTMLElementStack::isHTMLIntegrationPoint(HTMLStackItem& item)
{
if (item.hasTagName(MathMLNames::annotation_xmlTag)) {
const Attribute* encodingAttr = item.findAttribute(MathMLNames::encodingAttr);
if (encodingAttr) {
const String& encoding = encodingAttr->value();
return equalLettersIgnoringASCIICase(encoding, "text/html")
|| equalLettersIgnoringASCIICase(encoding, "application/xhtml+xml");
}
return false;
}
return item.hasTagName(SVGNames::foreignObjectTag)
|| item.hasTagName(SVGNames::descTag)
|| item.hasTagName(SVGNames::titleTag);
}示例2: ensureNoahsArkCondition
void HTMLFormattingElementList::ensureNoahsArkCondition(HTMLStackItem* newItem)
{
Vector<HTMLStackItem*> candidates;
tryToEnsureNoahsArkConditionQuickly(newItem, candidates);
if (candidates.isEmpty())
return;
// We pre-allocate and re-use this second vector to save one malloc per
// attribute that we verify.
Vector<HTMLStackItem*> remainingCandidates;
remainingCandidates.reserveInitialCapacity(candidates.size());
const Vector<Attribute>& attributes = newItem->attributes();
for (size_t i = 0; i < attributes.size(); ++i) {
const Attribute& attribute = attributes[i];
for (size_t j = 0; j < candidates.size(); ++j) {
HTMLStackItem* candidate = candidates[j];
// These properties should already have been checked by tryToEnsureNoahsArkConditionQuickly.
ASSERT(newItem->attributes().size() == candidate->attributes().size());
ASSERT(newItem->localName() == candidate->localName() && newItem->namespaceURI() == candidate->namespaceURI());
const Attribute* candidateAttribute = candidate->findAttribute(attribute.name());
if (candidateAttribute && candidateAttribute->value() == attribute.value())
remainingCandidates.append(candidate);
}
if (remainingCandidates.size() < kNoahsArkCapacity)
return;
candidates.swap(remainingCandidates);
remainingCandidates.shrink(0);
}
// Inductively, we shouldn't spin this loop very many times. It's possible,
// however, that we wil spin the loop more than once because of how the
// formatting element list gets permuted.
for (size_t i = kNoahsArkCapacity - 1; i < candidates.size(); ++i)
remove(&candidates[i]->element());
}