本文整理汇总了C++中HeapVector::find方法的典型用法代码示例。如果您正苦于以下问题：C++ HeapVector::find方法的具体用法？C++ HeapVector::find怎么用？C++ HeapVector::find使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类HeapVector的用法示例。
在下文中一共展示了HeapVector::find方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: remove
void TextTrackList::remove(TextTrack* track)
{
HeapVector<Member<TextTrack>>* tracks = nullptr;
if (track->trackType() == TextTrack::TrackElement) {
tracks = &m_elementTracks;
} else if (track->trackType() == TextTrack::AddTrack) {
tracks = &m_addTrackTracks;
} else if (track->trackType() == TextTrack::InBand) {
tracks = &m_inbandTracks;
} else {
ASSERT_NOT_REACHED();
}
size_t index = tracks->find(track);
if (index == kNotFound)
return;
invalidateTrackIndexesAfterTrack(track);
ASSERT(track->trackList() == this);
track->setTrackList(0);
tracks->remove(index);
scheduleRemoveTrackEvent(track);
}示例2: next
Element* SlotScopedTraversal::next(const Element& current)
{
// current.assignedSlot returns a slot only when current is assigned explicitly
// If current is assigned to a slot, return a descendant of current, which is in the assigned scope of the same slot as current.
HTMLSlotElement* slot = current.assignedSlot();
Element* nearestAncestorAssignedToSlot = SlotScopedTraversal::nearestAncestorAssignedToSlot(current);
if (slot) {
if (Element* next = ElementTraversal::next(current, ¤t))
return next;
} else {
// If current is in assigned scope, find an assigned ancestor.
ASSERT(nearestAncestorAssignedToSlot);
if (Element* next = ElementTraversal::next(current, nearestAncestorAssignedToSlot))
return next;
slot = nearestAncestorAssignedToSlot->assignedSlot();
ASSERT(slot);
}
HeapVector<Member<Node>> assignedNodes = slot->getAssignedNodes();
size_t currentIndex = assignedNodes.find(*nearestAncestorAssignedToSlot);
ASSERT(currentIndex != kNotFound);
for (++currentIndex; currentIndex < assignedNodes.size(); ++currentIndex) {
if (assignedNodes[currentIndex]->isElementNode())
return toElement(assignedNodes[currentIndex]);
}
return nullptr;
}示例3: invalidateTrackIndexesAfterTrack
void TextTrackList::invalidateTrackIndexesAfterTrack(TextTrack* track)
{
HeapVector<Member<TextTrack>>* tracks = nullptr;
if (track->trackType() == TextTrack::TrackElement) {
tracks = &m_elementTracks;
for (size_t i = 0; i < m_addTrackTracks.size(); ++i)
m_addTrackTracks[i]->invalidateTrackIndex();
for (size_t i = 0; i < m_inbandTracks.size(); ++i)
m_inbandTracks[i]->invalidateTrackIndex();
} else if (track->trackType() == TextTrack::AddTrack) {
tracks = &m_addTrackTracks;
for (size_t i = 0; i < m_inbandTracks.size(); ++i)
m_inbandTracks[i]->invalidateTrackIndex();
} else if (track->trackType() == TextTrack::InBand) {
tracks = &m_inbandTracks;
} else {
ASSERT_NOT_REACHED();
}
size_t index = tracks->find(track);
if (index == kNotFound)
return;
for (size_t i = index; i < tracks->size(); ++i)
tracks->at(index)->invalidateTrackIndex();
}