flat_tree_traversal.cc | Explore in Territory

/*
 * Copyright (C) 2012 Google Inc. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 *     * Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 *     * Neither the name of Google Inc. nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

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

#include "third_party/blink/renderer/core/dom/element.h"
#include "third_party/blink/renderer/core/dom/flat_tree_node_data.h"
#include "third_party/blink/renderer/core/dom/slot_assignment.h"
#include "third_party/blink/renderer/core/html/html_slot_element.h"

namespace blink {

#if DCHECK_IS_ON()
void FlatTreeTraversal::AssertFlatTreeNodeDataUpdated(
    const Node& root,
    int& assigned_nodes_in_slot_count,
    int& nodes_which_have_assigned_slot_count) { … }
#endif

Node* FlatTreeTraversal::TraverseChild(const Node& node,
                                       TraversalDirection direction) { … }

Node* FlatTreeTraversal::TraverseSiblings(const Node& node,
                                          TraversalDirection direction) { … }

Node* FlatTreeTraversal::TraverseSiblingsForHostChild(
    const Node& node,
    TraversalDirection direction) { … }

ContainerNode* FlatTreeTraversal::TraverseParent(const Node& node) { … }

Node* FlatTreeTraversal::ChildAt(const Node& node, unsigned index) { … }

Node* FlatTreeTraversal::NextSkippingChildren(const Node& node) { … }

bool FlatTreeTraversal::ContainsIncludingPseudoElement(
    const ContainerNode& container,
    const Node& node) { … }

Node* FlatTreeTraversal::PreviousAbsoluteSibling(const Node& node) { … }

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

// TODO(yosin) We should consider introducing template class to share code
// between DOM tree traversal and flat tree tarversal.
Node* FlatTreeTraversal::PreviousPostOrder(const Node& current,
                                           const Node* stay_within) { … }

bool FlatTreeTraversal::IsDescendantOf(const Node& node, const Node& other) { … }

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

Node* FlatTreeTraversal::TraverseNextAncestorSibling(const Node& node) { … }

Node* FlatTreeTraversal::TraversePreviousAncestorSibling(const Node& node) { … }

unsigned FlatTreeTraversal::Index(const Node& node) { … }

unsigned FlatTreeTraversal::CountChildren(const Node& node) { … }

Node* FlatTreeTraversal::LastWithin(const Node& node) { … }

Node& FlatTreeTraversal::LastWithinOrSelf(const Node& node) { … }

const Element* FlatTreeTraversal::InclusiveParentElement(const Node& node) { … }

}  // namespace blink
chromium/third_party/blink/renderer/core/dom/flat_tree_traversal.cc
