static inline void filterProperties(bool important, const WillBeHeapVector<CSSProperty, 256>& input, WillBeHeapVector<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) { const CSSProperty& property = input[i]; if (property.isImportant() != important) continue; const unsigned propertyIDIndex = property.id() - firstCSSProperty; if (seenProperties.get(propertyIDIndex)) continue; seenProperties.set(propertyIDIndex); output[--unusedEntries] = property; } }
static inline void filterProperties(bool important, const WillBeHeapVector<CSSProperty, 256>& input, WillBeHeapVector<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 (size_t i = input.size(); i--; ) { const CSSProperty& property = input[i]; if (property.isImportant() != important) continue; const unsigned propertyIDIndex = property.id() - firstCSSProperty; // All custom properties use the same CSSPropertyID so we can't remove repeated definitions if (property.id() != CSSPropertyVariable) { if (seenProperties.get(propertyIDIndex)) continue; seenProperties.set(propertyIDIndex); } output[--unusedEntries] = property; } }