| Index: Source/core/css/parser/BisonCSSParser-in.cpp
|
| diff --git a/Source/core/css/parser/BisonCSSParser-in.cpp b/Source/core/css/parser/BisonCSSParser-in.cpp
|
| index 543bc20b8f8fb1c411efc193e5c87e15f8d8d7c6..b9fa87fd57f75a99aa40d0691ac5c26affc0d319 100644
|
| --- a/Source/core/css/parser/BisonCSSParser-in.cpp
|
| +++ b/Source/core/css/parser/BisonCSSParser-in.cpp
|
| @@ -1224,7 +1224,7 @@
|
| return m_mediaList.release();
|
| }
|
|
|
| -static inline void filterProperties(bool important, const WillBeHeapVector<CSSProperty, 256>& input, WillBeHeapVector<CSSProperty, 256>& output, size_t& unusedEntries, BitArray<numCSSProperties>& seenProperties)
|
| +static inline void filterProperties(bool important, const CSSPropertyParser::ParsedPropertyVector& input, Vector<CSSProperty, 256>& output, size_t& unusedEntries, BitArray<numCSSProperties>& seenProperties)
|
| {
|
| // Add properties in reverse order so that highest priority definitions are reached first. Duplicate definitions can then be ignored when found.
|
| for (int i = input.size() - 1; i >= 0; --i) {
|
| @@ -1243,7 +1243,7 @@
|
| {
|
| BitArray<numCSSProperties> seenProperties;
|
| size_t unusedEntries = m_parsedProperties.size();
|
| - WillBeHeapVector<CSSProperty, 256> results(unusedEntries);
|
| + Vector<CSSProperty, 256> results(unusedEntries);
|
|
|
| // Important properties have higher priority, so add them first. Duplicate definitions can then be ignored when found.
|
| filterProperties(true, m_parsedProperties, results, unusedEntries, seenProperties);
|
|
|