chromium/third_party/blink/renderer/core/dom/node_traversal.cc

/*
 * 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/)
 *
 * 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.
 *
 */

#include "third_party/blink/renderer/core/dom/node_traversal.h"

#include "third_party/blink/renderer/core/dom/container_node.h"

namespace blink {

Node* NodeTraversal::PreviousIncludingPseudo(const Node& current,
                                             const Node* stay_within) { … }

Node* NodeTraversal::NextIncludingPseudo(const Node& current,
                                         const Node* stay_within) { … }

Node* NodeTraversal::NextIncludingPseudoSkippingChildren(
    const Node& current,
    const Node* stay_within) { … }

Node* NodeTraversal::NextAncestorSibling(const Node& current) { … }

Node* NodeTraversal::NextAncestorSibling(const Node& current,
                                         const Node* stay_within) { … }

Node* NodeTraversal::LastWithin(const ContainerNode& current) { … }

Node& NodeTraversal::LastWithinOrSelf(Node& current) { … }

Node* NodeTraversal::Previous(const Node& current, const Node* stay_within) { … }

Node* NodeTraversal::PreviousAbsoluteSiblingIncludingPseudo(
    const Node& current,
    const Node* stay_within) { … }

Node* NodeTraversal::PreviousAbsoluteSibling(const Node& current,
                                             const Node* stay_within) { … }

Node* NodeTraversal::NextPostOrder(const Node& current,
                                   const Node* stay_within) { … }

Node* NodeTraversal::PreviousAncestorSiblingPostOrder(const Node& current,
                                                      const Node* stay_within) { … }

Node* NodeTraversal::PreviousPostOrder(const Node& current,
                                       const Node* stay_within) { … }

Node* NodeTraversal::CommonAncestor(const Node& node_a, const Node& node_b) { … }

}  // namespace blink