StyleInvalidator.cpp 3.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
  1. /*
  2. * Copyright (c) 2020, Linus Groh <mail@linusgroh.de>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <LibWeb/CSS/StyleInvalidator.h>
  27. #include <LibWeb/DOM/Document.h>
  28. #include <LibWeb/DOM/Element.h>
  29. namespace Web::CSS {
  30. StyleInvalidator::StyleInvalidator(DOM::Document& document)
  31. : m_document(document)
  32. {
  33. if (!m_document.should_invalidate_styles_on_attribute_changes())
  34. return;
  35. auto& style_resolver = m_document.style_resolver();
  36. m_document.for_each_in_subtree_of_type<DOM::Element>([&](auto& element) {
  37. m_elements_and_matching_rules_before.set(&element, style_resolver.collect_matching_rules(element));
  38. return IterationDecision::Continue;
  39. });
  40. }
  41. StyleInvalidator::~StyleInvalidator()
  42. {
  43. if (!m_document.should_invalidate_styles_on_attribute_changes())
  44. return;
  45. auto& style_resolver = m_document.style_resolver();
  46. m_document.for_each_in_subtree_of_type<DOM::Element>([&](auto& element) {
  47. auto maybe_matching_rules_before = m_elements_and_matching_rules_before.get(&element);
  48. if (!maybe_matching_rules_before.has_value()) {
  49. element.set_needs_style_update(true);
  50. return IterationDecision::Continue;
  51. }
  52. auto& matching_rules_before = maybe_matching_rules_before.value();
  53. auto matching_rules_after = style_resolver.collect_matching_rules(element);
  54. if (matching_rules_before.size() != matching_rules_after.size()) {
  55. element.set_needs_style_update(true);
  56. return IterationDecision::Continue;
  57. }
  58. style_resolver.sort_matching_rules(matching_rules_before);
  59. style_resolver.sort_matching_rules(matching_rules_after);
  60. for (size_t i = 0; i < matching_rules_before.size(); ++i) {
  61. if (matching_rules_before[i].rule != matching_rules_after[i].rule) {
  62. element.set_needs_style_update(true);
  63. break;
  64. }
  65. }
  66. return IterationDecision::Continue;
  67. });
  68. }
  69. }