| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) |
| 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) | 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) |
| 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Apple Inc.
All rights reserved. | 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Apple Inc.
All rights reserved. |
| 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
| 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> | 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> |
| 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. | 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
| 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
| (...skipping 173 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 184 | 184 |
| 185 return matchedRule1.position() < matchedRule2.position(); | 185 return matchedRule1.position() < matchedRule2.position(); |
| 186 } | 186 } |
| 187 | 187 |
| 188 void ElementRuleCollector::sortMatchedRules() | 188 void ElementRuleCollector::sortMatchedRules() |
| 189 { | 189 { |
| 190 ASSERT(m_matchedRules); | 190 ASSERT(m_matchedRules); |
| 191 std::sort(m_matchedRules->begin(), m_matchedRules->end(), compareRules); | 191 std::sort(m_matchedRules->begin(), m_matchedRules->end(), compareRules); |
| 192 } | 192 } |
| 193 | 193 |
| 194 bool ElementRuleCollector::hasAnyMatchingRules(RuleSet* ruleSet) | |
| 195 { | |
| 196 clearMatchedRules(); | |
| 197 | |
| 198 m_mode = SelectorChecker::SharingRules; | |
| 199 // To check whether a given RuleSet has any rule matching a given element, | |
| 200 // should not see the element's treescope. Because RuleSet has no | |
| 201 // information about "scope". | |
| 202 int firstRuleIndex = -1, lastRuleIndex = -1; | |
| 203 RuleRange ruleRange(firstRuleIndex, lastRuleIndex); | |
| 204 // FIXME: Verify whether it's ok to ignore CascadeScope here. | |
| 205 collectMatchingRules(MatchRequest(ruleSet), ruleRange, SelectorChecker::Defa
ultBehavior); | |
| 206 | |
| 207 return m_matchedRules && !m_matchedRules->isEmpty(); | |
| 208 } | |
| 209 | |
| 210 } // namespace blink | 194 } // namespace blink |
| OLD | NEW |