/* * Copyright (C) 1999 Lars Knoll ([email protected]) * (C) 1999 Antti Koivisto ([email protected]) * (C) 2001 Dirk Mueller ([email protected]) * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. * All rights reserved. * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. * (http://www.torchmobile.com/) * Copyright (C) 2014 Samsung Electronics. All rights reserved. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Library General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Library General Public License for more details. * * You should have received a copy of the GNU Library General Public License * along with this library; see the file COPYING.LIB. If not, write to * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, * Boston, MA 02110-1301, USA. * */ #ifndef THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_TRAVERSAL_H_ #define THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_TRAVERSAL_H_ #include "third_party/blink/renderer/core/core_export.h" #include "third_party/blink/renderer/core/dom/container_node.h" #include "third_party/blink/renderer/core/dom/node.h" #include "third_party/blink/renderer/core/dom/traversal_range.h" #include "third_party/blink/renderer/platform/wtf/allocator/allocator.h" namespace blink { class CORE_EXPORT NodeTraversal { … }; inline TraversalAncestorRange<NodeTraversal> NodeTraversal::AncestorsOf( const Node& node) { … } inline TraversalAncestorRange<NodeTraversal> NodeTraversal::InclusiveAncestorsOf(const Node& node) { … } inline TraversalSiblingRange<NodeTraversal> NodeTraversal::ChildrenOf( const Node& parent) { … } inline TraversalDescendantRange<NodeTraversal> NodeTraversal::DescendantsOf( const Node& root) { … } inline TraversalInclusiveDescendantRange<NodeTraversal> NodeTraversal::InclusiveDescendantsOf(const Node& root) { … } inline TraversalNextRange<NodeTraversal> NodeTraversal::StartsAt( const Node& start) { … } inline TraversalNextRange<NodeTraversal> NodeTraversal::StartsAfter( const Node& start) { … } template <class NodeType> inline Node* NodeTraversal::TraverseNextTemplate(NodeType& current) { … } template <class NodeType> inline Node* NodeTraversal::TraverseNextTemplate(NodeType& current, const Node* stay_within) { … } inline Node* NodeTraversal::NextSkippingChildren(const Node& current) { … } inline Node* NodeTraversal::NextSkippingChildren(const Node& current, const Node* stay_within) { … } // Note that `HighestAncestorOrSelf` is used most commonly in `RemovedFrom` and // `InsertedInfo`, during which `current.isConnected()` hasn't yet been // updated to its new state. Which means `HighestAncestorOrSelf` cannot use // `current.TreeRoot()` because it might return the root of the old tree, // rather than the highest ancestor of the newly-removed/inserted node. inline Node& NodeTraversal::HighestAncestorOrSelf(const Node& current) { … } template <class NodeType> inline Node* NodeTraversal::ChildAtTemplate(NodeType& parent, unsigned index) { … } } // namespace blink #endif // THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_TRAVERSAL_H_
Codebase Browser
chromium