C++ const_iterator::get方法代码示例

	Node* NodeList::getNodeByTag(int tag) const
	{
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter) {
			if (iter->get()->m_tag == tag)
				return iter->get();
		}
		
		return 0;
	}

static void willRemoveChildren(ContainerNode* container)
{
    NodeVector children;
    getChildNodes(container, children);

    container->document()->nodeChildrenWillBeRemoved(container);

#if ENABLE(MUTATION_OBSERVERS)
    ChildListMutationScope mutation(container);
#endif

    for (NodeVector::const_iterator it = children.begin(); it != children.end(); it++) {
        Node* child = it->get();

#if ENABLE(MUTATION_OBSERVERS)
        mutation.willRemoveChild(child);
        child->notifyMutationObserversNodeWillDetach();
#endif
#if ENABLE(UNDO_MANAGER)
        if (UndoManager::isRecordingAutomaticTransaction(container))
            UndoManager::addTransactionStep(NodeRemovingDOMTransactionStep::create(container, child));
#endif

        // fire removed from document mutation events.
        dispatchChildRemovalEvents(child);
    }

    ChildFrameDisconnector(container, ChildFrameDisconnector::DoNotIncludeRoot).disconnect();
}

void ContainerNode::parserInsertBefore(PassRefPtr<Node> newChild, Node* nextChild)
{
    ASSERT(newChild);
    ASSERT(nextChild);
    ASSERT(nextChild->parentNode() == this);

    NodeVector targets;
    collectTargetNodes(newChild.get(), targets);
    if (targets.isEmpty())
        return;

    if (nextChild->previousSibling() == newChild || nextChild == newChild) // nothing to do
        return;

    RefPtr<Node> next = nextChild;
    RefPtr<Node> nextChildPreviousSibling = nextChild->previousSibling();
    for (NodeVector::const_iterator it = targets.begin(); it != targets.end(); ++it) {
        Node* child = it->get();

        insertBeforeCommon(next.get(), child);

        childrenChanged(true, nextChildPreviousSibling.get(), nextChild, 1);
        ChildNodeInsertionNotifier(this).notify(child);
    }
}

	void NodeList::allSpritesUseSelfRender()
	{
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter) {
			Sprite* sprite = iter->get()->toSprite();
			if (sprite)
				sprite->useSelfRender();
		}
	}

	void NodeList::markObjects(AJ::MarkStack &markStack, unsigned markID)
	{
		if (isMarked(markID))
			return;
		
		DirectWrapper<AJNodeList>::markObjects(markStack, markID);
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter)
			iter->get()->markObjects(markStack, markID);
	}

	bool NodeList::pointInside(const Point& p, PlatformTouchEvent* event)
	{
		for (NodeVector::const_iterator it = m_nodes.begin(); it != m_nodes.end(); ++it) {
			Node* child = it->get();
			//AffineTransform transform = child->parentToNodeTransform();
			//Point childP = PointApplyAffineTransform(p, transform);
			Point childP = child->convertParentToNodeSpace(p);
			if (child->pointInside(childP, event))
				return true;
		}
		
		return false;
	}

static void willRemoveChildren(ContainerNode* container)
{
    NodeVector children;
    getChildNodes(container, children);

    container->document()->nodeChildrenWillBeRemoved(container);

    ChildListMutationScope mutation(container);
    for (NodeVector::const_iterator it = children.begin(); it != children.end(); it++) {
        Node* child = it->get();
        mutation.willRemoveChild(child);
        child->notifyMutationObserversNodeWillDetach();

        // fire removed from document mutation events.
        dispatchChildRemovalEvents(child);
    }

    ChildFrameDisconnector(container).disconnect(ChildFrameDisconnector::DescendantsOnly);
}

	void NodeList::allCleanup()
	{
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter)
			iter->get()->cleanup();
	}

	void NodeList::allOnEnterTransitionDidFinish()
	{
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter)
			iter->get()->onEnterTransitionDidFinish();
	}

	void NodeList::setAllParent(Node* parent)
	{
		for (NodeVector::const_iterator iter = m_nodes.begin(); iter != m_nodes.end(); ++iter)
			iter->get()->setParent(parent);
	}