mirror of
https://github.com/servo/servo.git
synced 2025-06-22 16:18:59 +01:00
style: Ensure that precomputed pseudo-element declarations are correctly sorted.
This commit is contained in:
parent
6fe9fd2269
commit
db26ef9acb
2 changed files with 23 additions and 21 deletions
|
@ -210,14 +210,10 @@ impl Stylist {
|
|||
self.state_deps.len());
|
||||
|
||||
SelectorImpl::each_precomputed_pseudo_element(|pseudo| {
|
||||
// TODO: Consider not doing this and just getting the rules on the
|
||||
// fly. It should be a bit slower, but we'd take rid of the
|
||||
// extra field, and avoid this precomputation entirely.
|
||||
if let Some(map) = self.pseudos_map.remove(&pseudo) {
|
||||
let mut declarations = vec![];
|
||||
map.user_agent.get_universal_rules(&mut declarations,
|
||||
CascadeLevel::UANormal,
|
||||
CascadeLevel::UAImportant);
|
||||
let declarations =
|
||||
map.user_agent.get_universal_rules(CascadeLevel::UANormal,
|
||||
CascadeLevel::UAImportant);
|
||||
self.precomputed_pseudo_element_decls.insert(pseudo, declarations);
|
||||
}
|
||||
});
|
||||
|
@ -922,20 +918,21 @@ impl SelectorMap {
|
|||
|
||||
/// Append to `rule_list` all universal Rules (rules with selector `*|*`) in
|
||||
/// `self` sorted by specificity and source order.
|
||||
pub fn get_universal_rules<V>(&self,
|
||||
matching_rules_list: &mut V,
|
||||
cascade_level: CascadeLevel,
|
||||
important_cascade_level: CascadeLevel)
|
||||
where V: VecLike<ApplicableDeclarationBlock>
|
||||
{
|
||||
pub fn get_universal_rules(&self,
|
||||
cascade_level: CascadeLevel,
|
||||
important_cascade_level: CascadeLevel)
|
||||
-> Vec<ApplicableDeclarationBlock> {
|
||||
debug_assert!(!cascade_level.is_important());
|
||||
debug_assert!(important_cascade_level.is_important());
|
||||
if self.empty {
|
||||
return
|
||||
return vec![];
|
||||
}
|
||||
|
||||
let init_len = matching_rules_list.len();
|
||||
let mut matching_rules_list = vec![];
|
||||
|
||||
// We need to insert important rules _after_ normal rules for this to be
|
||||
// correct, and also to not trigger rule tree assertions.
|
||||
let mut important = vec![];
|
||||
for rule in self.other_rules.iter() {
|
||||
if rule.selector.compound_selector.is_empty() &&
|
||||
rule.selector.next.is_none() {
|
||||
|
@ -946,14 +943,21 @@ impl SelectorMap {
|
|||
rule.to_applicable_declaration_block(cascade_level));
|
||||
}
|
||||
if block.any_important() {
|
||||
matching_rules_list.push(
|
||||
important.push(
|
||||
rule.to_applicable_declaration_block(important_cascade_level));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
sort_by_key(&mut matching_rules_list[init_len..],
|
||||
let normal_len = matching_rules_list.len();
|
||||
matching_rules_list.extend(important.into_iter());
|
||||
|
||||
sort_by_key(&mut matching_rules_list[0..normal_len],
|
||||
|block| (block.specificity, block.source_order));
|
||||
sort_by_key(&mut matching_rules_list[normal_len..],
|
||||
|block| (block.specificity, block.source_order));
|
||||
|
||||
matching_rules_list
|
||||
}
|
||||
|
||||
fn get_matching_rules_from_hash<E, Str, BorrowedStr: ?Sized, Vector>(
|
||||
|
|
|
@ -112,11 +112,9 @@ fn test_insert() {
|
|||
fn test_get_universal_rules() {
|
||||
thread_state::initialize(thread_state::LAYOUT);
|
||||
let map = get_mock_map(&["*|*", "#foo > *|*", ".klass", "#id"]);
|
||||
let mut decls = vec![];
|
||||
|
||||
map.get_universal_rules(&mut decls,
|
||||
CascadeLevel::UserNormal,
|
||||
CascadeLevel::UserImportant);
|
||||
let decls = map.get_universal_rules(CascadeLevel::UserNormal,
|
||||
CascadeLevel::UserImportant);
|
||||
|
||||
assert_eq!(decls.len(), 1);
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue