ElementDefinition.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570
  1. /*
  2. * This source file is part of libRocket, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://www.librocket.com
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  24. * THE SOFTWARE.
  25. *
  26. */
  27. #include "precompiled.h"
  28. #include "ElementDefinition.h"
  29. #include "../../Include/Rocket/Core/Decorator.h"
  30. #include "../../Include/Rocket/Core/Factory.h"
  31. #include "../../Include/Rocket/Core/FontDatabase.h"
  32. #include "../../Include/Rocket/Core/Log.h"
  33. namespace Rocket {
  34. namespace Core {
  35. ElementDefinition::ElementDefinition()
  36. {
  37. structurally_volatile = false;
  38. }
  39. ElementDefinition::~ElementDefinition()
  40. {
  41. for (DecoratorMap::iterator i = decorators.begin(); i != decorators.end(); ++i)
  42. (*i).second->RemoveReference();
  43. for (PseudoClassDecoratorMap::iterator i = pseudo_class_decorators.begin(); i != pseudo_class_decorators.end(); ++i)
  44. {
  45. for (DecoratorMap::iterator j = (*i).second.begin(); j != (*i).second.end(); ++j)
  46. {
  47. if ((*j).second != NULL)
  48. (*j).second->RemoveReference();
  49. }
  50. }
  51. for (size_t i = 0; i < font_effects.size(); ++i)
  52. font_effects[i]->RemoveReference();
  53. }
  54. // Initialises the element definition from a list of style sheet nodes.
  55. void ElementDefinition::Initialise(const std::vector< const StyleSheetNode* >& style_sheet_nodes, const PseudoClassList& volatile_pseudo_classes, bool _structurally_volatile)
  56. {
  57. // Set the volatile structure flag.
  58. structurally_volatile = _structurally_volatile;
  59. // Mark all the volatile pseudo-classes as structurally volatile.
  60. for (PseudoClassList::const_iterator i = volatile_pseudo_classes.begin(); i != volatile_pseudo_classes.end(); ++i)
  61. pseudo_class_volatility[*i] = STRUCTURE_VOLATILE;
  62. // Merge the default (non-pseudo-class) properties.
  63. for (size_t i = 0; i < style_sheet_nodes.size(); ++i)
  64. properties.Merge(style_sheet_nodes[i]->GetProperties());
  65. // Merge the pseudo-class properties.
  66. PseudoClassPropertyMap merged_pseudo_class_properties;
  67. for (size_t i = 0; i < style_sheet_nodes.size(); ++i)
  68. {
  69. // Merge all the pseudo-classes.
  70. PseudoClassPropertyMap node_properties;
  71. style_sheet_nodes[i]->GetPseudoClassProperties(node_properties);
  72. for (PseudoClassPropertyMap::iterator j = node_properties.begin(); j != node_properties.end(); ++j)
  73. {
  74. // Merge the property maps into one uber-map; for the decorators.
  75. PseudoClassPropertyMap::iterator k = merged_pseudo_class_properties.find((*j).first);
  76. if (k == merged_pseudo_class_properties.end())
  77. merged_pseudo_class_properties[(*j).first] = (*j).second;
  78. else
  79. (*k).second.Merge((*j).second);
  80. // Search through all entries in this dictionary; we'll insert each one into our optimised list of
  81. // pseudo-class properties.
  82. for (PropertyMap::const_iterator k = (*j).second.GetProperties().begin(); k != (*j).second.GetProperties().end(); ++k)
  83. {
  84. const String& property_name = (*k).first;
  85. const Property& property = (*k).second;
  86. // Skip this property if its specificity is lower than the base property's, as in
  87. // this case it will never be used.
  88. const Property* default_property = properties.GetProperty(property_name);
  89. if (default_property != NULL &&
  90. default_property->specificity >= property.specificity)
  91. continue;
  92. PseudoClassPropertyDictionary::iterator l = pseudo_class_properties.find(property_name);
  93. if (l == pseudo_class_properties.end())
  94. pseudo_class_properties[property_name] = PseudoClassPropertyList(1, PseudoClassProperty((*j).first, property));
  95. else
  96. {
  97. // Find the location to insert this entry in the map, based on property priorities.
  98. int index = 0;
  99. while (index < (int) (*l).second.size() &&
  100. (*l).second[index].second.specificity > property.specificity)
  101. index++;
  102. (*l).second.insert((*l).second.begin() + index, PseudoClassProperty((*j).first, property));
  103. }
  104. }
  105. }
  106. }
  107. InstanceDecorators(merged_pseudo_class_properties);
  108. InstanceFontEffects(merged_pseudo_class_properties);
  109. }
  110. // Returns a specific property from the element definition's base properties.
  111. const Property* ElementDefinition::GetProperty(const String& name, const PseudoClassList& pseudo_classes) const
  112. {
  113. // Find a pseudo-class override for this property.
  114. PseudoClassPropertyDictionary::const_iterator property_iterator = pseudo_class_properties.find(name);
  115. if (property_iterator != pseudo_class_properties.end())
  116. {
  117. const PseudoClassPropertyList& property_list = (*property_iterator).second;
  118. for (size_t i = 0; i < property_list.size(); ++i)
  119. {
  120. if (!IsPseudoClassRuleApplicable(property_list[i].first, pseudo_classes))
  121. continue;
  122. return &property_list[i].second;
  123. }
  124. }
  125. return properties.GetProperty(name);
  126. }
  127. // Returns the list of properties this element definition defines for an element with the given set of pseudo-classes.
  128. void ElementDefinition::GetDefinedProperties(PropertyNameList& property_names, const PseudoClassList& pseudo_classes) const
  129. {
  130. for (PropertyMap::const_iterator i = properties.GetProperties().begin(); i != properties.GetProperties().end(); ++i)
  131. property_names.insert((*i).first);
  132. for (PseudoClassPropertyDictionary::const_iterator i = pseudo_class_properties.begin(); i != pseudo_class_properties.end(); ++i)
  133. {
  134. // If this property is already in the default dictionary, don't bother checking for it here.
  135. if (property_names.find((*i).first) != property_names.end())
  136. continue;
  137. const PseudoClassPropertyList& property_list = (*i).second;
  138. // Search through all the pseudo-class combinations that have a definition for this property; if the calling
  139. // element matches at least one of them, then add it to the list.
  140. bool property_defined = false;
  141. for (size_t j = 0; j < property_list.size(); ++j)
  142. {
  143. if (IsPseudoClassRuleApplicable(property_list[j].first, pseudo_classes))
  144. {
  145. property_defined = true;
  146. break;
  147. }
  148. }
  149. if (property_defined)
  150. property_names.insert((*i).first);
  151. }
  152. }
  153. // Returns the list of properties this element definition has explicit definitions for involving the given
  154. // pseudo-class.
  155. void ElementDefinition::GetDefinedProperties(PropertyNameList& property_names, const PseudoClassList& pseudo_classes, const String& pseudo_class) const
  156. {
  157. for (PseudoClassPropertyDictionary::const_iterator i = pseudo_class_properties.begin(); i != pseudo_class_properties.end(); ++i)
  158. {
  159. // If this property has already been found, don't bother checking for it again.
  160. if (property_names.find((*i).first) != property_names.end())
  161. continue;
  162. const PseudoClassPropertyList& property_list = (*i).second;
  163. bool property_defined = false;
  164. for (size_t j = 0; j < property_list.size(); ++j)
  165. {
  166. bool rule_valid = true;
  167. bool found_toggled_pseudo_class = false;
  168. const StringList& rule_pseudo_classes = property_list[j].first;
  169. for (size_t j = 0; j < rule_pseudo_classes.size(); ++j)
  170. {
  171. if (rule_pseudo_classes[j] == pseudo_class)
  172. {
  173. found_toggled_pseudo_class = true;
  174. continue;
  175. }
  176. if (pseudo_classes.find(rule_pseudo_classes[j]) == pseudo_classes.end())
  177. {
  178. rule_valid = false;
  179. break;
  180. }
  181. }
  182. if (rule_valid &&
  183. found_toggled_pseudo_class)
  184. {
  185. property_defined = true;
  186. break;
  187. }
  188. }
  189. if (property_defined)
  190. property_names.insert((*i).first);
  191. }
  192. }
  193. // Iterates over the properties in the definition.
  194. bool ElementDefinition::IterateProperties(int& index, const PseudoClassList& pseudo_classes, PseudoClassList& property_pseudo_classes, String& property_name, const Property*& property) const
  195. {
  196. if (index < properties.GetNumProperties())
  197. {
  198. PropertyMap::const_iterator i = properties.GetProperties().begin();
  199. for (int count = 0; count < index; ++count)
  200. ++i;
  201. property_pseudo_classes.clear();
  202. property_name = (*i).first;
  203. property = &((*i).second);
  204. ++index;
  205. return true;
  206. }
  207. // Not in the base properties; check for pseudo-class overrides.
  208. int property_count = properties.GetNumProperties();
  209. for (PseudoClassPropertyDictionary::const_iterator i = pseudo_class_properties.begin(); i != pseudo_class_properties.end(); ++i)
  210. {
  211. // Iterate over each pseudo-class set that has a definition for this property; if we find one that matches our
  212. // pseudo-class, increment our index counter and either return that property (if we hit the requested index) or
  213. // continue looking if we're still below it.
  214. for (size_t j = 0; j < (*i).second.size(); ++j)
  215. {
  216. if (IsPseudoClassRuleApplicable((*i).second[j].first, pseudo_classes))
  217. {
  218. property_count++;
  219. if (property_count > index)
  220. {
  221. // Copy the list of pseudo-classes.
  222. property_pseudo_classes.clear();
  223. for (size_t k = 0; k < (*i).second[j].first.size(); ++k)
  224. property_pseudo_classes.insert((*i).second[j].first[k]);
  225. property_name = (*i).first;
  226. property = &((*i).second[j].second);
  227. ++index;
  228. return true;
  229. }
  230. else
  231. {
  232. break;
  233. }
  234. }
  235. }
  236. }
  237. return false;
  238. }
  239. // Returns the list of the element definition's instanced decorators in the default state.
  240. const DecoratorMap& ElementDefinition::GetDecorators() const
  241. {
  242. return decorators;
  243. }
  244. // Returns the map of pseudo-class names to overriding instanced decorators.
  245. const PseudoClassDecoratorMap& ElementDefinition::GetPseudoClassDecorators() const
  246. {
  247. return pseudo_class_decorators;
  248. }
  249. // Appends this definition's font effects into a provided map of effects.
  250. void ElementDefinition::GetFontEffects(FontEffectMap& applicable_font_effects, const PseudoClassList& pseudo_classes) const
  251. {
  252. // Check each set of named effects, looking for applicable ones.
  253. for (FontEffectIndex::const_iterator i = font_effect_index.begin(); i != font_effect_index.end(); ++i)
  254. {
  255. // Search through this list, finding the first effect that is valid (depending on
  256. // pseudo-classes).
  257. const PseudoClassFontEffectIndex& index = i->second;
  258. for (size_t j = 0; j < index.size(); ++j)
  259. {
  260. if (IsPseudoClassRuleApplicable(index[j].first, pseudo_classes))
  261. {
  262. // This is the most specific valid font effect this element has under the name. If
  263. // the map of effects already has an effect with the same name, the effect with the
  264. // highest specificity will prevail.
  265. FontEffect* applicable_effect = font_effects[index[j].second];
  266. FontEffectMap::iterator map_iterator = applicable_font_effects.find(i->first);
  267. if (map_iterator == applicable_font_effects.end() ||
  268. map_iterator->second->GetSpecificity() < applicable_effect->GetSpecificity())
  269. applicable_font_effects[i->first] = applicable_effect;
  270. break;
  271. }
  272. }
  273. }
  274. }
  275. // Returns the volatility of a pseudo-class.
  276. ElementDefinition::PseudoClassVolatility ElementDefinition::GetPseudoClassVolatility(const String& pseudo_class) const
  277. {
  278. PseudoClassVolatilityMap::const_iterator i = pseudo_class_volatility.find(pseudo_class);
  279. if (i == pseudo_class_volatility.end())
  280. return STABLE;
  281. else
  282. return i->second;
  283. }
  284. // Returns true if this definition is built from nodes using structural selectors.
  285. bool ElementDefinition::IsStructurallyVolatile() const
  286. {
  287. return structurally_volatile;
  288. }
  289. // Destroys the definition.
  290. void ElementDefinition::OnReferenceDeactivate()
  291. {
  292. delete this;
  293. }
  294. // Finds all propery declarations for a group.
  295. void ElementDefinition::BuildPropertyGroup(PropertyGroupMap& groups, const String& group_type, const PropertyDictionary& element_properties, const PropertyGroupMap* default_properties)
  296. {
  297. String property_suffix = "-" + group_type;
  298. for (PropertyMap::const_iterator property_iterator = element_properties.GetProperties().begin(); property_iterator != element_properties.GetProperties().end(); ++property_iterator)
  299. {
  300. const String& property_name = (*property_iterator).first;
  301. if (property_name.Length() > property_suffix.Length() &&
  302. strcasecmp(property_name.CString() + (property_name.Length() - property_suffix.Length()), property_suffix.CString()) == 0)
  303. {
  304. // We've found a group declaration!
  305. String group_name = property_name.Substring(0, property_name.Length() - (group_type.Length() + 1));
  306. String group_class = (*property_iterator).second.value.Get< String >();
  307. PropertyDictionary* group_properties = NULL;
  308. // Check if we have an existing definition by this name; if so, we're only overriding the type.
  309. PropertyGroupMap::iterator existing_definition = groups.find(group_name);
  310. if (existing_definition != groups.end())
  311. {
  312. (*existing_definition).second.first = group_class;
  313. group_properties = &(*existing_definition).second.second;
  314. }
  315. else
  316. {
  317. // Check if we have any default decorator definitions, and if the new decorator has a default. If so,
  318. // we make a copy of the default properties for the new decorator.
  319. if (default_properties != NULL)
  320. {
  321. PropertyGroupMap::const_iterator default_definition = default_properties->find(group_name);
  322. if (default_definition != default_properties->end())
  323. group_properties = &(*groups.insert(PropertyGroupMap::value_type(group_name, PropertyGroup(group_class, (*default_definition).second.second))).first).second.second;
  324. }
  325. // If we still haven't got somewhere to put the properties for the new decorator, make a new
  326. // definition.
  327. if (group_properties == NULL)
  328. group_properties = &(*groups.insert(PropertyGroupMap::value_type(group_name, PropertyGroup(group_class, PropertyDictionary()))).first).second.second;
  329. }
  330. // Now find all of this decorator's properties.
  331. BuildPropertyGroupDictionary(*group_properties, group_type, group_name, element_properties);
  332. }
  333. }
  334. // Now go through all the default decorator definitions and see if the new property list redefines any properties
  335. // used by them.
  336. if (default_properties != NULL)
  337. {
  338. for (PropertyGroupMap::const_iterator default_definition_iterator = default_properties->begin(); default_definition_iterator != default_properties->end(); ++default_definition_iterator)
  339. {
  340. const String& default_definition_name = (*default_definition_iterator).first;
  341. // Check the list of new definitions hasn't defined this decorator already; if so, it overrode the
  342. // decorator type and so has inherited all the properties anyway.
  343. if (groups.find(default_definition_name) == groups.end())
  344. {
  345. // Nope! Make a copy of the decorator's properties and see if the new dictionary overrides any of the
  346. // properties.
  347. PropertyDictionary decorator_properties = (*default_definition_iterator).second.second;
  348. if (BuildPropertyGroupDictionary(decorator_properties, group_type, default_definition_name, element_properties) > 0)
  349. groups[default_definition_name] = PropertyGroup((*default_definition_iterator).second.first, decorator_properties);
  350. }
  351. }
  352. }
  353. }
  354. // Updates a property dictionary of all properties for a single group.
  355. int ElementDefinition::BuildPropertyGroupDictionary(PropertyDictionary& group_properties, const String& ROCKET_UNUSED_PARAMETER(group_type), const String& group_name, const PropertyDictionary& element_properties)
  356. {
  357. ROCKET_UNUSED(group_type);
  358. int num_properties = 0;
  359. for (PropertyMap::const_iterator property_iterator = element_properties.GetProperties().begin(); property_iterator != element_properties.GetProperties().end(); ++property_iterator)
  360. {
  361. const String& full_property_name = (*property_iterator).first;
  362. if (full_property_name.Length() > group_name.Length() + 1 &&
  363. strncasecmp(full_property_name.CString(), group_name.CString(), group_name.Length()) == 0 &&
  364. full_property_name[group_name.Length()] == '-')
  365. {
  366. String property_name = full_property_name.Substring(group_name.Length() + 1);
  367. // if (property_name == group_type)
  368. // continue;
  369. group_properties.SetProperty(property_name, (*property_iterator).second);
  370. num_properties++;
  371. }
  372. }
  373. return num_properties;
  374. }
  375. // Builds decorator definitions from the parsed properties and instances decorators as appropriate.
  376. void ElementDefinition::InstanceDecorators(const PseudoClassPropertyMap& merged_pseudo_class_properties)
  377. {
  378. // Now we have the complete property list, we can compile decorator properties and instance as appropriate.
  379. PropertyGroupMap decorator_definitions;
  380. BuildPropertyGroup(decorator_definitions, "decorator", properties);
  381. for (PropertyGroupMap::iterator i = decorator_definitions.begin(); i != decorator_definitions.end(); ++i)
  382. InstanceDecorator((*i).first, (*i).second.first, (*i).second.second);
  383. // Now go through all the pseudo-class properties ...
  384. for (PseudoClassPropertyMap::const_iterator pseudo_class_iterator = merged_pseudo_class_properties.begin(); pseudo_class_iterator != merged_pseudo_class_properties.end(); ++pseudo_class_iterator)
  385. {
  386. PropertyGroupMap pseudo_class_decorator_definitions;
  387. BuildPropertyGroup(pseudo_class_decorator_definitions, "decorator", (*pseudo_class_iterator).second, &decorator_definitions);
  388. for (PropertyGroupMap::iterator i = pseudo_class_decorator_definitions.begin(); i != pseudo_class_decorator_definitions.end(); ++i)
  389. InstanceDecorator((*i).first, (*i).second.first, (*i).second.second, (*pseudo_class_iterator).first);
  390. }
  391. }
  392. // Attempts to instance a decorator into a given list.
  393. bool ElementDefinition::InstanceDecorator(const String& name, const String& type, const PropertyDictionary& properties, const StringList& pseudo_classes)
  394. {
  395. Decorator* decorator = Factory::InstanceDecorator(type, properties);
  396. if (decorator == NULL)
  397. {
  398. Log::Message(Log::LT_WARNING, "Failed to instance decorator '%s' of type '%s'.", name.CString(), type.CString());
  399. return false;
  400. }
  401. if (pseudo_classes.empty())
  402. {
  403. if (decorator != NULL)
  404. decorators[name] = decorator;
  405. }
  406. else
  407. {
  408. PseudoClassDecoratorMap::iterator i = pseudo_class_decorators.find(pseudo_classes);
  409. if (i == pseudo_class_decorators.end())
  410. {
  411. DecoratorMap decorators;
  412. decorators[name] = decorator;
  413. pseudo_class_decorators[pseudo_classes] = decorators;
  414. }
  415. else
  416. (*i).second[name] = decorator;
  417. }
  418. return true;
  419. }
  420. // Builds font effect definitions from the parsed properties and instances font effects as appropriate.
  421. void ElementDefinition::InstanceFontEffects(const PseudoClassPropertyMap& merged_pseudo_class_properties)
  422. {
  423. // Now we have the complete property list, we can compile font-effect properties and instance as appropriate.
  424. PropertyGroupMap font_effect_definitions;
  425. BuildPropertyGroup(font_effect_definitions, "font-effect", properties);
  426. for (PropertyGroupMap::iterator i = font_effect_definitions.begin(); i != font_effect_definitions.end(); ++i)
  427. InstanceFontEffect((*i).first, (*i).second.first, (*i).second.second);
  428. // Now go through all the pseudo-class properties ...
  429. for (PseudoClassPropertyMap::const_iterator pseudo_class_iterator = merged_pseudo_class_properties.begin(); pseudo_class_iterator != merged_pseudo_class_properties.end(); ++pseudo_class_iterator)
  430. {
  431. PropertyGroupMap pseudo_class_font_effect_definitions;
  432. BuildPropertyGroup(pseudo_class_font_effect_definitions, "font-effect", (*pseudo_class_iterator).second, &font_effect_definitions);
  433. for (PropertyGroupMap::iterator i = pseudo_class_font_effect_definitions.begin(); i != pseudo_class_font_effect_definitions.end(); ++i)
  434. InstanceFontEffect((*i).first, (*i).second.first, (*i).second.second, (*pseudo_class_iterator).first);
  435. }
  436. }
  437. // Attempts to instance a font effect.
  438. bool ElementDefinition::InstanceFontEffect(const String& name, const String& type, const PropertyDictionary& properties, const StringList& pseudo_classes)
  439. {
  440. FontEffect* font_effect = FontDatabase::GetFontEffect(type, properties);
  441. if (font_effect == NULL)
  442. {
  443. Log::Message(Log::LT_WARNING, "Failed to instance font effect '%s' of type '%s'.", name.CString(), type.CString());
  444. return false;
  445. }
  446. // Push the instanced effect into the list of effects.
  447. int effect_index = (int) font_effects.size();
  448. font_effects.push_back(font_effect);
  449. // Get a reference to the index list we're adding this effect to.
  450. PseudoClassFontEffectIndex* index = NULL;
  451. FontEffectIndex::iterator index_iterator = font_effect_index.find(name);
  452. if (index_iterator == font_effect_index.end())
  453. {
  454. // No others; create a new index for this name.
  455. index = &(font_effect_index.insert(FontEffectIndex::value_type(name, PseudoClassFontEffectIndex())).first->second);
  456. }
  457. else
  458. {
  459. index = &(index_iterator->second);
  460. }
  461. // Add the new effect into the index.
  462. PseudoClassFontEffectIndex::iterator insert_iterator;
  463. for (insert_iterator = index->begin(); insert_iterator != index->end(); ++insert_iterator)
  464. {
  465. // Keep iterating until we find an effect whose specificity is below the new effect's. The
  466. // new effect will be inserted before it in the list.
  467. if (font_effects[insert_iterator->second]->GetSpecificity() < font_effect->GetSpecificity())
  468. break;
  469. }
  470. index->insert(insert_iterator, PseudoClassFontEffectIndex::value_type(pseudo_classes, effect_index));
  471. // Mark the effect's pseudo-classes as volatile.
  472. for (size_t i = 0; i < pseudo_classes.size(); ++i)
  473. {
  474. PseudoClassVolatilityMap::const_iterator j = pseudo_class_volatility.find(pseudo_classes[i]);
  475. if (j == pseudo_class_volatility.end())
  476. pseudo_class_volatility[pseudo_classes[i]] = FONT_VOLATILE;
  477. }
  478. return true;
  479. }
  480. // Returns true if the pseudo-class requirement of a rule is met by a list of an element's pseudo-classes.
  481. bool ElementDefinition::IsPseudoClassRuleApplicable(const StringList& rule_pseudo_classes, const PseudoClassList& element_pseudo_classes) const
  482. {
  483. for (StringList::size_type i = 0; i < rule_pseudo_classes.size(); ++i)
  484. {
  485. if (element_pseudo_classes.find(rule_pseudo_classes[i]) == element_pseudo_classes.end())
  486. return false;
  487. }
  488. return true;
  489. }
  490. }
  491. }