ElementDefinition.cpp 22 KB

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