OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google 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 are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
107 bool ElementData::isEquivalent(const ElementData* other) const | 107 bool ElementData::isEquivalent(const ElementData* other) const |
108 { | 108 { |
109 AttributeCollection attributes = this->attributes(); | 109 AttributeCollection attributes = this->attributes(); |
110 if (!other) | 110 if (!other) |
111 return attributes.isEmpty(); | 111 return attributes.isEmpty(); |
112 | 112 |
113 AttributeCollection otherAttributes = other->attributes(); | 113 AttributeCollection otherAttributes = other->attributes(); |
114 if (attributes.size() != otherAttributes.size()) | 114 if (attributes.size() != otherAttributes.size()) |
115 return false; | 115 return false; |
116 | 116 |
117 AttributeCollection::iterator end = attributes.end(); | 117 for (const Attribute& attribute : attributes) { |
118 for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it)
{ | 118 const Attribute* otherAttr = otherAttributes.find(attribute.name()); |
119 const Attribute* otherAttr = otherAttributes.find(it->name()); | 119 if (!otherAttr || attribute.value() != otherAttr->value()) |
120 if (!otherAttr || it->value() != otherAttr->value()) | |
121 return false; | 120 return false; |
122 } | 121 } |
123 return true; | 122 return true; |
124 } | 123 } |
125 | 124 |
126 void ElementData::trace(Visitor* visitor) | 125 void ElementData::trace(Visitor* visitor) |
127 { | 126 { |
128 if (m_isUnique) | 127 if (m_isUnique) |
129 toUniqueElementData(this)->traceAfterDispatch(visitor); | 128 toUniqueElementData(this)->traceAfterDispatch(visitor); |
130 else | 129 else |
(...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
212 return adoptRefWillBeNoop(new (slot) ShareableElementData(*this)); | 211 return adoptRefWillBeNoop(new (slot) ShareableElementData(*this)); |
213 } | 212 } |
214 | 213 |
215 void UniqueElementData::traceAfterDispatch(Visitor* visitor) | 214 void UniqueElementData::traceAfterDispatch(Visitor* visitor) |
216 { | 215 { |
217 visitor->trace(m_presentationAttributeStyle); | 216 visitor->trace(m_presentationAttributeStyle); |
218 ElementData::traceAfterDispatch(visitor); | 217 ElementData::traceAfterDispatch(visitor); |
219 } | 218 } |
220 | 219 |
221 } // namespace blink | 220 } // namespace blink |
OLD | NEW |