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 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2011, 2012 Apple Inc. All rights
reserved. | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2011, 2012 Apple Inc. All rights
reserved. |
5 * | 5 * |
6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
10 * | 10 * |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
42 | 42 |
43 HTMLNameCollection::~HTMLNameCollection() | 43 HTMLNameCollection::~HTMLNameCollection() |
44 { | 44 { |
45 ASSERT(ownerNode()); | 45 ASSERT(ownerNode()); |
46 ASSERT(ownerNode()->isDocumentNode()); | 46 ASSERT(ownerNode()->isDocumentNode()); |
47 ASSERT(type() == WindowNamedItems || type() == DocumentNamedItems); | 47 ASSERT(type() == WindowNamedItems || type() == DocumentNamedItems); |
48 | 48 |
49 ownerNode()->nodeLists()->removeCacheWithAtomicName(this, type(), m_name); | 49 ownerNode()->nodeLists()->removeCacheWithAtomicName(this, type(), m_name); |
50 } | 50 } |
51 | 51 |
52 Element* HTMLNameCollection::virtualItemAfter(unsigned& offsetInArray, Element*
previous) const | 52 Element* HTMLNameCollection::virtualItemAfter(Element* previous) const |
53 { | 53 { |
54 ASSERT_UNUSED(offsetInArray, !offsetInArray); | |
55 ASSERT(previous != ownerNode()); | 54 ASSERT(previous != ownerNode()); |
56 | 55 |
57 Element* current; | 56 Element* current; |
58 if (!previous) | 57 if (!previous) |
59 current = ElementTraversal::firstWithin(*ownerNode()); | 58 current = ElementTraversal::firstWithin(*ownerNode()); |
60 else | 59 else |
61 current = ElementTraversal::next(*previous, ownerNode()); | 60 current = ElementTraversal::next(*previous, ownerNode()); |
62 | 61 |
63 for (; current; current = ElementTraversal::next(*current, ownerNode())) { | 62 for (; current; current = ElementTraversal::next(*current, ownerNode())) { |
64 switch (type()) { | 63 switch (type()) { |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
96 break; | 95 break; |
97 default: | 96 default: |
98 ASSERT_NOT_REACHED(); | 97 ASSERT_NOT_REACHED(); |
99 } | 98 } |
100 } | 99 } |
101 | 100 |
102 return 0; | 101 return 0; |
103 } | 102 } |
104 | 103 |
105 } | 104 } |
OLD | NEW |