2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
3 * (C) 1999 Antti Koivisto (koivisto@kde.org)
4 * (C) 2001 Dirk Mueller (mueller@kde.org)
5 * Copyright (C) 2004, 2007, 2008 Apple Inc. All rights reserved.
6 * Copyright (C) 2014 Samsung Electronics. All rights reserved.
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Library General Public
10 * License as published by the Free Software Foundation; either
11 * version 2 of the License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Library General Public License for more details.
18 * You should have received a copy of the GNU Library General Public License
19 * along with this library; see the file COPYING.LIB. If not, write to
20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 * Boston, MA 02110-1301, USA.
25 #include "core/dom/ChildNodeList.h"
27 #include "core/dom/Element.h"
28 #include "core/dom/NodeRareData.h"
32 ChildNodeList::ChildNodeList(PassRefPtr<ContainerNode> parent)
38 Node* ChildNodeList::virtualOwnerNode() const
43 ChildNodeList::~ChildNodeList()
45 m_parent->nodeLists()->removeChildNodeList(this);
48 Node* ChildNodeList::itemBefore(const Node* previous) const
50 return LIKELY(!!previous) ? previous->previousSibling() : rootNode().lastChild();
53 Node* ChildNodeList::traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned& currentOffset, const ContainerNode&) const
55 ASSERT(currentOffset < offset);
56 Node* next = ¤tNode;
57 while ((next = next->nextSibling())) {
58 if (++currentOffset == offset)
64 } // namespace WebCore