TreeBuilder.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543
  1. /*
  2. * Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022, Sam Atkins <atkinssj@serenityos.org>
  4. * Copyright (c) 2022, MacDue <macdue@dueutil.tech>
  5. *
  6. * SPDX-License-Identifier: BSD-2-Clause
  7. */
  8. #include <AK/Optional.h>
  9. #include <AK/TemporaryChange.h>
  10. #include <LibWeb/DOM/Document.h>
  11. #include <LibWeb/DOM/Element.h>
  12. #include <LibWeb/DOM/ParentNode.h>
  13. #include <LibWeb/DOM/ShadowRoot.h>
  14. #include <LibWeb/Dump.h>
  15. #include <LibWeb/HTML/HTMLInputElement.h>
  16. #include <LibWeb/HTML/HTMLProgressElement.h>
  17. #include <LibWeb/Layout/InitialContainingBlock.h>
  18. #include <LibWeb/Layout/ListItemBox.h>
  19. #include <LibWeb/Layout/ListItemMarkerBox.h>
  20. #include <LibWeb/Layout/Node.h>
  21. #include <LibWeb/Layout/Progress.h>
  22. #include <LibWeb/Layout/TableBox.h>
  23. #include <LibWeb/Layout/TableCellBox.h>
  24. #include <LibWeb/Layout/TableRowBox.h>
  25. #include <LibWeb/Layout/TextNode.h>
  26. #include <LibWeb/Layout/TreeBuilder.h>
  27. #include <LibWeb/SVG/SVGForeignObjectElement.h>
  28. namespace Web::Layout {
  29. TreeBuilder::TreeBuilder() = default;
  30. static bool has_inline_or_in_flow_block_children(Layout::Node const& layout_node)
  31. {
  32. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  33. if (child->is_inline())
  34. return true;
  35. if (!child->is_floating() && !child->is_absolutely_positioned())
  36. return true;
  37. }
  38. return false;
  39. }
  40. static bool has_in_flow_block_children(Layout::Node const& layout_node)
  41. {
  42. if (layout_node.children_are_inline())
  43. return false;
  44. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  45. if (child->is_inline())
  46. continue;
  47. if (!child->is_floating() && !child->is_absolutely_positioned())
  48. return true;
  49. }
  50. return false;
  51. }
  52. // The insertion_parent_for_*() functions maintain the invariant that the in-flow children of
  53. // block-level boxes must be either all block-level or all inline-level.
  54. static Layout::Node& insertion_parent_for_inline_node(Layout::NodeWithStyle& layout_parent)
  55. {
  56. if (layout_parent.display().is_inline_outside() && layout_parent.display().is_flow_inside())
  57. return layout_parent;
  58. if (layout_parent.display().is_flex_inside()) {
  59. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  60. return *layout_parent.last_child();
  61. }
  62. if (!has_in_flow_block_children(layout_parent) || layout_parent.children_are_inline())
  63. return layout_parent;
  64. // Parent has block-level children, insert into an anonymous wrapper block (and create it first if needed)
  65. if (!layout_parent.last_child()->is_anonymous() || !layout_parent.last_child()->children_are_inline()) {
  66. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  67. }
  68. return *layout_parent.last_child();
  69. }
  70. static Layout::Node& insertion_parent_for_block_node(Layout::NodeWithStyle& layout_parent, Layout::Node& layout_node)
  71. {
  72. if (!has_inline_or_in_flow_block_children(layout_parent)) {
  73. // Parent block has no children, insert this block into parent.
  74. return layout_parent;
  75. }
  76. if ((layout_node.is_absolutely_positioned() || layout_node.is_floating()) && layout_parent.last_child()->children_are_inline() && layout_parent.last_child()->is_anonymous()) {
  77. return *layout_parent.last_child();
  78. }
  79. if (!layout_parent.children_are_inline()) {
  80. // Parent block has block-level children, insert this block into parent.
  81. return layout_parent;
  82. }
  83. if (layout_node.is_absolutely_positioned() || layout_node.is_floating()) {
  84. // Block is out-of-flow, it can have inline siblings if necessary.
  85. return layout_parent;
  86. }
  87. // Parent block has inline-level children (our siblings).
  88. // First move these siblings into an anonymous wrapper block.
  89. Vector<JS::Handle<Layout::Node>> children;
  90. while (JS::GCPtr<Layout::Node> child = layout_parent.first_child()) {
  91. layout_parent.remove_child(*child);
  92. children.append(*child);
  93. }
  94. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  95. layout_parent.set_children_are_inline(false);
  96. for (auto& child : children) {
  97. layout_parent.last_child()->append_child(*child);
  98. }
  99. layout_parent.last_child()->set_children_are_inline(true);
  100. // Then it's safe to insert this block into parent.
  101. return layout_parent;
  102. }
  103. void TreeBuilder::insert_node_into_inline_or_block_ancestor(Layout::Node& node, CSS::Display display, AppendOrPrepend mode)
  104. {
  105. if (display.is_inline_outside()) {
  106. // Inlines can be inserted into the nearest ancestor.
  107. auto& insertion_point = insertion_parent_for_inline_node(m_ancestor_stack.last());
  108. if (mode == AppendOrPrepend::Prepend)
  109. insertion_point.prepend_child(node);
  110. else
  111. insertion_point.append_child(node);
  112. insertion_point.set_children_are_inline(true);
  113. } else {
  114. // Non-inlines can't be inserted into an inline parent, so find the nearest non-inline ancestor.
  115. auto& nearest_non_inline_ancestor = [&]() -> Layout::NodeWithStyle& {
  116. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  117. if (!ancestor.display().is_inline_outside())
  118. return ancestor;
  119. if (!ancestor.display().is_flow_inside())
  120. return ancestor;
  121. if (ancestor.dom_node() && is<SVG::SVGForeignObjectElement>(*ancestor.dom_node()))
  122. return ancestor;
  123. }
  124. VERIFY_NOT_REACHED();
  125. }();
  126. auto& insertion_point = insertion_parent_for_block_node(nearest_non_inline_ancestor, node);
  127. if (mode == AppendOrPrepend::Prepend)
  128. insertion_point.prepend_child(node);
  129. else
  130. insertion_point.append_child(node);
  131. // After inserting an in-flow block-level box into a parent, mark the parent as having non-inline children.
  132. if (!node.is_floating() && !node.is_absolutely_positioned())
  133. insertion_point.set_children_are_inline(false);
  134. }
  135. }
  136. void TreeBuilder::create_pseudo_element_if_needed(DOM::Element& element, CSS::Selector::PseudoElement pseudo_element, AppendOrPrepend mode)
  137. {
  138. auto& document = element.document();
  139. auto& style_computer = document.style_computer();
  140. auto pseudo_element_style = style_computer.compute_style(element, pseudo_element);
  141. auto pseudo_element_content = pseudo_element_style->content();
  142. auto pseudo_element_display = pseudo_element_style->display();
  143. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  144. // We also don't create them if they are `display: none`.
  145. if (pseudo_element_display.is_none()
  146. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  147. || pseudo_element_content.type == CSS::ContentData::Type::None)
  148. return;
  149. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, pseudo_element_style, nullptr);
  150. if (!pseudo_element_node)
  151. return;
  152. pseudo_element_node->set_generated(true);
  153. // FIXME: Handle images, and multiple values
  154. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  155. auto* text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data);
  156. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  157. text_node->set_generated(true);
  158. push_parent(verify_cast<NodeWithStyle>(*pseudo_element_node));
  159. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  160. pop_parent();
  161. } else {
  162. TODO();
  163. }
  164. element.set_pseudo_element_node({}, pseudo_element, pseudo_element_node);
  165. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  166. }
  167. void TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  168. {
  169. // If the parent doesn't have a layout node, we don't need one either.
  170. if (dom_node.parent_or_shadow_host() && !dom_node.parent_or_shadow_host()->layout_node())
  171. return;
  172. Optional<TemporaryChange<bool>> has_svg_root_change;
  173. if (dom_node.is_svg_container()) {
  174. has_svg_root_change.emplace(context.has_svg_root, true);
  175. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  176. return;
  177. }
  178. auto& document = dom_node.document();
  179. auto& style_computer = document.style_computer();
  180. JS::GCPtr<Layout::Node> layout_node;
  181. RefPtr<CSS::StyleProperties> style;
  182. CSS::Display display;
  183. if (is<DOM::Element>(dom_node)) {
  184. auto& element = static_cast<DOM::Element&>(dom_node);
  185. element.clear_pseudo_element_nodes({});
  186. VERIFY(!element.needs_style_update());
  187. style = element.computed_css_values();
  188. display = style->display();
  189. if (display.is_none())
  190. return;
  191. layout_node = element.create_layout_node(*style);
  192. } else if (is<DOM::Document>(dom_node)) {
  193. style = style_computer.create_document_style();
  194. display = style->display();
  195. layout_node = document.heap().allocate_without_realm<Layout::InitialContainingBlock>(static_cast<DOM::Document&>(dom_node), *style);
  196. } else if (is<DOM::Text>(dom_node)) {
  197. layout_node = document.heap().allocate_without_realm<Layout::TextNode>(document, static_cast<DOM::Text&>(dom_node));
  198. display = CSS::Display(CSS::Display::Outside::Inline, CSS::Display::Inside::Flow);
  199. } else if (is<DOM::ShadowRoot>(dom_node)) {
  200. layout_node = document.heap().allocate_without_realm<Layout::BlockContainer>(document, &static_cast<DOM::ShadowRoot&>(dom_node), CSS::ComputedValues {});
  201. display = CSS::Display(CSS::Display::Outside::Block, CSS::Display::Inside::FlowRoot);
  202. }
  203. if (!layout_node)
  204. return;
  205. if (!dom_node.parent_or_shadow_host()) {
  206. m_layout_root = layout_node;
  207. } else if (layout_node->is_svg_box()) {
  208. m_ancestor_stack.last().append_child(*layout_node);
  209. } else {
  210. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  211. }
  212. auto* shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root() : nullptr;
  213. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children()) {
  214. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  215. if (shadow_root)
  216. create_layout_tree(*shadow_root, context);
  217. verify_cast<DOM::ParentNode>(dom_node).for_each_child([&](auto& dom_child) {
  218. create_layout_tree(dom_child, context);
  219. });
  220. pop_parent();
  221. }
  222. // Add nodes for the ::before and ::after pseudo-elements.
  223. if (is<DOM::Element>(dom_node)) {
  224. auto& element = static_cast<DOM::Element&>(dom_node);
  225. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  226. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Before, AppendOrPrepend::Prepend);
  227. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::After, AppendOrPrepend::Append);
  228. pop_parent();
  229. }
  230. if (is<ListItemBox>(*layout_node)) {
  231. auto& element = static_cast<DOM::Element&>(dom_node);
  232. int child_index = layout_node->parent()->index_of_child<ListItemBox>(*layout_node).value();
  233. auto marker_style = style_computer.compute_style(element, CSS::Selector::PseudoElement::Marker);
  234. auto list_item_marker = document.heap().allocate_without_realm<ListItemMarkerBox>(document, layout_node->computed_values().list_style_type(), child_index + 1, *marker_style);
  235. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  236. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Marker, list_item_marker);
  237. layout_node->append_child(*list_item_marker);
  238. }
  239. if (is<HTML::HTMLProgressElement>(dom_node)) {
  240. auto& progress = static_cast<HTML::HTMLProgressElement&>(dom_node);
  241. if (!progress.using_system_appearance()) {
  242. auto bar_style = style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressBar);
  243. bar_style->set_property(CSS::PropertyID::Display, CSS::IdentifierStyleValue::create(CSS::ValueID::InlineBlock));
  244. auto value_style = style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressValue);
  245. value_style->set_property(CSS::PropertyID::Display, CSS::IdentifierStyleValue::create(CSS::ValueID::Block));
  246. auto position = progress.position();
  247. value_style->set_property(CSS::PropertyID::Width, CSS::PercentageStyleValue::create(CSS::Percentage(position >= 0 ? round_to<int>(100 * position) : 0)));
  248. auto bar_display = bar_style->display();
  249. auto value_display = value_style->display();
  250. auto progress_bar = DOM::Element::create_layout_node_for_display_type(document, bar_display, bar_style, nullptr);
  251. auto progress_value = DOM::Element::create_layout_node_for_display_type(document, value_display, value_style, nullptr);
  252. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  253. push_parent(verify_cast<NodeWithStyle>(*progress_bar));
  254. insert_node_into_inline_or_block_ancestor(*progress_value, value_display, AppendOrPrepend::Append);
  255. pop_parent();
  256. insert_node_into_inline_or_block_ancestor(*progress_bar, bar_display, AppendOrPrepend::Append);
  257. pop_parent();
  258. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressBar, progress_bar);
  259. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressValue, progress_value);
  260. }
  261. }
  262. if (is<HTML::HTMLInputElement>(dom_node)) {
  263. auto& input_element = static_cast<HTML::HTMLInputElement&>(dom_node);
  264. if (auto placeholder_value = input_element.placeholder_value(); placeholder_value.has_value()) {
  265. auto placeholder_style = style_computer.compute_style(input_element, CSS::Selector::PseudoElement::Placeholder);
  266. auto placeholder = DOM::Element::create_layout_node_for_display_type(document, placeholder_style->display(), placeholder_style, nullptr);
  267. auto* text = document.heap().allocate<DOM::Text>(document.realm(), document, *placeholder_value);
  268. auto* text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  269. text_node->set_generated(true);
  270. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  271. push_parent(verify_cast<NodeWithStyle>(*placeholder));
  272. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  273. pop_parent();
  274. insert_node_into_inline_or_block_ancestor(*placeholder, placeholder->display(), AppendOrPrepend::Append);
  275. pop_parent();
  276. input_element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Placeholder, placeholder);
  277. }
  278. }
  279. }
  280. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  281. {
  282. VERIFY(dom_node.is_document());
  283. Context context;
  284. create_layout_tree(dom_node, context);
  285. if (auto* root = dom_node.document().layout_node())
  286. fixup_tables(*root);
  287. return move(m_layout_root);
  288. }
  289. template<CSS::Display::Internal internal, typename Callback>
  290. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  291. {
  292. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  293. auto const display = box.display();
  294. if (display.is_internal() && display.internal() == internal)
  295. callback(box);
  296. return IterationDecision::Continue;
  297. });
  298. }
  299. template<CSS::Display::Inside inside, typename Callback>
  300. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  301. {
  302. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  303. auto const display = box.display();
  304. if (display.is_outside_and_inside() && display.inside() == inside)
  305. callback(box);
  306. return IterationDecision::Continue;
  307. });
  308. }
  309. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  310. {
  311. remove_irrelevant_boxes(root);
  312. generate_missing_child_wrappers(root);
  313. generate_missing_parents(root);
  314. }
  315. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  316. {
  317. // The following boxes are discarded as if they were display:none:
  318. Vector<JS::Handle<Node>> to_remove;
  319. // Children of a table-column.
  320. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumn>(root, [&](Box& table_column) {
  321. table_column.for_each_child([&](auto& child) {
  322. to_remove.append(child);
  323. });
  324. });
  325. // Children of a table-column-group which are not a table-column.
  326. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumnGroup>(root, [&](Box& table_column_group) {
  327. table_column_group.for_each_child([&](auto& child) {
  328. if (child.display().is_table_column())
  329. to_remove.append(child);
  330. });
  331. });
  332. // FIXME:
  333. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  334. // Anonymous inline boxes which meet all of the following criteria:
  335. // - they contain only white space
  336. // - they are the first and/or last child of a tabular container
  337. // - whose immediate sibling, if any, is a table-non-root box
  338. for (auto& box : to_remove)
  339. box->parent()->remove_child(*box);
  340. }
  341. static bool is_table_track(CSS::Display display)
  342. {
  343. return display.is_table_row() || display.is_table_column();
  344. }
  345. static bool is_table_track_group(CSS::Display display)
  346. {
  347. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  348. // table-header-groups and table-footer-groups.
  349. return display.is_table_row_group()
  350. || display.is_table_header_group()
  351. || display.is_table_footer_group()
  352. || display.is_table_column_group();
  353. }
  354. static bool is_not_proper_table_child(Node const& node)
  355. {
  356. if (!node.has_style())
  357. return true;
  358. auto const display = node.display();
  359. return !is_table_track_group(display) && !is_table_track(display) && !display.is_table_caption();
  360. }
  361. static bool is_not_table_row(Node const& node)
  362. {
  363. if (!node.has_style())
  364. return true;
  365. auto const display = node.display();
  366. return !display.is_table_row();
  367. }
  368. static bool is_not_table_cell(Node const& node)
  369. {
  370. if (!node.has_style())
  371. return true;
  372. auto const display = node.display();
  373. return !display.is_table_cell();
  374. }
  375. static bool is_ignorable_whitespace(Layout::Node const& node)
  376. {
  377. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().is_whitespace())
  378. return true;
  379. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  380. bool contains_only_white_space = true;
  381. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  382. if (!text_node.text_for_rendering().is_whitespace()) {
  383. contains_only_white_space = false;
  384. return IterationDecision::Break;
  385. }
  386. return IterationDecision::Continue;
  387. });
  388. if (contains_only_white_space)
  389. return true;
  390. }
  391. return false;
  392. }
  393. template<typename Matcher, typename Callback>
  394. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  395. {
  396. Vector<JS::Handle<Node>> sequence;
  397. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  398. for (auto& node : sequence) {
  399. if (!is_ignorable_whitespace(*node))
  400. return false;
  401. }
  402. return true;
  403. };
  404. Node* next_sibling = nullptr;
  405. for (auto child = parent.first_child(); child; child = next_sibling) {
  406. next_sibling = child->next_sibling();
  407. if (matcher(*child)) {
  408. sequence.append(*child);
  409. } else {
  410. if (!sequence.is_empty()) {
  411. if (!sequence_is_all_ignorable_whitespace())
  412. callback(sequence, next_sibling);
  413. sequence.clear();
  414. }
  415. }
  416. }
  417. if (sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  418. callback(sequence, nullptr);
  419. }
  420. template<typename WrapperBoxType>
  421. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling)
  422. {
  423. VERIFY(!sequence.is_empty());
  424. auto& parent = *sequence.first()->parent();
  425. auto computed_values = parent.computed_values().clone_inherited_values();
  426. static_cast<CSS::MutableComputedValues&>(computed_values).set_display(WrapperBoxType::static_display());
  427. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  428. for (auto& child : sequence) {
  429. parent.remove_child(*child);
  430. wrapper->append_child(*child);
  431. }
  432. if (nearest_sibling)
  433. parent.insert_before(*wrapper, *nearest_sibling);
  434. else
  435. parent.append_child(*wrapper);
  436. }
  437. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  438. {
  439. // An anonymous table-row box must be generated around each sequence of consecutive children of a table-root box which are not proper table child boxes.
  440. for_each_in_tree_with_inside_display<CSS::Display::Inside::Table>(root, [&](auto& parent) {
  441. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  442. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  443. });
  444. });
  445. // An anonymous table-row box must be generated around each sequence of consecutive children of a table-row-group box which are not table-row boxes.
  446. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRowGroup>(root, [&](auto& parent) {
  447. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  448. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  449. });
  450. });
  451. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  452. // table-header-groups and table-footer-groups.
  453. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableHeaderGroup>(root, [&](auto& parent) {
  454. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  455. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  456. });
  457. });
  458. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableFooterGroup>(root, [&](auto& parent) {
  459. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  460. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  461. });
  462. });
  463. // An anonymous table-cell box must be generated around each sequence of consecutive children of a table-row box which are not table-cell boxes. !Testcase
  464. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRow>(root, [&](auto& parent) {
  465. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  466. wrap_in_anonymous<TableCellBox>(sequence, nearest_sibling);
  467. });
  468. });
  469. }
  470. void TreeBuilder::generate_missing_parents(NodeWithStyle&)
  471. {
  472. // FIXME: Implement.
  473. }
  474. }