| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2012 Motorola Mobility, Inc. All rights reserved. | 2 * Copyright (c) 2012 Motorola Mobility, Inc. All rights reserved. |
| 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 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
| 12 * | 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY MOTOROLA MOBILITY, INC. AND ITS CONTRIBUTORS | 13 * THIS SOFTWARE IS PROVIDED BY MOTOROLA MOBILITY, INC. AND ITS CONTRIBUTORS |
| 14 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED T
O, | 14 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED T
O, |
| 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MOTOROLA MOBILITY, INC. OR ITS | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MOTOROLA MOBILITY, INC. OR ITS |
| 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 20 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, | 20 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 21 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHER
WISE) | 21 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHER
WISE) |
| 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF | 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 23 * THE POSSIBILITY OF SUCH DAMAGE. | 23 * THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #ifndef RadioNodeList_h | 26 #ifndef RadioNodeList_h |
| 27 #define RadioNodeList_h | 27 #define RadioNodeList_h |
| 28 | 28 |
| 29 #include "core/dom/LiveNodeList.h" | 29 #include "core/dom/LiveNodeList.h" |
| 30 #include <wtf/PassRefPtr.h> | 30 #include "wtf/PassRefPtr.h" |
| 31 #include <wtf/RefPtr.h> | 31 #include "wtf/text/AtomicString.h" |
| 32 #include <wtf/text/AtomicString.h> | |
| 33 #include <wtf/Vector.h> | |
| 34 | 32 |
| 35 namespace WebCore { | 33 namespace WebCore { |
| 36 | 34 |
| 37 class RadioNodeList : public LiveNodeList { | 35 class RadioNodeList : public LiveNodeList { |
| 38 public: | 36 public: |
| 39 static PassRefPtr<RadioNodeList> create(Node* rootNode, CollectionType type,
const AtomicString& name) | 37 static PassRefPtr<RadioNodeList> create(Node* rootNode, CollectionType type,
const AtomicString& name) |
| 40 { | 38 { |
| 41 ASSERT_UNUSED(type, type == RadioNodeListType); | 39 ASSERT_UNUSED(type, type == RadioNodeListType); |
| 42 return adoptRef(new RadioNodeList(rootNode, name)); | 40 return adoptRef(new RadioNodeList(rootNode, name)); |
| 43 } | 41 } |
| (...skipping 10 matching lines...) Expand all Loading... |
| 54 RadioNodeList(Node*, const AtomicString& name); | 52 RadioNodeList(Node*, const AtomicString& name); |
| 55 bool checkElementMatchesRadioNodeListFilter(Element*) const; | 53 bool checkElementMatchesRadioNodeListFilter(Element*) const; |
| 56 | 54 |
| 57 AtomicString m_name; | 55 AtomicString m_name; |
| 58 }; | 56 }; |
| 59 | 57 |
| 60 } // namepsace | 58 } // namepsace |
| 61 | 59 |
| 62 #endif | 60 #endif |
| 63 | 61 |
| OLD | NEW |