1 /* 2 * Copyright (C) 1999 Lars Knoll (knoll (at) kde.org) 3 * (C) 1999 Antti Koivisto (koivisto (at) kde.org) 4 * (C) 2001 Dirk Mueller (mueller (at) kde.org) 5 * Copyright (C) 2004, 2007, 2008 Apple Inc. All rights reserved. 6 * Copyright (C) 2014 Samsung Electronics. All rights reserved. 7 * 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. 12 * 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. 17 * 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. 22 */ 23 24 #include "config.h" 25 #include "core/dom/ChildNodeList.h" 26 27 #include "core/dom/Element.h" 28 #include "core/dom/NodeRareData.h" 29 30 namespace blink { 31 32 ChildNodeList::ChildNodeList(ContainerNode& parent) 33 : m_parent(parent) 34 { 35 } 36 37 Node* ChildNodeList::virtualOwnerNode() const 38 { 39 return &ownerNode(); 40 } 41 42 ChildNodeList::~ChildNodeList() 43 { 44 #if !ENABLE(OILPAN) 45 m_parent->nodeLists()->removeChildNodeList(this); 46 #endif 47 } 48 49 Node* ChildNodeList::traverseForwardToOffset(unsigned offset, Node& currentNode, unsigned& currentOffset) const 50 { 51 ASSERT(currentOffset < offset); 52 for (Node* next = currentNode.nextSibling(); next; next = next->nextSibling()) { 53 if (++currentOffset == offset) 54 return next; 55 } 56 return 0; 57 } 58 59 Node* ChildNodeList::traverseBackwardToOffset(unsigned offset, Node& currentNode, unsigned& currentOffset) const 60 { 61 ASSERT(currentOffset > offset); 62 for (Node* previous = currentNode.previousSibling(); previous; previous = previous->previousSibling()) { 63 if (--currentOffset == offset) 64 return previous; 65 } 66 return 0; 67 } 68 69 void ChildNodeList::trace(Visitor* visitor) 70 { 71 visitor->trace(m_parent); 72 visitor->trace(m_collectionIndexCache); 73 NodeList::trace(visitor); 74 } 75 76 } // namespace blink 77