| OLD | NEW | 
|---|
| 1 /* | 1 /* | 
| 2  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> | 2  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> | 
| 3  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved. | 3  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved. | 
| 4  * | 4  * | 
| 5  * Redistribution and use in source and binary forms, with or without | 5  * Redistribution and use in source and binary forms, with or without | 
| 6  * modification, are permitted provided that the following conditions | 6  * modification, are permitted provided that the following conditions | 
| 7  * are met: | 7  * are met: | 
| 8  * | 8  * | 
| 9  * 1. Redistributions of source code must retain the above copyright | 9  * 1. Redistributions of source code must retain the above copyright | 
| 10  *    notice, this list of conditions and the following disclaimer. | 10  *    notice, this list of conditions and the following disclaimer. | 
| 11  * 2. Redistributions in binary form must reproduce the above copyright | 11  * 2. Redistributions in binary form must reproduce the above copyright | 
| 12  *    notice, this list of conditions and the following disclaimer in the | 12  *    notice, this list of conditions and the following disclaimer in the | 
| 13  *    documentation and/or other materials provided with the distribution. | 13  *    documentation and/or other materials provided with the distribution. | 
| 14  * | 14  * | 
| 15  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | 15  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | 
| 16  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | 16  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | 
| 17  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | 17  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | 
| 18  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | 18  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | 
| 19  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | 19  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | 
| 20  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 20  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
| 21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
| 22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
| 23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 
| 24  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| 25  */ | 25  */ | 
| 26 | 26 | 
| 27 #include "config.h" |  | 
| 28 #include "core/xml/XPathResult.h" | 27 #include "core/xml/XPathResult.h" | 
| 29 | 28 | 
| 30 #include "bindings/core/v8/ExceptionState.h" | 29 #include "bindings/core/v8/ExceptionState.h" | 
| 31 #include "core/dom/Document.h" | 30 #include "core/dom/Document.h" | 
| 32 #include "core/dom/ExceptionCode.h" | 31 #include "core/dom/ExceptionCode.h" | 
| 33 #include "core/xml/XPathEvaluator.h" | 32 #include "core/xml/XPathEvaluator.h" | 
| 34 #include "core/xml/XPathExpressionNode.h" | 33 #include "core/xml/XPathExpressionNode.h" | 
| 35 | 34 | 
| 36 namespace blink { | 35 namespace blink { | 
| 37 | 36 | 
| (...skipping 175 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 213     } | 212     } | 
| 214 | 213 | 
| 215     const NodeSet& nodes = m_value.toNodeSet(0); | 214     const NodeSet& nodes = m_value.toNodeSet(0); | 
| 216     if (index >= nodes.size()) | 215     if (index >= nodes.size()) | 
| 217         return nullptr; | 216         return nullptr; | 
| 218 | 217 | 
| 219     return nodes[index]; | 218     return nodes[index]; | 
| 220 } | 219 } | 
| 221 | 220 | 
| 222 } | 221 } | 
| OLD | NEW | 
|---|