| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 1370 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1381 return ensureRareData()->ensureNodeLists()->addCacheWithAtomicName<RadioNode
List>(this, RadioNodeListType, name); | 1381 return ensureRareData()->ensureNodeLists()->addCacheWithAtomicName<RadioNode
List>(this, RadioNodeListType, name); |
| 1382 } | 1382 } |
| 1383 | 1383 |
| 1384 PassRefPtr<Element> Node::querySelector(const AtomicString& selectors, Exception
State& es) | 1384 PassRefPtr<Element> Node::querySelector(const AtomicString& selectors, Exception
State& es) |
| 1385 { | 1385 { |
| 1386 if (selectors.isEmpty()) { | 1386 if (selectors.isEmpty()) { |
| 1387 es.throwDOMException(SyntaxError); | 1387 es.throwDOMException(SyntaxError); |
| 1388 return 0; | 1388 return 0; |
| 1389 } | 1389 } |
| 1390 | 1390 |
| 1391 SelectorQuery* selectorQuery = document().selectorQueryCache()->add(selector
s, &document(), es); | 1391 SelectorQuery* selectorQuery = document().selectorQueryCache()->add(selector
s, document(), es); |
| 1392 if (!selectorQuery) | 1392 if (!selectorQuery) |
| 1393 return 0; | 1393 return 0; |
| 1394 return selectorQuery->queryFirst(this); | 1394 return selectorQuery->queryFirst(this); |
| 1395 } | 1395 } |
| 1396 | 1396 |
| 1397 PassRefPtr<NodeList> Node::querySelectorAll(const AtomicString& selectors, Excep
tionState& es) | 1397 PassRefPtr<NodeList> Node::querySelectorAll(const AtomicString& selectors, Excep
tionState& es) |
| 1398 { | 1398 { |
| 1399 if (selectors.isEmpty()) { | 1399 if (selectors.isEmpty()) { |
| 1400 es.throwDOMException(SyntaxError); | 1400 es.throwDOMException(SyntaxError); |
| 1401 return 0; | 1401 return 0; |
| 1402 } | 1402 } |
| 1403 | 1403 |
| 1404 SelectorQuery* selectorQuery = document().selectorQueryCache()->add(selector
s, &document(), es); | 1404 SelectorQuery* selectorQuery = document().selectorQueryCache()->add(selector
s, document(), es); |
| 1405 if (!selectorQuery) | 1405 if (!selectorQuery) |
| 1406 return 0; | 1406 return 0; |
| 1407 return selectorQuery->queryAll(this); | 1407 return selectorQuery->queryAll(this); |
| 1408 } | 1408 } |
| 1409 | 1409 |
| 1410 Document* Node::ownerDocument() const | 1410 Document* Node::ownerDocument() const |
| 1411 { | 1411 { |
| 1412 Document* doc = &document(); | 1412 Document* doc = &document(); |
| 1413 return doc == this ? 0 : doc; | 1413 return doc == this ? 0 : doc; |
| 1414 } | 1414 } |
| (...skipping 1350 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2765 node->showTreeForThis(); | 2765 node->showTreeForThis(); |
| 2766 } | 2766 } |
| 2767 | 2767 |
| 2768 void showNodePath(const WebCore::Node* node) | 2768 void showNodePath(const WebCore::Node* node) |
| 2769 { | 2769 { |
| 2770 if (node) | 2770 if (node) |
| 2771 node->showNodePathForThis(); | 2771 node->showNodePathForThis(); |
| 2772 } | 2772 } |
| 2773 | 2773 |
| 2774 #endif | 2774 #endif |
| OLD | NEW |