/* * Copyright (C) 2007 Alexey Proskuryakov <[email protected]> * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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/xml/xpath_node_set.h" #include "third_party/blink/renderer/core/dom/attr.h" #include "third_party/blink/renderer/core/dom/document.h" #include "third_party/blink/renderer/core/dom/element.h" #include "third_party/blink/renderer/core/dom/node_traversal.h" namespace blink { namespace xpath { // When a node set is large, sorting it by traversing the whole document is // better (we can assume that we aren't dealing with documents that we cannot // even traverse in reasonable time). const unsigned kTraversalSortCutoff = …; NodeSetVector; NodeSet* NodeSet::Create(const NodeSet& other) { … } static inline Node* ParentWithDepth(unsigned depth, const NodeSetVector& parents) { … } static void SortBlock(unsigned from, unsigned to, HeapVector<NodeSetVector>& parent_matrix, bool may_contain_attribute_nodes) { … } void NodeSet::Sort() const { … } static Node* FindRootNode(Node* node) { … } void NodeSet::TraversalSort() const { … } void NodeSet::Reverse() { … } Node* NodeSet::FirstNode() const { … } Node* NodeSet::AnyNode() const { … } } // namespace xpath } // namespace blink