| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 2 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * | 7 * |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #include "config.h" | 26 #include "config.h" |
| 27 #include "core/xml/XPathNodeSet.h" | 27 #include "core/xml/XPathNodeSet.h" |
| 28 | 28 |
| 29 #include "core/dom/Attr.h" | 29 #include "core/dom/Attr.h" |
| 30 #include "core/dom/Element.h" | 30 #include "core/dom/Element.h" |
| 31 #include "core/dom/Node.h" | |
| 32 #include "core/dom/NodeTraversal.h" | 31 #include "core/dom/NodeTraversal.h" |
| 33 | 32 |
| 34 namespace WebCore { | 33 namespace WebCore { |
| 35 namespace XPath { | 34 namespace XPath { |
| 36 | 35 |
| 37 // When a node set is large, sorting it by traversing the whole document is bett
er (we can | 36 // When a node set is large, sorting it by traversing the whole document is bett
er (we can |
| 38 // assume that we aren't dealing with documents that we cannot even traverse in
reasonable time). | 37 // assume that we aren't dealing with documents that we cannot even traverse in
reasonable time). |
| 39 const unsigned traversalSortCutoff = 10000; | 38 const unsigned traversalSortCutoff = 10000; |
| 40 | 39 |
| 41 static inline Node* parentWithDepth(unsigned depth, const Vector<Node*>& parents
) | 40 static inline Node* parentWithDepth(unsigned depth, const Vector<Node*>& parents
) |
| (...skipping 214 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 256 Node* NodeSet::anyNode() const | 255 Node* NodeSet::anyNode() const |
| 257 { | 256 { |
| 258 if (isEmpty()) | 257 if (isEmpty()) |
| 259 return 0; | 258 return 0; |
| 260 | 259 |
| 261 return m_nodes.at(0).get(); | 260 return m_nodes.at(0).get(); |
| 262 } | 261 } |
| 263 | 262 |
| 264 } | 263 } |
| 265 } | 264 } |
| OLD | NEW |